=============================================================================== 400069e4 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 400069e4: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 400069e8: 23 10 00 55 sethi %hi(0x40015400), %l1 400069ec: e0 04 60 44 ld [ %l1 + 0x44 ], %l0 ! 40015444 <_API_extensions_List> 400069f0: a2 14 60 44 or %l1, 0x44, %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400069f4: a2 04 60 04 add %l1, 4, %l1 400069f8: 80 a4 00 11 cmp %l0, %l1 400069fc: 02 80 00 09 be 40006a20 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 40006a00: 01 00 00 00 nop * Currently all APIs configure this hook so it is always non-NULL. */ #if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API) if ( the_extension->postdriver_hook ) #endif (*the_extension->postdriver_hook)(); 40006a04: c2 04 20 08 ld [ %l0 + 8 ], %g1 40006a08: 9f c0 40 00 call %g1 40006a0c: 01 00 00 00 nop Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 40006a10: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postdriver( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 40006a14: 80 a4 00 11 cmp %l0, %l1 40006a18: 32 bf ff fc bne,a 40006a08 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 40006a1c: c2 04 20 08 ld [ %l0 + 8 ], %g1 <== NOT EXECUTED 40006a20: 81 c7 e0 08 ret 40006a24: 81 e8 00 00 restore =============================================================================== 40006a28 <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 40006a28: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 40006a2c: 23 10 00 55 sethi %hi(0x40015400), %l1 40006a30: e0 04 60 44 ld [ %l1 + 0x44 ], %l0 ! 40015444 <_API_extensions_List> 40006a34: a2 14 60 44 or %l1, 0x44, %l1 40006a38: a2 04 60 04 add %l1, 4, %l1 40006a3c: 80 a4 00 11 cmp %l0, %l1 40006a40: 02 80 00 0a be 40006a68 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 40006a44: 25 10 00 55 sethi %hi(0x40015400), %l2 40006a48: a4 14 a0 7c or %l2, 0x7c, %l2 ! 4001547c <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 40006a4c: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40006a50: 9f c0 40 00 call %g1 40006a54: d0 04 a0 0c ld [ %l2 + 0xc ], %o0 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { 40006a58: e0 04 00 00 ld [ %l0 ], %l0 void _API_extensions_Run_postswitch( void ) { Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 40006a5c: 80 a4 00 11 cmp %l0, %l1 40006a60: 32 bf ff fc bne,a 40006a50 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 40006a64: c2 04 20 0c ld [ %l0 + 0xc ], %g1 <== NOT EXECUTED 40006a68: 81 c7 e0 08 ret 40006a6c: 81 e8 00 00 restore =============================================================================== 40017178 <_CORE_message_queue_Broadcast>: Objects_Id id __attribute__((unused)), CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)), #endif uint32_t *count ) { 40017178: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; uint32_t number_broadcasted; Thread_Wait_information *waitp; if ( size > the_message_queue->maximum_message_size ) { 4001717c: c2 06 20 4c ld [ %i0 + 0x4c ], %g1 Objects_Id id __attribute__((unused)), CORE_message_queue_API_mp_support_callout api_message_queue_mp_support __attribute__((unused)), #endif uint32_t *count ) { 40017180: a0 10 00 18 mov %i0, %l0 Thread_Control *the_thread; uint32_t number_broadcasted; Thread_Wait_information *waitp; if ( size > the_message_queue->maximum_message_size ) { 40017184: 80 a0 40 1a cmp %g1, %i2 40017188: 0a 80 00 17 bcs 400171e4 <_CORE_message_queue_Broadcast+0x6c><== NEVER TAKEN 4001718c: b0 10 20 01 mov 1, %i0 * NOTE: This check is critical because threads can block on * send and receive and this ensures that we are broadcasting * the message to threads waiting to receive -- not to send. */ if ( the_message_queue->number_of_pending_messages != 0 ) { 40017190: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 40017194: 80 a0 60 00 cmp %g1, 0 40017198: 02 80 00 0a be 400171c0 <_CORE_message_queue_Broadcast+0x48> 4001719c: a4 10 20 00 clr %l2 *count = 0; 400171a0: c0 27 40 00 clr [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 400171a4: 81 c7 e0 08 ret 400171a8: 91 e8 20 00 restore %g0, 0, %o0 const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 400171ac: d0 04 60 2c ld [ %l1 + 0x2c ], %o0 400171b0: 40 00 23 3b call 4001fe9c 400171b4: a4 04 a0 01 inc %l2 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 400171b8: c2 04 60 28 ld [ %l1 + 0x28 ], %g1 400171bc: f4 20 40 00 st %i2, [ %g1 ] /* * There must be no pending messages if there is a thread waiting to * receive a message. */ number_broadcasted = 0; while ((the_thread = 400171c0: 40 00 0a ba call 40019ca8 <_Thread_queue_Dequeue> 400171c4: 90 10 00 10 mov %l0, %o0 400171c8: 92 10 00 19 mov %i1, %o1 400171cc: a2 10 00 08 mov %o0, %l1 400171d0: 80 a2 20 00 cmp %o0, 0 400171d4: 12 bf ff f6 bne 400171ac <_CORE_message_queue_Broadcast+0x34> 400171d8: 94 10 00 1a mov %i2, %o2 if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_message_queue_mp_support) ( the_thread, id ); #endif } *count = number_broadcasted; 400171dc: e4 27 40 00 st %l2, [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 400171e0: b0 10 20 00 clr %i0 } 400171e4: 81 c7 e0 08 ret 400171e8: 81 e8 00 00 restore =============================================================================== 4001094c <_CORE_message_queue_Initialize>: CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 4001094c: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 40010950: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 40010954: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; the_message_queue->maximum_message_size = maximum_message_size; 40010958: f6 26 20 4c st %i3, [ %i0 + 0x4c ] CORE_message_queue_Control *the_message_queue, CORE_message_queue_Attributes *the_message_queue_attributes, uint32_t maximum_pending_messages, size_t maximum_message_size ) { 4001095c: a0 10 00 18 mov %i0, %l0 /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 40010960: 80 8e e0 03 btst 3, %i3 40010964: 02 80 00 07 be 40010980 <_CORE_message_queue_Initialize+0x34> 40010968: a4 10 00 1b mov %i3, %l2 allocated_message_size += sizeof(uint32_t); 4001096c: a4 06 e0 04 add %i3, 4, %l2 allocated_message_size &= ~(sizeof(uint32_t) - 1); 40010970: a4 0c bf fc and %l2, -4, %l2 } if (allocated_message_size < maximum_message_size) 40010974: 80 a6 c0 12 cmp %i3, %l2 40010978: 18 80 00 22 bgu 40010a00 <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 4001097c: b0 10 20 00 clr %i0 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 40010980: a2 04 a0 10 add %l2, 0x10, %l1 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 40010984: 92 10 00 1a mov %i2, %o1 40010988: 90 10 00 11 mov %l1, %o0 4001098c: 40 00 3f 46 call 400206a4 <.umul> 40010990: b0 10 20 00 clr %i0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 40010994: 80 a2 00 12 cmp %o0, %l2 40010998: 0a 80 00 1a bcs 40010a00 <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 4001099c: 01 00 00 00 nop /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 400109a0: 40 00 0c 46 call 40013ab8 <_Workspace_Allocate> 400109a4: 01 00 00 00 nop if (the_message_queue->message_buffers == 0) 400109a8: 80 a2 20 00 cmp %o0, 0 400109ac: 02 80 00 15 be 40010a00 <_CORE_message_queue_Initialize+0xb4> 400109b0: d0 24 20 5c st %o0, [ %l0 + 0x5c ] /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 400109b4: 92 10 00 08 mov %o0, %o1 400109b8: 94 10 00 1a mov %i2, %o2 400109bc: 96 10 00 11 mov %l1, %o3 400109c0: 40 00 14 f7 call 40015d9c <_Chain_Initialize> 400109c4: 90 04 20 60 add %l0, 0x60, %o0 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 400109c8: c4 06 40 00 ld [ %i1 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400109cc: 82 04 20 54 add %l0, 0x54, %g1 400109d0: 84 18 a0 01 xor %g2, 1, %g2 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 400109d4: c2 24 20 50 st %g1, [ %l0 + 0x50 ] 400109d8: 80 a0 00 02 cmp %g0, %g2 the_message_queue->message_buffers, (size_t) maximum_pending_messages, allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); 400109dc: 82 04 20 50 add %l0, 0x50, %g1 THREAD_QUEUE_DISCIPLINE_PRIORITY : THREAD_QUEUE_DISCIPLINE_FIFO, STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; 400109e0: b0 10 20 01 mov 1, %i0 the_chain->permanent_null = NULL; 400109e4: c0 24 20 54 clr [ %l0 + 0x54 ] allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 400109e8: 90 10 00 10 mov %l0, %o0 the_chain->last = _Chain_Head(the_chain); 400109ec: c2 24 20 58 st %g1, [ %l0 + 0x58 ] 400109f0: 92 60 3f ff subx %g0, -1, %o1 400109f4: 94 10 20 80 mov 0x80, %o2 400109f8: 40 00 08 e1 call 40012d7c <_Thread_queue_Initialize> 400109fc: 96 10 20 06 mov 6, %o3 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 40010a00: 81 c7 e0 08 ret 40010a04: 81 e8 00 00 restore =============================================================================== 40006d74 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 40006d74: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 40006d78: 21 10 00 54 sethi %hi(0x40015000), %l0 40006d7c: c2 04 22 18 ld [ %l0 + 0x218 ], %g1 ! 40015218 <_Thread_Dispatch_disable_level> 40006d80: 80 a0 60 00 cmp %g1, 0 40006d84: 02 80 00 05 be 40006d98 <_CORE_mutex_Seize+0x24> 40006d88: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 40006d8c: 80 8e a0 ff btst 0xff, %i2 40006d90: 12 80 00 1a bne 40006df8 <_CORE_mutex_Seize+0x84> <== ALWAYS TAKEN 40006d94: 03 10 00 54 sethi %hi(0x40015000), %g1 40006d98: 90 10 00 18 mov %i0, %o0 40006d9c: 40 00 14 16 call 4000bdf4 <_CORE_mutex_Seize_interrupt_trylock> 40006da0: 92 07 a0 54 add %fp, 0x54, %o1 40006da4: 80 a2 20 00 cmp %o0, 0 40006da8: 02 80 00 12 be 40006df0 <_CORE_mutex_Seize+0x7c> 40006dac: 80 8e a0 ff btst 0xff, %i2 40006db0: 02 80 00 1a be 40006e18 <_CORE_mutex_Seize+0xa4> 40006db4: 01 00 00 00 nop 40006db8: c4 04 22 18 ld [ %l0 + 0x218 ], %g2 40006dbc: 03 10 00 55 sethi %hi(0x40015400), %g1 40006dc0: c2 00 60 88 ld [ %g1 + 0x88 ], %g1 ! 40015488 <_Per_CPU_Information+0xc> RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 40006dc4: 86 10 20 01 mov 1, %g3 40006dc8: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 40006dcc: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 40006dd0: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 40006dd4: 82 00 a0 01 add %g2, 1, %g1 40006dd8: c2 24 22 18 st %g1, [ %l0 + 0x218 ] 40006ddc: 7f ff eb c3 call 40001ce8 40006de0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40006de4: 90 10 00 18 mov %i0, %o0 40006de8: 7f ff ff c0 call 40006ce8 <_CORE_mutex_Seize_interrupt_blocking> 40006dec: 92 10 00 1b mov %i3, %o1 40006df0: 81 c7 e0 08 ret 40006df4: 81 e8 00 00 restore 40006df8: c2 00 63 9c ld [ %g1 + 0x39c ], %g1 40006dfc: 80 a0 60 01 cmp %g1, 1 40006e00: 28 bf ff e7 bleu,a 40006d9c <_CORE_mutex_Seize+0x28> 40006e04: 90 10 00 18 mov %i0, %o0 40006e08: 90 10 20 00 clr %o0 40006e0c: 92 10 20 00 clr %o1 40006e10: 40 00 01 da call 40007578 <_Internal_error_Occurred> 40006e14: 94 10 20 12 mov 0x12, %o2 40006e18: 7f ff eb b4 call 40001ce8 40006e1c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40006e20: 03 10 00 55 sethi %hi(0x40015400), %g1 40006e24: c2 00 60 88 ld [ %g1 + 0x88 ], %g1 ! 40015488 <_Per_CPU_Information+0xc> 40006e28: 84 10 20 01 mov 1, %g2 40006e2c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 40006e30: 81 c7 e0 08 ret 40006e34: 81 e8 00 00 restore =============================================================================== 4000bdf4 <_CORE_mutex_Seize_interrupt_trylock>: #if defined(__RTEMS_DO_NOT_INLINE_CORE_MUTEX_SEIZE__) int _CORE_mutex_Seize_interrupt_trylock( CORE_mutex_Control *the_mutex, ISR_Level *level_p ) { 4000bdf4: 9d e3 bf a0 save %sp, -96, %sp { Thread_Control *executing; /* disabled when you get here */ executing = _Thread_Executing; 4000bdf8: 03 10 00 55 sethi %hi(0x40015400), %g1 4000bdfc: c2 00 60 88 ld [ %g1 + 0x88 ], %g1 ! 40015488 <_Per_CPU_Information+0xc> executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 4000be00: c4 06 20 50 ld [ %i0 + 0x50 ], %g2 Thread_Control *executing; /* disabled when you get here */ executing = _Thread_Executing; executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; 4000be04: c0 20 60 34 clr [ %g1 + 0x34 ] if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 4000be08: 80 a0 a0 00 cmp %g2, 0 4000be0c: 02 80 00 13 be 4000be58 <_CORE_mutex_Seize_interrupt_trylock+0x64> 4000be10: a0 10 00 18 mov %i0, %l0 the_mutex->lock = CORE_MUTEX_LOCKED; the_mutex->holder = executing; the_mutex->holder_id = executing->Object.id; 4000be14: c8 00 60 08 ld [ %g1 + 8 ], %g4 return _CORE_mutex_Seize_interrupt_trylock_body( the_mutex, level_p ); } 4000be18: c4 06 20 48 ld [ %i0 + 0x48 ], %g2 the_mutex->nest_count = 1; 4000be1c: 86 10 20 01 mov 1, %g3 /* disabled when you get here */ executing = _Thread_Executing; executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; if ( !_CORE_mutex_Is_locked( the_mutex ) ) { the_mutex->lock = CORE_MUTEX_LOCKED; 4000be20: c0 26 20 50 clr [ %i0 + 0x50 ] the_mutex->holder = executing; 4000be24: c2 26 20 5c st %g1, [ %i0 + 0x5c ] the_mutex->holder_id = executing->Object.id; 4000be28: c8 26 20 60 st %g4, [ %i0 + 0x60 ] the_mutex->nest_count = 1; if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 4000be2c: 80 a0 a0 02 cmp %g2, 2 4000be30: 02 80 00 10 be 4000be70 <_CORE_mutex_Seize_interrupt_trylock+0x7c> 4000be34: c6 26 20 54 st %g3, [ %i0 + 0x54 ] 4000be38: 80 a0 a0 03 cmp %g2, 3 4000be3c: 22 80 00 21 be,a 4000bec0 <_CORE_mutex_Seize_interrupt_trylock+0xcc> 4000be40: da 00 60 1c ld [ %g1 + 0x1c ], %o5 executing->resource_count++; } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 4000be44: d0 06 40 00 ld [ %i1 ], %o0 4000be48: 7f ff d7 a8 call 40001ce8 4000be4c: b0 10 20 00 clr %i0 4000be50: 81 c7 e0 08 ret 4000be54: 81 e8 00 00 restore /* * At this point, we know the mutex was not available. If this thread * is the thread that has locked the mutex, let's see if we are allowed * to nest access. */ if ( _Thread_Is_executing( the_mutex->holder ) ) { 4000be58: c4 06 20 5c ld [ %i0 + 0x5c ], %g2 4000be5c: 80 a0 40 02 cmp %g1, %g2 4000be60: 02 80 00 0c be 4000be90 <_CORE_mutex_Seize_interrupt_trylock+0x9c> 4000be64: b0 10 20 01 mov 1, %i0 4000be68: 81 c7 e0 08 ret 4000be6c: 81 e8 00 00 restore _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 4000be70: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 4000be74: 84 00 a0 01 inc %g2 4000be78: c4 20 60 1c st %g2, [ %g1 + 0x1c ] } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 4000be7c: d0 06 40 00 ld [ %i1 ], %o0 4000be80: 7f ff d7 9a call 40001ce8 4000be84: b0 10 20 00 clr %i0 4000be88: 81 c7 e0 08 ret 4000be8c: 81 e8 00 00 restore * At this point, we know the mutex was not available. If this thread * is the thread that has locked the mutex, let's see if we are allowed * to nest access. */ if ( _Thread_Is_executing( the_mutex->holder ) ) { switch ( the_mutex->Attributes.lock_nesting_behavior ) { 4000be90: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 4000be94: 80 a0 a0 00 cmp %g2, 0 4000be98: 12 80 00 2b bne 4000bf44 <_CORE_mutex_Seize_interrupt_trylock+0x150> 4000be9c: 80 a0 a0 01 cmp %g2, 1 case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; 4000bea0: c2 04 20 54 ld [ %l0 + 0x54 ], %g1 4000bea4: 82 00 60 01 inc %g1 4000bea8: c2 24 20 54 st %g1, [ %l0 + 0x54 ] _ISR_Enable( *level_p ); 4000beac: d0 06 40 00 ld [ %i1 ], %o0 4000beb0: 7f ff d7 8e call 40001ce8 4000beb4: b0 10 20 00 clr %i0 4000beb8: 81 c7 e0 08 ret 4000bebc: 81 e8 00 00 restore */ { Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; 4000bec0: c8 06 20 4c ld [ %i0 + 0x4c ], %g4 current = executing->current_priority; 4000bec4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 _Chain_Prepend_unprotected( &executing->lock_mutex, &the_mutex->queue.lock_queue ); the_mutex->queue.priority_before = executing->current_priority; #endif executing->resource_count++; 4000bec8: 98 03 60 01 add %o5, 1, %o4 Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; current = executing->current_priority; if ( current == ceiling ) { 4000becc: 80 a1 00 02 cmp %g4, %g2 4000bed0: 02 80 00 25 be 4000bf64 <_CORE_mutex_Seize_interrupt_trylock+0x170> 4000bed4: d8 20 60 1c st %o4, [ %g1 + 0x1c ] _ISR_Enable( *level_p ); return 0; } if ( current > ceiling ) { 4000bed8: 80 a1 00 02 cmp %g4, %g2 4000bedc: 1a 80 00 11 bcc 4000bf20 <_CORE_mutex_Seize_interrupt_trylock+0x12c> 4000bee0: 84 10 20 06 mov 6, %g2 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 4000bee4: 03 10 00 54 sethi %hi(0x40015000), %g1 4000bee8: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 40015218 <_Thread_Dispatch_disable_level> 4000beec: 84 00 a0 01 inc %g2 4000bef0: c4 20 62 18 st %g2, [ %g1 + 0x218 ] _Thread_Disable_dispatch(); _ISR_Enable( *level_p ); 4000bef4: 7f ff d7 7d call 40001ce8 4000bef8: d0 06 40 00 ld [ %i1 ], %o0 _Thread_Change_priority( 4000befc: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 4000bf00: d2 06 20 4c ld [ %i0 + 0x4c ], %o1 4000bf04: 94 10 20 00 clr %o2 4000bf08: 7f ff f0 1c call 40007f78 <_Thread_Change_priority> 4000bf0c: b0 10 20 00 clr %i0 the_mutex->holder, the_mutex->Attributes.priority_ceiling, false ); _Thread_Enable_dispatch(); 4000bf10: 7f ff f1 91 call 40008554 <_Thread_Enable_dispatch> 4000bf14: 01 00 00 00 nop 4000bf18: 81 c7 e0 08 ret 4000bf1c: 81 e8 00 00 restore return 0; } /* if ( current < ceiling ) */ { executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED; 4000bf20: c4 20 60 34 st %g2, [ %g1 + 0x34 ] the_mutex->lock = CORE_MUTEX_UNLOCKED; 4000bf24: c6 26 20 50 st %g3, [ %i0 + 0x50 ] the_mutex->nest_count = 0; /* undo locking above */ 4000bf28: c0 26 20 54 clr [ %i0 + 0x54 ] executing->resource_count--; /* undo locking above */ 4000bf2c: da 20 60 1c st %o5, [ %g1 + 0x1c ] _ISR_Enable( *level_p ); 4000bf30: d0 06 40 00 ld [ %i1 ], %o0 4000bf34: 7f ff d7 6d call 40001ce8 4000bf38: b0 10 20 00 clr %i0 4000bf3c: 81 c7 e0 08 ret 4000bf40: 81 e8 00 00 restore * At this point, we know the mutex was not available. If this thread * is the thread that has locked the mutex, let's see if we are allowed * to nest access. */ if ( _Thread_Is_executing( the_mutex->holder ) ) { switch ( the_mutex->Attributes.lock_nesting_behavior ) { 4000bf44: 12 bf ff c3 bne 4000be50 <_CORE_mutex_Seize_interrupt_trylock+0x5c><== ALWAYS TAKEN 4000bf48: 84 10 20 02 mov 2, %g2 case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; _ISR_Enable( *level_p ); return 0; case CORE_MUTEX_NESTING_IS_ERROR: executing->Wait.return_code = CORE_MUTEX_STATUS_NESTING_NOT_ALLOWED; 4000bf4c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] <== NOT EXECUTED _ISR_Enable( *level_p ); 4000bf50: d0 06 40 00 ld [ %i1 ], %o0 <== NOT EXECUTED 4000bf54: 7f ff d7 65 call 40001ce8 <== NOT EXECUTED 4000bf58: b0 10 20 00 clr %i0 <== NOT EXECUTED 4000bf5c: 81 c7 e0 08 ret <== NOT EXECUTED 4000bf60: 81 e8 00 00 restore <== NOT EXECUTED Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; current = executing->current_priority; if ( current == ceiling ) { _ISR_Enable( *level_p ); 4000bf64: d0 06 40 00 ld [ %i1 ], %o0 4000bf68: 7f ff d7 60 call 40001ce8 4000bf6c: b0 10 20 00 clr %i0 4000bf70: 81 c7 e0 08 ret 4000bf74: 81 e8 00 00 restore =============================================================================== 40006fb4 <_CORE_semaphore_Surrender>: CORE_semaphore_Status _CORE_semaphore_Surrender( CORE_semaphore_Control *the_semaphore, Objects_Id id, CORE_semaphore_API_mp_support_callout api_semaphore_mp_support ) { 40006fb4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 40006fb8: 90 10 00 18 mov %i0, %o0 40006fbc: 40 00 06 43 call 400088c8 <_Thread_queue_Dequeue> 40006fc0: a0 10 00 18 mov %i0, %l0 40006fc4: 80 a2 20 00 cmp %o0, 0 40006fc8: 12 80 00 0e bne 40007000 <_CORE_semaphore_Surrender+0x4c> 40006fcc: b0 10 20 00 clr %i0 if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 40006fd0: 7f ff eb 42 call 40001cd8 40006fd4: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 40006fd8: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 40006fdc: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 40006fe0: 80 a0 40 02 cmp %g1, %g2 40006fe4: 1a 80 00 05 bcc 40006ff8 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 40006fe8: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 40006fec: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 40006ff0: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 40006ff4: c2 24 20 48 st %g1, [ %l0 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 40006ff8: 7f ff eb 3c call 40001ce8 40006ffc: 01 00 00 00 nop } return status; } 40007000: 81 c7 e0 08 ret 40007004: 81 e8 00 00 restore =============================================================================== 4000bd90 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 4000bd90: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *current; Chain_Node *next; count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; 4000bd94: c0 26 20 04 clr [ %i0 + 4 ] */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Head( Chain_Control *the_chain ) { return (Chain_Node *) the_chain; 4000bd98: 90 10 00 18 mov %i0, %o0 next = starting_address; 4000bd9c: 84 10 00 1a mov %i2, %g2 while ( count-- ) { 4000bda0: 80 a6 a0 00 cmp %i2, 0 4000bda4: 12 80 00 06 bne 4000bdbc <_Chain_Initialize+0x2c> <== ALWAYS TAKEN 4000bda8: 82 10 00 19 mov %i1, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000bdac: 10 80 00 0e b 4000bde4 <_Chain_Initialize+0x54> <== NOT EXECUTED 4000bdb0: 82 06 20 04 add %i0, 4, %g1 <== NOT EXECUTED 4000bdb4: 90 10 00 01 mov %g1, %o0 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 4000bdb8: 82 10 00 03 mov %g3, %g1 count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; while ( count-- ) { current->next = next; 4000bdbc: c2 22 00 00 st %g1, [ %o0 ] next->previous = current; 4000bdc0: d0 20 60 04 st %o0, [ %g1 + 4 ] count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; while ( count-- ) { 4000bdc4: 84 80 bf ff addcc %g2, -1, %g2 4000bdc8: 12 bf ff fb bne 4000bdb4 <_Chain_Initialize+0x24> 4000bdcc: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 4000bdd0: 90 06 bf ff add %i2, -1, %o0 4000bdd4: 40 00 16 ad call 40011888 <.umul> 4000bdd8: 92 10 00 1b mov %i3, %o1 count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; while ( count-- ) { 4000bddc: 90 06 40 08 add %i1, %o0, %o0 4000bde0: 82 06 20 04 add %i0, 4, %g1 next->previous = current; current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = _Chain_Tail( the_chain ); 4000bde4: c2 22 00 00 st %g1, [ %o0 ] the_chain->last = current; 4000bde8: d0 26 20 08 st %o0, [ %i0 + 8 ] } 4000bdec: 81 c7 e0 08 ret 4000bdf0: 81 e8 00 00 restore =============================================================================== 40005b0c <_Event_Seize>: rtems_event_set event_in, rtems_option option_set, rtems_interval ticks, rtems_event_set *event_out ) { 40005b0c: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set pending_events; ISR_Level level; RTEMS_API_Control *api; Thread_blocking_operation_States sync_state; executing = _Thread_Executing; 40005b10: 03 10 00 55 sethi %hi(0x40015400), %g1 40005b14: e0 00 60 88 ld [ %g1 + 0x88 ], %l0 ! 40015488 <_Per_CPU_Information+0xc> executing->Wait.return_code = RTEMS_SUCCESSFUL; 40005b18: c0 24 20 34 clr [ %l0 + 0x34 ] api = executing->API_Extensions[ THREAD_API_RTEMS ]; _ISR_Disable( level ); 40005b1c: 7f ff f0 6f call 40001cd8 40005b20: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 pending_events = api->pending_events; 40005b24: c2 04 80 00 ld [ %l2 ], %g1 seized_events = _Event_sets_Get( pending_events, event_in ); if ( !_Event_sets_Is_empty( seized_events ) && 40005b28: a2 8e 00 01 andcc %i0, %g1, %l1 40005b2c: 02 80 00 09 be 40005b50 <_Event_Seize+0x44> 40005b30: 80 8e 60 01 btst 1, %i1 40005b34: 80 a6 00 11 cmp %i0, %l1 40005b38: 02 80 00 26 be 40005bd0 <_Event_Seize+0xc4> 40005b3c: 82 28 40 11 andn %g1, %l1, %g1 (seized_events == event_in || _Options_Is_any( option_set )) ) { 40005b40: 80 8e 60 02 btst 2, %i1 40005b44: 32 80 00 24 bne,a 40005bd4 <_Event_Seize+0xc8> <== ALWAYS TAKEN 40005b48: c2 24 80 00 st %g1, [ %l2 ] _ISR_Enable( level ); *event_out = seized_events; return; } if ( _Options_Is_no_wait( option_set ) ) { 40005b4c: 80 8e 60 01 btst 1, %i1 <== NOT EXECUTED 40005b50: 12 80 00 19 bne 40005bb4 <_Event_Seize+0xa8> 40005b54: 01 00 00 00 nop * set properly when we are marked as in the event critical section. * * NOTE: Since interrupts are disabled, this isn't that much of an * issue but better safe than sorry. */ executing->Wait.option = (uint32_t) option_set; 40005b58: f2 24 20 30 st %i1, [ %l0 + 0x30 ] executing->Wait.count = (uint32_t) event_in; 40005b5c: f0 24 20 24 st %i0, [ %l0 + 0x24 ] executing->Wait.return_argument = event_out; 40005b60: f6 24 20 28 st %i3, [ %l0 + 0x28 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 40005b64: 33 10 00 55 sethi %hi(0x40015400), %i1 40005b68: 82 10 20 01 mov 1, %g1 40005b6c: c2 26 60 98 st %g1, [ %i1 + 0x98 ] _ISR_Enable( level ); 40005b70: 7f ff f0 5e call 40001ce8 40005b74: 01 00 00 00 nop if ( ticks ) { 40005b78: 80 a6 a0 00 cmp %i2, 0 40005b7c: 32 80 00 1b bne,a 40005be8 <_Event_Seize+0xdc> 40005b80: c2 04 20 08 ld [ %l0 + 8 ], %g1 NULL ); _Watchdog_Insert_ticks( &executing->Timer, ticks ); } _Thread_Set_state( executing, STATES_WAITING_FOR_EVENT ); 40005b84: 90 10 00 10 mov %l0, %o0 40005b88: 40 00 0c e7 call 40008f24 <_Thread_Set_state> 40005b8c: 92 10 21 00 mov 0x100, %o1 _ISR_Disable( level ); 40005b90: 7f ff f0 52 call 40001cd8 40005b94: 01 00 00 00 nop sync_state = _Event_Sync_state; 40005b98: f0 06 60 98 ld [ %i1 + 0x98 ], %i0 _Event_Sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; 40005b9c: c0 26 60 98 clr [ %i1 + 0x98 ] if ( sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) { 40005ba0: 80 a6 20 01 cmp %i0, 1 40005ba4: 02 80 00 1e be 40005c1c <_Event_Seize+0x110> 40005ba8: b2 10 00 10 mov %l0, %i1 * An interrupt completed the thread's blocking request. * The blocking thread was satisfied by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ _Thread_blocking_operation_Cancel( sync_state, executing, level ); 40005bac: 40 00 08 dc call 40007f1c <_Thread_blocking_operation_Cancel> 40005bb0: 95 e8 00 08 restore %g0, %o0, %o2 *event_out = seized_events; return; } if ( _Options_Is_no_wait( option_set ) ) { _ISR_Enable( level ); 40005bb4: 7f ff f0 4d call 40001ce8 40005bb8: 01 00 00 00 nop executing->Wait.return_code = RTEMS_UNSATISFIED; 40005bbc: 82 10 20 0d mov 0xd, %g1 ! d 40005bc0: c2 24 20 34 st %g1, [ %l0 + 0x34 ] *event_out = seized_events; 40005bc4: e2 26 c0 00 st %l1, [ %i3 ] 40005bc8: 81 c7 e0 08 ret 40005bcc: 81 e8 00 00 restore pending_events = api->pending_events; seized_events = _Event_sets_Get( pending_events, event_in ); if ( !_Event_sets_Is_empty( seized_events ) && (seized_events == event_in || _Options_Is_any( option_set )) ) { api->pending_events = 40005bd0: c2 24 80 00 st %g1, [ %l2 ] _Event_sets_Clear( pending_events, seized_events ); _ISR_Enable( level ); 40005bd4: 7f ff f0 45 call 40001ce8 40005bd8: 01 00 00 00 nop *event_out = seized_events; 40005bdc: e2 26 c0 00 st %l1, [ %i3 ] return; 40005be0: 81 c7 e0 08 ret 40005be4: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40005be8: 05 10 00 17 sethi %hi(0x40005c00), %g2 40005bec: 84 10 a1 cc or %g2, 0x1cc, %g2 ! 40005dcc <_Event_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 40005bf0: c0 24 20 50 clr [ %l0 + 0x50 ] the_watchdog->routine = routine; 40005bf4: c4 24 20 64 st %g2, [ %l0 + 0x64 ] the_watchdog->id = id; 40005bf8: c2 24 20 68 st %g1, [ %l0 + 0x68 ] the_watchdog->user_data = user_data; 40005bfc: c0 24 20 6c clr [ %l0 + 0x6c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40005c00: f4 24 20 54 st %i2, [ %l0 + 0x54 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40005c04: 11 10 00 54 sethi %hi(0x40015000), %o0 40005c08: 92 04 20 48 add %l0, 0x48, %o1 40005c0c: 40 00 0e c8 call 4000972c <_Watchdog_Insert> 40005c10: 90 12 22 dc or %o0, 0x2dc, %o0 NULL ); _Watchdog_Insert_ticks( &executing->Timer, ticks ); } _Thread_Set_state( executing, STATES_WAITING_FOR_EVENT ); 40005c14: 10 bf ff dd b 40005b88 <_Event_Seize+0x7c> 40005c18: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); sync_state = _Event_Sync_state; _Event_Sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) { _ISR_Enable( level ); 40005c1c: 7f ff f0 33 call 40001ce8 40005c20: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 40005c84 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 40005c84: 9d e3 bf a0 save %sp, -96, %sp rtems_event_set event_condition; rtems_event_set seized_events; rtems_option option_set; RTEMS_API_Control *api; api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 40005c88: e0 06 21 5c ld [ %i0 + 0x15c ], %l0 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 40005c8c: 7f ff f0 13 call 40001cd8 40005c90: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 40005c94: a2 10 00 08 mov %o0, %l1 pending_events = api->pending_events; 40005c98: c4 04 00 00 ld [ %l0 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 40005c9c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 40005ca0: 86 88 40 02 andcc %g1, %g2, %g3 40005ca4: 02 80 00 3e be 40005d9c <_Event_Surrender+0x118> 40005ca8: 09 10 00 55 sethi %hi(0x40015400), %g4 /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 40005cac: 88 11 20 7c or %g4, 0x7c, %g4 ! 4001547c <_Per_CPU_Information> 40005cb0: da 01 20 08 ld [ %g4 + 8 ], %o5 40005cb4: 80 a3 60 00 cmp %o5, 0 40005cb8: 32 80 00 1d bne,a 40005d2c <_Event_Surrender+0xa8> 40005cbc: c8 01 20 0c ld [ %g4 + 0xc ], %g4 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_EVENT); 40005cc0: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 40005cc4: 80 89 21 00 btst 0x100, %g4 40005cc8: 02 80 00 33 be 40005d94 <_Event_Surrender+0x110> 40005ccc: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 40005cd0: 02 80 00 04 be 40005ce0 <_Event_Surrender+0x5c> 40005cd4: 80 8c a0 02 btst 2, %l2 40005cd8: 02 80 00 2f be 40005d94 <_Event_Surrender+0x110> <== NEVER TAKEN 40005cdc: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events, seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40005ce0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear( rtems_event_set the_event_set, rtems_event_set the_mask ) { return ( the_event_set & ~(the_mask) ); 40005ce4: 84 28 80 03 andn %g2, %g3, %g2 /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 40005ce8: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 40005cec: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40005cf0: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 40005cf4: 7f ff ef fd call 40001ce8 40005cf8: 90 10 00 11 mov %l1, %o0 40005cfc: 7f ff ef f7 call 40001cd8 40005d00: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 40005d04: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 40005d08: 80 a0 60 02 cmp %g1, 2 40005d0c: 02 80 00 26 be 40005da4 <_Event_Surrender+0x120> 40005d10: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 40005d14: 90 10 00 11 mov %l1, %o0 40005d18: 7f ff ef f4 call 40001ce8 40005d1c: 33 04 00 ff sethi %hi(0x1003fc00), %i1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40005d20: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 40005d24: 40 00 09 18 call 40008184 <_Thread_Clear_state> 40005d28: 81 e8 00 00 restore /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && 40005d2c: 80 a6 00 04 cmp %i0, %g4 40005d30: 32 bf ff e5 bne,a 40005cc4 <_Event_Surrender+0x40> 40005d34: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 40005d38: 09 10 00 55 sethi %hi(0x40015400), %g4 40005d3c: da 01 20 98 ld [ %g4 + 0x98 ], %o5 ! 40015498 <_Event_Sync_state> /* * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && 40005d40: 80 a3 60 02 cmp %o5, 2 40005d44: 02 80 00 07 be 40005d60 <_Event_Surrender+0xdc> <== NEVER TAKEN 40005d48: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 40005d4c: da 01 20 98 ld [ %g4 + 0x98 ], %o5 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 40005d50: 80 a3 60 01 cmp %o5, 1 40005d54: 32 bf ff dc bne,a 40005cc4 <_Event_Surrender+0x40> 40005d58: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 40005d5c: 80 a0 40 03 cmp %g1, %g3 40005d60: 02 80 00 04 be 40005d70 <_Event_Surrender+0xec> 40005d64: 80 8c a0 02 btst 2, %l2 40005d68: 02 80 00 09 be 40005d8c <_Event_Surrender+0x108> <== NEVER TAKEN 40005d6c: 01 00 00 00 nop api->pending_events = _Event_sets_Clear( pending_events,seized_events ); the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40005d70: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 40005d74: 84 28 80 03 andn %g2, %g3, %g2 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 40005d78: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 40005d7c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40005d80: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 40005d84: 82 10 20 03 mov 3, %g1 40005d88: c2 21 20 98 st %g1, [ %g4 + 0x98 ] } _ISR_Enable( level ); 40005d8c: 7f ff ef d7 call 40001ce8 40005d90: 91 e8 00 11 restore %g0, %l1, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 40005d94: 7f ff ef d5 call 40001ce8 40005d98: 91 e8 00 11 restore %g0, %l1, %o0 /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { _ISR_Enable( level ); 40005d9c: 7f ff ef d3 call 40001ce8 40005da0: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 40005da4: c2 26 20 50 st %g1, [ %i0 + 0x50 ] if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 40005da8: 7f ff ef d0 call 40001ce8 40005dac: 90 10 00 11 mov %l1, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 40005db0: 40 00 0e c9 call 400098d4 <_Watchdog_Remove> 40005db4: 90 06 20 48 add %i0, 0x48, %o0 40005db8: 33 04 00 ff sethi %hi(0x1003fc00), %i1 40005dbc: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 40005dc0: 40 00 08 f1 call 40008184 <_Thread_Clear_state> 40005dc4: 81 e8 00 00 restore =============================================================================== 40005dcc <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 40005dcc: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 40005dd0: 90 10 00 18 mov %i0, %o0 40005dd4: 40 00 09 ee call 4000858c <_Thread_Get> 40005dd8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40005ddc: c2 07 bf fc ld [ %fp + -4 ], %g1 40005de0: 80 a0 60 00 cmp %g1, 0 40005de4: 12 80 00 15 bne 40005e38 <_Event_Timeout+0x6c> <== NEVER TAKEN 40005de8: a0 10 00 08 mov %o0, %l0 * * If it is not satisfied, then it is "nothing happened" and * this is the "timeout" transition. After a request is satisfied, * a timeout is not allowed to occur. */ _ISR_Disable( level ); 40005dec: 7f ff ef bb call 40001cd8 40005df0: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 40005df4: 03 10 00 55 sethi %hi(0x40015400), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 40005df8: c2 00 60 88 ld [ %g1 + 0x88 ], %g1 ! 40015488 <_Per_CPU_Information+0xc> 40005dfc: 80 a4 00 01 cmp %l0, %g1 40005e00: 02 80 00 10 be 40005e40 <_Event_Timeout+0x74> 40005e04: c0 24 20 24 clr [ %l0 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; } the_thread->Wait.return_code = RTEMS_TIMEOUT; 40005e08: 82 10 20 06 mov 6, %g1 40005e0c: c2 24 20 34 st %g1, [ %l0 + 0x34 ] _ISR_Enable( level ); 40005e10: 7f ff ef b6 call 40001ce8 40005e14: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40005e18: 90 10 00 10 mov %l0, %o0 40005e1c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 40005e20: 40 00 08 d9 call 40008184 <_Thread_Clear_state> 40005e24: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 40005e28: 03 10 00 54 sethi %hi(0x40015000), %g1 40005e2c: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 40015218 <_Thread_Dispatch_disable_level> 40005e30: 84 00 bf ff add %g2, -1, %g2 40005e34: c4 20 62 18 st %g2, [ %g1 + 0x218 ] 40005e38: 81 c7 e0 08 ret 40005e3c: 81 e8 00 00 restore } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 40005e40: 03 10 00 55 sethi %hi(0x40015400), %g1 40005e44: c4 00 60 98 ld [ %g1 + 0x98 ], %g2 ! 40015498 <_Event_Sync_state> 40005e48: 80 a0 a0 01 cmp %g2, 1 40005e4c: 32 bf ff f0 bne,a 40005e0c <_Event_Timeout+0x40> 40005e50: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 40005e54: 84 10 20 02 mov 2, %g2 40005e58: c4 20 60 98 st %g2, [ %g1 + 0x98 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 40005e5c: 10 bf ff ec b 40005e0c <_Event_Timeout+0x40> 40005e60: 82 10 20 06 mov 6, %g1 =============================================================================== 4000bff4 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 4000bff4: 9d e3 bf 98 save %sp, -104, %sp 4000bff8: a0 10 00 18 mov %i0, %l0 Heap_Statistics *const stats = &heap->stats; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *block = _Heap_Free_list_first( heap ); uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 4000bffc: a4 06 60 04 add %i1, 4, %l2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 4000c000: e8 06 20 08 ld [ %i0 + 8 ], %l4 Heap_Statistics *const stats = &heap->stats; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *block = _Heap_Free_list_first( heap ); uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE - HEAP_BLOCK_SIZE_OFFSET; uintptr_t const page_size = heap->page_size; 4000c004: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 uintptr_t alloc_begin = 0; uint32_t search_count = 0; if ( block_size_floor < alloc_size ) { 4000c008: 80 a6 40 12 cmp %i1, %l2 4000c00c: 18 80 00 62 bgu 4000c194 <_Heap_Allocate_aligned_with_boundary+0x1a0> 4000c010: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 4000c014: 80 a6 e0 00 cmp %i3, 0 4000c018: 12 80 00 70 bne 4000c1d8 <_Heap_Allocate_aligned_with_boundary+0x1e4> 4000c01c: 80 a6 40 1b cmp %i1, %i3 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 4000c020: 80 a4 00 14 cmp %l0, %l4 4000c024: 02 80 00 5c be 4000c194 <_Heap_Allocate_aligned_with_boundary+0x1a0> 4000c028: b0 10 20 00 clr %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 4000c02c: 82 07 60 07 add %i5, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; 4000c030: b8 10 20 04 mov 4, %i4 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 4000c034: a2 10 20 00 clr %l1 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 4000c038: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; 4000c03c: b8 27 00 19 sub %i4, %i1, %i4 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 4000c040: e6 05 20 04 ld [ %l4 + 4 ], %l3 4000c044: 80 a4 80 13 cmp %l2, %l3 4000c048: 1a 80 00 4a bcc 4000c170 <_Heap_Allocate_aligned_with_boundary+0x17c> 4000c04c: a2 04 60 01 inc %l1 if ( alignment == 0 ) { 4000c050: 80 a6 a0 00 cmp %i2, 0 4000c054: 02 80 00 44 be 4000c164 <_Heap_Allocate_aligned_with_boundary+0x170> 4000c058: b0 05 20 08 add %l4, 8, %i0 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 4000c05c: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 4000c060: ee 04 20 14 ld [ %l0 + 0x14 ], %l7 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000c064: a6 0c ff fe and %l3, -2, %l3 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 4000c068: 82 20 80 17 sub %g2, %l7, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 4000c06c: a6 05 00 13 add %l4, %l3, %l3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000c070: 92 10 00 1a mov %i2, %o1 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_BLOCK_SIZE_OFFSET; uintptr_t alloc_begin = alloc_end - alloc_size; 4000c074: b0 07 00 13 add %i4, %l3, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 4000c078: a6 00 40 13 add %g1, %l3, %l3 4000c07c: 40 00 16 e9 call 40011c20 <.urem> 4000c080: 90 10 00 18 mov %i0, %o0 4000c084: b0 26 00 08 sub %i0, %o0, %i0 uintptr_t alloc_begin = alloc_end - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { 4000c088: 80 a4 c0 18 cmp %l3, %i0 4000c08c: 1a 80 00 06 bcc 4000c0a4 <_Heap_Allocate_aligned_with_boundary+0xb0> 4000c090: ac 05 20 08 add %l4, 8, %l6 4000c094: 90 10 00 13 mov %l3, %o0 4000c098: 40 00 16 e2 call 40011c20 <.urem> 4000c09c: 92 10 00 1a mov %i2, %o1 4000c0a0: b0 24 c0 08 sub %l3, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 4000c0a4: 80 a6 e0 00 cmp %i3, 0 4000c0a8: 02 80 00 24 be 4000c138 <_Heap_Allocate_aligned_with_boundary+0x144> 4000c0ac: 80 a5 80 18 cmp %l6, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 4000c0b0: a6 06 00 19 add %i0, %i1, %l3 4000c0b4: 92 10 00 1b mov %i3, %o1 4000c0b8: 40 00 16 da call 40011c20 <.urem> 4000c0bc: 90 10 00 13 mov %l3, %o0 4000c0c0: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 4000c0c4: 80 a6 00 08 cmp %i0, %o0 4000c0c8: 1a 80 00 1b bcc 4000c134 <_Heap_Allocate_aligned_with_boundary+0x140> 4000c0cc: 80 a2 00 13 cmp %o0, %l3 4000c0d0: 1a 80 00 1a bcc 4000c138 <_Heap_Allocate_aligned_with_boundary+0x144> 4000c0d4: 80 a5 80 18 cmp %l6, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 4000c0d8: aa 05 80 19 add %l6, %i1, %l5 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 4000c0dc: 80 a5 40 08 cmp %l5, %o0 4000c0e0: 28 80 00 09 bleu,a 4000c104 <_Heap_Allocate_aligned_with_boundary+0x110> 4000c0e4: b0 22 00 19 sub %o0, %i1, %i0 if ( alloc_begin != 0 ) { break; } block = block->next; 4000c0e8: 10 80 00 23 b 4000c174 <_Heap_Allocate_aligned_with_boundary+0x180> 4000c0ec: e8 05 20 08 ld [ %l4 + 8 ], %l4 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 4000c0f0: 1a 80 00 11 bcc 4000c134 <_Heap_Allocate_aligned_with_boundary+0x140> 4000c0f4: 80 a5 40 08 cmp %l5, %o0 if ( boundary_line < boundary_floor ) { 4000c0f8: 38 80 00 1f bgu,a 4000c174 <_Heap_Allocate_aligned_with_boundary+0x180><== NEVER TAKEN 4000c0fc: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED return 0; } alloc_begin = boundary_line - alloc_size; 4000c100: b0 22 00 19 sub %o0, %i1, %i0 4000c104: 92 10 00 1a mov %i2, %o1 4000c108: 40 00 16 c6 call 40011c20 <.urem> 4000c10c: 90 10 00 18 mov %i0, %o0 4000c110: 92 10 00 1b mov %i3, %o1 4000c114: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 4000c118: a6 06 00 19 add %i0, %i1, %l3 4000c11c: 40 00 16 c1 call 40011c20 <.urem> 4000c120: 90 10 00 13 mov %l3, %o0 4000c124: 90 24 c0 08 sub %l3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 4000c128: 80 a2 00 13 cmp %o0, %l3 4000c12c: 0a bf ff f1 bcs 4000c0f0 <_Heap_Allocate_aligned_with_boundary+0xfc> 4000c130: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 4000c134: 80 a5 80 18 cmp %l6, %i0 4000c138: 38 80 00 0f bgu,a 4000c174 <_Heap_Allocate_aligned_with_boundary+0x180> 4000c13c: e8 05 20 08 ld [ %l4 + 8 ], %l4 4000c140: 82 10 3f f8 mov -8, %g1 4000c144: 90 10 00 18 mov %i0, %o0 4000c148: a6 20 40 14 sub %g1, %l4, %l3 4000c14c: 92 10 00 1d mov %i5, %o1 4000c150: 40 00 16 b4 call 40011c20 <.urem> 4000c154: a6 04 c0 18 add %l3, %i0, %l3 uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; if ( free_size >= min_block_size || free_size == 0 ) { 4000c158: 90 a4 c0 08 subcc %l3, %o0, %o0 4000c15c: 12 80 00 10 bne 4000c19c <_Heap_Allocate_aligned_with_boundary+0x1a8> 4000c160: 80 a2 00 17 cmp %o0, %l7 boundary ); } } if ( alloc_begin != 0 ) { 4000c164: 80 a6 20 00 cmp %i0, 0 4000c168: 32 80 00 13 bne,a 4000c1b4 <_Heap_Allocate_aligned_with_boundary+0x1c0><== ALWAYS TAKEN 4000c16c: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 break; } block = block->next; 4000c170: e8 05 20 08 ld [ %l4 + 8 ], %l4 if ( alignment == 0 ) { alignment = page_size; } } while ( block != free_list_tail ) { 4000c174: 80 a4 00 14 cmp %l0, %l4 4000c178: 32 bf ff b3 bne,a 4000c044 <_Heap_Allocate_aligned_with_boundary+0x50> 4000c17c: e6 05 20 04 ld [ %l4 + 4 ], %l3 4000c180: b0 10 20 00 clr %i0 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 4000c184: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 4000c188: 80 a0 40 11 cmp %g1, %l1 4000c18c: 2a 80 00 02 bcs,a 4000c194 <_Heap_Allocate_aligned_with_boundary+0x1a0> 4000c190: e2 24 20 44 st %l1, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 4000c194: 81 c7 e0 08 ret 4000c198: 81 e8 00 00 restore if ( alloc_begin >= alloc_begin_floor ) { uintptr_t const alloc_block_begin = (uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size ); uintptr_t const free_size = alloc_block_begin - block_begin; if ( free_size >= min_block_size || free_size == 0 ) { 4000c19c: 2a bf ff f6 bcs,a 4000c174 <_Heap_Allocate_aligned_with_boundary+0x180> 4000c1a0: e8 05 20 08 ld [ %l4 + 8 ], %l4 boundary ); } } if ( alloc_begin != 0 ) { 4000c1a4: 80 a6 20 00 cmp %i0, 0 4000c1a8: 22 bf ff f3 be,a 4000c174 <_Heap_Allocate_aligned_with_boundary+0x180><== NEVER TAKEN 4000c1ac: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 4000c1b0: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 4000c1b4: 90 10 00 10 mov %l0, %o0 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 4000c1b8: 82 00 40 11 add %g1, %l1, %g1 block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 4000c1bc: 92 10 00 14 mov %l4, %o1 block = block->next; } if ( alloc_begin != 0 ) { /* Statistics */ stats->searches += search_count; 4000c1c0: c2 24 20 4c st %g1, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 4000c1c4: 94 10 00 18 mov %i0, %o2 4000c1c8: 7f ff ec a0 call 40007448 <_Heap_Block_allocate> 4000c1cc: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 4000c1d0: 10 bf ff ee b 4000c188 <_Heap_Allocate_aligned_with_boundary+0x194> 4000c1d4: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 4000c1d8: 18 bf ff ef bgu 4000c194 <_Heap_Allocate_aligned_with_boundary+0x1a0> 4000c1dc: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 4000c1e0: 22 bf ff 90 be,a 4000c020 <_Heap_Allocate_aligned_with_boundary+0x2c> 4000c1e4: b4 10 00 1d mov %i5, %i2 alignment = page_size; } } while ( block != free_list_tail ) { 4000c1e8: 10 bf ff 8f b 4000c024 <_Heap_Allocate_aligned_with_boundary+0x30> 4000c1ec: 80 a4 00 14 cmp %l0, %l4 =============================================================================== 4000c4e8 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 4000c4e8: 9d e3 bf 98 save %sp, -104, %sp Heap_Block *start_block = first_block; Heap_Block *merge_below_block = NULL; Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; 4000c4ec: c0 27 bf fc clr [ %fp + -4 ] Heap_Block *extend_last_block = NULL; 4000c4f0: c0 27 bf f8 clr [ %fp + -8 ] Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 4000c4f4: a0 10 00 18 mov %i0, %l0 Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; 4000c4f8: a2 06 40 1a add %i1, %i2, %l1 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 4000c4fc: e4 06 20 20 ld [ %i0 + 0x20 ], %l2 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 4000c500: e6 06 20 10 ld [ %i0 + 0x10 ], %l3 uintptr_t const min_block_size = heap->min_block_size; 4000c504: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 4000c508: e8 06 20 30 ld [ %i0 + 0x30 ], %l4 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 4000c50c: 80 a6 40 11 cmp %i1, %l1 4000c510: 18 80 00 86 bgu 4000c728 <_Heap_Extend+0x240> 4000c514: b0 10 20 00 clr %i0 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 4000c518: 90 10 00 19 mov %i1, %o0 4000c51c: 92 10 00 1a mov %i2, %o1 4000c520: 94 10 00 13 mov %l3, %o2 4000c524: 98 07 bf fc add %fp, -4, %o4 4000c528: 7f ff eb d9 call 4000748c <_Heap_Get_first_and_last_block> 4000c52c: 9a 07 bf f8 add %fp, -8, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 4000c530: 80 8a 20 ff btst 0xff, %o0 4000c534: 02 80 00 7d be 4000c728 <_Heap_Extend+0x240> 4000c538: ba 10 20 00 clr %i5 4000c53c: b0 10 00 12 mov %l2, %i0 4000c540: b8 10 20 00 clr %i4 4000c544: ac 10 20 00 clr %l6 4000c548: 10 80 00 14 b 4000c598 <_Heap_Extend+0xb0> 4000c54c: ae 10 20 00 clr %l7 return false; } if ( extend_area_end == sub_area_begin ) { merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 4000c550: 2a 80 00 02 bcs,a 4000c558 <_Heap_Extend+0x70> 4000c554: b8 10 00 18 mov %i0, %i4 4000c558: 90 10 00 15 mov %l5, %o0 4000c55c: 40 00 17 00 call 4001215c <.urem> 4000c560: 92 10 00 13 mov %l3, %o1 4000c564: 82 05 7f f8 add %l5, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 4000c568: 80 a5 40 19 cmp %l5, %i1 4000c56c: 02 80 00 1c be 4000c5dc <_Heap_Extend+0xf4> 4000c570: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 4000c574: 80 a6 40 15 cmp %i1, %l5 4000c578: 38 80 00 02 bgu,a 4000c580 <_Heap_Extend+0x98> 4000c57c: ba 10 00 01 mov %g1, %i5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000c580: f0 00 60 04 ld [ %g1 + 4 ], %i0 4000c584: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000c588: b0 00 40 18 add %g1, %i0, %i0 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 4000c58c: 80 a4 80 18 cmp %l2, %i0 4000c590: 22 80 00 1b be,a 4000c5fc <_Heap_Extend+0x114> 4000c594: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 4000c598: 80 a6 00 12 cmp %i0, %l2 4000c59c: 02 80 00 65 be 4000c730 <_Heap_Extend+0x248> 4000c5a0: 82 10 00 18 mov %i0, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 4000c5a4: 80 a0 40 11 cmp %g1, %l1 4000c5a8: 0a 80 00 6f bcs 4000c764 <_Heap_Extend+0x27c> 4000c5ac: ea 06 00 00 ld [ %i0 ], %l5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 4000c5b0: 80 a0 40 11 cmp %g1, %l1 4000c5b4: 12 bf ff e7 bne 4000c550 <_Heap_Extend+0x68> 4000c5b8: 80 a4 40 15 cmp %l1, %l5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000c5bc: 90 10 00 15 mov %l5, %o0 4000c5c0: 40 00 16 e7 call 4001215c <.urem> 4000c5c4: 92 10 00 13 mov %l3, %o1 4000c5c8: 82 05 7f f8 add %l5, -8, %g1 4000c5cc: ae 10 00 18 mov %i0, %l7 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 4000c5d0: 80 a5 40 19 cmp %l5, %i1 4000c5d4: 12 bf ff e8 bne 4000c574 <_Heap_Extend+0x8c> <== ALWAYS TAKEN 4000c5d8: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 4000c5dc: e2 26 00 00 st %l1, [ %i0 ] - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000c5e0: f0 00 60 04 ld [ %g1 + 4 ], %i0 4000c5e4: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000c5e8: b0 00 40 18 add %g1, %i0, %i0 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 4000c5ec: 80 a4 80 18 cmp %l2, %i0 4000c5f0: 12 bf ff ea bne 4000c598 <_Heap_Extend+0xb0> <== NEVER TAKEN 4000c5f4: ac 10 00 01 mov %g1, %l6 if ( extend_area_begin < heap->area_begin ) { 4000c5f8: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 4000c5fc: 80 a6 40 01 cmp %i1, %g1 4000c600: 3a 80 00 54 bcc,a 4000c750 <_Heap_Extend+0x268> 4000c604: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 4000c608: f2 24 20 18 st %i1, [ %l0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 4000c60c: c2 07 bf fc ld [ %fp + -4 ], %g1 4000c610: c4 07 bf f8 ld [ %fp + -8 ], %g2 extend_first_block_size | HEAP_PREV_BLOCK_USED; extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 4000c614: c8 04 20 20 ld [ %l0 + 0x20 ], %g4 heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 4000c618: 86 20 80 01 sub %g2, %g1, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; 4000c61c: e2 20 40 00 st %l1, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 4000c620: 9a 10 e0 01 or %g3, 1, %o5 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 4000c624: da 20 60 04 st %o5, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; extend_last_block->prev_size = extend_first_block_size; 4000c628: c6 20 80 00 st %g3, [ %g2 ] extend_last_block->size_and_flag = 0; if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 4000c62c: 80 a1 00 01 cmp %g4, %g1 4000c630: 08 80 00 42 bleu 4000c738 <_Heap_Extend+0x250> 4000c634: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 4000c638: c2 24 20 20 st %g1, [ %l0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 4000c63c: 80 a5 e0 00 cmp %l7, 0 4000c640: 02 80 00 62 be 4000c7c8 <_Heap_Extend+0x2e0> 4000c644: b2 06 60 08 add %i1, 8, %i1 Heap_Control *heap, uintptr_t extend_area_begin, Heap_Block *first_block ) { uintptr_t const page_size = heap->page_size; 4000c648: e4 04 20 10 ld [ %l0 + 0x10 ], %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 4000c64c: 92 10 00 12 mov %l2, %o1 4000c650: 40 00 16 c3 call 4001215c <.urem> 4000c654: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 4000c658: 80 a2 20 00 cmp %o0, 0 4000c65c: 02 80 00 04 be 4000c66c <_Heap_Extend+0x184> <== ALWAYS TAKEN 4000c660: c4 05 c0 00 ld [ %l7 ], %g2 return value - remainder + alignment; 4000c664: b2 06 40 12 add %i1, %l2, %i1 <== NOT EXECUTED 4000c668: b2 26 40 08 sub %i1, %o0, %i1 <== NOT EXECUTED uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = 4000c66c: 82 06 7f f8 add %i1, -8, %g1 uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; 4000c670: c4 26 7f f8 st %g2, [ %i1 + -8 ] uintptr_t const new_first_block_alloc_begin = _Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size ); uintptr_t const new_first_block_begin = new_first_block_alloc_begin - HEAP_BLOCK_HEADER_SIZE; uintptr_t const first_block_begin = (uintptr_t) first_block; uintptr_t const new_first_block_size = 4000c674: 84 25 c0 01 sub %l7, %g1, %g2 first_block_begin - new_first_block_begin; Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin; new_first_block->prev_size = first_block->prev_size; new_first_block->size_and_flag = new_first_block_size | HEAP_PREV_BLOCK_USED; 4000c678: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 4000c67c: 90 10 00 10 mov %l0, %o0 4000c680: 92 10 00 01 mov %g1, %o1 4000c684: 7f ff ff 8e call 4000c4bc <_Heap_Free_block> 4000c688: c4 20 60 04 st %g2, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 4000c68c: 80 a5 a0 00 cmp %l6, 0 4000c690: 02 80 00 3a be 4000c778 <_Heap_Extend+0x290> 4000c694: a2 04 7f f8 add %l1, -8, %l1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000c698: d2 04 20 10 ld [ %l0 + 0x10 ], %o1 uintptr_t extend_area_end ) { uintptr_t const page_size = heap->page_size; uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const last_block_new_size = _Heap_Align_down( 4000c69c: a2 24 40 16 sub %l1, %l6, %l1 4000c6a0: 40 00 16 af call 4001215c <.urem> 4000c6a4: 90 10 00 11 mov %l1, %o0 ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = (last_block->size_and_flag - last_block_new_size) 4000c6a8: c2 05 a0 04 ld [ %l6 + 4 ], %g1 4000c6ac: a2 24 40 08 sub %l1, %o0, %l1 4000c6b0: 82 20 40 11 sub %g1, %l1, %g1 | HEAP_PREV_BLOCK_USED; 4000c6b4: 82 10 60 01 or %g1, 1, %g1 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 4000c6b8: 84 04 40 16 add %l1, %l6, %g2 4000c6bc: c2 20 a0 04 st %g1, [ %g2 + 4 ] RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c6c0: c2 05 a0 04 ld [ %l6 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 4000c6c4: 90 10 00 10 mov %l0, %o0 4000c6c8: 82 08 60 01 and %g1, 1, %g1 4000c6cc: 92 10 00 16 mov %l6, %o1 block->size_and_flag = size | flag; 4000c6d0: a2 14 40 01 or %l1, %g1, %l1 4000c6d4: 7f ff ff 7a call 4000c4bc <_Heap_Free_block> 4000c6d8: e2 25 a0 04 st %l1, [ %l6 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000c6dc: 80 a5 a0 00 cmp %l6, 0 4000c6e0: 02 80 00 33 be 4000c7ac <_Heap_Extend+0x2c4> 4000c6e4: 80 a5 e0 00 cmp %l7, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000c6e8: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 4000c6ec: da 04 20 20 ld [ %l0 + 0x20 ], %o5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c6f0: c8 00 60 04 ld [ %g1 + 4 ], %g4 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 4000c6f4: c4 04 20 2c ld [ %l0 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 4000c6f8: c6 04 20 30 ld [ %l0 + 0x30 ], %g3 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 4000c6fc: 9a 23 40 01 sub %o5, %g1, %o5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c700: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 4000c704: 88 13 40 04 or %o5, %g4, %g4 4000c708: c8 20 60 04 st %g4, [ %g1 + 4 ] 4000c70c: a8 20 c0 14 sub %g3, %l4, %l4 /* Statistics */ stats->size += extended_size; 4000c710: 82 00 80 14 add %g2, %l4, %g1 4000c714: c2 24 20 2c st %g1, [ %l0 + 0x2c ] if ( extended_size_ptr != NULL ) 4000c718: 80 a6 e0 00 cmp %i3, 0 4000c71c: 02 80 00 03 be 4000c728 <_Heap_Extend+0x240> <== NEVER TAKEN 4000c720: b0 10 20 01 mov 1, %i0 *extended_size_ptr = extended_size; 4000c724: e8 26 c0 00 st %l4, [ %i3 ] 4000c728: 81 c7 e0 08 ret 4000c72c: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 4000c730: 10 bf ff 9d b 4000c5a4 <_Heap_Extend+0xbc> 4000c734: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 4000c738: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 4000c73c: 80 a0 40 02 cmp %g1, %g2 4000c740: 2a bf ff bf bcs,a 4000c63c <_Heap_Extend+0x154> 4000c744: c4 24 20 24 st %g2, [ %l0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 4000c748: 10 bf ff be b 4000c640 <_Heap_Extend+0x158> 4000c74c: 80 a5 e0 00 cmp %l7, 0 start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); if ( extend_area_begin < heap->area_begin ) { heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { 4000c750: 80 a4 40 01 cmp %l1, %g1 4000c754: 38 bf ff ae bgu,a 4000c60c <_Heap_Extend+0x124> 4000c758: e2 24 20 1c st %l1, [ %l0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 4000c75c: 10 bf ff ad b 4000c610 <_Heap_Extend+0x128> 4000c760: c2 07 bf fc ld [ %fp + -4 ], %g1 (uintptr_t) start_block : heap->area_begin; uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 4000c764: 80 a6 40 15 cmp %i1, %l5 4000c768: 1a bf ff 93 bcc 4000c5b4 <_Heap_Extend+0xcc> 4000c76c: 80 a0 40 11 cmp %g1, %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000c770: 81 c7 e0 08 ret 4000c774: 91 e8 20 00 restore %g0, 0, %o0 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 4000c778: 80 a7 60 00 cmp %i5, 0 4000c77c: 02 bf ff d8 be 4000c6dc <_Heap_Extend+0x1f4> 4000c780: c4 07 bf fc ld [ %fp + -4 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c784: c6 07 60 04 ld [ %i5 + 4 ], %g3 _Heap_Link_above( 4000c788: c2 07 bf f8 ld [ %fp + -8 ], %g1 4000c78c: 86 08 e0 01 and %g3, 1, %g3 ) { uintptr_t const link_begin = (uintptr_t) link; uintptr_t const first_block_begin = (uintptr_t) first_block; _Heap_Block_set_size( link, first_block_begin - link_begin ); 4000c790: 84 20 80 1d sub %g2, %i5, %g2 block->size_and_flag = size | flag; 4000c794: 84 10 80 03 or %g2, %g3, %g2 4000c798: c4 27 60 04 st %g2, [ %i5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 4000c79c: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000c7a0: 84 10 a0 01 or %g2, 1, %g2 4000c7a4: 10 bf ff ce b 4000c6dc <_Heap_Extend+0x1f4> 4000c7a8: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000c7ac: 32 bf ff d0 bne,a 4000c6ec <_Heap_Extend+0x204> 4000c7b0: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 4000c7b4: d2 07 bf fc ld [ %fp + -4 ], %o1 4000c7b8: 7f ff ff 41 call 4000c4bc <_Heap_Free_block> 4000c7bc: 90 10 00 10 mov %l0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000c7c0: 10 bf ff cb b 4000c6ec <_Heap_Extend+0x204> 4000c7c4: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 4000c7c8: 80 a7 20 00 cmp %i4, 0 4000c7cc: 02 bf ff b1 be 4000c690 <_Heap_Extend+0x1a8> 4000c7d0: 80 a5 a0 00 cmp %l6, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 4000c7d4: b8 27 00 02 sub %i4, %g2, %i4 4000c7d8: b8 17 20 01 or %i4, 1, %i4 ) { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = 4000c7dc: 10 bf ff ad b 4000c690 <_Heap_Extend+0x1a8> 4000c7e0: f8 20 a0 04 st %i4, [ %g2 + 4 ] =============================================================================== 4000c1f0 <_Heap_Free>: #include #include #include bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 4000c1f0: 9d e3 bf a0 save %sp, -96, %sp 4000c1f4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 4000c1f8: 40 00 16 8a call 40011c20 <.urem> 4000c1fc: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 4000c200: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 4000c204: a0 10 00 18 mov %i0, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4000c208: a2 06 7f f8 add %i1, -8, %l1 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 4000c20c: 90 24 40 08 sub %l1, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4000c210: 80 a2 00 01 cmp %o0, %g1 4000c214: 0a 80 00 4d bcs 4000c348 <_Heap_Free+0x158> 4000c218: b0 10 20 00 clr %i0 4000c21c: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 4000c220: 80 a2 00 03 cmp %o0, %g3 4000c224: 18 80 00 49 bgu 4000c348 <_Heap_Free+0x158> 4000c228: 01 00 00 00 nop --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000c22c: da 02 20 04 ld [ %o0 + 4 ], %o5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000c230: 88 0b 7f fe and %o5, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000c234: 84 02 00 04 add %o0, %g4, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4000c238: 80 a0 40 02 cmp %g1, %g2 4000c23c: 18 80 00 43 bgu 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c240: 80 a0 c0 02 cmp %g3, %g2 4000c244: 0a 80 00 41 bcs 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c248: 01 00 00 00 nop 4000c24c: d8 00 a0 04 ld [ %g2 + 4 ], %o4 if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { _HAssert( false ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 4000c250: 80 8b 20 01 btst 1, %o4 4000c254: 02 80 00 3d be 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c258: 96 0b 3f fe and %o4, -2, %o3 return false; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 4000c25c: 80 a0 c0 02 cmp %g3, %g2 4000c260: 02 80 00 06 be 4000c278 <_Heap_Free+0x88> 4000c264: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000c268: 98 00 80 0b add %g2, %o3, %o4 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c26c: d8 03 20 04 ld [ %o4 + 4 ], %o4 4000c270: 98 0b 20 01 and %o4, 1, %o4 #include #include #include bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 4000c274: 98 1b 20 01 xor %o4, 1, %o4 next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 4000c278: 80 8b 60 01 btst 1, %o5 4000c27c: 12 80 00 1d bne 4000c2f0 <_Heap_Free+0x100> 4000c280: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 4000c284: d4 02 00 00 ld [ %o0 ], %o2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 4000c288: 9a 22 00 0a sub %o0, %o2, %o5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4000c28c: 80 a0 40 0d cmp %g1, %o5 4000c290: 18 80 00 2e bgu 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c294: b0 10 20 00 clr %i0 4000c298: 80 a0 c0 0d cmp %g3, %o5 4000c29c: 0a 80 00 2b bcs 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c2a0: 01 00 00 00 nop block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 4000c2a4: c2 03 60 04 ld [ %o5 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 4000c2a8: 80 88 60 01 btst 1, %g1 4000c2ac: 02 80 00 27 be 4000c348 <_Heap_Free+0x158> <== NEVER TAKEN 4000c2b0: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 4000c2b4: 22 80 00 39 be,a 4000c398 <_Heap_Free+0x1a8> 4000c2b8: 94 01 00 0a add %g4, %o2, %o2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000c2bc: c2 00 a0 08 ld [ %g2 + 8 ], %g1 4000c2c0: c4 00 a0 0c ld [ %g2 + 0xc ], %g2 } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 4000c2c4: c6 04 20 38 ld [ %l0 + 0x38 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; Heap_Block *prev = block->prev; prev->next = next; 4000c2c8: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 4000c2cc: c4 20 60 0c st %g2, [ %g1 + 0xc ] 4000c2d0: 82 00 ff ff add %g3, -1, %g1 4000c2d4: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; 4000c2d8: 96 01 00 0b add %g4, %o3, %o3 4000c2dc: 94 02 c0 0a add %o3, %o2, %o2 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000c2e0: 82 12 a0 01 or %o2, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 4000c2e4: d4 23 40 0a st %o2, [ %o5 + %o2 ] if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000c2e8: 10 80 00 0e b 4000c320 <_Heap_Free+0x130> 4000c2ec: c2 23 60 04 st %g1, [ %o5 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 4000c2f0: 22 80 00 18 be,a 4000c350 <_Heap_Free+0x160> 4000c2f4: c6 04 20 08 ld [ %l0 + 8 ], %g3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000c2f8: c6 00 a0 08 ld [ %g2 + 8 ], %g3 4000c2fc: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 4000c300: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = prev; 4000c304: c2 22 20 0c st %g1, [ %o0 + 0xc ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; 4000c308: 96 02 c0 04 add %o3, %g4, %o3 next->prev = new_block; 4000c30c: d0 20 e0 0c st %o0, [ %g3 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000c310: 84 12 e0 01 or %o3, 1, %g2 prev->next = new_block; 4000c314: d0 20 60 08 st %o0, [ %g1 + 8 ] 4000c318: c4 22 20 04 st %g2, [ %o0 + 4 ] next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 4000c31c: d6 22 00 0b st %o3, [ %o0 + %o3 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000c320: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 ++stats->frees; 4000c324: c2 04 20 50 ld [ %l0 + 0x50 ], %g1 stats->free_size += block_size; 4000c328: c6 04 20 30 ld [ %l0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000c32c: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 4000c330: 82 00 60 01 inc %g1 stats->free_size += block_size; 4000c334: 88 00 c0 04 add %g3, %g4, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000c338: c4 24 20 40 st %g2, [ %l0 + 0x40 ] ++stats->frees; 4000c33c: c2 24 20 50 st %g1, [ %l0 + 0x50 ] stats->free_size += block_size; 4000c340: c8 24 20 30 st %g4, [ %l0 + 0x30 ] return( true ); 4000c344: b0 10 20 01 mov 1, %i0 } 4000c348: 81 c7 e0 08 ret 4000c34c: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 4000c350: 82 11 20 01 or %g4, 1, %g1 4000c354: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000c358: da 00 a0 04 ld [ %g2 + 4 ], %o5 next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 4000c35c: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 4000c360: e0 22 20 0c st %l0, [ %o0 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 4000c364: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 4000c368: d0 20 e0 0c st %o0, [ %g3 + 0xc ] /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; 4000c36c: c8 22 00 04 st %g4, [ %o0 + %g4 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000c370: 86 0b 7f fe and %o5, -2, %g3 4000c374: c6 20 a0 04 st %g3, [ %g2 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; if ( stats->max_free_blocks < stats->free_blocks ) { 4000c378: c4 04 20 3c ld [ %l0 + 0x3c ], %g2 block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 4000c37c: 82 00 60 01 inc %g1 { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; block_before->next = new_block; 4000c380: d0 24 20 08 st %o0, [ %l0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 4000c384: 80 a0 40 02 cmp %g1, %g2 4000c388: 08 bf ff e6 bleu 4000c320 <_Heap_Free+0x130> 4000c38c: c2 24 20 38 st %g1, [ %l0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 4000c390: 10 bf ff e4 b 4000c320 <_Heap_Free+0x130> 4000c394: c2 24 20 3c st %g1, [ %l0 + 0x3c ] next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000c398: 82 12 a0 01 or %o2, 1, %g1 4000c39c: c2 23 60 04 st %g1, [ %o5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000c3a0: c2 00 a0 04 ld [ %g2 + 4 ], %g1 next_block->prev_size = size; 4000c3a4: d4 22 00 04 st %o2, [ %o0 + %g4 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000c3a8: 82 08 7f fe and %g1, -2, %g1 4000c3ac: 10 bf ff dd b 4000c320 <_Heap_Free+0x130> 4000c3b0: c2 20 a0 04 st %g1, [ %g2 + 4 ] =============================================================================== 40011ffc <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 40011ffc: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 40012000: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *const end = the_heap->last_block; 40012004: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 memset(the_info, 0, sizeof(*the_info)); 40012008: c0 26 40 00 clr [ %i1 ] 4001200c: c0 26 60 04 clr [ %i1 + 4 ] 40012010: c0 26 60 08 clr [ %i1 + 8 ] 40012014: c0 26 60 0c clr [ %i1 + 0xc ] 40012018: c0 26 60 10 clr [ %i1 + 0x10 ] while ( the_block != end ) { 4001201c: 80 a0 40 02 cmp %g1, %g2 40012020: 02 80 00 17 be 4001207c <_Heap_Get_information+0x80> <== NEVER TAKEN 40012024: c0 26 60 14 clr [ %i1 + 0x14 ] 40012028: da 00 60 04 ld [ %g1 + 4 ], %o5 4001202c: 88 0b 7f fe and %o5, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 40012030: 82 00 40 04 add %g1, %g4, %g1 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 40012034: da 00 60 04 ld [ %g1 + 4 ], %o5 while ( the_block != end ) { uintptr_t const the_size = _Heap_Block_size(the_block); Heap_Block *const next_block = _Heap_Block_at(the_block, the_size); Heap_Information *info; if ( _Heap_Is_prev_used(next_block) ) 40012038: 80 8b 60 01 btst 1, %o5 4001203c: 02 80 00 03 be 40012048 <_Heap_Get_information+0x4c> 40012040: 86 10 00 19 mov %i1, %g3 info = &the_info->Used; 40012044: 86 06 60 0c add %i1, 0xc, %g3 else info = &the_info->Free; info->number++; 40012048: d4 00 c0 00 ld [ %g3 ], %o2 info->total += the_size; 4001204c: d6 00 e0 08 ld [ %g3 + 8 ], %o3 if ( info->largest < the_size ) 40012050: d8 00 e0 04 ld [ %g3 + 4 ], %o4 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 40012054: 94 02 a0 01 inc %o2 info->total += the_size; 40012058: 96 02 c0 04 add %o3, %g4, %o3 if ( _Heap_Is_prev_used(next_block) ) info = &the_info->Used; else info = &the_info->Free; info->number++; 4001205c: d4 20 c0 00 st %o2, [ %g3 ] info->total += the_size; if ( info->largest < the_size ) 40012060: 80 a3 00 04 cmp %o4, %g4 40012064: 1a 80 00 03 bcc 40012070 <_Heap_Get_information+0x74> 40012068: d6 20 e0 08 st %o3, [ %g3 + 8 ] info->largest = the_size; 4001206c: c8 20 e0 04 st %g4, [ %g3 + 4 ] Heap_Block *the_block = the_heap->first_block; Heap_Block *const end = the_heap->last_block; memset(the_info, 0, sizeof(*the_info)); while ( the_block != end ) { 40012070: 80 a0 80 01 cmp %g2, %g1 40012074: 12 bf ff ef bne 40012030 <_Heap_Get_information+0x34> 40012078: 88 0b 7f fe and %o5, -2, %g4 4001207c: 81 c7 e0 08 ret 40012080: 81 e8 00 00 restore =============================================================================== 40013624 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 40013624: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 40013628: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 4001362c: 7f ff f9 7d call 40011c20 <.urem> 40013630: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_block_in_heap( const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block 40013634: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 40013638: a0 10 00 18 mov %i0, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 4001363c: 84 06 7f f8 add %i1, -8, %g2 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 40013640: 84 20 80 08 sub %g2, %o0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 40013644: 80 a0 80 01 cmp %g2, %g1 40013648: 0a 80 00 15 bcs 4001369c <_Heap_Size_of_alloc_area+0x78> 4001364c: b0 10 20 00 clr %i0 40013650: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 40013654: 80 a0 80 03 cmp %g2, %g3 40013658: 18 80 00 11 bgu 4001369c <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 4001365c: 01 00 00 00 nop - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 40013660: c8 00 a0 04 ld [ %g2 + 4 ], %g4 40013664: 88 09 3f fe and %g4, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 40013668: 84 00 80 04 add %g2, %g4, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 4001366c: 80 a0 40 02 cmp %g1, %g2 40013670: 18 80 00 0b bgu 4001369c <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 40013674: 80 a0 c0 02 cmp %g3, %g2 40013678: 0a 80 00 09 bcs 4001369c <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 4001367c: 01 00 00 00 nop block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 40013680: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 40013684: 80 88 60 01 btst 1, %g1 40013688: 02 80 00 05 be 4001369c <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 4001368c: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_BLOCK_SIZE_OFFSET - alloc_begin; return true; 40013690: b0 10 20 01 mov 1, %i0 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_BLOCK_SIZE_OFFSET - alloc_begin; 40013694: 84 00 a0 04 add %g2, 4, %g2 40013698: c4 26 80 00 st %g2, [ %i2 ] return true; } 4001369c: 81 c7 e0 08 ret 400136a0: 81 e8 00 00 restore =============================================================================== 400083fc <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 400083fc: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 40008400: 23 10 00 20 sethi %hi(0x40008000), %l1 bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 40008404: a0 10 00 18 mov %i0, %l0 uintptr_t const page_size = heap->page_size; 40008408: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 uintptr_t const min_block_size = heap->min_block_size; 4000840c: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const first_block = heap->first_block; 40008410: e4 06 20 20 ld [ %i0 + 0x20 ], %l2 Heap_Block *const last_block = heap->last_block; 40008414: ea 06 20 24 ld [ %i0 + 0x24 ], %l5 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 40008418: 80 8e a0 ff btst 0xff, %i2 4000841c: 02 80 00 04 be 4000842c <_Heap_Walk+0x30> 40008420: a2 14 63 90 or %l1, 0x390, %l1 40008424: 23 10 00 20 sethi %hi(0x40008000), %l1 40008428: a2 14 63 98 or %l1, 0x398, %l1 ! 40008398 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 4000842c: 03 10 00 5e sethi %hi(0x40017800), %g1 40008430: c2 00 63 7c ld [ %g1 + 0x37c ], %g1 ! 40017b7c <_System_state_Current> 40008434: 80 a0 60 03 cmp %g1, 3 40008438: 12 80 00 33 bne 40008504 <_Heap_Walk+0x108> 4000843c: b0 10 20 01 mov 1, %i0 Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 40008440: da 04 20 18 ld [ %l0 + 0x18 ], %o5 40008444: c6 04 20 1c ld [ %l0 + 0x1c ], %g3 40008448: c4 04 20 08 ld [ %l0 + 8 ], %g2 4000844c: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40008450: 90 10 00 19 mov %i1, %o0 40008454: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 40008458: e4 23 a0 60 st %l2, [ %sp + 0x60 ] 4000845c: ea 23 a0 64 st %l5, [ %sp + 0x64 ] 40008460: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 40008464: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 40008468: 92 10 20 00 clr %o1 4000846c: 96 10 00 14 mov %l4, %o3 40008470: 15 10 00 55 sethi %hi(0x40015400), %o2 40008474: 98 10 00 13 mov %l3, %o4 40008478: 9f c4 40 00 call %l1 4000847c: 94 12 a0 70 or %o2, 0x70, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 40008480: 80 a5 20 00 cmp %l4, 0 40008484: 02 80 00 2a be 4000852c <_Heap_Walk+0x130> 40008488: 80 8d 20 07 btst 7, %l4 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 4000848c: 12 80 00 30 bne 4000854c <_Heap_Walk+0x150> 40008490: 90 10 00 13 mov %l3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 40008494: 7f ff e5 87 call 40001ab0 <.urem> 40008498: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 4000849c: 80 a2 20 00 cmp %o0, 0 400084a0: 12 80 00 34 bne 40008570 <_Heap_Walk+0x174> 400084a4: 90 04 a0 08 add %l2, 8, %o0 400084a8: 7f ff e5 82 call 40001ab0 <.urem> 400084ac: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 400084b0: 80 a2 20 00 cmp %o0, 0 400084b4: 32 80 00 38 bne,a 40008594 <_Heap_Walk+0x198> 400084b8: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 400084bc: f8 04 a0 04 ld [ %l2 + 4 ], %i4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 400084c0: 80 8f 20 01 btst 1, %i4 400084c4: 22 80 00 4d be,a 400085f8 <_Heap_Walk+0x1fc> 400084c8: 90 10 00 19 mov %i1, %o0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 400084cc: c2 05 60 04 ld [ %l5 + 4 ], %g1 400084d0: 82 08 7f fe and %g1, -2, %g1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 400084d4: 82 05 40 01 add %l5, %g1, %g1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 400084d8: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 400084dc: 80 88 a0 01 btst 1, %g2 400084e0: 02 80 00 0b be 4000850c <_Heap_Walk+0x110> 400084e4: 80 a4 80 01 cmp %l2, %g1 ); return false; } if ( 400084e8: 02 80 00 33 be 400085b4 <_Heap_Walk+0x1b8> <== ALWAYS TAKEN 400084ec: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 400084f0: 92 10 20 01 mov 1, %o1 <== NOT EXECUTED 400084f4: 15 10 00 55 sethi %hi(0x40015400), %o2 <== NOT EXECUTED if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400084f8: b0 10 20 00 clr %i0 <== NOT EXECUTED } if ( _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 400084fc: 9f c4 40 00 call %l1 <== NOT EXECUTED 40008500: 94 12 a1 e8 or %o2, 0x1e8, %o2 <== NOT EXECUTED 40008504: 81 c7 e0 08 ret 40008508: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 4000850c: 90 10 00 19 mov %i1, %o0 40008510: 92 10 20 01 mov 1, %o1 40008514: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40008518: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 4000851c: 9f c4 40 00 call %l1 40008520: 94 12 a1 d0 or %o2, 0x1d0, %o2 40008524: 81 c7 e0 08 ret 40008528: 81 e8 00 00 restore first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 4000852c: 90 10 00 19 mov %i1, %o0 40008530: 92 10 20 01 mov 1, %o1 40008534: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40008538: b0 10 20 00 clr %i0 first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { (*printer)( source, true, "page size is zero\n" ); 4000853c: 9f c4 40 00 call %l1 40008540: 94 12 a1 08 or %o2, 0x108, %o2 40008544: 81 c7 e0 08 ret 40008548: 81 e8 00 00 restore return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 4000854c: 90 10 00 19 mov %i1, %o0 40008550: 92 10 20 01 mov 1, %o1 40008554: 96 10 00 14 mov %l4, %o3 40008558: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000855c: b0 10 20 00 clr %i0 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 40008560: 9f c4 40 00 call %l1 40008564: 94 12 a1 20 or %o2, 0x120, %o2 40008568: 81 c7 e0 08 ret 4000856c: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 40008570: 90 10 00 19 mov %i1, %o0 40008574: 92 10 20 01 mov 1, %o1 40008578: 96 10 00 13 mov %l3, %o3 4000857c: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40008580: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 40008584: 9f c4 40 00 call %l1 40008588: 94 12 a1 40 or %o2, 0x140, %o2 4000858c: 81 c7 e0 08 ret 40008590: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 40008594: 92 10 20 01 mov 1, %o1 40008598: 96 10 00 12 mov %l2, %o3 4000859c: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400085a0: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 400085a4: 9f c4 40 00 call %l1 400085a8: 94 12 a1 68 or %o2, 0x168, %o2 400085ac: 81 c7 e0 08 ret 400085b0: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 400085b4: ec 04 20 08 ld [ %l0 + 8 ], %l6 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 400085b8: 80 a4 00 16 cmp %l0, %l6 400085bc: 02 80 01 18 be 40008a1c <_Heap_Walk+0x620> 400085c0: f6 04 20 10 ld [ %l0 + 0x10 ], %i3 block = next_block; } while ( block != first_block ); return true; } 400085c4: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 400085c8: 80 a0 40 16 cmp %g1, %l6 400085cc: 28 80 00 12 bleu,a 40008614 <_Heap_Walk+0x218> <== ALWAYS TAKEN 400085d0: fa 04 20 24 ld [ %l0 + 0x24 ], %i5 const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 400085d4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 400085d8: 92 10 20 01 mov 1, %o1 400085dc: 96 10 00 16 mov %l6, %o3 400085e0: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400085e4: b0 10 20 00 clr %i0 const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 400085e8: 9f c4 40 00 call %l1 400085ec: 94 12 a2 18 or %o2, 0x218, %o2 400085f0: 81 c7 e0 08 ret 400085f4: 81 e8 00 00 restore return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 400085f8: 92 10 20 01 mov 1, %o1 400085fc: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40008600: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 40008604: 9f c4 40 00 call %l1 40008608: 94 12 a1 a0 or %o2, 0x1a0, %o2 4000860c: 81 c7 e0 08 ret 40008610: 81 e8 00 00 restore 40008614: 80 a7 40 16 cmp %i5, %l6 40008618: 0a bf ff f0 bcs 400085d8 <_Heap_Walk+0x1dc> <== NEVER TAKEN 4000861c: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 40008620: c2 27 bf fc st %g1, [ %fp + -4 ] 40008624: 90 05 a0 08 add %l6, 8, %o0 40008628: 7f ff e5 22 call 40001ab0 <.urem> 4000862c: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 40008630: 80 a2 20 00 cmp %o0, 0 40008634: 12 80 00 2e bne 400086ec <_Heap_Walk+0x2f0> <== NEVER TAKEN 40008638: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000863c: c4 05 a0 04 ld [ %l6 + 4 ], %g2 40008640: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 40008644: 84 05 80 02 add %l6, %g2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 40008648: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 4000864c: 80 88 a0 01 btst 1, %g2 40008650: 12 80 00 30 bne 40008710 <_Heap_Walk+0x314> <== NEVER TAKEN 40008654: 84 10 00 10 mov %l0, %g2 40008658: ae 10 00 16 mov %l6, %l7 4000865c: 10 80 00 17 b 400086b8 <_Heap_Walk+0x2bc> 40008660: b4 10 00 01 mov %g1, %i2 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 40008664: 80 a4 00 16 cmp %l0, %l6 40008668: 02 80 00 33 be 40008734 <_Heap_Walk+0x338> 4000866c: 80 a6 80 16 cmp %i2, %l6 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 40008670: 18 bf ff da bgu 400085d8 <_Heap_Walk+0x1dc> 40008674: 90 10 00 19 mov %i1, %o0 40008678: 80 a5 80 1d cmp %l6, %i5 4000867c: 18 bf ff d8 bgu 400085dc <_Heap_Walk+0x1e0> <== NEVER TAKEN 40008680: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 40008684: 90 05 a0 08 add %l6, 8, %o0 40008688: 7f ff e5 0a call 40001ab0 <.urem> 4000868c: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 40008690: 80 a2 20 00 cmp %o0, 0 40008694: 12 80 00 16 bne 400086ec <_Heap_Walk+0x2f0> 40008698: 84 10 00 17 mov %l7, %g2 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 4000869c: c2 05 a0 04 ld [ %l6 + 4 ], %g1 400086a0: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 400086a4: 82 00 40 16 add %g1, %l6, %g1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 400086a8: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 400086ac: 80 88 60 01 btst 1, %g1 400086b0: 12 80 00 18 bne 40008710 <_Heap_Walk+0x314> 400086b4: ae 10 00 16 mov %l6, %l7 ); return false; } if ( free_block->prev != prev_block ) { 400086b8: d8 05 a0 0c ld [ %l6 + 0xc ], %o4 400086bc: 80 a3 00 02 cmp %o4, %g2 400086c0: 22 bf ff e9 be,a 40008664 <_Heap_Walk+0x268> 400086c4: ec 05 a0 08 ld [ %l6 + 8 ], %l6 (*printer)( 400086c8: 90 10 00 19 mov %i1, %o0 400086cc: 92 10 20 01 mov 1, %o1 400086d0: 96 10 00 16 mov %l6, %o3 400086d4: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400086d8: b0 10 20 00 clr %i0 return false; } if ( free_block->prev != prev_block ) { (*printer)( 400086dc: 9f c4 40 00 call %l1 400086e0: 94 12 a2 88 or %o2, 0x288, %o2 400086e4: 81 c7 e0 08 ret 400086e8: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 400086ec: 90 10 00 19 mov %i1, %o0 400086f0: 92 10 20 01 mov 1, %o1 400086f4: 96 10 00 16 mov %l6, %o3 400086f8: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400086fc: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 40008700: 9f c4 40 00 call %l1 40008704: 94 12 a2 38 or %o2, 0x238, %o2 40008708: 81 c7 e0 08 ret 4000870c: 81 e8 00 00 restore return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 40008710: 90 10 00 19 mov %i1, %o0 40008714: 92 10 20 01 mov 1, %o1 40008718: 96 10 00 16 mov %l6, %o3 4000871c: 15 10 00 55 sethi %hi(0x40015400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40008720: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 40008724: 9f c4 40 00 call %l1 40008728: 94 12 a2 68 or %o2, 0x268, %o2 4000872c: 81 c7 e0 08 ret 40008730: 81 e8 00 00 restore 40008734: 82 10 00 1a mov %i2, %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40008738: 35 10 00 56 sethi %hi(0x40015800), %i2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 4000873c: 31 10 00 56 sethi %hi(0x40015800), %i0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 40008740: ae 10 00 12 mov %l2, %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40008744: b4 16 a0 48 or %i2, 0x48, %i2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 40008748: b0 16 20 30 or %i0, 0x30, %i0 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 4000874c: 37 10 00 55 sethi %hi(0x40015400), %i3 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 40008750: ba 0f 3f fe and %i4, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 40008754: ac 07 40 17 add %i5, %l7, %l6 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 40008758: 80 a0 40 16 cmp %g1, %l6 4000875c: 28 80 00 0c bleu,a 4000878c <_Heap_Walk+0x390> <== ALWAYS TAKEN 40008760: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 40008764: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 40008768: 92 10 20 01 mov 1, %o1 4000876c: 96 10 00 17 mov %l7, %o3 40008770: 15 10 00 55 sethi %hi(0x40015400), %o2 40008774: 98 10 00 16 mov %l6, %o4 40008778: 94 12 a2 c0 or %o2, 0x2c0, %o2 4000877c: 9f c4 40 00 call %l1 40008780: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 40008784: 81 c7 e0 08 ret 40008788: 81 e8 00 00 restore 4000878c: 80 a0 40 16 cmp %g1, %l6 40008790: 0a bf ff f6 bcs 40008768 <_Heap_Walk+0x36c> 40008794: 90 10 00 19 mov %i1, %o0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); bool const prev_used = _Heap_Is_prev_used( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; 40008798: 82 1d c0 15 xor %l7, %l5, %g1 4000879c: 80 a0 00 01 cmp %g0, %g1 400087a0: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 400087a4: 90 10 00 1d mov %i5, %o0 400087a8: c2 27 bf fc st %g1, [ %fp + -4 ] 400087ac: 7f ff e4 c1 call 40001ab0 <.urem> 400087b0: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 400087b4: 80 a2 20 00 cmp %o0, 0 400087b8: 02 80 00 05 be 400087cc <_Heap_Walk+0x3d0> 400087bc: c2 07 bf fc ld [ %fp + -4 ], %g1 400087c0: 80 88 60 ff btst 0xff, %g1 400087c4: 12 80 00 79 bne 400089a8 <_Heap_Walk+0x5ac> 400087c8: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 400087cc: 80 a4 c0 1d cmp %l3, %i5 400087d0: 08 80 00 05 bleu 400087e4 <_Heap_Walk+0x3e8> 400087d4: 80 a5 c0 16 cmp %l7, %l6 400087d8: 80 88 60 ff btst 0xff, %g1 400087dc: 12 80 00 7c bne 400089cc <_Heap_Walk+0x5d0> <== ALWAYS TAKEN 400087e0: 80 a5 c0 16 cmp %l7, %l6 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 400087e4: 2a 80 00 06 bcs,a 400087fc <_Heap_Walk+0x400> 400087e8: c2 05 a0 04 ld [ %l6 + 4 ], %g1 400087ec: 80 88 60 ff btst 0xff, %g1 400087f0: 12 80 00 82 bne 400089f8 <_Heap_Walk+0x5fc> 400087f4: 90 10 00 19 mov %i1, %o0 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 400087f8: c2 05 a0 04 ld [ %l6 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 400087fc: 80 88 60 01 btst 1, %g1 40008800: 02 80 00 19 be 40008864 <_Heap_Walk+0x468> 40008804: b8 0f 20 01 and %i4, 1, %i4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 40008808: 80 a7 20 00 cmp %i4, 0 4000880c: 22 80 00 0e be,a 40008844 <_Heap_Walk+0x448> 40008810: da 05 c0 00 ld [ %l7 ], %o5 (*printer)( 40008814: 90 10 00 19 mov %i1, %o0 40008818: 92 10 20 00 clr %o1 4000881c: 94 10 00 18 mov %i0, %o2 40008820: 96 10 00 17 mov %l7, %o3 40008824: 9f c4 40 00 call %l1 40008828: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 4000882c: 80 a4 80 16 cmp %l2, %l6 40008830: 02 80 00 43 be 4000893c <_Heap_Walk+0x540> 40008834: ae 10 00 16 mov %l6, %l7 40008838: f8 05 a0 04 ld [ %l6 + 4 ], %i4 4000883c: 10 bf ff c5 b 40008750 <_Heap_Walk+0x354> 40008840: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40008844: 96 10 00 17 mov %l7, %o3 40008848: 90 10 00 19 mov %i1, %o0 4000884c: 92 10 20 00 clr %o1 40008850: 94 10 00 1a mov %i2, %o2 40008854: 9f c4 40 00 call %l1 40008858: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 4000885c: 10 bf ff f5 b 40008830 <_Heap_Walk+0x434> 40008860: 80 a4 80 16 cmp %l2, %l6 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 40008864: da 05 e0 0c ld [ %l7 + 0xc ], %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 40008868: c2 04 20 08 ld [ %l0 + 8 ], %g1 4000886c: 05 10 00 55 sethi %hi(0x40015400), %g2 block = next_block; } while ( block != first_block ); return true; } 40008870: c8 04 20 0c ld [ %l0 + 0xc ], %g4 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 40008874: 80 a0 40 0d cmp %g1, %o5 40008878: 02 80 00 05 be 4000888c <_Heap_Walk+0x490> 4000887c: 86 10 a0 30 or %g2, 0x30, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 40008880: 80 a4 00 0d cmp %l0, %o5 40008884: 02 80 00 3e be 4000897c <_Heap_Walk+0x580> 40008888: 86 16 e3 f8 or %i3, 0x3f8, %g3 block->next, block->next == last_free_block ? 4000888c: c2 05 e0 08 ld [ %l7 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 40008890: 19 10 00 55 sethi %hi(0x40015400), %o4 40008894: 80 a1 00 01 cmp %g4, %g1 40008898: 02 80 00 05 be 400088ac <_Heap_Walk+0x4b0> 4000889c: 84 13 20 50 or %o4, 0x50, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 400088a0: 80 a4 00 01 cmp %l0, %g1 400088a4: 02 80 00 33 be 40008970 <_Heap_Walk+0x574> 400088a8: 84 16 e3 f8 or %i3, 0x3f8, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 400088ac: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 400088b0: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 400088b4: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 400088b8: 90 10 00 19 mov %i1, %o0 400088bc: 92 10 20 00 clr %o1 400088c0: 15 10 00 55 sethi %hi(0x40015400), %o2 400088c4: 96 10 00 17 mov %l7, %o3 400088c8: 94 12 a3 88 or %o2, 0x388, %o2 400088cc: 9f c4 40 00 call %l1 400088d0: 98 10 00 1d mov %i5, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 400088d4: da 05 80 00 ld [ %l6 ], %o5 400088d8: 80 a7 40 0d cmp %i5, %o5 400088dc: 12 80 00 1a bne 40008944 <_Heap_Walk+0x548> 400088e0: 80 a7 20 00 cmp %i4, 0 ); return false; } if ( !prev_used ) { 400088e4: 02 80 00 29 be 40008988 <_Heap_Walk+0x58c> 400088e8: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 400088ec: c2 04 20 08 ld [ %l0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 400088f0: 80 a4 00 01 cmp %l0, %g1 400088f4: 02 80 00 0b be 40008920 <_Heap_Walk+0x524> <== NEVER TAKEN 400088f8: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 400088fc: 80 a5 c0 01 cmp %l7, %g1 40008900: 02 bf ff cc be 40008830 <_Heap_Walk+0x434> 40008904: 80 a4 80 16 cmp %l2, %l6 return true; } free_block = free_block->next; 40008908: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 4000890c: 80 a4 00 01 cmp %l0, %g1 40008910: 12 bf ff fc bne 40008900 <_Heap_Walk+0x504> 40008914: 80 a5 c0 01 cmp %l7, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 40008918: 90 10 00 19 mov %i1, %o0 4000891c: 92 10 20 01 mov 1, %o1 40008920: 96 10 00 17 mov %l7, %o3 40008924: 15 10 00 56 sethi %hi(0x40015800), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 40008928: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 4000892c: 9f c4 40 00 call %l1 40008930: 94 12 a0 70 or %o2, 0x70, %o2 40008934: 81 c7 e0 08 ret 40008938: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 4000893c: 81 c7 e0 08 ret 40008940: 91 e8 20 01 restore %g0, 1, %o0 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 40008944: ec 23 a0 5c st %l6, [ %sp + 0x5c ] 40008948: 90 10 00 19 mov %i1, %o0 4000894c: 92 10 20 01 mov 1, %o1 40008950: 96 10 00 17 mov %l7, %o3 40008954: 15 10 00 55 sethi %hi(0x40015400), %o2 40008958: 98 10 00 1d mov %i5, %o4 4000895c: 94 12 a3 c0 or %o2, 0x3c0, %o2 40008960: 9f c4 40 00 call %l1 40008964: b0 10 20 00 clr %i0 40008968: 81 c7 e0 08 ret 4000896c: 81 e8 00 00 restore " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 40008970: 09 10 00 55 sethi %hi(0x40015400), %g4 40008974: 10 bf ff ce b 400088ac <_Heap_Walk+0x4b0> 40008978: 84 11 20 60 or %g4, 0x60, %g2 ! 40015460 <_Status_Object_name_errors_to_status+0x68> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 4000897c: 19 10 00 55 sethi %hi(0x40015400), %o4 40008980: 10 bf ff c3 b 4000888c <_Heap_Walk+0x490> 40008984: 86 13 20 40 or %o4, 0x40, %g3 ! 40015440 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 40008988: 92 10 20 01 mov 1, %o1 4000898c: 96 10 00 17 mov %l7, %o3 40008990: 15 10 00 56 sethi %hi(0x40015800), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 40008994: b0 10 20 00 clr %i0 return false; } if ( !prev_used ) { (*printer)( 40008998: 9f c4 40 00 call %l1 4000899c: 94 12 a0 00 mov %o2, %o2 400089a0: 81 c7 e0 08 ret 400089a4: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 400089a8: 92 10 20 01 mov 1, %o1 400089ac: 96 10 00 17 mov %l7, %o3 400089b0: 15 10 00 55 sethi %hi(0x40015400), %o2 400089b4: 98 10 00 1d mov %i5, %o4 400089b8: 94 12 a2 f0 or %o2, 0x2f0, %o2 400089bc: 9f c4 40 00 call %l1 400089c0: b0 10 20 00 clr %i0 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 400089c4: 81 c7 e0 08 ret 400089c8: 81 e8 00 00 restore } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 400089cc: 90 10 00 19 mov %i1, %o0 400089d0: 92 10 20 01 mov 1, %o1 400089d4: 96 10 00 17 mov %l7, %o3 400089d8: 15 10 00 55 sethi %hi(0x40015400), %o2 400089dc: 98 10 00 1d mov %i5, %o4 400089e0: 94 12 a3 20 or %o2, 0x320, %o2 400089e4: 9a 10 00 13 mov %l3, %o5 400089e8: 9f c4 40 00 call %l1 400089ec: b0 10 20 00 clr %i0 block, block_size, min_block_size ); return false; 400089f0: 81 c7 e0 08 ret 400089f4: 81 e8 00 00 restore } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 400089f8: 92 10 20 01 mov 1, %o1 400089fc: 96 10 00 17 mov %l7, %o3 40008a00: 15 10 00 55 sethi %hi(0x40015400), %o2 40008a04: 98 10 00 16 mov %l6, %o4 40008a08: 94 12 a3 50 or %o2, 0x350, %o2 40008a0c: 9f c4 40 00 call %l1 40008a10: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 40008a14: 81 c7 e0 08 ret 40008a18: 81 e8 00 00 restore const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 40008a1c: 10 bf ff 47 b 40008738 <_Heap_Walk+0x33c> 40008a20: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 =============================================================================== 400068f8 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 400068f8: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 400068fc: 23 10 00 55 sethi %hi(0x40015400), %l1 40006900: c2 04 60 dc ld [ %l1 + 0xdc ], %g1 ! 400154dc <_IO_Number_of_drivers> 40006904: 80 a0 60 00 cmp %g1, 0 40006908: 02 80 00 0c be 40006938 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 4000690c: a0 10 20 00 clr %l0 40006910: a2 14 60 dc or %l1, 0xdc, %l1 (void) rtems_io_initialize( major, 0, NULL ); 40006914: 90 10 00 10 mov %l0, %o0 40006918: 92 10 20 00 clr %o1 4000691c: 40 00 15 06 call 4000bd34 40006920: 94 10 20 00 clr %o2 void _IO_Initialize_all_drivers( void ) { rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 40006924: c2 04 40 00 ld [ %l1 ], %g1 40006928: a0 04 20 01 inc %l0 4000692c: 80 a0 40 10 cmp %g1, %l0 40006930: 18 bf ff fa bgu 40006918 <_IO_Initialize_all_drivers+0x20> 40006934: 90 10 00 10 mov %l0, %o0 40006938: 81 c7 e0 08 ret 4000693c: 81 e8 00 00 restore =============================================================================== 4000682c <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 4000682c: 9d e3 bf a0 save %sp, -96, %sp uint32_t index; rtems_driver_address_table *driver_table; uint32_t drivers_in_table; uint32_t number_of_drivers; driver_table = Configuration.Device_driver_table; 40006830: 03 10 00 52 sethi %hi(0x40014800), %g1 40006834: 82 10 61 38 or %g1, 0x138, %g1 ! 40014938 drivers_in_table = Configuration.number_of_device_drivers; 40006838: e2 00 60 30 ld [ %g1 + 0x30 ], %l1 number_of_drivers = Configuration.maximum_drivers; 4000683c: e8 00 60 2c ld [ %g1 + 0x2c ], %l4 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 40006840: 80 a4 40 14 cmp %l1, %l4 40006844: 0a 80 00 08 bcs 40006864 <_IO_Manager_initialization+0x38> 40006848: e0 00 60 34 ld [ %g1 + 0x34 ], %l0 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 4000684c: 03 10 00 55 sethi %hi(0x40015400), %g1 40006850: e0 20 60 e0 st %l0, [ %g1 + 0xe0 ] ! 400154e0 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 40006854: 03 10 00 55 sethi %hi(0x40015400), %g1 40006858: e2 20 60 dc st %l1, [ %g1 + 0xdc ] ! 400154dc <_IO_Number_of_drivers> return; 4000685c: 81 c7 e0 08 ret 40006860: 81 e8 00 00 restore * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) 40006864: 83 2d 20 03 sll %l4, 3, %g1 40006868: a7 2d 20 05 sll %l4, 5, %l3 4000686c: a6 24 c0 01 sub %l3, %g1, %l3 * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) _Workspace_Allocate_or_fatal_error( 40006870: 40 00 0c a5 call 40009b04 <_Workspace_Allocate_or_fatal_error> 40006874: 90 10 00 13 mov %l3, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40006878: 03 10 00 55 sethi %hi(0x40015400), %g1 /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 4000687c: 25 10 00 55 sethi %hi(0x40015400), %l2 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40006880: e8 20 60 dc st %l4, [ %g1 + 0xdc ] /* * The application requested extra slots in the driver table, so we * have to allocate a new driver table and copy theirs to it. */ _IO_Driver_address_table = (rtems_driver_address_table *) 40006884: d0 24 a0 e0 st %o0, [ %l2 + 0xe0 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 40006888: 92 10 20 00 clr %o1 4000688c: 40 00 20 b9 call 4000eb70 40006890: 94 10 00 13 mov %l3, %o2 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 40006894: 80 a4 60 00 cmp %l1, 0 40006898: 02 bf ff f1 be 4000685c <_IO_Manager_initialization+0x30> <== NEVER TAKEN 4000689c: da 04 a0 e0 ld [ %l2 + 0xe0 ], %o5 400068a0: 82 10 20 00 clr %g1 400068a4: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 400068a8: c4 04 00 01 ld [ %l0 + %g1 ], %g2 400068ac: 86 04 00 01 add %l0, %g1, %g3 400068b0: c4 23 40 01 st %g2, [ %o5 + %g1 ] 400068b4: d8 00 e0 04 ld [ %g3 + 4 ], %o4 400068b8: 84 03 40 01 add %o5, %g1, %g2 400068bc: d8 20 a0 04 st %o4, [ %g2 + 4 ] 400068c0: d8 00 e0 08 ld [ %g3 + 8 ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 400068c4: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 400068c8: d8 20 a0 08 st %o4, [ %g2 + 8 ] 400068cc: d8 00 e0 0c ld [ %g3 + 0xc ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 400068d0: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 400068d4: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 400068d8: d8 00 e0 10 ld [ %g3 + 0x10 ], %o4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 400068dc: 80 a4 40 04 cmp %l1, %g4 _IO_Driver_address_table[index] = driver_table[index]; 400068e0: d8 20 a0 10 st %o4, [ %g2 + 0x10 ] 400068e4: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 400068e8: 18 bf ff f0 bgu 400068a8 <_IO_Manager_initialization+0x7c> 400068ec: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 400068f0: 81 c7 e0 08 ret 400068f4: 81 e8 00 00 restore =============================================================================== 40007578 <_Internal_error_Occurred>: void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40007578: 9d e3 bf a0 save %sp, -96, %sp _Internal_errors_What_happened.the_source = the_source; 4000757c: 09 10 00 54 sethi %hi(0x40015000), %g4 40007580: 84 11 22 ac or %g4, 0x2ac, %g2 ! 400152ac <_Internal_errors_What_happened> void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40007584: 94 10 00 1a mov %i2, %o2 _Internal_errors_What_happened.the_source = the_source; _Internal_errors_What_happened.is_internal = is_internal; _Internal_errors_What_happened.the_error = the_error; _User_extensions_Fatal( the_source, is_internal, the_error ); 40007588: 90 10 00 18 mov %i0, %o0 bool is_internal, Internal_errors_t the_error ) { _Internal_errors_What_happened.the_source = the_source; 4000758c: f0 21 22 ac st %i0, [ %g4 + 0x2ac ] _Internal_errors_What_happened.is_internal = is_internal; _Internal_errors_What_happened.the_error = the_error; 40007590: f4 20 a0 08 st %i2, [ %g2 + 8 ] _User_extensions_Fatal( the_source, is_internal, the_error ); 40007594: 92 0e 60 ff and %i1, 0xff, %o1 40007598: 40 00 07 fa call 40009580 <_User_extensions_Fatal> 4000759c: f2 28 a0 04 stb %i1, [ %g2 + 4 ] RTEMS_INLINE_ROUTINE void _System_state_Set ( System_state_Codes state ) { _System_state_Current = state; 400075a0: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED 400075a4: 03 10 00 54 sethi %hi(0x40015000), %g1 <== NOT EXECUTED _System_state_Set( SYSTEM_STATE_FAILED ); _CPU_Fatal_halt( the_error ); 400075a8: 7f ff e9 cc call 40001cd8 <== NOT EXECUTED 400075ac: c4 20 63 9c st %g2, [ %g1 + 0x39c ] ! 4001539c <_System_state_Current><== NOT EXECUTED 400075b0: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED 400075b4: 30 80 00 00 b,a 400075b4 <_Internal_error_Occurred+0x3c> <== NOT EXECUTED =============================================================================== 4000762c <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 4000762c: 9d e3 bf a0 save %sp, -96, %sp * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 40007630: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 40007634: a0 10 00 18 mov %i0, %l0 * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 40007638: 80 a0 60 00 cmp %g1, 0 4000763c: 02 80 00 19 be 400076a0 <_Objects_Allocate+0x74> <== NEVER TAKEN 40007640: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 40007644: a2 04 20 20 add %l0, 0x20, %l1 40007648: 7f ff fd 5a call 40006bb0 <_Chain_Get> 4000764c: 90 10 00 11 mov %l1, %o0 if ( information->auto_extend ) { 40007650: c2 0c 20 12 ldub [ %l0 + 0x12 ], %g1 40007654: 80 a0 60 00 cmp %g1, 0 40007658: 02 80 00 12 be 400076a0 <_Objects_Allocate+0x74> 4000765c: b0 10 00 08 mov %o0, %i0 /* * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { 40007660: 80 a2 20 00 cmp %o0, 0 40007664: 02 80 00 11 be 400076a8 <_Objects_Allocate+0x7c> 40007668: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 4000766c: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 40007670: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 40007674: d2 14 20 14 lduh [ %l0 + 0x14 ], %o1 40007678: 40 00 28 be call 40011970 <.udiv> 4000767c: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 40007680: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 40007684: 91 2a 20 02 sll %o0, 2, %o0 40007688: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 4000768c: c4 14 20 2c lduh [ %l0 + 0x2c ], %g2 block = (uint32_t) _Objects_Get_index( the_object->id ) - _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; information->inactive_per_block[ block ]--; 40007690: 86 00 ff ff add %g3, -1, %g3 40007694: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 40007698: 82 00 bf ff add %g2, -1, %g1 4000769c: c2 34 20 2c sth %g1, [ %l0 + 0x2c ] ); } #endif return the_object; } 400076a0: 81 c7 e0 08 ret 400076a4: 81 e8 00 00 restore * If the list is empty then we are out of objects and need to * extend information base. */ if ( !the_object ) { _Objects_Extend_information( information ); 400076a8: 40 00 00 11 call 400076ec <_Objects_Extend_information> 400076ac: 90 10 00 10 mov %l0, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 400076b0: 7f ff fd 40 call 40006bb0 <_Chain_Get> 400076b4: 90 10 00 11 mov %l1, %o0 } if ( the_object ) { 400076b8: b0 92 20 00 orcc %o0, 0, %i0 400076bc: 32 bf ff ed bne,a 40007670 <_Objects_Allocate+0x44> 400076c0: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 ); } #endif return the_object; } 400076c4: 81 c7 e0 08 ret 400076c8: 81 e8 00 00 restore =============================================================================== 400076ec <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 400076ec: 9d e3 bf 90 save %sp, -112, %sp minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 400076f0: e8 06 20 34 ld [ %i0 + 0x34 ], %l4 400076f4: 80 a5 20 00 cmp %l4, 0 400076f8: 02 80 00 a9 be 4000799c <_Objects_Extend_information+0x2b0> 400076fc: e4 16 20 0a lduh [ %i0 + 0xa ], %l2 block_count = 0; else { block_count = information->maximum / information->allocation_size; 40007700: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 40007704: e6 16 20 14 lduh [ %i0 + 0x14 ], %l3 40007708: ab 2d 60 10 sll %l5, 0x10, %l5 4000770c: 92 10 00 13 mov %l3, %o1 40007710: 40 00 28 98 call 40011970 <.udiv> 40007714: 91 35 60 10 srl %l5, 0x10, %o0 40007718: bb 2a 20 10 sll %o0, 0x10, %i5 4000771c: bb 37 60 10 srl %i5, 0x10, %i5 for ( ; block < block_count; block++ ) { 40007720: 80 a7 60 00 cmp %i5, 0 40007724: 02 80 00 a6 be 400079bc <_Objects_Extend_information+0x2d0><== NEVER TAKEN 40007728: 90 10 00 13 mov %l3, %o0 if ( information->object_blocks[ block ] == NULL ) { 4000772c: c2 05 00 00 ld [ %l4 ], %g1 40007730: 80 a0 60 00 cmp %g1, 0 40007734: 02 80 00 a6 be 400079cc <_Objects_Extend_information+0x2e0><== NEVER TAKEN 40007738: a2 10 00 12 mov %l2, %l1 * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 4000773c: 10 80 00 06 b 40007754 <_Objects_Extend_information+0x68> 40007740: a0 10 20 00 clr %l0 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 40007744: c2 05 00 01 ld [ %l4 + %g1 ], %g1 40007748: 80 a0 60 00 cmp %g1, 0 4000774c: 22 80 00 08 be,a 4000776c <_Objects_Extend_information+0x80> 40007750: a8 10 20 00 clr %l4 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 40007754: a0 04 20 01 inc %l0 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 40007758: a2 04 40 13 add %l1, %l3, %l1 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 4000775c: 80 a7 40 10 cmp %i5, %l0 40007760: 18 bf ff f9 bgu 40007744 <_Objects_Extend_information+0x58> 40007764: 83 2c 20 02 sll %l0, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 40007768: a8 10 20 01 mov 1, %l4 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 4000776c: ab 35 60 10 srl %l5, 0x10, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 40007770: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 40007774: aa 05 40 08 add %l5, %o0, %l5 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 40007778: 82 10 63 ff or %g1, 0x3ff, %g1 4000777c: 80 a5 40 01 cmp %l5, %g1 40007780: 18 80 00 98 bgu 400079e0 <_Objects_Extend_information+0x2f4> 40007784: 01 00 00 00 nop /* * Allocate the name table, and the objects and if it fails either return or * generate a fatal error depending on auto-extending being active. */ block_size = information->allocation_size * information->size; 40007788: 40 00 28 40 call 40011888 <.umul> 4000778c: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 40007790: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 40007794: 80 a0 60 00 cmp %g1, 0 40007798: 02 80 00 6d be 4000794c <_Objects_Extend_information+0x260> 4000779c: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 400077a0: 40 00 08 c9 call 40009ac4 <_Workspace_Allocate> 400077a4: 01 00 00 00 nop if ( !new_object_block ) 400077a8: a6 92 20 00 orcc %o0, 0, %l3 400077ac: 02 80 00 8d be 400079e0 <_Objects_Extend_information+0x2f4> 400077b0: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 400077b4: 80 8d 20 ff btst 0xff, %l4 400077b8: 22 80 00 42 be,a 400078c0 <_Objects_Extend_information+0x1d4> 400077bc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 400077c0: a8 07 60 01 add %i5, 1, %l4 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 400077c4: 91 2d 20 01 sll %l4, 1, %o0 400077c8: 90 02 00 14 add %o0, %l4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 400077cc: 90 05 40 08 add %l5, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 400077d0: 90 02 00 12 add %o0, %l2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 400077d4: 40 00 08 bc call 40009ac4 <_Workspace_Allocate> 400077d8: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 400077dc: ac 92 20 00 orcc %o0, 0, %l6 400077e0: 02 80 00 7e be 400079d8 <_Objects_Extend_information+0x2ec> 400077e4: a9 2d 20 02 sll %l4, 2, %l4 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 400077e8: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 400077ec: 80 a4 80 01 cmp %l2, %g1 400077f0: ae 05 80 14 add %l6, %l4, %l7 400077f4: 0a 80 00 5a bcs 4000795c <_Objects_Extend_information+0x270> 400077f8: a8 05 c0 14 add %l7, %l4, %l4 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 400077fc: 80 a4 a0 00 cmp %l2, 0 40007800: 02 80 00 07 be 4000781c <_Objects_Extend_information+0x130><== NEVER TAKEN 40007804: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 40007808: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 4000780c: 82 00 60 01 inc %g1 40007810: 80 a4 80 01 cmp %l2, %g1 40007814: 18 bf ff fd bgu 40007808 <_Objects_Extend_information+0x11c><== NEVER TAKEN 40007818: c0 20 80 14 clr [ %g2 + %l4 ] 4000781c: bb 2f 60 02 sll %i5, 2, %i5 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40007820: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 40007824: c0 25 80 1d clr [ %l6 + %i5 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40007828: 86 04 40 03 add %l1, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 4000782c: 80 a4 40 03 cmp %l1, %g3 40007830: 1a 80 00 0a bcc 40007858 <_Objects_Extend_information+0x16c><== NEVER TAKEN 40007834: c0 25 c0 1d clr [ %l7 + %i5 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 40007838: 83 2c 60 02 sll %l1, 2, %g1 4000783c: 84 10 00 11 mov %l1, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 40007840: 82 05 00 01 add %l4, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 40007844: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 40007848: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 4000784c: 80 a0 80 03 cmp %g2, %g3 40007850: 0a bf ff fd bcs 40007844 <_Objects_Extend_information+0x158> 40007854: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 40007858: 7f ff e9 20 call 40001cd8 4000785c: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007860: c6 06 00 00 ld [ %i0 ], %g3 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 40007864: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 40007868: e4 06 20 34 ld [ %i0 + 0x34 ], %l2 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 4000786c: ea 36 20 10 sth %l5, [ %i0 + 0x10 ] 40007870: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40007874: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 40007878: ec 26 20 34 st %l6, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 4000787c: ee 26 20 30 st %l7, [ %i0 + 0x30 ] information->local_table = local_table; 40007880: e8 26 20 1c st %l4, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 40007884: ab 2d 60 10 sll %l5, 0x10, %l5 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007888: 03 00 00 40 sethi %hi(0x10000), %g1 4000788c: ab 35 60 10 srl %l5, 0x10, %l5 40007890: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40007894: 82 10 40 02 or %g1, %g2, %g1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007898: 82 10 40 15 or %g1, %l5, %g1 4000789c: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 400078a0: 7f ff e9 12 call 40001ce8 400078a4: 01 00 00 00 nop if ( old_tables ) 400078a8: 80 a4 a0 00 cmp %l2, 0 400078ac: 22 80 00 05 be,a 400078c0 <_Objects_Extend_information+0x1d4> 400078b0: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 _Workspace_Free( old_tables ); 400078b4: 40 00 08 8d call 40009ae8 <_Workspace_Free> 400078b8: 90 10 00 12 mov %l2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 400078bc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400078c0: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 400078c4: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 400078c8: 92 10 00 13 mov %l3, %o1 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 400078cc: a1 2c 20 02 sll %l0, 2, %l0 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400078d0: a4 07 bf f4 add %fp, -12, %l2 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 400078d4: e6 20 40 10 st %l3, [ %g1 + %l0 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400078d8: 90 10 00 12 mov %l2, %o0 400078dc: 40 00 11 2d call 4000bd90 <_Chain_Initialize> 400078e0: a6 06 20 20 add %i0, 0x20, %l3 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 400078e4: 10 80 00 0d b 40007918 <_Objects_Extend_information+0x22c> 400078e8: 29 00 00 40 sethi %hi(0x10000), %l4 the_object->id = _Objects_Build_id( 400078ec: c6 16 20 04 lduh [ %i0 + 4 ], %g3 400078f0: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 400078f4: 87 28 e0 1b sll %g3, 0x1b, %g3 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 400078f8: 84 10 80 14 or %g2, %l4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 400078fc: 84 10 80 03 or %g2, %g3, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007900: 84 10 80 11 or %g2, %l1, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 40007904: 90 10 00 13 mov %l3, %o0 40007908: 92 10 00 01 mov %g1, %o1 index++; 4000790c: a2 04 60 01 inc %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 40007910: 7f ff fc 92 call 40006b58 <_Chain_Append> 40007914: c4 20 60 08 st %g2, [ %g1 + 8 ] /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 40007918: 7f ff fc a6 call 40006bb0 <_Chain_Get> 4000791c: 90 10 00 12 mov %l2, %o0 40007920: 82 92 20 00 orcc %o0, 0, %g1 40007924: 32 bf ff f2 bne,a 400078ec <_Objects_Extend_information+0x200> 40007928: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 4000792c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 40007930: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 40007934: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 40007938: c8 20 c0 10 st %g4, [ %g3 + %l0 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 4000793c: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 40007940: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 40007944: 81 c7 e0 08 ret 40007948: 81 e8 00 00 restore if ( information->auto_extend ) { new_object_block = _Workspace_Allocate( block_size ); if ( !new_object_block ) return; } else { new_object_block = _Workspace_Allocate_or_fatal_error( block_size ); 4000794c: 40 00 08 6e call 40009b04 <_Workspace_Allocate_or_fatal_error> 40007950: 01 00 00 00 nop 40007954: 10 bf ff 98 b 400077b4 <_Objects_Extend_information+0xc8> 40007958: a6 10 00 08 mov %o0, %l3 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 4000795c: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 40007960: bb 2f 60 02 sll %i5, 2, %i5 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 40007964: 40 00 1c 44 call 4000ea74 40007968: 94 10 00 1d mov %i5, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 4000796c: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 40007970: 94 10 00 1d mov %i5, %o2 40007974: 40 00 1c 40 call 4000ea74 40007978: 90 10 00 17 mov %l7, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 4000797c: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 40007980: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 40007984: 94 04 80 0a add %l2, %o2, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 40007988: 90 10 00 14 mov %l4, %o0 4000798c: 40 00 1c 3a call 4000ea74 40007990: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40007994: 10 bf ff a4 b 40007824 <_Objects_Extend_information+0x138> 40007998: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 4000799c: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 400079a0: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 400079a4: a2 10 00 12 mov %l2, %l1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 400079a8: a8 10 20 01 mov 1, %l4 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 400079ac: a0 10 20 00 clr %l0 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 400079b0: ba 10 20 00 clr %i5 400079b4: 10 bf ff 6e b 4000776c <_Objects_Extend_information+0x80> 400079b8: ab 2d 60 10 sll %l5, 0x10, %l5 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 400079bc: a2 10 00 12 mov %l2, %l1 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 400079c0: a8 10 20 01 mov 1, %l4 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 400079c4: 10 bf ff 6a b 4000776c <_Objects_Extend_information+0x80> <== NOT EXECUTED 400079c8: a0 10 20 00 clr %l0 <== NOT EXECUTED else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 400079cc: a8 10 20 00 clr %l4 <== NOT EXECUTED * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 400079d0: 10 bf ff 67 b 4000776c <_Objects_Extend_information+0x80> <== NOT EXECUTED 400079d4: a0 10 20 00 clr %l0 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 400079d8: 40 00 08 44 call 40009ae8 <_Workspace_Free> 400079dc: 90 10 00 13 mov %l3, %o0 return; 400079e0: 81 c7 e0 08 ret 400079e4: 81 e8 00 00 restore =============================================================================== 40007a94 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint32_t the_class ) { 40007a94: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 40007a98: 80 a6 60 00 cmp %i1, 0 40007a9c: 12 80 00 04 bne 40007aac <_Objects_Get_information+0x18> 40007aa0: a0 10 20 00 clr %l0 if ( info->maximum == 0 ) return NULL; #endif return info; } 40007aa4: 81 c7 e0 08 ret 40007aa8: 91 e8 00 10 restore %g0, %l0, %o0 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 40007aac: 40 00 12 42 call 4000c3b4 <_Objects_API_maximum_class> 40007ab0: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 40007ab4: 80 a2 20 00 cmp %o0, 0 40007ab8: 02 bf ff fb be 40007aa4 <_Objects_Get_information+0x10> 40007abc: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 40007ac0: 18 bf ff f9 bgu 40007aa4 <_Objects_Get_information+0x10> 40007ac4: 03 10 00 54 sethi %hi(0x40015000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 40007ac8: b1 2e 20 02 sll %i0, 2, %i0 40007acc: 82 10 61 7c or %g1, 0x17c, %g1 40007ad0: c2 00 40 18 ld [ %g1 + %i0 ], %g1 40007ad4: 80 a0 60 00 cmp %g1, 0 40007ad8: 02 bf ff f3 be 40007aa4 <_Objects_Get_information+0x10> <== NEVER TAKEN 40007adc: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 40007ae0: e0 00 40 19 ld [ %g1 + %i1 ], %l0 if ( !info ) 40007ae4: 80 a4 20 00 cmp %l0, 0 40007ae8: 02 bf ff ef be 40007aa4 <_Objects_Get_information+0x10> <== NEVER TAKEN 40007aec: 01 00 00 00 nop * In a multprocessing configuration, we may access remote objects. * Thus we may have 0 local instances and still have a valid object * pointer. */ #if !defined(RTEMS_MULTIPROCESSING) if ( info->maximum == 0 ) 40007af0: c2 14 20 10 lduh [ %l0 + 0x10 ], %g1 return NULL; 40007af4: 80 a0 00 01 cmp %g0, %g1 40007af8: 82 60 20 00 subx %g0, 0, %g1 40007afc: 10 bf ff ea b 40007aa4 <_Objects_Get_information+0x10> 40007b00: a0 0c 00 01 and %l0, %g1, %l0 =============================================================================== 40009844 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 40009844: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 40009848: 80 a6 60 00 cmp %i1, 0 4000984c: 12 80 00 05 bne 40009860 <_Objects_Get_name_as_string+0x1c> 40009850: 80 a6 a0 00 cmp %i2, 0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 40009854: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 40009858: 81 c7 e0 08 ret 4000985c: 91 e8 00 1a restore %g0, %i2, %o0 Objects_Id tmpId; if ( length == 0 ) return NULL; if ( name == NULL ) 40009860: 02 bf ff fe be 40009858 <_Objects_Get_name_as_string+0x14> 40009864: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 40009868: 12 80 00 04 bne 40009878 <_Objects_Get_name_as_string+0x34> 4000986c: 03 10 00 9e sethi %hi(0x40027800), %g1 40009870: c2 00 61 28 ld [ %g1 + 0x128 ], %g1 ! 40027928 <_Per_CPU_Information+0xc> 40009874: f0 00 60 08 ld [ %g1 + 8 ], %i0 information = _Objects_Get_information_id( tmpId ); 40009878: 7f ff ff b3 call 40009744 <_Objects_Get_information_id> 4000987c: 90 10 00 18 mov %i0, %o0 if ( !information ) 40009880: 80 a2 20 00 cmp %o0, 0 40009884: 22 bf ff f5 be,a 40009858 <_Objects_Get_name_as_string+0x14> 40009888: b4 10 20 00 clr %i2 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 4000988c: 92 10 00 18 mov %i0, %o1 40009890: 40 00 00 2d call 40009944 <_Objects_Get> 40009894: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 40009898: c2 07 bf fc ld [ %fp + -4 ], %g1 4000989c: 80 a0 60 00 cmp %g1, 0 400098a0: 32 bf ff ee bne,a 40009858 <_Objects_Get_name_as_string+0x14> 400098a4: b4 10 20 00 clr %i2 if ( information->is_string ) { s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 400098a8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 400098ac: c0 2f bf f4 clrb [ %fp + -12 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 400098b0: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 400098b4: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 400098b8: 85 30 60 08 srl %g1, 8, %g2 #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; 400098bc: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; 400098c0: c4 2f bf f2 stb %g2, [ %fp + -14 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 400098c4: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 400098c8: c2 2f bf f3 stb %g1, [ %fp + -13 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 400098cc: 84 10 00 04 mov %g4, %g2 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 400098d0: b2 86 7f ff addcc %i1, -1, %i1 400098d4: 02 80 00 19 be 40009938 <_Objects_Get_name_as_string+0xf4><== NEVER TAKEN 400098d8: 86 10 00 1a mov %i2, %g3 400098dc: 80 a1 20 00 cmp %g4, 0 400098e0: 02 80 00 16 be 40009938 <_Objects_Get_name_as_string+0xf4> 400098e4: 19 10 00 7c sethi %hi(0x4001f000), %o4 400098e8: 82 10 20 00 clr %g1 400098ec: 10 80 00 06 b 40009904 <_Objects_Get_name_as_string+0xc0> 400098f0: 98 13 20 b0 or %o4, 0xb0, %o4 400098f4: da 49 00 01 ldsb [ %g4 + %g1 ], %o5 400098f8: 80 a3 60 00 cmp %o5, 0 400098fc: 02 80 00 0f be 40009938 <_Objects_Get_name_as_string+0xf4> 40009900: c4 09 00 01 ldub [ %g4 + %g1 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 40009904: da 03 00 00 ld [ %o4 ], %o5 40009908: 88 08 a0 ff and %g2, 0xff, %g4 4000990c: 88 03 40 04 add %o5, %g4, %g4 40009910: da 49 20 01 ldsb [ %g4 + 1 ], %o5 40009914: 80 8b 60 97 btst 0x97, %o5 40009918: 12 80 00 03 bne 40009924 <_Objects_Get_name_as_string+0xe0> 4000991c: 88 07 bf f0 add %fp, -16, %g4 40009920: 84 10 20 2a mov 0x2a, %g2 40009924: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 40009928: 82 00 60 01 inc %g1 4000992c: 80 a0 40 19 cmp %g1, %i1 40009930: 0a bf ff f1 bcs 400098f4 <_Objects_Get_name_as_string+0xb0> 40009934: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 40009938: 40 00 02 4e call 4000a270 <_Thread_Enable_dispatch> 4000993c: c0 28 c0 00 clrb [ %g3 ] return name; 40009940: 30 bf ff c6 b,a 40009858 <_Objects_Get_name_as_string+0x14> =============================================================================== 40018f10 <_Objects_Get_no_protection>: /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 40018f10: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 40018f14: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1 /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 40018f18: 84 22 40 02 sub %o1, %g2, %g2 40018f1c: 84 00 a0 01 inc %g2 if ( information->maximum >= index ) { 40018f20: 80 a0 80 01 cmp %g2, %g1 40018f24: 18 80 00 09 bgu 40018f48 <_Objects_Get_no_protection+0x38> 40018f28: 85 28 a0 02 sll %g2, 2, %g2 if ( (the_object = information->local_table[ index ]) != NULL ) { 40018f2c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 40018f30: d0 00 40 02 ld [ %g1 + %g2 ], %o0 40018f34: 80 a2 20 00 cmp %o0, 0 40018f38: 02 80 00 05 be 40018f4c <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 40018f3c: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 40018f40: 81 c3 e0 08 retl 40018f44: c0 22 80 00 clr [ %o2 ] /* * This isn't supported or required yet for Global objects so * if it isn't local, we don't find it. */ *location = OBJECTS_ERROR; 40018f48: 82 10 20 01 mov 1, %g1 return NULL; 40018f4c: 90 10 20 00 clr %o0 } 40018f50: 81 c3 e0 08 retl 40018f54: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 40009324 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 40009324: 9d e3 bf 98 save %sp, -104, %sp /* * Caller is trusted for name != NULL. */ tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 40009328: 80 a6 20 00 cmp %i0, 0 4000932c: 12 80 00 06 bne 40009344 <_Objects_Id_to_name+0x20> 40009330: 83 36 20 18 srl %i0, 0x18, %g1 40009334: 03 10 00 7a sethi %hi(0x4001e800), %g1 40009338: c2 00 63 78 ld [ %g1 + 0x378 ], %g1 ! 4001eb78 <_Per_CPU_Information+0xc> 4000933c: f0 00 60 08 ld [ %g1 + 8 ], %i0 40009340: 83 36 20 18 srl %i0, 0x18, %g1 40009344: 82 08 60 07 and %g1, 7, %g1 */ RTEMS_INLINE_ROUTINE bool _Objects_Is_api_valid( uint32_t the_api ) { if ( !the_api || the_api > OBJECTS_APIS_LAST ) 40009348: 84 00 7f ff add %g1, -1, %g2 4000934c: 80 a0 a0 02 cmp %g2, 2 40009350: 18 80 00 17 bgu 400093ac <_Objects_Id_to_name+0x88> 40009354: a0 10 20 03 mov 3, %l0 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 40009358: 83 28 60 02 sll %g1, 2, %g1 4000935c: 05 10 00 7a sethi %hi(0x4001e800), %g2 40009360: 84 10 a0 6c or %g2, 0x6c, %g2 ! 4001e86c <_Objects_Information_table> 40009364: c2 00 80 01 ld [ %g2 + %g1 ], %g1 40009368: 80 a0 60 00 cmp %g1, 0 4000936c: 02 80 00 10 be 400093ac <_Objects_Id_to_name+0x88> <== NEVER TAKEN 40009370: 85 36 20 1b srl %i0, 0x1b, %g2 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 40009374: 85 28 a0 02 sll %g2, 2, %g2 40009378: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 4000937c: 80 a2 20 00 cmp %o0, 0 40009380: 02 80 00 0b be 400093ac <_Objects_Id_to_name+0x88> <== NEVER TAKEN 40009384: 92 10 00 18 mov %i0, %o1 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 40009388: 7f ff ff ca call 400092b0 <_Objects_Get> 4000938c: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 40009390: 80 a2 20 00 cmp %o0, 0 40009394: 02 80 00 06 be 400093ac <_Objects_Id_to_name+0x88> 40009398: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 4000939c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 400093a0: a0 10 20 00 clr %l0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 400093a4: 40 00 02 5e call 40009d1c <_Thread_Enable_dispatch> 400093a8: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 400093ac: 81 c7 e0 08 ret 400093b0: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 40007bec <_Objects_Initialize_information>: , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 40007bec: 9d e3 bf a0 save %sp, -96, %sp information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 40007bf0: 05 10 00 54 sethi %hi(0x40015000), %g2 40007bf4: 83 2e 60 02 sll %i1, 2, %g1 40007bf8: 84 10 a1 7c or %g2, 0x17c, %g2 40007bfc: c2 00 80 01 ld [ %g2 + %g1 ], %g1 uint32_t maximum_per_allocation; #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; 40007c00: f2 26 00 00 st %i1, [ %i0 ] information->the_class = the_class; 40007c04: f4 36 20 04 sth %i2, [ %i0 + 4 ] information->size = size; 40007c08: 85 2f 20 10 sll %i4, 0x10, %g2 information->local_table = 0; 40007c0c: c0 26 20 1c clr [ %i0 + 0x1c ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 40007c10: 85 30 a0 10 srl %g2, 0x10, %g2 information->local_table = 0; information->inactive_per_block = 0; 40007c14: c0 26 20 30 clr [ %i0 + 0x30 ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 40007c18: c4 26 20 18 st %g2, [ %i0 + 0x18 ] information->local_table = 0; information->inactive_per_block = 0; information->object_blocks = 0; 40007c1c: c0 26 20 34 clr [ %i0 + 0x34 ] information->inactive = 0; 40007c20: c0 36 20 2c clrh [ %i0 + 0x2c ] /* * Set the maximum value to 0. It will be updated when objects are * added to the inactive set from _Objects_Extend_information() */ information->maximum = 0; 40007c24: c0 36 20 10 clrh [ %i0 + 0x10 ] , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 40007c28: c6 07 a0 5c ld [ %fp + 0x5c ], %g3 information->maximum = 0; /* * Register this Object Class in the Object Information Table. */ _Objects_Information_table[ the_api ][ the_class ] = information; 40007c2c: 85 2e a0 02 sll %i2, 2, %g2 40007c30: f0 20 40 02 st %i0, [ %g1 + %g2 ] /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; 40007c34: 83 36 e0 1f srl %i3, 0x1f, %g1 _Objects_Information_table[ the_api ][ the_class ] = information; /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = 40007c38: c2 2e 20 12 stb %g1, [ %i0 + 0x12 ] maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 40007c3c: 80 a0 60 00 cmp %g1, 0 /* * Are we operating in limited or unlimited (e.g. auto-extend) mode. */ information->auto_extend = (maximum & OBJECTS_UNLIMITED_OBJECTS) ? true : false; maximum_per_allocation = maximum & ~OBJECTS_UNLIMITED_OBJECTS; 40007c40: 03 20 00 00 sethi %hi(0x80000000), %g1 /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 40007c44: 02 80 00 05 be 40007c58 <_Objects_Initialize_information+0x6c> 40007c48: b6 2e c0 01 andn %i3, %g1, %i3 40007c4c: 80 a6 e0 00 cmp %i3, 0 40007c50: 02 80 00 27 be 40007cec <_Objects_Initialize_information+0x100> 40007c54: 90 10 20 00 clr %o0 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007c58: 05 00 00 40 sethi %hi(0x10000), %g2 information->local_table = &null_local_table; /* * Calculate minimum and maximum Id's */ minimum_index = (maximum_per_allocation == 0) ? 0 : 1; 40007c5c: 80 a0 00 1b cmp %g0, %i3 40007c60: b3 2e 60 18 sll %i1, 0x18, %i1 40007c64: 82 40 20 00 addx %g0, 0, %g1 40007c68: b2 16 40 02 or %i1, %g2, %i1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40007c6c: b5 2e a0 1b sll %i2, 0x1b, %i2 information->allocation_size = maximum_per_allocation; /* * Provide a null local table entry for the case of any empty table. */ information->local_table = &null_local_table; 40007c70: 05 10 00 53 sethi %hi(0x40014c00), %g2 40007c74: b4 16 40 1a or %i1, %i2, %i2 40007c78: 84 10 a3 d0 or %g2, 0x3d0, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40007c7c: b4 16 80 01 or %i2, %g1, %i2 } /* * The allocation unit is the maximum value */ information->allocation_size = maximum_per_allocation; 40007c80: f6 36 20 14 sth %i3, [ %i0 + 0x14 ] /* * Provide a null local table entry for the case of any empty table. */ information->local_table = &null_local_table; 40007c84: c4 26 20 1c st %g2, [ %i0 + 0x1c ] /* * Calculate the maximum name length */ name_length = maximum_name_length; if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) 40007c88: 80 88 e0 03 btst 3, %g3 40007c8c: 12 80 00 0c bne 40007cbc <_Objects_Initialize_information+0xd0><== NEVER TAKEN 40007c90: f4 26 20 08 st %i2, [ %i0 + 8 ] */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 40007c94: 84 06 20 24 add %i0, 0x24, %g2 name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; _Chain_Initialize_empty( &information->Inactive ); 40007c98: 82 06 20 20 add %i0, 0x20, %g1 if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; 40007c9c: c6 36 20 38 sth %g3, [ %i0 + 0x38 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40007ca0: c4 26 20 20 st %g2, [ %i0 + 0x20 ] the_chain->permanent_null = NULL; 40007ca4: c0 26 20 24 clr [ %i0 + 0x24 ] _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 40007ca8: 80 a6 e0 00 cmp %i3, 0 40007cac: 12 80 00 0e bne 40007ce4 <_Objects_Initialize_information+0xf8> 40007cb0: c2 26 20 28 st %g1, [ %i0 + 0x28 ] 40007cb4: 81 c7 e0 08 ret 40007cb8: 81 e8 00 00 restore * Calculate the maximum name length */ name_length = maximum_name_length; if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & 40007cbc: 86 00 e0 04 add %g3, 4, %g3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 40007cc0: 84 06 20 24 add %i0, 0x24, %g2 <== NOT EXECUTED 40007cc4: 86 08 ff fc and %g3, -4, %g3 <== NOT EXECUTED ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; _Chain_Initialize_empty( &information->Inactive ); 40007cc8: 82 06 20 20 add %i0, 0x20, %g1 <== NOT EXECUTED if ( name_length & (OBJECTS_NAME_ALIGNMENT-1) ) name_length = (name_length + OBJECTS_NAME_ALIGNMENT) & ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; 40007ccc: c6 36 20 38 sth %g3, [ %i0 + 0x38 ] <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40007cd0: c4 26 20 20 st %g2, [ %i0 + 0x20 ] <== NOT EXECUTED the_chain->permanent_null = NULL; 40007cd4: c0 26 20 24 clr [ %i0 + 0x24 ] <== NOT EXECUTED _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 40007cd8: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 40007cdc: 02 bf ff f6 be 40007cb4 <_Objects_Initialize_information+0xc8><== NOT EXECUTED 40007ce0: c2 26 20 28 st %g1, [ %i0 + 0x28 ] <== NOT EXECUTED /* * Always have the maximum size available so the current performance * figures are create are met. If the user moves past the maximum * number then a performance hit is taken. */ _Objects_Extend_information( information ); 40007ce4: 7f ff fe 82 call 400076ec <_Objects_Extend_information> 40007ce8: 81 e8 00 00 restore /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { _Internal_error_Occurred( 40007cec: 92 10 20 01 mov 1, %o1 40007cf0: 7f ff fe 22 call 40007578 <_Internal_error_Occurred> 40007cf4: 94 10 20 13 mov 0x13, %o2 =============================================================================== 40007db4 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 40007db4: 9d e3 bf a0 save %sp, -96, %sp /* * Search the list to find block or chunk with all objects inactive. */ index_base = _Objects_Get_index( information->minimum_id ); 40007db8: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 block_count = (information->maximum - index_base) / 40007dbc: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 40007dc0: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 40007dc4: 92 10 00 11 mov %l1, %o1 40007dc8: 40 00 26 ea call 40011970 <.udiv> 40007dcc: 90 22 00 10 sub %o0, %l0, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 40007dd0: 80 a2 20 00 cmp %o0, 0 40007dd4: 02 80 00 34 be 40007ea4 <_Objects_Shrink_information+0xf0><== NEVER TAKEN 40007dd8: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 40007ddc: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 40007de0: c2 01 00 00 ld [ %g4 ], %g1 40007de4: 80 a4 40 01 cmp %l1, %g1 40007de8: 02 80 00 0f be 40007e24 <_Objects_Shrink_information+0x70><== NEVER TAKEN 40007dec: 82 10 20 00 clr %g1 40007df0: 10 80 00 07 b 40007e0c <_Objects_Shrink_information+0x58> 40007df4: a4 10 20 04 mov 4, %l2 information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 40007df8: 86 04 a0 04 add %l2, 4, %g3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 40007dfc: 80 a4 40 02 cmp %l1, %g2 40007e00: 02 80 00 0a be 40007e28 <_Objects_Shrink_information+0x74> 40007e04: a0 04 00 11 add %l0, %l1, %l0 40007e08: a4 10 00 03 mov %g3, %l2 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 40007e0c: 82 00 60 01 inc %g1 40007e10: 80 a2 00 01 cmp %o0, %g1 40007e14: 38 bf ff f9 bgu,a 40007df8 <_Objects_Shrink_information+0x44> 40007e18: c4 01 00 12 ld [ %g4 + %l2 ], %g2 40007e1c: 81 c7 e0 08 ret 40007e20: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 40007e24: a4 10 20 00 clr %l2 <== NOT EXECUTED information->allocation_size ) { /* * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; 40007e28: 10 80 00 06 b 40007e40 <_Objects_Shrink_information+0x8c> 40007e2c: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 40007e30: 80 a4 60 00 cmp %l1, 0 40007e34: 22 80 00 12 be,a 40007e7c <_Objects_Shrink_information+0xc8> 40007e38: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 40007e3c: 90 10 00 11 mov %l1, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) information->Inactive.first; do { index = _Objects_Get_index( the_object->id ); 40007e40: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 40007e44: 80 a0 40 10 cmp %g1, %l0 40007e48: 0a bf ff fa bcs 40007e30 <_Objects_Shrink_information+0x7c> 40007e4c: e2 02 00 00 ld [ %o0 ], %l1 (index < (index_base + information->allocation_size))) { 40007e50: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 40007e54: 84 04 00 02 add %l0, %g2, %g2 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 40007e58: 80 a0 40 02 cmp %g1, %g2 40007e5c: 1a bf ff f6 bcc 40007e34 <_Objects_Shrink_information+0x80> 40007e60: 80 a4 60 00 cmp %l1, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 40007e64: 7f ff fb 49 call 40006b88 <_Chain_Extract> 40007e68: 01 00 00 00 nop } } while ( the_object ); 40007e6c: 80 a4 60 00 cmp %l1, 0 40007e70: 12 bf ff f4 bne 40007e40 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 40007e74: 90 10 00 11 mov %l1, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 40007e78: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 40007e7c: 40 00 07 1b call 40009ae8 <_Workspace_Free> 40007e80: d0 00 40 12 ld [ %g1 + %l2 ], %o0 information->object_blocks[ block ] = NULL; 40007e84: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; 40007e88: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 40007e8c: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; 40007e90: c0 20 40 12 clr [ %g1 + %l2 ] information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 40007e94: c2 16 20 14 lduh [ %i0 + 0x14 ], %g1 * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); information->object_blocks[ block ] = NULL; information->inactive_per_block[ block ] = 0; 40007e98: c0 20 c0 12 clr [ %g3 + %l2 ] information->inactive -= information->allocation_size; 40007e9c: 82 20 80 01 sub %g2, %g1, %g1 40007ea0: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 40007ea4: 81 c7 e0 08 ret 40007ea8: 81 e8 00 00 restore =============================================================================== 40006534 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 40006534: 9d e3 bf 98 save %sp, -104, %sp rtems_initialization_tasks_table *user_tasks; /* * Move information into local variables */ user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table; 40006538: 03 10 00 52 sethi %hi(0x40014800), %g1 4000653c: 82 10 61 00 or %g1, 0x100, %g1 ! 40014900 40006540: e0 00 60 2c ld [ %g1 + 0x2c ], %l0 maximum = Configuration_RTEMS_API.number_of_initialization_tasks; /* * Verify that we have a set of user tasks to iterate */ if ( !user_tasks ) 40006544: 80 a4 20 00 cmp %l0, 0 40006548: 02 80 00 19 be 400065ac <_RTEMS_tasks_Initialize_user_tasks_body+0x78> 4000654c: e4 00 60 28 ld [ %g1 + 0x28 ], %l2 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 40006550: 80 a4 a0 00 cmp %l2, 0 40006554: 02 80 00 16 be 400065ac <_RTEMS_tasks_Initialize_user_tasks_body+0x78><== NEVER TAKEN 40006558: a2 10 20 00 clr %l1 4000655c: a6 07 bf fc add %fp, -4, %l3 return_value = rtems_task_create( 40006560: d4 04 20 04 ld [ %l0 + 4 ], %o2 40006564: d0 04 00 00 ld [ %l0 ], %o0 40006568: d2 04 20 08 ld [ %l0 + 8 ], %o1 4000656c: d6 04 20 14 ld [ %l0 + 0x14 ], %o3 40006570: d8 04 20 0c ld [ %l0 + 0xc ], %o4 40006574: 7f ff ff 6d call 40006328 40006578: 9a 10 00 13 mov %l3, %o5 user_tasks[ index ].stack_size, user_tasks[ index ].mode_set, user_tasks[ index ].attribute_set, &id ); if ( !rtems_is_status_successful( return_value ) ) 4000657c: 94 92 20 00 orcc %o0, 0, %o2 40006580: 12 80 00 0d bne 400065b4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 40006584: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 40006588: d4 04 20 18 ld [ %l0 + 0x18 ], %o2 4000658c: 40 00 00 0e call 400065c4 40006590: d2 04 20 10 ld [ %l0 + 0x10 ], %o1 id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) 40006594: 94 92 20 00 orcc %o0, 0, %o2 40006598: 12 80 00 07 bne 400065b4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 4000659c: a2 04 60 01 inc %l1 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 400065a0: 80 a4 80 11 cmp %l2, %l1 400065a4: 18 bf ff ef bgu 40006560 <_RTEMS_tasks_Initialize_user_tasks_body+0x2c><== NEVER TAKEN 400065a8: a0 04 20 1c add %l0, 0x1c, %l0 400065ac: 81 c7 e0 08 ret 400065b0: 81 e8 00 00 restore id, user_tasks[ index ].entry_point, user_tasks[ index ].argument ); if ( !rtems_is_status_successful( return_value ) ) _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); 400065b4: 90 10 20 01 mov 1, %o0 400065b8: 40 00 03 f0 call 40007578 <_Internal_error_Occurred> 400065bc: 92 10 20 01 mov 1, %o1 =============================================================================== 4000baf0 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 4000baf0: 9d e3 bf 98 save %sp, -104, %sp RTEMS_API_Control *api; ASR_Information *asr; rtems_signal_set signal_set; Modes_Control prev_mode; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 4000baf4: e0 06 21 5c ld [ %i0 + 0x15c ], %l0 if ( !api ) 4000baf8: 80 a4 20 00 cmp %l0, 0 4000bafc: 02 80 00 1f be 4000bb78 <_RTEMS_tasks_Post_switch_extension+0x88><== NEVER TAKEN 4000bb00: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 4000bb04: 7f ff d8 75 call 40001cd8 4000bb08: 01 00 00 00 nop signal_set = asr->signals_posted; 4000bb0c: e2 04 20 14 ld [ %l0 + 0x14 ], %l1 asr->signals_posted = 0; 4000bb10: c0 24 20 14 clr [ %l0 + 0x14 ] _ISR_Enable( level ); 4000bb14: 7f ff d8 75 call 40001ce8 4000bb18: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 4000bb1c: 80 a4 60 00 cmp %l1, 0 4000bb20: 32 80 00 04 bne,a 4000bb30 <_RTEMS_tasks_Post_switch_extension+0x40> 4000bb24: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000bb28: 81 c7 e0 08 ret 4000bb2c: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000bb30: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 4000bb34: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000bb38: a4 07 bf fc add %fp, -4, %l2 4000bb3c: 27 00 00 3f sethi %hi(0xfc00), %l3 4000bb40: 94 10 00 12 mov %l2, %o2 4000bb44: 92 14 e3 ff or %l3, 0x3ff, %o1 4000bb48: 40 00 08 22 call 4000dbd0 4000bb4c: c2 24 20 1c st %g1, [ %l0 + 0x1c ] (*asr->handler)( signal_set ); 4000bb50: c2 04 20 0c ld [ %l0 + 0xc ], %g1 4000bb54: 9f c0 40 00 call %g1 4000bb58: 90 10 00 11 mov %l1, %o0 asr->nest_level -= 1; 4000bb5c: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000bb60: d0 07 bf fc ld [ %fp + -4 ], %o0 asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); (*asr->handler)( signal_set ); asr->nest_level -= 1; 4000bb64: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000bb68: 92 14 e3 ff or %l3, 0x3ff, %o1 4000bb6c: 94 10 00 12 mov %l2, %o2 4000bb70: 40 00 08 18 call 4000dbd0 4000bb74: c2 24 20 1c st %g1, [ %l0 + 0x1c ] 4000bb78: 81 c7 e0 08 ret 4000bb7c: 81 e8 00 00 restore =============================================================================== 4000ba60 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 4000ba60: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 4000ba64: 80 a0 60 00 cmp %g1, 0 4000ba68: 22 80 00 0b be,a 4000ba94 <_RTEMS_tasks_Switch_extension+0x34> 4000ba6c: c2 02 61 68 ld [ %o1 + 0x168 ], %g1 tvp->tval = *tvp->ptr; 4000ba70: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 4000ba74: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 4000ba78: c8 00 80 00 ld [ %g2 ], %g4 4000ba7c: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; 4000ba80: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 4000ba84: 80 a0 60 00 cmp %g1, 0 4000ba88: 12 bf ff fa bne 4000ba70 <_RTEMS_tasks_Switch_extension+0x10><== NEVER TAKEN 4000ba8c: c6 20 80 00 st %g3, [ %g2 ] tvp->tval = *tvp->ptr; *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; 4000ba90: c2 02 61 68 ld [ %o1 + 0x168 ], %g1 while (tvp) { 4000ba94: 80 a0 60 00 cmp %g1, 0 4000ba98: 02 80 00 0a be 4000bac0 <_RTEMS_tasks_Switch_extension+0x60> 4000ba9c: 01 00 00 00 nop tvp->gval = *tvp->ptr; 4000baa0: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 4000baa4: c6 00 60 0c ld [ %g1 + 0xc ], %g3 tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { tvp->gval = *tvp->ptr; 4000baa8: c8 00 80 00 ld [ %g2 ], %g4 4000baac: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; tvp = (rtems_task_variable_t *)tvp->next; 4000bab0: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 4000bab4: 80 a0 60 00 cmp %g1, 0 4000bab8: 12 bf ff fa bne 4000baa0 <_RTEMS_tasks_Switch_extension+0x40><== NEVER TAKEN 4000babc: c6 20 80 00 st %g3, [ %g2 ] 4000bac0: 81 c3 e0 08 retl =============================================================================== 40007860 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 40007860: 9d e3 bf 98 save %sp, -104, %sp 40007864: 11 10 00 7b sethi %hi(0x4001ec00), %o0 40007868: 92 10 00 18 mov %i0, %o1 4000786c: 90 12 22 6c or %o0, 0x26c, %o0 40007870: 40 00 08 40 call 40009970 <_Objects_Get> 40007874: 94 07 bf fc add %fp, -4, %o2 /* * When we get here, the Timer is already off the chain so we do not * have to worry about that -- hence no _Watchdog_Remove(). */ the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 40007878: c2 07 bf fc ld [ %fp + -4 ], %g1 4000787c: 80 a0 60 00 cmp %g1, 0 40007880: 12 80 00 16 bne 400078d8 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 40007884: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: the_thread = the_period->owner; 40007888: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 4000788c: 03 00 00 10 sethi %hi(0x4000), %g1 */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_period ( States_Control the_states ) { return (the_states & STATES_WAITING_FOR_PERIOD); 40007890: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 40007894: 80 88 80 01 btst %g2, %g1 40007898: 22 80 00 08 be,a 400078b8 <_Rate_monotonic_Timeout+0x58> 4000789c: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 400078a0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 400078a4: c2 04 20 08 ld [ %l0 + 8 ], %g1 400078a8: 80 a0 80 01 cmp %g2, %g1 400078ac: 02 80 00 19 be 40007910 <_Rate_monotonic_Timeout+0xb0> 400078b0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { 400078b4: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 400078b8: 80 a0 60 01 cmp %g1, 1 400078bc: 02 80 00 09 be 400078e0 <_Rate_monotonic_Timeout+0x80> 400078c0: 82 10 20 04 mov 4, %g1 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 400078c4: c2 24 20 38 st %g1, [ %l0 + 0x38 ] */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 400078c8: 03 10 00 7b sethi %hi(0x4001ec00), %g1 400078cc: c4 00 63 d8 ld [ %g1 + 0x3d8 ], %g2 ! 4001efd8 <_Thread_Dispatch_disable_level> 400078d0: 84 00 bf ff add %g2, -1, %g2 400078d4: c4 20 63 d8 st %g2, [ %g1 + 0x3d8 ] 400078d8: 81 c7 e0 08 ret 400078dc: 81 e8 00 00 restore _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 400078e0: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 400078e4: 90 10 00 10 mov %l0, %o0 _Rate_monotonic_Initiate_statistics( the_period ); _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) { the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 400078e8: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 400078ec: 7f ff fe 4a call 40007214 <_Rate_monotonic_Initiate_statistics> 400078f0: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 400078f4: c2 04 20 3c ld [ %l0 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 400078f8: 11 10 00 7c sethi %hi(0x4001f000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 400078fc: c2 24 20 1c st %g1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40007900: 90 12 20 9c or %o0, 0x9c, %o0 40007904: 40 00 0f d0 call 4000b844 <_Watchdog_Insert> 40007908: 92 04 20 10 add %l0, 0x10, %o1 4000790c: 30 bf ff ef b,a 400078c8 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40007910: 40 00 09 9b call 40009f7c <_Thread_Clear_state> 40007914: 92 12 63 f8 or %o1, 0x3f8, %o1 the_thread = the_period->owner; if ( _States_Is_waiting_for_period( the_thread->current_state ) && the_thread->Wait.id == the_period->Object.id ) { _Thread_Unblock( the_thread ); _Rate_monotonic_Initiate_statistics( the_period ); 40007918: 10 bf ff f5 b 400078ec <_Rate_monotonic_Timeout+0x8c> 4000791c: 90 10 00 10 mov %l0, %o0 =============================================================================== 400070c0 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 400070c0: 9d e3 bf 98 save %sp, -104, %sp /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400070c4: 07 10 00 54 sethi %hi(0x40015000), %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400070c8: 03 10 00 52 sethi %hi(0x40014800), %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400070cc: da 00 e3 54 ld [ %g3 + 0x354 ], %o5 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400070d0: c4 00 61 44 ld [ %g1 + 0x144 ], %g2 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400070d4: 9a 03 60 01 inc %o5 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400070d8: 83 28 a0 02 sll %g2, 2, %g1 400070dc: 89 28 a0 07 sll %g2, 7, %g4 400070e0: 82 21 00 01 sub %g4, %g1, %g1 400070e4: 82 00 40 02 add %g1, %g2, %g1 400070e8: 83 28 60 03 sll %g1, 3, %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 400070ec: a0 07 bf f8 add %fp, -8, %l0 /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400070f0: da 20 e3 54 st %o5, [ %g3 + 0x354 ] /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 400070f4: 92 10 00 10 mov %l0, %o1 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400070f8: c2 27 bf fc st %g1, [ %fp + -4 ] 400070fc: c0 27 bf f8 clr [ %fp + -8 ] /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 40007100: 11 10 00 54 sethi %hi(0x40015000), %o0 40007104: 40 00 08 9b call 40009370 <_Timespec_Add_to> 40007108: 90 12 22 94 or %o0, 0x294, %o0 ! 40015294 <_TOD_Uptime> /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); 4000710c: 92 10 00 10 mov %l0, %o1 40007110: 11 10 00 54 sethi %hi(0x40015000), %o0 40007114: 40 00 08 97 call 40009370 <_Timespec_Add_to> 40007118: 90 12 22 a0 or %o0, 0x2a0, %o0 ! 400152a0 <_TOD_Now> while ( seconds ) { 4000711c: a0 92 20 00 orcc %o0, 0, %l0 40007120: 02 80 00 08 be 40007140 <_TOD_Tickle_ticks+0x80> 40007124: 23 10 00 54 sethi %hi(0x40015000), %l1 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 40007128: a2 14 62 d0 or %l1, 0x2d0, %l1 ! 400152d0 <_Watchdog_Seconds_chain> 4000712c: 40 00 0a 20 call 400099ac <_Watchdog_Tickle> 40007130: 90 10 00 11 mov %l1, %o0 40007134: a0 84 3f ff addcc %l0, -1, %l0 40007138: 12 bf ff fd bne 4000712c <_TOD_Tickle_ticks+0x6c> <== NEVER TAKEN 4000713c: 01 00 00 00 nop 40007140: 81 c7 e0 08 ret 40007144: 81 e8 00 00 restore =============================================================================== 400071c8 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 400071c8: 9d e3 bf a0 save %sp, -96, %sp uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 400071cc: 03 10 00 7b sethi %hi(0x4001ec00), %g1 */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 400071d0: a0 10 00 18 mov %i0, %l0 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); 400071d4: d2 00 63 b4 ld [ %g1 + 0x3b4 ], %o1 if ((!the_tod) || 400071d8: 80 a4 20 00 cmp %l0, 0 400071dc: 02 80 00 2c be 4000728c <_TOD_Validate+0xc4> <== NEVER TAKEN 400071e0: b0 10 20 00 clr %i0 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 400071e4: 11 00 03 d0 sethi %hi(0xf4000), %o0 400071e8: 40 00 49 74 call 400197b8 <.udiv> 400071ec: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 400071f0: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 400071f4: 80 a2 00 01 cmp %o0, %g1 400071f8: 08 80 00 25 bleu 4000728c <_TOD_Validate+0xc4> 400071fc: 01 00 00 00 nop (the_tod->ticks >= ticks_per_second) || 40007200: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 40007204: 80 a0 60 3b cmp %g1, 0x3b 40007208: 18 80 00 21 bgu 4000728c <_TOD_Validate+0xc4> 4000720c: 01 00 00 00 nop (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 40007210: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 40007214: 80 a0 60 3b cmp %g1, 0x3b 40007218: 18 80 00 1d bgu 4000728c <_TOD_Validate+0xc4> 4000721c: 01 00 00 00 nop (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 40007220: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40007224: 80 a0 60 17 cmp %g1, 0x17 40007228: 18 80 00 19 bgu 4000728c <_TOD_Validate+0xc4> 4000722c: 01 00 00 00 nop (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 40007230: c2 04 20 04 ld [ %l0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 40007234: 80 a0 60 00 cmp %g1, 0 40007238: 02 80 00 15 be 4000728c <_TOD_Validate+0xc4> <== NEVER TAKEN 4000723c: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 40007240: 18 80 00 13 bgu 4000728c <_TOD_Validate+0xc4> 40007244: 01 00 00 00 nop (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 40007248: c4 04 00 00 ld [ %l0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 4000724c: 80 a0 a7 c3 cmp %g2, 0x7c3 40007250: 08 80 00 0f bleu 4000728c <_TOD_Validate+0xc4> 40007254: 01 00 00 00 nop (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 40007258: c6 04 20 08 ld [ %l0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 4000725c: 80 a0 e0 00 cmp %g3, 0 40007260: 02 80 00 0b be 4000728c <_TOD_Validate+0xc4> <== NEVER TAKEN 40007264: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 40007268: 32 80 00 0b bne,a 40007294 <_TOD_Validate+0xcc> 4000726c: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 40007270: 82 00 60 0d add %g1, 0xd, %g1 40007274: 05 10 00 77 sethi %hi(0x4001dc00), %g2 40007278: 83 28 60 02 sll %g1, 2, %g1 4000727c: 84 10 a0 88 or %g2, 0x88, %g2 40007280: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 40007284: 80 a0 40 03 cmp %g1, %g3 40007288: b0 60 3f ff subx %g0, -1, %i0 if ( the_tod->day > days_in_month ) return false; return true; } 4000728c: 81 c7 e0 08 ret 40007290: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 40007294: 05 10 00 77 sethi %hi(0x4001dc00), %g2 40007298: 84 10 a0 88 or %g2, 0x88, %g2 ! 4001dc88 <_TOD_Days_per_month> 4000729c: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 400072a0: 80 a0 40 03 cmp %g1, %g3 400072a4: b0 60 3f ff subx %g0, -1, %i0 400072a8: 81 c7 e0 08 ret 400072ac: 81 e8 00 00 restore =============================================================================== 40007f78 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 40007f78: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 40007f7c: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 40007f80: 40 00 04 49 call 400090a4 <_Thread_Set_transient> 40007f84: 90 10 00 18 mov %i0, %o0 /* * Do not bother recomputing all the priority related information if * we are not REALLY changing priority. */ if ( the_thread->current_priority != new_priority ) 40007f88: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 40007f8c: 80 a0 40 19 cmp %g1, %i1 40007f90: 02 80 00 05 be 40007fa4 <_Thread_Change_priority+0x2c> 40007f94: a0 10 00 18 mov %i0, %l0 _Thread_Set_priority( the_thread, new_priority ); 40007f98: 90 10 00 18 mov %i0, %o0 40007f9c: 40 00 03 c6 call 40008eb4 <_Thread_Set_priority> 40007fa0: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 40007fa4: 7f ff e7 4d call 40001cd8 40007fa8: 01 00 00 00 nop 40007fac: b0 10 00 08 mov %o0, %i0 /* * If the thread has more than STATES_TRANSIENT set, then it is blocked, * If it is blocked on a thread queue, then we need to requeue it. */ state = the_thread->current_state; 40007fb0: f2 04 20 10 ld [ %l0 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 40007fb4: 80 a6 60 04 cmp %i1, 4 40007fb8: 02 80 00 18 be 40008018 <_Thread_Change_priority+0xa0> 40007fbc: 80 8c 60 04 btst 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 40007fc0: 02 80 00 0b be 40007fec <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 40007fc4: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 40007fc8: 7f ff e7 48 call 40001ce8 <== NOT EXECUTED 40007fcc: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 40007fd0: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 40007fd4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 40007fd8: 80 8e 40 01 btst %i1, %g1 <== NOT EXECUTED 40007fdc: 32 80 00 0d bne,a 40008010 <_Thread_Change_priority+0x98><== NOT EXECUTED 40007fe0: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 <== NOT EXECUTED 40007fe4: 81 c7 e0 08 ret 40007fe8: 81 e8 00 00 restore */ state = the_thread->current_state; if ( state != STATES_TRANSIENT ) { /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 40007fec: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 40007ff0: 7f ff e7 3e call 40001ce8 40007ff4: 90 10 00 18 mov %i0, %o0 40007ff8: 03 00 00 ef sethi %hi(0x3bc00), %g1 40007ffc: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 40008000: 80 8e 40 01 btst %i1, %g1 40008004: 02 bf ff f8 be 40007fe4 <_Thread_Change_priority+0x6c> 40008008: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 4000800c: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 40008010: 40 00 03 79 call 40008df4 <_Thread_queue_Requeue> 40008014: 93 e8 00 10 restore %g0, %l0, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 40008018: 12 80 00 14 bne 40008068 <_Thread_Change_priority+0xf0> <== NEVER TAKEN 4000801c: 33 10 00 54 sethi %hi(0x40015000), %i1 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 40008020: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 40008024: c4 14 20 96 lduh [ %l0 + 0x96 ], %g2 40008028: c6 10 40 00 lduh [ %g1 ], %g3 * Interrupts are STILL disabled. * We now know the thread will be in the READY state when we remove * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 4000802c: c0 24 20 10 clr [ %l0 + 0x10 ] 40008030: 84 10 c0 02 or %g3, %g2, %g2 40008034: c4 30 40 00 sth %g2, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 40008038: c4 16 62 b8 lduh [ %i1 + 0x2b8 ], %g2 4000803c: c2 14 20 94 lduh [ %l0 + 0x94 ], %g1 _Priority_Add_to_bit_map( &the_thread->Priority_map ); if ( prepend_it ) 40008040: 80 8e a0 ff btst 0xff, %i2 40008044: 82 10 80 01 or %g2, %g1, %g1 40008048: c2 36 62 b8 sth %g1, [ %i1 + 0x2b8 ] 4000804c: 02 80 00 47 be 40008168 <_Thread_Change_priority+0x1f0> 40008050: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 40008054: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 40008058: c2 24 20 04 st %g1, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 4000805c: e0 20 40 00 st %l0, [ %g1 ] the_node->next = before_node; 40008060: c4 24 00 00 st %g2, [ %l0 ] before_node->previous = the_node; 40008064: e0 20 a0 04 st %l0, [ %g2 + 4 ] _Chain_Prepend_unprotected( the_thread->ready, &the_thread->Object.Node ); else _Chain_Append_unprotected( the_thread->ready, &the_thread->Object.Node ); } _ISR_Flash( level ); 40008068: 7f ff e7 20 call 40001ce8 4000806c: 90 10 00 18 mov %i0, %o0 40008070: 7f ff e7 1a call 40001cd8 40008074: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40008078: c2 16 62 b8 lduh [ %i1 + 0x2b8 ], %g1 */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) _Thread_Ready_chain[ _Priority_Get_highest() ].first; 4000807c: 05 10 00 54 sethi %hi(0x40015000), %g2 40008080: 83 28 60 10 sll %g1, 0x10, %g1 40008084: da 00 a1 74 ld [ %g2 + 0x174 ], %o5 40008088: 85 30 60 10 srl %g1, 0x10, %g2 4000808c: 80 a0 a0 ff cmp %g2, 0xff 40008090: 08 80 00 26 bleu 40008128 <_Thread_Change_priority+0x1b0> 40008094: 07 10 00 4f sethi %hi(0x40013c00), %g3 40008098: 83 30 60 18 srl %g1, 0x18, %g1 4000809c: 86 10 e3 e8 or %g3, 0x3e8, %g3 400080a0: c4 08 c0 01 ldub [ %g3 + %g1 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 400080a4: 09 10 00 54 sethi %hi(0x40015000), %g4 400080a8: 85 28 a0 10 sll %g2, 0x10, %g2 400080ac: 88 11 23 30 or %g4, 0x330, %g4 400080b0: 83 30 a0 0f srl %g2, 0xf, %g1 400080b4: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 400080b8: 83 28 60 10 sll %g1, 0x10, %g1 400080bc: 89 30 60 10 srl %g1, 0x10, %g4 400080c0: 80 a1 20 ff cmp %g4, 0xff 400080c4: 18 80 00 27 bgu 40008160 <_Thread_Change_priority+0x1e8> 400080c8: 83 30 60 18 srl %g1, 0x18, %g1 400080cc: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 400080d0: 82 00 60 08 add %g1, 8, %g1 return (_Priority_Bits_index( major ) << 4) + 400080d4: 85 30 a0 0c srl %g2, 0xc, %g2 _Priority_Bits_index( minor ); 400080d8: 83 28 60 10 sll %g1, 0x10, %g1 400080dc: 83 30 60 10 srl %g1, 0x10, %g1 400080e0: 82 00 40 02 add %g1, %g2, %g1 400080e4: 85 28 60 02 sll %g1, 2, %g2 400080e8: 83 28 60 04 sll %g1, 4, %g1 400080ec: 82 20 40 02 sub %g1, %g2, %g1 * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 400080f0: c4 03 40 01 ld [ %o5 + %g1 ], %g2 400080f4: 03 10 00 55 sethi %hi(0x40015400), %g1 400080f8: 82 10 60 7c or %g1, 0x7c, %g1 ! 4001547c <_Per_CPU_Information> * is also the heir thread, and false otherwise. */ RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void ) { return ( _Thread_Executing == _Thread_Heir ); 400080fc: c6 00 60 0c ld [ %g1 + 0xc ], %g3 * We altered the set of thread priorities. So let's figure out * who is the heir and if we need to switch to them. */ _Thread_Calculate_heir(); if ( !_Thread_Is_executing_also_the_heir() && 40008100: 80 a0 80 03 cmp %g2, %g3 40008104: 02 80 00 07 be 40008120 <_Thread_Change_priority+0x1a8> 40008108: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 4000810c: c4 08 e0 74 ldub [ %g3 + 0x74 ], %g2 40008110: 80 a0 a0 00 cmp %g2, 0 40008114: 02 80 00 03 be 40008120 <_Thread_Change_priority+0x1a8> 40008118: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Context_Switch_necessary = true; 4000811c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 40008120: 7f ff e6 f2 call 40001ce8 40008124: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40008128: 86 10 e3 e8 or %g3, 0x3e8, %g3 4000812c: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 40008130: 09 10 00 54 sethi %hi(0x40015000), %g4 RTEMS_INLINE_ROUTINE Priority_Control _Priority_Get_highest( void ) { Priority_Bit_map_control minor; Priority_Bit_map_control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40008134: 84 00 a0 08 add %g2, 8, %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 40008138: 88 11 23 30 or %g4, 0x330, %g4 4000813c: 85 28 a0 10 sll %g2, 0x10, %g2 40008140: 83 30 a0 0f srl %g2, 0xf, %g1 40008144: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 40008148: 83 28 60 10 sll %g1, 0x10, %g1 4000814c: 89 30 60 10 srl %g1, 0x10, %g4 40008150: 80 a1 20 ff cmp %g4, 0xff 40008154: 28 bf ff df bleu,a 400080d0 <_Thread_Change_priority+0x158> 40008158: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 4000815c: 83 30 60 18 srl %g1, 0x18, %g1 40008160: 10 bf ff dd b 400080d4 <_Thread_Change_priority+0x15c> 40008164: c2 08 c0 01 ldub [ %g3 + %g1 ], %g1 ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 40008168: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000816c: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 40008170: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 40008174: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 40008178: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 4000817c: 10 bf ff bb b 40008068 <_Thread_Change_priority+0xf0> 40008180: c4 24 20 04 st %g2, [ %l0 + 4 ] =============================================================================== 40008184 <_Thread_Clear_state>: void _Thread_Clear_state( Thread_Control *the_thread, States_Control state ) { 40008184: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 40008188: 7f ff e6 d4 call 40001cd8 4000818c: a0 10 00 18 mov %i0, %l0 40008190: b0 10 00 08 mov %o0, %i0 current_state = the_thread->current_state; 40008194: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & state ) { 40008198: 80 8e 40 01 btst %i1, %g1 4000819c: 02 80 00 06 be 400081b4 <_Thread_Clear_state+0x30> 400081a0: 01 00 00 00 nop RTEMS_INLINE_ROUTINE States_Control _States_Clear ( States_Control states_to_clear, States_Control current_state ) { return (current_state & ~states_to_clear); 400081a4: b2 28 40 19 andn %g1, %i1, %i1 current_state = the_thread->current_state = _States_Clear( state, current_state ); if ( _States_Is_ready( current_state ) ) { 400081a8: 80 a6 60 00 cmp %i1, 0 400081ac: 02 80 00 04 be 400081bc <_Thread_Clear_state+0x38> 400081b0: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_thread->current_priority == 0 ) _Context_Switch_necessary = true; } } } _ISR_Enable( level ); 400081b4: 7f ff e6 cd call 40001ce8 400081b8: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 400081bc: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 400081c0: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 400081c4: c8 10 40 00 lduh [ %g1 ], %g4 _Priority_Major_bit_map |= the_priority_map->ready_major; 400081c8: 05 10 00 54 sethi %hi(0x40015000), %g2 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 400081cc: 86 11 00 03 or %g4, %g3, %g3 400081d0: c6 30 40 00 sth %g3, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 400081d4: c8 10 a2 b8 lduh [ %g2 + 0x2b8 ], %g4 400081d8: c6 14 20 94 lduh [ %l0 + 0x94 ], %g3 if ( _States_Is_ready( current_state ) ) { _Priority_Add_to_bit_map( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 400081dc: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 400081e0: 86 11 00 03 or %g4, %g3, %g3 400081e4: c6 30 a2 b8 sth %g3, [ %g2 + 0x2b8 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 400081e8: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400081ec: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 400081f0: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 400081f4: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 400081f8: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 400081fc: c4 24 20 04 st %g2, [ %l0 + 4 ] _ISR_Flash( level ); 40008200: 7f ff e6 ba call 40001ce8 40008204: 01 00 00 00 nop 40008208: 7f ff e6 b4 call 40001cd8 4000820c: 01 00 00 00 nop * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( the_thread->current_priority < _Thread_Heir->current_priority ) { 40008210: 03 10 00 55 sethi %hi(0x40015400), %g1 40008214: 82 10 60 7c or %g1, 0x7c, %g1 ! 4001547c <_Per_CPU_Information> 40008218: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 4000821c: c4 04 20 14 ld [ %l0 + 0x14 ], %g2 40008220: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 40008224: 80 a0 80 03 cmp %g2, %g3 40008228: 1a bf ff e3 bcc 400081b4 <_Thread_Clear_state+0x30> 4000822c: 01 00 00 00 nop _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 40008230: c6 00 60 0c ld [ %g1 + 0xc ], %g3 * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( the_thread->current_priority < _Thread_Heir->current_priority ) { _Thread_Heir = the_thread; 40008234: e0 20 60 10 st %l0, [ %g1 + 0x10 ] if ( _Thread_Executing->is_preemptible || 40008238: c6 08 e0 74 ldub [ %g3 + 0x74 ], %g3 4000823c: 80 a0 e0 00 cmp %g3, 0 40008240: 32 80 00 05 bne,a 40008254 <_Thread_Clear_state+0xd0> 40008244: 84 10 20 01 mov 1, %g2 40008248: 80 a0 a0 00 cmp %g2, 0 4000824c: 12 bf ff da bne 400081b4 <_Thread_Clear_state+0x30> <== ALWAYS TAKEN 40008250: 84 10 20 01 mov 1, %g2 the_thread->current_priority == 0 ) _Context_Switch_necessary = true; 40008254: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] } } } _ISR_Enable( level ); 40008258: 7f ff e6 a4 call 40001ce8 4000825c: 81 e8 00 00 restore =============================================================================== 400083d4 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 400083d4: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 400083d8: 90 10 00 18 mov %i0, %o0 400083dc: 40 00 00 6c call 4000858c <_Thread_Get> 400083e0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 400083e4: c2 07 bf fc ld [ %fp + -4 ], %g1 400083e8: 80 a0 60 00 cmp %g1, 0 400083ec: 12 80 00 08 bne 4000840c <_Thread_Delay_ended+0x38> <== NEVER TAKEN 400083f0: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 400083f4: 7f ff ff 64 call 40008184 <_Thread_Clear_state> 400083f8: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 400083fc: 03 10 00 54 sethi %hi(0x40015000), %g1 40008400: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 40015218 <_Thread_Dispatch_disable_level> 40008404: 84 00 bf ff add %g2, -1, %g2 40008408: c4 20 62 18 st %g2, [ %g1 + 0x218 ] 4000840c: 81 c7 e0 08 ret 40008410: 81 e8 00 00 restore =============================================================================== 40008414 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 40008414: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 40008418: 25 10 00 55 sethi %hi(0x40015400), %l2 4000841c: a4 14 a0 7c or %l2, 0x7c, %l2 ! 4001547c <_Per_CPU_Information> _ISR_Disable( level ); 40008420: 7f ff e6 2e call 40001cd8 40008424: e2 04 a0 0c ld [ %l2 + 0xc ], %l1 while ( _Context_Switch_necessary == true ) { 40008428: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 4000842c: 80 a0 60 00 cmp %g1, 0 40008430: 02 80 00 42 be 40008538 <_Thread_Dispatch+0x124> 40008434: 2d 10 00 54 sethi %hi(0x40015000), %l6 heir = _Thread_Heir; 40008438: e0 04 a0 10 ld [ %l2 + 0x10 ], %l0 _Thread_Dispatch_disable_level = 1; 4000843c: 82 10 20 01 mov 1, %g1 40008440: c2 25 a2 18 st %g1, [ %l6 + 0x218 ] _Context_Switch_necessary = false; 40008444: c0 2c a0 18 clrb [ %l2 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 40008448: 80 a4 40 10 cmp %l1, %l0 4000844c: 02 80 00 3b be 40008538 <_Thread_Dispatch+0x124> 40008450: e0 24 a0 0c st %l0, [ %l2 + 0xc ] 40008454: 27 10 00 54 sethi %hi(0x40015000), %l3 40008458: 3b 10 00 54 sethi %hi(0x40015000), %i5 4000845c: a6 14 e2 c8 or %l3, 0x2c8, %l3 40008460: aa 07 bf f8 add %fp, -8, %l5 40008464: a8 07 bf f0 add %fp, -16, %l4 40008468: ba 17 62 9c or %i5, 0x29c, %i5 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000846c: 37 10 00 54 sethi %hi(0x40015000), %i3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 40008470: ae 10 00 13 mov %l3, %l7 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 40008474: 10 80 00 2b b 40008520 <_Thread_Dispatch+0x10c> 40008478: b8 10 20 01 mov 1, %i4 rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; _ISR_Enable( level ); 4000847c: 7f ff e6 1b call 40001ce8 40008480: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 40008484: 40 00 0e bd call 4000bf78 <_TOD_Get_uptime> 40008488: 90 10 00 15 mov %l5, %o0 _Timestamp_Subtract( 4000848c: 90 10 00 17 mov %l7, %o0 40008490: 92 10 00 15 mov %l5, %o1 40008494: 40 00 03 d0 call 400093d4 <_Timespec_Subtract> 40008498: 94 10 00 14 mov %l4, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 4000849c: 92 10 00 14 mov %l4, %o1 400084a0: 40 00 03 b4 call 40009370 <_Timespec_Add_to> 400084a4: 90 04 60 84 add %l1, 0x84, %o0 _Thread_Time_of_last_context_switch = uptime; 400084a8: c4 07 bf f8 ld [ %fp + -8 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 400084ac: c2 07 40 00 ld [ %i5 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 400084b0: c4 24 c0 00 st %g2, [ %l3 ] 400084b4: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( _Thread_libc_reent ) { executing->libc_reent = *_Thread_libc_reent; *_Thread_libc_reent = heir->libc_reent; } _User_extensions_Thread_switch( executing, heir ); 400084b8: 90 10 00 11 mov %l1, %o0 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 400084bc: c4 24 e0 04 st %g2, [ %l3 + 4 ] #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 400084c0: 80 a0 60 00 cmp %g1, 0 400084c4: 02 80 00 06 be 400084dc <_Thread_Dispatch+0xc8> <== NEVER TAKEN 400084c8: 92 10 00 10 mov %l0, %o1 executing->libc_reent = *_Thread_libc_reent; 400084cc: c4 00 40 00 ld [ %g1 ], %g2 400084d0: c4 24 61 58 st %g2, [ %l1 + 0x158 ] *_Thread_libc_reent = heir->libc_reent; 400084d4: c4 04 21 58 ld [ %l0 + 0x158 ], %g2 400084d8: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 400084dc: 40 00 04 82 call 400096e4 <_User_extensions_Thread_switch> 400084e0: 01 00 00 00 nop if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 400084e4: 90 04 60 d0 add %l1, 0xd0, %o0 400084e8: 40 00 05 96 call 40009b40 <_CPU_Context_switch> 400084ec: 92 04 20 d0 add %l0, 0xd0, %o1 #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 400084f0: 7f ff e5 fa call 40001cd8 400084f4: e2 04 a0 0c ld [ %l2 + 0xc ], %l1 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Context_Switch_necessary == true ) { 400084f8: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 400084fc: 80 a0 60 00 cmp %g1, 0 40008500: 02 80 00 0e be 40008538 <_Thread_Dispatch+0x124> 40008504: 01 00 00 00 nop heir = _Thread_Heir; 40008508: e0 04 a0 10 ld [ %l2 + 0x10 ], %l0 _Thread_Dispatch_disable_level = 1; 4000850c: f8 25 a2 18 st %i4, [ %l6 + 0x218 ] _Context_Switch_necessary = false; 40008510: c0 2c a0 18 clrb [ %l2 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 40008514: 80 a4 00 11 cmp %l0, %l1 40008518: 02 80 00 08 be 40008538 <_Thread_Dispatch+0x124> <== NEVER TAKEN 4000851c: e0 24 a0 0c st %l0, [ %l2 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 40008520: c2 04 20 7c ld [ %l0 + 0x7c ], %g1 40008524: 80 a0 60 01 cmp %g1, 1 40008528: 12 bf ff d5 bne 4000847c <_Thread_Dispatch+0x68> 4000852c: c2 06 e1 78 ld [ %i3 + 0x178 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 40008530: 10 bf ff d3 b 4000847c <_Thread_Dispatch+0x68> 40008534: c2 24 20 78 st %g1, [ %l0 + 0x78 ] _ISR_Disable( level ); } post_switch: _Thread_Dispatch_disable_level = 0; 40008538: c0 25 a2 18 clr [ %l6 + 0x218 ] _ISR_Enable( level ); 4000853c: 7f ff e5 eb call 40001ce8 40008540: 01 00 00 00 nop _API_extensions_Run_postswitch(); 40008544: 7f ff f9 39 call 40006a28 <_API_extensions_Run_postswitch> 40008548: 01 00 00 00 nop } 4000854c: 81 c7 e0 08 ret 40008550: 81 e8 00 00 restore =============================================================================== 4000858c <_Thread_Get>: Thread_Control *_Thread_Get ( Objects_Id id, Objects_Locations *location ) { 4000858c: 82 10 00 08 mov %o0, %g1 uint32_t the_class; Objects_Information **api_information; Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { 40008590: 80 a2 20 00 cmp %o0, 0 40008594: 02 80 00 1d be 40008608 <_Thread_Get+0x7c> 40008598: 94 10 00 09 mov %o1, %o2 */ RTEMS_INLINE_ROUTINE Objects_APIs _Objects_Get_API( Objects_Id id ) { return (Objects_APIs) ((id >> OBJECTS_API_START_BIT) & OBJECTS_API_VALID_BITS); 4000859c: 85 32 20 18 srl %o0, 0x18, %g2 400085a0: 84 08 a0 07 and %g2, 7, %g2 */ RTEMS_INLINE_ROUTINE bool _Objects_Is_api_valid( uint32_t the_api ) { if ( !the_api || the_api > OBJECTS_APIS_LAST ) 400085a4: 86 00 bf ff add %g2, -1, %g3 400085a8: 80 a0 e0 02 cmp %g3, 2 400085ac: 38 80 00 14 bgu,a 400085fc <_Thread_Get+0x70> 400085b0: 82 10 20 01 mov 1, %g1 */ RTEMS_INLINE_ROUTINE uint32_t _Objects_Get_class( Objects_Id id ) { return (uint32_t) 400085b4: 89 32 20 1b srl %o0, 0x1b, %g4 *location = OBJECTS_ERROR; goto done; } the_class = _Objects_Get_class( id ); if ( the_class != 1 ) { /* threads are always first class :) */ 400085b8: 80 a1 20 01 cmp %g4, 1 400085bc: 32 80 00 10 bne,a 400085fc <_Thread_Get+0x70> 400085c0: 82 10 20 01 mov 1, %g1 *location = OBJECTS_ERROR; goto done; } api_information = _Objects_Information_table[ the_api ]; 400085c4: 85 28 a0 02 sll %g2, 2, %g2 400085c8: 07 10 00 54 sethi %hi(0x40015000), %g3 400085cc: 86 10 e1 7c or %g3, 0x17c, %g3 ! 4001517c <_Objects_Information_table> 400085d0: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 if ( !api_information ) { 400085d4: 80 a0 a0 00 cmp %g2, 0 400085d8: 22 80 00 16 be,a 40008630 <_Thread_Get+0xa4> <== NEVER TAKEN 400085dc: c8 22 80 00 st %g4, [ %o2 ] <== NOT EXECUTED *location = OBJECTS_ERROR; goto done; } information = api_information[ the_class ]; 400085e0: d0 00 a0 04 ld [ %g2 + 4 ], %o0 if ( !information ) { 400085e4: 80 a2 20 00 cmp %o0, 0 400085e8: 02 80 00 10 be 40008628 <_Thread_Get+0x9c> 400085ec: 92 10 00 01 mov %g1, %o1 *location = OBJECTS_ERROR; goto done; } tp = (Thread_Control *) _Objects_Get( information, id, location ); 400085f0: 82 13 c0 00 mov %o7, %g1 400085f4: 7f ff fd 61 call 40007b78 <_Objects_Get> 400085f8: 9e 10 40 00 mov %g1, %o7 { uint32_t the_api; uint32_t the_class; Objects_Information **api_information; Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; 400085fc: 90 10 20 00 clr %o0 } the_class = _Objects_Get_class( id ); if ( the_class != 1 ) { /* threads are always first class :) */ *location = OBJECTS_ERROR; goto done; 40008600: 81 c3 e0 08 retl 40008604: c2 22 80 00 st %g1, [ %o2 ] rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 40008608: 03 10 00 54 sethi %hi(0x40015000), %g1 4000860c: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 40015218 <_Thread_Dispatch_disable_level> 40008610: 84 00 a0 01 inc %g2 40008614: c4 20 62 18 st %g2, [ %g1 + 0x218 ] Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { _Thread_Disable_dispatch(); *location = OBJECTS_LOCAL; tp = _Thread_Executing; 40008618: 03 10 00 55 sethi %hi(0x40015400), %g1 Objects_Information *information; Thread_Control *tp = (Thread_Control *) 0; if ( _Objects_Are_ids_equal( id, OBJECTS_ID_OF_SELF ) ) { _Thread_Disable_dispatch(); *location = OBJECTS_LOCAL; 4000861c: c0 22 40 00 clr [ %o1 ] tp = _Thread_Executing; goto done; 40008620: 81 c3 e0 08 retl 40008624: d0 00 60 88 ld [ %g1 + 0x88 ], %o0 } information = api_information[ the_class ]; if ( !information ) { *location = OBJECTS_ERROR; goto done; 40008628: 81 c3 e0 08 retl 4000862c: c8 22 80 00 st %g4, [ %o2 ] } api_information = _Objects_Information_table[ the_api ]; if ( !api_information ) { *location = OBJECTS_ERROR; goto done; 40008630: 81 c3 e0 08 retl <== NOT EXECUTED 40008634: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 4000df70 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 4000df70: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 4000df74: 03 10 00 55 sethi %hi(0x40015400), %g1 4000df78: e0 00 60 88 ld [ %g1 + 0x88 ], %l0 ! 40015488 <_Per_CPU_Information+0xc> /* * Some CPUs need to tinker with the call frame or registers when the * thread actually begins to execute for the first time. This is a * hook point where the port gets a shot at doing whatever it requires. */ _Context_Initialization_at_thread_begin(); 4000df7c: 3f 10 00 37 sethi %hi(0x4000dc00), %i7 4000df80: be 17 e3 70 or %i7, 0x370, %i7 ! 4000df70 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 4000df84: d0 04 20 b8 ld [ %l0 + 0xb8 ], %o0 _ISR_Set_level(level); 4000df88: 7f ff cf 58 call 40001ce8 4000df8c: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 4000df90: 03 10 00 53 sethi %hi(0x40014c00), %g1 doneConstructors = 1; 4000df94: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 4000df98: e2 08 63 d8 ldub [ %g1 + 0x3d8 ], %l1 /* * Take care that 'begin' extensions get to complete before * 'switch' extensions can run. This means must keep dispatch * disabled until all 'begin' extensions complete. */ _User_extensions_Thread_begin( executing ); 4000df9c: 90 10 00 10 mov %l0, %o0 4000dfa0: 7f ff ed 51 call 400094e4 <_User_extensions_Thread_begin> 4000dfa4: c4 28 63 d8 stb %g2, [ %g1 + 0x3d8 ] /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 4000dfa8: 7f ff e9 6b call 40008554 <_Thread_Enable_dispatch> 4000dfac: a3 2c 60 18 sll %l1, 0x18, %l1 /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { 4000dfb0: 80 a4 60 00 cmp %l1, 0 4000dfb4: 02 80 00 0c be 4000dfe4 <_Thread_Handler+0x74> 4000dfb8: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000dfbc: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 4000dfc0: 80 a0 60 00 cmp %g1, 0 4000dfc4: 22 80 00 0f be,a 4000e000 <_Thread_Handler+0x90> <== ALWAYS TAKEN 4000dfc8: c2 04 20 9c ld [ %l0 + 0x9c ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 4000dfcc: 7f ff ed 5a call 40009534 <_User_extensions_Thread_exitted> 4000dfd0: 90 10 00 10 mov %l0, %o0 _Internal_error_Occurred( 4000dfd4: 90 10 20 00 clr %o0 4000dfd8: 92 10 20 01 mov 1, %o1 4000dfdc: 7f ff e5 67 call 40007578 <_Internal_error_Occurred> 4000dfe0: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { INIT_NAME (); 4000dfe4: 40 00 1a 17 call 40014840 <_init> 4000dfe8: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000dfec: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 4000dff0: 80 a0 60 00 cmp %g1, 0 4000dff4: 12 bf ff f6 bne 4000dfcc <_Thread_Handler+0x5c> <== NEVER TAKEN 4000dff8: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 4000dffc: c2 04 20 9c ld [ %l0 + 0x9c ], %g1 4000e000: 9f c0 40 00 call %g1 4000e004: d0 04 20 a8 ld [ %l0 + 0xa8 ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 4000e008: 10 bf ff f1 b 4000dfcc <_Thread_Handler+0x5c> 4000e00c: d0 24 20 28 st %o0, [ %l0 + 0x28 ] =============================================================================== 40008638 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 40008638: 9d e3 bf a0 save %sp, -96, %sp 4000863c: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 40008640: e0 0f a0 5f ldub [ %fp + 0x5f ], %l0 40008644: e2 00 40 00 ld [ %g1 ], %l1 /* * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; 40008648: c0 26 61 5c clr [ %i1 + 0x15c ] 4000864c: c0 26 61 60 clr [ %i1 + 0x160 ] extensions_area = NULL; the_thread->libc_reent = NULL; 40008650: c0 26 61 58 clr [ %i1 + 0x158 ] /* * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 40008654: 90 10 00 19 mov %i1, %o0 40008658: 40 00 02 b7 call 40009134 <_Thread_Stack_Allocate> 4000865c: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 40008660: 80 a2 00 1b cmp %o0, %i3 40008664: 0a 80 00 49 bcs 40008788 <_Thread_Initialize+0x150> 40008668: 80 a2 20 00 cmp %o0, 0 4000866c: 02 80 00 47 be 40008788 <_Thread_Initialize+0x150> <== NEVER TAKEN 40008670: 25 10 00 54 sethi %hi(0x40015000), %l2 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 40008674: c4 06 60 c8 ld [ %i1 + 0xc8 ], %g2 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 40008678: c2 04 a2 a8 ld [ %l2 + 0x2a8 ], %g1 4000867c: c4 26 60 c4 st %g2, [ %i1 + 0xc4 ] the_stack->size = size; 40008680: d0 26 60 c0 st %o0, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 40008684: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 40008688: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 4000868c: c0 26 60 68 clr [ %i1 + 0x68 ] 40008690: 80 a0 60 00 cmp %g1, 0 40008694: 12 80 00 40 bne 40008794 <_Thread_Initialize+0x15c> 40008698: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 4000869c: c0 26 61 64 clr [ %i1 + 0x164 ] * Zero out all the allocated memory fields */ for ( i=0 ; i <= THREAD_API_LAST ; i++ ) the_thread->API_Extensions[i] = NULL; extensions_area = NULL; 400086a0: b6 10 20 00 clr %i3 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400086a4: c2 07 a0 60 ld [ %fp + 0x60 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; the_thread->resource_count = 0; the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 400086a8: 90 10 00 19 mov %i1, %o0 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400086ac: c2 26 60 b0 st %g1, [ %i1 + 0xb0 ] the_thread->Start.budget_callout = budget_callout; 400086b0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; the_thread->resource_count = 0; the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 400086b4: 92 10 00 1d mov %i5, %o1 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 400086b8: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 400086bc: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; the_thread->resource_count = 0; the_thread->real_priority = priority; 400086c0: fa 26 60 18 st %i5, [ %i1 + 0x18 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 400086c4: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] the_thread->current_state = STATES_DORMANT; 400086c8: 82 10 20 01 mov 1, %g1 the_thread->Wait.queue = NULL; the_thread->resource_count = 0; the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; 400086cc: fa 26 60 bc st %i5, [ %i1 + 0xbc ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 400086d0: c2 26 60 10 st %g1, [ %i1 + 0x10 ] /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 400086d4: e0 2e 60 ac stb %l0, [ %i1 + 0xac ] } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 400086d8: c0 26 60 44 clr [ %i1 + 0x44 ] the_thread->resource_count = 0; the_thread->real_priority = priority; the_thread->Start.initial_priority = priority; _Thread_Set_priority( the_thread, priority ); 400086dc: 40 00 01 f6 call 40008eb4 <_Thread_Set_priority> 400086e0: c0 26 60 1c clr [ %i1 + 0x1c ] _Thread_Stack_Free( the_thread ); return false; } 400086e4: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 400086e8: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 400086ec: c0 26 60 84 clr [ %i1 + 0x84 ] 400086f0: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 400086f4: 83 28 60 02 sll %g1, 2, %g1 400086f8: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 400086fc: e2 26 60 0c st %l1, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 40008700: 90 10 00 19 mov %i1, %o0 40008704: 40 00 03 b3 call 400095d0 <_User_extensions_Thread_create> 40008708: b0 10 20 01 mov 1, %i0 if ( extension_status ) 4000870c: 80 8a 20 ff btst 0xff, %o0 40008710: 12 80 00 1f bne 4000878c <_Thread_Initialize+0x154> 40008714: 01 00 00 00 nop return true; failed: if ( the_thread->libc_reent ) 40008718: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 4000871c: 80 a2 20 00 cmp %o0, 0 40008720: 22 80 00 05 be,a 40008734 <_Thread_Initialize+0xfc> 40008724: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( the_thread->libc_reent ); 40008728: 40 00 04 f0 call 40009ae8 <_Workspace_Free> 4000872c: 01 00 00 00 nop for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 40008730: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 40008734: 80 a2 20 00 cmp %o0, 0 40008738: 22 80 00 05 be,a 4000874c <_Thread_Initialize+0x114> 4000873c: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 40008740: 40 00 04 ea call 40009ae8 <_Workspace_Free> 40008744: 01 00 00 00 nop failed: if ( the_thread->libc_reent ) _Workspace_Free( the_thread->libc_reent ); for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 40008748: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 4000874c: 80 a2 20 00 cmp %o0, 0 40008750: 02 80 00 05 be 40008764 <_Thread_Initialize+0x12c> <== ALWAYS TAKEN 40008754: 80 a6 e0 00 cmp %i3, 0 _Workspace_Free( the_thread->API_Extensions[i] ); 40008758: 40 00 04 e4 call 40009ae8 <_Workspace_Free> <== NOT EXECUTED 4000875c: 01 00 00 00 nop <== NOT EXECUTED if ( extensions_area ) 40008760: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 40008764: 02 80 00 05 be 40008778 <_Thread_Initialize+0x140> 40008768: 90 10 00 19 mov %i1, %o0 (void) _Workspace_Free( extensions_area ); 4000876c: 40 00 04 df call 40009ae8 <_Workspace_Free> 40008770: 90 10 00 1b mov %i3, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( fp_area ) (void) _Workspace_Free( fp_area ); #endif _Thread_Stack_Free( the_thread ); 40008774: 90 10 00 19 mov %i1, %o0 40008778: 40 00 02 8a call 400091a0 <_Thread_Stack_Free> 4000877c: b0 10 20 00 clr %i0 return false; 40008780: 81 c7 e0 08 ret 40008784: 81 e8 00 00 restore * Allocate and Initialize the stack for this thread. */ #if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 40008788: b0 10 20 00 clr %i0 _Thread_Stack_Free( the_thread ); return false; } 4000878c: 81 c7 e0 08 ret 40008790: 81 e8 00 00 restore /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 40008794: 82 00 60 01 inc %g1 40008798: 40 00 04 cb call 40009ac4 <_Workspace_Allocate> 4000879c: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 400087a0: b6 92 20 00 orcc %o0, 0, %i3 400087a4: 02 bf ff dd be 40008718 <_Thread_Initialize+0xe0> 400087a8: c6 04 a2 a8 ld [ %l2 + 0x2a8 ], %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 400087ac: f6 26 61 64 st %i3, [ %i1 + 0x164 ] * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 400087b0: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 400087b4: 82 10 20 00 clr %g1 * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) the_thread->extensions[i] = NULL; 400087b8: 85 28 a0 02 sll %g2, 2, %g2 400087bc: c0 26 c0 02 clr [ %i3 + %g2 ] * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 400087c0: 82 00 60 01 inc %g1 400087c4: 80 a0 40 03 cmp %g1, %g3 400087c8: 08 bf ff fc bleu 400087b8 <_Thread_Initialize+0x180> 400087cc: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400087d0: 10 bf ff b6 b 400086a8 <_Thread_Initialize+0x70> 400087d4: c2 07 a0 60 ld [ %fp + 0x60 ], %g1 =============================================================================== 4000c8c8 <_Thread_Resume>: void _Thread_Resume( Thread_Control *the_thread, bool force ) { 4000c8c8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 4000c8cc: 7f ff d5 71 call 40001e90 4000c8d0: a0 10 00 18 mov %i0, %l0 4000c8d4: b0 10 00 08 mov %o0, %i0 current_state = the_thread->current_state; 4000c8d8: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & STATES_SUSPENDED ) { 4000c8dc: 80 88 60 02 btst 2, %g1 4000c8e0: 02 80 00 05 be 4000c8f4 <_Thread_Resume+0x2c> <== NEVER TAKEN 4000c8e4: 82 08 7f fd and %g1, -3, %g1 current_state = the_thread->current_state = _States_Clear(STATES_SUSPENDED, current_state); if ( _States_Is_ready( current_state ) ) { 4000c8e8: 80 a0 60 00 cmp %g1, 0 4000c8ec: 02 80 00 04 be 4000c8fc <_Thread_Resume+0x34> 4000c8f0: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _Context_Switch_necessary = true; } } } _ISR_Enable( level ); 4000c8f4: 7f ff d5 6b call 40001ea0 4000c8f8: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 4000c8fc: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 4000c900: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 4000c904: c8 10 40 00 lduh [ %g1 ], %g4 _Priority_Major_bit_map |= the_priority_map->ready_major; 4000c908: 05 10 00 64 sethi %hi(0x40019000), %g2 RTEMS_INLINE_ROUTINE void _Priority_Add_to_bit_map ( Priority_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 4000c90c: 86 11 00 03 or %g4, %g3, %g3 4000c910: c6 30 40 00 sth %g3, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 4000c914: c8 10 a3 c8 lduh [ %g2 + 0x3c8 ], %g4 4000c918: c6 14 20 94 lduh [ %l0 + 0x94 ], %g3 if ( _States_Is_ready( current_state ) ) { _Priority_Add_to_bit_map( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 4000c91c: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 4000c920: 86 11 00 03 or %g4, %g3, %g3 4000c924: c6 30 a3 c8 sth %g3, [ %g2 + 0x3c8 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 4000c928: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000c92c: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 4000c930: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 4000c934: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 4000c938: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 4000c93c: c4 24 20 04 st %g2, [ %l0 + 4 ] _ISR_Flash( level ); 4000c940: 7f ff d5 58 call 40001ea0 4000c944: 01 00 00 00 nop 4000c948: 7f ff d5 52 call 40001e90 4000c94c: 01 00 00 00 nop if ( the_thread->current_priority < _Thread_Heir->current_priority ) { 4000c950: 03 10 00 65 sethi %hi(0x40019400), %g1 4000c954: 82 10 61 8c or %g1, 0x18c, %g1 ! 4001958c <_Per_CPU_Information> 4000c958: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 4000c95c: c4 04 20 14 ld [ %l0 + 0x14 ], %g2 4000c960: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 4000c964: 80 a0 80 03 cmp %g2, %g3 4000c968: 1a bf ff e3 bcc 4000c8f4 <_Thread_Resume+0x2c> 4000c96c: 01 00 00 00 nop _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000c970: c6 00 60 0c ld [ %g1 + 0xc ], %g3 _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); _ISR_Flash( level ); if ( the_thread->current_priority < _Thread_Heir->current_priority ) { _Thread_Heir = the_thread; 4000c974: e0 20 60 10 st %l0, [ %g1 + 0x10 ] if ( _Thread_Executing->is_preemptible || 4000c978: c6 08 e0 74 ldub [ %g3 + 0x74 ], %g3 4000c97c: 80 a0 e0 00 cmp %g3, 0 4000c980: 32 80 00 05 bne,a 4000c994 <_Thread_Resume+0xcc> 4000c984: 84 10 20 01 mov 1, %g2 4000c988: 80 a0 a0 00 cmp %g2, 0 4000c98c: 12 bf ff da bne 4000c8f4 <_Thread_Resume+0x2c> <== ALWAYS TAKEN 4000c990: 84 10 20 01 mov 1, %g2 the_thread->current_priority == 0 ) _Context_Switch_necessary = true; 4000c994: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] } } } _ISR_Enable( level ); 4000c998: 7f ff d5 42 call 40001ea0 4000c99c: 81 e8 00 00 restore =============================================================================== 400092cc <_Thread_Yield_processor>: * ready chain * select heir */ void _Thread_Yield_processor( void ) { 400092cc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 400092d0: 25 10 00 55 sethi %hi(0x40015400), %l2 400092d4: a4 14 a0 7c or %l2, 0x7c, %l2 ! 4001547c <_Per_CPU_Information> 400092d8: e0 04 a0 0c ld [ %l2 + 0xc ], %l0 ready = executing->ready; _ISR_Disable( level ); 400092dc: 7f ff e2 7f call 40001cd8 400092e0: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 400092e4: b0 10 00 08 mov %o0, %i0 } else if ( !_Thread_Is_heir( executing ) ) _Context_Switch_necessary = true; _ISR_Enable( level ); } 400092e8: c2 04 60 08 ld [ %l1 + 8 ], %g1 Chain_Control *ready; executing = _Thread_Executing; ready = executing->ready; _ISR_Disable( level ); if ( !_Chain_Has_only_one_node( ready ) ) { 400092ec: c4 04 40 00 ld [ %l1 ], %g2 400092f0: 80 a0 80 01 cmp %g2, %g1 400092f4: 02 80 00 14 be 40009344 <_Thread_Yield_processor+0x78> 400092f8: 88 04 60 04 add %l1, 4, %g4 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 400092fc: c4 1c 00 00 ldd [ %l0 ], %g2 next->previous = previous; previous->next = next; 40009300: c4 20 c0 00 st %g2, [ %g3 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 40009304: c6 20 a0 04 st %g3, [ %g2 + 4 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 40009308: c8 24 00 00 st %g4, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 4000930c: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; 40009310: e0 20 40 00 st %l0, [ %g1 ] the_node->previous = old_last_node; 40009314: c2 24 20 04 st %g1, [ %l0 + 4 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 40009318: 7f ff e2 74 call 40001ce8 4000931c: 01 00 00 00 nop 40009320: 7f ff e2 6e call 40001cd8 40009324: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 40009328: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 4000932c: 80 a4 00 01 cmp %l0, %g1 40009330: 02 80 00 0b be 4000935c <_Thread_Yield_processor+0x90> <== ALWAYS TAKEN 40009334: 82 10 20 01 mov 1, %g1 _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Context_Switch_necessary = true; 40009338: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED _ISR_Enable( level ); 4000933c: 7f ff e2 6b call 40001ce8 40009340: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 40009344: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 40009348: 80 a4 00 01 cmp %l0, %g1 4000934c: 02 bf ff fc be 4000933c <_Thread_Yield_processor+0x70> <== ALWAYS TAKEN 40009350: 82 10 20 01 mov 1, %g1 _Context_Switch_necessary = true; 40009354: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED 40009358: 30 bf ff f9 b,a 4000933c <_Thread_Yield_processor+0x70> <== NOT EXECUTED _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; 4000935c: c2 04 40 00 ld [ %l1 ], %g1 40009360: c2 24 a0 10 st %g1, [ %l2 + 0x10 ] _Context_Switch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Context_Switch_necessary = true; 40009364: 82 10 20 01 mov 1, %g1 40009368: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] 4000936c: 30 bf ff f4 b,a 4000933c <_Thread_Yield_processor+0x70> =============================================================================== 4000c53c <_Thread_queue_Extract_priority_helper>: void _Thread_queue_Extract_priority_helper( Thread_queue_Control *the_thread_queue __attribute__((unused)), Thread_Control *the_thread, bool requeuing ) { 4000c53c: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *new_first_node; Chain_Node *new_second_node; Chain_Node *last_node; the_node = (Chain_Node *) the_thread; _ISR_Disable( level ); 4000c540: 7f ff d5 e6 call 40001cd8 4000c544: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue ( States_Control the_states ) { return (the_states & STATES_WAITING_ON_THREAD_QUEUE); 4000c548: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 4000c54c: 03 00 00 ef sethi %hi(0x3bc00), %g1 4000c550: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 4000c554: 80 88 80 01 btst %g2, %g1 4000c558: 02 80 00 22 be 4000c5e0 <_Thread_queue_Extract_priority_helper+0xa4> 4000c55c: 84 06 60 3c add %i1, 0x3c, %g2 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000c560: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 /* * The thread was actually waiting on a thread queue so let's remove it. */ next_node = the_node->next; 4000c564: c6 06 40 00 ld [ %i1 ], %g3 previous_node = the_node->previous; if ( !_Chain_Is_empty( &the_thread->Wait.Block2n ) ) { 4000c568: 80 a0 40 02 cmp %g1, %g2 4000c56c: 02 80 00 2a be 4000c614 <_Thread_queue_Extract_priority_helper+0xd8> 4000c570: c8 06 60 04 ld [ %i1 + 4 ], %g4 new_first_node = the_thread->Wait.Block2n.first; new_first_thread = (Thread_Control *) new_first_node; last_node = the_thread->Wait.Block2n.last; 4000c574: c4 06 60 40 ld [ %i1 + 0x40 ], %g2 new_second_node = new_first_node->next; 4000c578: da 00 40 00 ld [ %g1 ], %o5 previous_node->next = new_first_node; next_node->previous = new_first_node; 4000c57c: c2 20 e0 04 st %g1, [ %g3 + 4 ] new_first_node = the_thread->Wait.Block2n.first; new_first_thread = (Thread_Control *) new_first_node; last_node = the_thread->Wait.Block2n.last; new_second_node = new_first_node->next; previous_node->next = new_first_node; 4000c580: c2 21 00 00 st %g1, [ %g4 ] next_node->previous = new_first_node; new_first_node->next = next_node; 4000c584: c6 20 40 00 st %g3, [ %g1 ] new_first_node->previous = previous_node; if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) { 4000c588: 80 a0 80 01 cmp %g2, %g1 4000c58c: 02 80 00 08 be 4000c5ac <_Thread_queue_Extract_priority_helper+0x70> 4000c590: c8 20 60 04 st %g4, [ %g1 + 4 ] /* > two threads on 2-n */ new_second_node->previous = _Chain_Head( &new_first_thread->Wait.Block2n ); 4000c594: 86 00 60 38 add %g1, 0x38, %g3 new_first_node->next = next_node; new_first_node->previous = previous_node; if ( !_Chain_Has_only_one_node( &the_thread->Wait.Block2n ) ) { /* > two threads on 2-n */ new_second_node->previous = 4000c598: c6 23 60 04 st %g3, [ %o5 + 4 ] _Chain_Head( &new_first_thread->Wait.Block2n ); new_first_thread->Wait.Block2n.first = new_second_node; 4000c59c: da 20 60 38 st %o5, [ %g1 + 0x38 ] new_first_thread->Wait.Block2n.last = last_node; 4000c5a0: c4 20 60 40 st %g2, [ %g1 + 0x40 ] */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000c5a4: 82 00 60 3c add %g1, 0x3c, %g1 last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n ); 4000c5a8: c2 20 80 00 st %g1, [ %g2 ] /* * If we are not supposed to touch timers or the thread's state, return. */ if ( requeuing ) { 4000c5ac: 80 8e a0 ff btst 0xff, %i2 4000c5b0: 12 80 00 17 bne 4000c60c <_Thread_queue_Extract_priority_helper+0xd0> 4000c5b4: 01 00 00 00 nop _ISR_Enable( level ); return; } if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 4000c5b8: c2 06 60 50 ld [ %i1 + 0x50 ], %g1 4000c5bc: 80 a0 60 02 cmp %g1, 2 4000c5c0: 02 80 00 0a be 4000c5e8 <_Thread_queue_Extract_priority_helper+0xac><== NEVER TAKEN 4000c5c4: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 4000c5c8: 7f ff d5 c8 call 40001ce8 4000c5cc: b0 10 00 19 mov %i1, %i0 4000c5d0: 33 04 00 ff sethi %hi(0x1003fc00), %i1 4000c5d4: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 4000c5d8: 7f ff ee eb call 40008184 <_Thread_Clear_state> 4000c5dc: 81 e8 00 00 restore Chain_Node *last_node; the_node = (Chain_Node *) the_thread; _ISR_Disable( level ); if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _ISR_Enable( level ); 4000c5e0: 7f ff d5 c2 call 40001ce8 4000c5e4: 91 e8 00 08 restore %g0, %o0, %o0 4000c5e8: c2 26 60 50 st %g1, [ %i1 + 0x50 ] <== NOT EXECUTED if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { _ISR_Enable( level ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 4000c5ec: 7f ff d5 bf call 40001ce8 <== NOT EXECUTED 4000c5f0: b0 10 00 19 mov %i1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 4000c5f4: 7f ff f4 b8 call 400098d4 <_Watchdog_Remove> <== NOT EXECUTED 4000c5f8: 90 06 60 48 add %i1, 0x48, %o0 <== NOT EXECUTED 4000c5fc: 33 04 00 ff sethi %hi(0x1003fc00), %i1 <== NOT EXECUTED 4000c600: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <== NOT EXECUTED 4000c604: 7f ff ee e0 call 40008184 <_Thread_Clear_state> <== NOT EXECUTED 4000c608: 81 e8 00 00 restore <== NOT EXECUTED /* * If we are not supposed to touch timers or the thread's state, return. */ if ( requeuing ) { _ISR_Enable( level ); 4000c60c: 7f ff d5 b7 call 40001ce8 4000c610: 91 e8 00 08 restore %g0, %o0, %o0 new_first_thread->Wait.Block2n.last = last_node; last_node->next = _Chain_Tail( &new_first_thread->Wait.Block2n ); } } else { previous_node->next = next_node; 4000c614: c6 21 00 00 st %g3, [ %g4 ] next_node->previous = previous_node; 4000c618: 10 bf ff e5 b 4000c5ac <_Thread_queue_Extract_priority_helper+0x70> 4000c61c: c8 20 e0 04 st %g4, [ %g3 + 4 ] =============================================================================== 40008df4 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 40008df4: 9d e3 bf 98 save %sp, -104, %sp /* * Just in case the thread really wasn't blocked on a thread queue * when we get here. */ if ( !the_thread_queue ) 40008df8: 80 a6 20 00 cmp %i0, 0 40008dfc: 02 80 00 13 be 40008e48 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 40008e00: 01 00 00 00 nop /* * If queueing by FIFO, there is nothing to do. This only applies to * priority blocking discipline. */ if ( the_thread_queue->discipline == THREAD_QUEUE_DISCIPLINE_PRIORITY ) { 40008e04: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 40008e08: 80 a4 60 01 cmp %l1, 1 40008e0c: 02 80 00 04 be 40008e1c <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 40008e10: 01 00 00 00 nop 40008e14: 81 c7 e0 08 ret <== NOT EXECUTED 40008e18: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 40008e1c: 7f ff e3 af call 40001cd8 40008e20: 01 00 00 00 nop 40008e24: a0 10 00 08 mov %o0, %l0 40008e28: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 40008e2c: 03 00 00 ef sethi %hi(0x3bc00), %g1 40008e30: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 40008e34: 80 88 80 01 btst %g2, %g1 40008e38: 12 80 00 06 bne 40008e50 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 40008e3c: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); } _ISR_Enable( level ); 40008e40: 7f ff e3 aa call 40001ce8 40008e44: 90 10 00 10 mov %l0, %o0 40008e48: 81 c7 e0 08 ret 40008e4c: 81 e8 00 00 restore ISR_Level level_ignored; _ISR_Disable( level ); if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 40008e50: 92 10 00 19 mov %i1, %o1 40008e54: 94 10 20 01 mov 1, %o2 40008e58: 40 00 0d b9 call 4000c53c <_Thread_queue_Extract_priority_helper> 40008e5c: e2 26 20 30 st %l1, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 40008e60: 90 10 00 18 mov %i0, %o0 40008e64: 92 10 00 19 mov %i1, %o1 40008e68: 7f ff ff 2b call 40008b14 <_Thread_queue_Enqueue_priority> 40008e6c: 94 07 bf fc add %fp, -4, %o2 40008e70: 30 bf ff f4 b,a 40008e40 <_Thread_queue_Requeue+0x4c> =============================================================================== 40008e74 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 40008e74: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 40008e78: 90 10 00 18 mov %i0, %o0 40008e7c: 7f ff fd c4 call 4000858c <_Thread_Get> 40008e80: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40008e84: c2 07 bf fc ld [ %fp + -4 ], %g1 40008e88: 80 a0 60 00 cmp %g1, 0 40008e8c: 12 80 00 08 bne 40008eac <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 40008e90: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 40008e94: 40 00 0d e3 call 4000c620 <_Thread_queue_Process_timeout> 40008e98: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 40008e9c: 03 10 00 54 sethi %hi(0x40015000), %g1 40008ea0: c4 00 62 18 ld [ %g1 + 0x218 ], %g2 ! 40015218 <_Thread_Dispatch_disable_level> 40008ea4: 84 00 bf ff add %g2, -1, %g2 40008ea8: c4 20 62 18 st %g2, [ %g1 + 0x218 ] 40008eac: 81 c7 e0 08 ret 40008eb0: 81 e8 00 00 restore =============================================================================== 40016448 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 40016448: 9d e3 bf 88 save %sp, -120, %sp 4001644c: 2d 10 00 f5 sethi %hi(0x4003d400), %l6 40016450: ba 07 bf f4 add %fp, -12, %i5 40016454: a8 07 bf f8 add %fp, -8, %l4 40016458: a4 07 bf e8 add %fp, -24, %l2 4001645c: ae 07 bf ec add %fp, -20, %l7 40016460: 2b 10 00 f5 sethi %hi(0x4003d400), %l5 40016464: 39 10 00 f5 sethi %hi(0x4003d400), %i4 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40016468: e8 27 bf f4 st %l4, [ %fp + -12 ] the_chain->permanent_null = NULL; 4001646c: c0 27 bf f8 clr [ %fp + -8 ] the_chain->last = _Chain_Head(the_chain); 40016470: fa 27 bf fc st %i5, [ %fp + -4 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40016474: ee 27 bf e8 st %l7, [ %fp + -24 ] the_chain->permanent_null = NULL; 40016478: c0 27 bf ec clr [ %fp + -20 ] the_chain->last = _Chain_Head(the_chain); 4001647c: e4 27 bf f0 st %l2, [ %fp + -16 ] 40016480: ac 15 a1 44 or %l6, 0x144, %l6 40016484: a2 06 20 30 add %i0, 0x30, %l1 40016488: aa 15 60 90 or %l5, 0x90, %l5 4001648c: a6 06 20 68 add %i0, 0x68, %l3 40016490: b8 17 20 08 or %i4, 8, %i4 40016494: b2 06 20 08 add %i0, 8, %i1 40016498: b4 06 20 40 add %i0, 0x40, %i2 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 4001649c: b6 10 20 01 mov 1, %i3 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 400164a0: fa 26 20 78 st %i5, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 400164a4: c2 05 80 00 ld [ %l6 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 400164a8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 400164ac: 94 10 00 12 mov %l2, %o2 400164b0: 90 10 00 11 mov %l1, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 400164b4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 400164b8: 40 00 12 b1 call 4001af7c <_Watchdog_Adjust_to_chain> 400164bc: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 400164c0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 400164c4: e0 05 40 00 ld [ %l5 ], %l0 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 400164c8: 80 a4 00 0a cmp %l0, %o2 400164cc: 18 80 00 2e bgu 40016584 <_Timer_server_Body+0x13c> 400164d0: 92 24 00 0a sub %l0, %o2, %o1 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 400164d4: 80 a4 00 0a cmp %l0, %o2 400164d8: 0a 80 00 2f bcs 40016594 <_Timer_server_Body+0x14c> 400164dc: 90 10 00 13 mov %l3, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 400164e0: e0 26 20 74 st %l0, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 400164e4: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 400164e8: 40 00 02 f8 call 400170c8 <_Chain_Get> 400164ec: 01 00 00 00 nop if ( timer == NULL ) { 400164f0: 92 92 20 00 orcc %o0, 0, %o1 400164f4: 02 80 00 10 be 40016534 <_Timer_server_Body+0xec> 400164f8: 01 00 00 00 nop static void _Timer_server_Insert_timer( Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 400164fc: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 40016500: 80 a0 60 01 cmp %g1, 1 40016504: 02 80 00 28 be 400165a4 <_Timer_server_Body+0x15c> 40016508: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 4001650c: 12 bf ff f6 bne 400164e4 <_Timer_server_Body+0x9c> <== NEVER TAKEN 40016510: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40016514: 40 00 12 cd call 4001b048 <_Watchdog_Insert> 40016518: 90 10 00 13 mov %l3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 4001651c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 40016520: 40 00 02 ea call 400170c8 <_Chain_Get> 40016524: 01 00 00 00 nop if ( timer == NULL ) { 40016528: 92 92 20 00 orcc %o0, 0, %o1 4001652c: 32 bf ff f5 bne,a 40016500 <_Timer_server_Body+0xb8> <== NEVER TAKEN 40016530: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 <== NOT EXECUTED * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 40016534: 7f ff e2 0c call 4000ed64 40016538: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 4001653c: c2 07 bf f4 ld [ %fp + -12 ], %g1 40016540: 80 a5 00 01 cmp %l4, %g1 40016544: 02 80 00 1c be 400165b4 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 40016548: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 4001654c: 7f ff e2 0a call 4000ed74 <== NOT EXECUTED 40016550: 01 00 00 00 nop <== NOT EXECUTED static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 40016554: c2 05 80 00 ld [ %l6 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 40016558: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 4001655c: 94 10 00 12 mov %l2, %o2 <== NOT EXECUTED 40016560: 90 10 00 11 mov %l1, %o0 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 40016564: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 40016568: 40 00 12 85 call 4001af7c <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 4001656c: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 40016570: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 40016574: e0 05 40 00 ld [ %l5 ], %l0 <== NOT EXECUTED /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 40016578: 80 a4 00 0a cmp %l0, %o2 <== NOT EXECUTED 4001657c: 08 bf ff d7 bleu 400164d8 <_Timer_server_Body+0x90> <== NOT EXECUTED 40016580: 92 24 00 0a sub %l0, %o2, %o1 <== NOT EXECUTED /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 40016584: 90 10 00 13 mov %l3, %o0 40016588: 40 00 12 7d call 4001af7c <_Watchdog_Adjust_to_chain> 4001658c: 94 10 00 12 mov %l2, %o2 40016590: 30 bf ff d4 b,a 400164e0 <_Timer_server_Body+0x98> /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 40016594: 92 10 20 01 mov 1, %o1 40016598: 40 00 12 49 call 4001aebc <_Watchdog_Adjust> 4001659c: 94 22 80 10 sub %o2, %l0, %o2 400165a0: 30 bf ff d0 b,a 400164e0 <_Timer_server_Body+0x98> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 400165a4: 90 10 00 11 mov %l1, %o0 400165a8: 40 00 12 a8 call 4001b048 <_Watchdog_Insert> 400165ac: 92 02 60 10 add %o1, 0x10, %o1 400165b0: 30 bf ff cd b,a 400164e4 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 400165b4: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 400165b8: 7f ff e1 ef call 4000ed74 400165bc: 01 00 00 00 nop _Chain_Initialize_empty( &fire_chain ); while ( true ) { _Timer_server_Get_watchdogs_that_fire_now( ts, &insert_chain, &fire_chain ); if ( !_Chain_Is_empty( &fire_chain ) ) { 400165c0: c2 07 bf e8 ld [ %fp + -24 ], %g1 400165c4: 80 a5 c0 01 cmp %l7, %g1 400165c8: 12 80 00 0c bne 400165f8 <_Timer_server_Body+0x1b0> 400165cc: 01 00 00 00 nop 400165d0: 30 80 00 13 b,a 4001661c <_Timer_server_Body+0x1d4> Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; the_chain->first = new_first; new_first->previous = _Chain_Head(the_chain); 400165d4: e4 20 60 04 st %l2, [ %g1 + 4 ] Chain_Node *return_node; Chain_Node *new_first; return_node = the_chain->first; new_first = return_node->next; the_chain->first = new_first; 400165d8: c2 27 bf e8 st %g1, [ %fp + -24 ] * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 400165dc: c0 24 20 08 clr [ %l0 + 8 ] _ISR_Enable( level ); 400165e0: 7f ff e1 e5 call 4000ed74 400165e4: 01 00 00 00 nop /* * The timer server may block here and wait for resources or time. * The system watchdogs are inactive and will remain inactive since * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); 400165e8: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 400165ec: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 400165f0: 9f c0 40 00 call %g1 400165f4: d2 04 20 24 ld [ %l0 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 400165f8: 7f ff e1 db call 4000ed64 400165fc: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 40016600: e0 07 bf e8 ld [ %fp + -24 ], %l0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 40016604: 80 a5 c0 10 cmp %l7, %l0 40016608: 32 bf ff f3 bne,a 400165d4 <_Timer_server_Body+0x18c> 4001660c: c2 04 00 00 ld [ %l0 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 40016610: 7f ff e1 d9 call 4000ed74 40016614: 01 00 00 00 nop 40016618: 30 bf ff a2 b,a 400164a0 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 4001661c: c0 2e 20 7c clrb [ %i0 + 0x7c ] 40016620: c2 07 00 00 ld [ %i4 ], %g1 40016624: 82 00 60 01 inc %g1 40016628: c2 27 00 00 st %g1, [ %i4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 4001662c: d0 06 00 00 ld [ %i0 ], %o0 40016630: 40 00 0f 87 call 4001a44c <_Thread_Set_state> 40016634: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 40016638: 7f ff ff 5a call 400163a0 <_Timer_server_Reset_interval_system_watchdog> 4001663c: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 40016640: 7f ff ff 6d call 400163f4 <_Timer_server_Reset_tod_system_watchdog> 40016644: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 40016648: 40 00 0c bb call 40019934 <_Thread_Enable_dispatch> 4001664c: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 40016650: 90 10 00 19 mov %i1, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 40016654: f6 2e 20 7c stb %i3, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 40016658: 40 00 12 e6 call 4001b1f0 <_Watchdog_Remove> 4001665c: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 40016660: 40 00 12 e4 call 4001b1f0 <_Watchdog_Remove> 40016664: 90 10 00 1a mov %i2, %o0 40016668: 30 bf ff 8e b,a 400164a0 <_Timer_server_Body+0x58> =============================================================================== 4001666c <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 4001666c: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 40016670: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 40016674: 80 a0 60 00 cmp %g1, 0 40016678: 02 80 00 05 be 4001668c <_Timer_server_Schedule_operation_method+0x20> 4001667c: a0 10 00 19 mov %i1, %l0 * server is not preemptible, so we must be in interrupt context here. No * thread dispatch will happen until the timer server finishes its * critical section. We have to use the protected chain methods because * we may be interrupted by a higher priority interrupt. */ _Chain_Append( ts->insert_chain, &timer->Object.Node ); 40016680: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 40016684: 40 00 02 7b call 40017070 <_Chain_Append> 40016688: 81 e8 00 00 restore 4001668c: 03 10 00 f5 sethi %hi(0x4003d400), %g1 40016690: c4 00 60 08 ld [ %g1 + 8 ], %g2 ! 4003d408 <_Thread_Dispatch_disable_level> 40016694: 84 00 a0 01 inc %g2 40016698: c4 20 60 08 st %g2, [ %g1 + 8 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 4001669c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 400166a0: 80 a0 60 01 cmp %g1, 1 400166a4: 02 80 00 28 be 40016744 <_Timer_server_Schedule_operation_method+0xd8> 400166a8: 80 a0 60 03 cmp %g1, 3 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); if ( !ts->active ) { _Timer_server_Reset_interval_system_watchdog( ts ); } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 400166ac: 02 80 00 04 be 400166bc <_Timer_server_Schedule_operation_method+0x50> 400166b0: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 400166b4: 40 00 0c a0 call 40019934 <_Thread_Enable_dispatch> 400166b8: 81 e8 00 00 restore } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 400166bc: 7f ff e1 aa call 4000ed64 400166c0: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 400166c4: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 400166c8: c6 06 20 74 ld [ %i0 + 0x74 ], %g3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400166cc: 88 06 20 6c add %i0, 0x6c, %g4 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 400166d0: 03 10 00 f5 sethi %hi(0x4003d400), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 400166d4: 80 a0 80 04 cmp %g2, %g4 400166d8: 02 80 00 0d be 4001670c <_Timer_server_Schedule_operation_method+0xa0> 400166dc: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 400166e0: da 00 a0 10 ld [ %g2 + 0x10 ], %o5 if ( snapshot > last_snapshot ) { 400166e4: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 400166e8: 88 03 40 03 add %o5, %g3, %g4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 400166ec: 08 80 00 07 bleu 40016708 <_Timer_server_Schedule_operation_method+0x9c> 400166f0: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 400166f4: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 400166f8: 80 a3 40 03 cmp %o5, %g3 400166fc: 08 80 00 03 bleu 40016708 <_Timer_server_Schedule_operation_method+0x9c><== NEVER TAKEN 40016700: 88 10 20 00 clr %g4 delta_interval -= delta; 40016704: 88 23 40 03 sub %o5, %g3, %g4 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 40016708: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 4001670c: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 40016710: 7f ff e1 99 call 4000ed74 40016714: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40016718: 90 06 20 68 add %i0, 0x68, %o0 4001671c: 40 00 12 4b call 4001b048 <_Watchdog_Insert> 40016720: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 40016724: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 40016728: 80 a0 60 00 cmp %g1, 0 4001672c: 12 bf ff e2 bne 400166b4 <_Timer_server_Schedule_operation_method+0x48> 40016730: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 40016734: 7f ff ff 30 call 400163f4 <_Timer_server_Reset_tod_system_watchdog> 40016738: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 4001673c: 40 00 0c 7e call 40019934 <_Thread_Enable_dispatch> 40016740: 81 e8 00 00 restore if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 40016744: 7f ff e1 88 call 4000ed64 40016748: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 4001674c: 05 10 00 f5 sethi %hi(0x4003d400), %g2 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 40016750: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 40016754: c4 00 a1 44 ld [ %g2 + 0x144 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 40016758: c8 06 20 3c ld [ %i0 + 0x3c ], %g4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4001675c: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 40016760: 80 a0 40 03 cmp %g1, %g3 40016764: 02 80 00 08 be 40016784 <_Timer_server_Schedule_operation_method+0x118> 40016768: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 4001676c: da 00 60 10 ld [ %g1 + 0x10 ], %o5 if (delta_interval > delta) { 40016770: 80 a1 00 0d cmp %g4, %o5 40016774: 1a 80 00 03 bcc 40016780 <_Timer_server_Schedule_operation_method+0x114> 40016778: 86 10 20 00 clr %g3 delta_interval -= delta; 4001677c: 86 23 40 04 sub %o5, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 40016780: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 40016784: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 40016788: 7f ff e1 7b call 4000ed74 4001678c: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 40016790: 90 06 20 30 add %i0, 0x30, %o0 40016794: 40 00 12 2d call 4001b048 <_Watchdog_Insert> 40016798: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 4001679c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 400167a0: 80 a0 60 00 cmp %g1, 0 400167a4: 12 bf ff c4 bne 400166b4 <_Timer_server_Schedule_operation_method+0x48> 400167a8: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 400167ac: 7f ff fe fd call 400163a0 <_Timer_server_Reset_interval_system_watchdog> 400167b0: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 400167b4: 40 00 0c 60 call 40019934 <_Thread_Enable_dispatch> 400167b8: 81 e8 00 00 restore =============================================================================== 40009370 <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 40009370: 9d e3 bf a0 save %sp, -96, %sp 40009374: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 40009378: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 4000937c: c8 06 60 04 ld [ %i1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 40009380: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 40009384: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 40009388: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 4000938c: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 40009390: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 40009394: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 40009398: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 4000939c: 80 a0 80 04 cmp %g2, %g4 400093a0: 08 80 00 0b bleu 400093cc <_Timespec_Add_to+0x5c> 400093a4: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 400093a8: 1b 31 19 4d sethi %hi(0xc4653400), %o5 400093ac: 9a 13 62 00 or %o5, 0x200, %o5 ! c4653600 400093b0: 84 00 80 0d add %g2, %o5, %g2 * * This routines adds two timespecs. The second argument is added * to the first. */ uint32_t _Timespec_Add_to( 400093b4: 86 00 e0 01 inc %g3 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 400093b8: 80 a0 80 04 cmp %g2, %g4 400093bc: 18 bf ff fd bgu 400093b0 <_Timespec_Add_to+0x40> <== NEVER TAKEN 400093c0: b0 06 20 01 inc %i0 400093c4: c4 20 60 04 st %g2, [ %g1 + 4 ] 400093c8: c6 20 40 00 st %g3, [ %g1 ] time->tv_sec++; seconds++; } return seconds; } 400093cc: 81 c7 e0 08 ret 400093d0: 81 e8 00 00 restore =============================================================================== 4000b45c <_Timespec_Greater_than>: bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { if ( lhs->tv_sec > rhs->tv_sec ) 4000b45c: c6 02 00 00 ld [ %o0 ], %g3 4000b460: c4 02 40 00 ld [ %o1 ], %g2 bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { 4000b464: 82 10 00 08 mov %o0, %g1 if ( lhs->tv_sec > rhs->tv_sec ) 4000b468: 80 a0 c0 02 cmp %g3, %g2 4000b46c: 14 80 00 0a bg 4000b494 <_Timespec_Greater_than+0x38> 4000b470: 90 10 20 01 mov 1, %o0 return true; if ( lhs->tv_sec < rhs->tv_sec ) 4000b474: 80 a0 c0 02 cmp %g3, %g2 4000b478: 06 80 00 07 bl 4000b494 <_Timespec_Greater_than+0x38> <== NEVER TAKEN 4000b47c: 90 10 20 00 clr %o0 #include #include #include bool _Timespec_Greater_than( 4000b480: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000b484: c2 02 60 04 ld [ %o1 + 4 ], %g1 4000b488: 80 a0 80 01 cmp %g2, %g1 4000b48c: 04 80 00 04 ble 4000b49c <_Timespec_Greater_than+0x40> 4000b490: 90 10 20 01 mov 1, %o0 /* ASSERT: lhs->tv_sec == rhs->tv_sec */ if ( lhs->tv_nsec > rhs->tv_nsec ) return true; return false; } 4000b494: 81 c3 e0 08 retl 4000b498: 01 00 00 00 nop 4000b49c: 81 c3 e0 08 retl 4000b4a0: 90 10 20 00 clr %o0 ! 0 =============================================================================== 40009580 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40009580: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 40009584: 23 10 00 55 sethi %hi(0x40015400), %l1 40009588: a2 14 60 38 or %l1, 0x38, %l1 ! 40015438 <_User_extensions_List> 4000958c: e0 04 60 08 ld [ %l1 + 8 ], %l0 40009590: 80 a4 00 11 cmp %l0, %l1 40009594: 02 80 00 0d be 400095c8 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 40009598: b2 0e 60 ff and %i1, 0xff, %i1 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.fatal != NULL ) 4000959c: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 400095a0: 80 a0 60 00 cmp %g1, 0 400095a4: 02 80 00 05 be 400095b8 <_User_extensions_Fatal+0x38> 400095a8: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 400095ac: 92 10 00 19 mov %i1, %o1 400095b0: 9f c0 40 00 call %g1 400095b4: 94 10 00 1a mov %i2, %o2 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 400095b8: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 400095bc: 80 a4 00 11 cmp %l0, %l1 400095c0: 32 bf ff f8 bne,a 400095a0 <_User_extensions_Fatal+0x20> <== ALWAYS TAKEN 400095c4: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 400095c8: 81 c7 e0 08 ret <== NOT EXECUTED 400095cc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000942c <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 4000942c: 9d e3 bf a0 save %sp, -96, %sp User_extensions_Control *extension; uint32_t i; uint32_t number_of_extensions; User_extensions_Table *initial_extensions; number_of_extensions = Configuration.number_of_initial_extensions; 40009430: 07 10 00 52 sethi %hi(0x40014800), %g3 40009434: 86 10 e1 38 or %g3, 0x138, %g3 ! 40014938 initial_extensions = Configuration.User_extension_table; 40009438: e6 00 e0 3c ld [ %g3 + 0x3c ], %l3 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 4000943c: 1b 10 00 55 sethi %hi(0x40015400), %o5 40009440: 09 10 00 54 sethi %hi(0x40015000), %g4 40009444: 84 13 60 38 or %o5, 0x38, %g2 40009448: 82 11 22 1c or %g4, 0x21c, %g1 4000944c: 96 00 a0 04 add %g2, 4, %o3 40009450: 98 00 60 04 add %g1, 4, %o4 40009454: d6 23 60 38 st %o3, [ %o5 + 0x38 ] the_chain->permanent_null = NULL; 40009458: c0 20 a0 04 clr [ %g2 + 4 ] the_chain->last = _Chain_Head(the_chain); 4000945c: c4 20 a0 08 st %g2, [ %g2 + 8 ] */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40009460: d8 21 22 1c st %o4, [ %g4 + 0x21c ] the_chain->permanent_null = NULL; 40009464: c0 20 60 04 clr [ %g1 + 4 ] the_chain->last = _Chain_Head(the_chain); 40009468: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 4000946c: 80 a4 e0 00 cmp %l3, 0 40009470: 02 80 00 1b be 400094dc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 40009474: e4 00 e0 38 ld [ %g3 + 0x38 ], %l2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 40009478: 83 2c a0 02 sll %l2, 2, %g1 4000947c: a3 2c a0 04 sll %l2, 4, %l1 40009480: a2 24 40 01 sub %l1, %g1, %l1 40009484: a2 04 40 12 add %l1, %l2, %l1 40009488: a3 2c 60 02 sll %l1, 2, %l1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( 4000948c: 40 00 01 9e call 40009b04 <_Workspace_Allocate_or_fatal_error> 40009490: 90 10 00 11 mov %l1, %o0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 40009494: 92 10 20 00 clr %o1 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( 40009498: a0 10 00 08 mov %o0, %l0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 4000949c: 40 00 15 b5 call 4000eb70 400094a0: 94 10 00 11 mov %l1, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 400094a4: 80 a4 a0 00 cmp %l2, 0 400094a8: 02 80 00 0d be 400094dc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 400094ac: a2 10 20 00 clr %l1 #include #include #include #include void _User_extensions_Handler_initialization(void) 400094b0: 93 2c 60 05 sll %l1, 5, %o1 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 400094b4: 94 10 20 20 mov 0x20, %o2 400094b8: 92 04 c0 09 add %l3, %o1, %o1 400094bc: 40 00 15 6e call 4000ea74 400094c0: 90 04 20 14 add %l0, 0x14, %o0 _User_extensions_Add_set( extension ); 400094c4: 40 00 0c bc call 4000c7b4 <_User_extensions_Add_set> 400094c8: 90 10 00 10 mov %l0, %o0 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 400094cc: a2 04 60 01 inc %l1 400094d0: 80 a4 80 11 cmp %l2, %l1 400094d4: 18 bf ff f7 bgu 400094b0 <_User_extensions_Handler_initialization+0x84> 400094d8: a0 04 20 34 add %l0, 0x34, %l0 400094dc: 81 c7 e0 08 ret 400094e0: 81 e8 00 00 restore =============================================================================== 400094e4 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 400094e4: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 400094e8: 23 10 00 55 sethi %hi(0x40015400), %l1 400094ec: e0 04 60 38 ld [ %l1 + 0x38 ], %l0 ! 40015438 <_User_extensions_List> 400094f0: a2 14 60 38 or %l1, 0x38, %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400094f4: a2 04 60 04 add %l1, 4, %l1 400094f8: 80 a4 00 11 cmp %l0, %l1 400094fc: 02 80 00 0c be 4000952c <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 40009500: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_begin != NULL ) 40009504: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 40009508: 80 a0 60 00 cmp %g1, 0 4000950c: 02 80 00 04 be 4000951c <_User_extensions_Thread_begin+0x38> 40009510: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 40009514: 9f c0 40 00 call %g1 40009518: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 4000951c: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 40009520: 80 a4 00 11 cmp %l0, %l1 40009524: 32 bf ff f9 bne,a 40009508 <_User_extensions_Thread_begin+0x24> 40009528: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 4000952c: 81 c7 e0 08 ret 40009530: 81 e8 00 00 restore =============================================================================== 400095d0 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 400095d0: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _User_extensions_List.first ; 400095d4: 23 10 00 55 sethi %hi(0x40015400), %l1 400095d8: e0 04 60 38 ld [ %l1 + 0x38 ], %l0 ! 40015438 <_User_extensions_List> #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 400095dc: a6 10 00 18 mov %i0, %l3 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _User_extensions_List.first ; 400095e0: a2 14 60 38 or %l1, 0x38, %l1 400095e4: a2 04 60 04 add %l1, 4, %l1 400095e8: 80 a4 00 11 cmp %l0, %l1 400095ec: 02 80 00 13 be 40009638 <_User_extensions_Thread_create+0x68><== NEVER TAKEN 400095f0: b0 10 20 01 mov 1, %i0 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 400095f4: 25 10 00 55 sethi %hi(0x40015400), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { 400095f8: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 400095fc: 80 a0 60 00 cmp %g1, 0 40009600: 02 80 00 08 be 40009620 <_User_extensions_Thread_create+0x50> 40009604: 84 14 a0 7c or %l2, 0x7c, %g2 status = (*the_extension->Callouts.thread_create)( 40009608: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000960c: 9f c0 40 00 call %g1 40009610: 92 10 00 13 mov %l3, %o1 _Thread_Executing, the_thread ); if ( !status ) 40009614: 80 8a 20 ff btst 0xff, %o0 40009618: 22 80 00 08 be,a 40009638 <_User_extensions_Thread_create+0x68> 4000961c: b0 10 20 00 clr %i0 User_extensions_Control *the_extension; bool status; for ( the_node = _User_extensions_List.first ; !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 40009620: e0 04 00 00 ld [ %l0 ], %l0 { Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _User_extensions_List.first ; 40009624: 80 a4 00 11 cmp %l0, %l1 40009628: 32 bf ff f5 bne,a 400095fc <_User_extensions_Thread_create+0x2c> 4000962c: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 if ( !status ) return false; } } return true; 40009630: 81 c7 e0 08 ret 40009634: 91 e8 20 01 restore %g0, 1, %o0 } 40009638: 81 c7 e0 08 ret 4000963c: 81 e8 00 00 restore =============================================================================== 40009640 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 40009640: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 40009644: 23 10 00 55 sethi %hi(0x40015400), %l1 40009648: a2 14 60 38 or %l1, 0x38, %l1 ! 40015438 <_User_extensions_List> 4000964c: e0 04 60 08 ld [ %l1 + 8 ], %l0 40009650: 80 a4 00 11 cmp %l0, %l1 40009654: 02 80 00 0d be 40009688 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 40009658: 25 10 00 55 sethi %hi(0x40015400), %l2 !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_delete != NULL ) 4000965c: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 40009660: 80 a0 60 00 cmp %g1, 0 40009664: 02 80 00 05 be 40009678 <_User_extensions_Thread_delete+0x38> 40009668: 84 14 a0 7c or %l2, 0x7c, %g2 (*the_extension->Callouts.thread_delete)( 4000966c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 40009670: 9f c0 40 00 call %g1 40009674: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 40009678: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000967c: 80 a4 00 11 cmp %l0, %l1 40009680: 32 bf ff f8 bne,a 40009660 <_User_extensions_Thread_delete+0x20> 40009684: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 40009688: 81 c7 e0 08 ret 4000968c: 81 e8 00 00 restore =============================================================================== 40009534 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 40009534: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 40009538: 23 10 00 55 sethi %hi(0x40015400), %l1 4000953c: a2 14 60 38 or %l1, 0x38, %l1 ! 40015438 <_User_extensions_List> 40009540: e0 04 60 08 ld [ %l1 + 8 ], %l0 40009544: 80 a4 00 11 cmp %l0, %l1 40009548: 02 80 00 0c be 40009578 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 4000954c: 01 00 00 00 nop !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_exitted != NULL ) 40009550: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 40009554: 80 a0 60 00 cmp %g1, 0 40009558: 02 80 00 04 be 40009568 <_User_extensions_Thread_exitted+0x34> 4000955c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 40009560: 9f c0 40 00 call %g1 40009564: 01 00 00 00 nop Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; !_Chain_Is_head( &_User_extensions_List, the_node ) ; the_node = the_node->previous ) { 40009568: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000956c: 80 a4 00 11 cmp %l0, %l1 40009570: 32 bf ff f9 bne,a 40009554 <_User_extensions_Thread_exitted+0x20> 40009574: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 40009578: 81 c7 e0 08 ret 4000957c: 81 e8 00 00 restore =============================================================================== 4000a3ac <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 4000a3ac: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a3b0: 23 10 00 77 sethi %hi(0x4001dc00), %l1 4000a3b4: e0 04 60 68 ld [ %l1 + 0x68 ], %l0 ! 4001dc68 <_User_extensions_List> 4000a3b8: a2 14 60 68 or %l1, 0x68, %l1 4000a3bc: a2 04 60 04 add %l1, 4, %l1 4000a3c0: 80 a4 00 11 cmp %l0, %l1 4000a3c4: 02 80 00 0d be 4000a3f8 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 4000a3c8: 25 10 00 77 sethi %hi(0x4001dc00), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_restart != NULL ) 4000a3cc: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000a3d0: 80 a0 60 00 cmp %g1, 0 4000a3d4: 02 80 00 05 be 4000a3e8 <_User_extensions_Thread_restart+0x3c> 4000a3d8: 84 14 a0 ac or %l2, 0xac, %g2 (*the_extension->Callouts.thread_restart)( 4000a3dc: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000a3e0: 9f c0 40 00 call %g1 4000a3e4: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 4000a3e8: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a3ec: 80 a4 00 11 cmp %l0, %l1 4000a3f0: 32 bf ff f8 bne,a 4000a3d0 <_User_extensions_Thread_restart+0x24> 4000a3f4: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000a3f8: 81 c7 e0 08 ret 4000a3fc: 81 e8 00 00 restore =============================================================================== 40009690 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 40009690: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 40009694: 23 10 00 55 sethi %hi(0x40015400), %l1 40009698: e0 04 60 38 ld [ %l1 + 0x38 ], %l0 ! 40015438 <_User_extensions_List> 4000969c: a2 14 60 38 or %l1, 0x38, %l1 400096a0: a2 04 60 04 add %l1, 4, %l1 400096a4: 80 a4 00 11 cmp %l0, %l1 400096a8: 02 80 00 0d be 400096dc <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 400096ac: 25 10 00 55 sethi %hi(0x40015400), %l2 !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_start != NULL ) 400096b0: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 400096b4: 80 a0 60 00 cmp %g1, 0 400096b8: 02 80 00 05 be 400096cc <_User_extensions_Thread_start+0x3c> 400096bc: 84 14 a0 7c or %l2, 0x7c, %g2 (*the_extension->Callouts.thread_start)( 400096c0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 400096c4: 9f c0 40 00 call %g1 400096c8: 92 10 00 18 mov %i0, %o1 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 400096cc: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 400096d0: 80 a4 00 11 cmp %l0, %l1 400096d4: 32 bf ff f8 bne,a 400096b4 <_User_extensions_Thread_start+0x24> 400096d8: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 400096dc: 81 c7 e0 08 ret 400096e0: 81 e8 00 00 restore =============================================================================== 400096e4 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 400096e4: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _User_extensions_Switches_list.first ; 400096e8: 23 10 00 54 sethi %hi(0x40015000), %l1 400096ec: e0 04 62 1c ld [ %l1 + 0x21c ], %l0 ! 4001521c <_User_extensions_Switches_list> 400096f0: a2 14 62 1c or %l1, 0x21c, %l1 400096f4: a2 04 60 04 add %l1, 4, %l1 400096f8: 80 a4 00 11 cmp %l0, %l1 400096fc: 02 80 00 0a be 40009724 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 40009700: 01 00 00 00 nop !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { the_extension_switch = (User_extensions_Switch_control *) the_node; (*the_extension_switch->thread_switch)( executing, heir ); 40009704: c2 04 20 08 ld [ %l0 + 8 ], %g1 40009708: 90 10 00 18 mov %i0, %o0 4000970c: 9f c0 40 00 call %g1 40009710: 92 10 00 19 mov %i1, %o1 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _User_extensions_Switches_list.first ; !_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ; the_node = the_node->next ) { 40009714: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _User_extensions_Switches_list.first ; 40009718: 80 a4 00 11 cmp %l0, %l1 4000971c: 32 bf ff fb bne,a 40009708 <_User_extensions_Thread_switch+0x24> 40009720: c2 04 20 08 ld [ %l0 + 8 ], %g1 40009724: 81 c7 e0 08 ret 40009728: 81 e8 00 00 restore =============================================================================== 4000b95c <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 4000b95c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 4000b960: 7f ff dc bd call 40002c54 4000b964: a0 10 00 18 mov %i0, %l0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000b968: c2 06 00 00 ld [ %i0 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000b96c: a2 06 20 04 add %i0, 4, %l1 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 4000b970: 80 a0 40 11 cmp %g1, %l1 4000b974: 02 80 00 1f be 4000b9f0 <_Watchdog_Adjust+0x94> 4000b978: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 4000b97c: 12 80 00 1f bne 4000b9f8 <_Watchdog_Adjust+0x9c> 4000b980: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 4000b984: 80 a6 a0 00 cmp %i2, 0 4000b988: 02 80 00 1a be 4000b9f0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000b98c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000b990: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 4000b994: 80 a6 80 19 cmp %i2, %i1 4000b998: 1a 80 00 0b bcc 4000b9c4 <_Watchdog_Adjust+0x68> <== ALWAYS TAKEN 4000b99c: a4 10 20 01 mov 1, %l2 _Watchdog_First( header )->delta_interval -= units; 4000b9a0: 10 80 00 1d b 4000ba14 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 4000b9a4: b4 26 40 1a sub %i1, %i2, %i2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 4000b9a8: b4 a6 80 19 subcc %i2, %i1, %i2 4000b9ac: 02 80 00 11 be 4000b9f0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000b9b0: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000b9b4: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 4000b9b8: 80 a6 40 1a cmp %i1, %i2 4000b9bc: 38 80 00 16 bgu,a 4000ba14 <_Watchdog_Adjust+0xb8> 4000b9c0: b4 26 40 1a sub %i1, %i2, %i2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 4000b9c4: e4 20 60 10 st %l2, [ %g1 + 0x10 ] _ISR_Enable( level ); 4000b9c8: 7f ff dc a7 call 40002c64 4000b9cc: 01 00 00 00 nop _Watchdog_Tickle( header ); 4000b9d0: 40 00 00 b3 call 4000bc9c <_Watchdog_Tickle> 4000b9d4: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 4000b9d8: 7f ff dc 9f call 40002c54 4000b9dc: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000b9e0: c4 04 00 00 ld [ %l0 ], %g2 if ( _Chain_Is_empty( header ) ) 4000b9e4: 80 a4 40 02 cmp %l1, %g2 4000b9e8: 12 bf ff f0 bne 4000b9a8 <_Watchdog_Adjust+0x4c> 4000b9ec: 82 10 00 02 mov %g2, %g1 } break; } } _ISR_Enable( level ); 4000b9f0: 7f ff dc 9d call 40002c64 4000b9f4: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 4000b9f8: 12 bf ff fe bne 4000b9f0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000b9fc: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 4000ba00: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000ba04: b4 00 80 1a add %g2, %i2, %i2 4000ba08: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 4000ba0c: 7f ff dc 96 call 40002c64 4000ba10: 91 e8 00 08 restore %g0, %o0, %o0 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; 4000ba14: 10 bf ff f7 b 4000b9f0 <_Watchdog_Adjust+0x94> 4000ba18: f4 20 60 10 st %i2, [ %g1 + 0x10 ] =============================================================================== 400098d4 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 400098d4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 400098d8: 7f ff e1 00 call 40001cd8 400098dc: 01 00 00 00 nop previous_state = the_watchdog->state; 400098e0: e0 06 20 08 ld [ %i0 + 8 ], %l0 switch ( previous_state ) { 400098e4: 80 a4 20 01 cmp %l0, 1 400098e8: 02 80 00 2a be 40009990 <_Watchdog_Remove+0xbc> 400098ec: 03 10 00 54 sethi %hi(0x40015000), %g1 400098f0: 1a 80 00 09 bcc 40009914 <_Watchdog_Remove+0x40> 400098f4: 80 a4 20 03 cmp %l0, 3 _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 400098f8: 03 10 00 54 sethi %hi(0x40015000), %g1 400098fc: c2 00 63 54 ld [ %g1 + 0x354 ], %g1 ! 40015354 <_Watchdog_Ticks_since_boot> 40009900: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 40009904: 7f ff e0 f9 call 40001ce8 40009908: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 4000990c: 81 c7 e0 08 ret 40009910: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 40009914: 18 bf ff fa bgu 400098fc <_Watchdog_Remove+0x28> <== NEVER TAKEN 40009918: 03 10 00 54 sethi %hi(0x40015000), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 4000991c: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 40009920: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 40009924: c4 00 40 00 ld [ %g1 ], %g2 40009928: 80 a0 a0 00 cmp %g2, 0 4000992c: 02 80 00 07 be 40009948 <_Watchdog_Remove+0x74> 40009930: 05 10 00 54 sethi %hi(0x40015000), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 40009934: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 40009938: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 4000993c: 84 00 c0 02 add %g3, %g2, %g2 40009940: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 40009944: 05 10 00 54 sethi %hi(0x40015000), %g2 40009948: c4 00 a3 50 ld [ %g2 + 0x350 ], %g2 ! 40015350 <_Watchdog_Sync_count> 4000994c: 80 a0 a0 00 cmp %g2, 0 40009950: 22 80 00 07 be,a 4000996c <_Watchdog_Remove+0x98> 40009954: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 40009958: 05 10 00 55 sethi %hi(0x40015400), %g2 4000995c: c6 00 a0 84 ld [ %g2 + 0x84 ], %g3 ! 40015484 <_Per_CPU_Information+0x8> 40009960: 05 10 00 54 sethi %hi(0x40015000), %g2 40009964: c6 20 a2 c0 st %g3, [ %g2 + 0x2c0 ] ! 400152c0 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 40009968: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 4000996c: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 40009970: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 40009974: 03 10 00 54 sethi %hi(0x40015000), %g1 40009978: c2 00 63 54 ld [ %g1 + 0x354 ], %g1 ! 40015354 <_Watchdog_Ticks_since_boot> 4000997c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 40009980: 7f ff e0 da call 40001ce8 40009984: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 40009988: 81 c7 e0 08 ret 4000998c: 81 e8 00 00 restore _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 40009990: c2 00 63 54 ld [ %g1 + 0x354 ], %g1 /* * It is not actually on the chain so just change the state and * the Insert operation we interrupted will be aborted. */ the_watchdog->state = WATCHDOG_INACTIVE; 40009994: c0 26 20 08 clr [ %i0 + 8 ] _Watchdog_Sync_level = _ISR_Nest_level; _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 40009998: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000999c: 7f ff e0 d3 call 40001ce8 400099a0: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 400099a4: 81 c7 e0 08 ret 400099a8: 81 e8 00 00 restore =============================================================================== 4000b170 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 4000b170: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 4000b174: 7f ff dd 89 call 40002798 4000b178: a0 10 00 18 mov %i0, %l0 4000b17c: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 4000b180: 11 10 00 75 sethi %hi(0x4001d400), %o0 4000b184: 94 10 00 19 mov %i1, %o2 4000b188: 92 10 00 10 mov %l0, %o1 4000b18c: 7f ff e4 84 call 4000439c 4000b190: 90 12 21 58 or %o0, 0x158, %o0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000b194: e2 06 40 00 ld [ %i1 ], %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000b198: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 4000b19c: 80 a4 40 19 cmp %l1, %i1 4000b1a0: 02 80 00 0f be 4000b1dc <_Watchdog_Report_chain+0x6c> 4000b1a4: 11 10 00 75 sethi %hi(0x4001d400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 4000b1a8: 92 10 00 11 mov %l1, %o1 4000b1ac: 40 00 00 11 call 4000b1f0 <_Watchdog_Report> 4000b1b0: 90 10 20 00 clr %o0 _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = header->first ; node != _Chain_Tail(header) ; node = node->next ) 4000b1b4: e2 04 40 00 ld [ %l1 ], %l1 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = header->first ; 4000b1b8: 80 a4 40 19 cmp %l1, %i1 4000b1bc: 12 bf ff fc bne 4000b1ac <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 4000b1c0: 92 10 00 11 mov %l1, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 4000b1c4: 92 10 00 10 mov %l0, %o1 4000b1c8: 11 10 00 75 sethi %hi(0x4001d400), %o0 4000b1cc: 7f ff e4 74 call 4000439c 4000b1d0: 90 12 21 70 or %o0, 0x170, %o0 ! 4001d570 <_Status_Object_name_errors_to_status+0x30> } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 4000b1d4: 7f ff dd 75 call 400027a8 4000b1d8: 81 e8 00 00 restore _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 4000b1dc: 7f ff e4 70 call 4000439c 4000b1e0: 90 12 21 80 or %o0, 0x180, %o0 } _ISR_Enable( level ); 4000b1e4: 7f ff dd 71 call 400027a8 4000b1e8: 81 e8 00 00 restore =============================================================================== 4000e220 : rtems_name name, rtems_attribute attribute_set, uint32_t maximum_waiters, rtems_id *id ) { 4000e220: 9d e3 bf 98 save %sp, -104, %sp 4000e224: a0 10 00 18 mov %i0, %l0 Barrier_Control *the_barrier; CORE_barrier_Attributes the_attributes; if ( !rtems_is_name_valid( name ) ) 4000e228: 80 a4 20 00 cmp %l0, 0 4000e22c: 02 80 00 23 be 4000e2b8 4000e230: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !id ) 4000e234: 80 a6 e0 00 cmp %i3, 0 4000e238: 02 80 00 20 be 4000e2b8 4000e23c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; /* Initialize core barrier attributes */ if ( _Attributes_Is_barrier_automatic( attribute_set ) ) { 4000e240: 80 8e 60 10 btst 0x10, %i1 4000e244: 02 80 00 1f be 4000e2c0 4000e248: 80 a6 a0 00 cmp %i2, 0 the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 4000e24c: c0 27 bf f8 clr [ %fp + -8 ] if ( maximum_waiters == 0 ) 4000e250: 02 80 00 1a be 4000e2b8 4000e254: b0 10 20 0a mov 0xa, %i0 4000e258: 03 10 00 79 sethi %hi(0x4001e400), %g1 4000e25c: c4 00 60 b8 ld [ %g1 + 0xb8 ], %g2 ! 4001e4b8 <_Thread_Dispatch_disable_level> return RTEMS_INVALID_NUMBER; } else the_attributes.discipline = CORE_BARRIER_MANUAL_RELEASE; the_attributes.maximum_count = maximum_waiters; 4000e260: f4 27 bf fc st %i2, [ %fp + -4 ] 4000e264: 84 00 a0 01 inc %g2 4000e268: c4 20 60 b8 st %g2, [ %g1 + 0xb8 ] * This function allocates a barrier control block from * the inactive chain of free barrier control blocks. */ RTEMS_INLINE_ROUTINE Barrier_Control *_Barrier_Allocate( void ) { return (Barrier_Control *) _Objects_Allocate( &_Barrier_Information ); 4000e26c: 25 10 00 79 sethi %hi(0x4001e400), %l2 4000e270: 7f ff eb 47 call 40008f8c <_Objects_Allocate> 4000e274: 90 14 a3 38 or %l2, 0x338, %o0 ! 4001e738 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 4000e278: a2 92 20 00 orcc %o0, 0, %l1 4000e27c: 02 80 00 1e be 4000e2f4 <== NEVER TAKEN 4000e280: 90 04 60 14 add %l1, 0x14, %o0 return RTEMS_TOO_MANY; } the_barrier->attribute_set = attribute_set; _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 4000e284: 92 07 bf f8 add %fp, -8, %o1 4000e288: 40 00 02 42 call 4000eb90 <_CORE_barrier_Initialize> 4000e28c: f2 24 60 10 st %i1, [ %l1 + 0x10 ] 4000e290: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 *id = the_barrier->Object.id; _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 4000e294: a4 14 a3 38 or %l2, 0x338, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000e298: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 4000e29c: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000e2a0: 85 28 a0 02 sll %g2, 2, %g2 4000e2a4: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 4000e2a8: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Barrier_Information, &the_barrier->Object, (Objects_Name) name ); *id = the_barrier->Object.id; 4000e2ac: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Enable_dispatch(); 4000e2b0: 7f ff ee d5 call 40009e04 <_Thread_Enable_dispatch> 4000e2b4: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; } 4000e2b8: 81 c7 e0 08 ret 4000e2bc: 81 e8 00 00 restore if ( _Attributes_Is_barrier_automatic( attribute_set ) ) { the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; if ( maximum_waiters == 0 ) return RTEMS_INVALID_NUMBER; } else the_attributes.discipline = CORE_BARRIER_MANUAL_RELEASE; 4000e2c0: 82 10 20 01 mov 1, %g1 4000e2c4: c2 27 bf f8 st %g1, [ %fp + -8 ] 4000e2c8: 03 10 00 79 sethi %hi(0x4001e400), %g1 4000e2cc: c4 00 60 b8 ld [ %g1 + 0xb8 ], %g2 ! 4001e4b8 <_Thread_Dispatch_disable_level> the_attributes.maximum_count = maximum_waiters; 4000e2d0: f4 27 bf fc st %i2, [ %fp + -4 ] 4000e2d4: 84 00 a0 01 inc %g2 4000e2d8: c4 20 60 b8 st %g2, [ %g1 + 0xb8 ] 4000e2dc: 25 10 00 79 sethi %hi(0x4001e400), %l2 4000e2e0: 7f ff eb 2b call 40008f8c <_Objects_Allocate> 4000e2e4: 90 14 a3 38 or %l2, 0x338, %o0 ! 4001e738 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 4000e2e8: a2 92 20 00 orcc %o0, 0, %l1 4000e2ec: 12 bf ff e6 bne 4000e284 4000e2f0: 90 04 60 14 add %l1, 0x14, %o0 _Thread_Enable_dispatch(); 4000e2f4: 7f ff ee c4 call 40009e04 <_Thread_Enable_dispatch> 4000e2f8: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 4000e2fc: 81 c7 e0 08 ret 4000e300: 81 e8 00 00 restore =============================================================================== 40007be4 : rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 40007be4: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 40007be8: 03 10 00 65 sethi %hi(0x40019400), %g1 40007bec: c4 00 63 84 ld [ %g1 + 0x384 ], %g2 ! 40019784 <_Per_CPU_Information+0x8> rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 40007bf0: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 40007bf4: 03 10 00 65 sethi %hi(0x40019400), %g1 if ( rtems_interrupt_is_in_progress() ) 40007bf8: 80 a0 a0 00 cmp %g2, 0 40007bfc: 12 80 00 42 bne 40007d04 40007c00: c8 00 63 dc ld [ %g1 + 0x3dc ], %g4 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 40007c04: 80 a6 a0 00 cmp %i2, 0 40007c08: 02 80 00 50 be 40007d48 40007c0c: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 40007c10: 80 a6 60 00 cmp %i1, 0 40007c14: 02 80 00 4d be 40007d48 40007c18: c8 26 80 00 st %g4, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 40007c1c: c4 06 40 00 ld [ %i1 ], %g2 40007c20: 80 a0 a0 00 cmp %g2, 0 40007c24: 22 80 00 46 be,a 40007d3c 40007c28: c4 06 60 04 ld [ %i1 + 4 ], %g2 return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; if ( major >= major_limit ) 40007c2c: 80 a1 00 18 cmp %g4, %i0 40007c30: 08 80 00 33 bleu 40007cfc 40007c34: 01 00 00 00 nop rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 40007c38: 05 10 00 65 sethi %hi(0x40019400), %g2 40007c3c: c8 00 a1 18 ld [ %g2 + 0x118 ], %g4 ! 40019518 <_Thread_Dispatch_disable_level> 40007c40: 88 01 20 01 inc %g4 40007c44: c8 20 a1 18 st %g4, [ %g2 + 0x118 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 40007c48: 80 a6 20 00 cmp %i0, 0 40007c4c: 12 80 00 30 bne 40007d0c 40007c50: 1b 10 00 65 sethi %hi(0x40019400), %o5 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 40007c54: c8 00 63 dc ld [ %g1 + 0x3dc ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 40007c58: 80 a1 20 00 cmp %g4, 0 40007c5c: 22 80 00 3d be,a 40007d50 <== NEVER TAKEN 40007c60: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED 40007c64: 10 80 00 05 b 40007c78 40007c68: c2 03 63 e0 ld [ %o5 + 0x3e0 ], %g1 40007c6c: 80 a1 00 18 cmp %g4, %i0 40007c70: 08 80 00 0a bleu 40007c98 40007c74: 82 00 60 18 add %g1, 0x18, %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 40007c78: c4 00 40 00 ld [ %g1 ], %g2 40007c7c: 80 a0 a0 00 cmp %g2, 0 40007c80: 32 bf ff fb bne,a 40007c6c 40007c84: b0 06 20 01 inc %i0 40007c88: c4 00 60 04 ld [ %g1 + 4 ], %g2 40007c8c: 80 a0 a0 00 cmp %g2, 0 40007c90: 32 bf ff f7 bne,a 40007c6c 40007c94: b0 06 20 01 inc %i0 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 40007c98: 80 a1 00 18 cmp %g4, %i0 40007c9c: 02 80 00 2d be 40007d50 40007ca0: f0 26 80 00 st %i0, [ %i2 ] 40007ca4: 83 2e 20 03 sll %i0, 3, %g1 40007ca8: 85 2e 20 05 sll %i0, 5, %g2 40007cac: 84 20 80 01 sub %g2, %g1, %g2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40007cb0: c8 03 63 e0 ld [ %o5 + 0x3e0 ], %g4 40007cb4: da 00 c0 00 ld [ %g3 ], %o5 40007cb8: 82 01 00 02 add %g4, %g2, %g1 40007cbc: da 21 00 02 st %o5, [ %g4 + %g2 ] 40007cc0: c4 00 e0 04 ld [ %g3 + 4 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 40007cc4: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40007cc8: c4 20 60 04 st %g2, [ %g1 + 4 ] 40007ccc: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 40007cd0: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40007cd4: c4 20 60 08 st %g2, [ %g1 + 8 ] 40007cd8: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 40007cdc: c4 20 60 0c st %g2, [ %g1 + 0xc ] 40007ce0: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 40007ce4: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 40007ce8: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 40007cec: 40 00 07 17 call 40009948 <_Thread_Enable_dispatch> 40007cf0: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 40007cf4: 40 00 21 5f call 40010270 40007cf8: 81 e8 00 00 restore } 40007cfc: 81 c7 e0 08 ret 40007d00: 91 e8 20 0a restore %g0, 0xa, %o0 ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 40007d04: 81 c7 e0 08 ret 40007d08: 91 e8 20 12 restore %g0, 0x12, %o0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 40007d0c: c2 03 63 e0 ld [ %o5 + 0x3e0 ], %g1 40007d10: 89 2e 20 05 sll %i0, 5, %g4 40007d14: 85 2e 20 03 sll %i0, 3, %g2 40007d18: 84 21 00 02 sub %g4, %g2, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 40007d1c: c8 00 40 02 ld [ %g1 + %g2 ], %g4 40007d20: 80 a1 20 00 cmp %g4, 0 40007d24: 02 80 00 0f be 40007d60 40007d28: 82 00 40 02 add %g1, %g2, %g1 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 40007d2c: 40 00 07 07 call 40009948 <_Thread_Enable_dispatch> 40007d30: b0 10 20 0c mov 0xc, %i0 return RTEMS_RESOURCE_IN_USE; 40007d34: 81 c7 e0 08 ret 40007d38: 81 e8 00 00 restore static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 40007d3c: 80 a0 a0 00 cmp %g2, 0 40007d40: 32 bf ff bc bne,a 40007c30 40007d44: 80 a1 00 18 cmp %g4, %i0 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 40007d48: 81 c7 e0 08 ret 40007d4c: 91 e8 20 09 restore %g0, 9, %o0 if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 40007d50: 40 00 06 fe call 40009948 <_Thread_Enable_dispatch> 40007d54: b0 10 20 05 mov 5, %i0 return sc; 40007d58: 81 c7 e0 08 ret 40007d5c: 81 e8 00 00 restore static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 40007d60: c2 00 60 04 ld [ %g1 + 4 ], %g1 40007d64: 80 a0 60 00 cmp %g1, 0 40007d68: 12 bf ff f1 bne 40007d2c 40007d6c: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 40007d70: 10 bf ff d0 b 40007cb0 40007d74: f0 26 80 00 st %i0, [ %i2 ] =============================================================================== 4000925c : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 4000925c: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 40009260: 80 a6 20 00 cmp %i0, 0 40009264: 02 80 00 23 be 400092f0 <== NEVER TAKEN 40009268: 25 10 00 9d sethi %hi(0x40027400), %l2 4000926c: a4 14 a1 e0 or %l2, 0x1e0, %l2 ! 400275e0 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 40009270: a6 04 a0 0c add %l2, 0xc, %l3 if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { if ( !_Objects_Information_table[ api_index ] ) 40009274: c2 04 80 00 ld [ %l2 ], %g1 40009278: 80 a0 60 00 cmp %g1, 0 4000927c: 22 80 00 1a be,a 400092e4 40009280: a4 04 a0 04 add %l2, 4, %l2 continue; information = _Objects_Information_table[ api_index ][ 1 ]; 40009284: e2 00 60 04 ld [ %g1 + 4 ], %l1 if ( !information ) 40009288: 80 a4 60 00 cmp %l1, 0 4000928c: 22 80 00 16 be,a 400092e4 40009290: a4 04 a0 04 add %l2, 4, %l2 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 40009294: c2 14 60 10 lduh [ %l1 + 0x10 ], %g1 40009298: 84 90 60 00 orcc %g1, 0, %g2 4000929c: 22 80 00 12 be,a 400092e4 <== NEVER TAKEN 400092a0: a4 04 a0 04 add %l2, 4, %l2 <== NOT EXECUTED 400092a4: a0 10 20 01 mov 1, %l0 the_thread = (Thread_Control *)information->local_table[ i ]; 400092a8: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 400092ac: 83 2c 20 02 sll %l0, 2, %g1 400092b0: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 400092b4: 90 90 60 00 orcc %g1, 0, %o0 400092b8: 02 80 00 05 be 400092cc <== NEVER TAKEN 400092bc: a0 04 20 01 inc %l0 continue; (*routine)(the_thread); 400092c0: 9f c6 00 00 call %i0 400092c4: 01 00 00 00 nop 400092c8: c4 14 60 10 lduh [ %l1 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 400092cc: 83 28 a0 10 sll %g2, 0x10, %g1 400092d0: 83 30 60 10 srl %g1, 0x10, %g1 400092d4: 80 a0 40 10 cmp %g1, %l0 400092d8: 3a bf ff f5 bcc,a 400092ac 400092dc: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 400092e0: a4 04 a0 04 add %l2, 4, %l2 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 400092e4: 80 a4 80 13 cmp %l2, %l3 400092e8: 32 bf ff e4 bne,a 40009278 400092ec: c2 04 80 00 ld [ %l2 ], %g1 400092f0: 81 c7 e0 08 ret 400092f4: 81 e8 00 00 restore =============================================================================== 40007d20 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 40007d20: 9d e3 bf a0 save %sp, -96, %sp 40007d24: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 40007d28: 80 a6 a0 00 cmp %i2, 0 40007d2c: 02 80 00 20 be 40007dac 40007d30: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 40007d34: 92 10 00 19 mov %i1, %o1 40007d38: 40 00 07 74 call 40009b08 <_Objects_Get_information> 40007d3c: b0 10 20 0a mov 0xa, %i0 if ( !obj_info ) 40007d40: 80 a2 20 00 cmp %o0, 0 40007d44: 02 80 00 1a be 40007dac 40007d48: 01 00 00 00 nop /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 40007d4c: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 40007d50: c8 12 20 10 lduh [ %o0 + 0x10 ], %g4 return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 40007d54: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 40007d58: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 40007d5c: c4 26 a0 04 st %g2, [ %i2 + 4 ] return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 40007d60: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 40007d64: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 40007d68: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 40007d6c: 80 a1 20 00 cmp %g4, 0 40007d70: 02 80 00 0d be 40007da4 <== NEVER TAKEN 40007d74: 84 10 20 00 clr %g2 40007d78: da 02 20 1c ld [ %o0 + 0x1c ], %o5 40007d7c: 86 10 20 01 mov 1, %g3 40007d80: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 40007d84: 87 28 e0 02 sll %g3, 2, %g3 40007d88: c6 03 40 03 ld [ %o5 + %g3 ], %g3 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 40007d8c: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 40007d90: 80 a0 00 03 cmp %g0, %g3 40007d94: 84 60 bf ff subx %g2, -1, %g2 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 40007d98: 80 a1 00 01 cmp %g4, %g1 40007d9c: 1a bf ff fa bcc 40007d84 40007da0: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 40007da4: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 40007da8: b0 10 20 00 clr %i0 } 40007dac: 81 c7 e0 08 ret 40007db0: 81 e8 00 00 restore =============================================================================== 40013d08 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 40013d08: 9d e3 bf a0 save %sp, -96, %sp 40013d0c: a0 10 00 18 mov %i0, %l0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 40013d10: 80 a4 20 00 cmp %l0, 0 40013d14: 02 80 00 34 be 40013de4 40013d18: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !starting_address ) 40013d1c: 80 a6 60 00 cmp %i1, 0 40013d20: 02 80 00 31 be 40013de4 40013d24: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !id ) 40013d28: 80 a7 60 00 cmp %i5, 0 40013d2c: 02 80 00 2e be 40013de4 <== NEVER TAKEN 40013d30: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 40013d34: 02 80 00 2e be 40013dec 40013d38: 80 a6 a0 00 cmp %i2, 0 40013d3c: 02 80 00 2c be 40013dec 40013d40: 80 a6 80 1b cmp %i2, %i3 40013d44: 0a 80 00 28 bcs 40013de4 40013d48: b0 10 20 08 mov 8, %i0 40013d4c: 80 8e e0 07 btst 7, %i3 40013d50: 12 80 00 25 bne 40013de4 40013d54: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 40013d58: 12 80 00 23 bne 40013de4 40013d5c: b0 10 20 09 mov 9, %i0 40013d60: 03 10 00 f5 sethi %hi(0x4003d400), %g1 40013d64: c4 00 60 08 ld [ %g1 + 8 ], %g2 ! 4003d408 <_Thread_Dispatch_disable_level> 40013d68: 84 00 a0 01 inc %g2 40013d6c: c4 20 60 08 st %g2, [ %g1 + 8 ] * This function allocates a partition control block from * the inactive chain of free partition control blocks. */ RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void ) { return (Partition_Control *) _Objects_Allocate( &_Partition_Information ); 40013d70: 25 10 00 f4 sethi %hi(0x4003d000), %l2 40013d74: 40 00 13 14 call 400189c4 <_Objects_Allocate> 40013d78: 90 14 a2 14 or %l2, 0x214, %o0 ! 4003d214 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 40013d7c: a2 92 20 00 orcc %o0, 0, %l1 40013d80: 02 80 00 1d be 40013df4 40013d84: 92 10 00 1b mov %i3, %o1 #endif the_partition->starting_address = starting_address; the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; 40013d88: f8 24 60 1c st %i4, [ %l1 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 40013d8c: f2 24 60 10 st %i1, [ %l1 + 0x10 ] the_partition->length = length; 40013d90: f4 24 60 14 st %i2, [ %l1 + 0x14 ] the_partition->buffer_size = buffer_size; 40013d94: f6 24 60 18 st %i3, [ %l1 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 40013d98: 90 10 00 1a mov %i2, %o0 40013d9c: 40 00 61 a4 call 4002c42c <.udiv> 40013da0: c0 24 60 20 clr [ %l1 + 0x20 ] the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 40013da4: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 40013da8: 94 10 00 08 mov %o0, %o2 the_partition->length = length; the_partition->buffer_size = buffer_size; the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; _Chain_Initialize( &the_partition->Memory, starting_address, 40013dac: 96 10 00 1b mov %i3, %o3 40013db0: b8 04 60 24 add %l1, 0x24, %i4 40013db4: 40 00 0c d8 call 40017114 <_Chain_Initialize> 40013db8: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 40013dbc: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 40013dc0: a4 14 a2 14 or %l2, 0x214, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40013dc4: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 40013dc8: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40013dcc: 85 28 a0 02 sll %g2, 2, %g2 40013dd0: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 40013dd4: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Partition_Information, &the_partition->Object, (Objects_Name) name ); *id = the_partition->Object.id; 40013dd8: c2 27 40 00 st %g1, [ %i5 ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 40013ddc: 40 00 16 d6 call 40019934 <_Thread_Enable_dispatch> 40013de0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 40013de4: 81 c7 e0 08 ret 40013de8: 81 e8 00 00 restore } 40013dec: 81 c7 e0 08 ret 40013df0: 91 e8 20 08 restore %g0, 8, %o0 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 40013df4: 40 00 16 d0 call 40019934 <_Thread_Enable_dispatch> 40013df8: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 40013dfc: 81 c7 e0 08 ret 40013e00: 81 e8 00 00 restore =============================================================================== 40007384 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 40007384: 9d e3 bf 98 save %sp, -104, %sp Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) _Objects_Get( &_Rate_monotonic_Information, id, location ); 40007388: 11 10 00 7b sethi %hi(0x4001ec00), %o0 4000738c: 92 10 00 18 mov %i0, %o1 40007390: 90 12 22 6c or %o0, 0x26c, %o0 40007394: 40 00 09 77 call 40009970 <_Objects_Get> 40007398: 94 07 bf fc add %fp, -4, %o2 rtems_rate_monotonic_period_states local_state; ISR_Level level; the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { 4000739c: c2 07 bf fc ld [ %fp + -4 ], %g1 400073a0: 80 a0 60 00 cmp %g1, 0 400073a4: 02 80 00 04 be 400073b4 400073a8: a0 10 00 08 mov %o0, %l0 #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 400073ac: 81 c7 e0 08 ret 400073b0: 91 e8 20 04 restore %g0, 4, %o0 the_period = _Rate_monotonic_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 400073b4: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 400073b8: 23 10 00 7c sethi %hi(0x4001f000), %l1 400073bc: a2 14 62 3c or %l1, 0x23c, %l1 ! 4001f23c <_Per_CPU_Information> 400073c0: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400073c4: 80 a0 80 01 cmp %g2, %g1 400073c8: 02 80 00 06 be 400073e0 400073cc: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 400073d0: 40 00 0b df call 4000a34c <_Thread_Enable_dispatch> 400073d4: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 400073d8: 81 c7 e0 08 ret 400073dc: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 400073e0: 12 80 00 0f bne 4000741c 400073e4: 01 00 00 00 nop switch ( the_period->state ) { 400073e8: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 400073ec: 80 a0 60 04 cmp %g1, 4 400073f0: 08 80 00 06 bleu 40007408 <== ALWAYS TAKEN 400073f4: b0 10 20 00 clr %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 400073f8: 40 00 0b d5 call 4000a34c <_Thread_Enable_dispatch> 400073fc: 01 00 00 00 nop return RTEMS_TIMEOUT; 40007400: 81 c7 e0 08 ret 40007404: 81 e8 00 00 restore _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { switch ( the_period->state ) { 40007408: 83 28 60 02 sll %g1, 2, %g1 4000740c: 05 10 00 74 sethi %hi(0x4001d000), %g2 40007410: 84 10 a2 24 or %g2, 0x224, %g2 ! 4001d224 40007414: 10 bf ff f9 b 400073f8 40007418: f0 00 80 01 ld [ %g2 + %g1 ], %i0 } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 4000741c: 7f ff ed db call 40002b88 40007420: 01 00 00 00 nop 40007424: a6 10 00 08 mov %o0, %l3 switch ( the_period->state ) { 40007428: e4 04 20 38 ld [ %l0 + 0x38 ], %l2 4000742c: 80 a4 a0 02 cmp %l2, 2 40007430: 02 80 00 1d be 400074a4 40007434: 80 a4 a0 04 cmp %l2, 4 40007438: 02 80 00 37 be 40007514 4000743c: 80 a4 a0 00 cmp %l2, 0 40007440: 12 80 00 33 bne 4000750c <== NEVER TAKEN 40007444: 01 00 00 00 nop case RATE_MONOTONIC_INACTIVE: { _ISR_Enable( level ); 40007448: 7f ff ed d4 call 40002b98 4000744c: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 40007450: 7f ff ff 71 call 40007214 <_Rate_monotonic_Initiate_statistics> 40007454: 90 10 00 10 mov %l0, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 40007458: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 4000745c: 92 04 20 10 add %l0, 0x10, %o1 40007460: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 40007464: 11 10 00 7c sethi %hi(0x4001f000), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40007468: 03 10 00 1e sethi %hi(0x40007800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 4000746c: 90 12 20 9c or %o0, 0x9c, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40007470: 82 10 60 60 or %g1, 0x60, %g1 the_watchdog->id = id; 40007474: f0 24 20 30 st %i0, [ %l0 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40007478: c2 24 20 2c st %g1, [ %l0 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 4000747c: c0 24 20 18 clr [ %l0 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 40007480: c0 24 20 34 clr [ %l0 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 40007484: f2 24 20 3c st %i1, [ %l0 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40007488: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 4000748c: 40 00 10 ee call 4000b844 <_Watchdog_Insert> 40007490: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 40007494: 40 00 0b ae call 4000a34c <_Thread_Enable_dispatch> 40007498: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 4000749c: 81 c7 e0 08 ret 400074a0: 81 e8 00 00 restore case RATE_MONOTONIC_ACTIVE: /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 400074a4: 7f ff ff 78 call 40007284 <_Rate_monotonic_Update_statistics> 400074a8: 90 10 00 10 mov %l0, %o0 /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 400074ac: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 400074b0: f2 24 20 3c st %i1, [ %l0 + 0x3c ] /* * This tells the _Rate_monotonic_Timeout that this task is * in the process of blocking on the period and that we * may be changing the length of the next period. */ the_period->state = RATE_MONOTONIC_OWNER_IS_BLOCKING; 400074b4: c2 24 20 38 st %g1, [ %l0 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 400074b8: 7f ff ed b8 call 40002b98 400074bc: 90 10 00 13 mov %l3, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 400074c0: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400074c4: c4 04 20 08 ld [ %l0 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 400074c8: 90 10 00 01 mov %g1, %o0 400074cc: 13 00 00 10 sethi %hi(0x4000), %o1 400074d0: 40 00 0e 13 call 4000ad1c <_Thread_Set_state> 400074d4: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 400074d8: 7f ff ed ac call 40002b88 400074dc: 01 00 00 00 nop local_state = the_period->state; 400074e0: e6 04 20 38 ld [ %l0 + 0x38 ], %l3 the_period->state = RATE_MONOTONIC_ACTIVE; 400074e4: e4 24 20 38 st %l2, [ %l0 + 0x38 ] _ISR_Enable( level ); 400074e8: 7f ff ed ac call 40002b98 400074ec: 01 00 00 00 nop /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) 400074f0: 80 a4 e0 03 cmp %l3, 3 400074f4: 22 80 00 16 be,a 4000754c 400074f8: d0 04 60 0c ld [ %l1 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 400074fc: 40 00 0b 94 call 4000a34c <_Thread_Enable_dispatch> 40007500: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 40007504: 81 c7 e0 08 ret 40007508: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 4000750c: 81 c7 e0 08 ret <== NOT EXECUTED 40007510: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED case RATE_MONOTONIC_EXPIRED: /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 40007514: 7f ff ff 5c call 40007284 <_Rate_monotonic_Update_statistics> 40007518: 90 10 00 10 mov %l0, %o0 _ISR_Enable( level ); 4000751c: 7f ff ed 9f call 40002b98 40007520: 90 10 00 13 mov %l3, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 40007524: 82 10 20 02 mov 2, %g1 40007528: 92 04 20 10 add %l0, 0x10, %o1 4000752c: 11 10 00 7c sethi %hi(0x4001f000), %o0 the_period->next_length = length; 40007530: f2 24 20 3c st %i1, [ %l0 + 0x3c ] 40007534: 90 12 20 9c or %o0, 0x9c, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 40007538: c2 24 20 38 st %g1, [ %l0 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 4000753c: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40007540: 40 00 10 c1 call 4000b844 <_Watchdog_Insert> 40007544: b0 10 20 06 mov 6, %i0 40007548: 30 bf ff ac b,a 400073f8 /* * If it did, then we want to unblock ourself and continue as * if nothing happen. The period was reset in the timeout routine. */ if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING ) _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 4000754c: 40 00 0a 8c call 40009f7c <_Thread_Clear_state> 40007550: 13 00 00 10 sethi %hi(0x4000), %o1 40007554: 30 bf ff ea b,a 400074fc =============================================================================== 40007558 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 40007558: 9d e3 bf 30 save %sp, -208, %sp rtems_id id; rtems_rate_monotonic_period_statistics the_stats; rtems_rate_monotonic_period_status the_status; char name[5]; if ( !print ) 4000755c: 80 a6 60 00 cmp %i1, 0 40007560: 02 80 00 4c be 40007690 <== NEVER TAKEN 40007564: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 40007568: 13 10 00 74 sethi %hi(0x4001d000), %o1 4000756c: 9f c6 40 00 call %i1 40007570: 92 12 62 38 or %o1, 0x238, %o1 ! 4001d238 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 40007574: 90 10 00 18 mov %i0, %o0 40007578: 13 10 00 74 sethi %hi(0x4001d000), %o1 4000757c: 9f c6 40 00 call %i1 40007580: 92 12 62 58 or %o1, 0x258, %o1 ! 4001d258 (*print)( context, "--- Wall times are in seconds ---\n" ); 40007584: 90 10 00 18 mov %i0, %o0 40007588: 13 10 00 74 sethi %hi(0x4001d000), %o1 4000758c: 9f c6 40 00 call %i1 40007590: 92 12 62 80 or %o1, 0x280, %o1 ! 4001d280 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 40007594: 90 10 00 18 mov %i0, %o0 40007598: 13 10 00 74 sethi %hi(0x4001d000), %o1 4000759c: 9f c6 40 00 call %i1 400075a0: 92 12 62 a8 or %o1, 0x2a8, %o1 ! 4001d2a8 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 400075a4: 90 10 00 18 mov %i0, %o0 400075a8: 13 10 00 74 sethi %hi(0x4001d000), %o1 400075ac: 9f c6 40 00 call %i1 400075b0: 92 12 62 f8 or %o1, 0x2f8, %o1 ! 4001d2f8 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 400075b4: 23 10 00 7b sethi %hi(0x4001ec00), %l1 400075b8: a2 14 62 6c or %l1, 0x26c, %l1 ! 4001ee6c <_Rate_monotonic_Information> 400075bc: e0 04 60 08 ld [ %l1 + 8 ], %l0 400075c0: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400075c4: 80 a4 00 01 cmp %l0, %g1 400075c8: 18 80 00 32 bgu 40007690 <== NEVER TAKEN 400075cc: 2f 10 00 74 sethi %hi(0x4001d000), %l7 struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); (*print)( context, 400075d0: 39 10 00 74 sethi %hi(0x4001d000), %i4 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 400075d4: 2b 10 00 71 sethi %hi(0x4001c400), %l5 400075d8: a4 07 bf a0 add %fp, -96, %l2 status = rtems_rate_monotonic_get_statistics( id, &the_stats ); if ( status != RTEMS_SUCCESSFUL ) continue; /* If the above passed, so should this but check it anyway */ status = rtems_rate_monotonic_get_status( id, &the_status ); 400075dc: ba 07 bf d8 add %fp, -40, %i5 #if defined(RTEMS_DEBUG) if ( status != RTEMS_SUCCESSFUL ) continue; #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 400075e0: a6 07 bf f8 add %fp, -8, %l3 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 400075e4: ae 15 e3 48 or %l7, 0x348, %l7 { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; 400075e8: ac 07 bf b8 add %fp, -72, %l6 _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 400075ec: a8 07 bf f0 add %fp, -16, %l4 (*print)( context, 400075f0: b8 17 23 60 or %i4, 0x360, %i4 { #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ struct timespec wall_average; struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; 400075f4: b4 07 bf d0 add %fp, -48, %i2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 400075f8: 10 80 00 06 b 40007610 400075fc: aa 15 60 d8 or %l5, 0xd8, %l5 * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 40007600: a0 04 20 01 inc %l0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 40007604: 80 a0 40 10 cmp %g1, %l0 40007608: 0a 80 00 22 bcs 40007690 4000760c: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 40007610: 90 10 00 10 mov %l0, %o0 40007614: 40 00 19 57 call 4000db70 40007618: 92 10 00 12 mov %l2, %o1 if ( status != RTEMS_SUCCESSFUL ) 4000761c: 80 a2 20 00 cmp %o0, 0 40007620: 32 bf ff f8 bne,a 40007600 40007624: c2 04 60 0c ld [ %l1 + 0xc ], %g1 continue; /* If the above passed, so should this but check it anyway */ status = rtems_rate_monotonic_get_status( id, &the_status ); 40007628: 92 10 00 1d mov %i5, %o1 4000762c: 40 00 19 80 call 4000dc2c 40007630: 90 10 00 10 mov %l0, %o0 #if defined(RTEMS_DEBUG) if ( status != RTEMS_SUCCESSFUL ) continue; #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 40007634: d0 07 bf d8 ld [ %fp + -40 ], %o0 40007638: 94 10 00 13 mov %l3, %o2 4000763c: 40 00 00 b9 call 40007920 40007640: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 40007644: d8 1f bf a0 ldd [ %fp + -96 ], %o4 40007648: 92 10 00 17 mov %l7, %o1 4000764c: 94 10 00 10 mov %l0, %o2 40007650: 90 10 00 18 mov %i0, %o0 40007654: 9f c6 40 00 call %i1 40007658: 96 10 00 13 mov %l3, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 4000765c: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 40007660: 90 10 00 16 mov %l6, %o0 40007664: 94 10 00 14 mov %l4, %o2 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 40007668: 80 a0 60 00 cmp %g1, 0 4000766c: 12 80 00 0b bne 40007698 40007670: 92 10 00 15 mov %l5, %o1 (*print)( context, "\n" ); 40007674: 9f c6 40 00 call %i1 40007678: 90 10 00 18 mov %i0, %o0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 4000767c: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 40007680: a0 04 20 01 inc %l0 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 40007684: 80 a0 40 10 cmp %g1, %l0 40007688: 1a bf ff e3 bcc 40007614 <== ALWAYS TAKEN 4000768c: 90 10 00 10 mov %l0, %o0 40007690: 81 c7 e0 08 ret 40007694: 81 e8 00 00 restore struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 40007698: 40 00 0f 2e call 4000b350 <_Timespec_Divide_by_integer> 4000769c: 92 10 00 01 mov %g1, %o1 (*print)( context, 400076a0: d0 07 bf ac ld [ %fp + -84 ], %o0 400076a4: 40 00 46 72 call 4001906c <.div> 400076a8: 92 10 23 e8 mov 0x3e8, %o1 400076ac: 96 10 00 08 mov %o0, %o3 400076b0: d0 07 bf b4 ld [ %fp + -76 ], %o0 400076b4: d6 27 bf 9c st %o3, [ %fp + -100 ] 400076b8: 40 00 46 6d call 4001906c <.div> 400076bc: 92 10 23 e8 mov 0x3e8, %o1 400076c0: c2 07 bf f0 ld [ %fp + -16 ], %g1 400076c4: b6 10 00 08 mov %o0, %i3 400076c8: d0 07 bf f4 ld [ %fp + -12 ], %o0 400076cc: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 400076d0: 40 00 46 67 call 4001906c <.div> 400076d4: 92 10 23 e8 mov 0x3e8, %o1 400076d8: d8 07 bf b0 ld [ %fp + -80 ], %o4 400076dc: d6 07 bf 9c ld [ %fp + -100 ], %o3 400076e0: d4 07 bf a8 ld [ %fp + -88 ], %o2 400076e4: 9a 10 00 1b mov %i3, %o5 400076e8: 92 10 00 1c mov %i4, %o1 400076ec: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 400076f0: 9f c6 40 00 call %i1 400076f4: 90 10 00 18 mov %i0, %o0 struct timespec wall_average; struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); 400076f8: d2 07 bf a0 ld [ %fp + -96 ], %o1 400076fc: 94 10 00 14 mov %l4, %o2 40007700: 40 00 0f 14 call 4000b350 <_Timespec_Divide_by_integer> 40007704: 90 10 00 1a mov %i2, %o0 (*print)( context, 40007708: d0 07 bf c4 ld [ %fp + -60 ], %o0 4000770c: 40 00 46 58 call 4001906c <.div> 40007710: 92 10 23 e8 mov 0x3e8, %o1 40007714: 96 10 00 08 mov %o0, %o3 40007718: d0 07 bf cc ld [ %fp + -52 ], %o0 4000771c: d6 27 bf 9c st %o3, [ %fp + -100 ] 40007720: 40 00 46 53 call 4001906c <.div> 40007724: 92 10 23 e8 mov 0x3e8, %o1 40007728: c2 07 bf f0 ld [ %fp + -16 ], %g1 4000772c: b6 10 00 08 mov %o0, %i3 40007730: d0 07 bf f4 ld [ %fp + -12 ], %o0 40007734: 92 10 23 e8 mov 0x3e8, %o1 40007738: 40 00 46 4d call 4001906c <.div> 4000773c: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 40007740: d4 07 bf c0 ld [ %fp + -64 ], %o2 40007744: d6 07 bf 9c ld [ %fp + -100 ], %o3 40007748: d8 07 bf c8 ld [ %fp + -56 ], %o4 4000774c: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 40007750: 13 10 00 74 sethi %hi(0x4001d000), %o1 40007754: 90 10 00 18 mov %i0, %o0 40007758: 92 12 63 80 or %o1, 0x380, %o1 4000775c: 9f c6 40 00 call %i1 40007760: 9a 10 00 1b mov %i3, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 40007764: 10 bf ff a7 b 40007600 40007768: c2 04 60 0c ld [ %l1 + 0xc ], %g1 =============================================================================== 40007788 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 40007788: 9d e3 bf a0 save %sp, -96, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 4000778c: 03 10 00 7b sethi %hi(0x4001ec00), %g1 40007790: c4 00 63 d8 ld [ %g1 + 0x3d8 ], %g2 ! 4001efd8 <_Thread_Dispatch_disable_level> 40007794: 84 00 a0 01 inc %g2 40007798: c4 20 63 d8 st %g2, [ %g1 + 0x3d8 ] /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 4000779c: 23 10 00 7b sethi %hi(0x4001ec00), %l1 400077a0: a2 14 62 6c or %l1, 0x26c, %l1 ! 4001ee6c <_Rate_monotonic_Information> 400077a4: e0 04 60 08 ld [ %l1 + 8 ], %l0 400077a8: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400077ac: 80 a4 00 01 cmp %l0, %g1 400077b0: 18 80 00 09 bgu 400077d4 <== NEVER TAKEN 400077b4: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_reset_statistics( id ); 400077b8: 40 00 00 0a call 400077e0 400077bc: 90 10 00 10 mov %l0, %o0 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 400077c0: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 400077c4: a0 04 20 01 inc %l0 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 400077c8: 80 a0 40 10 cmp %g1, %l0 400077cc: 1a bf ff fb bcc 400077b8 400077d0: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 400077d4: 40 00 0a de call 4000a34c <_Thread_Enable_dispatch> 400077d8: 81 e8 00 00 restore =============================================================================== 40015330 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 40015330: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 40015334: 80 a6 60 00 cmp %i1, 0 40015338: 12 80 00 04 bne 40015348 4001533c: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40015340: 81 c7 e0 08 ret 40015344: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 40015348: 90 10 00 18 mov %i0, %o0 4001534c: 40 00 11 88 call 4001996c <_Thread_Get> 40015350: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40015354: c2 07 bf fc ld [ %fp + -4 ], %g1 40015358: 80 a0 60 00 cmp %g1, 0 4001535c: 02 80 00 05 be 40015370 40015360: a2 10 00 08 mov %o0, %l1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 40015364: 82 10 20 04 mov 4, %g1 } 40015368: 81 c7 e0 08 ret 4001536c: 91 e8 00 01 restore %g0, %g1, %o0 the_thread = _Thread_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 40015370: e0 02 21 5c ld [ %o0 + 0x15c ], %l0 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 40015374: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40015378: 80 a0 60 00 cmp %g1, 0 4001537c: 02 80 00 25 be 40015410 40015380: 01 00 00 00 nop if ( asr->is_enabled ) { 40015384: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 40015388: 80 a0 60 00 cmp %g1, 0 4001538c: 02 80 00 15 be 400153e0 40015390: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 40015394: 7f ff e6 74 call 4000ed64 40015398: 01 00 00 00 nop *signal_set |= signals; 4001539c: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 400153a0: b2 10 40 19 or %g1, %i1, %i1 400153a4: f2 24 20 14 st %i1, [ %l0 + 0x14 ] _ISR_Enable( _level ); 400153a8: 7f ff e6 73 call 4000ed74 400153ac: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 400153b0: 03 10 00 f5 sethi %hi(0x4003d400), %g1 400153b4: 82 10 62 74 or %g1, 0x274, %g1 ! 4003d674 <_Per_CPU_Information> 400153b8: c4 00 60 08 ld [ %g1 + 8 ], %g2 400153bc: 80 a0 a0 00 cmp %g2, 0 400153c0: 02 80 00 0f be 400153fc 400153c4: 01 00 00 00 nop 400153c8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 400153cc: 80 a4 40 02 cmp %l1, %g2 400153d0: 12 80 00 0b bne 400153fc <== NEVER TAKEN 400153d4: 84 10 20 01 mov 1, %g2 _Context_Switch_necessary = true; 400153d8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 400153dc: 30 80 00 08 b,a 400153fc rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 400153e0: 7f ff e6 61 call 4000ed64 400153e4: 01 00 00 00 nop *signal_set |= signals; 400153e8: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 400153ec: b2 10 40 19 or %g1, %i1, %i1 400153f0: f2 24 20 18 st %i1, [ %l0 + 0x18 ] _ISR_Enable( _level ); 400153f4: 7f ff e6 60 call 4000ed74 400153f8: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 400153fc: 40 00 11 4e call 40019934 <_Thread_Enable_dispatch> 40015400: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 40015404: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40015408: 81 c7 e0 08 ret 4001540c: 91 e8 00 01 restore %g0, %g1, %o0 _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 40015410: 40 00 11 49 call 40019934 <_Thread_Enable_dispatch> 40015414: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 40015418: 10 bf ff ca b 40015340 4001541c: 82 10 20 0b mov 0xb, %g1 ! b =============================================================================== 4000dbd0 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 4000dbd0: 9d e3 bf a0 save %sp, -96, %sp ASR_Information *asr; bool is_asr_enabled = false; bool needs_asr_dispatching = false; rtems_mode old_mode; if ( !previous_mode_set ) 4000dbd4: 80 a6 a0 00 cmp %i2, 0 4000dbd8: 02 80 00 43 be 4000dce4 4000dbdc: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 4000dbe0: 27 10 00 55 sethi %hi(0x40015400), %l3 4000dbe4: a6 14 e0 7c or %l3, 0x7c, %l3 ! 4001547c <_Per_CPU_Information> 4000dbe8: e0 04 e0 0c ld [ %l3 + 0xc ], %l0 api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 4000dbec: c4 0c 20 74 ldub [ %l0 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4000dbf0: c2 04 20 7c ld [ %l0 + 0x7c ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 4000dbf4: 80 a0 00 02 cmp %g0, %g2 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 4000dbf8: e2 04 21 5c ld [ %l0 + 0x15c ], %l1 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 4000dbfc: a4 60 3f ff subx %g0, -1, %l2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4000dc00: 80 a0 60 00 cmp %g1, 0 4000dc04: 12 80 00 3a bne 4000dcec 4000dc08: a5 2c a0 08 sll %l2, 8, %l2 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000dc0c: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 4000dc10: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 4000dc14: 7f ff f0 cf call 40009f50 <_CPU_ISR_Get_level> 4000dc18: a8 60 3f ff subx %g0, -1, %l4 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000dc1c: a9 2d 20 0a sll %l4, 0xa, %l4 4000dc20: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 4000dc24: a4 15 00 12 or %l4, %l2, %l2 /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 4000dc28: 80 8e 61 00 btst 0x100, %i1 4000dc2c: 02 80 00 06 be 4000dc44 4000dc30: e4 26 80 00 st %l2, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 4000dc34: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 4000dc38: 80 a0 00 01 cmp %g0, %g1 4000dc3c: 82 60 3f ff subx %g0, -1, %g1 4000dc40: c2 2c 20 74 stb %g1, [ %l0 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 4000dc44: 80 8e 62 00 btst 0x200, %i1 4000dc48: 02 80 00 0b be 4000dc74 4000dc4c: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 4000dc50: 80 8e 22 00 btst 0x200, %i0 4000dc54: 22 80 00 07 be,a 4000dc70 4000dc58: c0 24 20 7c clr [ %l0 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000dc5c: 03 10 00 54 sethi %hi(0x40015000), %g1 4000dc60: c2 00 61 78 ld [ %g1 + 0x178 ], %g1 ! 40015178 <_Thread_Ticks_per_timeslice> 4000dc64: c2 24 20 78 st %g1, [ %l0 + 0x78 ] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 4000dc68: 82 10 20 01 mov 1, %g1 4000dc6c: c2 24 20 7c st %g1, [ %l0 + 0x7c ] /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 4000dc70: 80 8e 60 0f btst 0xf, %i1 4000dc74: 12 80 00 42 bne 4000dd7c 4000dc78: 01 00 00 00 nop */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 4000dc7c: 80 8e 64 00 btst 0x400, %i1 4000dc80: 02 80 00 14 be 4000dcd0 4000dc84: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 4000dc88: c4 0c 60 08 ldub [ %l1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 4000dc8c: b0 0e 24 00 and %i0, 0x400, %i0 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 4000dc90: 80 a0 00 18 cmp %g0, %i0 4000dc94: 82 60 3f ff subx %g0, -1, %g1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 4000dc98: 80 a0 80 01 cmp %g2, %g1 4000dc9c: 22 80 00 0e be,a 4000dcd4 4000dca0: 03 10 00 54 sethi %hi(0x40015000), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 4000dca4: 7f ff d0 0d call 40001cd8 4000dca8: c2 2c 60 08 stb %g1, [ %l1 + 8 ] _signals = information->signals_pending; 4000dcac: c4 04 60 18 ld [ %l1 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 4000dcb0: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 information->signals_posted = _signals; 4000dcb4: c4 24 60 14 st %g2, [ %l1 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 4000dcb8: c2 24 60 18 st %g1, [ %l1 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 4000dcbc: 7f ff d0 0b call 40001ce8 4000dcc0: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 4000dcc4: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 4000dcc8: 80 a0 00 01 cmp %g0, %g1 4000dccc: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) 4000dcd0: 03 10 00 54 sethi %hi(0x40015000), %g1 4000dcd4: c4 00 63 9c ld [ %g1 + 0x39c ], %g2 ! 4001539c <_System_state_Current> 4000dcd8: 80 a0 a0 03 cmp %g2, 3 4000dcdc: 02 80 00 11 be 4000dd20 <== ALWAYS TAKEN 4000dce0: 82 10 20 00 clr %g1 if ( _Thread_Evaluate_mode() || needs_asr_dispatching ) _Thread_Dispatch(); return RTEMS_SUCCESSFUL; } 4000dce4: 81 c7 e0 08 ret 4000dce8: 91 e8 00 01 restore %g0, %g1, %o0 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000dcec: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 4000dcf0: a4 14 a2 00 or %l2, 0x200, %l2 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000dcf4: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 4000dcf8: 7f ff f0 96 call 40009f50 <_CPU_ISR_Get_level> 4000dcfc: a8 60 3f ff subx %g0, -1, %l4 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000dd00: a9 2d 20 0a sll %l4, 0xa, %l4 4000dd04: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 4000dd08: a4 15 00 12 or %l4, %l2, %l2 /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 4000dd0c: 80 8e 61 00 btst 0x100, %i1 4000dd10: 02 bf ff cd be 4000dc44 4000dd14: e4 26 80 00 st %l2, [ %i2 ] */ RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt ( Modes_Control mode_set ) { return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT; 4000dd18: 10 bf ff c8 b 4000dc38 4000dd1c: 82 0e 21 00 and %i0, 0x100, %g1 */ RTEMS_INLINE_ROUTINE bool _Thread_Evaluate_mode( void ) { Thread_Control *executing; executing = _Thread_Executing; 4000dd20: c2 04 e0 0c ld [ %l3 + 0xc ], %g1 if ( !_States_Is_ready( executing->current_state ) || 4000dd24: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000dd28: 80 a0 a0 00 cmp %g2, 0 4000dd2c: 32 80 00 0e bne,a 4000dd64 <== NEVER TAKEN 4000dd30: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED 4000dd34: c4 04 e0 10 ld [ %l3 + 0x10 ], %g2 4000dd38: 80 a0 40 02 cmp %g1, %g2 4000dd3c: 02 80 00 07 be 4000dd58 4000dd40: 80 88 e0 ff btst 0xff, %g3 ( !_Thread_Is_heir( executing ) && executing->is_preemptible ) ) { 4000dd44: c2 08 60 74 ldub [ %g1 + 0x74 ], %g1 4000dd48: 80 a0 60 00 cmp %g1, 0 4000dd4c: 12 80 00 06 bne 4000dd64 <== ALWAYS TAKEN 4000dd50: 82 10 20 01 mov 1, %g1 } } } if ( _System_state_Is_up( _System_state_Get() ) ) if ( _Thread_Evaluate_mode() || needs_asr_dispatching ) 4000dd54: 80 88 e0 ff btst 0xff, %g3 <== NOT EXECUTED 4000dd58: 12 80 00 04 bne 4000dd68 4000dd5c: 82 10 20 00 clr %g1 4000dd60: 30 bf ff e1 b,a 4000dce4 _Context_Switch_necessary = true; 4000dd64: c2 2c e0 18 stb %g1, [ %l3 + 0x18 ] _Thread_Dispatch(); 4000dd68: 7f ff e9 ab call 40008414 <_Thread_Dispatch> 4000dd6c: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 4000dd70: 82 10 20 00 clr %g1 ! 0 } 4000dd74: 81 c7 e0 08 ret 4000dd78: 91 e8 00 01 restore %g0, %g1, %o0 */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 4000dd7c: 90 0e 20 0f and %i0, 0xf, %o0 */ RTEMS_INLINE_ROUTINE void _Modes_Set_interrupt_level ( Modes_Control mode_set ) { _ISR_Set_level( _Modes_Get_interrupt_level( mode_set ) ); 4000dd80: 7f ff cf da call 40001ce8 4000dd84: 91 2a 20 08 sll %o0, 8, %o0 */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 4000dd88: 10 bf ff be b 4000dc80 4000dd8c: 80 8e 64 00 btst 0x400, %i1 =============================================================================== 4000b014 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 4000b014: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 4000b018: 80 a6 60 00 cmp %i1, 0 4000b01c: 02 80 00 07 be 4000b038 4000b020: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 4000b024: 03 10 00 65 sethi %hi(0x40019400), %g1 4000b028: c2 08 62 74 ldub [ %g1 + 0x274 ], %g1 ! 40019674 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 4000b02c: 80 a6 40 01 cmp %i1, %g1 4000b030: 18 80 00 1c bgu 4000b0a0 4000b034: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 4000b038: 80 a6 a0 00 cmp %i2, 0 4000b03c: 02 80 00 19 be 4000b0a0 4000b040: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 4000b044: 40 00 08 84 call 4000d254 <_Thread_Get> 4000b048: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 4000b04c: c2 07 bf fc ld [ %fp + -4 ], %g1 4000b050: 80 a0 60 00 cmp %g1, 0 4000b054: 12 80 00 13 bne 4000b0a0 4000b058: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 4000b05c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 4000b060: 80 a6 60 00 cmp %i1, 0 4000b064: 02 80 00 0d be 4000b098 4000b068: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 4000b06c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 4000b070: 80 a0 60 00 cmp %g1, 0 4000b074: 02 80 00 06 be 4000b08c 4000b078: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 4000b07c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 4000b080: 80 a6 40 01 cmp %i1, %g1 4000b084: 1a 80 00 05 bcc 4000b098 <== ALWAYS TAKEN 4000b088: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 4000b08c: 92 10 00 19 mov %i1, %o1 4000b090: 40 00 06 ec call 4000cc40 <_Thread_Change_priority> 4000b094: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 4000b098: 40 00 08 61 call 4000d21c <_Thread_Enable_dispatch> 4000b09c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 4000b0a0: 81 c7 e0 08 ret 4000b0a4: 81 e8 00 00 restore =============================================================================== 40007140 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 40007140: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 40007144: 80 a6 60 00 cmp %i1, 0 40007148: 02 80 00 1e be 400071c0 4000714c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 40007150: 90 10 00 18 mov %i0, %o0 40007154: 40 00 08 0c call 40009184 <_Thread_Get> 40007158: 92 07 bf fc add %fp, -4, %o1 switch (location) { 4000715c: c2 07 bf fc ld [ %fp + -4 ], %g1 40007160: 80 a0 60 00 cmp %g1, 0 40007164: 12 80 00 19 bne 400071c8 40007168: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 4000716c: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 40007170: 80 a0 60 00 cmp %g1, 0 40007174: 02 80 00 10 be 400071b4 40007178: 01 00 00 00 nop if (tvp->ptr == ptr) { 4000717c: c4 00 60 04 ld [ %g1 + 4 ], %g2 40007180: 80 a0 80 19 cmp %g2, %i1 40007184: 32 80 00 09 bne,a 400071a8 40007188: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 4000718c: 10 80 00 19 b 400071f0 40007190: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 40007194: 80 a0 80 19 cmp %g2, %i1 40007198: 22 80 00 0e be,a 400071d0 4000719c: c4 02 40 00 ld [ %o1 ], %g2 400071a0: 82 10 00 09 mov %o1, %g1 _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; 400071a4: d2 00 40 00 ld [ %g1 ], %o1 the_thread = _Thread_Get (tid, &location); switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { 400071a8: 80 a2 60 00 cmp %o1, 0 400071ac: 32 bf ff fa bne,a 40007194 <== ALWAYS TAKEN 400071b0: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 400071b4: 40 00 07 e6 call 4000914c <_Thread_Enable_dispatch> 400071b8: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 400071bc: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 400071c0: 81 c7 e0 08 ret 400071c4: 91 e8 00 01 restore %g0, %g1, %o0 400071c8: 81 c7 e0 08 ret 400071cc: 91 e8 00 01 restore %g0, %g1, %o0 case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; 400071d0: c4 20 40 00 st %g2, [ %g1 ] else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; _RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp ); 400071d4: 40 00 00 2e call 4000728c <_RTEMS_Tasks_Invoke_task_variable_dtor> 400071d8: 01 00 00 00 nop _Thread_Enable_dispatch(); 400071dc: 40 00 07 dc call 4000914c <_Thread_Enable_dispatch> 400071e0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 400071e4: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 400071e8: 81 c7 e0 08 ret 400071ec: 91 e8 00 01 restore %g0, %g1, %o0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 400071f0: 92 10 00 01 mov %g1, %o1 400071f4: 10 bf ff f8 b 400071d4 400071f8: c4 22 21 68 st %g2, [ %o0 + 0x168 ] =============================================================================== 400071fc : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 400071fc: 9d e3 bf 98 save %sp, -104, %sp 40007200: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 40007204: 80 a6 60 00 cmp %i1, 0 40007208: 02 80 00 1b be 40007274 4000720c: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 40007210: 80 a6 a0 00 cmp %i2, 0 40007214: 02 80 00 1c be 40007284 40007218: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 4000721c: 40 00 07 da call 40009184 <_Thread_Get> 40007220: 92 07 bf fc add %fp, -4, %o1 switch (location) { 40007224: c2 07 bf fc ld [ %fp + -4 ], %g1 40007228: 80 a0 60 00 cmp %g1, 0 4000722c: 12 80 00 12 bne 40007274 40007230: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 40007234: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 40007238: 80 a0 60 00 cmp %g1, 0 4000723c: 32 80 00 07 bne,a 40007258 40007240: c4 00 60 04 ld [ %g1 + 4 ], %g2 40007244: 30 80 00 0e b,a 4000727c 40007248: 80 a0 60 00 cmp %g1, 0 4000724c: 02 80 00 0c be 4000727c <== NEVER TAKEN 40007250: 01 00 00 00 nop if (tvp->ptr == ptr) { 40007254: c4 00 60 04 ld [ %g1 + 4 ], %g2 40007258: 80 a0 80 19 cmp %g2, %i1 4000725c: 32 bf ff fb bne,a 40007248 40007260: c2 00 40 00 ld [ %g1 ], %g1 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; 40007264: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 40007268: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 4000726c: 40 00 07 b8 call 4000914c <_Thread_Enable_dispatch> 40007270: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 40007274: 81 c7 e0 08 ret 40007278: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 4000727c: 40 00 07 b4 call 4000914c <_Thread_Enable_dispatch> 40007280: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 40007284: 81 c7 e0 08 ret 40007288: 81 e8 00 00 restore =============================================================================== 40015d98 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 40015d98: 9d e3 bf 98 save %sp, -104, %sp Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) _Objects_Get( &_Timer_Information, id, location ); 40015d9c: 11 10 00 f5 sethi %hi(0x4003d400), %o0 40015da0: 92 10 00 18 mov %i0, %o1 40015da4: 90 12 22 d4 or %o0, 0x2d4, %o0 40015da8: 40 00 0c 6c call 40018f58 <_Objects_Get> 40015dac: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 40015db0: c2 07 bf fc ld [ %fp + -4 ], %g1 40015db4: 80 a0 60 00 cmp %g1, 0 40015db8: 22 80 00 04 be,a 40015dc8 40015dbc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40015dc0: 81 c7 e0 08 ret 40015dc4: 91 e8 20 04 restore %g0, 4, %o0 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 40015dc8: 80 a0 60 04 cmp %g1, 4 40015dcc: 02 80 00 04 be 40015ddc <== NEVER TAKEN 40015dd0: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 40015dd4: 40 00 15 07 call 4001b1f0 <_Watchdog_Remove> 40015dd8: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 40015ddc: 40 00 0e d6 call 40019934 <_Thread_Enable_dispatch> 40015de0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 40015de4: 81 c7 e0 08 ret 40015de8: 81 e8 00 00 restore =============================================================================== 400162b0 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 400162b0: 9d e3 bf 98 save %sp, -104, %sp Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; 400162b4: 03 10 00 f5 sethi %hi(0x4003d400), %g1 400162b8: e0 00 63 14 ld [ %g1 + 0x314 ], %l0 ! 4003d714 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 400162bc: a2 10 00 18 mov %i0, %l1 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 400162c0: 80 a4 20 00 cmp %l0, 0 400162c4: 02 80 00 10 be 40016304 400162c8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 400162cc: 03 10 00 f5 sethi %hi(0x4003d400), %g1 400162d0: c2 08 60 18 ldub [ %g1 + 0x18 ], %g1 ! 4003d418 <_TOD_Is_set> 400162d4: 80 a0 60 00 cmp %g1, 0 400162d8: 02 80 00 0b be 40016304 <== NEVER TAKEN 400162dc: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 400162e0: 80 a6 a0 00 cmp %i2, 0 400162e4: 02 80 00 08 be 40016304 400162e8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 400162ec: 90 10 00 19 mov %i1, %o0 400162f0: 7f ff f3 ad call 400131a4 <_TOD_Validate> 400162f4: b0 10 20 14 mov 0x14, %i0 400162f8: 80 8a 20 ff btst 0xff, %o0 400162fc: 12 80 00 04 bne 4001630c 40016300: 01 00 00 00 nop case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40016304: 81 c7 e0 08 ret 40016308: 81 e8 00 00 restore return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 4001630c: 7f ff f3 70 call 400130cc <_TOD_To_seconds> 40016310: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 40016314: 25 10 00 f5 sethi %hi(0x4003d400), %l2 40016318: c2 04 a0 90 ld [ %l2 + 0x90 ], %g1 ! 4003d490 <_TOD_Now> 4001631c: 80 a2 00 01 cmp %o0, %g1 40016320: 08 bf ff f9 bleu 40016304 40016324: b2 10 00 08 mov %o0, %i1 40016328: 92 10 00 11 mov %l1, %o1 4001632c: 11 10 00 f5 sethi %hi(0x4003d400), %o0 40016330: 94 07 bf fc add %fp, -4, %o2 40016334: 40 00 0b 09 call 40018f58 <_Objects_Get> 40016338: 90 12 22 d4 or %o0, 0x2d4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 4001633c: c2 07 bf fc ld [ %fp + -4 ], %g1 40016340: a6 10 00 08 mov %o0, %l3 40016344: 80 a0 60 00 cmp %g1, 0 40016348: 12 bf ff ef bne 40016304 4001634c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 40016350: 40 00 13 a8 call 4001b1f0 <_Watchdog_Remove> 40016354: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 40016358: c2 04 20 04 ld [ %l0 + 4 ], %g1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 4001635c: c4 04 a0 90 ld [ %l2 + 0x90 ], %g2 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 40016360: 86 10 20 03 mov 3, %g3 _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 40016364: 90 10 00 10 mov %l0, %o0 40016368: 92 10 00 13 mov %l3, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 4001636c: b2 26 40 02 sub %i1, %g2, %i1 the_timer = _Timer_Get( id, &location ); switch ( location ) { case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 40016370: c6 24 e0 38 st %g3, [ %l3 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40016374: f4 24 e0 2c st %i2, [ %l3 + 0x2c ] the_watchdog->id = id; 40016378: e2 24 e0 30 st %l1, [ %l3 + 0x30 ] the_watchdog->user_data = user_data; 4001637c: f6 24 e0 34 st %i3, [ %l3 + 0x34 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 40016380: c0 24 e0 18 clr [ %l3 + 0x18 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 40016384: f2 24 e0 1c st %i1, [ %l3 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 40016388: 9f c0 40 00 call %g1 4001638c: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 40016390: 40 00 0d 69 call 40019934 <_Thread_Enable_dispatch> 40016394: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 40016398: 81 c7 e0 08 ret 4001639c: 81 e8 00 00 restore