=============================================================================== 400079d4 <_API_extensions_Run_postdriver>: * * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 400079d4: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 400079d8: 23 10 00 59 sethi %hi(0x40016400), %l1 400079dc: e0 04 60 04 ld [ %l1 + 4 ], %l0 ! 40016404 <_API_extensions_List> 400079e0: a2 14 60 04 or %l1, 4, %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 400079e4: a2 04 60 04 add %l1, 4, %l1 400079e8: 80 a4 00 11 cmp %l0, %l1 400079ec: 02 80 00 09 be 40007a10 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 400079f0: 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)(); 400079f4: c2 04 20 08 ld [ %l0 + 8 ], %g1 400079f8: 9f c0 40 00 call %g1 400079fc: 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 ) { 40007a00: 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 ; 40007a04: 80 a4 00 11 cmp %l0, %l1 40007a08: 32 bf ff fc bne,a 400079f8 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN 40007a0c: c2 04 20 08 ld [ %l0 + 8 ], %g1 <== NOT EXECUTED 40007a10: 81 c7 e0 08 ret 40007a14: 81 e8 00 00 restore =============================================================================== 40007a18 <_API_extensions_Run_postswitch>: * * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 40007a18: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _API_extensions_List.first ; 40007a1c: 23 10 00 59 sethi %hi(0x40016400), %l1 40007a20: e0 04 60 04 ld [ %l1 + 4 ], %l0 ! 40016404 <_API_extensions_List> 40007a24: a2 14 60 04 or %l1, 4, %l1 40007a28: a2 04 60 04 add %l1, 4, %l1 40007a2c: 80 a4 00 11 cmp %l0, %l1 40007a30: 02 80 00 0a be 40007a58 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 40007a34: 25 10 00 59 sethi %hi(0x40016400), %l2 40007a38: a4 14 a0 3c or %l2, 0x3c, %l2 ! 4001643c <_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 ); 40007a3c: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40007a40: 9f c0 40 00 call %g1 40007a44: 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 ) { 40007a48: 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 ; 40007a4c: 80 a4 00 11 cmp %l0, %l1 40007a50: 32 bf ff fc bne,a 40007a40 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN 40007a54: c2 04 20 0c ld [ %l0 + 0xc ], %g1 <== NOT EXECUTED 40007a58: 81 c7 e0 08 ret 40007a5c: 81 e8 00 00 restore =============================================================================== 400180a4 <_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 ) { 400180a4: 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 ) { 400180a8: 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 ) { 400180ac: 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 ) { 400180b0: 80 a0 40 1a cmp %g1, %i2 400180b4: 0a 80 00 17 bcs 40018110 <_CORE_message_queue_Broadcast+0x6c><== NEVER TAKEN 400180b8: 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 ) { 400180bc: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 400180c0: 80 a0 60 00 cmp %g1, 0 400180c4: 02 80 00 0a be 400180ec <_CORE_message_queue_Broadcast+0x48> 400180c8: a4 10 20 00 clr %l2 *count = 0; 400180cc: c0 27 40 00 clr [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 400180d0: 81 c7 e0 08 ret 400180d4: 91 e8 20 00 restore %g0, 0, %o0 const void *source, void *destination, size_t size ) { memcpy(destination, source, size); 400180d8: d0 04 60 2c ld [ %l1 + 0x2c ], %o0 400180dc: 40 00 23 05 call 40020cf0 400180e0: a4 04 a0 01 inc %l2 buffer, waitp->return_argument_second.mutable_object, size ); *(size_t *) the_thread->Wait.return_argument = size; 400180e4: c2 04 60 28 ld [ %l1 + 0x28 ], %g1 400180e8: 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 = 400180ec: 40 00 0a c1 call 4001abf0 <_Thread_queue_Dequeue> 400180f0: 90 10 00 10 mov %l0, %o0 400180f4: 92 10 00 19 mov %i1, %o1 400180f8: a2 10 00 08 mov %o0, %l1 400180fc: 80 a2 20 00 cmp %o0, 0 40018100: 12 bf ff f6 bne 400180d8 <_CORE_message_queue_Broadcast+0x34> 40018104: 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; 40018108: e4 27 40 00 st %l2, [ %i5 ] return CORE_MESSAGE_QUEUE_STATUS_SUCCESSFUL; 4001810c: b0 10 20 00 clr %i0 } 40018110: 81 c7 e0 08 ret 40018114: 81 e8 00 00 restore =============================================================================== 40011938 <_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 ) { 40011938: 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; 4001193c: 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; 40011940: 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; 40011944: 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 ) { 40011948: 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)) { 4001194c: 80 8e e0 03 btst 3, %i3 40011950: 02 80 00 07 be 4001196c <_CORE_message_queue_Initialize+0x34> 40011954: a4 10 00 1b mov %i3, %l2 allocated_message_size += sizeof(uint32_t); 40011958: a4 06 e0 04 add %i3, 4, %l2 allocated_message_size &= ~(sizeof(uint32_t) - 1); 4001195c: a4 0c bf fc and %l2, -4, %l2 } if (allocated_message_size < maximum_message_size) 40011960: 80 a6 c0 12 cmp %i3, %l2 40011964: 18 80 00 22 bgu 400119ec <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 40011968: 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)); 4001196c: 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 * 40011970: 92 10 00 1a mov %i2, %o1 40011974: 90 10 00 11 mov %l1, %o0 40011978: 40 00 3f 19 call 400215dc <.umul> 4001197c: b0 10 20 00 clr %i0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 40011980: 80 a2 00 12 cmp %o0, %l2 40011984: 0a 80 00 1a bcs 400119ec <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN 40011988: 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 ); 4001198c: 40 00 0c 49 call 40014ab0 <_Workspace_Allocate> 40011990: 01 00 00 00 nop if (the_message_queue->message_buffers == 0) 40011994: 80 a2 20 00 cmp %o0, 0 40011998: 02 80 00 15 be 400119ec <_CORE_message_queue_Initialize+0xb4> 4001199c: d0 24 20 5c st %o0, [ %l0 + 0x5c ] /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 400119a0: 92 10 00 08 mov %o0, %o1 400119a4: 94 10 00 1a mov %i2, %o2 400119a8: 96 10 00 11 mov %l1, %o3 400119ac: 40 00 14 dd call 40016d20 <_Chain_Initialize> 400119b0: 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( 400119b4: 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; 400119b8: 82 04 20 54 add %l0, 0x54, %g1 400119bc: 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); 400119c0: c2 24 20 50 st %g1, [ %l0 + 0x50 ] 400119c4: 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 ); 400119c8: 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; 400119cc: b0 10 20 01 mov 1, %i0 the_chain->permanent_null = NULL; 400119d0: 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( 400119d4: 90 10 00 10 mov %l0, %o0 the_chain->last = _Chain_Head(the_chain); 400119d8: c2 24 20 58 st %g1, [ %l0 + 0x58 ] 400119dc: 92 60 3f ff subx %g0, -1, %o1 400119e0: 94 10 20 80 mov 0x80, %o2 400119e4: 40 00 08 e4 call 40013d74 <_Thread_queue_Initialize> 400119e8: 96 10 20 06 mov 6, %o3 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 400119ec: 81 c7 e0 08 ret 400119f0: 81 e8 00 00 restore =============================================================================== 40007d64 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 40007d64: 9d e3 bf a0 save %sp, -96, %sp _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 40007d68: 21 10 00 58 sethi %hi(0x40016000), %l0 40007d6c: c2 04 21 d8 ld [ %l0 + 0x1d8 ], %g1 ! 400161d8 <_Thread_Dispatch_disable_level> 40007d70: 80 a0 60 00 cmp %g1, 0 40007d74: 02 80 00 05 be 40007d88 <_CORE_mutex_Seize+0x24> 40007d78: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 40007d7c: 80 8e a0 ff btst 0xff, %i2 40007d80: 12 80 00 1a bne 40007de8 <_CORE_mutex_Seize+0x84> <== ALWAYS TAKEN 40007d84: 03 10 00 58 sethi %hi(0x40016000), %g1 40007d88: 90 10 00 18 mov %i0, %o0 40007d8c: 40 00 13 fc call 4000cd7c <_CORE_mutex_Seize_interrupt_trylock> 40007d90: 92 07 a0 54 add %fp, 0x54, %o1 40007d94: 80 a2 20 00 cmp %o0, 0 40007d98: 02 80 00 12 be 40007de0 <_CORE_mutex_Seize+0x7c> 40007d9c: 80 8e a0 ff btst 0xff, %i2 40007da0: 02 80 00 1a be 40007e08 <_CORE_mutex_Seize+0xa4> 40007da4: 01 00 00 00 nop 40007da8: c4 04 21 d8 ld [ %l0 + 0x1d8 ], %g2 40007dac: 03 10 00 59 sethi %hi(0x40016400), %g1 40007db0: c2 00 60 48 ld [ %g1 + 0x48 ], %g1 ! 40016448 <_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; 40007db4: 86 10 20 01 mov 1, %g3 40007db8: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 40007dbc: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 40007dc0: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 40007dc4: 82 00 a0 01 add %g2, 1, %g1 40007dc8: c2 24 21 d8 st %g1, [ %l0 + 0x1d8 ] 40007dcc: 7f ff e8 14 call 40001e1c 40007dd0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40007dd4: 90 10 00 18 mov %i0, %o0 40007dd8: 7f ff ff c0 call 40007cd8 <_CORE_mutex_Seize_interrupt_blocking> 40007ddc: 92 10 00 1b mov %i3, %o1 40007de0: 81 c7 e0 08 ret 40007de4: 81 e8 00 00 restore 40007de8: c2 00 63 5c ld [ %g1 + 0x35c ], %g1 40007dec: 80 a0 60 01 cmp %g1, 1 40007df0: 28 bf ff e7 bleu,a 40007d8c <_CORE_mutex_Seize+0x28> 40007df4: 90 10 00 18 mov %i0, %o0 40007df8: 90 10 20 00 clr %o0 40007dfc: 92 10 20 00 clr %o1 40007e00: 40 00 01 d9 call 40008564 <_Internal_error_Occurred> 40007e04: 94 10 20 12 mov 0x12, %o2 40007e08: 7f ff e8 05 call 40001e1c 40007e0c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 40007e10: 03 10 00 59 sethi %hi(0x40016400), %g1 40007e14: c2 00 60 48 ld [ %g1 + 0x48 ], %g1 ! 40016448 <_Per_CPU_Information+0xc> 40007e18: 84 10 20 01 mov 1, %g2 40007e1c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 40007e20: 81 c7 e0 08 ret 40007e24: 81 e8 00 00 restore =============================================================================== 4000cd7c <_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 ) { 4000cd7c: 9d e3 bf a0 save %sp, -96, %sp { Thread_Control *executing; /* disabled when you get here */ executing = _Thread_Executing; 4000cd80: 03 10 00 59 sethi %hi(0x40016400), %g1 4000cd84: c2 00 60 48 ld [ %g1 + 0x48 ], %g1 ! 40016448 <_Per_CPU_Information+0xc> executing->Wait.return_code = CORE_MUTEX_STATUS_SUCCESSFUL; if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 4000cd88: 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; 4000cd8c: c0 20 60 34 clr [ %g1 + 0x34 ] if ( !_CORE_mutex_Is_locked( the_mutex ) ) { 4000cd90: 80 a0 a0 00 cmp %g2, 0 4000cd94: 02 80 00 13 be 4000cde0 <_CORE_mutex_Seize_interrupt_trylock+0x64> 4000cd98: a0 10 00 18 mov %i0, %l0 the_mutex->lock = CORE_MUTEX_LOCKED; the_mutex->holder = executing; the_mutex->holder_id = executing->Object.id; 4000cd9c: c8 00 60 08 ld [ %g1 + 8 ], %g4 return _CORE_mutex_Seize_interrupt_trylock_body( the_mutex, level_p ); } 4000cda0: c4 06 20 48 ld [ %i0 + 0x48 ], %g2 the_mutex->nest_count = 1; 4000cda4: 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; 4000cda8: c0 26 20 50 clr [ %i0 + 0x50 ] the_mutex->holder = executing; 4000cdac: c2 26 20 5c st %g1, [ %i0 + 0x5c ] the_mutex->holder_id = executing->Object.id; 4000cdb0: c8 26 20 60 st %g4, [ %i0 + 0x60 ] the_mutex->nest_count = 1; if ( _CORE_mutex_Is_inherit_priority( &the_mutex->Attributes ) || 4000cdb4: 80 a0 a0 02 cmp %g2, 2 4000cdb8: 02 80 00 10 be 4000cdf8 <_CORE_mutex_Seize_interrupt_trylock+0x7c> 4000cdbc: c6 26 20 54 st %g3, [ %i0 + 0x54 ] 4000cdc0: 80 a0 a0 03 cmp %g2, 3 4000cdc4: 22 80 00 21 be,a 4000ce48 <_CORE_mutex_Seize_interrupt_trylock+0xcc> 4000cdc8: da 00 60 1c ld [ %g1 + 0x1c ], %o5 executing->resource_count++; } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 4000cdcc: d0 06 40 00 ld [ %i1 ], %o0 4000cdd0: 7f ff d4 13 call 40001e1c 4000cdd4: b0 10 20 00 clr %i0 4000cdd8: 81 c7 e0 08 ret 4000cddc: 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 ) ) { 4000cde0: c4 06 20 5c ld [ %i0 + 0x5c ], %g2 4000cde4: 80 a0 40 02 cmp %g1, %g2 4000cde8: 02 80 00 0c be 4000ce18 <_CORE_mutex_Seize_interrupt_trylock+0x9c> 4000cdec: b0 10 20 01 mov 1, %i0 4000cdf0: 81 c7 e0 08 ret 4000cdf4: 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++; 4000cdf8: c4 00 60 1c ld [ %g1 + 0x1c ], %g2 4000cdfc: 84 00 a0 01 inc %g2 4000ce00: c4 20 60 1c st %g2, [ %g1 + 0x1c ] } if ( !_CORE_mutex_Is_priority_ceiling( &the_mutex->Attributes ) ) { _ISR_Enable( *level_p ); 4000ce04: d0 06 40 00 ld [ %i1 ], %o0 4000ce08: 7f ff d4 05 call 40001e1c 4000ce0c: b0 10 20 00 clr %i0 4000ce10: 81 c7 e0 08 ret 4000ce14: 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 ) { 4000ce18: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 4000ce1c: 80 a0 a0 00 cmp %g2, 0 4000ce20: 12 80 00 2b bne 4000cecc <_CORE_mutex_Seize_interrupt_trylock+0x150> 4000ce24: 80 a0 a0 01 cmp %g2, 1 case CORE_MUTEX_NESTING_ACQUIRES: the_mutex->nest_count++; 4000ce28: c2 04 20 54 ld [ %l0 + 0x54 ], %g1 4000ce2c: 82 00 60 01 inc %g1 4000ce30: c2 24 20 54 st %g1, [ %l0 + 0x54 ] _ISR_Enable( *level_p ); 4000ce34: d0 06 40 00 ld [ %i1 ], %o0 4000ce38: 7f ff d3 f9 call 40001e1c 4000ce3c: b0 10 20 00 clr %i0 4000ce40: 81 c7 e0 08 ret 4000ce44: 81 e8 00 00 restore */ { Priority_Control ceiling; Priority_Control current; ceiling = the_mutex->Attributes.priority_ceiling; 4000ce48: c8 06 20 4c ld [ %i0 + 0x4c ], %g4 current = executing->current_priority; 4000ce4c: 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++; 4000ce50: 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 ) { 4000ce54: 80 a1 00 02 cmp %g4, %g2 4000ce58: 02 80 00 25 be 4000ceec <_CORE_mutex_Seize_interrupt_trylock+0x170> 4000ce5c: d8 20 60 1c st %o4, [ %g1 + 0x1c ] _ISR_Enable( *level_p ); return 0; } if ( current > ceiling ) { 4000ce60: 80 a1 00 02 cmp %g4, %g2 4000ce64: 1a 80 00 11 bcc 4000cea8 <_CORE_mutex_Seize_interrupt_trylock+0x12c> 4000ce68: 84 10 20 06 mov 6, %g2 rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 4000ce6c: 03 10 00 58 sethi %hi(0x40016000), %g1 4000ce70: c4 00 61 d8 ld [ %g1 + 0x1d8 ], %g2 ! 400161d8 <_Thread_Dispatch_disable_level> 4000ce74: 84 00 a0 01 inc %g2 4000ce78: c4 20 61 d8 st %g2, [ %g1 + 0x1d8 ] _Thread_Disable_dispatch(); _ISR_Enable( *level_p ); 4000ce7c: 7f ff d3 e8 call 40001e1c 4000ce80: d0 06 40 00 ld [ %i1 ], %o0 _Thread_Change_priority( 4000ce84: d0 06 20 5c ld [ %i0 + 0x5c ], %o0 4000ce88: d2 06 20 4c ld [ %i0 + 0x4c ], %o1 4000ce8c: 94 10 20 00 clr %o2 4000ce90: 7f ff f0 39 call 40008f74 <_Thread_Change_priority> 4000ce94: b0 10 20 00 clr %i0 the_mutex->holder, the_mutex->Attributes.priority_ceiling, false ); _Thread_Enable_dispatch(); 4000ce98: 7f ff f1 ae call 40009550 <_Thread_Enable_dispatch> 4000ce9c: 01 00 00 00 nop 4000cea0: 81 c7 e0 08 ret 4000cea4: 81 e8 00 00 restore return 0; } /* if ( current < ceiling ) */ { executing->Wait.return_code = CORE_MUTEX_STATUS_CEILING_VIOLATED; 4000cea8: c4 20 60 34 st %g2, [ %g1 + 0x34 ] the_mutex->lock = CORE_MUTEX_UNLOCKED; 4000ceac: c6 26 20 50 st %g3, [ %i0 + 0x50 ] the_mutex->nest_count = 0; /* undo locking above */ 4000ceb0: c0 26 20 54 clr [ %i0 + 0x54 ] executing->resource_count--; /* undo locking above */ 4000ceb4: da 20 60 1c st %o5, [ %g1 + 0x1c ] _ISR_Enable( *level_p ); 4000ceb8: d0 06 40 00 ld [ %i1 ], %o0 4000cebc: 7f ff d3 d8 call 40001e1c 4000cec0: b0 10 20 00 clr %i0 4000cec4: 81 c7 e0 08 ret 4000cec8: 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 ) { 4000cecc: 12 bf ff c3 bne 4000cdd8 <_CORE_mutex_Seize_interrupt_trylock+0x5c><== ALWAYS TAKEN 4000ced0: 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; 4000ced4: c4 20 60 34 st %g2, [ %g1 + 0x34 ] <== NOT EXECUTED _ISR_Enable( *level_p ); 4000ced8: d0 06 40 00 ld [ %i1 ], %o0 <== NOT EXECUTED 4000cedc: 7f ff d3 d0 call 40001e1c <== NOT EXECUTED 4000cee0: b0 10 20 00 clr %i0 <== NOT EXECUTED 4000cee4: 81 c7 e0 08 ret <== NOT EXECUTED 4000cee8: 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 ); 4000ceec: d0 06 40 00 ld [ %i1 ], %o0 4000cef0: 7f ff d3 cb call 40001e1c 4000cef4: b0 10 20 00 clr %i0 4000cef8: 81 c7 e0 08 ret 4000cefc: 81 e8 00 00 restore =============================================================================== 40007fa4 <_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 ) { 40007fa4: 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)) ) { 40007fa8: 90 10 00 18 mov %i0, %o0 40007fac: 40 00 06 46 call 400098c4 <_Thread_queue_Dequeue> 40007fb0: a0 10 00 18 mov %i0, %l0 40007fb4: 80 a2 20 00 cmp %o0, 0 40007fb8: 12 80 00 0e bne 40007ff0 <_CORE_semaphore_Surrender+0x4c> 40007fbc: 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 ); 40007fc0: 7f ff e7 93 call 40001e0c 40007fc4: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 40007fc8: c2 04 20 48 ld [ %l0 + 0x48 ], %g1 40007fcc: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 40007fd0: 80 a0 40 02 cmp %g1, %g2 40007fd4: 1a 80 00 05 bcc 40007fe8 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 40007fd8: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 40007fdc: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 40007fe0: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 40007fe4: c2 24 20 48 st %g1, [ %l0 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 40007fe8: 7f ff e7 8d call 40001e1c 40007fec: 01 00 00 00 nop } return status; } 40007ff0: 81 c7 e0 08 ret 40007ff4: 81 e8 00 00 restore =============================================================================== 400082ac <_Chain_Get_with_empty_check>: bool _Chain_Get_with_empty_check( Chain_Control *chain, Chain_Node **node ) { 400082ac: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; bool is_empty_now; _ISR_Disable( level ); 400082b0: 7f ff e8 5e call 40002428 400082b4: 01 00 00 00 nop Chain_Control *the_chain, Chain_Node **the_node ) { bool is_empty_now = true; Chain_Node *first = the_chain->first; 400082b8: 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; 400082bc: 86 06 20 04 add %i0, 4, %g3 ) { bool is_empty_now = true; Chain_Node *first = the_chain->first; if ( first != _Chain_Tail( the_chain ) ) { 400082c0: 80 a0 40 03 cmp %g1, %g3 400082c4: 22 80 00 0d be,a 400082f8 <_Chain_Get_with_empty_check+0x4c><== NEVER TAKEN 400082c8: c0 26 40 00 clr [ %i1 ] <== NOT EXECUTED Chain_Node *new_first = first->next; 400082cc: c4 00 40 00 ld [ %g1 ], %g2 the_chain->first = new_first; 400082d0: c4 26 00 00 st %g2, [ %i0 ] new_first->previous = _Chain_Head( the_chain ); 400082d4: f0 20 a0 04 st %i0, [ %g2 + 4 ] *the_node = first; 400082d8: c2 26 40 00 st %g1, [ %i1 ] is_empty_now = new_first == _Chain_Tail( the_chain ); 400082dc: 84 18 c0 02 xor %g3, %g2, %g2 400082e0: 80 a0 00 02 cmp %g0, %g2 400082e4: b0 60 3f ff subx %g0, -1, %i0 is_empty_now = _Chain_Get_with_empty_check_unprotected( chain, node ); _ISR_Enable( level ); 400082e8: 7f ff e8 54 call 40002438 400082ec: 01 00 00 00 nop return is_empty_now; } 400082f0: 81 c7 e0 08 ret 400082f4: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE bool _Chain_Get_with_empty_check_unprotected( Chain_Control *the_chain, Chain_Node **the_node ) { bool is_empty_now = true; 400082f8: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED ISR_Level level; bool is_empty_now; _ISR_Disable( level ); is_empty_now = _Chain_Get_with_empty_check_unprotected( chain, node ); _ISR_Enable( level ); 400082fc: 7f ff e8 4f call 40002438 <== NOT EXECUTED 40008300: 01 00 00 00 nop <== NOT EXECUTED return is_empty_now; } 40008304: 81 c7 e0 08 ret <== NOT EXECUTED 40008308: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000cd18 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 4000cd18: 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; 4000cd1c: c0 26 20 04 clr [ %i0 + 4 ] next = starting_address; while ( count-- ) { 4000cd20: 80 a6 a0 00 cmp %i2, 0 4000cd24: 02 80 00 11 be 4000cd68 <_Chain_Initialize+0x50> <== NEVER TAKEN 4000cd28: 84 10 00 18 mov %i0, %g2 4000cd2c: b4 06 bf ff add %i2, -1, %i2 Chain_Node *next; count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; 4000cd30: 82 10 00 19 mov %i1, %g1 while ( count-- ) { 4000cd34: 10 80 00 05 b 4000cd48 <_Chain_Initialize+0x30> 4000cd38: 92 10 00 1a mov %i2, %o1 4000cd3c: 84 10 00 01 mov %g1, %g2 4000cd40: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 4000cd44: 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; 4000cd48: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 4000cd4c: c4 20 60 04 st %g2, [ %g1 + 4 ] count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; while ( count-- ) { 4000cd50: 80 a6 a0 00 cmp %i2, 0 4000cd54: 12 bf ff fa bne 4000cd3c <_Chain_Initialize+0x24> 4000cd58: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 4000cd5c: 40 00 16 82 call 40012764 <.umul> 4000cd60: 90 10 00 1b mov %i3, %o0 count = number_nodes; current = _Chain_Head( the_chain ); the_chain->permanent_null = NULL; next = starting_address; while ( count-- ) { 4000cd64: 84 06 40 08 add %i1, %o0, %g2 4000cd68: 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 ); 4000cd6c: c2 20 80 00 st %g1, [ %g2 ] the_chain->last = current; 4000cd70: c4 26 20 08 st %g2, [ %i0 + 8 ] } 4000cd74: 81 c7 e0 08 ret 4000cd78: 81 e8 00 00 restore =============================================================================== 40006c74 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 40006c74: 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 ]; 40006c78: e0 06 21 5c ld [ %i0 + 0x15c ], %l0 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 40006c7c: 7f ff ec 64 call 40001e0c 40006c80: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 40006c84: a2 10 00 08 mov %o0, %l1 pending_events = api->pending_events; 40006c88: c4 04 00 00 ld [ %l0 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 40006c8c: 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 ) ) { 40006c90: 86 88 40 02 andcc %g1, %g2, %g3 40006c94: 02 80 00 3e be 40006d8c <_Event_Surrender+0x118> 40006c98: 09 10 00 59 sethi %hi(0x40016400), %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() && 40006c9c: 88 11 20 3c or %g4, 0x3c, %g4 ! 4001643c <_Per_CPU_Information> 40006ca0: da 01 20 08 ld [ %g4 + 8 ], %o5 40006ca4: 80 a3 60 00 cmp %o5, 0 40006ca8: 32 80 00 1d bne,a 40006d1c <_Event_Surrender+0xa8> 40006cac: 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); 40006cb0: 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 ) ) { 40006cb4: 80 89 21 00 btst 0x100, %g4 40006cb8: 02 80 00 33 be 40006d84 <_Event_Surrender+0x110> 40006cbc: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 40006cc0: 02 80 00 04 be 40006cd0 <_Event_Surrender+0x5c> 40006cc4: 80 8c a0 02 btst 2, %l2 40006cc8: 02 80 00 2f be 40006d84 <_Event_Surrender+0x110> <== NEVER TAKEN 40006ccc: 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; 40006cd0: 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) ); 40006cd4: 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 ); 40006cd8: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 40006cdc: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40006ce0: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 40006ce4: 7f ff ec 4e call 40001e1c 40006ce8: 90 10 00 11 mov %l1, %o0 40006cec: 7f ff ec 48 call 40001e0c 40006cf0: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 40006cf4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 40006cf8: 80 a0 60 02 cmp %g1, 2 40006cfc: 02 80 00 26 be 40006d94 <_Event_Surrender+0x120> 40006d00: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 40006d04: 90 10 00 11 mov %l1, %o0 40006d08: 7f ff ec 45 call 40001e1c 40006d0c: 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 ); 40006d10: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 40006d14: 40 00 09 1b call 40009180 <_Thread_Clear_state> 40006d18: 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() && 40006d1c: 80 a6 00 04 cmp %i0, %g4 40006d20: 32 bf ff e5 bne,a 40006cb4 <_Event_Surrender+0x40> 40006d24: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 40006d28: 09 10 00 59 sethi %hi(0x40016400), %g4 40006d2c: da 01 20 58 ld [ %g4 + 0x58 ], %o5 ! 40016458 <_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 ) && 40006d30: 80 a3 60 02 cmp %o5, 2 40006d34: 02 80 00 07 be 40006d50 <_Event_Surrender+0xdc> <== NEVER TAKEN 40006d38: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 40006d3c: da 01 20 58 ld [ %g4 + 0x58 ], %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) || 40006d40: 80 a3 60 01 cmp %o5, 1 40006d44: 32 bf ff dc bne,a 40006cb4 <_Event_Surrender+0x40> 40006d48: 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) ) { 40006d4c: 80 a0 40 03 cmp %g1, %g3 40006d50: 02 80 00 04 be 40006d60 <_Event_Surrender+0xec> 40006d54: 80 8c a0 02 btst 2, %l2 40006d58: 02 80 00 09 be 40006d7c <_Event_Surrender+0x108> <== NEVER TAKEN 40006d5c: 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; 40006d60: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 40006d64: 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 ); 40006d68: c4 24 00 00 st %g2, [ %l0 ] the_thread->Wait.count = 0; 40006d6c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 40006d70: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 40006d74: 82 10 20 03 mov 3, %g1 40006d78: c2 21 20 58 st %g1, [ %g4 + 0x58 ] } _ISR_Enable( level ); 40006d7c: 7f ff ec 28 call 40001e1c 40006d80: 91 e8 00 11 restore %g0, %l1, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 40006d84: 7f ff ec 26 call 40001e1c 40006d88: 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 ); 40006d8c: 7f ff ec 24 call 40001e1c 40006d90: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 40006d94: 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 ); 40006d98: 7f ff ec 21 call 40001e1c 40006d9c: 90 10 00 11 mov %l1, %o0 (void) _Watchdog_Remove( &the_thread->Timer ); 40006da0: 40 00 0e cc call 4000a8d0 <_Watchdog_Remove> 40006da4: 90 06 20 48 add %i0, 0x48, %o0 40006da8: 33 04 00 ff sethi %hi(0x1003fc00), %i1 40006dac: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 40006db0: 40 00 08 f4 call 40009180 <_Thread_Clear_state> 40006db4: 81 e8 00 00 restore =============================================================================== 40006dbc <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 40006dbc: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 40006dc0: 90 10 00 18 mov %i0, %o0 40006dc4: 40 00 09 f1 call 40009588 <_Thread_Get> 40006dc8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40006dcc: c2 07 bf fc ld [ %fp + -4 ], %g1 40006dd0: 80 a0 60 00 cmp %g1, 0 40006dd4: 12 80 00 15 bne 40006e28 <_Event_Timeout+0x6c> <== NEVER TAKEN 40006dd8: 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 ); 40006ddc: 7f ff ec 0c call 40001e0c 40006de0: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 40006de4: 03 10 00 59 sethi %hi(0x40016400), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 40006de8: c2 00 60 48 ld [ %g1 + 0x48 ], %g1 ! 40016448 <_Per_CPU_Information+0xc> 40006dec: 80 a4 00 01 cmp %l0, %g1 40006df0: 02 80 00 10 be 40006e30 <_Event_Timeout+0x74> 40006df4: 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; 40006df8: 82 10 20 06 mov 6, %g1 40006dfc: c2 24 20 34 st %g1, [ %l0 + 0x34 ] _ISR_Enable( level ); 40006e00: 7f ff ec 07 call 40001e1c 40006e04: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 40006e08: 90 10 00 10 mov %l0, %o0 40006e0c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 40006e10: 40 00 08 dc call 40009180 <_Thread_Clear_state> 40006e14: 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; 40006e18: 03 10 00 58 sethi %hi(0x40016000), %g1 40006e1c: c4 00 61 d8 ld [ %g1 + 0x1d8 ], %g2 ! 400161d8 <_Thread_Dispatch_disable_level> 40006e20: 84 00 bf ff add %g2, -1, %g2 40006e24: c4 20 61 d8 st %g2, [ %g1 + 0x1d8 ] 40006e28: 81 c7 e0 08 ret 40006e2c: 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 ) 40006e30: 03 10 00 59 sethi %hi(0x40016400), %g1 40006e34: c4 00 60 58 ld [ %g1 + 0x58 ], %g2 ! 40016458 <_Event_Sync_state> 40006e38: 80 a0 a0 01 cmp %g2, 1 40006e3c: 32 bf ff f0 bne,a 40006dfc <_Event_Timeout+0x40> 40006e40: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 40006e44: 84 10 20 02 mov 2, %g2 40006e48: c4 20 60 58 st %g2, [ %g1 + 0x58 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 40006e4c: 10 bf ff ec b 40006dfc <_Event_Timeout+0x40> 40006e50: 82 10 20 06 mov 6, %g1 =============================================================================== 4000cf7c <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 4000cf7c: 9d e3 bf 98 save %sp, -104, %sp 4000cf80: a0 10 00 18 mov %i0, %l0 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 4000cf84: a4 06 60 04 add %i1, 4, %l2 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 4000cf88: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 4000cf8c: 80 a6 40 12 cmp %i1, %l2 4000cf90: 18 80 00 6e bgu 4000d148 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000cf94: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 4000cf98: 80 a6 e0 00 cmp %i3, 0 4000cf9c: 12 80 00 75 bne 4000d170 <_Heap_Allocate_aligned_with_boundary+0x1f4> 4000cfa0: 80 a6 40 1b cmp %i1, %i3 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 4000cfa4: e8 04 20 08 ld [ %l0 + 8 ], %l4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000cfa8: 80 a4 00 14 cmp %l0, %l4 4000cfac: 02 80 00 67 be 4000d148 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000cfb0: 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 4000cfb4: 82 07 60 07 add %i5, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 4000cfb8: b8 10 20 04 mov 4, %i4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000cfbc: a2 10 20 01 mov 1, %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 4000cfc0: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 4000cfc4: 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 ) { 4000cfc8: e6 05 20 04 ld [ %l4 + 4 ], %l3 4000cfcc: 80 a4 80 13 cmp %l2, %l3 4000cfd0: 3a 80 00 4b bcc,a 4000d0fc <_Heap_Allocate_aligned_with_boundary+0x180> 4000cfd4: e8 05 20 08 ld [ %l4 + 8 ], %l4 if ( alignment == 0 ) { 4000cfd8: 80 a6 a0 00 cmp %i2, 0 4000cfdc: 02 80 00 44 be 4000d0ec <_Heap_Allocate_aligned_with_boundary+0x170> 4000cfe0: 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; 4000cfe4: c4 07 bf fc ld [ %fp + -4 ], %g2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 4000cfe8: 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; 4000cfec: 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; 4000cff0: 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; 4000cff4: 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); 4000cff8: 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_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; 4000cffc: 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 4000d000: a6 00 40 13 add %g1, %l3, %l3 4000d004: 40 00 16 be call 40012afc <.urem> 4000d008: 90 10 00 18 mov %i0, %o0 4000d00c: 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 ) { 4000d010: 80 a4 c0 18 cmp %l3, %i0 4000d014: 1a 80 00 06 bcc 4000d02c <_Heap_Allocate_aligned_with_boundary+0xb0> 4000d018: ac 05 20 08 add %l4, 8, %l6 4000d01c: 90 10 00 13 mov %l3, %o0 4000d020: 40 00 16 b7 call 40012afc <.urem> 4000d024: 92 10 00 1a mov %i2, %o1 4000d028: b0 24 c0 08 sub %l3, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 4000d02c: 80 a6 e0 00 cmp %i3, 0 4000d030: 02 80 00 24 be 4000d0c0 <_Heap_Allocate_aligned_with_boundary+0x144> 4000d034: 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; 4000d038: a6 06 00 19 add %i0, %i1, %l3 4000d03c: 92 10 00 1b mov %i3, %o1 4000d040: 40 00 16 af call 40012afc <.urem> 4000d044: 90 10 00 13 mov %l3, %o0 4000d048: 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 ) { 4000d04c: 80 a2 00 13 cmp %o0, %l3 4000d050: 1a 80 00 1b bcc 4000d0bc <_Heap_Allocate_aligned_with_boundary+0x140> 4000d054: 80 a6 00 08 cmp %i0, %o0 4000d058: 1a 80 00 1a bcc 4000d0c0 <_Heap_Allocate_aligned_with_boundary+0x144> 4000d05c: 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; 4000d060: 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 ) { 4000d064: 80 a5 40 08 cmp %l5, %o0 4000d068: 28 80 00 09 bleu,a 4000d08c <_Heap_Allocate_aligned_with_boundary+0x110> 4000d06c: b0 22 00 19 sub %o0, %i1, %i0 if ( alloc_begin != 0 ) { break; } block = block->next; 4000d070: 10 80 00 23 b 4000d0fc <_Heap_Allocate_aligned_with_boundary+0x180> 4000d074: 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 ) { 4000d078: 1a 80 00 11 bcc 4000d0bc <_Heap_Allocate_aligned_with_boundary+0x140> 4000d07c: 80 a5 40 08 cmp %l5, %o0 if ( boundary_line < boundary_floor ) { 4000d080: 38 80 00 1f bgu,a 4000d0fc <_Heap_Allocate_aligned_with_boundary+0x180><== NEVER TAKEN 4000d084: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED return 0; } alloc_begin = boundary_line - alloc_size; 4000d088: b0 22 00 19 sub %o0, %i1, %i0 4000d08c: 92 10 00 1a mov %i2, %o1 4000d090: 40 00 16 9b call 40012afc <.urem> 4000d094: 90 10 00 18 mov %i0, %o0 4000d098: 92 10 00 1b mov %i3, %o1 4000d09c: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 4000d0a0: a6 06 00 19 add %i0, %i1, %l3 4000d0a4: 40 00 16 96 call 40012afc <.urem> 4000d0a8: 90 10 00 13 mov %l3, %o0 4000d0ac: 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 ) { 4000d0b0: 80 a2 00 13 cmp %o0, %l3 4000d0b4: 0a bf ff f1 bcs 4000d078 <_Heap_Allocate_aligned_with_boundary+0xfc> 4000d0b8: 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 ) { 4000d0bc: 80 a5 80 18 cmp %l6, %i0 4000d0c0: 38 80 00 0f bgu,a 4000d0fc <_Heap_Allocate_aligned_with_boundary+0x180> 4000d0c4: e8 05 20 08 ld [ %l4 + 8 ], %l4 4000d0c8: 82 10 3f f8 mov -8, %g1 4000d0cc: 90 10 00 18 mov %i0, %o0 4000d0d0: a6 20 40 14 sub %g1, %l4, %l3 4000d0d4: 92 10 00 1d mov %i5, %o1 4000d0d8: 40 00 16 89 call 40012afc <.urem> 4000d0dc: 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 ) { 4000d0e0: 90 a4 c0 08 subcc %l3, %o0, %o0 4000d0e4: 12 80 00 1b bne 4000d150 <_Heap_Allocate_aligned_with_boundary+0x1d4> 4000d0e8: 80 a2 00 17 cmp %o0, %l7 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 4000d0ec: 80 a6 20 00 cmp %i0, 0 4000d0f0: 32 80 00 08 bne,a 4000d110 <_Heap_Allocate_aligned_with_boundary+0x194><== ALWAYS TAKEN 4000d0f4: c4 04 20 48 ld [ %l0 + 0x48 ], %g2 break; } block = block->next; 4000d0f8: e8 05 20 08 ld [ %l4 + 8 ], %l4 <== NOT EXECUTED do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000d0fc: 80 a4 00 14 cmp %l0, %l4 4000d100: 02 80 00 1a be 4000d168 <_Heap_Allocate_aligned_with_boundary+0x1ec> 4000d104: 82 04 60 01 add %l1, 1, %g1 4000d108: 10 bf ff b0 b 4000cfc8 <_Heap_Allocate_aligned_with_boundary+0x4c> 4000d10c: a2 10 00 01 mov %g1, %l1 } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; stats->searches += search_count; 4000d110: c2 04 20 4c ld [ %l0 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 4000d114: 84 00 a0 01 inc %g2 stats->searches += search_count; 4000d118: 82 00 40 11 add %g1, %l1, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 4000d11c: c4 24 20 48 st %g2, [ %l0 + 0x48 ] stats->searches += search_count; 4000d120: c2 24 20 4c st %g1, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 4000d124: 90 10 00 10 mov %l0, %o0 4000d128: 92 10 00 14 mov %l4, %o1 4000d12c: 94 10 00 18 mov %i0, %o2 4000d130: 7f ff ec c1 call 40008434 <_Heap_Block_allocate> 4000d134: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 4000d138: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 4000d13c: 80 a0 40 11 cmp %g1, %l1 4000d140: 2a 80 00 02 bcs,a 4000d148 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000d144: e2 24 20 44 st %l1, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 4000d148: 81 c7 e0 08 ret 4000d14c: 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 ) { 4000d150: 1a bf ff e8 bcc 4000d0f0 <_Heap_Allocate_aligned_with_boundary+0x174> 4000d154: 80 a6 20 00 cmp %i0, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 4000d158: e8 05 20 08 ld [ %l4 + 8 ], %l4 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 4000d15c: 80 a4 00 14 cmp %l0, %l4 4000d160: 12 bf ff ea bne 4000d108 <_Heap_Allocate_aligned_with_boundary+0x18c> 4000d164: 82 04 60 01 add %l1, 1, %g1 4000d168: 10 bf ff f4 b 4000d138 <_Heap_Allocate_aligned_with_boundary+0x1bc> 4000d16c: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 4000d170: 18 bf ff f6 bgu 4000d148 <_Heap_Allocate_aligned_with_boundary+0x1cc> 4000d174: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 4000d178: 22 bf ff 8b be,a 4000cfa4 <_Heap_Allocate_aligned_with_boundary+0x28> 4000d17c: b4 10 00 1d mov %i5, %i2 if ( stats->max_search < search_count ) { stats->max_search = search_count; } return (void *) alloc_begin; } 4000d180: 10 bf ff 8a b 4000cfa8 <_Heap_Allocate_aligned_with_boundary+0x2c> 4000d184: e8 04 20 08 ld [ %l0 + 8 ], %l4 =============================================================================== 4000d490 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 4000d490: 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; 4000d494: c0 27 bf fc clr [ %fp + -4 ] Heap_Block *extend_last_block = NULL; 4000d498: 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 ) { 4000d49c: 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; 4000d4a0: 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; 4000d4a4: 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; 4000d4a8: e6 06 20 10 ld [ %i0 + 0x10 ], %l3 uintptr_t const min_block_size = heap->min_block_size; 4000d4ac: 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; 4000d4b0: 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 ) { 4000d4b4: 80 a6 40 11 cmp %i1, %l1 4000d4b8: 18 80 00 86 bgu 4000d6d0 <_Heap_Extend+0x240> 4000d4bc: b0 10 20 00 clr %i0 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 4000d4c0: 90 10 00 19 mov %i1, %o0 4000d4c4: 92 10 00 1a mov %i2, %o1 4000d4c8: 94 10 00 13 mov %l3, %o2 4000d4cc: 98 07 bf fc add %fp, -4, %o4 4000d4d0: 7f ff ec 3a call 400085b8 <_Heap_Get_first_and_last_block> 4000d4d4: 9a 07 bf f8 add %fp, -8, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 4000d4d8: 80 8a 20 ff btst 0xff, %o0 4000d4dc: 02 80 00 7d be 4000d6d0 <_Heap_Extend+0x240> 4000d4e0: ba 10 20 00 clr %i5 4000d4e4: b0 10 00 12 mov %l2, %i0 4000d4e8: b8 10 20 00 clr %i4 4000d4ec: ac 10 20 00 clr %l6 4000d4f0: 10 80 00 14 b 4000d540 <_Heap_Extend+0xb0> 4000d4f4: 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 ) { 4000d4f8: 2a 80 00 02 bcs,a 4000d500 <_Heap_Extend+0x70> 4000d4fc: b8 10 00 18 mov %i0, %i4 4000d500: 90 10 00 15 mov %l5, %o0 4000d504: 40 00 16 d1 call 40013048 <.urem> 4000d508: 92 10 00 13 mov %l3, %o1 4000d50c: 82 05 7f f8 add %l5, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 4000d510: 80 a5 40 19 cmp %l5, %i1 4000d514: 02 80 00 1c be 4000d584 <_Heap_Extend+0xf4> 4000d518: 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 ) { 4000d51c: 80 a6 40 15 cmp %i1, %l5 4000d520: 38 80 00 02 bgu,a 4000d528 <_Heap_Extend+0x98> 4000d524: 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; 4000d528: f0 00 60 04 ld [ %g1 + 4 ], %i0 4000d52c: 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); 4000d530: 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 ); 4000d534: 80 a4 80 18 cmp %l2, %i0 4000d538: 22 80 00 1b be,a 4000d5a4 <_Heap_Extend+0x114> 4000d53c: 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; 4000d540: 80 a6 00 12 cmp %i0, %l2 4000d544: 02 80 00 65 be 4000d6d8 <_Heap_Extend+0x248> 4000d548: 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 ( 4000d54c: 80 a0 40 11 cmp %g1, %l1 4000d550: 0a 80 00 6f bcs 4000d70c <_Heap_Extend+0x27c> 4000d554: 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 ) { 4000d558: 80 a0 40 11 cmp %g1, %l1 4000d55c: 12 bf ff e7 bne 4000d4f8 <_Heap_Extend+0x68> 4000d560: 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); 4000d564: 90 10 00 15 mov %l5, %o0 4000d568: 40 00 16 b8 call 40013048 <.urem> 4000d56c: 92 10 00 13 mov %l3, %o1 4000d570: 82 05 7f f8 add %l5, -8, %g1 4000d574: 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 ) { 4000d578: 80 a5 40 19 cmp %l5, %i1 4000d57c: 12 bf ff e8 bne 4000d51c <_Heap_Extend+0x8c> <== ALWAYS TAKEN 4000d580: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 4000d584: 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; 4000d588: f0 00 60 04 ld [ %g1 + 4 ], %i0 4000d58c: 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); 4000d590: 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 ); 4000d594: 80 a4 80 18 cmp %l2, %i0 4000d598: 12 bf ff ea bne 4000d540 <_Heap_Extend+0xb0> <== NEVER TAKEN 4000d59c: ac 10 00 01 mov %g1, %l6 if ( extend_area_begin < heap->area_begin ) { 4000d5a0: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 4000d5a4: 80 a6 40 01 cmp %i1, %g1 4000d5a8: 3a 80 00 54 bcc,a 4000d6f8 <_Heap_Extend+0x268> 4000d5ac: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 4000d5b0: 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; 4000d5b4: c2 07 bf fc ld [ %fp + -4 ], %g1 4000d5b8: c4 07 bf f8 ld [ %fp + -8 ], %g2 extend_last_block->prev_size = extend_first_block_size; extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 4000d5bc: 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 = 4000d5c0: 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; 4000d5c4: e2 20 40 00 st %l1, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 4000d5c8: 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 = 4000d5cc: da 20 60 04 st %o5, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 4000d5d0: c6 20 80 00 st %g3, [ %g2 ] extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { 4000d5d4: 80 a1 00 01 cmp %g4, %g1 4000d5d8: 08 80 00 42 bleu 4000d6e0 <_Heap_Extend+0x250> 4000d5dc: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 4000d5e0: 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 ) { 4000d5e4: 80 a5 e0 00 cmp %l7, 0 4000d5e8: 02 80 00 62 be 4000d770 <_Heap_Extend+0x2e0> 4000d5ec: 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; 4000d5f0: 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; 4000d5f4: 92 10 00 12 mov %l2, %o1 4000d5f8: 40 00 16 94 call 40013048 <.urem> 4000d5fc: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 4000d600: 80 a2 20 00 cmp %o0, 0 4000d604: 02 80 00 04 be 4000d614 <_Heap_Extend+0x184> <== ALWAYS TAKEN 4000d608: c4 05 c0 00 ld [ %l7 ], %g2 return value - remainder + alignment; 4000d60c: b2 06 40 12 add %i1, %l2, %i1 <== NOT EXECUTED 4000d610: 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 = 4000d614: 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; 4000d618: 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 = 4000d61c: 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; 4000d620: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 4000d624: 90 10 00 10 mov %l0, %o0 4000d628: 92 10 00 01 mov %g1, %o1 4000d62c: 7f ff ff 8e call 4000d464 <_Heap_Free_block> 4000d630: c4 20 60 04 st %g2, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 4000d634: 80 a5 a0 00 cmp %l6, 0 4000d638: 02 80 00 3a be 4000d720 <_Heap_Extend+0x290> 4000d63c: 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); 4000d640: 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( 4000d644: a2 24 40 16 sub %l1, %l6, %l1 4000d648: 40 00 16 80 call 40013048 <.urem> 4000d64c: 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) 4000d650: c2 05 a0 04 ld [ %l6 + 4 ], %g1 4000d654: a2 24 40 08 sub %l1, %o0, %l1 4000d658: 82 20 40 11 sub %g1, %l1, %g1 | HEAP_PREV_BLOCK_USED; 4000d65c: 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 = 4000d660: 84 04 40 16 add %l1, %l6, %g2 4000d664: 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; 4000d668: 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 ); 4000d66c: 90 10 00 10 mov %l0, %o0 4000d670: 82 08 60 01 and %g1, 1, %g1 4000d674: 92 10 00 16 mov %l6, %o1 block->size_and_flag = size | flag; 4000d678: a2 14 40 01 or %l1, %g1, %l1 4000d67c: 7f ff ff 7a call 4000d464 <_Heap_Free_block> 4000d680: e2 25 a0 04 st %l1, [ %l6 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000d684: 80 a5 a0 00 cmp %l6, 0 4000d688: 02 80 00 33 be 4000d754 <_Heap_Extend+0x2c4> 4000d68c: 80 a5 e0 00 cmp %l7, 0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000d690: 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( 4000d694: 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; 4000d698: 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; 4000d69c: 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; 4000d6a0: 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( 4000d6a4: 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; 4000d6a8: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 4000d6ac: 88 13 40 04 or %o5, %g4, %g4 4000d6b0: c8 20 60 04 st %g4, [ %g1 + 4 ] 4000d6b4: a8 20 c0 14 sub %g3, %l4, %l4 /* Statistics */ stats->size += extended_size; 4000d6b8: 82 00 80 14 add %g2, %l4, %g1 4000d6bc: c2 24 20 2c st %g1, [ %l0 + 0x2c ] if ( extended_size_ptr != NULL ) 4000d6c0: 80 a6 e0 00 cmp %i3, 0 4000d6c4: 02 80 00 03 be 4000d6d0 <_Heap_Extend+0x240> <== NEVER TAKEN 4000d6c8: b0 10 20 01 mov 1, %i0 *extended_size_ptr = extended_size; 4000d6cc: e8 26 c0 00 st %l4, [ %i3 ] 4000d6d0: 81 c7 e0 08 ret 4000d6d4: 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; 4000d6d8: 10 bf ff 9d b 4000d54c <_Heap_Extend+0xbc> 4000d6dc: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); 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 ) { 4000d6e0: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 4000d6e4: 80 a0 40 02 cmp %g1, %g2 4000d6e8: 2a bf ff bf bcs,a 4000d5e4 <_Heap_Extend+0x154> 4000d6ec: c4 24 20 24 st %g2, [ %l0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 4000d6f0: 10 bf ff be b 4000d5e8 <_Heap_Extend+0x158> 4000d6f4: 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 ) { 4000d6f8: 80 a4 40 01 cmp %l1, %g1 4000d6fc: 38 bf ff ae bgu,a 4000d5b4 <_Heap_Extend+0x124> 4000d700: 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; 4000d704: 10 bf ff ad b 4000d5b8 <_Heap_Extend+0x128> 4000d708: 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 ( 4000d70c: 80 a6 40 15 cmp %i1, %l5 4000d710: 1a bf ff 93 bcc 4000d55c <_Heap_Extend+0xcc> 4000d714: 80 a0 40 11 cmp %g1, %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000d718: 81 c7 e0 08 ret 4000d71c: 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 ) { 4000d720: 80 a7 60 00 cmp %i5, 0 4000d724: 02 bf ff d8 be 4000d684 <_Heap_Extend+0x1f4> 4000d728: 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; 4000d72c: c6 07 60 04 ld [ %i5 + 4 ], %g3 _Heap_Link_above( 4000d730: c2 07 bf f8 ld [ %fp + -8 ], %g1 4000d734: 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 ); 4000d738: 84 20 80 1d sub %g2, %i5, %g2 block->size_and_flag = size | flag; 4000d73c: 84 10 80 03 or %g2, %g3, %g2 4000d740: c4 27 60 04 st %g2, [ %i5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 4000d744: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000d748: 84 10 a0 01 or %g2, 1, %g2 4000d74c: 10 bf ff ce b 4000d684 <_Heap_Extend+0x1f4> 4000d750: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 4000d754: 32 bf ff d0 bne,a 4000d694 <_Heap_Extend+0x204> 4000d758: c2 04 20 24 ld [ %l0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 4000d75c: d2 07 bf fc ld [ %fp + -4 ], %o1 4000d760: 7f ff ff 41 call 4000d464 <_Heap_Free_block> 4000d764: 90 10 00 10 mov %l0, %o0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 4000d768: 10 bf ff cb b 4000d694 <_Heap_Extend+0x204> 4000d76c: 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 ) { 4000d770: 80 a7 20 00 cmp %i4, 0 4000d774: 02 bf ff b1 be 4000d638 <_Heap_Extend+0x1a8> 4000d778: 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; 4000d77c: b8 27 00 02 sub %i4, %g2, %i4 4000d780: 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 = 4000d784: 10 bf ff ad b 4000d638 <_Heap_Extend+0x1a8> 4000d788: f8 20 a0 04 st %i4, [ %g2 + 4 ] =============================================================================== 4000d188 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 4000d188: 9d e3 bf a0 save %sp, -96, %sp 4000d18c: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 4000d190: 40 00 16 5b call 40012afc <.urem> 4000d194: 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 4000d198: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 4000d19c: 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); 4000d1a0: 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); 4000d1a4: 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; 4000d1a8: 80 a2 00 01 cmp %o0, %g1 4000d1ac: 0a 80 00 4d bcs 4000d2e0 <_Heap_Free+0x158> 4000d1b0: b0 10 20 00 clr %i0 4000d1b4: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 4000d1b8: 80 a2 00 03 cmp %o0, %g3 4000d1bc: 18 80 00 49 bgu 4000d2e0 <_Heap_Free+0x158> 4000d1c0: 01 00 00 00 nop --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000d1c4: 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; 4000d1c8: 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); 4000d1cc: 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; 4000d1d0: 80 a0 40 02 cmp %g1, %g2 4000d1d4: 18 80 00 43 bgu 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d1d8: 80 a0 c0 02 cmp %g3, %g2 4000d1dc: 0a 80 00 41 bcs 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d1e0: 01 00 00 00 nop 4000d1e4: 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 ) ) { 4000d1e8: 80 8b 20 01 btst 1, %o4 4000d1ec: 02 80 00 3d be 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d1f0: 96 0b 3f fe and %o4, -2, %o3 return true; } 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 )); 4000d1f4: 80 a0 c0 02 cmp %g3, %g2 4000d1f8: 02 80 00 06 be 4000d210 <_Heap_Free+0x88> 4000d1fc: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000d200: 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; 4000d204: d8 03 20 04 ld [ %o4 + 4 ], %o4 4000d208: 98 0b 20 01 and %o4, 1, %o4 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 4000d20c: 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 ) ) { 4000d210: 80 8b 60 01 btst 1, %o5 4000d214: 12 80 00 1d bne 4000d288 <_Heap_Free+0x100> 4000d218: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 4000d21c: 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); 4000d220: 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; 4000d224: 80 a0 40 0d cmp %g1, %o5 4000d228: 18 80 00 2e bgu 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d22c: b0 10 20 00 clr %i0 4000d230: 80 a0 c0 0d cmp %g3, %o5 4000d234: 0a 80 00 2b bcs 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d238: 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; 4000d23c: 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) ) { 4000d240: 80 88 60 01 btst 1, %g1 4000d244: 02 80 00 27 be 4000d2e0 <_Heap_Free+0x158> <== NEVER TAKEN 4000d248: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 4000d24c: 22 80 00 39 be,a 4000d330 <_Heap_Free+0x1a8> 4000d250: 94 01 00 0a add %g4, %o2, %o2 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000d254: c2 00 a0 08 ld [ %g2 + 8 ], %g1 4000d258: 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; 4000d25c: 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; 4000d260: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 4000d264: c4 20 60 0c st %g2, [ %g1 + 0xc ] 4000d268: 82 00 ff ff add %g3, -1, %g1 4000d26c: 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; 4000d270: 96 01 00 0b add %g4, %o3, %o3 4000d274: 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; 4000d278: 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; 4000d27c: 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; 4000d280: 10 80 00 0e b 4000d2b8 <_Heap_Free+0x130> 4000d284: 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 */ 4000d288: 22 80 00 18 be,a 4000d2e8 <_Heap_Free+0x160> 4000d28c: c6 04 20 08 ld [ %l0 + 8 ], %g3 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 4000d290: c6 00 a0 08 ld [ %g2 + 8 ], %g3 4000d294: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 ) { Heap_Block *next = old_block->next; Heap_Block *prev = old_block->prev; new_block->next = next; 4000d298: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = prev; 4000d29c: 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; 4000d2a0: 96 02 c0 04 add %o3, %g4, %o3 next->prev = new_block; 4000d2a4: d0 20 e0 0c st %o0, [ %g3 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 4000d2a8: 84 12 e0 01 or %o3, 1, %g2 prev->next = new_block; 4000d2ac: d0 20 60 08 st %o0, [ %g1 + 8 ] 4000d2b0: c4 22 20 04 st %g2, [ %o0 + 4 ] next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 4000d2b4: d6 22 00 0b st %o3, [ %o0 + %o3 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000d2b8: c4 04 20 40 ld [ %l0 + 0x40 ], %g2 ++stats->frees; 4000d2bc: c2 04 20 50 ld [ %l0 + 0x50 ], %g1 stats->free_size += block_size; 4000d2c0: c6 04 20 30 ld [ %l0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000d2c4: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 4000d2c8: 82 00 60 01 inc %g1 stats->free_size += block_size; 4000d2cc: 88 00 c0 04 add %g3, %g4, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 4000d2d0: c4 24 20 40 st %g2, [ %l0 + 0x40 ] ++stats->frees; 4000d2d4: c2 24 20 50 st %g1, [ %l0 + 0x50 ] stats->free_size += block_size; 4000d2d8: c8 24 20 30 st %g4, [ %l0 + 0x30 ] return( true ); 4000d2dc: b0 10 20 01 mov 1, %i0 } 4000d2e0: 81 c7 e0 08 ret 4000d2e4: 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; 4000d2e8: 82 11 20 01 or %g4, 1, %g1 4000d2ec: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000d2f0: da 00 a0 04 ld [ %g2 + 4 ], %o5 next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 4000d2f4: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 4000d2f8: e0 22 20 0c st %l0, [ %o0 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 4000d2fc: c6 22 20 08 st %g3, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 4000d300: 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; 4000d304: 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; 4000d308: 86 0b 7f fe and %o5, -2, %g3 4000d30c: 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 ) { 4000d310: 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; 4000d314: 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; 4000d318: d0 24 20 08 st %o0, [ %l0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 4000d31c: 80 a0 40 02 cmp %g1, %g2 4000d320: 08 bf ff e6 bleu 4000d2b8 <_Heap_Free+0x130> 4000d324: c2 24 20 38 st %g1, [ %l0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 4000d328: 10 bf ff e4 b 4000d2b8 <_Heap_Free+0x130> 4000d32c: 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; 4000d330: 82 12 a0 01 or %o2, 1, %g1 4000d334: c2 23 60 04 st %g1, [ %o5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 4000d338: c2 00 a0 04 ld [ %g2 + 4 ], %g1 next_block->prev_size = size; 4000d33c: 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; 4000d340: 82 08 7f fe and %g1, -2, %g1 4000d344: 10 bf ff dd b 4000d2b8 <_Heap_Free+0x130> 4000d348: c2 20 a0 04 st %g1, [ %g2 + 4 ] =============================================================================== 4000deac <_Heap_Get_information>: void _Heap_Get_information( Heap_Control *the_heap, Heap_Information_block *the_info ) { 4000deac: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *the_block = the_heap->first_block; 4000deb0: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *const end = the_heap->last_block; 4000deb4: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 memset(the_info, 0, sizeof(*the_info)); 4000deb8: c0 26 40 00 clr [ %i1 ] 4000debc: c0 26 60 04 clr [ %i1 + 4 ] 4000dec0: c0 26 60 08 clr [ %i1 + 8 ] 4000dec4: c0 26 60 0c clr [ %i1 + 0xc ] 4000dec8: c0 26 60 10 clr [ %i1 + 0x10 ] while ( the_block != end ) { 4000decc: 80 a0 40 02 cmp %g1, %g2 4000ded0: 02 80 00 17 be 4000df2c <_Heap_Get_information+0x80> <== NEVER TAKEN 4000ded4: c0 26 60 14 clr [ %i1 + 0x14 ] 4000ded8: da 00 60 04 ld [ %g1 + 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; 4000dedc: 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); 4000dee0: 82 00 40 04 add %g1, %g4, %g1 if ( info->largest < the_size ) info->largest = the_size; the_block = next_block; } } 4000dee4: 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) ) 4000dee8: 80 8b 60 01 btst 1, %o5 4000deec: 02 80 00 03 be 4000def8 <_Heap_Get_information+0x4c> 4000def0: 86 10 00 19 mov %i1, %g3 info = &the_info->Used; 4000def4: 86 06 60 0c add %i1, 0xc, %g3 else info = &the_info->Free; info->number++; 4000def8: d4 00 c0 00 ld [ %g3 ], %o2 info->total += the_size; 4000defc: d6 00 e0 08 ld [ %g3 + 8 ], %o3 if ( info->largest < the_size ) 4000df00: 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++; 4000df04: 94 02 a0 01 inc %o2 info->total += the_size; 4000df08: 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++; 4000df0c: d4 20 c0 00 st %o2, [ %g3 ] info->total += the_size; if ( info->largest < the_size ) 4000df10: 80 a3 00 04 cmp %o4, %g4 4000df14: 1a 80 00 03 bcc 4000df20 <_Heap_Get_information+0x74> 4000df18: d6 20 e0 08 st %o3, [ %g3 + 8 ] info->largest = the_size; 4000df1c: 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 ) { 4000df20: 80 a0 80 01 cmp %g2, %g1 4000df24: 12 bf ff ef bne 4000dee0 <_Heap_Get_information+0x34> 4000df28: 88 0b 7f fe and %o5, -2, %g4 4000df2c: 81 c7 e0 08 ret 4000df30: 81 e8 00 00 restore =============================================================================== 400144dc <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 400144dc: 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); 400144e0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 400144e4: 7f ff f9 86 call 40012afc <.urem> 400144e8: 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 400144ec: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 400144f0: 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); 400144f4: 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); 400144f8: 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; 400144fc: 80 a0 80 01 cmp %g2, %g1 40014500: 0a 80 00 15 bcs 40014554 <_Heap_Size_of_alloc_area+0x78> 40014504: b0 10 20 00 clr %i0 40014508: c6 04 20 24 ld [ %l0 + 0x24 ], %g3 4001450c: 80 a0 80 03 cmp %g2, %g3 40014510: 18 80 00 11 bgu 40014554 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 40014514: 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; 40014518: c8 00 a0 04 ld [ %g2 + 4 ], %g4 4001451c: 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); 40014520: 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; 40014524: 80 a0 40 02 cmp %g1, %g2 40014528: 18 80 00 0b bgu 40014554 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 4001452c: 80 a0 c0 02 cmp %g3, %g2 40014530: 0a 80 00 09 bcs 40014554 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 40014534: 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; 40014538: 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 ) 4001453c: 80 88 60 01 btst 1, %g1 40014540: 02 80 00 05 be 40014554 <_Heap_Size_of_alloc_area+0x78> <== NEVER TAKEN 40014544: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 40014548: b0 10 20 01 mov 1, %i0 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 4001454c: 84 00 a0 04 add %g2, 4, %g2 40014550: c4 26 80 00 st %g2, [ %i2 ] return true; } 40014554: 81 c7 e0 08 ret 40014558: 81 e8 00 00 restore =============================================================================== 400093f8 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 400093f8: 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; 400093fc: 23 10 00 24 sethi %hi(0x40009000), %l1 bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 40009400: a0 10 00 18 mov %i0, %l0 uintptr_t const page_size = heap->page_size; 40009404: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 uintptr_t const min_block_size = heap->min_block_size; 40009408: e6 06 20 14 ld [ %i0 + 0x14 ], %l3 Heap_Block *const first_block = heap->first_block; 4000940c: e4 06 20 20 ld [ %i0 + 0x20 ], %l2 Heap_Block *const last_block = heap->last_block; 40009410: 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; 40009414: 80 8e a0 ff btst 0xff, %i2 40009418: 02 80 00 04 be 40009428 <_Heap_Walk+0x30> 4000941c: a2 14 63 8c or %l1, 0x38c, %l1 40009420: 23 10 00 24 sethi %hi(0x40009000), %l1 40009424: a2 14 63 94 or %l1, 0x394, %l1 ! 40009394 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 40009428: 03 10 00 62 sethi %hi(0x40018800), %g1 4000942c: c2 00 63 2c ld [ %g1 + 0x32c ], %g1 ! 40018b2c <_System_state_Current> 40009430: 80 a0 60 03 cmp %g1, 3 40009434: 12 80 00 33 bne 40009500 <_Heap_Walk+0x108> 40009438: 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)( 4000943c: da 04 20 18 ld [ %l0 + 0x18 ], %o5 40009440: c6 04 20 1c ld [ %l0 + 0x1c ], %g3 40009444: c4 04 20 08 ld [ %l0 + 8 ], %g2 40009448: c2 04 20 0c ld [ %l0 + 0xc ], %g1 4000944c: 90 10 00 19 mov %i1, %o0 40009450: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 40009454: e4 23 a0 60 st %l2, [ %sp + 0x60 ] 40009458: ea 23 a0 64 st %l5, [ %sp + 0x64 ] 4000945c: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 40009460: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 40009464: 92 10 20 00 clr %o1 40009468: 96 10 00 14 mov %l4, %o3 4000946c: 15 10 00 58 sethi %hi(0x40016000), %o2 40009470: 98 10 00 13 mov %l3, %o4 40009474: 9f c4 40 00 call %l1 40009478: 94 12 a2 d0 or %o2, 0x2d0, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 4000947c: 80 a5 20 00 cmp %l4, 0 40009480: 02 80 00 2a be 40009528 <_Heap_Walk+0x130> 40009484: 80 8d 20 07 btst 7, %l4 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 40009488: 12 80 00 30 bne 40009548 <_Heap_Walk+0x150> 4000948c: 90 10 00 13 mov %l3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 40009490: 7f ff e1 88 call 40001ab0 <.urem> 40009494: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 40009498: 80 a2 20 00 cmp %o0, 0 4000949c: 12 80 00 34 bne 4000956c <_Heap_Walk+0x174> 400094a0: 90 04 a0 08 add %l2, 8, %o0 400094a4: 7f ff e1 83 call 40001ab0 <.urem> 400094a8: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 400094ac: 80 a2 20 00 cmp %o0, 0 400094b0: 32 80 00 38 bne,a 40009590 <_Heap_Walk+0x198> 400094b4: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 400094b8: f8 04 a0 04 ld [ %l2 + 4 ], %i4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 400094bc: 80 8f 20 01 btst 1, %i4 400094c0: 22 80 00 4d be,a 400095f4 <_Heap_Walk+0x1fc> 400094c4: 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; 400094c8: c2 05 60 04 ld [ %l5 + 4 ], %g1 400094cc: 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); 400094d0: 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; 400094d4: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 400094d8: 80 88 a0 01 btst 1, %g2 400094dc: 02 80 00 0b be 40009508 <_Heap_Walk+0x110> 400094e0: 80 a4 80 01 cmp %l2, %g1 ); return false; } if ( 400094e4: 02 80 00 33 be 400095b0 <_Heap_Walk+0x1b8> <== ALWAYS TAKEN 400094e8: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 400094ec: 92 10 20 01 mov 1, %o1 <== NOT EXECUTED 400094f0: 15 10 00 59 sethi %hi(0x40016400), %o2 <== NOT EXECUTED if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400094f4: b0 10 20 00 clr %i0 <== NOT EXECUTED } if ( _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 400094f8: 9f c4 40 00 call %l1 <== NOT EXECUTED 400094fc: 94 12 a0 48 or %o2, 0x48, %o2 <== NOT EXECUTED 40009500: 81 c7 e0 08 ret 40009504: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 40009508: 90 10 00 19 mov %i1, %o0 4000950c: 92 10 20 01 mov 1, %o1 40009510: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40009514: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 40009518: 9f c4 40 00 call %l1 4000951c: 94 12 a0 30 or %o2, 0x30, %o2 40009520: 81 c7 e0 08 ret 40009524: 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" ); 40009528: 90 10 00 19 mov %i1, %o0 4000952c: 92 10 20 01 mov 1, %o1 40009530: 15 10 00 58 sethi %hi(0x40016000), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40009534: 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" ); 40009538: 9f c4 40 00 call %l1 4000953c: 94 12 a3 68 or %o2, 0x368, %o2 40009540: 81 c7 e0 08 ret 40009544: 81 e8 00 00 restore return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 40009548: 90 10 00 19 mov %i1, %o0 4000954c: 92 10 20 01 mov 1, %o1 40009550: 96 10 00 14 mov %l4, %o3 40009554: 15 10 00 58 sethi %hi(0x40016000), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 40009558: b0 10 20 00 clr %i0 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 4000955c: 9f c4 40 00 call %l1 40009560: 94 12 a3 80 or %o2, 0x380, %o2 40009564: 81 c7 e0 08 ret 40009568: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 4000956c: 90 10 00 19 mov %i1, %o0 40009570: 92 10 20 01 mov 1, %o1 40009574: 96 10 00 13 mov %l3, %o3 40009578: 15 10 00 58 sethi %hi(0x40016000), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000957c: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 40009580: 9f c4 40 00 call %l1 40009584: 94 12 a3 a0 or %o2, 0x3a0, %o2 40009588: 81 c7 e0 08 ret 4000958c: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 40009590: 92 10 20 01 mov 1, %o1 40009594: 96 10 00 12 mov %l2, %o3 40009598: 15 10 00 58 sethi %hi(0x40016000), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000959c: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 400095a0: 9f c4 40 00 call %l1 400095a4: 94 12 a3 c8 or %o2, 0x3c8, %o2 400095a8: 81 c7 e0 08 ret 400095ac: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 400095b0: 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 ) { 400095b4: 80 a4 00 16 cmp %l0, %l6 400095b8: 02 80 01 18 be 40009a18 <_Heap_Walk+0x620> 400095bc: f6 04 20 10 ld [ %l0 + 0x10 ], %i3 block = next_block; } while ( block != first_block ); return true; } 400095c0: 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; 400095c4: 80 a0 40 16 cmp %g1, %l6 400095c8: 28 80 00 12 bleu,a 40009610 <_Heap_Walk+0x218> <== ALWAYS TAKEN 400095cc: 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)( 400095d0: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 400095d4: 92 10 20 01 mov 1, %o1 400095d8: 96 10 00 16 mov %l6, %o3 400095dc: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400095e0: 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)( 400095e4: 9f c4 40 00 call %l1 400095e8: 94 12 a0 78 or %o2, 0x78, %o2 400095ec: 81 c7 e0 08 ret 400095f0: 81 e8 00 00 restore return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 400095f4: 92 10 20 01 mov 1, %o1 400095f8: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400095fc: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 40009600: 9f c4 40 00 call %l1 40009604: 94 12 a0 00 mov %o2, %o2 40009608: 81 c7 e0 08 ret 4000960c: 81 e8 00 00 restore 40009610: 80 a7 40 16 cmp %i5, %l6 40009614: 0a bf ff f0 bcs 400095d4 <_Heap_Walk+0x1dc> <== NEVER TAKEN 40009618: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 4000961c: c2 27 bf fc st %g1, [ %fp + -4 ] 40009620: 90 05 a0 08 add %l6, 8, %o0 40009624: 7f ff e1 23 call 40001ab0 <.urem> 40009628: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 4000962c: 80 a2 20 00 cmp %o0, 0 40009630: 12 80 00 2e bne 400096e8 <_Heap_Walk+0x2f0> <== NEVER TAKEN 40009634: 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; 40009638: c4 05 a0 04 ld [ %l6 + 4 ], %g2 4000963c: 84 08 bf fe and %g2, -2, %g2 block = next_block; } while ( block != first_block ); return true; } 40009640: 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; 40009644: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 40009648: 80 88 a0 01 btst 1, %g2 4000964c: 12 80 00 30 bne 4000970c <_Heap_Walk+0x314> <== NEVER TAKEN 40009650: 84 10 00 10 mov %l0, %g2 40009654: ae 10 00 16 mov %l6, %l7 40009658: 10 80 00 17 b 400096b4 <_Heap_Walk+0x2bc> 4000965c: 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 ) { 40009660: 80 a4 00 16 cmp %l0, %l6 40009664: 02 80 00 33 be 40009730 <_Heap_Walk+0x338> 40009668: 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; 4000966c: 18 bf ff da bgu 400095d4 <_Heap_Walk+0x1dc> 40009670: 90 10 00 19 mov %i1, %o0 40009674: 80 a5 80 1d cmp %l6, %i5 40009678: 18 bf ff d8 bgu 400095d8 <_Heap_Walk+0x1e0> <== NEVER TAKEN 4000967c: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 40009680: 90 05 a0 08 add %l6, 8, %o0 40009684: 7f ff e1 0b call 40001ab0 <.urem> 40009688: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 4000968c: 80 a2 20 00 cmp %o0, 0 40009690: 12 80 00 16 bne 400096e8 <_Heap_Walk+0x2f0> 40009694: 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; 40009698: c2 05 a0 04 ld [ %l6 + 4 ], %g1 4000969c: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 400096a0: 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; 400096a4: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 400096a8: 80 88 60 01 btst 1, %g1 400096ac: 12 80 00 18 bne 4000970c <_Heap_Walk+0x314> 400096b0: ae 10 00 16 mov %l6, %l7 ); return false; } if ( free_block->prev != prev_block ) { 400096b4: d8 05 a0 0c ld [ %l6 + 0xc ], %o4 400096b8: 80 a3 00 02 cmp %o4, %g2 400096bc: 22 bf ff e9 be,a 40009660 <_Heap_Walk+0x268> 400096c0: ec 05 a0 08 ld [ %l6 + 8 ], %l6 (*printer)( 400096c4: 90 10 00 19 mov %i1, %o0 400096c8: 92 10 20 01 mov 1, %o1 400096cc: 96 10 00 16 mov %l6, %o3 400096d0: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400096d4: b0 10 20 00 clr %i0 return false; } if ( free_block->prev != prev_block ) { (*printer)( 400096d8: 9f c4 40 00 call %l1 400096dc: 94 12 a0 e8 or %o2, 0xe8, %o2 400096e0: 81 c7 e0 08 ret 400096e4: 81 e8 00 00 restore } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 400096e8: 90 10 00 19 mov %i1, %o0 400096ec: 92 10 20 01 mov 1, %o1 400096f0: 96 10 00 16 mov %l6, %o3 400096f4: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 400096f8: b0 10 20 00 clr %i0 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 400096fc: 9f c4 40 00 call %l1 40009700: 94 12 a0 98 or %o2, 0x98, %o2 40009704: 81 c7 e0 08 ret 40009708: 81 e8 00 00 restore return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 4000970c: 90 10 00 19 mov %i1, %o0 40009710: 92 10 20 01 mov 1, %o1 40009714: 96 10 00 16 mov %l6, %o3 40009718: 15 10 00 59 sethi %hi(0x40016400), %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 4000971c: b0 10 20 00 clr %i0 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 40009720: 9f c4 40 00 call %l1 40009724: 94 12 a0 c8 or %o2, 0xc8, %o2 40009728: 81 c7 e0 08 ret 4000972c: 81 e8 00 00 restore 40009730: 82 10 00 1a mov %i2, %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40009734: 35 10 00 59 sethi %hi(0x40016400), %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)( 40009738: 31 10 00 59 sethi %hi(0x40016400), %i0 ); return false; } if ( _Heap_Is_used( free_block ) ) { 4000973c: ae 10 00 12 mov %l2, %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40009740: b4 16 a2 a8 or %i2, 0x2a8, %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)( 40009744: b0 16 22 90 or %i0, 0x290, %i0 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 40009748: 37 10 00 59 sethi %hi(0x40016400), %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; 4000974c: 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); 40009750: 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; 40009754: 80 a0 40 16 cmp %g1, %l6 40009758: 28 80 00 0c bleu,a 40009788 <_Heap_Walk+0x390> <== ALWAYS TAKEN 4000975c: 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)( 40009760: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 40009764: 92 10 20 01 mov 1, %o1 40009768: 96 10 00 17 mov %l7, %o3 4000976c: 15 10 00 59 sethi %hi(0x40016400), %o2 40009770: 98 10 00 16 mov %l6, %o4 40009774: 94 12 a1 20 or %o2, 0x120, %o2 40009778: 9f c4 40 00 call %l1 4000977c: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 40009780: 81 c7 e0 08 ret 40009784: 81 e8 00 00 restore 40009788: 80 a0 40 16 cmp %g1, %l6 4000978c: 0a bf ff f6 bcs 40009764 <_Heap_Walk+0x36c> 40009790: 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; 40009794: 82 1d c0 15 xor %l7, %l5, %g1 40009798: 80 a0 00 01 cmp %g0, %g1 4000979c: 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; 400097a0: 90 10 00 1d mov %i5, %o0 400097a4: c2 27 bf fc st %g1, [ %fp + -4 ] 400097a8: 7f ff e0 c2 call 40001ab0 <.urem> 400097ac: 92 10 00 14 mov %l4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 400097b0: 80 a2 20 00 cmp %o0, 0 400097b4: 02 80 00 05 be 400097c8 <_Heap_Walk+0x3d0> 400097b8: c2 07 bf fc ld [ %fp + -4 ], %g1 400097bc: 80 88 60 ff btst 0xff, %g1 400097c0: 12 80 00 79 bne 400099a4 <_Heap_Walk+0x5ac> 400097c4: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 400097c8: 80 a4 c0 1d cmp %l3, %i5 400097cc: 08 80 00 05 bleu 400097e0 <_Heap_Walk+0x3e8> 400097d0: 80 a5 c0 16 cmp %l7, %l6 400097d4: 80 88 60 ff btst 0xff, %g1 400097d8: 12 80 00 7c bne 400099c8 <_Heap_Walk+0x5d0> <== ALWAYS TAKEN 400097dc: 80 a5 c0 16 cmp %l7, %l6 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 400097e0: 2a 80 00 06 bcs,a 400097f8 <_Heap_Walk+0x400> 400097e4: c2 05 a0 04 ld [ %l6 + 4 ], %g1 400097e8: 80 88 60 ff btst 0xff, %g1 400097ec: 12 80 00 82 bne 400099f4 <_Heap_Walk+0x5fc> 400097f0: 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; 400097f4: c2 05 a0 04 ld [ %l6 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 400097f8: 80 88 60 01 btst 1, %g1 400097fc: 02 80 00 19 be 40009860 <_Heap_Walk+0x468> 40009800: b8 0f 20 01 and %i4, 1, %i4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 40009804: 80 a7 20 00 cmp %i4, 0 40009808: 22 80 00 0e be,a 40009840 <_Heap_Walk+0x448> 4000980c: da 05 c0 00 ld [ %l7 ], %o5 (*printer)( 40009810: 90 10 00 19 mov %i1, %o0 40009814: 92 10 20 00 clr %o1 40009818: 94 10 00 18 mov %i0, %o2 4000981c: 96 10 00 17 mov %l7, %o3 40009820: 9f c4 40 00 call %l1 40009824: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 40009828: 80 a4 80 16 cmp %l2, %l6 4000982c: 02 80 00 43 be 40009938 <_Heap_Walk+0x540> 40009830: ae 10 00 16 mov %l6, %l7 40009834: f8 05 a0 04 ld [ %l6 + 4 ], %i4 40009838: 10 bf ff c5 b 4000974c <_Heap_Walk+0x354> 4000983c: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 40009840: 96 10 00 17 mov %l7, %o3 40009844: 90 10 00 19 mov %i1, %o0 40009848: 92 10 20 00 clr %o1 4000984c: 94 10 00 1a mov %i2, %o2 40009850: 9f c4 40 00 call %l1 40009854: 98 10 00 1d mov %i5, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 40009858: 10 bf ff f5 b 4000982c <_Heap_Walk+0x434> 4000985c: 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 ? 40009860: 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)( 40009864: c2 04 20 08 ld [ %l0 + 8 ], %g1 40009868: 05 10 00 58 sethi %hi(0x40016000), %g2 block = next_block; } while ( block != first_block ); return true; } 4000986c: 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)( 40009870: 80 a0 40 0d cmp %g1, %o5 40009874: 02 80 00 05 be 40009888 <_Heap_Walk+0x490> 40009878: 86 10 a2 90 or %g2, 0x290, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 4000987c: 80 a4 00 0d cmp %l0, %o5 40009880: 02 80 00 3e be 40009978 <_Heap_Walk+0x580> 40009884: 86 16 e2 58 or %i3, 0x258, %g3 block->next, block->next == last_free_block ? 40009888: 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)( 4000988c: 19 10 00 58 sethi %hi(0x40016000), %o4 40009890: 80 a1 00 01 cmp %g4, %g1 40009894: 02 80 00 05 be 400098a8 <_Heap_Walk+0x4b0> 40009898: 84 13 22 b0 or %o4, 0x2b0, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 4000989c: 80 a4 00 01 cmp %l0, %g1 400098a0: 02 80 00 33 be 4000996c <_Heap_Walk+0x574> 400098a4: 84 16 e2 58 or %i3, 0x258, %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)( 400098a8: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 400098ac: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 400098b0: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 400098b4: 90 10 00 19 mov %i1, %o0 400098b8: 92 10 20 00 clr %o1 400098bc: 15 10 00 59 sethi %hi(0x40016400), %o2 400098c0: 96 10 00 17 mov %l7, %o3 400098c4: 94 12 a1 e8 or %o2, 0x1e8, %o2 400098c8: 9f c4 40 00 call %l1 400098cc: 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 ) { 400098d0: da 05 80 00 ld [ %l6 ], %o5 400098d4: 80 a7 40 0d cmp %i5, %o5 400098d8: 12 80 00 1a bne 40009940 <_Heap_Walk+0x548> 400098dc: 80 a7 20 00 cmp %i4, 0 ); return false; } if ( !prev_used ) { 400098e0: 02 80 00 29 be 40009984 <_Heap_Walk+0x58c> 400098e4: 90 10 00 19 mov %i1, %o0 block = next_block; } while ( block != first_block ); return true; } 400098e8: 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 ) { 400098ec: 80 a4 00 01 cmp %l0, %g1 400098f0: 02 80 00 0b be 4000991c <_Heap_Walk+0x524> <== NEVER TAKEN 400098f4: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 400098f8: 80 a5 c0 01 cmp %l7, %g1 400098fc: 02 bf ff cc be 4000982c <_Heap_Walk+0x434> 40009900: 80 a4 80 16 cmp %l2, %l6 return true; } free_block = free_block->next; 40009904: 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 ) { 40009908: 80 a4 00 01 cmp %l0, %g1 4000990c: 12 bf ff fc bne 400098fc <_Heap_Walk+0x504> 40009910: 80 a5 c0 01 cmp %l7, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 40009914: 90 10 00 19 mov %i1, %o0 40009918: 92 10 20 01 mov 1, %o1 4000991c: 96 10 00 17 mov %l7, %o3 40009920: 15 10 00 59 sethi %hi(0x40016400), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 40009924: b0 10 20 00 clr %i0 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 40009928: 9f c4 40 00 call %l1 4000992c: 94 12 a2 d0 or %o2, 0x2d0, %o2 40009930: 81 c7 e0 08 ret 40009934: 81 e8 00 00 restore block = next_block; } while ( block != first_block ); return true; } 40009938: 81 c7 e0 08 ret 4000993c: 91 e8 20 01 restore %g0, 1, %o0 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 40009940: ec 23 a0 5c st %l6, [ %sp + 0x5c ] 40009944: 90 10 00 19 mov %i1, %o0 40009948: 92 10 20 01 mov 1, %o1 4000994c: 96 10 00 17 mov %l7, %o3 40009950: 15 10 00 59 sethi %hi(0x40016400), %o2 40009954: 98 10 00 1d mov %i5, %o4 40009958: 94 12 a2 20 or %o2, 0x220, %o2 4000995c: 9f c4 40 00 call %l1 40009960: b0 10 20 00 clr %i0 40009964: 81 c7 e0 08 ret 40009968: 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)" : "") 4000996c: 09 10 00 58 sethi %hi(0x40016000), %g4 40009970: 10 bf ff ce b 400098a8 <_Heap_Walk+0x4b0> 40009974: 84 11 22 c0 or %g4, 0x2c0, %g2 ! 400162c0 <_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)" : ""), 40009978: 19 10 00 58 sethi %hi(0x40016000), %o4 4000997c: 10 bf ff c3 b 40009888 <_Heap_Walk+0x490> 40009980: 86 13 22 a0 or %o4, 0x2a0, %g3 ! 400162a0 <_Status_Object_name_errors_to_status+0x48> return false; } if ( !prev_used ) { (*printer)( 40009984: 92 10 20 01 mov 1, %o1 40009988: 96 10 00 17 mov %l7, %o3 4000998c: 15 10 00 59 sethi %hi(0x40016400), %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 40009990: b0 10 20 00 clr %i0 return false; } if ( !prev_used ) { (*printer)( 40009994: 9f c4 40 00 call %l1 40009998: 94 12 a2 60 or %o2, 0x260, %o2 4000999c: 81 c7 e0 08 ret 400099a0: 81 e8 00 00 restore return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 400099a4: 92 10 20 01 mov 1, %o1 400099a8: 96 10 00 17 mov %l7, %o3 400099ac: 15 10 00 59 sethi %hi(0x40016400), %o2 400099b0: 98 10 00 1d mov %i5, %o4 400099b4: 94 12 a1 50 or %o2, 0x150, %o2 400099b8: 9f c4 40 00 call %l1 400099bc: b0 10 20 00 clr %i0 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 400099c0: 81 c7 e0 08 ret 400099c4: 81 e8 00 00 restore } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 400099c8: 90 10 00 19 mov %i1, %o0 400099cc: 92 10 20 01 mov 1, %o1 400099d0: 96 10 00 17 mov %l7, %o3 400099d4: 15 10 00 59 sethi %hi(0x40016400), %o2 400099d8: 98 10 00 1d mov %i5, %o4 400099dc: 94 12 a1 80 or %o2, 0x180, %o2 400099e0: 9a 10 00 13 mov %l3, %o5 400099e4: 9f c4 40 00 call %l1 400099e8: b0 10 20 00 clr %i0 block, block_size, min_block_size ); return false; 400099ec: 81 c7 e0 08 ret 400099f0: 81 e8 00 00 restore } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 400099f4: 92 10 20 01 mov 1, %o1 400099f8: 96 10 00 17 mov %l7, %o3 400099fc: 15 10 00 59 sethi %hi(0x40016400), %o2 40009a00: 98 10 00 16 mov %l6, %o4 40009a04: 94 12 a1 b0 or %o2, 0x1b0, %o2 40009a08: 9f c4 40 00 call %l1 40009a0c: b0 10 20 00 clr %i0 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 40009a10: 81 c7 e0 08 ret 40009a14: 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 ) { 40009a18: 10 bf ff 47 b 40009734 <_Heap_Walk+0x33c> 40009a1c: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 =============================================================================== 400078e8 <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 400078e8: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 400078ec: 23 10 00 59 sethi %hi(0x40016400), %l1 400078f0: c2 04 60 9c ld [ %l1 + 0x9c ], %g1 ! 4001649c <_IO_Number_of_drivers> 400078f4: 80 a0 60 00 cmp %g1, 0 400078f8: 02 80 00 0c be 40007928 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 400078fc: a0 10 20 00 clr %l0 40007900: a2 14 60 9c or %l1, 0x9c, %l1 (void) rtems_io_initialize( major, 0, NULL ); 40007904: 90 10 00 10 mov %l0, %o0 40007908: 92 10 20 00 clr %o1 4000790c: 40 00 14 ec call 4000ccbc 40007910: 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 ++ ) 40007914: c2 04 40 00 ld [ %l1 ], %g1 40007918: a0 04 20 01 inc %l0 4000791c: 80 a0 40 10 cmp %g1, %l0 40007920: 18 bf ff fa bgu 40007908 <_IO_Initialize_all_drivers+0x20> 40007924: 90 10 00 10 mov %l0, %o0 40007928: 81 c7 e0 08 ret 4000792c: 81 e8 00 00 restore =============================================================================== 4000781c <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 4000781c: 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; 40007820: 03 10 00 55 sethi %hi(0x40015400), %g1 40007824: 82 10 63 a8 or %g1, 0x3a8, %g1 ! 400157a8 drivers_in_table = Configuration.number_of_device_drivers; 40007828: e2 00 60 30 ld [ %g1 + 0x30 ], %l1 number_of_drivers = Configuration.maximum_drivers; 4000782c: 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 ) 40007830: 80 a4 40 14 cmp %l1, %l4 40007834: 0a 80 00 08 bcs 40007854 <_IO_Manager_initialization+0x38> 40007838: 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; 4000783c: 03 10 00 59 sethi %hi(0x40016400), %g1 40007840: e0 20 60 a0 st %l0, [ %g1 + 0xa0 ] ! 400164a0 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 40007844: 03 10 00 59 sethi %hi(0x40016400), %g1 40007848: e2 20 60 9c st %l1, [ %g1 + 0x9c ] ! 4001649c <_IO_Number_of_drivers> return; 4000784c: 81 c7 e0 08 ret 40007850: 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 ) 40007854: 83 2d 20 03 sll %l4, 3, %g1 40007858: a7 2d 20 05 sll %l4, 5, %l3 4000785c: 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( 40007860: 40 00 0c a8 call 4000ab00 <_Workspace_Allocate_or_fatal_error> 40007864: 90 10 00 13 mov %l3, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40007868: 03 10 00 59 sethi %hi(0x40016400), %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 *) 4000786c: 25 10 00 59 sethi %hi(0x40016400), %l2 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 40007870: e8 20 60 9c st %l4, [ %g1 + 0x9c ] /* * 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 *) 40007874: d0 24 a0 a0 st %o0, [ %l2 + 0xa0 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 40007878: 92 10 20 00 clr %o1 4000787c: 40 00 20 78 call 4000fa5c 40007880: 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++ ) 40007884: 80 a4 60 00 cmp %l1, 0 40007888: 02 bf ff f1 be 4000784c <_IO_Manager_initialization+0x30> <== NEVER TAKEN 4000788c: da 04 a0 a0 ld [ %l2 + 0xa0 ], %o5 40007890: 82 10 20 00 clr %g1 40007894: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 40007898: c4 04 00 01 ld [ %l0 + %g1 ], %g2 4000789c: 86 04 00 01 add %l0, %g1, %g3 400078a0: c4 23 40 01 st %g2, [ %o5 + %g1 ] 400078a4: d8 00 e0 04 ld [ %g3 + 4 ], %o4 400078a8: 84 03 40 01 add %o5, %g1, %g2 400078ac: d8 20 a0 04 st %o4, [ %g2 + 4 ] 400078b0: 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++ ) 400078b4: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 400078b8: d8 20 a0 08 st %o4, [ %g2 + 8 ] 400078bc: 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++ ) 400078c0: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 400078c4: d8 20 a0 0c st %o4, [ %g2 + 0xc ] 400078c8: 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++ ) 400078cc: 80 a4 40 04 cmp %l1, %g4 _IO_Driver_address_table[index] = driver_table[index]; 400078d0: d8 20 a0 10 st %o4, [ %g2 + 0x10 ] 400078d4: 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++ ) 400078d8: 18 bf ff f0 bgu 40007898 <_IO_Manager_initialization+0x7c> 400078dc: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 400078e0: 81 c7 e0 08 ret 400078e4: 81 e8 00 00 restore =============================================================================== 40008564 <_Internal_error_Occurred>: void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40008564: 9d e3 bf a0 save %sp, -96, %sp _Internal_errors_What_happened.the_source = the_source; 40008568: 09 10 00 58 sethi %hi(0x40016000), %g4 4000856c: 84 11 22 6c or %g4, 0x26c, %g2 ! 4001626c <_Internal_errors_What_happened> void _Internal_error_Occurred( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 40008570: 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 ); 40008574: 90 10 00 18 mov %i0, %o0 bool is_internal, Internal_errors_t the_error ) { _Internal_errors_What_happened.the_source = the_source; 40008578: f0 21 22 6c st %i0, [ %g4 + 0x26c ] _Internal_errors_What_happened.is_internal = is_internal; _Internal_errors_What_happened.the_error = the_error; 4000857c: f4 20 a0 08 st %i2, [ %g2 + 8 ] _User_extensions_Fatal( the_source, is_internal, the_error ); 40008580: 92 0e 60 ff and %i1, 0xff, %o1 40008584: 40 00 07 fe call 4000a57c <_User_extensions_Fatal> 40008588: f2 28 a0 04 stb %i1, [ %g2 + 4 ] RTEMS_INLINE_ROUTINE void _System_state_Set ( System_state_Codes state ) { _System_state_Current = state; 4000858c: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED 40008590: 03 10 00 58 sethi %hi(0x40016000), %g1 <== NOT EXECUTED _System_state_Set( SYSTEM_STATE_FAILED ); _CPU_Fatal_halt( the_error ); 40008594: 7f ff e6 1e call 40001e0c <== NOT EXECUTED 40008598: c4 20 63 5c st %g2, [ %g1 + 0x35c ] ! 4001635c <_System_state_Current><== NOT EXECUTED 4000859c: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED 400085a0: 30 80 00 00 b,a 400085a0 <_Internal_error_Occurred+0x3c> <== NOT EXECUTED =============================================================================== 40008618 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 40008618: 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 ) 4000861c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 40008620: 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 ) 40008624: 80 a0 60 00 cmp %g1, 0 40008628: 02 80 00 19 be 4000868c <_Objects_Allocate+0x74> <== NEVER TAKEN 4000862c: 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 ); 40008630: a2 04 20 20 add %l0, 0x20, %l1 40008634: 7f ff fd 5b call 40007ba0 <_Chain_Get> 40008638: 90 10 00 11 mov %l1, %o0 if ( information->auto_extend ) { 4000863c: c2 0c 20 12 ldub [ %l0 + 0x12 ], %g1 40008640: 80 a0 60 00 cmp %g1, 0 40008644: 02 80 00 12 be 4000868c <_Objects_Allocate+0x74> 40008648: 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 ) { 4000864c: 80 a2 20 00 cmp %o0, 0 40008650: 02 80 00 11 be 40008694 <_Objects_Allocate+0x7c> 40008654: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 40008658: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 4000865c: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 40008660: d2 14 20 14 lduh [ %l0 + 0x14 ], %o1 40008664: 40 00 28 7a call 4001284c <.udiv> 40008668: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 4000866c: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 40008670: 91 2a 20 02 sll %o0, 2, %o0 40008674: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 40008678: 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 ]--; 4000867c: 86 00 ff ff add %g3, -1, %g3 40008680: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 40008684: 82 00 bf ff add %g2, -1, %g1 40008688: c2 34 20 2c sth %g1, [ %l0 + 0x2c ] ); } #endif return the_object; } 4000868c: 81 c7 e0 08 ret 40008690: 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 ); 40008694: 40 00 00 11 call 400086d8 <_Objects_Extend_information> 40008698: 90 10 00 10 mov %l0, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 4000869c: 7f ff fd 41 call 40007ba0 <_Chain_Get> 400086a0: 90 10 00 11 mov %l1, %o0 } if ( the_object ) { 400086a4: b0 92 20 00 orcc %o0, 0, %i0 400086a8: 32 bf ff ed bne,a 4000865c <_Objects_Allocate+0x44> 400086ac: c2 14 20 0a lduh [ %l0 + 0xa ], %g1 ); } #endif return the_object; } 400086b0: 81 c7 e0 08 ret 400086b4: 81 e8 00 00 restore =============================================================================== 400086d8 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 400086d8: 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 ) 400086dc: e8 06 20 34 ld [ %i0 + 0x34 ], %l4 400086e0: 80 a5 20 00 cmp %l4, 0 400086e4: 02 80 00 a9 be 40008988 <_Objects_Extend_information+0x2b0> 400086e8: e4 16 20 0a lduh [ %i0 + 0xa ], %l2 block_count = 0; else { block_count = information->maximum / information->allocation_size; 400086ec: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 400086f0: e6 16 20 14 lduh [ %i0 + 0x14 ], %l3 400086f4: ab 2d 60 10 sll %l5, 0x10, %l5 400086f8: 92 10 00 13 mov %l3, %o1 400086fc: 40 00 28 54 call 4001284c <.udiv> 40008700: 91 35 60 10 srl %l5, 0x10, %o0 40008704: bb 2a 20 10 sll %o0, 0x10, %i5 40008708: bb 37 60 10 srl %i5, 0x10, %i5 for ( ; block < block_count; block++ ) { 4000870c: 80 a7 60 00 cmp %i5, 0 40008710: 02 80 00 a6 be 400089a8 <_Objects_Extend_information+0x2d0><== NEVER TAKEN 40008714: 90 10 00 13 mov %l3, %o0 if ( information->object_blocks[ block ] == NULL ) { 40008718: c2 05 00 00 ld [ %l4 ], %g1 4000871c: 80 a0 60 00 cmp %g1, 0 40008720: 02 80 00 a6 be 400089b8 <_Objects_Extend_information+0x2e0><== NEVER TAKEN 40008724: 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; 40008728: 10 80 00 06 b 40008740 <_Objects_Extend_information+0x68> 4000872c: 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 ) { 40008730: c2 05 00 01 ld [ %l4 + %g1 ], %g1 40008734: 80 a0 60 00 cmp %g1, 0 40008738: 22 80 00 08 be,a 40008758 <_Objects_Extend_information+0x80> 4000873c: 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++ ) { 40008740: a0 04 20 01 inc %l0 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 40008744: 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++ ) { 40008748: 80 a7 40 10 cmp %i5, %l0 4000874c: 18 bf ff f9 bgu 40008730 <_Objects_Extend_information+0x58> 40008750: 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; 40008754: a8 10 20 01 mov 1, %l4 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 40008758: 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 ) { 4000875c: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 40008760: 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 ) { 40008764: 82 10 63 ff or %g1, 0x3ff, %g1 40008768: 80 a5 40 01 cmp %l5, %g1 4000876c: 18 80 00 98 bgu 400089cc <_Objects_Extend_information+0x2f4> 40008770: 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; 40008774: 40 00 27 fc call 40012764 <.umul> 40008778: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 4000877c: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 40008780: 80 a0 60 00 cmp %g1, 0 40008784: 02 80 00 6d be 40008938 <_Objects_Extend_information+0x260> 40008788: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 4000878c: 40 00 08 cd call 4000aac0 <_Workspace_Allocate> 40008790: 01 00 00 00 nop if ( !new_object_block ) 40008794: a6 92 20 00 orcc %o0, 0, %l3 40008798: 02 80 00 8d be 400089cc <_Objects_Extend_information+0x2f4> 4000879c: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 400087a0: 80 8d 20 ff btst 0xff, %l4 400087a4: 22 80 00 42 be,a 400088ac <_Objects_Extend_information+0x1d4> 400087a8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 400087ac: 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 *)) + 400087b0: 91 2d 20 01 sll %l4, 1, %o0 400087b4: 90 02 00 14 add %o0, %l4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 400087b8: 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 *)) + 400087bc: 90 02 00 12 add %o0, %l2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 400087c0: 40 00 08 c0 call 4000aac0 <_Workspace_Allocate> 400087c4: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 400087c8: ac 92 20 00 orcc %o0, 0, %l6 400087cc: 02 80 00 7e be 400089c4 <_Objects_Extend_information+0x2ec> 400087d0: 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 ) { 400087d4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 400087d8: 80 a4 80 01 cmp %l2, %g1 400087dc: ae 05 80 14 add %l6, %l4, %l7 400087e0: 0a 80 00 5a bcs 40008948 <_Objects_Extend_information+0x270> 400087e4: 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++ ) { 400087e8: 80 a4 a0 00 cmp %l2, 0 400087ec: 02 80 00 07 be 40008808 <_Objects_Extend_information+0x130><== NEVER TAKEN 400087f0: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 400087f4: 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++ ) { 400087f8: 82 00 60 01 inc %g1 400087fc: 80 a4 80 01 cmp %l2, %g1 40008800: 18 bf ff fd bgu 400087f4 <_Objects_Extend_information+0x11c><== NEVER TAKEN 40008804: c0 20 80 14 clr [ %g2 + %l4 ] 40008808: 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 ); 4000880c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 40008810: c0 25 80 1d clr [ %l6 + %i5 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 40008814: 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 ; 40008818: 80 a4 40 03 cmp %l1, %g3 4000881c: 1a 80 00 0a bcc 40008844 <_Objects_Extend_information+0x16c><== NEVER TAKEN 40008820: c0 25 c0 1d clr [ %l7 + %i5 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 40008824: 83 2c 60 02 sll %l1, 2, %g1 40008828: 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 ; 4000882c: 82 05 00 01 add %l4, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 40008830: 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++ ) { 40008834: 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 ; 40008838: 80 a0 80 03 cmp %g2, %g3 4000883c: 0a bf ff fd bcs 40008830 <_Objects_Extend_information+0x158> 40008840: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 40008844: 7f ff e5 72 call 40001e0c 40008848: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 4000884c: 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( 40008850: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 40008854: 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; 40008858: ea 36 20 10 sth %l5, [ %i0 + 0x10 ] 4000885c: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40008860: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 40008864: ec 26 20 34 st %l6, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 40008868: ee 26 20 30 st %l7, [ %i0 + 0x30 ] information->local_table = local_table; 4000886c: e8 26 20 1c st %l4, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 40008870: 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) | 40008874: 03 00 00 40 sethi %hi(0x10000), %g1 40008878: ab 35 60 10 srl %l5, 0x10, %l5 4000887c: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40008880: 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) | 40008884: 82 10 40 15 or %g1, %l5, %g1 40008888: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 4000888c: 7f ff e5 64 call 40001e1c 40008890: 01 00 00 00 nop if ( old_tables ) 40008894: 80 a4 a0 00 cmp %l2, 0 40008898: 22 80 00 05 be,a 400088ac <_Objects_Extend_information+0x1d4> 4000889c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 _Workspace_Free( old_tables ); 400088a0: 40 00 08 91 call 4000aae4 <_Workspace_Free> 400088a4: 90 10 00 12 mov %l2, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 400088a8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400088ac: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 400088b0: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 400088b4: 92 10 00 13 mov %l3, %o1 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 400088b8: a1 2c 20 02 sll %l0, 2, %l0 /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400088bc: 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; 400088c0: e6 20 40 10 st %l3, [ %g1 + %l0 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 400088c4: 90 10 00 12 mov %l2, %o0 400088c8: 40 00 11 14 call 4000cd18 <_Chain_Initialize> 400088cc: 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 ) { 400088d0: 10 80 00 0d b 40008904 <_Objects_Extend_information+0x22c> 400088d4: 29 00 00 40 sethi %hi(0x10000), %l4 the_object->id = _Objects_Build_id( 400088d8: c6 16 20 04 lduh [ %i0 + 4 ], %g3 400088dc: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 400088e0: 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) | 400088e4: 84 10 80 14 or %g2, %l4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 400088e8: 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) | 400088ec: 84 10 80 11 or %g2, %l1, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 400088f0: 90 10 00 13 mov %l3, %o0 400088f4: 92 10 00 01 mov %g1, %o1 index++; 400088f8: a2 04 60 01 inc %l1 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 400088fc: 7f ff fc 93 call 40007b48 <_Chain_Append> 40008900: 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 ) { 40008904: 7f ff fc a7 call 40007ba0 <_Chain_Get> 40008908: 90 10 00 12 mov %l2, %o0 4000890c: 82 92 20 00 orcc %o0, 0, %g1 40008910: 32 bf ff f2 bne,a 400088d8 <_Objects_Extend_information+0x200> 40008914: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 40008918: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 4000891c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 40008920: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 40008924: c8 20 c0 10 st %g4, [ %g3 + %l0 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 40008928: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 4000892c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 40008930: 81 c7 e0 08 ret 40008934: 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 ); 40008938: 40 00 08 72 call 4000ab00 <_Workspace_Allocate_or_fatal_error> 4000893c: 01 00 00 00 nop 40008940: 10 bf ff 98 b 400087a0 <_Objects_Extend_information+0xc8> 40008944: 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, 40008948: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 4000894c: 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, 40008950: 40 00 1c 0a call 4000f978 40008954: 94 10 00 1d mov %i5, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 40008958: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 4000895c: 94 10 00 1d mov %i5, %o2 40008960: 40 00 1c 06 call 4000f978 40008964: 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 *) ); 40008968: 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, 4000896c: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 40008970: 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, 40008974: 90 10 00 14 mov %l4, %o0 40008978: 40 00 1c 00 call 4000f978 4000897c: 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 ); 40008980: 10 bf ff a4 b 40008810 <_Objects_Extend_information+0x138> 40008984: 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 ) 40008988: ea 16 20 10 lduh [ %i0 + 0x10 ], %l5 4000898c: 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 ); 40008990: 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; 40008994: a8 10 20 01 mov 1, %l4 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 40008998: a0 10 20 00 clr %l0 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 4000899c: ba 10 20 00 clr %i5 400089a0: 10 bf ff 6e b 40008758 <_Objects_Extend_information+0x80> 400089a4: 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 ); 400089a8: 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; 400089ac: a8 10 20 01 mov 1, %l4 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 400089b0: 10 bf ff 6a b 40008758 <_Objects_Extend_information+0x80> <== NOT EXECUTED 400089b4: 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; 400089b8: 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; 400089bc: 10 bf ff 67 b 40008758 <_Objects_Extend_information+0x80> <== NOT EXECUTED 400089c0: 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 ); 400089c4: 40 00 08 48 call 4000aae4 <_Workspace_Free> 400089c8: 90 10 00 13 mov %l3, %o0 return; 400089cc: 81 c7 e0 08 ret 400089d0: 81 e8 00 00 restore =============================================================================== 40008a80 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 40008a80: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 40008a84: b3 2e 60 10 sll %i1, 0x10, %i1 40008a88: b3 36 60 10 srl %i1, 0x10, %i1 40008a8c: 80 a6 60 00 cmp %i1, 0 40008a90: 12 80 00 04 bne 40008aa0 <_Objects_Get_information+0x20> 40008a94: a0 10 20 00 clr %l0 if ( info->maximum == 0 ) return NULL; #endif return info; } 40008a98: 81 c7 e0 08 ret 40008a9c: 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 ); 40008aa0: 40 00 12 2b call 4000d34c <_Objects_API_maximum_class> 40008aa4: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 40008aa8: 80 a2 20 00 cmp %o0, 0 40008aac: 02 bf ff fb be 40008a98 <_Objects_Get_information+0x18> 40008ab0: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 40008ab4: 0a bf ff f9 bcs 40008a98 <_Objects_Get_information+0x18> 40008ab8: 03 10 00 58 sethi %hi(0x40016000), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 40008abc: b1 2e 20 02 sll %i0, 2, %i0 40008ac0: 82 10 61 3c or %g1, 0x13c, %g1 40008ac4: c2 00 40 18 ld [ %g1 + %i0 ], %g1 40008ac8: 80 a0 60 00 cmp %g1, 0 40008acc: 02 bf ff f3 be 40008a98 <_Objects_Get_information+0x18> <== NEVER TAKEN 40008ad0: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 40008ad4: e0 00 40 19 ld [ %g1 + %i1 ], %l0 if ( !info ) 40008ad8: 80 a4 20 00 cmp %l0, 0 40008adc: 02 bf ff ef be 40008a98 <_Objects_Get_information+0x18> <== NEVER TAKEN 40008ae0: 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 ) 40008ae4: c2 14 20 10 lduh [ %l0 + 0x10 ], %g1 return NULL; 40008ae8: 80 a0 00 01 cmp %g0, %g1 40008aec: 82 60 20 00 subx %g0, 0, %g1 40008af0: 10 bf ff ea b 40008a98 <_Objects_Get_information+0x18> 40008af4: a0 0c 00 01 and %l0, %g1, %l0 =============================================================================== 4000a818 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 4000a818: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 4000a81c: 80 a6 60 00 cmp %i1, 0 4000a820: 12 80 00 05 bne 4000a834 <_Objects_Get_name_as_string+0x1c> 4000a824: 80 a6 a0 00 cmp %i2, 0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 4000a828: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 4000a82c: 81 c7 e0 08 ret 4000a830: 91 e8 00 1a restore %g0, %i2, %o0 Objects_Id tmpId; if ( length == 0 ) return NULL; if ( name == NULL ) 4000a834: 02 bf ff fe be 4000a82c <_Objects_Get_name_as_string+0x14> 4000a838: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 4000a83c: 12 80 00 04 bne 4000a84c <_Objects_Get_name_as_string+0x34> 4000a840: 03 10 00 a2 sethi %hi(0x40028800), %g1 4000a844: c2 00 60 f8 ld [ %g1 + 0xf8 ], %g1 ! 400288f8 <_Per_CPU_Information+0xc> 4000a848: f0 00 60 08 ld [ %g1 + 8 ], %i0 information = _Objects_Get_information_id( tmpId ); 4000a84c: 7f ff ff b1 call 4000a710 <_Objects_Get_information_id> 4000a850: 90 10 00 18 mov %i0, %o0 if ( !information ) 4000a854: 80 a2 20 00 cmp %o0, 0 4000a858: 22 bf ff f5 be,a 4000a82c <_Objects_Get_name_as_string+0x14> 4000a85c: b4 10 20 00 clr %i2 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 4000a860: 92 10 00 18 mov %i0, %o1 4000a864: 40 00 00 2d call 4000a918 <_Objects_Get> 4000a868: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 4000a86c: c2 07 bf fc ld [ %fp + -4 ], %g1 4000a870: 80 a0 60 00 cmp %g1, 0 4000a874: 32 bf ff ee bne,a 4000a82c <_Objects_Get_name_as_string+0x14> 4000a878: 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; 4000a87c: 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'; 4000a880: 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; 4000a884: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 4000a888: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 4000a88c: 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; 4000a890: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; 4000a894: 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; 4000a898: 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; 4000a89c: 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; 4000a8a0: 84 10 00 04 mov %g4, %g2 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 4000a8a4: b2 86 7f ff addcc %i1, -1, %i1 4000a8a8: 02 80 00 19 be 4000a90c <_Objects_Get_name_as_string+0xf4><== NEVER TAKEN 4000a8ac: 86 10 00 1a mov %i2, %g3 4000a8b0: 80 a1 20 00 cmp %g4, 0 4000a8b4: 02 80 00 16 be 4000a90c <_Objects_Get_name_as_string+0xf4> 4000a8b8: 19 10 00 7f sethi %hi(0x4001fc00), %o4 4000a8bc: 82 10 20 00 clr %g1 4000a8c0: 10 80 00 06 b 4000a8d8 <_Objects_Get_name_as_string+0xc0> 4000a8c4: 98 13 23 20 or %o4, 0x320, %o4 4000a8c8: da 49 00 01 ldsb [ %g4 + %g1 ], %o5 4000a8cc: 80 a3 60 00 cmp %o5, 0 4000a8d0: 02 80 00 0f be 4000a90c <_Objects_Get_name_as_string+0xf4> 4000a8d4: c4 09 00 01 ldub [ %g4 + %g1 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 4000a8d8: da 03 00 00 ld [ %o4 ], %o5 4000a8dc: 88 08 a0 ff and %g2, 0xff, %g4 4000a8e0: 88 03 40 04 add %o5, %g4, %g4 4000a8e4: da 49 20 01 ldsb [ %g4 + 1 ], %o5 4000a8e8: 80 8b 60 97 btst 0x97, %o5 4000a8ec: 12 80 00 03 bne 4000a8f8 <_Objects_Get_name_as_string+0xe0> 4000a8f0: 88 07 bf f0 add %fp, -16, %g4 4000a8f4: 84 10 20 2a mov 0x2a, %g2 4000a8f8: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 4000a8fc: 82 00 60 01 inc %g1 4000a900: 80 a0 40 19 cmp %g1, %i1 4000a904: 0a bf ff f1 bcs 4000a8c8 <_Objects_Get_name_as_string+0xb0> 4000a908: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 4000a90c: 40 00 02 50 call 4000b24c <_Thread_Enable_dispatch> 4000a910: c0 28 c0 00 clrb [ %g3 ] return name; 4000a914: 30 bf ff c6 b,a 4000a82c <_Objects_Get_name_as_string+0x14> =============================================================================== 40019e50 <_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; 40019e50: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 40019e54: 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; 40019e58: 84 22 40 02 sub %o1, %g2, %g2 40019e5c: 84 00 a0 01 inc %g2 if ( information->maximum >= index ) { 40019e60: 80 a0 80 01 cmp %g2, %g1 40019e64: 18 80 00 09 bgu 40019e88 <_Objects_Get_no_protection+0x38> 40019e68: 85 28 a0 02 sll %g2, 2, %g2 if ( (the_object = information->local_table[ index ]) != NULL ) { 40019e6c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 40019e70: d0 00 40 02 ld [ %g1 + %g2 ], %o0 40019e74: 80 a2 20 00 cmp %o0, 0 40019e78: 02 80 00 05 be 40019e8c <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 40019e7c: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 40019e80: 81 c3 e0 08 retl 40019e84: 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; 40019e88: 82 10 20 01 mov 1, %g1 return NULL; 40019e8c: 90 10 20 00 clr %o0 } 40019e90: 81 c3 e0 08 retl 40019e94: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 4000a324 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 4000a324: 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; 4000a328: 80 a6 20 00 cmp %i0, 0 4000a32c: 12 80 00 06 bne 4000a344 <_Objects_Id_to_name+0x20> 4000a330: 83 36 20 18 srl %i0, 0x18, %g1 4000a334: 03 10 00 7e sethi %hi(0x4001f800), %g1 4000a338: c2 00 63 78 ld [ %g1 + 0x378 ], %g1 ! 4001fb78 <_Per_CPU_Information+0xc> 4000a33c: f0 00 60 08 ld [ %g1 + 8 ], %i0 4000a340: 83 36 20 18 srl %i0, 0x18, %g1 4000a344: 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 ) 4000a348: 84 00 7f ff add %g1, -1, %g2 4000a34c: 80 a0 a0 02 cmp %g2, 2 4000a350: 18 80 00 17 bgu 4000a3ac <_Objects_Id_to_name+0x88> 4000a354: 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 ] ) 4000a358: 83 28 60 02 sll %g1, 2, %g1 4000a35c: 05 10 00 7e sethi %hi(0x4001f800), %g2 4000a360: 84 10 a0 6c or %g2, 0x6c, %g2 ! 4001f86c <_Objects_Information_table> 4000a364: c2 00 80 01 ld [ %g2 + %g1 ], %g1 4000a368: 80 a0 60 00 cmp %g1, 0 4000a36c: 02 80 00 10 be 4000a3ac <_Objects_Id_to_name+0x88> 4000a370: 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 ]; 4000a374: 85 28 a0 02 sll %g2, 2, %g2 4000a378: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 4000a37c: 80 a2 20 00 cmp %o0, 0 4000a380: 02 80 00 0b be 4000a3ac <_Objects_Id_to_name+0x88> <== NEVER TAKEN 4000a384: 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 ); 4000a388: 7f ff ff ca call 4000a2b0 <_Objects_Get> 4000a38c: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 4000a390: 80 a2 20 00 cmp %o0, 0 4000a394: 02 80 00 06 be 4000a3ac <_Objects_Id_to_name+0x88> 4000a398: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 4000a39c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 4000a3a0: 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(); 4000a3a4: 40 00 02 60 call 4000ad24 <_Thread_Enable_dispatch> 4000a3a8: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 4000a3ac: 81 c7 e0 08 ret 4000a3b0: 91 e8 00 10 restore %g0, %l0, %o0 =============================================================================== 40008be0 <_Objects_Initialize_information>: , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 40008be0: 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; 40008be4: 05 10 00 58 sethi %hi(0x40016000), %g2 40008be8: 83 2e 60 02 sll %i1, 2, %g1 40008bec: 84 10 a1 3c or %g2, 0x13c, %g2 40008bf0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; 40008bf4: f4 36 20 04 sth %i2, [ %i0 + 4 ] uint32_t maximum_per_allocation; #if defined(RTEMS_MULTIPROCESSING) uint32_t index; #endif information->the_api = the_api; 40008bf8: f2 26 00 00 st %i1, [ %i0 ] information->the_class = the_class; information->size = size; 40008bfc: 85 2f 20 10 sll %i4, 0x10, %g2 information->local_table = 0; 40008c00: c0 26 20 1c clr [ %i0 + 0x1c ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 40008c04: 85 30 a0 10 srl %g2, 0x10, %g2 information->local_table = 0; information->inactive_per_block = 0; 40008c08: c0 26 20 30 clr [ %i0 + 0x30 ] uint32_t index; #endif information->the_api = the_api; information->the_class = the_class; information->size = size; 40008c0c: c4 26 20 18 st %g2, [ %i0 + 0x18 ] information->local_table = 0; information->inactive_per_block = 0; information->object_blocks = 0; 40008c10: c0 26 20 34 clr [ %i0 + 0x34 ] information->inactive = 0; 40008c14: 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; 40008c18: c0 36 20 10 clrh [ %i0 + 0x10 ] , bool supports_global, Objects_Thread_queue_Extract_callout extract #endif ) { 40008c1c: 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; 40008c20: b5 2e a0 10 sll %i2, 0x10, %i2 40008c24: b5 36 a0 10 srl %i2, 0x10, %i2 40008c28: 85 2e a0 02 sll %i2, 2, %g2 40008c2c: 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; 40008c30: 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 = 40008c34: 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) { 40008c38: 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; 40008c3c: 03 20 00 00 sethi %hi(0x80000000), %g1 /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { 40008c40: 02 80 00 05 be 40008c54 <_Objects_Initialize_information+0x74> 40008c44: b6 2e c0 01 andn %i3, %g1, %i3 40008c48: 80 a6 e0 00 cmp %i3, 0 40008c4c: 02 80 00 27 be 40008ce8 <_Objects_Initialize_information+0x108> 40008c50: 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) | 40008c54: 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; 40008c58: 80 a0 00 1b cmp %g0, %i3 40008c5c: b3 2e 60 18 sll %i1, 0x18, %i1 40008c60: 82 40 20 00 addx %g0, 0, %g1 40008c64: b2 16 40 02 or %i1, %g2, %i1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 40008c68: 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; 40008c6c: 05 10 00 57 sethi %hi(0x40015c00), %g2 40008c70: b4 16 40 1a or %i1, %i2, %i2 40008c74: 84 10 a2 54 or %g2, 0x254, %g2 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 40008c78: b4 16 80 01 or %i2, %g1, %i2 } /* * The allocation unit is the maximum value */ information->allocation_size = maximum_per_allocation; 40008c7c: 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; 40008c80: 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) ) 40008c84: 80 88 e0 03 btst 3, %g3 40008c88: 12 80 00 0c bne 40008cb8 <_Objects_Initialize_information+0xd8><== NEVER TAKEN 40008c8c: 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; 40008c90: 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 ); 40008c94: 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; 40008c98: 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); 40008c9c: c4 26 20 20 st %g2, [ %i0 + 0x20 ] the_chain->permanent_null = NULL; 40008ca0: c0 26 20 24 clr [ %i0 + 0x24 ] _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 40008ca4: 80 a6 e0 00 cmp %i3, 0 40008ca8: 12 80 00 0e bne 40008ce0 <_Objects_Initialize_information+0x100> 40008cac: c2 26 20 28 st %g1, [ %i0 + 0x28 ] 40008cb0: 81 c7 e0 08 ret 40008cb4: 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) & 40008cb8: 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; 40008cbc: 84 06 20 24 add %i0, 0x24, %g2 <== NOT EXECUTED 40008cc0: 86 08 ff fc and %g3, -4, %g3 <== NOT EXECUTED ~(OBJECTS_NAME_ALIGNMENT-1); information->name_length = name_length; _Chain_Initialize_empty( &information->Inactive ); 40008cc4: 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; 40008cc8: 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); 40008ccc: c4 26 20 20 st %g2, [ %i0 + 0x20 ] <== NOT EXECUTED the_chain->permanent_null = NULL; 40008cd0: c0 26 20 24 clr [ %i0 + 0x24 ] <== NOT EXECUTED _Chain_Initialize_empty( &information->Inactive ); /* * Initialize objects .. if there are any */ if ( maximum_per_allocation ) { 40008cd4: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 40008cd8: 02 bf ff f6 be 40008cb0 <_Objects_Initialize_information+0xd0><== NOT EXECUTED 40008cdc: 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 ); 40008ce0: 7f ff fe 7e call 400086d8 <_Objects_Extend_information> 40008ce4: 81 e8 00 00 restore /* * Unlimited and maximum of zero is illogical. */ if ( information->auto_extend && maximum_per_allocation == 0) { _Internal_error_Occurred( 40008ce8: 92 10 20 01 mov 1, %o1 40008cec: 7f ff fe 1e call 40008564 <_Internal_error_Occurred> 40008cf0: 94 10 20 13 mov 0x13, %o2 =============================================================================== 40008db0 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 40008db0: 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 ); 40008db4: e0 16 20 0a lduh [ %i0 + 0xa ], %l0 block_count = (information->maximum - index_base) / 40008db8: e2 16 20 14 lduh [ %i0 + 0x14 ], %l1 40008dbc: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 40008dc0: 92 10 00 11 mov %l1, %o1 40008dc4: 40 00 26 a2 call 4001284c <.udiv> 40008dc8: 90 22 00 10 sub %o0, %l0, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 40008dcc: 80 a2 20 00 cmp %o0, 0 40008dd0: 02 80 00 34 be 40008ea0 <_Objects_Shrink_information+0xf0><== NEVER TAKEN 40008dd4: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 40008dd8: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 40008ddc: c2 01 00 00 ld [ %g4 ], %g1 40008de0: 80 a4 40 01 cmp %l1, %g1 40008de4: 02 80 00 0f be 40008e20 <_Objects_Shrink_information+0x70><== NEVER TAKEN 40008de8: 82 10 20 00 clr %g1 40008dec: 10 80 00 07 b 40008e08 <_Objects_Shrink_information+0x58> 40008df0: a4 10 20 04 mov 4, %l2 information->inactive -= information->allocation_size; return; } index_base += information->allocation_size; 40008df4: 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 ] == 40008df8: 80 a4 40 02 cmp %l1, %g2 40008dfc: 02 80 00 0a be 40008e24 <_Objects_Shrink_information+0x74> 40008e00: a0 04 00 11 add %l0, %l1, %l0 40008e04: 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++ ) { 40008e08: 82 00 60 01 inc %g1 40008e0c: 80 a2 00 01 cmp %o0, %g1 40008e10: 38 bf ff f9 bgu,a 40008df4 <_Objects_Shrink_information+0x44> 40008e14: c4 01 00 12 ld [ %g4 + %l2 ], %g2 40008e18: 81 c7 e0 08 ret 40008e1c: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 40008e20: 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; 40008e24: 10 80 00 06 b 40008e3c <_Objects_Shrink_information+0x8c> 40008e28: 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 ); 40008e2c: 80 a4 60 00 cmp %l1, 0 40008e30: 22 80 00 12 be,a 40008e78 <_Objects_Shrink_information+0xc8> 40008e34: 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; 40008e38: 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 ); 40008e3c: 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) && 40008e40: 80 a0 40 10 cmp %g1, %l0 40008e44: 0a bf ff fa bcs 40008e2c <_Objects_Shrink_information+0x7c> 40008e48: e2 02 00 00 ld [ %o0 ], %l1 (index < (index_base + information->allocation_size))) { 40008e4c: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 40008e50: 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) && 40008e54: 80 a0 40 02 cmp %g1, %g2 40008e58: 1a bf ff f6 bcc 40008e30 <_Objects_Shrink_information+0x80> 40008e5c: 80 a4 60 00 cmp %l1, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 40008e60: 7f ff fb 46 call 40007b78 <_Chain_Extract> 40008e64: 01 00 00 00 nop } } while ( the_object ); 40008e68: 80 a4 60 00 cmp %l1, 0 40008e6c: 12 bf ff f4 bne 40008e3c <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 40008e70: 90 10 00 11 mov %l1, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 40008e74: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 40008e78: 40 00 07 1b call 4000aae4 <_Workspace_Free> 40008e7c: d0 00 40 12 ld [ %g1 + %l2 ], %o0 information->object_blocks[ block ] = NULL; 40008e80: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; 40008e84: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 40008e88: 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; 40008e8c: c0 20 40 12 clr [ %g1 + %l2 ] information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 40008e90: 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; 40008e94: c0 20 c0 12 clr [ %g3 + %l2 ] information->inactive -= information->allocation_size; 40008e98: 82 20 80 01 sub %g2, %g1, %g1 40008e9c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 40008ea0: 81 c7 e0 08 ret 40008ea4: 81 e8 00 00 restore =============================================================================== 40007524 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 40007524: 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; 40007528: 03 10 00 55 sethi %hi(0x40015400), %g1 4000752c: 82 10 63 70 or %g1, 0x370, %g1 ! 40015770 40007530: 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 ) 40007534: 80 a4 20 00 cmp %l0, 0 40007538: 02 80 00 19 be 4000759c <_RTEMS_tasks_Initialize_user_tasks_body+0x78> 4000753c: 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++ ) { 40007540: 80 a4 a0 00 cmp %l2, 0 40007544: 02 80 00 16 be 4000759c <_RTEMS_tasks_Initialize_user_tasks_body+0x78><== NEVER TAKEN 40007548: a2 10 20 00 clr %l1 4000754c: a6 07 bf fc add %fp, -4, %l3 return_value = rtems_task_create( 40007550: d4 04 20 04 ld [ %l0 + 4 ], %o2 40007554: d0 04 00 00 ld [ %l0 ], %o0 40007558: d2 04 20 08 ld [ %l0 + 8 ], %o1 4000755c: d6 04 20 14 ld [ %l0 + 0x14 ], %o3 40007560: d8 04 20 0c ld [ %l0 + 0xc ], %o4 40007564: 7f ff ff 6d call 40007318 40007568: 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 ) ) 4000756c: 94 92 20 00 orcc %o0, 0, %o2 40007570: 12 80 00 0d bne 400075a4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 40007574: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 40007578: d4 04 20 18 ld [ %l0 + 0x18 ], %o2 4000757c: 40 00 00 0e call 400075b4 40007580: 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 ) ) 40007584: 94 92 20 00 orcc %o0, 0, %o2 40007588: 12 80 00 07 bne 400075a4 <_RTEMS_tasks_Initialize_user_tasks_body+0x80> 4000758c: a2 04 60 01 inc %l1 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 40007590: 80 a4 80 11 cmp %l2, %l1 40007594: 18 bf ff ef bgu 40007550 <_RTEMS_tasks_Initialize_user_tasks_body+0x2c><== NEVER TAKEN 40007598: a0 04 20 1c add %l0, 0x1c, %l0 4000759c: 81 c7 e0 08 ret 400075a0: 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 ); 400075a4: 90 10 20 01 mov 1, %o0 400075a8: 40 00 03 ef call 40008564 <_Internal_error_Occurred> 400075ac: 92 10 20 01 mov 1, %o1 =============================================================================== 4000ca78 <_RTEMS_tasks_Post_switch_extension>: */ void _RTEMS_tasks_Post_switch_extension( Thread_Control *executing ) { 4000ca78: 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 ]; 4000ca7c: e0 06 21 5c ld [ %i0 + 0x15c ], %l0 if ( !api ) 4000ca80: 80 a4 20 00 cmp %l0, 0 4000ca84: 02 80 00 1f be 4000cb00 <_RTEMS_tasks_Post_switch_extension+0x88><== NEVER TAKEN 4000ca88: 01 00 00 00 nop * Signal Processing */ asr = &api->Signal; _ISR_Disable( level ); 4000ca8c: 7f ff d4 e0 call 40001e0c 4000ca90: 01 00 00 00 nop signal_set = asr->signals_posted; 4000ca94: e2 04 20 14 ld [ %l0 + 0x14 ], %l1 asr->signals_posted = 0; 4000ca98: c0 24 20 14 clr [ %l0 + 0x14 ] _ISR_Enable( level ); 4000ca9c: 7f ff d4 e0 call 40001e1c 4000caa0: 01 00 00 00 nop if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ 4000caa4: 80 a4 60 00 cmp %l1, 0 4000caa8: 32 80 00 04 bne,a 4000cab8 <_RTEMS_tasks_Post_switch_extension+0x40> 4000caac: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000cab0: 81 c7 e0 08 ret 4000cab4: 81 e8 00 00 restore return; asr->nest_level += 1; rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000cab8: d0 04 20 10 ld [ %l0 + 0x10 ], %o0 if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */ return; asr->nest_level += 1; 4000cabc: 82 00 60 01 inc %g1 rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000cac0: a4 07 bf fc add %fp, -4, %l2 4000cac4: 27 00 00 3f sethi %hi(0xfc00), %l3 4000cac8: 94 10 00 12 mov %l2, %o2 4000cacc: 92 14 e3 ff or %l3, 0x3ff, %o1 4000cad0: 40 00 08 06 call 4000eae8 4000cad4: c2 24 20 1c st %g1, [ %l0 + 0x1c ] (*asr->handler)( signal_set ); 4000cad8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 4000cadc: 9f c0 40 00 call %g1 4000cae0: 90 10 00 11 mov %l1, %o0 asr->nest_level -= 1; 4000cae4: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000cae8: 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; 4000caec: 82 00 7f ff add %g1, -1, %g1 rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode ); 4000caf0: 92 14 e3 ff or %l3, 0x3ff, %o1 4000caf4: 94 10 00 12 mov %l2, %o2 4000caf8: 40 00 07 fc call 4000eae8 4000cafc: c2 24 20 1c st %g1, [ %l0 + 0x1c ] 4000cb00: 81 c7 e0 08 ret 4000cb04: 81 e8 00 00 restore =============================================================================== 4000c9e8 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 4000c9e8: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 4000c9ec: 80 a0 60 00 cmp %g1, 0 4000c9f0: 22 80 00 0b be,a 4000ca1c <_RTEMS_tasks_Switch_extension+0x34> 4000c9f4: c2 02 61 68 ld [ %o1 + 0x168 ], %g1 tvp->tval = *tvp->ptr; 4000c9f8: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 4000c9fc: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 4000ca00: c8 00 80 00 ld [ %g2 ], %g4 4000ca04: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; 4000ca08: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 4000ca0c: 80 a0 60 00 cmp %g1, 0 4000ca10: 12 bf ff fa bne 4000c9f8 <_RTEMS_tasks_Switch_extension+0x10><== NEVER TAKEN 4000ca14: 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; 4000ca18: c2 02 61 68 ld [ %o1 + 0x168 ], %g1 while (tvp) { 4000ca1c: 80 a0 60 00 cmp %g1, 0 4000ca20: 02 80 00 0a be 4000ca48 <_RTEMS_tasks_Switch_extension+0x60> 4000ca24: 01 00 00 00 nop tvp->gval = *tvp->ptr; 4000ca28: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 4000ca2c: 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; 4000ca30: c8 00 80 00 ld [ %g2 ], %g4 4000ca34: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; tvp = (rtems_task_variable_t *)tvp->next; 4000ca38: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 4000ca3c: 80 a0 60 00 cmp %g1, 0 4000ca40: 12 bf ff fa bne 4000ca28 <_RTEMS_tasks_Switch_extension+0x40><== NEVER TAKEN 4000ca44: c6 20 80 00 st %g3, [ %g2 ] 4000ca48: 81 c3 e0 08 retl =============================================================================== 40008848 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 40008848: 9d e3 bf 98 save %sp, -104, %sp 4000884c: 11 10 00 7f sethi %hi(0x4001fc00), %o0 40008850: 92 10 00 18 mov %i0, %o1 40008854: 90 12 22 74 or %o0, 0x274, %o0 40008858: 40 00 08 3f call 4000a954 <_Objects_Get> 4000885c: 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 ) { 40008860: c2 07 bf fc ld [ %fp + -4 ], %g1 40008864: 80 a0 60 00 cmp %g1, 0 40008868: 12 80 00 16 bne 400088c0 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN 4000886c: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: the_thread = the_period->owner; 40008870: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 40008874: 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); 40008878: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 4000887c: 80 88 80 01 btst %g2, %g1 40008880: 22 80 00 08 be,a 400088a0 <_Rate_monotonic_Timeout+0x58> 40008884: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 40008888: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 4000888c: c2 04 20 08 ld [ %l0 + 8 ], %g1 40008890: 80 a0 80 01 cmp %g2, %g1 40008894: 02 80 00 19 be 400088f8 <_Rate_monotonic_Timeout+0xb0> 40008898: 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 ) { 4000889c: c2 04 20 38 ld [ %l0 + 0x38 ], %g1 400088a0: 80 a0 60 01 cmp %g1, 1 400088a4: 02 80 00 09 be 400088c8 <_Rate_monotonic_Timeout+0x80> 400088a8: 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; 400088ac: 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; 400088b0: 03 10 00 7f sethi %hi(0x4001fc00), %g1 400088b4: c4 00 63 e8 ld [ %g1 + 0x3e8 ], %g2 ! 4001ffe8 <_Thread_Dispatch_disable_level> 400088b8: 84 00 bf ff add %g2, -1, %g2 400088bc: c4 20 63 e8 st %g2, [ %g1 + 0x3e8 ] 400088c0: 81 c7 e0 08 ret 400088c4: 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; 400088c8: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 400088cc: 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; 400088d0: c2 24 20 38 st %g1, [ %l0 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 400088d4: 7f ff fe 4c call 40008204 <_Rate_monotonic_Initiate_statistics> 400088d8: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 400088dc: c2 04 20 3c ld [ %l0 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 400088e0: 11 10 00 80 sethi %hi(0x40020000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 400088e4: c2 24 20 1c st %g1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 400088e8: 90 12 20 ac or %o0, 0xac, %o0 400088ec: 40 00 0f d1 call 4000c830 <_Watchdog_Insert> 400088f0: 92 04 20 10 add %l0, 0x10, %o1 400088f4: 30 bf ff ef b,a 400088b0 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 400088f8: 40 00 09 9c call 4000af68 <_Thread_Clear_state> 400088fc: 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 ); 40008900: 10 bf ff f5 b 400088d4 <_Rate_monotonic_Timeout+0x8c> 40008904: 90 10 00 10 mov %l0, %o0 =============================================================================== 400080b0 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 400080b0: 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; 400080b4: 07 10 00 58 sethi %hi(0x40016000), %g3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400080b8: 03 10 00 55 sethi %hi(0x40015400), %g1 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400080bc: da 00 e3 14 ld [ %g3 + 0x314 ], %o5 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 400080c0: c4 00 63 b4 ld [ %g1 + 0x3b4 ], %g2 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 400080c4: 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() ); 400080c8: 83 28 a0 02 sll %g2, 2, %g1 400080cc: 89 28 a0 07 sll %g2, 7, %g4 400080d0: 82 21 00 01 sub %g4, %g1, %g1 400080d4: 82 00 40 02 add %g1, %g2, %g1 400080d8: 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 ); 400080dc: 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; 400080e0: da 20 e3 14 st %o5, [ %g3 + 0x314 ] /* Update the timespec format uptime */ _Timestamp_Add_to( &_TOD_Uptime, &tick ); 400080e4: 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() ); 400080e8: c2 27 bf fc st %g1, [ %fp + -4 ] 400080ec: 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 ); 400080f0: 11 10 00 58 sethi %hi(0x40016000), %o0 400080f4: 40 00 08 9e call 4000a36c <_Timespec_Add_to> 400080f8: 90 12 22 54 or %o0, 0x254, %o0 ! 40016254 <_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 ); 400080fc: 92 10 00 10 mov %l0, %o1 40008100: 11 10 00 58 sethi %hi(0x40016000), %o0 40008104: 40 00 08 9a call 4000a36c <_Timespec_Add_to> 40008108: 90 12 22 60 or %o0, 0x260, %o0 ! 40016260 <_TOD_Now> while ( seconds ) { 4000810c: a0 92 20 00 orcc %o0, 0, %l0 40008110: 02 80 00 08 be 40008130 <_TOD_Tickle_ticks+0x80> 40008114: 23 10 00 58 sethi %hi(0x40016000), %l1 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 40008118: a2 14 62 90 or %l1, 0x290, %l1 ! 40016290 <_Watchdog_Seconds_chain> 4000811c: 40 00 0a 23 call 4000a9a8 <_Watchdog_Tickle> 40008120: 90 10 00 11 mov %l1, %o0 40008124: a0 84 3f ff addcc %l0, -1, %l0 40008128: 12 bf ff fd bne 4000811c <_TOD_Tickle_ticks+0x6c> <== NEVER TAKEN 4000812c: 01 00 00 00 nop 40008130: 81 c7 e0 08 ret 40008134: 81 e8 00 00 restore =============================================================================== 400081ac <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 400081ac: 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(); 400081b0: 03 10 00 7f sethi %hi(0x4001fc00), %g1 */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 400081b4: 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(); 400081b8: d2 00 62 24 ld [ %g1 + 0x224 ], %o1 if ((!the_tod) || 400081bc: 80 a4 20 00 cmp %l0, 0 400081c0: 02 80 00 2c be 40008270 <_TOD_Validate+0xc4> <== NEVER TAKEN 400081c4: b0 10 20 00 clr %i0 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 400081c8: 11 00 03 d0 sethi %hi(0xf4000), %o0 400081cc: 40 00 49 37 call 4001a6a8 <.udiv> 400081d0: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 400081d4: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 400081d8: 80 a2 00 01 cmp %o0, %g1 400081dc: 08 80 00 25 bleu 40008270 <_TOD_Validate+0xc4> 400081e0: 01 00 00 00 nop (the_tod->ticks >= ticks_per_second) || 400081e4: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 400081e8: 80 a0 60 3b cmp %g1, 0x3b 400081ec: 18 80 00 21 bgu 40008270 <_TOD_Validate+0xc4> 400081f0: 01 00 00 00 nop (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 400081f4: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 400081f8: 80 a0 60 3b cmp %g1, 0x3b 400081fc: 18 80 00 1d bgu 40008270 <_TOD_Validate+0xc4> 40008200: 01 00 00 00 nop (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 40008204: c2 04 20 0c ld [ %l0 + 0xc ], %g1 40008208: 80 a0 60 17 cmp %g1, 0x17 4000820c: 18 80 00 19 bgu 40008270 <_TOD_Validate+0xc4> 40008210: 01 00 00 00 nop (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 40008214: 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) || 40008218: 80 a0 60 00 cmp %g1, 0 4000821c: 02 80 00 15 be 40008270 <_TOD_Validate+0xc4> <== NEVER TAKEN 40008220: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 40008224: 18 80 00 13 bgu 40008270 <_TOD_Validate+0xc4> 40008228: 01 00 00 00 nop (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 4000822c: 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) || 40008230: 80 a0 a7 c3 cmp %g2, 0x7c3 40008234: 08 80 00 0f bleu 40008270 <_TOD_Validate+0xc4> 40008238: 01 00 00 00 nop (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 4000823c: 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) || 40008240: 80 a0 e0 00 cmp %g3, 0 40008244: 02 80 00 0b be 40008270 <_TOD_Validate+0xc4> <== NEVER TAKEN 40008248: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 4000824c: 32 80 00 0b bne,a 40008278 <_TOD_Validate+0xcc> 40008250: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 40008254: 82 00 60 0d add %g1, 0xd, %g1 40008258: 05 10 00 7a sethi %hi(0x4001e800), %g2 4000825c: 83 28 60 02 sll %g1, 2, %g1 40008260: 84 10 a2 f8 or %g2, 0x2f8, %g2 40008264: 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( 40008268: 80 a0 40 03 cmp %g1, %g3 4000826c: b0 60 3f ff subx %g0, -1, %i0 if ( the_tod->day > days_in_month ) return false; return true; } 40008270: 81 c7 e0 08 ret 40008274: 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 ]; 40008278: 05 10 00 7a sethi %hi(0x4001e800), %g2 4000827c: 84 10 a2 f8 or %g2, 0x2f8, %g2 ! 4001eaf8 <_TOD_Days_per_month> 40008280: 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( 40008284: 80 a0 40 03 cmp %g1, %g3 40008288: b0 60 3f ff subx %g0, -1, %i0 4000828c: 81 c7 e0 08 ret 40008290: 81 e8 00 00 restore =============================================================================== 40008f74 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 40008f74: 9d e3 bf a0 save %sp, -96, %sp */ /* * Save original state */ original_state = the_thread->current_state; 40008f78: 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 ); 40008f7c: 40 00 04 49 call 4000a0a0 <_Thread_Set_transient> 40008f80: 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 ) 40008f84: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 40008f88: 80 a0 40 19 cmp %g1, %i1 40008f8c: 02 80 00 05 be 40008fa0 <_Thread_Change_priority+0x2c> 40008f90: a0 10 00 18 mov %i0, %l0 _Thread_Set_priority( the_thread, new_priority ); 40008f94: 90 10 00 18 mov %i0, %o0 40008f98: 40 00 03 c6 call 40009eb0 <_Thread_Set_priority> 40008f9c: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 40008fa0: 7f ff e3 9b call 40001e0c 40008fa4: 01 00 00 00 nop 40008fa8: 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; 40008fac: f2 04 20 10 ld [ %l0 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 40008fb0: 80 a6 60 04 cmp %i1, 4 40008fb4: 02 80 00 18 be 40009014 <_Thread_Change_priority+0xa0> 40008fb8: 80 8c 60 04 btst 4, %l1 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 40008fbc: 02 80 00 0b be 40008fe8 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 40008fc0: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 40008fc4: 7f ff e3 96 call 40001e1c <== NOT EXECUTED 40008fc8: 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); 40008fcc: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 40008fd0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 40008fd4: 80 8e 40 01 btst %i1, %g1 <== NOT EXECUTED 40008fd8: 32 80 00 0d bne,a 4000900c <_Thread_Change_priority+0x98><== NOT EXECUTED 40008fdc: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 <== NOT EXECUTED 40008fe0: 81 c7 e0 08 ret 40008fe4: 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 ); 40008fe8: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _ISR_Enable( level ); 40008fec: 7f ff e3 8c call 40001e1c 40008ff0: 90 10 00 18 mov %i0, %o0 40008ff4: 03 00 00 ef sethi %hi(0x3bc00), %g1 40008ff8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 40008ffc: 80 8e 40 01 btst %i1, %g1 40009000: 02 bf ff f8 be 40008fe0 <_Thread_Change_priority+0x6c> 40009004: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 40009008: f0 04 20 44 ld [ %l0 + 0x44 ], %i0 4000900c: 40 00 03 79 call 40009df0 <_Thread_queue_Requeue> 40009010: 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 ) ) { 40009014: 12 80 00 14 bne 40009064 <_Thread_Change_priority+0xf0> <== NEVER TAKEN 40009018: 33 10 00 58 sethi %hi(0x40016000), %i1 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 4000901c: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 40009020: c4 14 20 96 lduh [ %l0 + 0x96 ], %g2 40009024: 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 ); 40009028: c0 24 20 10 clr [ %l0 + 0x10 ] 4000902c: 84 10 c0 02 or %g3, %g2, %g2 40009030: c4 30 40 00 sth %g2, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 40009034: c4 16 62 78 lduh [ %i1 + 0x278 ], %g2 40009038: c2 14 20 94 lduh [ %l0 + 0x94 ], %g1 _Priority_bit_map_Add( &the_thread->Priority_map ); if ( prepend_it ) 4000903c: 80 8e a0 ff btst 0xff, %i2 40009040: 82 10 80 01 or %g2, %g1, %g1 40009044: c2 36 62 78 sth %g1, [ %i1 + 0x278 ] 40009048: 02 80 00 47 be 40009164 <_Thread_Change_priority+0x1f0> 4000904c: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 40009050: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 40009054: c2 24 20 04 st %g1, [ %l0 + 4 ] before_node = after_node->next; after_node->next = the_node; 40009058: e0 20 40 00 st %l0, [ %g1 ] the_node->next = before_node; 4000905c: c4 24 00 00 st %g2, [ %l0 ] before_node->previous = the_node; 40009060: 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 ); 40009064: 7f ff e3 6e call 40001e1c 40009068: 90 10 00 18 mov %i0, %o0 4000906c: 7f ff e3 68 call 40001e0c 40009070: 01 00 00 00 nop RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40009074: c2 16 62 78 lduh [ %i1 + 0x278 ], %g1 */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) _Thread_Ready_chain[ _Priority_bit_map_Get_highest() ].first; 40009078: 05 10 00 58 sethi %hi(0x40016000), %g2 4000907c: 83 28 60 10 sll %g1, 0x10, %g1 40009080: da 00 a1 34 ld [ %g2 + 0x134 ], %o5 40009084: 85 30 60 10 srl %g1, 0x10, %g2 40009088: 80 a0 a0 ff cmp %g2, 0xff 4000908c: 08 80 00 26 bleu 40009124 <_Thread_Change_priority+0x1b0> 40009090: 07 10 00 53 sethi %hi(0x40014c00), %g3 40009094: 83 30 60 18 srl %g1, 0x18, %g1 40009098: 86 10 e2 58 or %g3, 0x258, %g3 4000909c: c4 08 c0 01 ldub [ %g3 + %g1 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 400090a0: 09 10 00 58 sethi %hi(0x40016000), %g4 400090a4: 85 28 a0 10 sll %g2, 0x10, %g2 400090a8: 88 11 22 f0 or %g4, 0x2f0, %g4 400090ac: 83 30 a0 0f srl %g2, 0xf, %g1 400090b0: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 400090b4: 83 28 60 10 sll %g1, 0x10, %g1 400090b8: 89 30 60 10 srl %g1, 0x10, %g4 400090bc: 80 a1 20 ff cmp %g4, 0xff 400090c0: 18 80 00 27 bgu 4000915c <_Thread_Change_priority+0x1e8> 400090c4: 83 30 60 18 srl %g1, 0x18, %g1 400090c8: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 400090cc: 82 00 60 08 add %g1, 8, %g1 return (_Priority_Bits_index( major ) << 4) + 400090d0: 85 30 a0 0c srl %g2, 0xc, %g2 _Priority_Bits_index( minor ); 400090d4: 83 28 60 10 sll %g1, 0x10, %g1 400090d8: 83 30 60 10 srl %g1, 0x10, %g1 400090dc: 82 00 40 02 add %g1, %g2, %g1 400090e0: 85 28 60 02 sll %g1, 2, %g2 400090e4: 83 28 60 04 sll %g1, 4, %g1 400090e8: 82 20 40 02 sub %g1, %g2, %g1 * ready thread. */ RTEMS_INLINE_ROUTINE void _Thread_Calculate_heir( void ) { _Thread_Heir = (Thread_Control *) 400090ec: c4 03 40 01 ld [ %o5 + %g1 ], %g2 400090f0: 03 10 00 59 sethi %hi(0x40016400), %g1 400090f4: 82 10 60 3c or %g1, 0x3c, %g1 ! 4001643c <_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 ); 400090f8: 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() && 400090fc: 80 a0 80 03 cmp %g2, %g3 40009100: 02 80 00 07 be 4000911c <_Thread_Change_priority+0x1a8> 40009104: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 40009108: c4 08 e0 74 ldub [ %g3 + 0x74 ], %g2 4000910c: 80 a0 a0 00 cmp %g2, 0 40009110: 02 80 00 03 be 4000911c <_Thread_Change_priority+0x1a8> 40009114: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 40009118: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 4000911c: 7f ff e3 40 call 40001e1c 40009120: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40009124: 86 10 e2 58 or %g3, 0x258, %g3 40009128: c4 08 c0 02 ldub [ %g3 + %g2 ], %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 4000912c: 09 10 00 58 sethi %hi(0x40016000), %g4 RTEMS_INLINE_ROUTINE Priority_Control _Priority_bit_map_Get_highest( void ) { Priority_bit_map_Control minor; Priority_bit_map_Control major; _Bitfield_Find_first_bit( _Priority_Major_bit_map, major ); 40009130: 84 00 a0 08 add %g2, 8, %g2 _Bitfield_Find_first_bit( _Priority_Bit_map[major], minor ); 40009134: 88 11 22 f0 or %g4, 0x2f0, %g4 40009138: 85 28 a0 10 sll %g2, 0x10, %g2 4000913c: 83 30 a0 0f srl %g2, 0xf, %g1 40009140: c2 11 00 01 lduh [ %g4 + %g1 ], %g1 40009144: 83 28 60 10 sll %g1, 0x10, %g1 40009148: 89 30 60 10 srl %g1, 0x10, %g4 4000914c: 80 a1 20 ff cmp %g4, 0xff 40009150: 28 bf ff df bleu,a 400090cc <_Thread_Change_priority+0x158> 40009154: c2 08 c0 04 ldub [ %g3 + %g4 ], %g1 40009158: 83 30 60 18 srl %g1, 0x18, %g1 4000915c: 10 bf ff dd b 400090d0 <_Thread_Change_priority+0x15c> 40009160: 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; 40009164: 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; 40009168: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 4000916c: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 40009170: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 40009174: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 40009178: 10 bf ff bb b 40009064 <_Thread_Change_priority+0xf0> 4000917c: c4 24 20 04 st %g2, [ %l0 + 4 ] =============================================================================== 40009180 <_Thread_Clear_state>: void _Thread_Clear_state( Thread_Control *the_thread, States_Control state ) { 40009180: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 40009184: 7f ff e3 22 call 40001e0c 40009188: a0 10 00 18 mov %i0, %l0 4000918c: b0 10 00 08 mov %o0, %i0 current_state = the_thread->current_state; 40009190: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & state ) { 40009194: 80 8e 40 01 btst %i1, %g1 40009198: 02 80 00 06 be 400091b0 <_Thread_Clear_state+0x30> 4000919c: 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); 400091a0: 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 ) ) { 400091a4: 80 a6 60 00 cmp %i1, 0 400091a8: 02 80 00 04 be 400091b8 <_Thread_Clear_state+0x38> 400091ac: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; } } } _ISR_Enable( level ); 400091b0: 7f ff e3 1b call 40001e1c 400091b4: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 400091b8: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 400091bc: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 400091c0: c8 10 40 00 lduh [ %g1 ], %g4 _Priority_Major_bit_map |= the_priority_map->ready_major; 400091c4: 05 10 00 58 sethi %hi(0x40016000), %g2 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 400091c8: 86 11 00 03 or %g4, %g3, %g3 400091cc: c6 30 40 00 sth %g3, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 400091d0: c8 10 a2 78 lduh [ %g2 + 0x278 ], %g4 400091d4: c6 14 20 94 lduh [ %l0 + 0x94 ], %g3 if ( _States_Is_ready( current_state ) ) { _Priority_bit_map_Add( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 400091d8: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 400091dc: 86 11 00 03 or %g4, %g3, %g3 400091e0: c6 30 a2 78 sth %g3, [ %g2 + 0x278 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 400091e4: 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; 400091e8: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 400091ec: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 400091f0: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 400091f4: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 400091f8: c4 24 20 04 st %g2, [ %l0 + 4 ] _ISR_Flash( level ); 400091fc: 7f ff e3 08 call 40001e1c 40009200: 01 00 00 00 nop 40009204: 7f ff e3 02 call 40001e0c 40009208: 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 ) { 4000920c: 03 10 00 59 sethi %hi(0x40016400), %g1 40009210: 82 10 60 3c or %g1, 0x3c, %g1 ! 4001643c <_Per_CPU_Information> 40009214: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 40009218: c4 04 20 14 ld [ %l0 + 0x14 ], %g2 4000921c: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 40009220: 80 a0 80 03 cmp %g2, %g3 40009224: 1a bf ff e3 bcc 400091b0 <_Thread_Clear_state+0x30> 40009228: 01 00 00 00 nop _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000922c: 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; 40009230: e0 20 60 10 st %l0, [ %g1 + 0x10 ] if ( _Thread_Executing->is_preemptible || 40009234: c6 08 e0 74 ldub [ %g3 + 0x74 ], %g3 40009238: 80 a0 e0 00 cmp %g3, 0 4000923c: 32 80 00 05 bne,a 40009250 <_Thread_Clear_state+0xd0> 40009240: 84 10 20 01 mov 1, %g2 40009244: 80 a0 a0 00 cmp %g2, 0 40009248: 12 bf ff da bne 400091b0 <_Thread_Clear_state+0x30> <== ALWAYS TAKEN 4000924c: 84 10 20 01 mov 1, %g2 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 40009250: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] } } } _ISR_Enable( level ); 40009254: 7f ff e2 f2 call 40001e1c 40009258: 81 e8 00 00 restore =============================================================================== 400093d0 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 400093d0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 400093d4: 90 10 00 18 mov %i0, %o0 400093d8: 40 00 00 6c call 40009588 <_Thread_Get> 400093dc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 400093e0: c2 07 bf fc ld [ %fp + -4 ], %g1 400093e4: 80 a0 60 00 cmp %g1, 0 400093e8: 12 80 00 08 bne 40009408 <_Thread_Delay_ended+0x38> <== NEVER TAKEN 400093ec: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 400093f0: 7f ff ff 64 call 40009180 <_Thread_Clear_state> 400093f4: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 400093f8: 03 10 00 58 sethi %hi(0x40016000), %g1 400093fc: c4 00 61 d8 ld [ %g1 + 0x1d8 ], %g2 ! 400161d8 <_Thread_Dispatch_disable_level> 40009400: 84 00 bf ff add %g2, -1, %g2 40009404: c4 20 61 d8 st %g2, [ %g1 + 0x1d8 ] 40009408: 81 c7 e0 08 ret 4000940c: 81 e8 00 00 restore =============================================================================== 40009410 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 40009410: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 40009414: 25 10 00 59 sethi %hi(0x40016400), %l2 40009418: a4 14 a0 3c or %l2, 0x3c, %l2 ! 4001643c <_Per_CPU_Information> _ISR_Disable( level ); 4000941c: 7f ff e2 7c call 40001e0c 40009420: e2 04 a0 0c ld [ %l2 + 0xc ], %l1 while ( _Thread_Dispatch_necessary == true ) { 40009424: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 40009428: 80 a0 60 00 cmp %g1, 0 4000942c: 02 80 00 42 be 40009534 <_Thread_Dispatch+0x124> 40009430: 2d 10 00 58 sethi %hi(0x40016000), %l6 heir = _Thread_Heir; 40009434: e0 04 a0 10 ld [ %l2 + 0x10 ], %l0 _Thread_Dispatch_disable_level = 1; 40009438: 82 10 20 01 mov 1, %g1 4000943c: c2 25 a1 d8 st %g1, [ %l6 + 0x1d8 ] _Thread_Dispatch_necessary = false; 40009440: 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 ) 40009444: 80 a4 40 10 cmp %l1, %l0 40009448: 02 80 00 3b be 40009534 <_Thread_Dispatch+0x124> 4000944c: e0 24 a0 0c st %l0, [ %l2 + 0xc ] 40009450: 27 10 00 58 sethi %hi(0x40016000), %l3 40009454: 3b 10 00 58 sethi %hi(0x40016000), %i5 40009458: a6 14 e2 88 or %l3, 0x288, %l3 4000945c: aa 07 bf f8 add %fp, -8, %l5 40009460: a8 07 bf f0 add %fp, -16, %l4 40009464: ba 17 62 5c or %i5, 0x25c, %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; 40009468: 37 10 00 58 sethi %hi(0x40016000), %i3 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 4000946c: ae 10 00 13 mov %l3, %l7 executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { heir = _Thread_Heir; _Thread_Dispatch_disable_level = 1; 40009470: 10 80 00 2b b 4000951c <_Thread_Dispatch+0x10c> 40009474: 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 ); 40009478: 7f ff e2 69 call 40001e1c 4000947c: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 40009480: 40 00 0e a0 call 4000cf00 <_TOD_Get_uptime> 40009484: 90 10 00 15 mov %l5, %o0 _Timestamp_Subtract( 40009488: 90 10 00 17 mov %l7, %o0 4000948c: 92 10 00 15 mov %l5, %o1 40009490: 40 00 03 d0 call 4000a3d0 <_Timespec_Subtract> 40009494: 94 10 00 14 mov %l4, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 40009498: 92 10 00 14 mov %l4, %o1 4000949c: 40 00 03 b4 call 4000a36c <_Timespec_Add_to> 400094a0: 90 04 60 84 add %l1, 0x84, %o0 _Thread_Time_of_last_context_switch = uptime; 400094a4: c4 07 bf f8 ld [ %fp + -8 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 400094a8: 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; 400094ac: c4 24 c0 00 st %g2, [ %l3 ] 400094b0: 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 ); 400094b4: 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; 400094b8: c4 24 e0 04 st %g2, [ %l3 + 4 ] #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 400094bc: 80 a0 60 00 cmp %g1, 0 400094c0: 02 80 00 06 be 400094d8 <_Thread_Dispatch+0xc8> <== NEVER TAKEN 400094c4: 92 10 00 10 mov %l0, %o1 executing->libc_reent = *_Thread_libc_reent; 400094c8: c4 00 40 00 ld [ %g1 ], %g2 400094cc: c4 24 61 58 st %g2, [ %l1 + 0x158 ] *_Thread_libc_reent = heir->libc_reent; 400094d0: c4 04 21 58 ld [ %l0 + 0x158 ], %g2 400094d4: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 400094d8: 40 00 04 82 call 4000a6e0 <_User_extensions_Thread_switch> 400094dc: 01 00 00 00 nop if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 400094e0: 90 04 60 d0 add %l1, 0xd0, %o0 400094e4: 40 00 05 96 call 4000ab3c <_CPU_Context_switch> 400094e8: 92 04 20 d0 add %l0, 0xd0, %o1 #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 400094ec: 7f ff e2 48 call 40001e0c 400094f0: e2 04 a0 0c ld [ %l2 + 0xc ], %l1 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 400094f4: c2 0c a0 18 ldub [ %l2 + 0x18 ], %g1 400094f8: 80 a0 60 00 cmp %g1, 0 400094fc: 02 80 00 0e be 40009534 <_Thread_Dispatch+0x124> 40009500: 01 00 00 00 nop heir = _Thread_Heir; 40009504: e0 04 a0 10 ld [ %l2 + 0x10 ], %l0 _Thread_Dispatch_disable_level = 1; 40009508: f8 25 a1 d8 st %i4, [ %l6 + 0x1d8 ] _Thread_Dispatch_necessary = false; 4000950c: 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 ) 40009510: 80 a4 00 11 cmp %l0, %l1 40009514: 02 80 00 08 be 40009534 <_Thread_Dispatch+0x124> <== NEVER TAKEN 40009518: 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 ) 4000951c: c2 04 20 7c ld [ %l0 + 0x7c ], %g1 40009520: 80 a0 60 01 cmp %g1, 1 40009524: 12 bf ff d5 bne 40009478 <_Thread_Dispatch+0x68> 40009528: c2 06 e1 38 ld [ %i3 + 0x138 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000952c: 10 bf ff d3 b 40009478 <_Thread_Dispatch+0x68> 40009530: c2 24 20 78 st %g1, [ %l0 + 0x78 ] _ISR_Disable( level ); } post_switch: _Thread_Dispatch_disable_level = 0; 40009534: c0 25 a1 d8 clr [ %l6 + 0x1d8 ] _ISR_Enable( level ); 40009538: 7f ff e2 39 call 40001e1c 4000953c: 01 00 00 00 nop _API_extensions_Run_postswitch(); 40009540: 7f ff f9 36 call 40007a18 <_API_extensions_Run_postswitch> 40009544: 01 00 00 00 nop } 40009548: 81 c7 e0 08 ret 4000954c: 81 e8 00 00 restore =============================================================================== 40009588 <_Thread_Get>: */ Thread_Control *_Thread_Get ( Objects_Id id, Objects_Locations *location ) { 40009588: 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 ) ) { 4000958c: 80 a2 20 00 cmp %o0, 0 40009590: 02 80 00 1d be 40009604 <_Thread_Get+0x7c> 40009594: 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); 40009598: 85 32 20 18 srl %o0, 0x18, %g2 4000959c: 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 ) 400095a0: 86 00 bf ff add %g2, -1, %g3 400095a4: 80 a0 e0 02 cmp %g3, 2 400095a8: 38 80 00 14 bgu,a 400095f8 <_Thread_Get+0x70> 400095ac: 82 10 20 01 mov 1, %g1 */ RTEMS_INLINE_ROUTINE uint32_t _Objects_Get_class( Objects_Id id ) { return (uint32_t) 400095b0: 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 :) */ 400095b4: 80 a1 20 01 cmp %g4, 1 400095b8: 32 80 00 10 bne,a 400095f8 <_Thread_Get+0x70> 400095bc: 82 10 20 01 mov 1, %g1 *location = OBJECTS_ERROR; goto done; } api_information = _Objects_Information_table[ the_api ]; 400095c0: 85 28 a0 02 sll %g2, 2, %g2 400095c4: 07 10 00 58 sethi %hi(0x40016000), %g3 400095c8: 86 10 e1 3c or %g3, 0x13c, %g3 ! 4001613c <_Objects_Information_table> 400095cc: c4 00 c0 02 ld [ %g3 + %g2 ], %g2 /* * There is no way for this to happen if POSIX is enabled. */ #if !defined(RTEMS_POSIX_API) if ( !api_information ) { 400095d0: 80 a0 a0 00 cmp %g2, 0 400095d4: 22 80 00 16 be,a 4000962c <_Thread_Get+0xa4> <== NEVER TAKEN 400095d8: c8 22 80 00 st %g4, [ %o2 ] <== NOT EXECUTED *location = OBJECTS_ERROR; goto done; } #endif information = api_information[ the_class ]; 400095dc: d0 00 a0 04 ld [ %g2 + 4 ], %o0 if ( !information ) { 400095e0: 80 a2 20 00 cmp %o0, 0 400095e4: 02 80 00 10 be 40009624 <_Thread_Get+0x9c> 400095e8: 92 10 00 01 mov %g1, %o1 *location = OBJECTS_ERROR; goto done; } tp = (Thread_Control *) _Objects_Get( information, id, location ); 400095ec: 82 13 c0 00 mov %o7, %g1 400095f0: 7f ff fd 5f call 40008b6c <_Objects_Get> 400095f4: 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; 400095f8: 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; 400095fc: 81 c3 e0 08 retl 40009600: c2 22 80 00 st %g1, [ %o2 ] rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 40009604: 03 10 00 58 sethi %hi(0x40016000), %g1 40009608: c4 00 61 d8 ld [ %g1 + 0x1d8 ], %g2 ! 400161d8 <_Thread_Dispatch_disable_level> 4000960c: 84 00 a0 01 inc %g2 40009610: c4 20 61 d8 st %g2, [ %g1 + 0x1d8 ] 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; 40009614: 03 10 00 59 sethi %hi(0x40016400), %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; 40009618: c0 22 40 00 clr [ %o1 ] tp = _Thread_Executing; goto done; 4000961c: 81 c3 e0 08 retl 40009620: d0 00 60 48 ld [ %g1 + 0x48 ], %o0 #endif information = api_information[ the_class ]; if ( !information ) { *location = OBJECTS_ERROR; goto done; 40009624: 81 c3 e0 08 retl 40009628: c8 22 80 00 st %g4, [ %o2 ] * There is no way for this to happen if POSIX is enabled. */ #if !defined(RTEMS_POSIX_API) if ( !api_information ) { *location = OBJECTS_ERROR; goto done; 4000962c: 81 c3 e0 08 retl <== NOT EXECUTED 40009630: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 4000ee74 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 4000ee74: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 4000ee78: 03 10 00 59 sethi %hi(0x40016400), %g1 4000ee7c: e0 00 60 48 ld [ %g1 + 0x48 ], %l0 ! 40016448 <_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(); 4000ee80: 3f 10 00 3b sethi %hi(0x4000ec00), %i7 4000ee84: be 17 e2 74 or %i7, 0x274, %i7 ! 4000ee74 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 4000ee88: d0 04 20 b8 ld [ %l0 + 0xb8 ], %o0 _ISR_Set_level(level); 4000ee8c: 7f ff cb e4 call 40001e1c 4000ee90: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 4000ee94: 03 10 00 57 sethi %hi(0x40015c00), %g1 doneConstructors = 1; 4000ee98: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 4000ee9c: e2 08 62 5c ldub [ %g1 + 0x25c ], %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 ); 4000eea0: 90 10 00 10 mov %l0, %o0 4000eea4: 7f ff ed 8f call 4000a4e0 <_User_extensions_Thread_begin> 4000eea8: c4 28 62 5c stb %g2, [ %g1 + 0x25c ] /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 4000eeac: 7f ff e9 a9 call 40009550 <_Thread_Enable_dispatch> 4000eeb0: 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) */ { 4000eeb4: 80 a4 60 00 cmp %l1, 0 4000eeb8: 02 80 00 0c be 4000eee8 <_Thread_Handler+0x74> 4000eebc: 01 00 00 00 nop INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000eec0: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 4000eec4: 80 a0 60 00 cmp %g1, 0 4000eec8: 22 80 00 0f be,a 4000ef04 <_Thread_Handler+0x90> <== ALWAYS TAKEN 4000eecc: 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 ); 4000eed0: 7f ff ed 98 call 4000a530 <_User_extensions_Thread_exitted> 4000eed4: 90 10 00 10 mov %l0, %o0 _Internal_error_Occurred( 4000eed8: 90 10 20 00 clr %o0 4000eedc: 92 10 20 01 mov 1, %o1 4000eee0: 7f ff e5 a1 call 40008564 <_Internal_error_Occurred> 4000eee4: 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 (); 4000eee8: 40 00 19 f0 call 400156a8 <_init> 4000eeec: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 4000eef0: c2 04 20 a0 ld [ %l0 + 0xa0 ], %g1 4000eef4: 80 a0 60 00 cmp %g1, 0 4000eef8: 12 bf ff f6 bne 4000eed0 <_Thread_Handler+0x5c> <== NEVER TAKEN 4000eefc: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 4000ef00: c2 04 20 9c ld [ %l0 + 0x9c ], %g1 4000ef04: 9f c0 40 00 call %g1 4000ef08: d0 04 20 a8 ld [ %l0 + 0xa8 ], %o0 INIT_NAME (); } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 4000ef0c: 10 bf ff f1 b 4000eed0 <_Thread_Handler+0x5c> 4000ef10: d0 24 20 28 st %o0, [ %l0 + 0x28 ] =============================================================================== 40009634 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 40009634: 9d e3 bf a0 save %sp, -96, %sp 40009638: c2 07 a0 6c ld [ %fp + 0x6c ], %g1 4000963c: e0 0f a0 5f ldub [ %fp + 0x5f ], %l0 40009640: 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; 40009644: c0 26 61 5c clr [ %i1 + 0x15c ] 40009648: c0 26 61 60 clr [ %i1 + 0x160 ] extensions_area = NULL; the_thread->libc_reent = NULL; 4000964c: 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 ); 40009650: 90 10 00 19 mov %i1, %o0 40009654: 40 00 02 b7 call 4000a130 <_Thread_Stack_Allocate> 40009658: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 4000965c: 80 a2 00 1b cmp %o0, %i3 40009660: 0a 80 00 49 bcs 40009784 <_Thread_Initialize+0x150> 40009664: 80 a2 20 00 cmp %o0, 0 40009668: 02 80 00 47 be 40009784 <_Thread_Initialize+0x150> <== NEVER TAKEN 4000966c: 25 10 00 58 sethi %hi(0x40016000), %l2 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 40009670: c4 06 60 c8 ld [ %i1 + 0xc8 ], %g2 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 40009674: c2 04 a2 68 ld [ %l2 + 0x268 ], %g1 40009678: c4 26 60 c4 st %g2, [ %i1 + 0xc4 ] the_stack->size = size; 4000967c: d0 26 60 c0 st %o0, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 40009680: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 40009684: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 40009688: c0 26 60 68 clr [ %i1 + 0x68 ] 4000968c: 80 a0 60 00 cmp %g1, 0 40009690: 12 80 00 40 bne 40009790 <_Thread_Initialize+0x15c> 40009694: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 40009698: 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; 4000969c: b6 10 20 00 clr %i3 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400096a0: 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 ); 400096a4: 90 10 00 19 mov %i1, %o0 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400096a8: c2 26 60 b0 st %g1, [ %i1 + 0xb0 ] the_thread->Start.budget_callout = budget_callout; 400096ac: 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 ); 400096b0: 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; 400096b4: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 400096b8: 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; 400096bc: fa 26 60 18 st %i5, [ %i1 + 0x18 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 400096c0: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ] the_thread->current_state = STATES_DORMANT; 400096c4: 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; 400096c8: fa 26 60 bc st %i5, [ %i1 + 0xbc ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 400096cc: c2 26 60 10 st %g1, [ %i1 + 0x10 ] /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 400096d0: 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; 400096d4: 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 ); 400096d8: 40 00 01 f6 call 40009eb0 <_Thread_Set_priority> 400096dc: c0 26 60 1c clr [ %i1 + 0x1c ] _Thread_Stack_Free( the_thread ); return false; } 400096e0: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 400096e4: 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 ); 400096e8: c0 26 60 84 clr [ %i1 + 0x84 ] 400096ec: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 400096f0: 83 28 60 02 sll %g1, 2, %g1 400096f4: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 400096f8: 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 ); 400096fc: 90 10 00 19 mov %i1, %o0 40009700: 40 00 03 b3 call 4000a5cc <_User_extensions_Thread_create> 40009704: b0 10 20 01 mov 1, %i0 if ( extension_status ) 40009708: 80 8a 20 ff btst 0xff, %o0 4000970c: 12 80 00 1f bne 40009788 <_Thread_Initialize+0x154> 40009710: 01 00 00 00 nop return true; failed: if ( the_thread->libc_reent ) 40009714: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 40009718: 80 a2 20 00 cmp %o0, 0 4000971c: 22 80 00 05 be,a 40009730 <_Thread_Initialize+0xfc> 40009720: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( the_thread->libc_reent ); 40009724: 40 00 04 f0 call 4000aae4 <_Workspace_Free> 40009728: 01 00 00 00 nop for ( i=0 ; i <= THREAD_API_LAST ; i++ ) if ( the_thread->API_Extensions[i] ) 4000972c: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 40009730: 80 a2 20 00 cmp %o0, 0 40009734: 22 80 00 05 be,a 40009748 <_Thread_Initialize+0x114> 40009738: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 _Workspace_Free( the_thread->API_Extensions[i] ); 4000973c: 40 00 04 ea call 4000aae4 <_Workspace_Free> 40009740: 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] ) 40009744: d0 06 61 60 ld [ %i1 + 0x160 ], %o0 40009748: 80 a2 20 00 cmp %o0, 0 4000974c: 02 80 00 05 be 40009760 <_Thread_Initialize+0x12c> <== ALWAYS TAKEN 40009750: 80 a6 e0 00 cmp %i3, 0 _Workspace_Free( the_thread->API_Extensions[i] ); 40009754: 40 00 04 e4 call 4000aae4 <_Workspace_Free> <== NOT EXECUTED 40009758: 01 00 00 00 nop <== NOT EXECUTED if ( extensions_area ) 4000975c: 80 a6 e0 00 cmp %i3, 0 <== NOT EXECUTED 40009760: 02 80 00 05 be 40009774 <_Thread_Initialize+0x140> 40009764: 90 10 00 19 mov %i1, %o0 (void) _Workspace_Free( extensions_area ); 40009768: 40 00 04 df call 4000aae4 <_Workspace_Free> 4000976c: 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 ); 40009770: 90 10 00 19 mov %i1, %o0 40009774: 40 00 02 8a call 4000a19c <_Thread_Stack_Free> 40009778: b0 10 20 00 clr %i0 return false; 4000977c: 81 c7 e0 08 ret 40009780: 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 */ 40009784: b0 10 20 00 clr %i0 _Thread_Stack_Free( the_thread ); return false; } 40009788: 81 c7 e0 08 ret 4000978c: 81 e8 00 00 restore /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 40009790: 82 00 60 01 inc %g1 40009794: 40 00 04 cb call 4000aac0 <_Workspace_Allocate> 40009798: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 4000979c: b6 92 20 00 orcc %o0, 0, %i3 400097a0: 02 bf ff dd be 40009714 <_Thread_Initialize+0xe0> 400097a4: c6 04 a2 68 ld [ %l2 + 0x268 ], %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 400097a8: 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++ ) 400097ac: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 400097b0: 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; 400097b4: 85 28 a0 02 sll %g2, 2, %g2 400097b8: 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++ ) 400097bc: 82 00 60 01 inc %g1 400097c0: 80 a0 40 03 cmp %g1, %g3 400097c4: 08 bf ff fc bleu 400097b4 <_Thread_Initialize+0x180> 400097c8: 84 10 00 01 mov %g1, %g2 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; 400097cc: 10 bf ff b6 b 400096a4 <_Thread_Initialize+0x70> 400097d0: c2 07 a0 60 ld [ %fp + 0x60 ], %g1 =============================================================================== 4000da9c <_Thread_Resume>: void _Thread_Resume( Thread_Control *the_thread, bool force ) { 4000da9c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; States_Control current_state; _ISR_Disable( level ); 4000daa0: 7f ff d1 20 call 40001f20 4000daa4: a0 10 00 18 mov %i0, %l0 4000daa8: b0 10 00 08 mov %o0, %i0 current_state = the_thread->current_state; 4000daac: c2 04 20 10 ld [ %l0 + 0x10 ], %g1 if ( current_state & STATES_SUSPENDED ) { 4000dab0: 80 88 60 02 btst 2, %g1 4000dab4: 02 80 00 05 be 4000dac8 <_Thread_Resume+0x2c> <== NEVER TAKEN 4000dab8: 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 ) ) { 4000dabc: 80 a0 60 00 cmp %g1, 0 4000dac0: 02 80 00 04 be 4000dad0 <_Thread_Resume+0x34> 4000dac4: c2 24 20 10 st %g1, [ %l0 + 0x10 ] _Thread_Dispatch_necessary = true; } } } _ISR_Enable( level ); 4000dac8: 7f ff d1 1a call 40001f30 4000dacc: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 4000dad0: c2 04 20 90 ld [ %l0 + 0x90 ], %g1 4000dad4: c6 14 20 96 lduh [ %l0 + 0x96 ], %g3 4000dad8: c8 10 40 00 lduh [ %g1 ], %g4 _Priority_Major_bit_map |= the_priority_map->ready_major; 4000dadc: 05 10 00 69 sethi %hi(0x4001a400), %g2 RTEMS_INLINE_ROUTINE void _Priority_bit_map_Add ( Priority_bit_map_Information *the_priority_map ) { *the_priority_map->minor |= the_priority_map->ready_minor; 4000dae0: 86 11 00 03 or %g4, %g3, %g3 4000dae4: c6 30 40 00 sth %g3, [ %g1 ] _Priority_Major_bit_map |= the_priority_map->ready_major; 4000dae8: c8 10 a3 b8 lduh [ %g2 + 0x3b8 ], %g4 4000daec: c6 14 20 94 lduh [ %l0 + 0x94 ], %g3 if ( _States_Is_ready( current_state ) ) { _Priority_bit_map_Add( &the_thread->Priority_map ); _Chain_Append_unprotected(the_thread->ready, &the_thread->Object.Node); 4000daf0: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 4000daf4: 86 11 00 03 or %g4, %g3, %g3 4000daf8: c6 30 a3 b8 sth %g3, [ %g2 + 0x3b8 ] ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); old_last_node = the_chain->last; 4000dafc: 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; 4000db00: 86 00 60 04 add %g1, 4, %g3 Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 4000db04: c6 24 00 00 st %g3, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 4000db08: e0 20 60 08 st %l0, [ %g1 + 8 ] old_last_node->next = the_node; 4000db0c: e0 20 80 00 st %l0, [ %g2 ] the_node->previous = old_last_node; 4000db10: c4 24 20 04 st %g2, [ %l0 + 4 ] _ISR_Flash( level ); 4000db14: 7f ff d1 07 call 40001f30 4000db18: 01 00 00 00 nop 4000db1c: 7f ff d1 01 call 40001f20 4000db20: 01 00 00 00 nop if ( the_thread->current_priority < _Thread_Heir->current_priority ) { 4000db24: 03 10 00 6a sethi %hi(0x4001a800), %g1 4000db28: 82 10 61 7c or %g1, 0x17c, %g1 ! 4001a97c <_Per_CPU_Information> 4000db2c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 4000db30: c4 04 20 14 ld [ %l0 + 0x14 ], %g2 4000db34: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3 4000db38: 80 a0 80 03 cmp %g2, %g3 4000db3c: 1a bf ff e3 bcc 4000dac8 <_Thread_Resume+0x2c> 4000db40: 01 00 00 00 nop _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 4000db44: 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; 4000db48: e0 20 60 10 st %l0, [ %g1 + 0x10 ] if ( _Thread_Executing->is_preemptible || 4000db4c: c6 08 e0 74 ldub [ %g3 + 0x74 ], %g3 4000db50: 80 a0 e0 00 cmp %g3, 0 4000db54: 32 80 00 05 bne,a 4000db68 <_Thread_Resume+0xcc> 4000db58: 84 10 20 01 mov 1, %g2 4000db5c: 80 a0 a0 00 cmp %g2, 0 4000db60: 12 bf ff da bne 4000dac8 <_Thread_Resume+0x2c> <== ALWAYS TAKEN 4000db64: 84 10 20 01 mov 1, %g2 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 4000db68: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] } } } _ISR_Enable( level ); 4000db6c: 7f ff d0 f1 call 40001f30 4000db70: 81 e8 00 00 restore =============================================================================== 4000a2c8 <_Thread_Yield_processor>: * ready chain * select heir */ void _Thread_Yield_processor( void ) { 4000a2c8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing; Chain_Control *ready; executing = _Thread_Executing; 4000a2cc: 25 10 00 59 sethi %hi(0x40016400), %l2 4000a2d0: a4 14 a0 3c or %l2, 0x3c, %l2 ! 4001643c <_Per_CPU_Information> 4000a2d4: e0 04 a0 0c ld [ %l2 + 0xc ], %l0 ready = executing->ready; _ISR_Disable( level ); 4000a2d8: 7f ff de cd call 40001e0c 4000a2dc: e2 04 20 8c ld [ %l0 + 0x8c ], %l1 4000a2e0: b0 10 00 08 mov %o0, %i0 } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; _ISR_Enable( level ); } 4000a2e4: 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 ) ) { 4000a2e8: c4 04 40 00 ld [ %l1 ], %g2 4000a2ec: 80 a0 80 01 cmp %g2, %g1 4000a2f0: 02 80 00 14 be 4000a340 <_Thread_Yield_processor+0x78> 4000a2f4: 88 04 60 04 add %l1, 4, %g4 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 4000a2f8: c4 1c 00 00 ldd [ %l0 ], %g2 next->previous = previous; previous->next = next; 4000a2fc: c4 20 c0 00 st %g2, [ %g3 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 4000a300: c6 20 a0 04 st %g3, [ %g2 + 4 ] Chain_Node *the_node ) { Chain_Node *old_last_node; the_node->next = _Chain_Tail(the_chain); 4000a304: c8 24 00 00 st %g4, [ %l0 ] old_last_node = the_chain->last; the_chain->last = the_node; 4000a308: e0 24 60 08 st %l0, [ %l1 + 8 ] old_last_node->next = the_node; 4000a30c: e0 20 40 00 st %l0, [ %g1 ] the_node->previous = old_last_node; 4000a310: c2 24 20 04 st %g1, [ %l0 + 4 ] _Chain_Extract_unprotected( &executing->Object.Node ); _Chain_Append_unprotected( ready, &executing->Object.Node ); _ISR_Flash( level ); 4000a314: 7f ff de c2 call 40001e1c 4000a318: 01 00 00 00 nop 4000a31c: 7f ff de bc call 40001e0c 4000a320: 01 00 00 00 nop if ( _Thread_Is_heir( executing ) ) 4000a324: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 4000a328: 80 a4 00 01 cmp %l0, %g1 4000a32c: 02 80 00 0b be 4000a358 <_Thread_Yield_processor+0x90> <== ALWAYS TAKEN 4000a330: 82 10 20 01 mov 1, %g1 _Thread_Heir = (Thread_Control *) ready->first; _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 4000a334: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED _ISR_Enable( level ); 4000a338: 7f ff de b9 call 40001e1c 4000a33c: 81 e8 00 00 restore if ( _Thread_Is_heir( executing ) ) _Thread_Heir = (Thread_Control *) ready->first; _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) 4000a340: c2 04 a0 10 ld [ %l2 + 0x10 ], %g1 4000a344: 80 a4 00 01 cmp %l0, %g1 4000a348: 02 bf ff fc be 4000a338 <_Thread_Yield_processor+0x70> <== ALWAYS TAKEN 4000a34c: 82 10 20 01 mov 1, %g1 _Thread_Dispatch_necessary = true; 4000a350: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] <== NOT EXECUTED 4000a354: 30 bf ff f9 b,a 4000a338 <_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; 4000a358: c2 04 40 00 ld [ %l1 ], %g1 4000a35c: c2 24 a0 10 st %g1, [ %l2 + 0x10 ] _Thread_Dispatch_necessary = true; } else if ( !_Thread_Is_heir( executing ) ) _Thread_Dispatch_necessary = true; 4000a360: 82 10 20 01 mov 1, %g1 4000a364: c2 2c a0 18 stb %g1, [ %l2 + 0x18 ] 4000a368: 30 bf ff f4 b,a 4000a338 <_Thread_Yield_processor+0x70> =============================================================================== 40009df0 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 40009df0: 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 ) 40009df4: 80 a6 20 00 cmp %i0, 0 40009df8: 02 80 00 13 be 40009e44 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 40009dfc: 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 ) { 40009e00: e2 06 20 34 ld [ %i0 + 0x34 ], %l1 40009e04: 80 a4 60 01 cmp %l1, 1 40009e08: 02 80 00 04 be 40009e18 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 40009e0c: 01 00 00 00 nop 40009e10: 81 c7 e0 08 ret <== NOT EXECUTED 40009e14: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 40009e18: 7f ff df fd call 40001e0c 40009e1c: 01 00 00 00 nop 40009e20: a0 10 00 08 mov %o0, %l0 40009e24: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 40009e28: 03 00 00 ef sethi %hi(0x3bc00), %g1 40009e2c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 40009e30: 80 88 80 01 btst %g2, %g1 40009e34: 12 80 00 06 bne 40009e4c <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 40009e38: 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 ); 40009e3c: 7f ff df f8 call 40001e1c 40009e40: 90 10 00 10 mov %l0, %o0 40009e44: 81 c7 e0 08 ret 40009e48: 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 ); 40009e4c: 92 10 00 19 mov %i1, %o1 40009e50: 94 10 20 01 mov 1, %o2 40009e54: 40 00 0d a0 call 4000d4d4 <_Thread_queue_Extract_priority_helper> 40009e58: e2 26 20 30 st %l1, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 40009e5c: 90 10 00 18 mov %i0, %o0 40009e60: 92 10 00 19 mov %i1, %o1 40009e64: 7f ff ff 2b call 40009b10 <_Thread_queue_Enqueue_priority> 40009e68: 94 07 bf fc add %fp, -4, %o2 40009e6c: 30 bf ff f4 b,a 40009e3c <_Thread_queue_Requeue+0x4c> =============================================================================== 40009e70 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 40009e70: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 40009e74: 90 10 00 18 mov %i0, %o0 40009e78: 7f ff fd c4 call 40009588 <_Thread_Get> 40009e7c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40009e80: c2 07 bf fc ld [ %fp + -4 ], %g1 40009e84: 80 a0 60 00 cmp %g1, 0 40009e88: 12 80 00 08 bne 40009ea8 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN 40009e8c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 40009e90: 40 00 0d ca call 4000d5b8 <_Thread_queue_Process_timeout> 40009e94: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void ) { RTEMS_COMPILER_MEMORY_BARRIER(); _Thread_Dispatch_disable_level -= 1; 40009e98: 03 10 00 58 sethi %hi(0x40016000), %g1 40009e9c: c4 00 61 d8 ld [ %g1 + 0x1d8 ], %g2 ! 400161d8 <_Thread_Dispatch_disable_level> 40009ea0: 84 00 bf ff add %g2, -1, %g2 40009ea4: c4 20 61 d8 st %g2, [ %g1 + 0x1d8 ] 40009ea8: 81 c7 e0 08 ret 40009eac: 81 e8 00 00 restore =============================================================================== 40017368 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 40017368: 9d e3 bf 88 save %sp, -120, %sp 4001736c: 2d 10 00 f9 sethi %hi(0x4003e400), %l6 40017370: ba 07 bf f4 add %fp, -12, %i5 40017374: a8 07 bf f8 add %fp, -8, %l4 40017378: a4 07 bf e8 add %fp, -24, %l2 4001737c: ae 07 bf ec add %fp, -20, %l7 40017380: 2b 10 00 f8 sethi %hi(0x4003e000), %l5 40017384: 39 10 00 f8 sethi %hi(0x4003e000), %i4 */ RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { the_chain->first = _Chain_Tail(the_chain); 40017388: e8 27 bf f4 st %l4, [ %fp + -12 ] the_chain->permanent_null = NULL; 4001738c: c0 27 bf f8 clr [ %fp + -8 ] the_chain->last = _Chain_Head(the_chain); 40017390: 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); 40017394: ee 27 bf e8 st %l7, [ %fp + -24 ] the_chain->permanent_null = NULL; 40017398: c0 27 bf ec clr [ %fp + -20 ] the_chain->last = _Chain_Head(the_chain); 4001739c: e4 27 bf f0 st %l2, [ %fp + -16 ] 400173a0: ac 15 a0 34 or %l6, 0x34, %l6 400173a4: a2 06 20 30 add %i0, 0x30, %l1 400173a8: aa 15 63 80 or %l5, 0x380, %l5 400173ac: a6 06 20 68 add %i0, 0x68, %l3 400173b0: b8 17 22 f8 or %i4, 0x2f8, %i4 400173b4: b2 06 20 08 add %i0, 8, %i1 400173b8: 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; 400173bc: 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; 400173c0: 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; 400173c4: c2 05 80 00 ld [ %l6 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 400173c8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 400173cc: 94 10 00 12 mov %l2, %o2 400173d0: 90 10 00 11 mov %l1, %o0 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 400173d4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 400173d8: 40 00 12 bb call 4001bec4 <_Watchdog_Adjust_to_chain> 400173dc: 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; 400173e0: 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(); 400173e4: 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 ) { 400173e8: 80 a4 00 0a cmp %l0, %o2 400173ec: 18 80 00 2e bgu 400174a4 <_Timer_server_Body+0x13c> 400173f0: 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 ) { 400173f4: 80 a4 00 0a cmp %l0, %o2 400173f8: 0a 80 00 2f bcs 400174b4 <_Timer_server_Body+0x14c> 400173fc: 90 10 00 13 mov %l3, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 40017400: 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 ); 40017404: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 40017408: 40 00 02 fb call 40017ff4 <_Chain_Get> 4001740c: 01 00 00 00 nop if ( timer == NULL ) { 40017410: 92 92 20 00 orcc %o0, 0, %o1 40017414: 02 80 00 10 be 40017454 <_Timer_server_Body+0xec> 40017418: 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 ) { 4001741c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 40017420: 80 a0 60 01 cmp %g1, 1 40017424: 02 80 00 28 be 400174c4 <_Timer_server_Body+0x15c> 40017428: 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 ) { 4001742c: 12 bf ff f6 bne 40017404 <_Timer_server_Body+0x9c> <== NEVER TAKEN 40017430: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40017434: 40 00 12 d7 call 4001bf90 <_Watchdog_Insert> 40017438: 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 ); 4001743c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 40017440: 40 00 02 ed call 40017ff4 <_Chain_Get> 40017444: 01 00 00 00 nop if ( timer == NULL ) { 40017448: 92 92 20 00 orcc %o0, 0, %o1 4001744c: 32 bf ff f5 bne,a 40017420 <_Timer_server_Body+0xb8> <== NEVER TAKEN 40017450: 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 ); 40017454: 7f ff de 64 call 4000ede4 40017458: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 4001745c: c2 07 bf f4 ld [ %fp + -12 ], %g1 40017460: 80 a5 00 01 cmp %l4, %g1 40017464: 02 80 00 1c be 400174d4 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN 40017468: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 4001746c: 7f ff de 62 call 4000edf4 <== NOT EXECUTED 40017470: 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; 40017474: c2 05 80 00 ld [ %l6 ], %g1 <== NOT EXECUTED /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 40017478: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 4001747c: 94 10 00 12 mov %l2, %o2 <== NOT EXECUTED 40017480: 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; 40017484: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 40017488: 40 00 12 8f call 4001bec4 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED 4001748c: 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; 40017490: 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(); 40017494: 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 ) { 40017498: 80 a4 00 0a cmp %l0, %o2 <== NOT EXECUTED 4001749c: 08 bf ff d7 bleu 400173f8 <_Timer_server_Body+0x90> <== NOT EXECUTED 400174a0: 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 ); 400174a4: 90 10 00 13 mov %l3, %o0 400174a8: 40 00 12 87 call 4001bec4 <_Watchdog_Adjust_to_chain> 400174ac: 94 10 00 12 mov %l2, %o2 400174b0: 30 bf ff d4 b,a 40017400 <_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 ); 400174b4: 92 10 20 01 mov 1, %o1 400174b8: 40 00 12 53 call 4001be04 <_Watchdog_Adjust> 400174bc: 94 22 80 10 sub %o2, %l0, %o2 400174c0: 30 bf ff d0 b,a 40017400 <_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 ); 400174c4: 90 10 00 11 mov %l1, %o0 400174c8: 40 00 12 b2 call 4001bf90 <_Watchdog_Insert> 400174cc: 92 02 60 10 add %o1, 0x10, %o1 400174d0: 30 bf ff cd b,a 40017404 <_Timer_server_Body+0x9c> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 400174d4: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 400174d8: 7f ff de 47 call 4000edf4 400174dc: 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 ) ) { 400174e0: c2 07 bf e8 ld [ %fp + -24 ], %g1 400174e4: 80 a5 c0 01 cmp %l7, %g1 400174e8: 12 80 00 0c bne 40017518 <_Timer_server_Body+0x1b0> 400174ec: 01 00 00 00 nop 400174f0: 30 80 00 13 b,a 4001753c <_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); 400174f4: 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; 400174f8: 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; 400174fc: c0 24 20 08 clr [ %l0 + 8 ] _ISR_Enable( level ); 40017500: 7f ff de 3d call 4000edf4 40017504: 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 ); 40017508: d0 04 20 20 ld [ %l0 + 0x20 ], %o0 4001750c: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 40017510: 9f c0 40 00 call %g1 40017514: 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 ); 40017518: 7f ff de 33 call 4000ede4 4001751c: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 40017520: 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)) 40017524: 80 a5 c0 10 cmp %l7, %l0 40017528: 32 bf ff f3 bne,a 400174f4 <_Timer_server_Body+0x18c> 4001752c: 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 ); 40017530: 7f ff de 31 call 4000edf4 40017534: 01 00 00 00 nop 40017538: 30 bf ff a2 b,a 400173c0 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 4001753c: c0 2e 20 7c clrb [ %i0 + 0x7c ] 40017540: c2 07 00 00 ld [ %i4 ], %g1 40017544: 82 00 60 01 inc %g1 40017548: c2 27 00 00 st %g1, [ %i4 ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 4001754c: d0 06 00 00 ld [ %i0 ], %o0 40017550: 40 00 0f 91 call 4001b394 <_Thread_Set_state> 40017554: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 40017558: 7f ff ff 5a call 400172c0 <_Timer_server_Reset_interval_system_watchdog> 4001755c: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 40017560: 7f ff ff 6d call 40017314 <_Timer_server_Reset_tod_system_watchdog> 40017564: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 40017568: 40 00 0c c5 call 4001a87c <_Thread_Enable_dispatch> 4001756c: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 40017570: 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; 40017574: 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 ); 40017578: 40 00 12 f0 call 4001c138 <_Watchdog_Remove> 4001757c: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 40017580: 40 00 12 ee call 4001c138 <_Watchdog_Remove> 40017584: 90 10 00 1a mov %i2, %o0 40017588: 30 bf ff 8e b,a 400173c0 <_Timer_server_Body+0x58> =============================================================================== 4001758c <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 4001758c: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 40017590: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 40017594: 80 a0 60 00 cmp %g1, 0 40017598: 02 80 00 05 be 400175ac <_Timer_server_Schedule_operation_method+0x20> 4001759c: 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 ); 400175a0: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 400175a4: 40 00 02 7e call 40017f9c <_Chain_Append> 400175a8: 81 e8 00 00 restore 400175ac: 03 10 00 f8 sethi %hi(0x4003e000), %g1 400175b0: c4 00 62 f8 ld [ %g1 + 0x2f8 ], %g2 ! 4003e2f8 <_Thread_Dispatch_disable_level> 400175b4: 84 00 a0 01 inc %g2 400175b8: c4 20 62 f8 st %g2, [ %g1 + 0x2f8 ] * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 400175bc: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 400175c0: 80 a0 60 01 cmp %g1, 1 400175c4: 02 80 00 28 be 40017664 <_Timer_server_Schedule_operation_method+0xd8> 400175c8: 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 ) { 400175cc: 02 80 00 04 be 400175dc <_Timer_server_Schedule_operation_method+0x50> 400175d0: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 400175d4: 40 00 0c aa call 4001a87c <_Thread_Enable_dispatch> 400175d8: 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 ); 400175dc: 7f ff de 02 call 4000ede4 400175e0: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 400175e4: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 400175e8: 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; 400175ec: 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(); 400175f0: 03 10 00 f8 sethi %hi(0x4003e000), %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 400175f4: 80 a0 80 04 cmp %g2, %g4 400175f8: 02 80 00 0d be 4001762c <_Timer_server_Schedule_operation_method+0xa0> 400175fc: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 40017600: da 00 a0 10 ld [ %g2 + 0x10 ], %o5 if ( snapshot > last_snapshot ) { 40017604: 80 a0 40 03 cmp %g1, %g3 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 40017608: 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 ) { 4001760c: 08 80 00 07 bleu 40017628 <_Timer_server_Schedule_operation_method+0x9c> 40017610: 88 21 00 01 sub %g4, %g1, %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 40017614: 86 20 40 03 sub %g1, %g3, %g3 if (delta_interval > delta) { 40017618: 80 a3 40 03 cmp %o5, %g3 4001761c: 08 80 00 03 bleu 40017628 <_Timer_server_Schedule_operation_method+0x9c><== NEVER TAKEN 40017620: 88 10 20 00 clr %g4 delta_interval -= delta; 40017624: 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; 40017628: c8 20 a0 10 st %g4, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 4001762c: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 40017630: 7f ff dd f1 call 4000edf4 40017634: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 40017638: 90 06 20 68 add %i0, 0x68, %o0 4001763c: 40 00 12 55 call 4001bf90 <_Watchdog_Insert> 40017640: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 40017644: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 40017648: 80 a0 60 00 cmp %g1, 0 4001764c: 12 bf ff e2 bne 400175d4 <_Timer_server_Schedule_operation_method+0x48> 40017650: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 40017654: 7f ff ff 30 call 40017314 <_Timer_server_Reset_tod_system_watchdog> 40017658: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 4001765c: 40 00 0c 88 call 4001a87c <_Thread_Enable_dispatch> 40017660: 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 ); 40017664: 7f ff dd e0 call 4000ede4 40017668: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 4001766c: 05 10 00 f9 sethi %hi(0x4003e400), %g2 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 40017670: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 40017674: c4 00 a0 34 ld [ %g2 + 0x34 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 40017678: 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; 4001767c: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 40017680: 80 a0 40 03 cmp %g1, %g3 40017684: 02 80 00 08 be 400176a4 <_Timer_server_Schedule_operation_method+0x118> 40017688: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 4001768c: da 00 60 10 ld [ %g1 + 0x10 ], %o5 if (delta_interval > delta) { 40017690: 80 a1 00 0d cmp %g4, %o5 40017694: 1a 80 00 03 bcc 400176a0 <_Timer_server_Schedule_operation_method+0x114> 40017698: 86 10 20 00 clr %g3 delta_interval -= delta; 4001769c: 86 23 40 04 sub %o5, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 400176a0: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 400176a4: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 400176a8: 7f ff dd d3 call 4000edf4 400176ac: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 400176b0: 90 06 20 30 add %i0, 0x30, %o0 400176b4: 40 00 12 37 call 4001bf90 <_Watchdog_Insert> 400176b8: 92 04 20 10 add %l0, 0x10, %o1 if ( !ts->active ) { 400176bc: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 400176c0: 80 a0 60 00 cmp %g1, 0 400176c4: 12 bf ff c4 bne 400175d4 <_Timer_server_Schedule_operation_method+0x48> 400176c8: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 400176cc: 7f ff fe fd call 400172c0 <_Timer_server_Reset_interval_system_watchdog> 400176d0: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 400176d4: 40 00 0c 6a call 4001a87c <_Thread_Enable_dispatch> 400176d8: 81 e8 00 00 restore =============================================================================== 4000a36c <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 4000a36c: 9d e3 bf a0 save %sp, -96, %sp 4000a370: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000a374: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 4000a378: 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; 4000a37c: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 4000a380: c4 00 60 04 ld [ %g1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000a384: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 4000a388: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 4000a38c: 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 ) { 4000a390: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 4000a394: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 4000a398: 80 a0 80 04 cmp %g2, %g4 4000a39c: 08 80 00 0b bleu 4000a3c8 <_Timespec_Add_to+0x5c> 4000a3a0: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 4000a3a4: 1b 31 19 4d sethi %hi(0xc4653400), %o5 4000a3a8: 9a 13 62 00 or %o5, 0x200, %o5 ! c4653600 4000a3ac: 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( 4000a3b0: 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 ) { 4000a3b4: 80 a0 80 04 cmp %g2, %g4 4000a3b8: 18 bf ff fd bgu 4000a3ac <_Timespec_Add_to+0x40> <== NEVER TAKEN 4000a3bc: b0 06 20 01 inc %i0 4000a3c0: c4 20 60 04 st %g2, [ %g1 + 4 ] 4000a3c4: c6 20 40 00 st %g3, [ %g1 ] time->tv_sec++; seconds++; } return seconds; } 4000a3c8: 81 c7 e0 08 ret 4000a3cc: 81 e8 00 00 restore =============================================================================== 4000c448 <_Timespec_Greater_than>: bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { if ( lhs->tv_sec > rhs->tv_sec ) 4000c448: c6 02 00 00 ld [ %o0 ], %g3 4000c44c: c4 02 40 00 ld [ %o1 ], %g2 bool _Timespec_Greater_than( const struct timespec *lhs, const struct timespec *rhs ) { 4000c450: 82 10 00 08 mov %o0, %g1 if ( lhs->tv_sec > rhs->tv_sec ) 4000c454: 80 a0 c0 02 cmp %g3, %g2 4000c458: 14 80 00 0a bg 4000c480 <_Timespec_Greater_than+0x38> 4000c45c: 90 10 20 01 mov 1, %o0 return true; if ( lhs->tv_sec < rhs->tv_sec ) 4000c460: 80 a0 c0 02 cmp %g3, %g2 4000c464: 06 80 00 07 bl 4000c480 <_Timespec_Greater_than+0x38> <== NEVER TAKEN 4000c468: 90 10 20 00 clr %o0 #include #include #include bool _Timespec_Greater_than( 4000c46c: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000c470: c2 02 60 04 ld [ %o1 + 4 ], %g1 4000c474: 80 a0 80 01 cmp %g2, %g1 4000c478: 04 80 00 04 ble 4000c488 <_Timespec_Greater_than+0x40> 4000c47c: 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; } 4000c480: 81 c3 e0 08 retl 4000c484: 01 00 00 00 nop 4000c488: 81 c3 e0 08 retl 4000c48c: 90 10 20 00 clr %o0 ! 0 =============================================================================== 4000a57c <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 4000a57c: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a580: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a584: a2 14 63 f8 or %l1, 0x3f8, %l1 ! 400163f8 <_User_extensions_List> 4000a588: e0 04 60 08 ld [ %l1 + 8 ], %l0 4000a58c: 80 a4 00 11 cmp %l0, %l1 4000a590: 02 80 00 0d be 4000a5c4 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 4000a594: 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 ) 4000a598: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 4000a59c: 80 a0 60 00 cmp %g1, 0 4000a5a0: 02 80 00 05 be 4000a5b4 <_User_extensions_Fatal+0x38> 4000a5a4: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 4000a5a8: 92 10 00 19 mov %i1, %o1 4000a5ac: 9f c0 40 00 call %g1 4000a5b0: 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 ) { 4000a5b4: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a5b8: 80 a4 00 11 cmp %l0, %l1 4000a5bc: 32 bf ff f8 bne,a 4000a59c <_User_extensions_Fatal+0x20> <== ALWAYS TAKEN 4000a5c0: c2 04 20 30 ld [ %l0 + 0x30 ], %g1 4000a5c4: 81 c7 e0 08 ret <== NOT EXECUTED 4000a5c8: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 4000a428 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 4000a428: 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; 4000a42c: 07 10 00 55 sethi %hi(0x40015400), %g3 4000a430: 86 10 e3 a8 or %g3, 0x3a8, %g3 ! 400157a8 initial_extensions = Configuration.User_extension_table; 4000a434: 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); 4000a438: 1b 10 00 58 sethi %hi(0x40016000), %o5 4000a43c: 09 10 00 58 sethi %hi(0x40016000), %g4 4000a440: 84 13 63 f8 or %o5, 0x3f8, %g2 4000a444: 82 11 21 dc or %g4, 0x1dc, %g1 4000a448: 96 00 a0 04 add %g2, 4, %o3 4000a44c: 98 00 60 04 add %g1, 4, %o4 4000a450: d6 23 63 f8 st %o3, [ %o5 + 0x3f8 ] the_chain->permanent_null = NULL; 4000a454: c0 20 a0 04 clr [ %g2 + 4 ] the_chain->last = _Chain_Head(the_chain); 4000a458: 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); 4000a45c: d8 21 21 dc st %o4, [ %g4 + 0x1dc ] the_chain->permanent_null = NULL; 4000a460: c0 20 60 04 clr [ %g1 + 4 ] the_chain->last = _Chain_Head(the_chain); 4000a464: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 4000a468: 80 a4 e0 00 cmp %l3, 0 4000a46c: 02 80 00 1b be 4000a4d8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 4000a470: e4 00 e0 38 ld [ %g3 + 0x38 ], %l2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 4000a474: 83 2c a0 02 sll %l2, 2, %g1 4000a478: a3 2c a0 04 sll %l2, 4, %l1 4000a47c: a2 24 40 01 sub %l1, %g1, %l1 4000a480: a2 04 40 12 add %l1, %l2, %l1 4000a484: 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( 4000a488: 40 00 01 9e call 4000ab00 <_Workspace_Allocate_or_fatal_error> 4000a48c: 90 10 00 11 mov %l1, %o0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 4000a490: 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( 4000a494: a0 10 00 08 mov %o0, %l0 number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 4000a498: 40 00 15 71 call 4000fa5c 4000a49c: 94 10 00 11 mov %l1, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 4000a4a0: 80 a4 a0 00 cmp %l2, 0 4000a4a4: 02 80 00 0d be 4000a4d8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 4000a4a8: a2 10 20 00 clr %l1 #include #include #include #include void _User_extensions_Handler_initialization(void) 4000a4ac: 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; 4000a4b0: 94 10 20 20 mov 0x20, %o2 4000a4b4: 92 04 c0 09 add %l3, %o1, %o1 4000a4b8: 40 00 15 30 call 4000f978 4000a4bc: 90 04 20 14 add %l0, 0x14, %o0 _User_extensions_Add_set( extension ); 4000a4c0: 40 00 0c a3 call 4000d74c <_User_extensions_Add_set> 4000a4c4: 90 10 00 10 mov %l0, %o0 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 4000a4c8: a2 04 60 01 inc %l1 4000a4cc: 80 a4 80 11 cmp %l2, %l1 4000a4d0: 18 bf ff f7 bgu 4000a4ac <_User_extensions_Handler_initialization+0x84> 4000a4d4: a0 04 20 34 add %l0, 0x34, %l0 4000a4d8: 81 c7 e0 08 ret 4000a4dc: 81 e8 00 00 restore =============================================================================== 4000a4e0 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 4000a4e0: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a4e4: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a4e8: e0 04 63 f8 ld [ %l1 + 0x3f8 ], %l0 ! 400163f8 <_User_extensions_List> 4000a4ec: a2 14 63 f8 or %l1, 0x3f8, %l1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Tail( Chain_Control *the_chain ) { return (Chain_Node *) &the_chain->permanent_null; 4000a4f0: a2 04 60 04 add %l1, 4, %l1 4000a4f4: 80 a4 00 11 cmp %l0, %l1 4000a4f8: 02 80 00 0c be 4000a528 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 4000a4fc: 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 ) 4000a500: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 4000a504: 80 a0 60 00 cmp %g1, 0 4000a508: 02 80 00 04 be 4000a518 <_User_extensions_Thread_begin+0x38> 4000a50c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 4000a510: 9f c0 40 00 call %g1 4000a514: 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 ) { 4000a518: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a51c: 80 a4 00 11 cmp %l0, %l1 4000a520: 32 bf ff f9 bne,a 4000a504 <_User_extensions_Thread_begin+0x24> 4000a524: c2 04 20 28 ld [ %l0 + 0x28 ], %g1 4000a528: 81 c7 e0 08 ret 4000a52c: 81 e8 00 00 restore =============================================================================== 4000a5cc <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 4000a5cc: 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 ; 4000a5d0: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a5d4: e0 04 63 f8 ld [ %l1 + 0x3f8 ], %l0 ! 400163f8 <_User_extensions_List> #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 4000a5d8: 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 ; 4000a5dc: a2 14 63 f8 or %l1, 0x3f8, %l1 4000a5e0: a2 04 60 04 add %l1, 4, %l1 4000a5e4: 80 a4 00 11 cmp %l0, %l1 4000a5e8: 02 80 00 13 be 4000a634 <_User_extensions_Thread_create+0x68><== NEVER TAKEN 4000a5ec: 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)( 4000a5f0: 25 10 00 59 sethi %hi(0x40016400), %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 ) { 4000a5f4: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 4000a5f8: 80 a0 60 00 cmp %g1, 0 4000a5fc: 02 80 00 08 be 4000a61c <_User_extensions_Thread_create+0x50> 4000a600: 84 14 a0 3c or %l2, 0x3c, %g2 status = (*the_extension->Callouts.thread_create)( 4000a604: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000a608: 9f c0 40 00 call %g1 4000a60c: 92 10 00 13 mov %l3, %o1 _Thread_Executing, the_thread ); if ( !status ) 4000a610: 80 8a 20 ff btst 0xff, %o0 4000a614: 22 80 00 08 be,a 4000a634 <_User_extensions_Thread_create+0x68> 4000a618: 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 ) { 4000a61c: 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 ; 4000a620: 80 a4 00 11 cmp %l0, %l1 4000a624: 32 bf ff f5 bne,a 4000a5f8 <_User_extensions_Thread_create+0x2c> 4000a628: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 if ( !status ) return false; } } return true; 4000a62c: 81 c7 e0 08 ret 4000a630: 91 e8 20 01 restore %g0, 1, %o0 } 4000a634: 81 c7 e0 08 ret 4000a638: 81 e8 00 00 restore =============================================================================== 4000a63c <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 4000a63c: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a640: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a644: a2 14 63 f8 or %l1, 0x3f8, %l1 ! 400163f8 <_User_extensions_List> 4000a648: e0 04 60 08 ld [ %l1 + 8 ], %l0 4000a64c: 80 a4 00 11 cmp %l0, %l1 4000a650: 02 80 00 0d be 4000a684 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 4000a654: 25 10 00 59 sethi %hi(0x40016400), %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 ) 4000a658: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 4000a65c: 80 a0 60 00 cmp %g1, 0 4000a660: 02 80 00 05 be 4000a674 <_User_extensions_Thread_delete+0x38> 4000a664: 84 14 a0 3c or %l2, 0x3c, %g2 (*the_extension->Callouts.thread_delete)( 4000a668: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000a66c: 9f c0 40 00 call %g1 4000a670: 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 ) { 4000a674: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a678: 80 a4 00 11 cmp %l0, %l1 4000a67c: 32 bf ff f8 bne,a 4000a65c <_User_extensions_Thread_delete+0x20> 4000a680: c2 04 20 20 ld [ %l0 + 0x20 ], %g1 4000a684: 81 c7 e0 08 ret 4000a688: 81 e8 00 00 restore =============================================================================== 4000a530 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 4000a530: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a534: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a538: a2 14 63 f8 or %l1, 0x3f8, %l1 ! 400163f8 <_User_extensions_List> 4000a53c: e0 04 60 08 ld [ %l1 + 8 ], %l0 4000a540: 80 a4 00 11 cmp %l0, %l1 4000a544: 02 80 00 0c be 4000a574 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 4000a548: 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 ) 4000a54c: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 4000a550: 80 a0 60 00 cmp %g1, 0 4000a554: 02 80 00 04 be 4000a564 <_User_extensions_Thread_exitted+0x34> 4000a558: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 4000a55c: 9f c0 40 00 call %g1 4000a560: 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 ) { 4000a564: e0 04 20 04 ld [ %l0 + 4 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.last ; 4000a568: 80 a4 00 11 cmp %l0, %l1 4000a56c: 32 bf ff f9 bne,a 4000a550 <_User_extensions_Thread_exitted+0x20> 4000a570: c2 04 20 2c ld [ %l0 + 0x2c ], %g1 4000a574: 81 c7 e0 08 ret 4000a578: 81 e8 00 00 restore =============================================================================== 4000b3b4 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 4000b3b4: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000b3b8: 23 10 00 7b sethi %hi(0x4001ec00), %l1 4000b3bc: e0 04 60 58 ld [ %l1 + 0x58 ], %l0 ! 4001ec58 <_User_extensions_List> 4000b3c0: a2 14 60 58 or %l1, 0x58, %l1 4000b3c4: a2 04 60 04 add %l1, 4, %l1 4000b3c8: 80 a4 00 11 cmp %l0, %l1 4000b3cc: 02 80 00 0d be 4000b400 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 4000b3d0: 25 10 00 7b sethi %hi(0x4001ec00), %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 ) 4000b3d4: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000b3d8: 80 a0 60 00 cmp %g1, 0 4000b3dc: 02 80 00 05 be 4000b3f0 <_User_extensions_Thread_restart+0x3c> 4000b3e0: 84 14 a0 9c or %l2, 0x9c, %g2 (*the_extension->Callouts.thread_restart)( 4000b3e4: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000b3e8: 9f c0 40 00 call %g1 4000b3ec: 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 ) { 4000b3f0: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000b3f4: 80 a4 00 11 cmp %l0, %l1 4000b3f8: 32 bf ff f8 bne,a 4000b3d8 <_User_extensions_Thread_restart+0x24> 4000b3fc: c2 04 20 1c ld [ %l0 + 0x1c ], %g1 4000b400: 81 c7 e0 08 ret 4000b404: 81 e8 00 00 restore =============================================================================== 4000a68c <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 4000a68c: 9d e3 bf a0 save %sp, -96, %sp Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a690: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a694: e0 04 63 f8 ld [ %l1 + 0x3f8 ], %l0 ! 400163f8 <_User_extensions_List> 4000a698: a2 14 63 f8 or %l1, 0x3f8, %l1 4000a69c: a2 04 60 04 add %l1, 4, %l1 4000a6a0: 80 a4 00 11 cmp %l0, %l1 4000a6a4: 02 80 00 0d be 4000a6d8 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 4000a6a8: 25 10 00 59 sethi %hi(0x40016400), %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 ) 4000a6ac: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 4000a6b0: 80 a0 60 00 cmp %g1, 0 4000a6b4: 02 80 00 05 be 4000a6c8 <_User_extensions_Thread_start+0x3c> 4000a6b8: 84 14 a0 3c or %l2, 0x3c, %g2 (*the_extension->Callouts.thread_start)( 4000a6bc: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 4000a6c0: 9f c0 40 00 call %g1 4000a6c4: 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 ) { 4000a6c8: e0 04 00 00 ld [ %l0 ], %l0 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _User_extensions_List.first ; 4000a6cc: 80 a4 00 11 cmp %l0, %l1 4000a6d0: 32 bf ff f8 bne,a 4000a6b0 <_User_extensions_Thread_start+0x24> 4000a6d4: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 4000a6d8: 81 c7 e0 08 ret 4000a6dc: 81 e8 00 00 restore =============================================================================== 4000a6e0 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 4000a6e0: 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 ; 4000a6e4: 23 10 00 58 sethi %hi(0x40016000), %l1 4000a6e8: e0 04 61 dc ld [ %l1 + 0x1dc ], %l0 ! 400161dc <_User_extensions_Switches_list> 4000a6ec: a2 14 61 dc or %l1, 0x1dc, %l1 4000a6f0: a2 04 60 04 add %l1, 4, %l1 4000a6f4: 80 a4 00 11 cmp %l0, %l1 4000a6f8: 02 80 00 0a be 4000a720 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 4000a6fc: 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 ); 4000a700: c2 04 20 08 ld [ %l0 + 8 ], %g1 4000a704: 90 10 00 18 mov %i0, %o0 4000a708: 9f c0 40 00 call %g1 4000a70c: 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 ) { 4000a710: 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 ; 4000a714: 80 a4 00 11 cmp %l0, %l1 4000a718: 32 bf ff fb bne,a 4000a704 <_User_extensions_Thread_switch+0x24> 4000a71c: c2 04 20 08 ld [ %l0 + 8 ], %g1 4000a720: 81 c7 e0 08 ret 4000a724: 81 e8 00 00 restore =============================================================================== 4000c938 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 4000c938: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 4000c93c: 7f ff d9 13 call 40002d88 4000c940: 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)); 4000c944: 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; 4000c948: 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 ) ) { 4000c94c: 80 a0 40 11 cmp %g1, %l1 4000c950: 02 80 00 1f be 4000c9cc <_Watchdog_Adjust+0x94> 4000c954: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 4000c958: 12 80 00 1f bne 4000c9d4 <_Watchdog_Adjust+0x9c> 4000c95c: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 4000c960: 80 a6 a0 00 cmp %i2, 0 4000c964: 02 80 00 1a be 4000c9cc <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000c968: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000c96c: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 4000c970: 80 a6 80 19 cmp %i2, %i1 4000c974: 1a 80 00 0b bcc 4000c9a0 <_Watchdog_Adjust+0x68> <== ALWAYS TAKEN 4000c978: a4 10 20 01 mov 1, %l2 _Watchdog_First( header )->delta_interval -= units; 4000c97c: 10 80 00 1d b 4000c9f0 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 4000c980: 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 ) { 4000c984: b4 a6 80 19 subcc %i2, %i1, %i2 4000c988: 02 80 00 11 be 4000c9cc <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000c98c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 4000c990: f2 00 60 10 ld [ %g1 + 0x10 ], %i1 4000c994: 80 a6 40 1a cmp %i1, %i2 4000c998: 38 80 00 16 bgu,a 4000c9f0 <_Watchdog_Adjust+0xb8> 4000c99c: 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; 4000c9a0: e4 20 60 10 st %l2, [ %g1 + 0x10 ] _ISR_Enable( level ); 4000c9a4: 7f ff d8 fd call 40002d98 4000c9a8: 01 00 00 00 nop _Watchdog_Tickle( header ); 4000c9ac: 40 00 00 b3 call 4000cc78 <_Watchdog_Tickle> 4000c9b0: 90 10 00 10 mov %l0, %o0 _ISR_Disable( level ); 4000c9b4: 7f ff d8 f5 call 40002d88 4000c9b8: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000c9bc: c4 04 00 00 ld [ %l0 ], %g2 if ( _Chain_Is_empty( header ) ) 4000c9c0: 80 a4 40 02 cmp %l1, %g2 4000c9c4: 12 bf ff f0 bne 4000c984 <_Watchdog_Adjust+0x4c> 4000c9c8: 82 10 00 02 mov %g2, %g1 } break; } } _ISR_Enable( level ); 4000c9cc: 7f ff d8 f3 call 40002d98 4000c9d0: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 4000c9d4: 12 bf ff fe bne 4000c9cc <_Watchdog_Adjust+0x94> <== NEVER TAKEN 4000c9d8: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 4000c9dc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 4000c9e0: b4 00 80 1a add %g2, %i2, %i2 4000c9e4: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 4000c9e8: 7f ff d8 ec call 40002d98 4000c9ec: 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; 4000c9f0: 10 bf ff f7 b 4000c9cc <_Watchdog_Adjust+0x94> 4000c9f4: f4 20 60 10 st %i2, [ %g1 + 0x10 ] =============================================================================== 4000a8d0 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 4000a8d0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 4000a8d4: 7f ff dd 4e call 40001e0c 4000a8d8: 01 00 00 00 nop previous_state = the_watchdog->state; 4000a8dc: e0 06 20 08 ld [ %i0 + 8 ], %l0 switch ( previous_state ) { 4000a8e0: 80 a4 20 01 cmp %l0, 1 4000a8e4: 02 80 00 2a be 4000a98c <_Watchdog_Remove+0xbc> 4000a8e8: 03 10 00 58 sethi %hi(0x40016000), %g1 4000a8ec: 1a 80 00 09 bcc 4000a910 <_Watchdog_Remove+0x40> 4000a8f0: 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; 4000a8f4: 03 10 00 58 sethi %hi(0x40016000), %g1 4000a8f8: c2 00 63 14 ld [ %g1 + 0x314 ], %g1 ! 40016314 <_Watchdog_Ticks_since_boot> 4000a8fc: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000a900: 7f ff dd 47 call 40001e1c 4000a904: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 4000a908: 81 c7 e0 08 ret 4000a90c: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 4000a910: 18 bf ff fa bgu 4000a8f8 <_Watchdog_Remove+0x28> <== NEVER TAKEN 4000a914: 03 10 00 58 sethi %hi(0x40016000), %g1 } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; _ISR_Enable( level ); return( previous_state ); } 4000a918: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 4000a91c: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 4000a920: c4 00 40 00 ld [ %g1 ], %g2 4000a924: 80 a0 a0 00 cmp %g2, 0 4000a928: 02 80 00 07 be 4000a944 <_Watchdog_Remove+0x74> 4000a92c: 05 10 00 58 sethi %hi(0x40016000), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 4000a930: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 4000a934: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 4000a938: 84 00 c0 02 add %g3, %g2, %g2 4000a93c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 4000a940: 05 10 00 58 sethi %hi(0x40016000), %g2 4000a944: c4 00 a3 10 ld [ %g2 + 0x310 ], %g2 ! 40016310 <_Watchdog_Sync_count> 4000a948: 80 a0 a0 00 cmp %g2, 0 4000a94c: 22 80 00 07 be,a 4000a968 <_Watchdog_Remove+0x98> 4000a950: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 4000a954: 05 10 00 59 sethi %hi(0x40016400), %g2 4000a958: c6 00 a0 44 ld [ %g2 + 0x44 ], %g3 ! 40016444 <_Per_CPU_Information+0x8> 4000a95c: 05 10 00 58 sethi %hi(0x40016000), %g2 4000a960: c6 20 a2 80 st %g3, [ %g2 + 0x280 ] ! 40016280 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 4000a964: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 4000a968: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 4000a96c: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 4000a970: 03 10 00 58 sethi %hi(0x40016000), %g1 4000a974: c2 00 63 14 ld [ %g1 + 0x314 ], %g1 ! 40016314 <_Watchdog_Ticks_since_boot> 4000a978: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000a97c: 7f ff dd 28 call 40001e1c 4000a980: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 4000a984: 81 c7 e0 08 ret 4000a988: 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; 4000a98c: c2 00 63 14 ld [ %g1 + 0x314 ], %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; 4000a990: 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; 4000a994: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 4000a998: 7f ff dd 21 call 40001e1c 4000a99c: b0 10 00 10 mov %l0, %i0 return( previous_state ); } 4000a9a0: 81 c7 e0 08 ret 4000a9a4: 81 e8 00 00 restore =============================================================================== 4000c178 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 4000c178: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 4000c17c: 7f ff d9 d4 call 400028cc 4000c180: a0 10 00 18 mov %i0, %l0 4000c184: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 4000c188: 11 10 00 78 sethi %hi(0x4001e000), %o0 4000c18c: 94 10 00 19 mov %i1, %o2 4000c190: 92 10 00 10 mov %l0, %o1 4000c194: 7f ff e4 7c call 40005384 4000c198: 90 12 23 e0 or %o0, 0x3e0, %o0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( Chain_Control *the_chain ) { return (the_chain->first == _Chain_Tail(the_chain)); 4000c19c: 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; 4000c1a0: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 4000c1a4: 80 a4 40 19 cmp %l1, %i1 4000c1a8: 02 80 00 0f be 4000c1e4 <_Watchdog_Report_chain+0x6c> 4000c1ac: 11 10 00 79 sethi %hi(0x4001e400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 4000c1b0: 92 10 00 11 mov %l1, %o1 4000c1b4: 40 00 00 11 call 4000c1f8 <_Watchdog_Report> 4000c1b8: 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 ) 4000c1bc: 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 ; 4000c1c0: 80 a4 40 19 cmp %l1, %i1 4000c1c4: 12 bf ff fc bne 4000c1b4 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 4000c1c8: 92 10 00 11 mov %l1, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 4000c1cc: 92 10 00 10 mov %l0, %o1 4000c1d0: 11 10 00 78 sethi %hi(0x4001e000), %o0 4000c1d4: 7f ff e4 6c call 40005384 4000c1d8: 90 12 23 f8 or %o0, 0x3f8, %o0 ! 4001e3f8 <_Status_Object_name_errors_to_status+0x30> } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 4000c1dc: 7f ff d9 c0 call 400028dc 4000c1e0: 81 e8 00 00 restore _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 4000c1e4: 7f ff e4 68 call 40005384 4000c1e8: 90 12 20 08 or %o0, 8, %o0 } _ISR_Enable( level ); 4000c1ec: 7f ff d9 bc call 400028dc 4000c1f0: 81 e8 00 00 restore =============================================================================== 4000f6bc : rtems_name name, rtems_attribute attribute_set, uint32_t maximum_waiters, rtems_id *id ) { 4000f6bc: 9d e3 bf 98 save %sp, -104, %sp 4000f6c0: a0 10 00 18 mov %i0, %l0 Barrier_Control *the_barrier; CORE_barrier_Attributes the_attributes; if ( !rtems_is_name_valid( name ) ) 4000f6c4: 80 a4 20 00 cmp %l0, 0 4000f6c8: 02 80 00 23 be 4000f754 4000f6cc: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !id ) 4000f6d0: 80 a6 e0 00 cmp %i3, 0 4000f6d4: 02 80 00 20 be 4000f754 4000f6d8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; /* Initialize core barrier attributes */ if ( _Attributes_Is_barrier_automatic( attribute_set ) ) { 4000f6dc: 80 8e 60 10 btst 0x10, %i1 4000f6e0: 02 80 00 1f be 4000f75c 4000f6e4: 80 a6 a0 00 cmp %i2, 0 the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 4000f6e8: c0 27 bf f8 clr [ %fp + -8 ] if ( maximum_waiters == 0 ) 4000f6ec: 02 80 00 1a be 4000f754 4000f6f0: b0 10 20 0a mov 0xa, %i0 4000f6f4: 03 10 00 8a sethi %hi(0x40022800), %g1 4000f6f8: c4 00 61 a8 ld [ %g1 + 0x1a8 ], %g2 ! 400229a8 <_Thread_Dispatch_disable_level> return RTEMS_INVALID_NUMBER; } else the_attributes.discipline = CORE_BARRIER_MANUAL_RELEASE; the_attributes.maximum_count = maximum_waiters; 4000f6fc: f4 27 bf fc st %i2, [ %fp + -4 ] 4000f700: 84 00 a0 01 inc %g2 4000f704: c4 20 61 a8 st %g2, [ %g1 + 0x1a8 ] * 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 ); 4000f708: 25 10 00 8b sethi %hi(0x40022c00), %l2 4000f70c: 7f ff ec 7a call 4000a8f4 <_Objects_Allocate> 4000f710: 90 14 a0 28 or %l2, 0x28, %o0 ! 40022c28 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 4000f714: a2 92 20 00 orcc %o0, 0, %l1 4000f718: 02 80 00 1e be 4000f790 <== NEVER TAKEN 4000f71c: 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 ); 4000f720: 92 07 bf f8 add %fp, -8, %o1 4000f724: 40 00 02 42 call 4001002c <_CORE_barrier_Initialize> 4000f728: f2 24 60 10 st %i1, [ %l1 + 0x10 ] 4000f72c: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 *id = the_barrier->Object.id; _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 4000f730: a4 14 a0 28 or %l2, 0x28, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000f734: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 4000f738: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 4000f73c: 85 28 a0 02 sll %g2, 2, %g2 4000f740: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 4000f744: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Barrier_Information, &the_barrier->Object, (Objects_Name) name ); *id = the_barrier->Object.id; 4000f748: c2 26 c0 00 st %g1, [ %i3 ] _Thread_Enable_dispatch(); 4000f74c: 7f ff f0 18 call 4000b7ac <_Thread_Enable_dispatch> 4000f750: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; } 4000f754: 81 c7 e0 08 ret 4000f758: 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; 4000f75c: 82 10 20 01 mov 1, %g1 4000f760: c2 27 bf f8 st %g1, [ %fp + -8 ] 4000f764: 03 10 00 8a sethi %hi(0x40022800), %g1 4000f768: c4 00 61 a8 ld [ %g1 + 0x1a8 ], %g2 ! 400229a8 <_Thread_Dispatch_disable_level> the_attributes.maximum_count = maximum_waiters; 4000f76c: f4 27 bf fc st %i2, [ %fp + -4 ] 4000f770: 84 00 a0 01 inc %g2 4000f774: c4 20 61 a8 st %g2, [ %g1 + 0x1a8 ] 4000f778: 25 10 00 8b sethi %hi(0x40022c00), %l2 4000f77c: 7f ff ec 5e call 4000a8f4 <_Objects_Allocate> 4000f780: 90 14 a0 28 or %l2, 0x28, %o0 ! 40022c28 <_Barrier_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _Barrier_Allocate(); if ( !the_barrier ) { 4000f784: a2 92 20 00 orcc %o0, 0, %l1 4000f788: 12 bf ff e6 bne 4000f720 4000f78c: 90 04 60 14 add %l1, 0x14, %o0 _Thread_Enable_dispatch(); 4000f790: 7f ff f0 07 call 4000b7ac <_Thread_Enable_dispatch> 4000f794: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 4000f798: 81 c7 e0 08 ret 4000f79c: 81 e8 00 00 restore =============================================================================== 40007c7c : rtems_chain_control *chain, rtems_chain_node *node, rtems_id task, rtems_event_set events ) { 40007c7c: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE bool rtems_chain_append_with_empty_check( rtems_chain_control *chain, rtems_chain_node *node ) { return _Chain_Append_with_empty_check( chain, node ); 40007c80: 90 10 00 18 mov %i0, %o0 40007c84: 40 00 01 63 call 40008210 <_Chain_Append_with_empty_check> 40007c88: 92 10 00 19 mov %i1, %o1 rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_append_with_empty_check( chain, node ); if ( was_empty ) { 40007c8c: 80 8a 20 ff btst 0xff, %o0 40007c90: 12 80 00 04 bne 40007ca0 <== ALWAYS TAKEN 40007c94: b0 10 20 00 clr %i0 sc = rtems_event_send( task, events ); } return sc; } 40007c98: 81 c7 e0 08 ret <== NOT EXECUTED 40007c9c: 81 e8 00 00 restore <== NOT EXECUTED { rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_append_with_empty_check( chain, node ); if ( was_empty ) { sc = rtems_event_send( task, events ); 40007ca0: b0 10 00 1a mov %i2, %i0 40007ca4: 7f ff fd 64 call 40007234 40007ca8: 93 e8 00 1b restore %g0, %i3, %o1 =============================================================================== 40007cb0 : rtems_chain_control *chain, rtems_id task, rtems_event_set events, rtems_chain_node **node ) { 40007cb0: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE bool rtems_chain_get_with_empty_check( rtems_chain_control *chain, rtems_chain_node **node ) { return _Chain_Get_with_empty_check( chain, node ); 40007cb4: 90 10 00 18 mov %i0, %o0 40007cb8: 40 00 01 7d call 400082ac <_Chain_Get_with_empty_check> 40007cbc: 92 10 00 1b mov %i3, %o1 rtems_status_code sc = RTEMS_SUCCESSFUL; bool is_empty = rtems_chain_get_with_empty_check( chain, node ); if ( is_empty ) { 40007cc0: 80 8a 20 ff btst 0xff, %o0 40007cc4: 12 80 00 04 bne 40007cd4 <== ALWAYS TAKEN 40007cc8: b0 10 20 00 clr %i0 sc = rtems_event_send( task, events ); } return sc; } 40007ccc: 81 c7 e0 08 ret <== NOT EXECUTED 40007cd0: 81 e8 00 00 restore <== NOT EXECUTED { rtems_status_code sc = RTEMS_SUCCESSFUL; bool is_empty = rtems_chain_get_with_empty_check( chain, node ); if ( is_empty ) { sc = rtems_event_send( task, events ); 40007cd4: b0 10 00 19 mov %i1, %i0 40007cd8: 7f ff fd 57 call 40007234 40007cdc: 93 e8 00 1a restore %g0, %i2, %o1 =============================================================================== 40007ce4 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 40007ce4: 9d e3 bf 98 save %sp, -104, %sp 40007ce8: a0 10 00 18 mov %i0, %l0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 40007cec: a4 07 bf fc add %fp, -4, %l2 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 40007cf0: 40 00 01 87 call 4000830c <_Chain_Get> 40007cf4: 90 10 00 10 mov %l0, %o0 40007cf8: 92 10 20 00 clr %o1 40007cfc: a2 10 00 08 mov %o0, %l1 40007d00: 94 10 00 1a mov %i2, %o2 40007d04: 90 10 00 19 mov %i1, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 40007d08: 80 a4 60 00 cmp %l1, 0 40007d0c: 12 80 00 0a bne 40007d34 40007d10: 96 10 00 12 mov %l2, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 40007d14: 7f ff fc e4 call 400070a4 40007d18: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 40007d1c: 80 a2 20 00 cmp %o0, 0 40007d20: 02 bf ff f4 be 40007cf0 <== NEVER TAKEN 40007d24: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 40007d28: e2 26 c0 00 st %l1, [ %i3 ] return sc; } 40007d2c: 81 c7 e0 08 ret 40007d30: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 40007d34: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 40007d38: e2 26 c0 00 st %l1, [ %i3 ] return sc; } 40007d3c: 81 c7 e0 08 ret 40007d40: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 40007d44 : rtems_chain_control *chain, rtems_chain_node *node, rtems_id task, rtems_event_set events ) { 40007d44: 9d e3 bf a0 save %sp, -96, %sp RTEMS_INLINE_ROUTINE bool rtems_chain_prepend_with_empty_check( rtems_chain_control *chain, rtems_chain_node *node ) { return _Chain_Prepend_with_empty_check( chain, node ); 40007d48: 90 10 00 18 mov %i0, %o0 40007d4c: 40 00 01 8e call 40008384 <_Chain_Prepend_with_empty_check> 40007d50: 92 10 00 19 mov %i1, %o1 rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_prepend_with_empty_check( chain, node ); if (was_empty) { 40007d54: 80 8a 20 ff btst 0xff, %o0 40007d58: 12 80 00 04 bne 40007d68 <== ALWAYS TAKEN 40007d5c: b0 10 20 00 clr %i0 sc = rtems_event_send( task, events ); } return sc; } 40007d60: 81 c7 e0 08 ret <== NOT EXECUTED 40007d64: 81 e8 00 00 restore <== NOT EXECUTED { rtems_status_code sc = RTEMS_SUCCESSFUL; bool was_empty = rtems_chain_prepend_with_empty_check( chain, node ); if (was_empty) { sc = rtems_event_send( task, events ); 40007d68: b0 10 00 1a mov %i2, %i0 40007d6c: 7f ff fd 32 call 40007234 40007d70: 93 e8 00 1b restore %g0, %i3, %o1 =============================================================================== 40008d38 : 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 ) { 40008d38: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 40008d3c: 03 10 00 6a sethi %hi(0x4001a800), %g1 40008d40: c4 00 63 64 ld [ %g1 + 0x364 ], %g2 ! 4001ab64 <_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 ) { 40008d44: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 40008d48: 03 10 00 6a sethi %hi(0x4001a800), %g1 if ( rtems_interrupt_is_in_progress() ) 40008d4c: 80 a0 a0 00 cmp %g2, 0 40008d50: 12 80 00 42 bne 40008e58 40008d54: c8 00 63 bc ld [ %g1 + 0x3bc ], %g4 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 40008d58: 80 a6 a0 00 cmp %i2, 0 40008d5c: 02 80 00 50 be 40008e9c 40008d60: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; /* Set it to an invalid value */ *registered_major = major_limit; if ( driver_table == NULL ) 40008d64: 80 a6 60 00 cmp %i1, 0 40008d68: 02 80 00 4d be 40008e9c 40008d6c: 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; 40008d70: c4 06 40 00 ld [ %i1 ], %g2 40008d74: 80 a0 a0 00 cmp %g2, 0 40008d78: 22 80 00 46 be,a 40008e90 40008d7c: 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 ) 40008d80: 80 a1 00 18 cmp %g4, %i0 40008d84: 08 80 00 33 bleu 40008e50 40008d88: 01 00 00 00 nop rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 40008d8c: 05 10 00 6a sethi %hi(0x4001a800), %g2 40008d90: c8 00 a0 f8 ld [ %g2 + 0xf8 ], %g4 ! 4001a8f8 <_Thread_Dispatch_disable_level> 40008d94: 88 01 20 01 inc %g4 40008d98: c8 20 a0 f8 st %g4, [ %g2 + 0xf8 ] return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 40008d9c: 80 a6 20 00 cmp %i0, 0 40008da0: 12 80 00 30 bne 40008e60 40008da4: 1b 10 00 6a sethi %hi(0x4001a800), %o5 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 40008da8: c8 00 63 bc ld [ %g1 + 0x3bc ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 40008dac: 80 a1 20 00 cmp %g4, 0 40008db0: 22 80 00 3d be,a 40008ea4 <== NEVER TAKEN 40008db4: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED 40008db8: 10 80 00 05 b 40008dcc 40008dbc: c2 03 63 c0 ld [ %o5 + 0x3c0 ], %g1 40008dc0: 80 a1 00 18 cmp %g4, %i0 40008dc4: 08 80 00 0a bleu 40008dec 40008dc8: 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; 40008dcc: c4 00 40 00 ld [ %g1 ], %g2 40008dd0: 80 a0 a0 00 cmp %g2, 0 40008dd4: 32 bf ff fb bne,a 40008dc0 40008dd8: b0 06 20 01 inc %i0 40008ddc: c4 00 60 04 ld [ %g1 + 4 ], %g2 40008de0: 80 a0 a0 00 cmp %g2, 0 40008de4: 32 bf ff f7 bne,a 40008dc0 40008de8: b0 06 20 01 inc %i0 } /* Assigns invalid value in case of failure */ *major = m; if ( m != n ) 40008dec: 80 a1 00 18 cmp %g4, %i0 40008df0: 02 80 00 2d be 40008ea4 40008df4: f0 26 80 00 st %i0, [ %i2 ] 40008df8: 83 2e 20 03 sll %i0, 3, %g1 40008dfc: 85 2e 20 05 sll %i0, 5, %g2 40008e00: 84 20 80 01 sub %g2, %g1, %g2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40008e04: c8 03 63 c0 ld [ %o5 + 0x3c0 ], %g4 40008e08: da 00 c0 00 ld [ %g3 ], %o5 40008e0c: 82 01 00 02 add %g4, %g2, %g1 40008e10: da 21 00 02 st %o5, [ %g4 + %g2 ] 40008e14: c4 00 e0 04 ld [ %g3 + 4 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 40008e18: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40008e1c: c4 20 60 04 st %g2, [ %g1 + 4 ] 40008e20: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 40008e24: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 40008e28: c4 20 60 08 st %g2, [ %g1 + 8 ] 40008e2c: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 40008e30: c4 20 60 0c st %g2, [ %g1 + 0xc ] 40008e34: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 40008e38: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 40008e3c: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 40008e40: 40 00 07 3c call 4000ab30 <_Thread_Enable_dispatch> 40008e44: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 40008e48: 40 00 21 a8 call 400114e8 40008e4c: 81 e8 00 00 restore } 40008e50: 81 c7 e0 08 ret 40008e54: 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; 40008e58: 81 c7 e0 08 ret 40008e5c: 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; 40008e60: c2 03 63 c0 ld [ %o5 + 0x3c0 ], %g1 40008e64: 89 2e 20 05 sll %i0, 5, %g4 40008e68: 85 2e 20 03 sll %i0, 3, %g2 40008e6c: 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; 40008e70: c8 00 40 02 ld [ %g1 + %g2 ], %g4 40008e74: 80 a1 20 00 cmp %g4, 0 40008e78: 02 80 00 0f be 40008eb4 40008e7c: 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(); 40008e80: 40 00 07 2c call 4000ab30 <_Thread_Enable_dispatch> 40008e84: b0 10 20 0c mov 0xc, %i0 return RTEMS_RESOURCE_IN_USE; 40008e88: 81 c7 e0 08 ret 40008e8c: 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; 40008e90: 80 a0 a0 00 cmp %g2, 0 40008e94: 32 bf ff bc bne,a 40008d84 40008e98: 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; 40008e9c: 81 c7 e0 08 ret 40008ea0: 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(); 40008ea4: 40 00 07 23 call 4000ab30 <_Thread_Enable_dispatch> 40008ea8: b0 10 20 05 mov 5, %i0 return sc; 40008eac: 81 c7 e0 08 ret 40008eb0: 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; 40008eb4: c2 00 60 04 ld [ %g1 + 4 ], %g1 40008eb8: 80 a0 60 00 cmp %g1, 0 40008ebc: 12 bf ff f1 bne 40008e80 40008ec0: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 40008ec4: 10 bf ff d0 b 40008e04 40008ec8: f0 26 80 00 st %i0, [ %i2 ] =============================================================================== 4000a234 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 4000a234: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 4000a238: 80 a6 20 00 cmp %i0, 0 4000a23c: 02 80 00 20 be 4000a2bc <== NEVER TAKEN 4000a240: 25 10 00 a1 sethi %hi(0x40028400), %l2 4000a244: a4 14 a1 b0 or %l2, 0x1b0, %l2 ! 400285b0 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 4000a248: a6 04 a0 0c add %l2, 0xc, %l3 #if defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 4000a24c: c2 04 80 00 ld [ %l2 ], %g1 4000a250: e2 00 60 04 ld [ %g1 + 4 ], %l1 if ( !information ) 4000a254: 80 a4 60 00 cmp %l1, 0 4000a258: 22 80 00 16 be,a 4000a2b0 4000a25c: a4 04 a0 04 add %l2, 4, %l2 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 4000a260: c2 14 60 10 lduh [ %l1 + 0x10 ], %g1 4000a264: 84 90 60 00 orcc %g1, 0, %g2 4000a268: 22 80 00 12 be,a 4000a2b0 <== NEVER TAKEN 4000a26c: a4 04 a0 04 add %l2, 4, %l2 <== NOT EXECUTED 4000a270: a0 10 20 01 mov 1, %l0 the_thread = (Thread_Control *)information->local_table[ i ]; 4000a274: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 4000a278: 83 2c 20 02 sll %l0, 2, %g1 4000a27c: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 4000a280: 90 90 60 00 orcc %g1, 0, %o0 4000a284: 02 80 00 05 be 4000a298 <== NEVER TAKEN 4000a288: a0 04 20 01 inc %l0 continue; (*routine)(the_thread); 4000a28c: 9f c6 00 00 call %i0 4000a290: 01 00 00 00 nop 4000a294: 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++ ) { 4000a298: 83 28 a0 10 sll %g2, 0x10, %g1 4000a29c: 83 30 60 10 srl %g1, 0x10, %g1 4000a2a0: 80 a0 40 10 cmp %g1, %l0 4000a2a4: 3a bf ff f5 bcc,a 4000a278 4000a2a8: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 4000a2ac: 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++ ) { 4000a2b0: 80 a4 80 13 cmp %l2, %l3 4000a2b4: 32 bf ff e7 bne,a 4000a250 4000a2b8: c2 04 80 00 ld [ %l2 ], %g1 4000a2bc: 81 c7 e0 08 ret 4000a2c0: 81 e8 00 00 restore =============================================================================== 40008db8 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 40008db8: 9d e3 bf a0 save %sp, -96, %sp 40008dbc: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 40008dc0: 80 a6 a0 00 cmp %i2, 0 40008dc4: 02 80 00 21 be 40008e48 40008dc8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 40008dcc: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 40008dd0: b0 10 20 0a mov 0xa, %i0 * Validate parameters and look up information structure. */ if ( !info ) return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 40008dd4: 40 00 07 76 call 4000abac <_Objects_Get_information> 40008dd8: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 40008ddc: 80 a2 20 00 cmp %o0, 0 40008de0: 02 80 00 1a be 40008e48 40008de4: 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; 40008de8: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 40008dec: 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; 40008df0: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 40008df4: 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; 40008df8: 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; 40008dfc: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 40008e00: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 40008e04: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 40008e08: 80 a1 20 00 cmp %g4, 0 40008e0c: 02 80 00 0d be 40008e40 <== NEVER TAKEN 40008e10: 84 10 20 00 clr %g2 40008e14: da 02 20 1c ld [ %o0 + 0x1c ], %o5 40008e18: 86 10 20 01 mov 1, %g3 40008e1c: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 40008e20: 87 28 e0 02 sll %g3, 2, %g3 40008e24: 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++ ) 40008e28: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 40008e2c: 80 a0 00 03 cmp %g0, %g3 40008e30: 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++ ) 40008e34: 80 a1 00 01 cmp %g4, %g1 40008e38: 1a bf ff fa bcc 40008e20 40008e3c: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 40008e40: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 40008e44: b0 10 20 00 clr %i0 } 40008e48: 81 c7 e0 08 ret 40008e4c: 81 e8 00 00 restore =============================================================================== 40014c44 : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 40014c44: 9d e3 bf a0 save %sp, -96, %sp 40014c48: a0 10 00 18 mov %i0, %l0 register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 40014c4c: 80 a4 20 00 cmp %l0, 0 40014c50: 02 80 00 34 be 40014d20 40014c54: b0 10 20 03 mov 3, %i0 return RTEMS_INVALID_NAME; if ( !starting_address ) 40014c58: 80 a6 60 00 cmp %i1, 0 40014c5c: 02 80 00 31 be 40014d20 40014c60: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !id ) 40014c64: 80 a7 60 00 cmp %i5, 0 40014c68: 02 80 00 2e be 40014d20 <== NEVER TAKEN 40014c6c: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 40014c70: 02 80 00 2e be 40014d28 40014c74: 80 a6 a0 00 cmp %i2, 0 40014c78: 02 80 00 2c be 40014d28 40014c7c: 80 a6 80 1b cmp %i2, %i3 40014c80: 0a 80 00 28 bcs 40014d20 40014c84: b0 10 20 08 mov 8, %i0 40014c88: 80 8e e0 07 btst 7, %i3 40014c8c: 12 80 00 25 bne 40014d20 40014c90: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 40014c94: 12 80 00 23 bne 40014d20 40014c98: b0 10 20 09 mov 9, %i0 40014c9c: 03 10 00 f8 sethi %hi(0x4003e000), %g1 40014ca0: c4 00 62 f8 ld [ %g1 + 0x2f8 ], %g2 ! 4003e2f8 <_Thread_Dispatch_disable_level> 40014ca4: 84 00 a0 01 inc %g2 40014ca8: c4 20 62 f8 st %g2, [ %g1 + 0x2f8 ] * 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 ); 40014cac: 25 10 00 f8 sethi %hi(0x4003e000), %l2 40014cb0: 40 00 13 13 call 400198fc <_Objects_Allocate> 40014cb4: 90 14 a1 04 or %l2, 0x104, %o0 ! 4003e104 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 40014cb8: a2 92 20 00 orcc %o0, 0, %l1 40014cbc: 02 80 00 1d be 40014d30 40014cc0: 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; 40014cc4: f8 24 60 1c st %i4, [ %l1 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 40014cc8: f2 24 60 10 st %i1, [ %l1 + 0x10 ] the_partition->length = length; 40014ccc: f4 24 60 14 st %i2, [ %l1 + 0x14 ] the_partition->buffer_size = buffer_size; 40014cd0: 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 ); 40014cd4: 90 10 00 1a mov %i2, %o0 40014cd8: 40 00 61 68 call 4002d278 <.udiv> 40014cdc: 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, 40014ce0: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 40014ce4: 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, 40014ce8: 96 10 00 1b mov %i3, %o3 40014cec: b8 04 60 24 add %l1, 0x24, %i4 40014cf0: 40 00 0c d4 call 40018040 <_Chain_Initialize> 40014cf4: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 40014cf8: c4 14 60 0a lduh [ %l1 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 40014cfc: a4 14 a1 04 or %l2, 0x104, %l2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40014d00: c6 04 a0 1c ld [ %l2 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 40014d04: c2 04 60 08 ld [ %l1 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 40014d08: 85 28 a0 02 sll %g2, 2, %g2 40014d0c: e2 20 c0 02 st %l1, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 40014d10: e0 24 60 0c st %l0, [ %l1 + 0xc ] &_Partition_Information, &the_partition->Object, (Objects_Name) name ); *id = the_partition->Object.id; 40014d14: c2 27 40 00 st %g1, [ %i5 ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 40014d18: 40 00 16 d9 call 4001a87c <_Thread_Enable_dispatch> 40014d1c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 40014d20: 81 c7 e0 08 ret 40014d24: 81 e8 00 00 restore } 40014d28: 81 c7 e0 08 ret 40014d2c: 91 e8 20 08 restore %g0, 8, %o0 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 40014d30: 40 00 16 d3 call 4001a87c <_Thread_Enable_dispatch> 40014d34: b0 10 20 05 mov 5, %i0 return RTEMS_TOO_MANY; 40014d38: 81 c7 e0 08 ret 40014d3c: 81 e8 00 00 restore =============================================================================== 40008374 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 40008374: 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 ); 40008378: 11 10 00 7f sethi %hi(0x4001fc00), %o0 4000837c: 92 10 00 18 mov %i0, %o1 40008380: 90 12 22 74 or %o0, 0x274, %o0 40008384: 40 00 09 74 call 4000a954 <_Objects_Get> 40008388: 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 ) { 4000838c: c2 07 bf fc ld [ %fp + -4 ], %g1 40008390: 80 a0 60 00 cmp %g1, 0 40008394: 02 80 00 04 be 400083a4 40008398: a0 10 00 08 mov %o0, %l0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 4000839c: 81 c7 e0 08 ret 400083a0: 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 ) ) { 400083a4: 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 ); 400083a8: 23 10 00 80 sethi %hi(0x40020000), %l1 400083ac: a2 14 62 4c or %l1, 0x24c, %l1 ! 4002024c <_Per_CPU_Information> 400083b0: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400083b4: 80 a0 80 01 cmp %g2, %g1 400083b8: 02 80 00 06 be 400083d0 400083bc: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 400083c0: 40 00 0b de call 4000b338 <_Thread_Enable_dispatch> 400083c4: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 400083c8: 81 c7 e0 08 ret 400083cc: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 400083d0: 12 80 00 0f bne 4000840c 400083d4: 01 00 00 00 nop switch ( the_period->state ) { 400083d8: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 400083dc: 80 a0 60 04 cmp %g1, 4 400083e0: 08 80 00 06 bleu 400083f8 <== ALWAYS TAKEN 400083e4: 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(); 400083e8: 40 00 0b d4 call 4000b338 <_Thread_Enable_dispatch> 400083ec: 01 00 00 00 nop return RTEMS_TIMEOUT; 400083f0: 81 c7 e0 08 ret 400083f4: 81 e8 00 00 restore _Thread_Enable_dispatch(); return RTEMS_NOT_OWNER_OF_RESOURCE; } if ( length == RTEMS_PERIOD_STATUS ) { switch ( the_period->state ) { 400083f8: 83 28 60 02 sll %g1, 2, %g1 400083fc: 05 10 00 78 sethi %hi(0x4001e000), %g2 40008400: 84 10 a0 d4 or %g2, 0xd4, %g2 ! 4001e0d4 40008404: 10 bf ff f9 b 400083e8 40008408: f0 00 80 01 ld [ %g2 + %g1 ], %i0 } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 4000840c: 7f ff ea 2c call 40002cbc 40008410: 01 00 00 00 nop 40008414: a6 10 00 08 mov %o0, %l3 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 40008418: e4 04 20 38 ld [ %l0 + 0x38 ], %l2 4000841c: 80 a4 a0 00 cmp %l2, 0 40008420: 02 80 00 14 be 40008470 40008424: 80 a4 a0 02 cmp %l2, 2 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 40008428: 02 80 00 29 be 400084cc 4000842c: 80 a4 a0 04 cmp %l2, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 40008430: 12 bf ff e6 bne 400083c8 <== NEVER TAKEN 40008434: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 40008438: 7f ff ff 8f call 40008274 <_Rate_monotonic_Update_statistics> 4000843c: 90 10 00 10 mov %l0, %o0 _ISR_Enable( level ); 40008440: 7f ff ea 23 call 40002ccc 40008444: 90 10 00 13 mov %l3, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 40008448: 82 10 20 02 mov 2, %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 4000844c: 92 04 20 10 add %l0, 0x10, %o1 40008450: 11 10 00 80 sethi %hi(0x40020000), %o0 the_period->next_length = length; 40008454: f2 24 20 3c st %i1, [ %l0 + 0x3c ] 40008458: 90 12 20 ac or %o0, 0xac, %o0 */ _Rate_monotonic_Update_statistics( the_period ); _ISR_Enable( level ); the_period->state = RATE_MONOTONIC_ACTIVE; 4000845c: c2 24 20 38 st %g1, [ %l0 + 0x38 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 40008460: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40008464: 40 00 10 f3 call 4000c830 <_Watchdog_Insert> 40008468: b0 10 20 06 mov 6, %i0 4000846c: 30 bf ff df b,a 400083e8 return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 40008470: 7f ff ea 17 call 40002ccc 40008474: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 40008478: 7f ff ff 63 call 40008204 <_Rate_monotonic_Initiate_statistics> 4000847c: 90 10 00 10 mov %l0, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 40008480: 82 10 20 02 mov 2, %g1 40008484: 92 04 20 10 add %l0, 0x10, %o1 40008488: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 4000848c: 11 10 00 80 sethi %hi(0x40020000), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40008490: 03 10 00 22 sethi %hi(0x40008800), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 40008494: 90 12 20 ac or %o0, 0xac, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40008498: 82 10 60 48 or %g1, 0x48, %g1 the_watchdog->id = id; 4000849c: f0 24 20 30 st %i0, [ %l0 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 400084a0: c2 24 20 2c st %g1, [ %l0 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 400084a4: c0 24 20 18 clr [ %l0 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 400084a8: c0 24 20 34 clr [ %l0 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 400084ac: f2 24 20 3c st %i1, [ %l0 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 400084b0: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 400084b4: 40 00 10 df call 4000c830 <_Watchdog_Insert> 400084b8: b0 10 20 00 clr %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 400084bc: 40 00 0b 9f call 4000b338 <_Thread_Enable_dispatch> 400084c0: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 400084c4: 81 c7 e0 08 ret 400084c8: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 400084cc: 7f ff ff 6a call 40008274 <_Rate_monotonic_Update_statistics> 400084d0: 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; 400084d4: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 400084d8: 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; 400084dc: c2 24 20 38 st %g1, [ %l0 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 400084e0: 7f ff e9 fb call 40002ccc 400084e4: 90 10 00 13 mov %l3, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 400084e8: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400084ec: c4 04 20 08 ld [ %l0 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 400084f0: 90 10 00 01 mov %g1, %o0 400084f4: 13 00 00 10 sethi %hi(0x4000), %o1 400084f8: 40 00 0e 04 call 4000bd08 <_Thread_Set_state> 400084fc: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 40008500: 7f ff e9 ef call 40002cbc 40008504: 01 00 00 00 nop local_state = the_period->state; 40008508: e6 04 20 38 ld [ %l0 + 0x38 ], %l3 the_period->state = RATE_MONOTONIC_ACTIVE; 4000850c: e4 24 20 38 st %l2, [ %l0 + 0x38 ] _ISR_Enable( level ); 40008510: 7f ff e9 ef call 40002ccc 40008514: 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 ) 40008518: 80 a4 e0 03 cmp %l3, 3 4000851c: 22 80 00 06 be,a 40008534 40008520: d0 04 60 0c ld [ %l1 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 40008524: 40 00 0b 85 call 4000b338 <_Thread_Enable_dispatch> 40008528: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 4000852c: 81 c7 e0 08 ret 40008530: 81 e8 00 00 restore /* * 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 ); 40008534: 40 00 0a 8d call 4000af68 <_Thread_Clear_state> 40008538: 13 00 00 10 sethi %hi(0x4000), %o1 4000853c: 30 bf ff fa b,a 40008524 =============================================================================== 40008540 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 40008540: 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 ) 40008544: 80 a6 60 00 cmp %i1, 0 40008548: 02 80 00 4c be 40008678 <== NEVER TAKEN 4000854c: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 40008550: 13 10 00 78 sethi %hi(0x4001e000), %o1 40008554: 9f c6 40 00 call %i1 40008558: 92 12 60 e8 or %o1, 0xe8, %o1 ! 4001e0e8 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 4000855c: 90 10 00 18 mov %i0, %o0 40008560: 13 10 00 78 sethi %hi(0x4001e000), %o1 40008564: 9f c6 40 00 call %i1 40008568: 92 12 61 08 or %o1, 0x108, %o1 ! 4001e108 (*print)( context, "--- Wall times are in seconds ---\n" ); 4000856c: 90 10 00 18 mov %i0, %o0 40008570: 13 10 00 78 sethi %hi(0x4001e000), %o1 40008574: 9f c6 40 00 call %i1 40008578: 92 12 61 30 or %o1, 0x130, %o1 ! 4001e130 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 4000857c: 90 10 00 18 mov %i0, %o0 40008580: 13 10 00 78 sethi %hi(0x4001e000), %o1 40008584: 9f c6 40 00 call %i1 40008588: 92 12 61 58 or %o1, 0x158, %o1 ! 4001e158 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 4000858c: 90 10 00 18 mov %i0, %o0 40008590: 13 10 00 78 sethi %hi(0x4001e000), %o1 40008594: 9f c6 40 00 call %i1 40008598: 92 12 61 a8 or %o1, 0x1a8, %o1 ! 4001e1a8 /* * 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 ; 4000859c: 23 10 00 7f sethi %hi(0x4001fc00), %l1 400085a0: a2 14 62 74 or %l1, 0x274, %l1 ! 4001fe74 <_Rate_monotonic_Information> 400085a4: e0 04 60 08 ld [ %l1 + 8 ], %l0 400085a8: c2 04 60 0c ld [ %l1 + 0xc ], %g1 400085ac: 80 a4 00 01 cmp %l0, %g1 400085b0: 18 80 00 32 bgu 40008678 <== NEVER TAKEN 400085b4: 2f 10 00 78 sethi %hi(0x4001e000), %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, 400085b8: 39 10 00 78 sethi %hi(0x4001e000), %i4 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 400085bc: 2b 10 00 74 sethi %hi(0x4001d000), %l5 400085c0: 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 ); 400085c4: 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 ); 400085c8: a6 07 bf f8 add %fp, -8, %l3 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 400085cc: ae 15 e1 f8 or %l7, 0x1f8, %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; 400085d0: ac 07 bf b8 add %fp, -72, %l6 _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 400085d4: a8 07 bf f0 add %fp, -16, %l4 (*print)( context, 400085d8: b8 17 22 10 or %i4, 0x210, %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; 400085dc: 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" ); 400085e0: 10 80 00 06 b 400085f8 400085e4: aa 15 63 d8 or %l5, 0x3d8, %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++ ) { 400085e8: 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 ; 400085ec: 80 a0 40 10 cmp %g1, %l0 400085f0: 0a 80 00 22 bcs 40008678 400085f4: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 400085f8: 90 10 00 10 mov %l0, %o0 400085fc: 40 00 19 3b call 4000eae8 40008600: 92 10 00 12 mov %l2, %o1 if ( status != RTEMS_SUCCESSFUL ) 40008604: 80 a2 20 00 cmp %o0, 0 40008608: 32 bf ff f8 bne,a 400085e8 4000860c: 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 ); 40008610: 92 10 00 1d mov %i5, %o1 40008614: 40 00 19 64 call 4000eba4 40008618: 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 ); 4000861c: d0 07 bf d8 ld [ %fp + -40 ], %o0 40008620: 94 10 00 13 mov %l3, %o2 40008624: 40 00 00 b9 call 40008908 40008628: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 4000862c: d8 1f bf a0 ldd [ %fp + -96 ], %o4 40008630: 92 10 00 17 mov %l7, %o1 40008634: 94 10 00 10 mov %l0, %o2 40008638: 90 10 00 18 mov %i0, %o0 4000863c: 9f c6 40 00 call %i1 40008640: 96 10 00 13 mov %l3, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 40008644: 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 ); 40008648: 90 10 00 16 mov %l6, %o0 4000864c: 94 10 00 14 mov %l4, %o2 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 40008650: 80 a0 60 00 cmp %g1, 0 40008654: 12 80 00 0b bne 40008680 40008658: 92 10 00 15 mov %l5, %o1 (*print)( context, "\n" ); 4000865c: 9f c6 40 00 call %i1 40008660: 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 ; 40008664: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 40008668: 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 ; 4000866c: 80 a0 40 10 cmp %g1, %l0 40008670: 1a bf ff e3 bcc 400085fc <== ALWAYS TAKEN 40008674: 90 10 00 10 mov %l0, %o0 40008678: 81 c7 e0 08 ret 4000867c: 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 ); 40008680: 40 00 0f 2f call 4000c33c <_Timespec_Divide_by_integer> 40008684: 92 10 00 01 mov %g1, %o1 (*print)( context, 40008688: d0 07 bf ac ld [ %fp + -84 ], %o0 4000868c: 40 00 46 43 call 40019f98 <.div> 40008690: 92 10 23 e8 mov 0x3e8, %o1 40008694: 96 10 00 08 mov %o0, %o3 40008698: d0 07 bf b4 ld [ %fp + -76 ], %o0 4000869c: d6 27 bf 9c st %o3, [ %fp + -100 ] 400086a0: 40 00 46 3e call 40019f98 <.div> 400086a4: 92 10 23 e8 mov 0x3e8, %o1 400086a8: c2 07 bf f0 ld [ %fp + -16 ], %g1 400086ac: b6 10 00 08 mov %o0, %i3 400086b0: d0 07 bf f4 ld [ %fp + -12 ], %o0 400086b4: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 400086b8: 40 00 46 38 call 40019f98 <.div> 400086bc: 92 10 23 e8 mov 0x3e8, %o1 400086c0: d8 07 bf b0 ld [ %fp + -80 ], %o4 400086c4: d6 07 bf 9c ld [ %fp + -100 ], %o3 400086c8: d4 07 bf a8 ld [ %fp + -88 ], %o2 400086cc: 9a 10 00 1b mov %i3, %o5 400086d0: 92 10 00 1c mov %i4, %o1 400086d4: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 400086d8: 9f c6 40 00 call %i1 400086dc: 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); 400086e0: d2 07 bf a0 ld [ %fp + -96 ], %o1 400086e4: 94 10 00 14 mov %l4, %o2 400086e8: 40 00 0f 15 call 4000c33c <_Timespec_Divide_by_integer> 400086ec: 90 10 00 1a mov %i2, %o0 (*print)( context, 400086f0: d0 07 bf c4 ld [ %fp + -60 ], %o0 400086f4: 40 00 46 29 call 40019f98 <.div> 400086f8: 92 10 23 e8 mov 0x3e8, %o1 400086fc: 96 10 00 08 mov %o0, %o3 40008700: d0 07 bf cc ld [ %fp + -52 ], %o0 40008704: d6 27 bf 9c st %o3, [ %fp + -100 ] 40008708: 40 00 46 24 call 40019f98 <.div> 4000870c: 92 10 23 e8 mov 0x3e8, %o1 40008710: c2 07 bf f0 ld [ %fp + -16 ], %g1 40008714: b6 10 00 08 mov %o0, %i3 40008718: d0 07 bf f4 ld [ %fp + -12 ], %o0 4000871c: 92 10 23 e8 mov 0x3e8, %o1 40008720: 40 00 46 1e call 40019f98 <.div> 40008724: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 40008728: d4 07 bf c0 ld [ %fp + -64 ], %o2 4000872c: d6 07 bf 9c ld [ %fp + -100 ], %o3 40008730: d8 07 bf c8 ld [ %fp + -56 ], %o4 40008734: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 40008738: 13 10 00 78 sethi %hi(0x4001e000), %o1 4000873c: 90 10 00 18 mov %i0, %o0 40008740: 92 12 62 30 or %o1, 0x230, %o1 40008744: 9f c6 40 00 call %i1 40008748: 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 ; 4000874c: 10 bf ff a7 b 400085e8 40008750: c2 04 60 0c ld [ %l1 + 0xc ], %g1 =============================================================================== 40008770 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 40008770: 9d e3 bf a0 save %sp, -96, %sp rtems_fatal_error_occurred( 99 ); } } #endif _Thread_Dispatch_disable_level += 1; 40008774: 03 10 00 7f sethi %hi(0x4001fc00), %g1 40008778: c4 00 63 e8 ld [ %g1 + 0x3e8 ], %g2 ! 4001ffe8 <_Thread_Dispatch_disable_level> 4000877c: 84 00 a0 01 inc %g2 40008780: c4 20 63 e8 st %g2, [ %g1 + 0x3e8 ] /* * 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 ; 40008784: 23 10 00 7f sethi %hi(0x4001fc00), %l1 40008788: a2 14 62 74 or %l1, 0x274, %l1 ! 4001fe74 <_Rate_monotonic_Information> 4000878c: e0 04 60 08 ld [ %l1 + 8 ], %l0 40008790: c2 04 60 0c ld [ %l1 + 0xc ], %g1 40008794: 80 a4 00 01 cmp %l0, %g1 40008798: 18 80 00 09 bgu 400087bc <== NEVER TAKEN 4000879c: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_reset_statistics( id ); 400087a0: 40 00 00 0a call 400087c8 400087a4: 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 ; 400087a8: c2 04 60 0c ld [ %l1 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 400087ac: 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 ; 400087b0: 80 a0 40 10 cmp %g1, %l0 400087b4: 1a bf ff fb bcc 400087a0 400087b8: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 400087bc: 40 00 0a df call 4000b338 <_Thread_Enable_dispatch> 400087c0: 81 e8 00 00 restore =============================================================================== 4001410c : */ void rtems_shutdown_executive( uint32_t result ) { 4001410c: 9d e3 bf a0 save %sp, -96, %sp if ( _System_state_Is_up( _System_state_Get() ) ) { 40014110: 03 10 00 58 sethi %hi(0x40016000), %g1 40014114: c4 00 63 5c ld [ %g1 + 0x35c ], %g2 ! 4001635c <_System_state_Current> 40014118: 80 a0 a0 03 cmp %g2, 3 4001411c: 02 80 00 06 be 40014134 40014120: 84 10 20 04 mov 4, %g2 _System_state_Set( SYSTEM_STATE_SHUTDOWN ); _Thread_Stop_multitasking(); } _Internal_error_Occurred( 40014124: 90 10 20 00 clr %o0 40014128: 92 10 20 01 mov 1, %o1 4001412c: 7f ff d1 0e call 40008564 <_Internal_error_Occurred> 40014130: 94 10 20 14 mov 0x14, %o2 * if we were running within the same context, it would work. * * And we will not return to this thread, so there is no point of * saving the context. */ _Context_Restart_self( &_Thread_BSP_context ); 40014134: 11 10 00 58 sethi %hi(0x40016000), %o0 40014138: c4 20 63 5c st %g2, [ %g1 + 0x35c ] 4001413c: 7f ff da cd call 4000ac70 <_CPU_Context_restore> 40014140: 90 12 21 50 or %o0, 0x150, %o0 40014144: 10 bf ff f9 b 40014128 <== NOT EXECUTED 40014148: 90 10 20 00 clr %o0 <== NOT EXECUTED =============================================================================== 40016264 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 40016264: 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 ) 40016268: 80 a6 60 00 cmp %i1, 0 4001626c: 12 80 00 04 bne 4001627c 40016270: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40016274: 81 c7 e0 08 ret 40016278: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 4001627c: 90 10 00 18 mov %i0, %o0 40016280: 40 00 11 8d call 4001a8b4 <_Thread_Get> 40016284: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 40016288: c2 07 bf fc ld [ %fp + -4 ], %g1 4001628c: 80 a0 60 00 cmp %g1, 0 40016290: 02 80 00 05 be 400162a4 40016294: a2 10 00 08 mov %o0, %l1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 40016298: 82 10 20 04 mov 4, %g1 } 4001629c: 81 c7 e0 08 ret 400162a0: 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 ]; 400162a4: e0 02 21 5c ld [ %o0 + 0x15c ], %l0 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 400162a8: c2 04 20 0c ld [ %l0 + 0xc ], %g1 400162ac: 80 a0 60 00 cmp %g1, 0 400162b0: 02 80 00 25 be 40016344 400162b4: 01 00 00 00 nop if ( asr->is_enabled ) { 400162b8: c2 0c 20 08 ldub [ %l0 + 8 ], %g1 400162bc: 80 a0 60 00 cmp %g1, 0 400162c0: 02 80 00 15 be 40016314 400162c4: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 400162c8: 7f ff e2 c7 call 4000ede4 400162cc: 01 00 00 00 nop *signal_set |= signals; 400162d0: c2 04 20 14 ld [ %l0 + 0x14 ], %g1 400162d4: b2 10 40 19 or %g1, %i1, %i1 400162d8: f2 24 20 14 st %i1, [ %l0 + 0x14 ] _ISR_Enable( _level ); 400162dc: 7f ff e2 c6 call 4000edf4 400162e0: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 400162e4: 03 10 00 f9 sethi %hi(0x4003e400), %g1 400162e8: 82 10 61 64 or %g1, 0x164, %g1 ! 4003e564 <_Per_CPU_Information> 400162ec: c4 00 60 08 ld [ %g1 + 8 ], %g2 400162f0: 80 a0 a0 00 cmp %g2, 0 400162f4: 02 80 00 0f be 40016330 400162f8: 01 00 00 00 nop 400162fc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 40016300: 80 a4 40 02 cmp %l1, %g2 40016304: 12 80 00 0b bne 40016330 <== NEVER TAKEN 40016308: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 4001630c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 40016310: 30 80 00 08 b,a 40016330 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 40016314: 7f ff e2 b4 call 4000ede4 40016318: 01 00 00 00 nop *signal_set |= signals; 4001631c: c2 04 20 18 ld [ %l0 + 0x18 ], %g1 40016320: b2 10 40 19 or %g1, %i1, %i1 40016324: f2 24 20 18 st %i1, [ %l0 + 0x18 ] _ISR_Enable( _level ); 40016328: 7f ff e2 b3 call 4000edf4 4001632c: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 40016330: 40 00 11 53 call 4001a87c <_Thread_Enable_dispatch> 40016334: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 40016338: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 4001633c: 81 c7 e0 08 ret 40016340: 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(); 40016344: 40 00 11 4e call 4001a87c <_Thread_Enable_dispatch> 40016348: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 4001634c: 10 bf ff ca b 40016274 40016350: 82 10 20 0b mov 0xb, %g1 ! b =============================================================================== 4000eae8 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 4000eae8: 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 ) 4000eaec: 80 a6 a0 00 cmp %i2, 0 4000eaf0: 02 80 00 43 be 4000ebfc 4000eaf4: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 4000eaf8: 27 10 00 59 sethi %hi(0x40016400), %l3 4000eafc: a6 14 e0 3c or %l3, 0x3c, %l3 ! 4001643c <_Per_CPU_Information> 4000eb00: 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; 4000eb04: c4 0c 20 74 ldub [ %l0 + 0x74 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4000eb08: 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; 4000eb0c: 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 ]; 4000eb10: e2 04 21 5c ld [ %l0 + 0x15c ], %l1 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 4000eb14: a4 60 3f ff subx %g0, -1, %l2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 4000eb18: 80 a0 60 00 cmp %g1, 0 4000eb1c: 12 80 00 3a bne 4000ec04 4000eb20: 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; 4000eb24: c2 0c 60 08 ldub [ %l1 + 8 ], %g1 4000eb28: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 4000eb2c: 7f ff f1 08 call 4000af4c <_CPU_ISR_Get_level> 4000eb30: 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; 4000eb34: a9 2d 20 0a sll %l4, 0xa, %l4 4000eb38: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 4000eb3c: a4 15 00 12 or %l4, %l2, %l2 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 4000eb40: 80 8e 61 00 btst 0x100, %i1 4000eb44: 02 80 00 06 be 4000eb5c 4000eb48: 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; 4000eb4c: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 4000eb50: 80 a0 00 01 cmp %g0, %g1 4000eb54: 82 60 3f ff subx %g0, -1, %g1 4000eb58: c2 2c 20 74 stb %g1, [ %l0 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 4000eb5c: 80 8e 62 00 btst 0x200, %i1 4000eb60: 02 80 00 0b be 4000eb8c 4000eb64: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 4000eb68: 80 8e 22 00 btst 0x200, %i0 4000eb6c: 22 80 00 07 be,a 4000eb88 4000eb70: c0 24 20 7c clr [ %l0 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 4000eb74: 03 10 00 58 sethi %hi(0x40016000), %g1 4000eb78: c2 00 61 38 ld [ %g1 + 0x138 ], %g1 ! 40016138 <_Thread_Ticks_per_timeslice> 4000eb7c: 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; 4000eb80: 82 10 20 01 mov 1, %g1 4000eb84: c2 24 20 7c st %g1, [ %l0 + 0x7c ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 4000eb88: 80 8e 60 0f btst 0xf, %i1 4000eb8c: 12 80 00 3d bne 4000ec80 4000eb90: 01 00 00 00 nop * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 4000eb94: 80 8e 64 00 btst 0x400, %i1 4000eb98: 02 80 00 14 be 4000ebe8 4000eb9c: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 4000eba0: 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; 4000eba4: 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( 4000eba8: 80 a0 00 18 cmp %g0, %i0 4000ebac: 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 ) { 4000ebb0: 80 a0 80 01 cmp %g2, %g1 4000ebb4: 22 80 00 0e be,a 4000ebec 4000ebb8: 03 10 00 58 sethi %hi(0x40016000), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 4000ebbc: 7f ff cc 94 call 40001e0c 4000ebc0: c2 2c 60 08 stb %g1, [ %l1 + 8 ] _signals = information->signals_pending; 4000ebc4: c4 04 60 18 ld [ %l1 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 4000ebc8: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 information->signals_posted = _signals; 4000ebcc: 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; 4000ebd0: c2 24 60 18 st %g1, [ %l1 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 4000ebd4: 7f ff cc 92 call 40001e1c 4000ebd8: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 4000ebdc: c2 04 60 14 ld [ %l1 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 4000ebe0: 80 a0 00 01 cmp %g0, %g1 4000ebe4: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 4000ebe8: 03 10 00 58 sethi %hi(0x40016000), %g1 4000ebec: c4 00 63 5c ld [ %g1 + 0x35c ], %g2 ! 4001635c <_System_state_Current> 4000ebf0: 80 a0 a0 03 cmp %g2, 3 4000ebf4: 02 80 00 11 be 4000ec38 <== ALWAYS TAKEN 4000ebf8: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 4000ebfc: 81 c7 e0 08 ret 4000ec00: 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; 4000ec04: 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; 4000ec08: a4 14 a2 00 or %l2, 0x200, %l2 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 4000ec0c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 4000ec10: 7f ff f0 cf call 4000af4c <_CPU_ISR_Get_level> 4000ec14: 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; 4000ec18: a9 2d 20 0a sll %l4, 0xa, %l4 4000ec1c: a8 15 00 08 or %l4, %o0, %l4 old_mode |= _ISR_Get_level(); 4000ec20: a4 15 00 12 or %l4, %l2, %l2 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 4000ec24: 80 8e 61 00 btst 0x100, %i1 4000ec28: 02 bf ff cd be 4000eb5c 4000ec2c: 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; 4000ec30: 10 bf ff c8 b 4000eb50 4000ec34: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 4000ec38: 80 88 e0 ff btst 0xff, %g3 4000ec3c: 12 80 00 0a bne 4000ec64 4000ec40: c4 04 e0 0c ld [ %l3 + 0xc ], %g2 4000ec44: c6 04 e0 10 ld [ %l3 + 0x10 ], %g3 4000ec48: 80 a0 80 03 cmp %g2, %g3 4000ec4c: 02 bf ff ec be 4000ebfc 4000ec50: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 4000ec54: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 4000ec58: 80 a0 a0 00 cmp %g2, 0 4000ec5c: 02 bf ff e8 be 4000ebfc <== NEVER TAKEN 4000ec60: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 4000ec64: 82 10 20 01 mov 1, %g1 ! 1 4000ec68: c2 2c e0 18 stb %g1, [ %l3 + 0x18 ] } } if ( _System_state_Is_up( _System_state_Get() ) ) { if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 4000ec6c: 7f ff e9 e9 call 40009410 <_Thread_Dispatch> 4000ec70: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 4000ec74: 82 10 20 00 clr %g1 ! 0 } 4000ec78: 81 c7 e0 08 ret 4000ec7c: 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 ); 4000ec80: 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 ) ); 4000ec84: 7f ff cc 66 call 40001e1c 4000ec88: 91 2a 20 08 sll %o0, 8, %o0 * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { 4000ec8c: 10 bf ff c3 b 4000eb98 4000ec90: 80 8e 64 00 btst 0x400, %i1 =============================================================================== 4000bff8 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 4000bff8: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 4000bffc: 80 a6 60 00 cmp %i1, 0 4000c000: 02 80 00 07 be 4000c01c 4000c004: 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 ) ); 4000c008: 03 10 00 69 sethi %hi(0x4001a400), %g1 4000c00c: c2 08 60 e4 ldub [ %g1 + 0xe4 ], %g1 ! 4001a4e4 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 4000c010: 80 a6 40 01 cmp %i1, %g1 4000c014: 18 80 00 1c bgu 4000c084 4000c018: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 4000c01c: 80 a6 a0 00 cmp %i2, 0 4000c020: 02 80 00 19 be 4000c084 4000c024: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 4000c028: 40 00 08 87 call 4000e244 <_Thread_Get> 4000c02c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 4000c030: c2 07 bf fc ld [ %fp + -4 ], %g1 4000c034: 80 a0 60 00 cmp %g1, 0 4000c038: 12 80 00 13 bne 4000c084 4000c03c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 4000c040: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 4000c044: 80 a6 60 00 cmp %i1, 0 4000c048: 02 80 00 0d be 4000c07c 4000c04c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 4000c050: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 4000c054: 80 a0 60 00 cmp %g1, 0 4000c058: 02 80 00 06 be 4000c070 4000c05c: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 4000c060: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 4000c064: 80 a6 40 01 cmp %i1, %g1 4000c068: 1a 80 00 05 bcc 4000c07c <== ALWAYS TAKEN 4000c06c: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 4000c070: 92 10 00 19 mov %i1, %o1 4000c074: 40 00 06 ef call 4000dc30 <_Thread_Change_priority> 4000c078: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 4000c07c: 40 00 08 64 call 4000e20c <_Thread_Enable_dispatch> 4000c080: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 4000c084: 81 c7 e0 08 ret 4000c088: 81 e8 00 00 restore =============================================================================== 40008398 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 40008398: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 4000839c: 80 a6 60 00 cmp %i1, 0 400083a0: 02 80 00 1e be 40008418 400083a4: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 400083a8: 90 10 00 18 mov %i0, %o0 400083ac: 40 00 08 0f call 4000a3e8 <_Thread_Get> 400083b0: 92 07 bf fc add %fp, -4, %o1 switch (location) { 400083b4: c2 07 bf fc ld [ %fp + -4 ], %g1 400083b8: 80 a0 60 00 cmp %g1, 0 400083bc: 12 80 00 19 bne 40008420 400083c0: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 400083c4: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 400083c8: 80 a0 60 00 cmp %g1, 0 400083cc: 02 80 00 10 be 4000840c 400083d0: 01 00 00 00 nop if (tvp->ptr == ptr) { 400083d4: c4 00 60 04 ld [ %g1 + 4 ], %g2 400083d8: 80 a0 80 19 cmp %g2, %i1 400083dc: 32 80 00 09 bne,a 40008400 400083e0: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 400083e4: 10 80 00 19 b 40008448 400083e8: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 400083ec: 80 a0 80 19 cmp %g2, %i1 400083f0: 22 80 00 0e be,a 40008428 400083f4: c4 02 40 00 ld [ %o1 ], %g2 400083f8: 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; 400083fc: 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) { 40008400: 80 a2 60 00 cmp %o1, 0 40008404: 32 bf ff fa bne,a 400083ec <== ALWAYS TAKEN 40008408: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 4000840c: 40 00 07 e9 call 4000a3b0 <_Thread_Enable_dispatch> 40008410: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 40008414: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40008418: 81 c7 e0 08 ret 4000841c: 91 e8 00 01 restore %g0, %g1, %o0 40008420: 81 c7 e0 08 ret 40008424: 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; 40008428: 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 ); 4000842c: 40 00 00 2e call 400084e4 <_RTEMS_Tasks_Invoke_task_variable_dtor> 40008430: 01 00 00 00 nop _Thread_Enable_dispatch(); 40008434: 40 00 07 df call 4000a3b0 <_Thread_Enable_dispatch> 40008438: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 4000843c: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40008440: 81 c7 e0 08 ret 40008444: 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; 40008448: 92 10 00 01 mov %g1, %o1 4000844c: 10 bf ff f8 b 4000842c 40008450: c4 22 21 68 st %g2, [ %o0 + 0x168 ] =============================================================================== 40008454 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 40008454: 9d e3 bf 98 save %sp, -104, %sp 40008458: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 4000845c: 80 a6 60 00 cmp %i1, 0 40008460: 02 80 00 1b be 400084cc 40008464: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 40008468: 80 a6 a0 00 cmp %i2, 0 4000846c: 02 80 00 1c be 400084dc 40008470: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 40008474: 40 00 07 dd call 4000a3e8 <_Thread_Get> 40008478: 92 07 bf fc add %fp, -4, %o1 switch (location) { 4000847c: c2 07 bf fc ld [ %fp + -4 ], %g1 40008480: 80 a0 60 00 cmp %g1, 0 40008484: 12 80 00 12 bne 400084cc 40008488: 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; 4000848c: c2 02 21 68 ld [ %o0 + 0x168 ], %g1 while (tvp) { 40008490: 80 a0 60 00 cmp %g1, 0 40008494: 32 80 00 07 bne,a 400084b0 40008498: c4 00 60 04 ld [ %g1 + 4 ], %g2 4000849c: 30 80 00 0e b,a 400084d4 400084a0: 80 a0 60 00 cmp %g1, 0 400084a4: 02 80 00 0c be 400084d4 <== NEVER TAKEN 400084a8: 01 00 00 00 nop if (tvp->ptr == ptr) { 400084ac: c4 00 60 04 ld [ %g1 + 4 ], %g2 400084b0: 80 a0 80 19 cmp %g2, %i1 400084b4: 32 bf ff fb bne,a 400084a0 400084b8: 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; 400084bc: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 400084c0: 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(); 400084c4: 40 00 07 bb call 4000a3b0 <_Thread_Enable_dispatch> 400084c8: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 400084cc: 81 c7 e0 08 ret 400084d0: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 400084d4: 40 00 07 b7 call 4000a3b0 <_Thread_Enable_dispatch> 400084d8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 400084dc: 81 c7 e0 08 ret 400084e0: 81 e8 00 00 restore =============================================================================== 40016cb8 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 40016cb8: 9d e3 bf 98 save %sp, -104, %sp Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) _Objects_Get( &_Timer_Information, id, location ); 40016cbc: 11 10 00 f9 sethi %hi(0x4003e400), %o0 40016cc0: 92 10 00 18 mov %i0, %o1 40016cc4: 90 12 21 c4 or %o0, 0x1c4, %o0 40016cc8: 40 00 0c 74 call 40019e98 <_Objects_Get> 40016ccc: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 40016cd0: c2 07 bf fc ld [ %fp + -4 ], %g1 40016cd4: 80 a0 60 00 cmp %g1, 0 40016cd8: 22 80 00 04 be,a 40016ce8 40016cdc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40016ce0: 81 c7 e0 08 ret 40016ce4: 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 ) ) 40016ce8: 80 a0 60 04 cmp %g1, 4 40016cec: 02 80 00 04 be 40016cfc <== NEVER TAKEN 40016cf0: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 40016cf4: 40 00 15 11 call 4001c138 <_Watchdog_Remove> 40016cf8: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 40016cfc: 40 00 0e e0 call 4001a87c <_Thread_Enable_dispatch> 40016d00: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 40016d04: 81 c7 e0 08 ret 40016d08: 81 e8 00 00 restore =============================================================================== 400171d0 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 400171d0: 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; 400171d4: 03 10 00 f9 sethi %hi(0x4003e400), %g1 400171d8: e0 00 62 04 ld [ %g1 + 0x204 ], %l0 ! 4003e604 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 400171dc: 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 ) 400171e0: 80 a4 20 00 cmp %l0, 0 400171e4: 02 80 00 10 be 40017224 400171e8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 400171ec: 03 10 00 f8 sethi %hi(0x4003e000), %g1 400171f0: c2 08 63 08 ldub [ %g1 + 0x308 ], %g1 ! 4003e308 <_TOD_Is_set> 400171f4: 80 a0 60 00 cmp %g1, 0 400171f8: 02 80 00 0b be 40017224 <== NEVER TAKEN 400171fc: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 40017200: 80 a6 a0 00 cmp %i2, 0 40017204: 02 80 00 08 be 40017224 40017208: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 4001720c: 90 10 00 19 mov %i1, %o0 40017210: 7f ff f3 b4 call 400140e0 <_TOD_Validate> 40017214: b0 10 20 14 mov 0x14, %i0 40017218: 80 8a 20 ff btst 0xff, %o0 4001721c: 12 80 00 04 bne 4001722c 40017220: 01 00 00 00 nop case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 40017224: 81 c7 e0 08 ret 40017228: 81 e8 00 00 restore return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 4001722c: 7f ff f3 77 call 40014008 <_TOD_To_seconds> 40017230: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 40017234: 25 10 00 f8 sethi %hi(0x4003e000), %l2 40017238: c2 04 a3 80 ld [ %l2 + 0x380 ], %g1 ! 4003e380 <_TOD_Now> 4001723c: 80 a2 00 01 cmp %o0, %g1 40017240: 08 bf ff f9 bleu 40017224 40017244: b2 10 00 08 mov %o0, %i1 40017248: 92 10 00 11 mov %l1, %o1 4001724c: 11 10 00 f9 sethi %hi(0x4003e400), %o0 40017250: 94 07 bf fc add %fp, -4, %o2 40017254: 40 00 0b 11 call 40019e98 <_Objects_Get> 40017258: 90 12 21 c4 or %o0, 0x1c4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 4001725c: c2 07 bf fc ld [ %fp + -4 ], %g1 40017260: a6 10 00 08 mov %o0, %l3 40017264: 80 a0 60 00 cmp %g1, 0 40017268: 12 bf ff ef bne 40017224 4001726c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 40017270: 40 00 13 b2 call 4001c138 <_Watchdog_Remove> 40017274: 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 ); 40017278: 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(); 4001727c: c4 04 a3 80 ld [ %l2 + 0x380 ], %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; 40017280: 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 ); 40017284: 90 10 00 10 mov %l0, %o0 40017288: 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(); 4001728c: 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; 40017290: c6 24 e0 38 st %g3, [ %l3 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 40017294: f4 24 e0 2c st %i2, [ %l3 + 0x2c ] the_watchdog->id = id; 40017298: e2 24 e0 30 st %l1, [ %l3 + 0x30 ] the_watchdog->user_data = user_data; 4001729c: f6 24 e0 34 st %i3, [ %l3 + 0x34 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 400172a0: 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(); 400172a4: f2 24 e0 1c st %i1, [ %l3 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 400172a8: 9f c0 40 00 call %g1 400172ac: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 400172b0: 40 00 0d 73 call 4001a87c <_Thread_Enable_dispatch> 400172b4: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 400172b8: 81 c7 e0 08 ret 400172bc: 81 e8 00 00 restore