RTEMS 4.11Annotated Report
Wed May 11 18:18:21 2011
0200fb70 <_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
)
{
200fb70: 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;
200fb74: f4 26 20 44 st %i2, [ %i0 + 0x44 ]
the_message_queue->number_of_pending_messages = 0;
200fb78: c0 26 20 48 clr [ %i0 + 0x48 ]
the_message_queue->maximum_message_size = maximum_message_size;
200fb7c: f6 26 20 4c st %i3, [ %i0 + 0x4c ]
/*
* 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)) {
200fb80: 80 8e e0 03 btst 3, %i3
200fb84: 02 80 00 07 be 200fba0 <_CORE_message_queue_Initialize+0x30>
200fb88: b8 10 00 1b mov %i3, %i4
allocated_message_size += sizeof(uint32_t);
200fb8c: b8 06 e0 04 add %i3, 4, %i4
allocated_message_size &= ~(sizeof(uint32_t) - 1);
200fb90: b8 0f 3f fc and %i4, -4, %i4
}
if (allocated_message_size < maximum_message_size)
200fb94: 80 a7 00 1b cmp %i4, %i3
200fb98: 0a 80 00 22 bcs 200fc20 <_CORE_message_queue_Initialize+0xb0><== NEVER TAKEN
200fb9c: a0 10 20 00 clr %l0
/*
* 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));
200fba0: ba 07 20 10 add %i4, 0x10, %i5
/*
* 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 *
200fba4: 92 10 00 1a mov %i2, %o1
200fba8: 90 10 00 1d mov %i5, %o0
200fbac: 40 00 3d 71 call 201f170 <.umul>
200fbb0: a0 10 20 00 clr %l0
(allocated_message_size + sizeof(CORE_message_queue_Buffer_control));
if (message_buffering_required < allocated_message_size)
200fbb4: 80 a2 00 1c cmp %o0, %i4
200fbb8: 2a 80 00 1b bcs,a 200fc24 <_CORE_message_queue_Initialize+0xb4><== NEVER TAKEN
200fbbc: b0 0c 20 01 and %l0, 1, %i0 <== NOT EXECUTED
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
_Workspace_Allocate( message_buffering_required );
200fbc0: 40 00 0b f5 call 2012b94 <_Workspace_Allocate>
200fbc4: 01 00 00 00 nop
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
200fbc8: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
200fbcc: 80 a2 20 00 cmp %o0, 0
200fbd0: 02 80 00 14 be 200fc20 <_CORE_message_queue_Initialize+0xb0>
200fbd4: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
200fbd8: 90 06 20 60 add %i0, 0x60, %o0
200fbdc: 94 10 00 1a mov %i2, %o2
200fbe0: 40 00 13 d7 call 2014b3c <_Chain_Initialize>
200fbe4: 96 10 00 1d mov %i5, %o3
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
200fbe8: 82 06 20 50 add %i0, 0x50, %g1
head->next = tail;
head->previous = NULL;
tail->previous = head;
200fbec: c2 26 20 58 st %g1, [ %i0 + 0x58 ]
allocated_message_size + sizeof( CORE_message_queue_Buffer_control )
);
_Chain_Initialize_empty( &the_message_queue->Pending_messages );
_Thread_queue_Initialize(
200fbf0: c2 06 40 00 ld [ %i1 ], %g1
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
200fbf4: 84 06 20 54 add %i0, 0x54, %g2
200fbf8: 82 18 60 01 xor %g1, 1, %g1
200fbfc: 80 a0 00 01 cmp %g0, %g1
head->next = tail;
200fc00: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
head->previous = NULL;
200fc04: c0 26 20 54 clr [ %i0 + 0x54 ]
200fc08: 90 10 00 18 mov %i0, %o0
200fc0c: 92 60 3f ff subx %g0, -1, %o1
200fc10: 94 10 20 80 mov 0x80, %o2
200fc14: 96 10 20 06 mov 6, %o3
200fc18: 40 00 09 6e call 20121d0 <_Thread_queue_Initialize>
200fc1c: a0 10 20 01 mov 1, %l0
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
200fc20: b0 0c 20 01 and %l0, 1, %i0
200fc24: 81 c7 e0 08 ret
200fc28: 81 e8 00 00 restore
02006f84 <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
2006f84: 9d e3 bf a0 save %sp, -96, %sp
* This routine returns true if thread dispatch indicates
* that we are in a critical section.
*/
RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void)
{
if ( _Thread_Dispatch_disable_level == 0 )
2006f88: 03 00 80 6c sethi %hi(0x201b000), %g1
2006f8c: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1 ! 201b3a0 <_Thread_Dispatch_disable_level>
2006f90: 80 a0 60 00 cmp %g1, 0
2006f94: 02 80 00 0c be 2006fc4 <_CORE_mutex_Seize+0x40>
2006f98: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
2006f9c: 10 80 00 2b b 2007048 <_CORE_mutex_Seize+0xc4>
2006fa0: 80 a6 a0 00 cmp %i2, 0
2006fa4: c2 00 60 fc ld [ %g1 + 0xfc ], %g1
2006fa8: 80 a0 60 01 cmp %g1, 1
2006fac: 08 80 00 07 bleu 2006fc8 <_CORE_mutex_Seize+0x44>
2006fb0: 90 10 00 18 mov %i0, %o0
2006fb4: 90 10 20 00 clr %o0
2006fb8: 92 10 20 00 clr %o1
2006fbc: 40 00 01 e1 call 2007740 <_Internal_error_Occurred>
2006fc0: 94 10 20 12 mov 0x12, %o2
2006fc4: 90 10 00 18 mov %i0, %o0
2006fc8: 40 00 13 1e call 200bc40 <_CORE_mutex_Seize_interrupt_trylock>
2006fcc: 92 07 a0 54 add %fp, 0x54, %o1
2006fd0: 80 a2 20 00 cmp %o0, 0
2006fd4: 02 80 00 0a be 2006ffc <_CORE_mutex_Seize+0x78>
2006fd8: 80 a6 a0 00 cmp %i2, 0
2006fdc: 12 80 00 0a bne 2007004 <_CORE_mutex_Seize+0x80>
2006fe0: 82 10 20 01 mov 1, %g1
2006fe4: 7f ff ec 4e call 200211c <sparc_enable_interrupts>
2006fe8: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2006fec: 03 00 80 6d sethi %hi(0x201b400), %g1
2006ff0: c2 00 61 d8 ld [ %g1 + 0x1d8 ], %g1 ! 201b5d8 <_Per_CPU_Information+0xc>
2006ff4: 84 10 20 01 mov 1, %g2
2006ff8: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
2006ffc: 81 c7 e0 08 ret
2007000: 81 e8 00 00 restore
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;
2007004: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
2007008: 03 00 80 6d sethi %hi(0x201b400), %g1
200700c: c2 00 61 d8 ld [ %g1 + 0x1d8 ], %g1 ! 201b5d8 <_Per_CPU_Information+0xc>
2007010: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
2007014: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
/**
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2007018: 03 00 80 6c sethi %hi(0x201b000), %g1
200701c: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 201b3a0 <_Thread_Dispatch_disable_level>
2007020: 84 00 a0 01 inc %g2
2007024: c4 20 63 a0 st %g2, [ %g1 + 0x3a0 ]
return _Thread_Dispatch_disable_level;
2007028: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1
200702c: 7f ff ec 3c call 200211c <sparc_enable_interrupts>
2007030: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2007034: 90 10 00 18 mov %i0, %o0
2007038: 7f ff ff bb call 2006f24 <_CORE_mutex_Seize_interrupt_blocking>
200703c: 92 10 00 1b mov %i3, %o1
2007040: 81 c7 e0 08 ret
2007044: 81 e8 00 00 restore
2007048: 12 bf ff d7 bne 2006fa4 <_CORE_mutex_Seize+0x20> <== ALWAYS TAKEN
200704c: 03 00 80 6d sethi %hi(0x201b400), %g1
2007050: 10 bf ff de b 2006fc8 <_CORE_mutex_Seize+0x44> <== NOT EXECUTED
2007054: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED
020071cc <_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
)
{
20071cc: 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)) ) {
20071d0: 90 10 00 18 mov %i0, %o0
20071d4: 40 00 07 10 call 2008e14 <_Thread_queue_Dequeue>
20071d8: ba 10 00 18 mov %i0, %i5
20071dc: 80 a2 20 00 cmp %o0, 0
20071e0: 12 80 00 0e bne 2007218 <_CORE_semaphore_Surrender+0x4c>
20071e4: 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 );
20071e8: 7f ff eb c9 call 200210c <sparc_disable_interrupts>
20071ec: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
20071f0: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
20071f4: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
20071f8: 80 a0 40 02 cmp %g1, %g2
20071fc: 1a 80 00 05 bcc 2007210 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN
2007200: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
2007204: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007208: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
200720c: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
2007210: 7f ff eb c3 call 200211c <sparc_enable_interrupts>
2007214: 01 00 00 00 nop
}
return status;
}
2007218: 81 c7 e0 08 ret
200721c: 81 e8 00 00 restore
02005f80 <_Event_Surrender>:
*/
void _Event_Surrender(
Thread_Control *the_thread
)
{
2005f80: 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 ];
2005f84: f8 06 21 58 ld [ %i0 + 0x158 ], %i4
option_set = (rtems_option) the_thread->Wait.option;
2005f88: f6 06 20 30 ld [ %i0 + 0x30 ], %i3
_ISR_Disable( level );
2005f8c: 7f ff f0 60 call 200210c <sparc_disable_interrupts>
2005f90: ba 10 00 18 mov %i0, %i5
2005f94: b0 10 00 08 mov %o0, %i0
pending_events = api->pending_events;
2005f98: c4 07 00 00 ld [ %i4 ], %g2
event_condition = (rtems_event_set) the_thread->Wait.count;
2005f9c: c6 07 60 24 ld [ %i5 + 0x24 ], %g3
seized_events = _Event_sets_Get( pending_events, event_condition );
/*
* No events were seized in this operation
*/
if ( _Event_sets_Is_empty( seized_events ) ) {
2005fa0: 82 88 c0 02 andcc %g3, %g2, %g1
2005fa4: 02 80 00 43 be 20060b0 <_Event_Surrender+0x130>
2005fa8: 01 00 00 00 nop
/*
* 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() &&
2005fac: 09 00 80 6d sethi %hi(0x201b400), %g4
2005fb0: 88 11 21 cc or %g4, 0x1cc, %g4 ! 201b5cc <_Per_CPU_Information>
2005fb4: f2 01 20 08 ld [ %g4 + 8 ], %i1
2005fb8: 80 a6 60 00 cmp %i1, 0
2005fbc: 22 80 00 1d be,a 2006030 <_Event_Surrender+0xb0>
2005fc0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4
2005fc4: c8 01 20 0c ld [ %g4 + 0xc ], %g4
2005fc8: 80 a7 40 04 cmp %i5, %g4
2005fcc: 32 80 00 19 bne,a 2006030 <_Event_Surrender+0xb0>
2005fd0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
2005fd4: 09 00 80 6d sethi %hi(0x201b400), %g4
2005fd8: f2 01 22 20 ld [ %g4 + 0x220 ], %i1 ! 201b620 <_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 ) &&
2005fdc: 80 a6 60 02 cmp %i1, 2
2005fe0: 02 80 00 07 be 2005ffc <_Event_Surrender+0x7c> <== NEVER TAKEN
2005fe4: 80 a0 40 03 cmp %g1, %g3
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
2005fe8: c8 01 22 20 ld [ %g4 + 0x220 ], %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() &&
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
2005fec: 80 a1 20 01 cmp %g4, 1
2005ff0: 32 80 00 10 bne,a 2006030 <_Event_Surrender+0xb0>
2005ff4: c8 07 60 10 ld [ %i5 + 0x10 ], %g4
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
2005ff8: 80 a0 40 03 cmp %g1, %g3
2005ffc: 02 80 00 04 be 200600c <_Event_Surrender+0x8c>
2006000: 80 8e e0 02 btst 2, %i3
2006004: 02 80 00 2b be 20060b0 <_Event_Surrender+0x130> <== NEVER TAKEN
2006008: 01 00 00 00 nop
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) );
200600c: 84 28 80 01 andn %g2, %g1, %g2
api->pending_events = _Event_sets_Clear( pending_events,seized_events );
2006010: c4 27 00 00 st %g2, [ %i4 ]
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006014: c4 07 60 28 ld [ %i5 + 0x28 ], %g2
_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 );
the_thread->Wait.count = 0;
2006018: c0 27 60 24 clr [ %i5 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
200601c: c2 20 80 00 st %g1, [ %g2 ]
_Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
2006020: 84 10 20 03 mov 3, %g2
2006024: 03 00 80 6d sethi %hi(0x201b400), %g1
2006028: c4 20 62 20 st %g2, [ %g1 + 0x220 ] ! 201b620 <_Event_Sync_state>
200602c: 30 80 00 21 b,a 20060b0 <_Event_Surrender+0x130>
}
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Is_waiting_for_event( the_thread->current_state ) ) {
2006030: 80 89 21 00 btst 0x100, %g4
2006034: 02 80 00 1f be 20060b0 <_Event_Surrender+0x130>
2006038: 80 a0 40 03 cmp %g1, %g3
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
200603c: 02 80 00 04 be 200604c <_Event_Surrender+0xcc>
2006040: 80 8e e0 02 btst 2, %i3
2006044: 02 80 00 1b be 20060b0 <_Event_Surrender+0x130> <== NEVER TAKEN
2006048: 01 00 00 00 nop
200604c: 84 28 80 01 andn %g2, %g1, %g2
api->pending_events = _Event_sets_Clear( pending_events, seized_events );
2006050: c4 27 00 00 st %g2, [ %i4 ]
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006054: c4 07 60 28 ld [ %i5 + 0x28 ], %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 );
the_thread->Wait.count = 0;
2006058: c0 27 60 24 clr [ %i5 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
200605c: c2 20 80 00 st %g1, [ %g2 ]
_ISR_Flash( level );
2006060: 7f ff f0 2f call 200211c <sparc_enable_interrupts>
2006064: 90 10 00 18 mov %i0, %o0
2006068: 7f ff f0 29 call 200210c <sparc_disable_interrupts>
200606c: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
2006070: c2 07 60 50 ld [ %i5 + 0x50 ], %g1
2006074: 80 a0 60 02 cmp %g1, 2
2006078: 02 80 00 06 be 2006090 <_Event_Surrender+0x110>
200607c: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
2006080: 7f ff f0 27 call 200211c <sparc_enable_interrupts>
2006084: 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 );
2006088: 10 80 00 08 b 20060a8 <_Event_Surrender+0x128>
200608c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
2006090: c2 27 60 50 st %g1, [ %i5 + 0x50 ]
_Thread_Unblock( the_thread );
} else {
_Watchdog_Deactivate( &the_thread->Timer );
_ISR_Enable( level );
2006094: 7f ff f0 22 call 200211c <sparc_enable_interrupts>
2006098: 33 04 00 ff sethi %hi(0x1003fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
200609c: 40 00 0e 68 call 2009a3c <_Watchdog_Remove>
20060a0: 90 07 60 48 add %i5, 0x48, %o0
20060a4: b2 16 63 f8 or %i1, 0x3f8, %i1
20060a8: 40 00 09 ae call 2008760 <_Thread_Clear_state>
20060ac: 91 e8 00 1d restore %g0, %i5, %o0
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
20060b0: 7f ff f0 1b call 200211c <sparc_enable_interrupts>
20060b4: 81 e8 00 00 restore
020060b8 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *ignored
)
{
20060b8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
ISR_Level level;
the_thread = _Thread_Get( id, &location );
20060bc: 90 10 00 18 mov %i0, %o0
20060c0: 40 00 0a 91 call 2008b04 <_Thread_Get>
20060c4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20060c8: c2 07 bf fc ld [ %fp + -4 ], %g1
20060cc: 80 a0 60 00 cmp %g1, 0
20060d0: 12 80 00 1d bne 2006144 <_Event_Timeout+0x8c> <== NEVER TAKEN
20060d4: ba 10 00 08 mov %o0, %i5
*
* 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 );
20060d8: 7f ff f0 0d call 200210c <sparc_disable_interrupts>
20060dc: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
20060e0: 03 00 80 6d sethi %hi(0x201b400), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
20060e4: c2 00 61 d8 ld [ %g1 + 0x1d8 ], %g1 ! 201b5d8 <_Per_CPU_Information+0xc>
20060e8: 80 a7 40 01 cmp %i5, %g1
20060ec: 12 80 00 09 bne 2006110 <_Event_Timeout+0x58>
20060f0: c0 27 60 24 clr [ %i5 + 0x24 ]
if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
20060f4: 03 00 80 6d sethi %hi(0x201b400), %g1
20060f8: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 201b620 <_Event_Sync_state>
20060fc: 80 a0 a0 01 cmp %g2, 1
2006100: 32 80 00 05 bne,a 2006114 <_Event_Timeout+0x5c>
2006104: 82 10 20 06 mov 6, %g1
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
2006108: 84 10 20 02 mov 2, %g2
200610c: c4 20 62 20 st %g2, [ %g1 + 0x220 ]
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
2006110: 82 10 20 06 mov 6, %g1
2006114: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
2006118: 7f ff f0 01 call 200211c <sparc_enable_interrupts>
200611c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2006120: 90 10 00 1d mov %i5, %o0
2006124: 13 04 00 ff sethi %hi(0x1003fc00), %o1
2006128: 40 00 09 8e call 2008760 <_Thread_Clear_state>
200612c: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 <RAM_END+0xdc3fff8>
/**
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2006130: 03 00 80 6c sethi %hi(0x201b000), %g1
2006134: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 201b3a0 <_Thread_Dispatch_disable_level>
2006138: 84 00 bf ff add %g2, -1, %g2
200613c: c4 20 63 a0 st %g2, [ %g1 + 0x3a0 ]
return _Thread_Dispatch_disable_level;
2006140: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1
2006144: 81 c7 e0 08 ret
2006148: 81 e8 00 00 restore
0200bd98 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
200bd98: 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;
200bd9c: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200bda0: c0 27 bf fc clr [ %fp + -4 ]
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;
200bda4: ba 06 40 1a add %i1, %i2, %i5
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
Heap_Statistics *const stats = &heap->stats;
Heap_Block *const first_block = heap->first_block;
200bda8: e0 06 20 20 ld [ %i0 + 0x20 ], %l0
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;
200bdac: e2 06 20 10 ld [ %i0 + 0x10 ], %l1
uintptr_t const min_block_size = heap->min_block_size;
200bdb0: 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;
200bdb4: e4 06 20 30 ld [ %i0 + 0x30 ], %l2
uintptr_t extend_first_block_size = 0;
uintptr_t extended_size = 0;
bool extend_area_ok = false;
if ( extend_area_end < extend_area_begin ) {
200bdb8: 80 a7 40 19 cmp %i5, %i1
200bdbc: 0a 80 00 9f bcs 200c038 <_Heap_Extend+0x2a0>
200bdc0: b8 10 20 00 clr %i4
return false;
}
extend_area_ok = _Heap_Get_first_and_last_block(
200bdc4: 90 10 00 19 mov %i1, %o0
200bdc8: 92 10 00 1a mov %i2, %o1
200bdcc: 94 10 00 11 mov %l1, %o2
200bdd0: 98 07 bf f8 add %fp, -8, %o4
200bdd4: 7f ff ed 57 call 2007330 <_Heap_Get_first_and_last_block>
200bdd8: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200bddc: 80 8a 20 ff btst 0xff, %o0
200bde0: 02 80 00 96 be 200c038 <_Heap_Extend+0x2a0>
200bde4: b4 10 00 10 mov %l0, %i2
200bde8: aa 10 20 00 clr %l5
200bdec: ac 10 20 00 clr %l6
200bdf0: b8 10 20 00 clr %i4
200bdf4: a8 10 20 00 clr %l4
200bdf8: c2 06 20 18 ld [ %i0 + 0x18 ], %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 (
200bdfc: 80 a0 40 1d cmp %g1, %i5
200be00: 1a 80 00 05 bcc 200be14 <_Heap_Extend+0x7c>
200be04: e6 06 80 00 ld [ %i2 ], %l3
200be08: 80 a6 40 13 cmp %i1, %l3
200be0c: 2a 80 00 8b bcs,a 200c038 <_Heap_Extend+0x2a0>
200be10: b8 10 20 00 clr %i4
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
}
if ( extend_area_end == sub_area_begin ) {
200be14: 80 a7 40 01 cmp %i5, %g1
200be18: 02 80 00 06 be 200be30 <_Heap_Extend+0x98>
200be1c: 80 a7 40 13 cmp %i5, %l3
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
200be20: 2a 80 00 05 bcs,a 200be34 <_Heap_Extend+0x9c>
200be24: ac 10 00 1a mov %i2, %l6
200be28: 10 80 00 04 b 200be38 <_Heap_Extend+0xa0>
200be2c: 90 10 00 13 mov %l3, %o0
200be30: a8 10 00 1a mov %i2, %l4
200be34: 90 10 00 13 mov %l3, %o0
200be38: 40 00 16 02 call 2011640 <.urem>
200be3c: 92 10 00 11 mov %l1, %o1
200be40: ae 04 ff f8 add %l3, -8, %l7
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200be44: 80 a4 c0 19 cmp %l3, %i1
200be48: 12 80 00 05 bne 200be5c <_Heap_Extend+0xc4>
200be4c: 90 25 c0 08 sub %l7, %o0, %o0
start_block->prev_size = extend_area_end;
200be50: fa 26 80 00 st %i5, [ %i2 ]
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area(
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
200be54: 10 80 00 04 b 200be64 <_Heap_Extend+0xcc>
200be58: b8 10 00 08 mov %o0, %i4
merge_above_block = end_block;
} else if ( sub_area_end < extend_area_begin ) {
200be5c: 2a 80 00 02 bcs,a 200be64 <_Heap_Extend+0xcc>
200be60: aa 10 00 08 mov %o0, %l5
- 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;
200be64: f4 02 20 04 ld [ %o0 + 4 ], %i2
200be68: b4 0e bf fe and %i2, -2, %i2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200be6c: b4 06 80 08 add %i2, %o0, %i2
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200be70: 80 a6 80 10 cmp %i2, %l0
200be74: 12 bf ff e2 bne 200bdfc <_Heap_Extend+0x64>
200be78: 82 10 00 1a mov %i2, %g1
if ( extend_area_begin < heap->area_begin ) {
200be7c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200be80: 80 a6 40 01 cmp %i1, %g1
200be84: 3a 80 00 04 bcc,a 200be94 <_Heap_Extend+0xfc>
200be88: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200be8c: 10 80 00 05 b 200bea0 <_Heap_Extend+0x108>
200be90: f2 26 20 18 st %i1, [ %i0 + 0x18 ]
} else if ( heap->area_end < extend_area_end ) {
200be94: 80 a0 40 1d cmp %g1, %i5
200be98: 2a 80 00 02 bcs,a 200bea0 <_Heap_Extend+0x108>
200be9c: fa 26 20 1c st %i5, [ %i0 + 0x1c ]
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
200bea0: c4 07 bf f8 ld [ %fp + -8 ], %g2
200bea4: c2 07 bf fc ld [ %fp + -4 ], %g1
extend_first_block->prev_size = extend_area_end;
200bea8: fa 20 80 00 st %i5, [ %g2 ]
heap->area_begin = extend_area_begin;
} else if ( heap->area_end < extend_area_end ) {
heap->area_end = extend_area_end;
}
extend_first_block_size =
200beac: 86 20 40 02 sub %g1, %g2, %g3
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
extend_first_block->prev_size = extend_area_end;
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200beb0: 88 10 e0 01 or %g3, 1, %g4
_Heap_Protection_block_initialize( heap, extend_first_block );
extend_last_block->prev_size = extend_first_block_size;
200beb4: c6 20 40 00 st %g3, [ %g1 ]
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 =
200beb8: c8 20 a0 04 st %g4, [ %g2 + 4 ]
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 ) {
200bebc: c6 06 20 20 ld [ %i0 + 0x20 ], %g3
200bec0: 80 a0 c0 02 cmp %g3, %g2
200bec4: 08 80 00 04 bleu 200bed4 <_Heap_Extend+0x13c>
200bec8: c0 20 60 04 clr [ %g1 + 4 ]
heap->first_block = extend_first_block;
200becc: 10 80 00 06 b 200bee4 <_Heap_Extend+0x14c>
200bed0: c4 26 20 20 st %g2, [ %i0 + 0x20 ]
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
200bed4: c4 06 20 24 ld [ %i0 + 0x24 ], %g2
200bed8: 80 a0 80 01 cmp %g2, %g1
200bedc: 2a 80 00 02 bcs,a 200bee4 <_Heap_Extend+0x14c>
200bee0: c2 26 20 24 st %g1, [ %i0 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200bee4: 80 a5 20 00 cmp %l4, 0
200bee8: 02 80 00 14 be 200bf38 <_Heap_Extend+0x1a0>
200beec: 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;
200bef0: f4 06 20 10 ld [ %i0 + 0x10 ], %i2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up(
uintptr_t value,
uintptr_t alignment
)
{
uintptr_t remainder = value % alignment;
200bef4: 92 10 00 1a mov %i2, %o1
200bef8: 40 00 15 d2 call 2011640 <.urem>
200befc: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200bf00: 80 a2 20 00 cmp %o0, 0
200bf04: 02 80 00 04 be 200bf14 <_Heap_Extend+0x17c>
200bf08: c2 05 00 00 ld [ %l4 ], %g1
return value - remainder + alignment;
200bf0c: b2 06 40 1a add %i1, %i2, %i1
200bf10: b2 26 40 08 sub %i1, %o0, %i1
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 =
200bf14: 92 06 7f f8 add %i1, -8, %o1
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;
200bf18: c2 26 7f f8 st %g1, [ %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 =
200bf1c: 82 25 00 09 sub %l4, %o1, %g1
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;
200bf20: 82 10 60 01 or %g1, 1, %g1
_Heap_Free_block( heap, new_first_block );
200bf24: 90 10 00 18 mov %i0, %o0
200bf28: 7f ff ff 92 call 200bd70 <_Heap_Free_block>
200bf2c: c2 22 60 04 st %g1, [ %o1 + 4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200bf30: 10 80 00 08 b 200bf50 <_Heap_Extend+0x1b8>
200bf34: 80 a7 20 00 cmp %i4, 0
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 ) {
200bf38: 80 a5 a0 00 cmp %l6, 0
200bf3c: 02 80 00 04 be 200bf4c <_Heap_Extend+0x1b4>
200bf40: ac 25 80 01 sub %l6, %g1, %l6
{
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;
200bf44: ac 15 a0 01 or %l6, 1, %l6
)
{
uintptr_t const last_block_begin = (uintptr_t) last_block;
uintptr_t const link_begin = (uintptr_t) link;
last_block->size_and_flag =
200bf48: ec 20 60 04 st %l6, [ %g1 + 4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200bf4c: 80 a7 20 00 cmp %i4, 0
200bf50: 02 80 00 15 be 200bfa4 <_Heap_Extend+0x20c>
200bf54: ba 07 7f f8 add %i5, -8, %i5
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200bf58: d2 06 20 10 ld [ %i0 + 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(
200bf5c: ba 27 40 1c sub %i5, %i4, %i5
200bf60: 40 00 15 b8 call 2011640 <.urem>
200bf64: 90 10 00 1d mov %i5, %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)
200bf68: c4 07 20 04 ld [ %i4 + 4 ], %g2
200bf6c: ba 27 40 08 sub %i5, %o0, %i5
page_size
);
Heap_Block *const new_last_block =
_Heap_Block_at( last_block, last_block_new_size );
new_last_block->size_and_flag =
200bf70: 82 07 40 1c add %i5, %i4, %g1
(last_block->size_and_flag - last_block_new_size)
200bf74: 84 20 80 1d sub %g2, %i5, %g2
| HEAP_PREV_BLOCK_USED;
200bf78: 84 10 a0 01 or %g2, 1, %g2
page_size
);
Heap_Block *const new_last_block =
_Heap_Block_at( last_block, last_block_new_size );
new_last_block->size_and_flag =
200bf7c: c4 20 60 04 st %g2, [ %g1 + 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;
200bf80: c2 07 20 04 ld [ %i4 + 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 );
200bf84: 90 10 00 18 mov %i0, %o0
200bf88: 82 08 60 01 and %g1, 1, %g1
200bf8c: 92 10 00 1c mov %i4, %o1
block->size_and_flag = size | flag;
200bf90: ba 17 40 01 or %i5, %g1, %i5
200bf94: 7f ff ff 77 call 200bd70 <_Heap_Free_block>
200bf98: fa 27 20 04 st %i5, [ %i4 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200bf9c: 10 80 00 0f b 200bfd8 <_Heap_Extend+0x240>
200bfa0: 80 a7 20 00 cmp %i4, 0
);
}
if ( merge_above_block != NULL ) {
_Heap_Merge_above( heap, merge_above_block, extend_area_end );
} else if ( link_above_block != NULL ) {
200bfa4: 80 a5 60 00 cmp %l5, 0
200bfa8: 02 80 00 0b be 200bfd4 <_Heap_Extend+0x23c>
200bfac: c4 07 bf f8 ld [ %fp + -8 ], %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;
200bfb0: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200bfb4: c2 07 bf fc ld [ %fp + -4 ], %g1
200bfb8: 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 );
200bfbc: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200bfc0: 84 10 c0 02 or %g3, %g2, %g2
200bfc4: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200bfc8: c4 00 60 04 ld [ %g1 + 4 ], %g2
200bfcc: 84 10 a0 01 or %g2, 1, %g2
200bfd0: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200bfd4: 80 a7 20 00 cmp %i4, 0
200bfd8: 32 80 00 09 bne,a 200bffc <_Heap_Extend+0x264>
200bfdc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200bfe0: 80 a5 20 00 cmp %l4, 0
200bfe4: 32 80 00 06 bne,a 200bffc <_Heap_Extend+0x264>
200bfe8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200bfec: d2 07 bf f8 ld [ %fp + -8 ], %o1
200bff0: 7f ff ff 60 call 200bd70 <_Heap_Free_block>
200bff4: 90 10 00 18 mov %i0, %o0
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
heap->last_block,
(uintptr_t) heap->first_block - (uintptr_t) heap->last_block
200bff8: c2 06 20 24 ld [ %i0 + 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(
200bffc: c4 06 20 20 ld [ %i0 + 0x20 ], %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;
200c000: c6 00 60 04 ld [ %g1 + 4 ], %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(
200c004: 84 20 80 01 sub %g2, %g1, %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;
200c008: 86 08 e0 01 and %g3, 1, %g3
block->size_and_flag = size | flag;
200c00c: 84 10 c0 02 or %g3, %g2, %g2
200c010: c4 20 60 04 st %g2, [ %g1 + 4 ]
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200c014: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
stats->size += extended_size;
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
200c018: b8 10 20 01 mov 1, %i4
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200c01c: a4 20 40 12 sub %g1, %l2, %l2
/* Statistics */
stats->size += extended_size;
200c020: c2 06 20 2c ld [ %i0 + 0x2c ], %g1
if ( extended_size_ptr != NULL )
200c024: 80 a6 e0 00 cmp %i3, 0
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
/* Statistics */
stats->size += extended_size;
200c028: 82 00 40 12 add %g1, %l2, %g1
if ( extended_size_ptr != NULL )
200c02c: 02 80 00 03 be 200c038 <_Heap_Extend+0x2a0> <== NEVER TAKEN
200c030: c2 26 20 2c st %g1, [ %i0 + 0x2c ]
200c034: e4 26 c0 00 st %l2, [ %i3 ]
*extended_size_ptr = extended_size;
return true;
}
200c038: b0 0f 20 01 and %i4, 1, %i0
200c03c: 81 c7 e0 08 ret
200c040: 81 e8 00 00 restore
0200bf90 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200bf90: 9d e3 bf a0 save %sp, -96, %sp
* If NULL return true so a free on NULL is considered a valid release. This
* is a special case that could be handled by the in heap check how-ever that
* would result in false being returned which is wrong.
*/
if ( alloc_begin_ptr == NULL ) {
return true;
200bf94: 88 10 20 01 mov 1, %g4
/*
* If NULL return true so a free on NULL is considered a valid release. This
* is a special case that could be handled by the in heap check how-ever that
* would result in false being returned which is wrong.
*/
if ( alloc_begin_ptr == NULL ) {
200bf98: 80 a6 60 00 cmp %i1, 0
200bf9c: 02 80 00 77 be 200c178 <_Heap_Free+0x1e8>
200bfa0: 90 10 00 19 mov %i1, %o0
200bfa4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200bfa8: 40 00 2b 3f call 2016ca4 <.urem>
200bfac: ba 06 7f f8 add %i1, -8, %i5
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
200bfb0: da 06 20 20 ld [ %i0 + 0x20 ], %o5
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
200bfb4: ba 27 40 08 sub %i5, %o0, %i5
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;
200bfb8: 80 a7 40 0d cmp %i5, %o5
200bfbc: 0a 80 00 05 bcs 200bfd0 <_Heap_Free+0x40>
200bfc0: 82 10 20 00 clr %g1
200bfc4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200bfc8: 80 a0 40 1d cmp %g1, %i5
200bfcc: 82 60 3f ff subx %g0, -1, %g1
}
alloc_begin = (uintptr_t) alloc_begin_ptr;
block = _Heap_Block_of_alloc_area( alloc_begin, heap->page_size );
if ( !_Heap_Is_block_in_heap( heap, block ) ) {
200bfd0: 80 a0 60 00 cmp %g1, 0
200bfd4: 02 80 00 69 be 200c178 <_Heap_Free+0x1e8>
200bfd8: 88 10 20 00 clr %g4
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200bfdc: d6 07 60 04 ld [ %i5 + 4 ], %o3
- 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;
200bfe0: 84 0a ff fe and %o3, -2, %g2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200bfe4: 82 00 80 1d add %g2, %i5, %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;
200bfe8: 80 a0 40 0d cmp %g1, %o5
200bfec: 0a 80 00 05 bcs 200c000 <_Heap_Free+0x70> <== NEVER TAKEN
200bff0: 86 10 20 00 clr %g3
200bff4: c6 06 20 24 ld [ %i0 + 0x24 ], %g3
200bff8: 80 a0 c0 01 cmp %g3, %g1
200bffc: 86 60 3f ff subx %g0, -1, %g3
_Heap_Protection_block_check( heap, block );
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
200c000: 80 a0 e0 00 cmp %g3, 0
200c004: 02 80 00 5d be 200c178 <_Heap_Free+0x1e8> <== NEVER TAKEN
200c008: 88 10 20 00 clr %g4
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c00c: de 00 60 04 ld [ %g1 + 4 ], %o7
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200c010: 80 8b e0 01 btst 1, %o7
200c014: 02 80 00 59 be 200c178 <_Heap_Free+0x1e8> <== NEVER TAKEN
200c018: 9e 0b ff fe and %o7, -2, %o7
if ( !_Heap_Protection_determine_block_free( heap, block ) ) {
return true;
}
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
200c01c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
200c020: 80 a0 40 04 cmp %g1, %g4
200c024: 02 80 00 07 be 200c040 <_Heap_Free+0xb0>
200c028: 98 10 20 00 clr %o4
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c02c: 86 00 40 0f add %g1, %o7, %g3
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;
200c030: c6 00 e0 04 ld [ %g3 + 4 ], %g3
200c034: 86 08 e0 01 and %g3, 1, %g3
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 ));
200c038: 80 a0 00 03 cmp %g0, %g3
200c03c: 98 60 3f ff subx %g0, -1, %o4
if ( !_Heap_Is_prev_used( block ) ) {
200c040: 80 8a e0 01 btst 1, %o3
200c044: 12 80 00 25 bne 200c0d8 <_Heap_Free+0x148>
200c048: 80 8b 20 ff btst 0xff, %o4
uintptr_t const prev_size = block->prev_size;
200c04c: d6 07 40 00 ld [ %i5 ], %o3
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200c050: 86 27 40 0b sub %i5, %o3, %g3
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;
200c054: 80 a0 c0 0d cmp %g3, %o5
200c058: 0a 80 00 04 bcs 200c068 <_Heap_Free+0xd8> <== NEVER TAKEN
200c05c: 94 10 20 00 clr %o2
200c060: 80 a1 00 03 cmp %g4, %g3
200c064: 94 60 3f ff subx %g0, -1, %o2
Heap_Block * const prev_block = _Heap_Block_at( block, -prev_size );
if ( !_Heap_Is_block_in_heap( heap, prev_block ) ) {
200c068: 80 a2 a0 00 cmp %o2, 0
200c06c: 02 80 00 43 be 200c178 <_Heap_Free+0x1e8> <== NEVER TAKEN
200c070: 88 10 20 00 clr %g4
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;
200c074: da 00 e0 04 ld [ %g3 + 4 ], %o5
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) ) {
200c078: 80 8b 60 01 btst 1, %o5
200c07c: 02 80 00 3f be 200c178 <_Heap_Free+0x1e8> <== NEVER TAKEN
200c080: 80 8b 20 ff btst 0xff, %o4
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200c084: 02 80 00 0e be 200c0bc <_Heap_Free+0x12c>
200c088: 88 00 80 0b add %g2, %o3, %g4
uintptr_t const size = block_size + prev_size + next_block_size;
200c08c: 9e 01 00 0f add %g4, %o7, %o7
return _Heap_Free_list_tail(heap)->prev;
}
RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block )
{
Heap_Block *next = block->next;
200c090: c8 00 60 08 ld [ %g1 + 8 ], %g4
Heap_Block *prev = block->prev;
200c094: c2 00 60 0c ld [ %g1 + 0xc ], %g1
prev->next = next;
200c098: c8 20 60 08 st %g4, [ %g1 + 8 ]
next->prev = prev;
200c09c: c2 21 20 0c st %g1, [ %g4 + 0xc ]
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
200c0a0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
200c0a4: 82 00 7f ff add %g1, -1, %g1
200c0a8: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
200c0ac: de 23 c0 03 st %o7, [ %o7 + %g3 ]
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;
200c0b0: 82 13 e0 01 or %o7, 1, %g1
200c0b4: 10 80 00 27 b 200c150 <_Heap_Free+0x1c0>
200c0b8: c2 20 e0 04 st %g1, [ %g3 + 4 ]
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;
200c0bc: 9e 11 20 01 or %g4, 1, %o7
200c0c0: de 20 e0 04 st %o7, [ %g3 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200c0c4: c6 00 60 04 ld [ %g1 + 4 ], %g3
next_block->prev_size = size;
200c0c8: c8 20 80 1d st %g4, [ %g2 + %i5 ]
_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;
200c0cc: 86 08 ff fe and %g3, -2, %g3
200c0d0: 10 80 00 20 b 200c150 <_Heap_Free+0x1c0>
200c0d4: c6 20 60 04 st %g3, [ %g1 + 4 ]
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
200c0d8: 22 80 00 0d be,a 200c10c <_Heap_Free+0x17c>
200c0dc: c6 06 20 08 ld [ %i0 + 8 ], %g3
RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace(
Heap_Block *old_block,
Heap_Block *new_block
)
{
Heap_Block *next = old_block->next;
200c0e0: c8 00 60 08 ld [ %g1 + 8 ], %g4
Heap_Block *prev = old_block->prev;
200c0e4: c2 00 60 0c ld [ %g1 + 0xc ], %g1
new_block->next = next;
200c0e8: c8 27 60 08 st %g4, [ %i5 + 8 ]
new_block->prev = prev;
200c0ec: c2 27 60 0c st %g1, [ %i5 + 0xc ]
uintptr_t const size = block_size + next_block_size;
200c0f0: 86 03 c0 02 add %o7, %g2, %g3
next->prev = new_block;
prev->next = new_block;
200c0f4: fa 20 60 08 st %i5, [ %g1 + 8 ]
Heap_Block *prev = old_block->prev;
new_block->next = next;
new_block->prev = prev;
next->prev = new_block;
200c0f8: fa 21 20 0c st %i5, [ %g4 + 0xc ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200c0fc: 82 10 e0 01 or %g3, 1, %g1
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200c100: c6 20 c0 1d st %g3, [ %g3 + %i5 ]
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200c104: 10 80 00 13 b 200c150 <_Heap_Free+0x1c0>
200c108: c2 27 60 04 st %g1, [ %i5 + 4 ]
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200c10c: f0 27 60 0c st %i0, [ %i5 + 0xc ]
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200c110: c6 27 60 08 st %g3, [ %i5 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200c114: fa 20 e0 0c st %i5, [ %g3 + 0xc ]
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;
200c118: 86 10 a0 01 or %g2, 1, %g3
200c11c: c6 27 60 04 st %g3, [ %i5 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200c120: c6 00 60 04 ld [ %g1 + 4 ], %g3
next_block->prev_size = block_size;
200c124: c4 20 80 1d st %g2, [ %g2 + %i5 ]
} 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;
200c128: 86 08 ff fe and %g3, -2, %g3
200c12c: c6 20 60 04 st %g3, [ %g1 + 4 ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200c130: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
if ( stats->max_free_blocks < stats->free_blocks ) {
200c134: c6 06 20 3c ld [ %i0 + 0x3c ], %g3
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;
200c138: 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;
200c13c: fa 26 20 08 st %i5, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200c140: 80 a0 c0 01 cmp %g3, %g1
200c144: 1a 80 00 03 bcc 200c150 <_Heap_Free+0x1c0>
200c148: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200c14c: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
}
}
/* Statistics */
--stats->used_blocks;
200c150: c2 06 20 40 ld [ %i0 + 0x40 ], %g1
++stats->frees;
stats->free_size += block_size;
return( true );
200c154: 88 10 20 01 mov 1, %g4
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200c158: 82 00 7f ff add %g1, -1, %g1
200c15c: c2 26 20 40 st %g1, [ %i0 + 0x40 ]
++stats->frees;
200c160: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
200c164: 82 00 60 01 inc %g1
200c168: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->free_size += block_size;
200c16c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
200c170: 84 00 40 02 add %g1, %g2, %g2
200c174: c4 26 20 30 st %g2, [ %i0 + 0x30 ]
return( true );
}
200c178: b0 09 20 01 and %g4, 1, %i0
200c17c: 81 c7 e0 08 ret
200c180: 81 e8 00 00 restore
02018774 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
2018774: 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);
2018778: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
201877c: 7f ff f9 4a call 2016ca4 <.urem>
2018780: 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
2018784: c6 06 20 20 ld [ %i0 + 0x20 ], %g3
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
2018788: ba 06 7f f8 add %i1, -8, %i5
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
201878c: 90 27 40 08 sub %i5, %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;
2018790: 80 a2 00 03 cmp %o0, %g3
2018794: 0a 80 00 05 bcs 20187a8 <_Heap_Size_of_alloc_area+0x34>
2018798: 84 10 20 00 clr %g2
201879c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
20187a0: 80 a0 40 08 cmp %g1, %o0
20187a4: 84 60 3f ff subx %g0, -1, %g2
uintptr_t const alloc_begin = (uintptr_t) alloc_begin_ptr;
Heap_Block *block = _Heap_Block_of_alloc_area( alloc_begin, page_size );
Heap_Block *next_block = NULL;
uintptr_t block_size = 0;
if ( !_Heap_Is_block_in_heap( heap, block ) ) {
20187a8: 80 a0 a0 00 cmp %g2, 0
20187ac: 02 80 00 15 be 2018800 <_Heap_Size_of_alloc_area+0x8c>
20187b0: 82 10 20 00 clr %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;
20187b4: fa 02 20 04 ld [ %o0 + 4 ], %i5
20187b8: ba 0f 7f fe and %i5, -2, %i5
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
20187bc: ba 07 40 08 add %i5, %o0, %i5
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;
20187c0: 80 a7 40 03 cmp %i5, %g3
20187c4: 0a 80 00 05 bcs 20187d8 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN
20187c8: 84 10 20 00 clr %g2
20187cc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
20187d0: 80 a0 40 1d cmp %g1, %i5
20187d4: 84 60 3f ff subx %g0, -1, %g2
}
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if (
20187d8: 80 a0 a0 00 cmp %g2, 0
20187dc: 02 80 00 09 be 2018800 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN
20187e0: 82 10 20 00 clr %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;
20187e4: c4 07 60 04 ld [ %i5 + 4 ], %g2
!_Heap_Is_block_in_heap( heap, next_block )
|| !_Heap_Is_prev_used( next_block )
20187e8: 80 88 a0 01 btst 1, %g2
20187ec: 02 80 00 05 be 2018800 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN
20187f0: ba 27 40 19 sub %i5, %i1, %i5
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
20187f4: 82 10 20 01 mov 1, %g1
|| !_Heap_Is_prev_used( next_block )
) {
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
20187f8: ba 07 60 04 add %i5, 4, %i5
20187fc: fa 26 80 00 st %i5, [ %i2 ]
return true;
}
2018800: b0 08 60 01 and %g1, 1, %i0
2018804: 81 c7 e0 08 ret
2018808: 81 e8 00 00 restore
0200805c <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
200805c: 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;
2008060: 3b 00 80 20 sethi %hi(0x2008000), %i5
Heap_Control *heap,
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
2008064: f8 06 20 10 ld [ %i0 + 0x10 ], %i4
uintptr_t const min_block_size = heap->min_block_size;
2008068: e0 06 20 14 ld [ %i0 + 0x14 ], %l0
Heap_Block *const first_block = heap->first_block;
200806c: f6 06 20 20 ld [ %i0 + 0x20 ], %i3
Heap_Block *const last_block = heap->last_block;
2008070: e2 06 20 24 ld [ %i0 + 0x24 ], %l1
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
2008074: 80 a6 a0 00 cmp %i2, 0
2008078: 02 80 00 04 be 2008088 <_Heap_Walk+0x2c>
200807c: ba 17 60 08 or %i5, 8, %i5
2008080: 3b 00 80 20 sethi %hi(0x2008000), %i5
2008084: ba 17 60 10 or %i5, 0x10, %i5 ! 2008010 <_Heap_Walk_print>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2008088: 03 00 80 5c sethi %hi(0x2017000), %g1
200808c: c4 00 62 cc ld [ %g1 + 0x2cc ], %g2 ! 20172cc <_System_state_Current>
2008090: 80 a0 a0 03 cmp %g2, 3
2008094: 12 80 01 24 bne 2008524 <_Heap_Walk+0x4c8>
2008098: 82 10 20 01 mov 1, %g1
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)(
200809c: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
20080a0: da 06 20 18 ld [ %i0 + 0x18 ], %o5
20080a4: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
20080a8: f6 23 a0 60 st %i3, [ %sp + 0x60 ]
20080ac: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
20080b0: c2 06 20 08 ld [ %i0 + 8 ], %g1
20080b4: 90 10 00 19 mov %i1, %o0
20080b8: c2 23 a0 68 st %g1, [ %sp + 0x68 ]
20080bc: c2 06 20 0c ld [ %i0 + 0xc ], %g1
20080c0: 92 10 20 00 clr %o1
20080c4: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
20080c8: 15 00 80 52 sethi %hi(0x2014800), %o2
20080cc: 96 10 00 1c mov %i4, %o3
20080d0: 94 12 a0 80 or %o2, 0x80, %o2
20080d4: 9f c7 40 00 call %i5
20080d8: 98 10 00 10 mov %l0, %o4
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
20080dc: 80 a7 20 00 cmp %i4, 0
20080e0: 12 80 00 07 bne 20080fc <_Heap_Walk+0xa0>
20080e4: 80 8f 20 07 btst 7, %i4
(*printer)( source, true, "page size is zero\n" );
20080e8: 15 00 80 52 sethi %hi(0x2014800), %o2
20080ec: 90 10 00 19 mov %i1, %o0
20080f0: 92 10 20 01 mov 1, %o1
20080f4: 10 80 00 32 b 20081bc <_Heap_Walk+0x160>
20080f8: 94 12 a1 18 or %o2, 0x118, %o2
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
20080fc: 22 80 00 08 be,a 200811c <_Heap_Walk+0xc0>
2008100: 90 10 00 10 mov %l0, %o0
(*printer)(
2008104: 15 00 80 52 sethi %hi(0x2014800), %o2
2008108: 90 10 00 19 mov %i1, %o0
200810c: 92 10 20 01 mov 1, %o1
2008110: 94 12 a1 30 or %o2, 0x130, %o2
2008114: 10 80 01 0b b 2008540 <_Heap_Walk+0x4e4>
2008118: 96 10 00 1c mov %i4, %o3
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200811c: 7f ff e6 71 call 2001ae0 <.urem>
2008120: 92 10 00 1c mov %i4, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
2008124: 80 a2 20 00 cmp %o0, 0
2008128: 22 80 00 08 be,a 2008148 <_Heap_Walk+0xec>
200812c: 90 06 e0 08 add %i3, 8, %o0
(*printer)(
2008130: 15 00 80 52 sethi %hi(0x2014800), %o2
2008134: 90 10 00 19 mov %i1, %o0
2008138: 92 10 20 01 mov 1, %o1
200813c: 94 12 a1 50 or %o2, 0x150, %o2
2008140: 10 80 01 00 b 2008540 <_Heap_Walk+0x4e4>
2008144: 96 10 00 10 mov %l0, %o3
2008148: 7f ff e6 66 call 2001ae0 <.urem>
200814c: 92 10 00 1c mov %i4, %o1
);
return false;
}
if (
2008150: 80 a2 20 00 cmp %o0, 0
2008154: 22 80 00 08 be,a 2008174 <_Heap_Walk+0x118>
2008158: c2 06 e0 04 ld [ %i3 + 4 ], %g1
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
200815c: 15 00 80 52 sethi %hi(0x2014800), %o2
2008160: 90 10 00 19 mov %i1, %o0
2008164: 92 10 20 01 mov 1, %o1
2008168: 94 12 a1 78 or %o2, 0x178, %o2
200816c: 10 80 00 f5 b 2008540 <_Heap_Walk+0x4e4>
2008170: 96 10 00 1b mov %i3, %o3
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2008174: 80 88 60 01 btst 1, %g1
2008178: 32 80 00 07 bne,a 2008194 <_Heap_Walk+0x138>
200817c: f4 04 60 04 ld [ %l1 + 4 ], %i2
(*printer)(
2008180: 15 00 80 52 sethi %hi(0x2014800), %o2
2008184: 90 10 00 19 mov %i1, %o0
2008188: 92 10 20 01 mov 1, %o1
200818c: 10 80 00 0c b 20081bc <_Heap_Walk+0x160>
2008190: 94 12 a1 b0 or %o2, 0x1b0, %o2
- 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;
2008194: b4 0e bf fe and %i2, -2, %i2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
2008198: b4 04 40 1a add %l1, %i2, %i2
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;
200819c: c2 06 a0 04 ld [ %i2 + 4 ], %g1
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
20081a0: 80 88 60 01 btst 1, %g1
20081a4: 12 80 00 0a bne 20081cc <_Heap_Walk+0x170>
20081a8: 80 a6 80 1b cmp %i2, %i3
(*printer)(
20081ac: 15 00 80 52 sethi %hi(0x2014800), %o2
20081b0: 90 10 00 19 mov %i1, %o0
20081b4: 92 10 20 01 mov 1, %o1
20081b8: 94 12 a1 e0 or %o2, 0x1e0, %o2
20081bc: 9f c7 40 00 call %i5
20081c0: 01 00 00 00 nop
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20081c4: 10 80 00 d8 b 2008524 <_Heap_Walk+0x4c8>
20081c8: 82 10 20 00 clr %g1 ! 0 <PROM_START>
);
return false;
}
if (
20081cc: 02 80 00 06 be 20081e4 <_Heap_Walk+0x188>
20081d0: 15 00 80 52 sethi %hi(0x2014800), %o2
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
20081d4: 90 10 00 19 mov %i1, %o0
20081d8: 92 10 20 01 mov 1, %o1
20081dc: 10 bf ff f8 b 20081bc <_Heap_Walk+0x160>
20081e0: 94 12 a1 f8 or %o2, 0x1f8, %o2
int source,
Heap_Walk_printer printer,
Heap_Control *heap
)
{
uintptr_t const page_size = heap->page_size;
20081e4: e6 06 20 10 ld [ %i0 + 0x10 ], %l3
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
20081e8: d6 06 20 08 ld [ %i0 + 8 ], %o3
const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
20081ec: 10 80 00 33 b 20082b8 <_Heap_Walk+0x25c>
20081f0: a4 10 00 18 mov %i0, %l2
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;
20081f4: 80 a0 80 0b cmp %g2, %o3
20081f8: 18 80 00 05 bgu 200820c <_Heap_Walk+0x1b0>
20081fc: 82 10 20 00 clr %g1
2008200: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
2008204: 80 a0 40 0b cmp %g1, %o3
2008208: 82 60 3f ff subx %g0, -1, %g1
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 ) {
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
200820c: 80 a0 60 00 cmp %g1, 0
2008210: 32 80 00 07 bne,a 200822c <_Heap_Walk+0x1d0>
2008214: 90 02 e0 08 add %o3, 8, %o0
(*printer)(
2008218: 15 00 80 52 sethi %hi(0x2014800), %o2
200821c: 90 10 00 19 mov %i1, %o0
2008220: 92 10 20 01 mov 1, %o1
2008224: 10 80 00 c7 b 2008540 <_Heap_Walk+0x4e4>
2008228: 94 12 a2 28 or %o2, 0x228, %o2
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200822c: d6 27 bf fc st %o3, [ %fp + -4 ]
2008230: 7f ff e6 2c call 2001ae0 <.urem>
2008234: 92 10 00 13 mov %l3, %o1
);
return false;
}
if (
2008238: 80 a2 20 00 cmp %o0, 0
200823c: 02 80 00 07 be 2008258 <_Heap_Walk+0x1fc>
2008240: d6 07 bf fc ld [ %fp + -4 ], %o3
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
2008244: 15 00 80 52 sethi %hi(0x2014800), %o2
2008248: 90 10 00 19 mov %i1, %o0
200824c: 92 10 20 01 mov 1, %o1
2008250: 10 80 00 bc b 2008540 <_Heap_Walk+0x4e4>
2008254: 94 12 a2 48 or %o2, 0x248, %o2
- 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;
2008258: c2 02 e0 04 ld [ %o3 + 4 ], %g1
200825c: 82 08 7f fe and %g1, -2, %g1
block = next_block;
} while ( block != first_block );
return true;
}
2008260: 82 02 c0 01 add %o3, %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;
2008264: c2 00 60 04 ld [ %g1 + 4 ], %g1
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008268: 80 88 60 01 btst 1, %g1
200826c: 22 80 00 07 be,a 2008288 <_Heap_Walk+0x22c>
2008270: d8 02 e0 0c ld [ %o3 + 0xc ], %o4
(*printer)(
2008274: 15 00 80 52 sethi %hi(0x2014800), %o2
2008278: 90 10 00 19 mov %i1, %o0
200827c: 92 10 20 01 mov 1, %o1
2008280: 10 80 00 b0 b 2008540 <_Heap_Walk+0x4e4>
2008284: 94 12 a2 78 or %o2, 0x278, %o2
);
return false;
}
if ( free_block->prev != prev_block ) {
2008288: 80 a3 00 12 cmp %o4, %l2
200828c: 22 80 00 0a be,a 20082b4 <_Heap_Walk+0x258>
2008290: a4 10 00 0b mov %o3, %l2
(*printer)(
2008294: 15 00 80 52 sethi %hi(0x2014800), %o2
2008298: 90 10 00 19 mov %i1, %o0
200829c: 92 10 20 01 mov 1, %o1
20082a0: 94 12 a2 98 or %o2, 0x298, %o2
20082a4: 9f c7 40 00 call %i5
20082a8: 01 00 00 00 nop
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20082ac: 10 80 00 9e b 2008524 <_Heap_Walk+0x4c8>
20082b0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
return false;
}
prev_block = free_block;
free_block = free_block->next;
20082b4: d6 02 e0 08 ld [ %o3 + 8 ], %o3
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 ) {
20082b8: 80 a2 c0 18 cmp %o3, %i0
20082bc: 32 bf ff ce bne,a 20081f4 <_Heap_Walk+0x198>
20082c0: c4 06 20 20 ld [ %i0 + 0x20 ], %g2
20082c4: 2d 00 80 53 sethi %hi(0x2014c00), %l6
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
20082c8: 2f 00 80 53 sethi %hi(0x2014c00), %l7
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
20082cc: ac 15 a0 58 or %l6, 0x58, %l6
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
20082d0: ae 15 e0 40 or %l7, 0x40, %l7
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
20082d4: 2b 00 80 53 sethi %hi(0x2014c00), %l5
block = next_block;
} while ( block != first_block );
return true;
}
20082d8: c2 06 a0 04 ld [ %i2 + 4 ], %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;
20082dc: c6 06 20 20 ld [ %i0 + 0x20 ], %g3
- 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;
20082e0: a4 08 7f fe and %g1, -2, %l2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
20082e4: a6 04 80 1a add %l2, %i2, %l3
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;
20082e8: 80 a0 c0 13 cmp %g3, %l3
20082ec: 18 80 00 05 bgu 2008300 <_Heap_Walk+0x2a4> <== NEVER TAKEN
20082f0: 84 10 20 00 clr %g2
20082f4: c4 06 20 24 ld [ %i0 + 0x24 ], %g2
20082f8: 80 a0 80 13 cmp %g2, %l3
20082fc: 84 60 3f ff subx %g0, -1, %g2
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;
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
2008300: 80 a0 a0 00 cmp %g2, 0
2008304: 12 80 00 07 bne 2008320 <_Heap_Walk+0x2c4>
2008308: 84 1e 80 11 xor %i2, %l1, %g2
(*printer)(
200830c: 15 00 80 52 sethi %hi(0x2014800), %o2
2008310: 90 10 00 19 mov %i1, %o0
2008314: 92 10 20 01 mov 1, %o1
2008318: 10 80 00 2c b 20083c8 <_Heap_Walk+0x36c>
200831c: 94 12 a2 d0 or %o2, 0x2d0, %o2
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;
2008320: 80 a0 00 02 cmp %g0, %g2
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008324: c2 27 bf fc st %g1, [ %fp + -4 ]
2008328: a8 40 20 00 addx %g0, 0, %l4
200832c: 90 10 00 12 mov %l2, %o0
2008330: 7f ff e5 ec call 2001ae0 <.urem>
2008334: 92 10 00 1c mov %i4, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
2008338: 80 a2 20 00 cmp %o0, 0
200833c: 02 80 00 0c be 200836c <_Heap_Walk+0x310>
2008340: c2 07 bf fc ld [ %fp + -4 ], %g1
2008344: 80 8d 20 ff btst 0xff, %l4
2008348: 02 80 00 0a be 2008370 <_Heap_Walk+0x314>
200834c: 80 a4 80 10 cmp %l2, %l0
(*printer)(
2008350: 15 00 80 52 sethi %hi(0x2014800), %o2
2008354: 90 10 00 19 mov %i1, %o0
2008358: 92 10 20 01 mov 1, %o1
200835c: 94 12 a3 00 or %o2, 0x300, %o2
2008360: 96 10 00 1a mov %i2, %o3
2008364: 10 bf ff d0 b 20082a4 <_Heap_Walk+0x248>
2008368: 98 10 00 12 mov %l2, %o4
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200836c: 80 a4 80 10 cmp %l2, %l0
2008370: 1a 80 00 0d bcc 20083a4 <_Heap_Walk+0x348>
2008374: 80 a4 c0 1a cmp %l3, %i2
2008378: 80 8d 20 ff btst 0xff, %l4
200837c: 02 80 00 0a be 20083a4 <_Heap_Walk+0x348> <== NEVER TAKEN
2008380: 80 a4 c0 1a cmp %l3, %i2
(*printer)(
2008384: 15 00 80 52 sethi %hi(0x2014800), %o2
2008388: 90 10 00 19 mov %i1, %o0
200838c: 92 10 20 01 mov 1, %o1
2008390: 94 12 a3 30 or %o2, 0x330, %o2
2008394: 96 10 00 1a mov %i2, %o3
2008398: 98 10 00 12 mov %l2, %o4
200839c: 10 80 00 3d b 2008490 <_Heap_Walk+0x434>
20083a0: 9a 10 00 10 mov %l0, %o5
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
20083a4: 38 80 00 0c bgu,a 20083d4 <_Heap_Walk+0x378>
20083a8: a8 08 60 01 and %g1, 1, %l4
20083ac: 80 8d 20 ff btst 0xff, %l4
20083b0: 02 80 00 09 be 20083d4 <_Heap_Walk+0x378>
20083b4: a8 08 60 01 and %g1, 1, %l4
(*printer)(
20083b8: 15 00 80 52 sethi %hi(0x2014800), %o2
20083bc: 90 10 00 19 mov %i1, %o0
20083c0: 92 10 20 01 mov 1, %o1
20083c4: 94 12 a3 60 or %o2, 0x360, %o2
20083c8: 96 10 00 1a mov %i2, %o3
20083cc: 10 bf ff b6 b 20082a4 <_Heap_Walk+0x248>
20083d0: 98 10 00 13 mov %l3, %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;
20083d4: c2 04 e0 04 ld [ %l3 + 4 ], %g1
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
20083d8: 80 88 60 01 btst 1, %g1
20083dc: 12 80 00 40 bne 20084dc <_Heap_Walk+0x480>
20083e0: 90 10 00 19 mov %i1, %o0
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 ?
20083e4: da 06 a0 0c ld [ %i2 + 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)(
20083e8: c2 06 20 08 ld [ %i0 + 8 ], %g1
20083ec: 05 00 80 52 sethi %hi(0x2014800), %g2
return _Heap_Free_list_head(heap)->next;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap )
{
return _Heap_Free_list_tail(heap)->prev;
20083f0: c8 06 20 0c ld [ %i0 + 0xc ], %g4
20083f4: 80 a3 40 01 cmp %o5, %g1
20083f8: 02 80 00 07 be 2008414 <_Heap_Walk+0x3b8>
20083fc: 86 10 a0 40 or %g2, 0x40, %g3
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
2008400: 80 a3 40 18 cmp %o5, %i0
2008404: 12 80 00 04 bne 2008414 <_Heap_Walk+0x3b8>
2008408: 86 15 60 08 or %l5, 8, %g3
200840c: 07 00 80 52 sethi %hi(0x2014800), %g3
2008410: 86 10 e0 50 or %g3, 0x50, %g3 ! 2014850 <_Status_Object_name_errors_to_status+0x48>
block->next,
block->next == last_free_block ?
2008414: c4 06 a0 08 ld [ %i2 + 8 ], %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)(
2008418: 1f 00 80 52 sethi %hi(0x2014800), %o7
200841c: 80 a0 80 04 cmp %g2, %g4
2008420: 02 80 00 07 be 200843c <_Heap_Walk+0x3e0>
2008424: 82 13 e0 60 or %o7, 0x60, %g1
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008428: 80 a0 80 18 cmp %g2, %i0
200842c: 12 80 00 04 bne 200843c <_Heap_Walk+0x3e0>
2008430: 82 15 60 08 or %l5, 8, %g1
2008434: 03 00 80 52 sethi %hi(0x2014800), %g1
2008438: 82 10 60 70 or %g1, 0x70, %g1 ! 2014870 <_Status_Object_name_errors_to_status+0x68>
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)(
200843c: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
2008440: c4 23 a0 60 st %g2, [ %sp + 0x60 ]
2008444: c2 23 a0 64 st %g1, [ %sp + 0x64 ]
2008448: 90 10 00 19 mov %i1, %o0
200844c: 92 10 20 00 clr %o1
2008450: 15 00 80 52 sethi %hi(0x2014800), %o2
2008454: 96 10 00 1a mov %i2, %o3
2008458: 94 12 a3 98 or %o2, 0x398, %o2
200845c: 9f c7 40 00 call %i5
2008460: 98 10 00 12 mov %l2, %o4
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
2008464: da 04 c0 00 ld [ %l3 ], %o5
2008468: 80 a4 80 0d cmp %l2, %o5
200846c: 02 80 00 0d be 20084a0 <_Heap_Walk+0x444>
2008470: 80 a5 20 00 cmp %l4, 0
(*printer)(
2008474: 15 00 80 52 sethi %hi(0x2014800), %o2
2008478: e6 23 a0 5c st %l3, [ %sp + 0x5c ]
200847c: 90 10 00 19 mov %i1, %o0
2008480: 92 10 20 01 mov 1, %o1
2008484: 94 12 a3 d0 or %o2, 0x3d0, %o2
2008488: 96 10 00 1a mov %i2, %o3
200848c: 98 10 00 12 mov %l2, %o4
2008490: 9f c7 40 00 call %i5
2008494: 01 00 00 00 nop
2008498: 10 80 00 23 b 2008524 <_Heap_Walk+0x4c8>
200849c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
);
return false;
}
if ( !prev_used ) {
20084a0: 32 80 00 0a bne,a 20084c8 <_Heap_Walk+0x46c>
20084a4: c2 06 20 08 ld [ %i0 + 8 ], %g1
(*printer)(
20084a8: 15 00 80 53 sethi %hi(0x2014c00), %o2
20084ac: 90 10 00 19 mov %i1, %o0
20084b0: 92 10 20 01 mov 1, %o1
20084b4: 10 80 00 22 b 200853c <_Heap_Walk+0x4e0>
20084b8: 94 12 a0 10 or %o2, 0x10, %o2
{
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 ) {
if ( free_block == block ) {
20084bc: 02 80 00 17 be 2008518 <_Heap_Walk+0x4bc>
20084c0: 80 a4 c0 1b cmp %l3, %i3
return true;
}
free_block = free_block->next;
20084c4: 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 ) {
20084c8: 80 a0 40 18 cmp %g1, %i0
20084cc: 12 bf ff fc bne 20084bc <_Heap_Walk+0x460>
20084d0: 80 a0 40 1a cmp %g1, %i2
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
20084d4: 10 80 00 17 b 2008530 <_Heap_Walk+0x4d4>
20084d8: 15 00 80 53 sethi %hi(0x2014c00), %o2
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
20084dc: 80 a5 20 00 cmp %l4, 0
20084e0: 02 80 00 08 be 2008500 <_Heap_Walk+0x4a4>
20084e4: 92 10 20 00 clr %o1
(*printer)(
20084e8: 94 10 00 17 mov %l7, %o2
20084ec: 96 10 00 1a mov %i2, %o3
20084f0: 9f c7 40 00 call %i5
20084f4: 98 10 00 12 mov %l2, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
20084f8: 10 80 00 08 b 2008518 <_Heap_Walk+0x4bc>
20084fc: 80 a4 c0 1b cmp %l3, %i3
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008500: da 06 80 00 ld [ %i2 ], %o5
2008504: 94 10 00 16 mov %l6, %o2
2008508: 96 10 00 1a mov %i2, %o3
200850c: 9f c7 40 00 call %i5
2008510: 98 10 00 12 mov %l2, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
2008514: 80 a4 c0 1b cmp %l3, %i3
2008518: 12 bf ff 70 bne 20082d8 <_Heap_Walk+0x27c>
200851c: b4 10 00 13 mov %l3, %i2
return true;
2008520: 82 10 20 01 mov 1, %g1
}
2008524: b0 08 60 01 and %g1, 1, %i0
2008528: 81 c7 e0 08 ret
200852c: 81 e8 00 00 restore
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
2008530: 90 10 00 19 mov %i1, %o0
2008534: 92 10 20 01 mov 1, %o1
2008538: 94 12 a0 80 or %o2, 0x80, %o2
200853c: 96 10 00 1a mov %i2, %o3
2008540: 9f c7 40 00 call %i5
2008544: 01 00 00 00 nop
2008548: 10 bf ff f7 b 2008524 <_Heap_Walk+0x4c8>
200854c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
020077f0 <_Objects_Allocate>:
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
20077f0: 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 )
20077f4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
20077f8: ba 10 00 18 mov %i0, %i5
* 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 )
20077fc: 80 a0 60 00 cmp %g1, 0
2007800: 02 80 00 20 be 2007880 <_Objects_Allocate+0x90> <== NEVER TAKEN
2007804: 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 );
2007808: b8 07 60 20 add %i5, 0x20, %i4
200780c: 7f ff fd 87 call 2006e28 <_Chain_Get>
2007810: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
2007814: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
2007818: 80 a0 60 00 cmp %g1, 0
200781c: 02 80 00 19 be 2007880 <_Objects_Allocate+0x90>
2007820: 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 ) {
2007824: 80 a2 20 00 cmp %o0, 0
2007828: 32 80 00 0a bne,a 2007850 <_Objects_Allocate+0x60>
200782c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
_Objects_Extend_information( information );
2007830: 40 00 00 1d call 20078a4 <_Objects_Extend_information>
2007834: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
2007838: 7f ff fd 7c call 2006e28 <_Chain_Get>
200783c: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
2007840: b0 92 20 00 orcc %o0, 0, %i0
2007844: 02 80 00 0f be 2007880 <_Objects_Allocate+0x90>
2007848: 01 00 00 00 nop
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
200784c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
2007850: d0 16 20 0a lduh [ %i0 + 0xa ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
2007854: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
2007858: 40 00 3c 67 call 20169f4 <.udiv>
200785c: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
2007860: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
2007864: 91 2a 20 02 sll %o0, 2, %o0
2007868: c4 00 40 08 ld [ %g1 + %o0 ], %g2
200786c: 84 00 bf ff add %g2, -1, %g2
2007870: c4 20 40 08 st %g2, [ %g1 + %o0 ]
information->inactive--;
2007874: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1
2007878: 82 00 7f ff add %g1, -1, %g1
200787c: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
2007880: 81 c7 e0 08 ret
2007884: 81 e8 00 00 restore
02007bfc <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
2007bfc: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
2007c00: 80 a6 60 00 cmp %i1, 0
2007c04: 02 80 00 17 be 2007c60 <_Objects_Get_information+0x64>
2007c08: ba 10 20 00 clr %i5
/*
* 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 );
2007c0c: 40 00 11 5e call 200c184 <_Objects_API_maximum_class>
2007c10: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
2007c14: 80 a2 20 00 cmp %o0, 0
2007c18: 02 80 00 12 be 2007c60 <_Objects_Get_information+0x64>
2007c1c: 80 a6 40 08 cmp %i1, %o0
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
2007c20: 18 80 00 10 bgu 2007c60 <_Objects_Get_information+0x64>
2007c24: 03 00 80 6c sethi %hi(0x201b000), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
2007c28: b1 2e 20 02 sll %i0, 2, %i0
2007c2c: 82 10 63 08 or %g1, 0x308, %g1
2007c30: c2 00 40 18 ld [ %g1 + %i0 ], %g1
2007c34: 80 a0 60 00 cmp %g1, 0
2007c38: 02 80 00 0a be 2007c60 <_Objects_Get_information+0x64> <== NEVER TAKEN
2007c3c: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
2007c40: fa 00 40 19 ld [ %g1 + %i1 ], %i5
if ( !info )
2007c44: 80 a7 60 00 cmp %i5, 0
2007c48: 02 80 00 06 be 2007c60 <_Objects_Get_information+0x64> <== NEVER TAKEN
2007c4c: 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 )
2007c50: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1
return NULL;
2007c54: 80 a0 00 01 cmp %g0, %g1
2007c58: 82 60 20 00 subx %g0, 0, %g1
2007c5c: ba 0f 40 01 and %i5, %g1, %i5
#endif
return info;
}
2007c60: 81 c7 e0 08 ret
2007c64: 91 e8 00 1d restore %g0, %i5, %o0
0200902c <_Objects_Id_to_name>:
*/
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
200902c: 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;
2009030: 92 96 20 00 orcc %i0, 0, %o1
2009034: 12 80 00 06 bne 200904c <_Objects_Id_to_name+0x20>
2009038: 83 32 60 18 srl %o1, 0x18, %g1
200903c: 03 00 80 73 sethi %hi(0x201cc00), %g1
2009040: c2 00 62 b8 ld [ %g1 + 0x2b8 ], %g1 ! 201ceb8 <_Per_CPU_Information+0xc>
2009044: d2 00 60 08 ld [ %g1 + 8 ], %o1
2009048: 83 32 60 18 srl %o1, 0x18, %g1
200904c: 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 )
2009050: 84 00 7f ff add %g1, -1, %g2
2009054: 80 a0 a0 02 cmp %g2, 2
2009058: 18 80 00 12 bgu 20090a0 <_Objects_Id_to_name+0x74>
200905c: ba 10 20 03 mov 3, %i5
the_api = _Objects_Get_API( tmpId );
if ( !_Objects_Is_api_valid( the_api ) )
return OBJECTS_INVALID_ID;
if ( !_Objects_Information_table[ the_api ] )
2009060: 10 80 00 12 b 20090a8 <_Objects_Id_to_name+0x7c>
2009064: 83 28 60 02 sll %g1, 2, %g1
return OBJECTS_INVALID_ID;
the_class = _Objects_Get_class( tmpId );
information = _Objects_Information_table[ the_api ][ the_class ];
2009068: 85 28 a0 02 sll %g2, 2, %g2
200906c: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
2009070: 80 a2 20 00 cmp %o0, 0
2009074: 02 80 00 0b be 20090a0 <_Objects_Id_to_name+0x74> <== NEVER TAKEN
2009078: 01 00 00 00 nop
#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 );
200907c: 7f ff ff ce call 2008fb4 <_Objects_Get>
2009080: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
2009084: 80 a2 20 00 cmp %o0, 0
2009088: 02 80 00 06 be 20090a0 <_Objects_Id_to_name+0x74>
200908c: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
2009090: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2009094: ba 10 20 00 clr %i5
the_object = _Objects_Get( information, tmpId, &ignored_location );
if ( !the_object )
return OBJECTS_INVALID_ID;
*name = the_object->name;
_Thread_Enable_dispatch();
2009098: 40 00 03 6b call 2009e44 <_Thread_Enable_dispatch>
200909c: c2 26 40 00 st %g1, [ %i1 ]
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
}
20090a0: 81 c7 e0 08 ret
20090a4: 91 e8 00 1d restore %g0, %i5, %o0
the_api = _Objects_Get_API( tmpId );
if ( !_Objects_Is_api_valid( the_api ) )
return OBJECTS_INVALID_ID;
if ( !_Objects_Information_table[ the_api ] )
20090a8: 05 00 80 72 sethi %hi(0x201c800), %g2
20090ac: 84 10 a3 e8 or %g2, 0x3e8, %g2 ! 201cbe8 <_Objects_Information_table>
20090b0: c2 00 80 01 ld [ %g2 + %g1 ], %g1
20090b4: 80 a0 60 00 cmp %g1, 0
20090b8: 12 bf ff ec bne 2009068 <_Objects_Id_to_name+0x3c>
20090bc: 85 32 60 1b srl %o1, 0x1b, %g2
20090c0: 30 bf ff f8 b,a 20090a0 <_Objects_Id_to_name+0x74>
020086c4 <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
20086c4: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if(!the_node) return;
20086c8: 80 a6 60 00 cmp %i1, 0
20086cc: 02 80 00 77 be 20088a8 <_RBTree_Extract_unprotected+0x1e4>
20086d0: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
20086d4: c2 06 20 08 ld [ %i0 + 8 ], %g1
20086d8: 80 a6 40 01 cmp %i1, %g1
20086dc: 32 80 00 0d bne,a 2008710 <_RBTree_Extract_unprotected+0x4c>
20086e0: c2 06 20 0c ld [ %i0 + 0xc ], %g1
if (the_node->child[RBT_RIGHT])
20086e4: c2 06 60 08 ld [ %i1 + 8 ], %g1
20086e8: 80 a0 60 00 cmp %g1, 0
20086ec: 22 80 00 04 be,a 20086fc <_RBTree_Extract_unprotected+0x38>
20086f0: c2 06 40 00 ld [ %i1 ], %g1
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
20086f4: 10 80 00 06 b 200870c <_RBTree_Extract_unprotected+0x48>
20086f8: c2 26 20 08 st %g1, [ %i0 + 8 ]
else {
the_rbtree->first[RBT_LEFT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
20086fc: 80 a6 00 01 cmp %i0, %g1
2008700: 12 80 00 03 bne 200870c <_RBTree_Extract_unprotected+0x48>
2008704: c2 26 20 08 st %g1, [ %i0 + 8 ]
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
2008708: c0 26 20 08 clr [ %i0 + 8 ]
}
}
/* check if max needs to be updated: note, min can equal max (1 element) */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
200870c: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2008710: 80 a6 40 01 cmp %i1, %g1
2008714: 12 80 00 0b bne 2008740 <_RBTree_Extract_unprotected+0x7c>
2008718: c2 06 60 04 ld [ %i1 + 4 ], %g1
if (the_node->child[RBT_LEFT])
200871c: 80 a0 60 00 cmp %g1, 0
2008720: 22 80 00 04 be,a 2008730 <_RBTree_Extract_unprotected+0x6c>
2008724: c4 06 40 00 ld [ %i1 ], %g2
the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT];
2008728: 10 80 00 06 b 2008740 <_RBTree_Extract_unprotected+0x7c>
200872c: c2 26 20 0c st %g1, [ %i0 + 0xc ]
else {
the_rbtree->first[RBT_RIGHT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
2008730: 80 a6 00 02 cmp %i0, %g2
2008734: 12 80 00 03 bne 2008740 <_RBTree_Extract_unprotected+0x7c>
2008738: c4 26 20 0c st %g2, [ %i0 + 0xc ]
the_rbtree->first[RBT_RIGHT]))
the_rbtree->first[RBT_RIGHT] = NULL;
200873c: c0 26 20 0c clr [ %i0 + 0xc ]
* either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT],
* and replace the_node with the target node. This maintains the binary
* search tree property, but may violate the red-black properties.
*/
if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) {
2008740: ba 90 60 00 orcc %g1, 0, %i5
2008744: 02 80 00 32 be 200880c <_RBTree_Extract_unprotected+0x148>
2008748: f8 06 60 08 ld [ %i1 + 8 ], %i4
200874c: 80 a7 20 00 cmp %i4, 0
2008750: 32 80 00 05 bne,a 2008764 <_RBTree_Extract_unprotected+0xa0><== NEVER TAKEN
2008754: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2008758: 10 80 00 31 b 200881c <_RBTree_Extract_unprotected+0x158>
200875c: b8 10 00 01 mov %g1, %i4
target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */
while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT];
2008760: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2008764: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED
2008768: 32 bf ff fe bne,a 2008760 <_RBTree_Extract_unprotected+0x9c><== NOT EXECUTED
200876c: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED
* target's position (target is the right child of target->parent)
* when target vacates it. if there is no child, then target->parent
* should become NULL. This may cause the coloring to be violated.
* For now we store the color of the node being deleted in victim_color.
*/
leaf = target->child[RBT_LEFT];
2008770: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED
if(leaf) {
2008774: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED
2008778: 02 80 00 05 be 200878c <_RBTree_Extract_unprotected+0xc8> <== NOT EXECUTED
200877c: 01 00 00 00 nop <== NOT EXECUTED
leaf->parent = target->parent;
2008780: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED
2008784: 10 80 00 04 b 2008794 <_RBTree_Extract_unprotected+0xd0> <== NOT EXECUTED
2008788: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
200878c: 7f ff ff 50 call 20084cc <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2008790: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008794: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED
leaf->parent = target->parent;
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
2008798: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED
dir = target != target->parent->child[0];
200879c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED
20087a0: 86 1f 40 03 xor %i5, %g3, %g3 <== NOT EXECUTED
20087a4: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED
20087a8: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED
target->parent->child[dir] = leaf;
20087ac: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED
20087b0: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED
20087b4: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
20087b8: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED
20087bc: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED
20087c0: 86 1e 40 03 xor %i1, %g3, %g3 <== NOT EXECUTED
20087c4: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED
20087c8: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED
the_node->parent->child[dir] = target;
20087cc: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED
20087d0: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED
20087d4: fa 20 a0 04 st %i5, [ %g2 + 4 ] <== NOT EXECUTED
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
20087d8: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED
20087dc: c4 27 60 08 st %g2, [ %i5 + 8 ] <== NOT EXECUTED
the_node->child[RBT_RIGHT]->parent = target;
20087e0: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED
20087e4: fa 20 80 00 st %i5, [ %g2 ] <== NOT EXECUTED
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
20087e8: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED
20087ec: c4 27 60 04 st %g2, [ %i5 + 4 ] <== NOT EXECUTED
the_node->child[RBT_LEFT]->parent = target;
20087f0: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED
20087f4: fa 20 80 00 st %i5, [ %g2 ] <== NOT EXECUTED
/* finally, update the parent node and recolor. target has completely
* replaced the_node, and target's child has moved up the tree if needed.
* the_node is no longer part of the tree, although it has valid pointers
* still.
*/
target->parent = the_node->parent;
20087f8: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED
20087fc: c4 27 40 00 st %g2, [ %i5 ] <== NOT EXECUTED
target->color = the_node->color;
2008800: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 <== NOT EXECUTED
2008804: 10 80 00 14 b 2008854 <_RBTree_Extract_unprotected+0x190> <== NOT EXECUTED
2008808: c4 27 60 10 st %g2, [ %i5 + 0x10 ] <== NOT EXECUTED
* violated. We will fix it later.
* For now we store the color of the node being deleted in victim_color.
*/
leaf = the_node->child[RBT_LEFT] ?
the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT];
if( leaf ) {
200880c: 80 a7 20 00 cmp %i4, 0
2008810: 32 80 00 04 bne,a 2008820 <_RBTree_Extract_unprotected+0x15c>
2008814: c2 06 40 00 ld [ %i1 ], %g1
2008818: 30 80 00 04 b,a 2008828 <_RBTree_Extract_unprotected+0x164>
leaf->parent = the_node->parent;
200881c: c2 06 40 00 ld [ %i1 ], %g1
2008820: 10 80 00 04 b 2008830 <_RBTree_Extract_unprotected+0x16c>
2008824: c2 27 00 00 st %g1, [ %i4 ]
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(the_node);
2008828: 7f ff ff 29 call 20084cc <_RBTree_Extract_validate_unprotected>
200882c: 90 10 00 19 mov %i1, %o0
}
victim_color = the_node->color;
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
2008830: c4 06 40 00 ld [ %i1 ], %g2
leaf->parent = the_node->parent;
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(the_node);
}
victim_color = the_node->color;
2008834: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
2008838: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200883c: 86 1e 40 03 xor %i1, %g3, %g3
2008840: 80 a0 00 03 cmp %g0, %g3
2008844: 86 40 20 00 addx %g0, 0, %g3
the_node->parent->child[dir] = leaf;
2008848: 87 28 e0 02 sll %g3, 2, %g3
200884c: 84 00 80 03 add %g2, %g3, %g2
2008850: f8 20 a0 04 st %i4, [ %g2 + 4 ]
* 1. Deleted a red node, its child must be black. Nothing must be done.
* 2. Deleted a black node and the child is red. Paint child black.
* 3. Deleted a black node and its child is black. This requires some
* care and rotations.
*/
if (victim_color == RBT_BLACK) { /* eliminate case 1 */
2008854: 80 a0 60 00 cmp %g1, 0
2008858: 32 80 00 0e bne,a 2008890 <_RBTree_Extract_unprotected+0x1cc>
200885c: c2 06 20 04 ld [ %i0 + 4 ], %g1
2008860: 80 a7 20 00 cmp %i4, 0
2008864: 22 80 00 0b be,a 2008890 <_RBTree_Extract_unprotected+0x1cc>
2008868: c2 06 20 04 ld [ %i0 + 4 ], %g1
200886c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
2008870: 80 a0 60 01 cmp %g1, 1
2008874: 12 80 00 04 bne 2008884 <_RBTree_Extract_unprotected+0x1c0><== NEVER TAKEN
2008878: 01 00 00 00 nop
if (_RBTree_Is_red(leaf))
leaf->color = RBT_BLACK; /* case 2 */
200887c: 10 80 00 04 b 200888c <_RBTree_Extract_unprotected+0x1c8>
2008880: c0 27 20 10 clr [ %i4 + 0x10 ]
else if(leaf)
_RBTree_Extract_validate_unprotected(leaf); /* case 3 */
2008884: 7f ff ff 12 call 20084cc <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2008888: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
/* Wipe the_node */
_RBTree_Set_off_rbtree(the_node);
/* set root to black, if it exists */
if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK;
200888c: c2 06 20 04 ld [ %i0 + 4 ], %g1
*/
RTEMS_INLINE_ROUTINE void _RBTree_Set_off_rbtree(
RBTree_Node *node
)
{
node->parent = node->child[RBT_LEFT] = node->child[RBT_RIGHT] = NULL;
2008890: c0 26 60 08 clr [ %i1 + 8 ]
2008894: c0 26 60 04 clr [ %i1 + 4 ]
2008898: 80 a0 60 00 cmp %g1, 0
200889c: 02 80 00 03 be 20088a8 <_RBTree_Extract_unprotected+0x1e4>
20088a0: c0 26 40 00 clr [ %i1 ]
20088a4: c0 20 60 10 clr [ %g1 + 0x10 ]
20088a8: 81 c7 e0 08 ret
20088ac: 81 e8 00 00 restore
020084cc <_RBTree_Extract_validate_unprotected>:
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
RBTree_Node *the_node
)
{
20084cc: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
20084d0: fa 06 00 00 ld [ %i0 ], %i5
if(!parent->parent) return;
20084d4: c2 07 40 00 ld [ %i5 ], %g1
20084d8: 80 a0 60 00 cmp %g1, 0
20084dc: 02 80 00 71 be 20086a0 <_RBTree_Extract_validate_unprotected+0x1d4>
20084e0: 90 10 00 18 mov %i0, %o0
sibling = _RBTree_Sibling(the_node);
20084e4: 7f ff ff ca call 200840c <_RBTree_Sibling>
20084e8: b4 10 20 01 mov 1, %i2
/* continue to correct tree as long as the_node is black and not the root */
while (!_RBTree_Is_red(the_node) && parent->parent) {
20084ec: 10 80 00 60 b 200866c <_RBTree_Extract_validate_unprotected+0x1a0>
20084f0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
20084f4: 22 80 00 5e be,a 200866c <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN
20084f8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED
20084fc: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
2008500: 80 a0 60 01 cmp %g1, 1
2008504: 32 80 00 14 bne,a 2008554 <_RBTree_Extract_validate_unprotected+0x88>
2008508: c4 02 20 08 ld [ %o0 + 8 ], %g2
* then rotate parent left, making the sibling be the_node's grandparent.
* Now the_node has a black sibling and red parent. After rotation,
* update sibling pointer.
*/
if (_RBTree_Is_red(sibling)) {
parent->color = RBT_RED;
200850c: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
2008510: c2 07 60 04 ld [ %i5 + 4 ], %g1
* Now the_node has a black sibling and red parent. After rotation,
* update sibling pointer.
*/
if (_RBTree_Is_red(sibling)) {
parent->color = RBT_RED;
sibling->color = RBT_BLACK;
2008514: c0 22 20 10 clr [ %o0 + 0x10 ]
dir = the_node != parent->child[0];
2008518: 82 1e 00 01 xor %i0, %g1, %g1
200851c: 80 a0 00 01 cmp %g0, %g1
_RBTree_Rotate(parent, dir);
2008520: 90 10 00 1d mov %i5, %o0
* update sibling pointer.
*/
if (_RBTree_Is_red(sibling)) {
parent->color = RBT_RED;
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
2008524: b8 40 20 00 addx %g0, 0, %i4
_RBTree_Rotate(parent, dir);
2008528: 7f ff ff ca call 2008450 <_RBTree_Rotate>
200852c: 92 10 00 1c mov %i4, %o1
sibling = parent->child[!dir];
2008530: 80 a0 00 1c cmp %g0, %i4
2008534: 82 60 3f ff subx %g0, -1, %g1
2008538: 83 28 60 02 sll %g1, 2, %g1
200853c: 82 07 40 01 add %i5, %g1, %g1
2008540: d0 00 60 04 ld [ %g1 + 4 ], %o0
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
2008544: 80 a2 20 00 cmp %o0, 0
2008548: 22 80 00 49 be,a 200866c <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN
200854c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
2008550: c4 02 20 08 ld [ %o0 + 8 ], %g2
2008554: 80 a0 a0 00 cmp %g2, 0
2008558: 02 80 00 06 be 2008570 <_RBTree_Extract_validate_unprotected+0xa4>
200855c: 82 10 20 00 clr %g1
* This function maintains the properties of the red-black tree.
*
* @note It does NOT disable interrupts to ensure the atomicity
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
2008560: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1
2008564: 82 18 60 01 xor %g1, 1, %g1
2008568: 80 a0 00 01 cmp %g0, %g1
200856c: 82 60 3f ff subx %g0, -1, %g1
_RBTree_Rotate(parent, dir);
sibling = parent->child[!dir];
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
2008570: 80 a0 60 00 cmp %g1, 0
2008574: 32 80 00 14 bne,a 20085c4 <_RBTree_Extract_validate_unprotected+0xf8>
2008578: c2 07 60 04 ld [ %i5 + 4 ], %g1
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
200857c: c4 02 20 04 ld [ %o0 + 4 ], %g2
2008580: 80 a0 a0 00 cmp %g2, 0
2008584: 02 80 00 07 be 20085a0 <_RBTree_Extract_validate_unprotected+0xd4>
2008588: 80 a0 60 00 cmp %g1, 0
* This function maintains the properties of the red-black tree.
*
* @note It does NOT disable interrupts to ensure the atomicity
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
200858c: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1
2008590: 82 18 60 01 xor %g1, 1, %g1
2008594: 80 a0 00 01 cmp %g0, %g1
2008598: 82 60 3f ff subx %g0, -1, %g1
sibling = parent->child[!dir];
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
200859c: 80 a0 60 00 cmp %g1, 0
20085a0: 32 80 00 09 bne,a 20085c4 <_RBTree_Extract_validate_unprotected+0xf8>
20085a4: c2 07 60 04 ld [ %i5 + 4 ], %g1
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
sibling->color = RBT_RED;
20085a8: f4 22 20 10 st %i2, [ %o0 + 0x10 ]
20085ac: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
20085b0: 80 a0 60 01 cmp %g1, 1
20085b4: 32 80 00 3d bne,a 20086a8 <_RBTree_Extract_validate_unprotected+0x1dc>
20085b8: f8 07 40 00 ld [ %i5 ], %i4
if (_RBTree_Is_red(parent)) {
parent->color = RBT_BLACK;
break;
20085bc: 10 80 00 33 b 2008688 <_RBTree_Extract_validate_unprotected+0x1bc>
20085c0: c0 27 60 10 clr [ %i5 + 0x10 ]
* cases, either the_node is to the left or the right of the parent.
* In both cases, first check if one of sibling's children is black,
* and if so rotate in the proper direction and update sibling pointer.
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
20085c4: 82 1e 00 01 xor %i0, %g1, %g1
20085c8: 80 a0 00 01 cmp %g0, %g1
20085cc: b8 40 20 00 addx %g0, 0, %i4
if (!_RBTree_Is_red(sibling->child[!dir])) {
20085d0: 80 a0 00 1c cmp %g0, %i4
20085d4: b6 60 3f ff subx %g0, -1, %i3
20085d8: 83 2e e0 02 sll %i3, 2, %g1
20085dc: 82 02 00 01 add %o0, %g1, %g1
20085e0: c4 00 60 04 ld [ %g1 + 4 ], %g2
20085e4: 80 a0 a0 00 cmp %g2, 0
20085e8: 02 80 00 06 be 2008600 <_RBTree_Extract_validate_unprotected+0x134>
20085ec: 82 10 20 00 clr %g1
* This function maintains the properties of the red-black tree.
*
* @note It does NOT disable interrupts to ensure the atomicity
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
20085f0: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1
20085f4: 82 18 60 01 xor %g1, 1, %g1
20085f8: 80 a0 00 01 cmp %g0, %g1
20085fc: 82 60 3f ff subx %g0, -1, %g1
* In both cases, first check if one of sibling's children is black,
* and if so rotate in the proper direction and update sibling pointer.
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[!dir])) {
2008600: 80 a0 60 00 cmp %g1, 0
2008604: 32 80 00 0e bne,a 200863c <_RBTree_Extract_validate_unprotected+0x170>
2008608: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
sibling->color = RBT_RED;
200860c: 82 10 20 01 mov 1, %g1
2008610: c2 22 20 10 st %g1, [ %o0 + 0x10 ]
sibling->child[dir]->color = RBT_BLACK;
2008614: 83 2f 20 02 sll %i4, 2, %g1
2008618: 82 02 00 01 add %o0, %g1, %g1
200861c: c2 00 60 04 ld [ %g1 + 4 ], %g1
_RBTree_Rotate(sibling, !dir);
2008620: 92 1f 20 01 xor %i4, 1, %o1
2008624: 7f ff ff 8b call 2008450 <_RBTree_Rotate>
2008628: c0 20 60 10 clr [ %g1 + 0x10 ]
sibling = parent->child[!dir];
200862c: 83 2e e0 02 sll %i3, 2, %g1
2008630: 82 07 40 01 add %i5, %g1, %g1
2008634: d0 00 60 04 ld [ %g1 + 4 ], %o0
}
sibling->color = parent->color;
2008638: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
parent->color = RBT_BLACK;
sibling->child[!dir]->color = RBT_BLACK;
200863c: b7 2e e0 02 sll %i3, 2, %i3
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
sibling = parent->child[!dir];
}
sibling->color = parent->color;
2008640: c2 22 20 10 st %g1, [ %o0 + 0x10 ]
parent->color = RBT_BLACK;
sibling->child[!dir]->color = RBT_BLACK;
2008644: 90 02 00 1b add %o0, %i3, %o0
2008648: c2 02 20 04 ld [ %o0 + 4 ], %g1
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
sibling = parent->child[!dir];
}
sibling->color = parent->color;
parent->color = RBT_BLACK;
200864c: c0 27 60 10 clr [ %i5 + 0x10 ]
sibling->child[!dir]->color = RBT_BLACK;
2008650: c0 20 60 10 clr [ %g1 + 0x10 ]
_RBTree_Rotate(parent, dir);
2008654: 90 10 00 1d mov %i5, %o0
2008658: 7f ff ff 7e call 2008450 <_RBTree_Rotate>
200865c: 92 10 00 1c mov %i4, %o1
break; /* done */
2008660: 10 80 00 0b b 200868c <_RBTree_Extract_validate_unprotected+0x1c0>
2008664: c2 06 00 00 ld [ %i0 ], %g1
if(!parent->parent) return;
sibling = _RBTree_Sibling(the_node);
/* continue to correct tree as long as the_node is black and not the root */
while (!_RBTree_Is_red(the_node) && parent->parent) {
2008668: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
200866c: 80 a0 60 01 cmp %g1, 1
2008670: 22 80 00 07 be,a 200868c <_RBTree_Extract_validate_unprotected+0x1c0>
2008674: c2 06 00 00 ld [ %i0 ], %g1
2008678: c2 07 40 00 ld [ %i5 ], %g1
200867c: 80 a0 60 00 cmp %g1, 0
2008680: 12 bf ff 9d bne 20084f4 <_RBTree_Extract_validate_unprotected+0x28>
2008684: 80 a2 20 00 cmp %o0, 0
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2008688: c2 06 00 00 ld [ %i0 ], %g1
200868c: c2 00 40 00 ld [ %g1 ], %g1
2008690: 80 a0 60 00 cmp %g1, 0
2008694: 12 80 00 0a bne 20086bc <_RBTree_Extract_validate_unprotected+0x1f0>
2008698: 01 00 00 00 nop
200869c: c0 26 20 10 clr [ %i0 + 0x10 ]
20086a0: 81 c7 e0 08 ret
20086a4: 81 e8 00 00 restore
parent->color = RBT_BLACK;
break;
}
the_node = parent; /* done if parent is red */
parent = the_node->parent;
sibling = _RBTree_Sibling(the_node);
20086a8: 90 10 00 1d mov %i5, %o0
20086ac: 7f ff ff 58 call 200840c <_RBTree_Sibling>
20086b0: b0 10 00 1d mov %i5, %i0
20086b4: 10 bf ff ed b 2008668 <_RBTree_Extract_validate_unprotected+0x19c>
20086b8: ba 10 00 1c mov %i4, %i5
20086bc: 81 c7 e0 08 ret
20086c0: 81 e8 00 00 restore
02008924 <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
2008924: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
2008928: 7f ff e8 1e call 20029a0 <sparc_disable_interrupts>
200892c: 01 00 00 00 nop
RBTree_Node* iter_node = the_rbtree->root;
while (iter_node) {
if (the_value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_value > iter_node->value;
iter_node = iter_node->child[dir];
2008930: 10 80 00 09 b 2008954 <_RBTree_Find+0x30>
2008934: f0 06 20 04 ld [ %i0 + 4 ], %i0
unsigned int the_value
)
{
RBTree_Node* iter_node = the_rbtree->root;
while (iter_node) {
if (the_value == iter_node->value) return(iter_node);
2008938: 80 a6 40 01 cmp %i1, %g1
200893c: 02 80 00 09 be 2008960 <_RBTree_Find+0x3c>
2008940: 80 a0 40 19 cmp %g1, %i1
RBTree_Direction dir = the_value > iter_node->value;
2008944: 82 40 20 00 addx %g0, 0, %g1
iter_node = iter_node->child[dir];
2008948: 83 28 60 02 sll %g1, 2, %g1
200894c: b0 06 00 01 add %i0, %g1, %i0
2008950: f0 06 20 04 ld [ %i0 + 4 ], %i0
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
RBTree_Node* iter_node = the_rbtree->root;
while (iter_node) {
2008954: 80 a6 20 00 cmp %i0, 0
2008958: 32 bf ff f8 bne,a 2008938 <_RBTree_Find+0x14> <== ALWAYS TAKEN
200895c: c2 06 20 0c ld [ %i0 + 0xc ], %g1
return_node = _RBTree_Find_unprotected( the_rbtree, the_value );
_ISR_Enable( level );
2008960: 7f ff e8 14 call 20029b0 <sparc_enable_interrupts>
2008964: 01 00 00 00 nop
return return_node;
}
2008968: 81 c7 e0 08 ret
200896c: 81 e8 00 00 restore
020088d4 <_RBTree_Find_header>:
*/
RBTree_Control *_RBTree_Find_header(
RBTree_Node *the_node
)
{
20088d4: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Control *return_header;
return_header = NULL;
_ISR_Disable( level );
20088d8: 7f ff e8 32 call 20029a0 <sparc_disable_interrupts>
20088dc: ba 10 00 18 mov %i0, %i5
*/
RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
20088e0: 80 a7 60 00 cmp %i5, 0
20088e4: 02 80 00 0c be 2008914 <_RBTree_Find_header+0x40> <== NEVER TAKEN
20088e8: b0 10 20 00 clr %i0
if(!(the_node->parent)) return NULL;
20088ec: c2 07 40 00 ld [ %i5 ], %g1
20088f0: 80 a0 60 00 cmp %g1, 0
20088f4: 32 80 00 03 bne,a 2008900 <_RBTree_Find_header+0x2c> <== ALWAYS TAKEN
20088f8: ba 10 00 01 mov %g1, %i5
20088fc: 30 80 00 06 b,a 2008914 <_RBTree_Find_header+0x40> <== NOT EXECUTED
while(the_node->parent) the_node = the_node->parent;
2008900: c2 07 40 00 ld [ %i5 ], %g1
2008904: 80 a0 60 00 cmp %g1, 0
2008908: 32 bf ff fe bne,a 2008900 <_RBTree_Find_header+0x2c>
200890c: ba 10 00 01 mov %g1, %i5
2008910: b0 10 00 1d mov %i5, %i0
return_header = _RBTree_Find_header_unprotected( the_node );
_ISR_Enable( level );
2008914: 7f ff e8 27 call 20029b0 <sparc_enable_interrupts>
2008918: 01 00 00 00 nop
return return_header;
}
200891c: 81 c7 e0 08 ret
2008920: 81 e8 00 00 restore
02008b0c <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
2008b0c: 9d e3 bf a0 save %sp, -96, %sp
2008b10: 82 10 00 18 mov %i0, %g1
2008b14: 90 10 00 19 mov %i1, %o0
if(!the_node) return (RBTree_Node*)-1;
2008b18: 80 a6 60 00 cmp %i1, 0
2008b1c: 02 80 00 0d be 2008b50 <_RBTree_Insert_unprotected+0x44> <== NEVER TAKEN
2008b20: b0 10 3f ff mov -1, %i0
RBTree_Node *iter_node = the_rbtree->root;
2008b24: f0 00 60 04 ld [ %g1 + 4 ], %i0
if (!iter_node) { /* special case: first node inserted */
2008b28: 80 a6 20 00 cmp %i0, 0
2008b2c: 32 80 00 1f bne,a 2008ba8 <_RBTree_Insert_unprotected+0x9c>
2008b30: c4 06 60 0c ld [ %i1 + 0xc ], %g2
the_node->color = RBT_BLACK;
2008b34: c0 26 60 10 clr [ %i1 + 0x10 ]
the_rbtree->root = the_node;
2008b38: f2 20 60 04 st %i1, [ %g1 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
2008b3c: f2 20 60 0c st %i1, [ %g1 + 0xc ]
2008b40: f2 20 60 08 st %i1, [ %g1 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
2008b44: c2 26 40 00 st %g1, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
2008b48: c0 26 60 08 clr [ %i1 + 8 ]
2008b4c: c0 26 60 04 clr [ %i1 + 4 ]
2008b50: 81 c7 e0 08 ret
2008b54: 81 e8 00 00 restore
} else {
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
2008b58: 86 40 20 00 addx %g0, 0, %g3
if (!iter_node->child[dir]) {
2008b5c: 89 28 e0 02 sll %g3, 2, %g4
2008b60: 88 06 00 04 add %i0, %g4, %g4
2008b64: de 01 20 04 ld [ %g4 + 4 ], %o7
2008b68: 80 a3 e0 00 cmp %o7, 0
2008b6c: 32 80 00 0f bne,a 2008ba8 <_RBTree_Insert_unprotected+0x9c>
2008b70: b0 10 00 0f mov %o7, %i0
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
2008b74: 84 10 20 01 mov 1, %g2
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
2008b78: c0 22 20 08 clr [ %o0 + 8 ]
2008b7c: c0 22 20 04 clr [ %o0 + 4 ]
the_node->color = RBT_RED;
2008b80: c4 22 20 10 st %g2, [ %o0 + 0x10 ]
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First(
RBTree_Control *the_rbtree,
RBTree_Direction dir
)
{
return the_rbtree->first[dir];
2008b84: 84 00 e0 02 add %g3, 2, %g2
2008b88: 85 28 a0 02 sll %g2, 2, %g2
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
2008b8c: c6 00 40 02 ld [ %g1 + %g2 ], %g3
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
2008b90: d0 21 20 04 st %o0, [ %g4 + 4 ]
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
2008b94: 80 a6 00 03 cmp %i0, %g3
2008b98: 12 80 00 0a bne 2008bc0 <_RBTree_Insert_unprotected+0xb4>
2008b9c: f0 22 00 00 st %i0, [ %o0 ]
the_rbtree->first[dir] = the_node;
2008ba0: 10 80 00 08 b 2008bc0 <_RBTree_Insert_unprotected+0xb4>
2008ba4: d0 20 40 02 st %o0, [ %g1 + %g2 ]
the_node->parent = (RBTree_Node *) the_rbtree;
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
} else {
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
2008ba8: c6 06 20 0c ld [ %i0 + 0xc ], %g3
2008bac: 80 a0 80 03 cmp %g2, %g3
2008bb0: 12 bf ff ea bne 2008b58 <_RBTree_Insert_unprotected+0x4c>
2008bb4: 80 a0 c0 02 cmp %g3, %g2
2008bb8: 81 c7 e0 08 ret
2008bbc: 81 e8 00 00 restore
}
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
2008bc0: 7f ff ff 9a call 2008a28 <_RBTree_Validate_insert_unprotected>
2008bc4: b0 10 20 00 clr %i0
}
return (RBTree_Node*)0;
}
2008bc8: 81 c7 e0 08 ret
2008bcc: 81 e8 00 00 restore
02008450 <_RBTree_Rotate>:
RBTree_Node *the_node,
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
2008450: 80 a2 20 00 cmp %o0, 0
2008454: 02 80 00 1c be 20084c4 <_RBTree_Rotate+0x74> <== NEVER TAKEN
2008458: 86 10 20 01 mov 1, %g3
if (the_node->child[(1-dir)] == NULL) return;
200845c: 86 20 c0 09 sub %g3, %o1, %g3
2008460: 87 28 e0 02 sll %g3, 2, %g3
2008464: 86 02 00 03 add %o0, %g3, %g3
2008468: c2 00 e0 04 ld [ %g3 + 4 ], %g1
200846c: 80 a0 60 00 cmp %g1, 0
2008470: 02 80 00 15 be 20084c4 <_RBTree_Rotate+0x74> <== NEVER TAKEN
2008474: 93 2a 60 02 sll %o1, 2, %o1
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008478: 84 00 40 09 add %g1, %o1, %g2
200847c: c8 00 a0 04 ld [ %g2 + 4 ], %g4
2008480: c8 20 e0 04 st %g4, [ %g3 + 4 ]
if (c->child[dir])
2008484: c4 00 a0 04 ld [ %g2 + 4 ], %g2
2008488: 80 a0 a0 00 cmp %g2, 0
200848c: 32 80 00 02 bne,a 2008494 <_RBTree_Rotate+0x44>
2008490: d0 20 80 00 st %o0, [ %g2 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008494: c4 02 00 00 ld [ %o0 ], %g2
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
2008498: 92 00 40 09 add %g1, %o1, %o1
200849c: d0 22 60 04 st %o0, [ %o1 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20084a0: c6 00 a0 04 ld [ %g2 + 4 ], %g3
c->parent = the_node->parent;
20084a4: c4 20 40 00 st %g2, [ %g1 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20084a8: 86 1a 00 03 xor %o0, %g3, %g3
c->parent = the_node->parent;
the_node->parent = c;
20084ac: c2 22 00 00 st %g1, [ %o0 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20084b0: 80 a0 00 03 cmp %g0, %g3
20084b4: 86 40 20 00 addx %g0, 0, %g3
20084b8: 87 28 e0 02 sll %g3, 2, %g3
20084bc: 86 00 80 03 add %g2, %g3, %g3
20084c0: c2 20 e0 04 st %g1, [ %g3 + 4 ]
20084c4: 81 c3 e0 08 retl
0200840c <_RBTree_Sibling>:
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
200840c: 80 a2 20 00 cmp %o0, 0
2008410: 02 80 00 0e be 2008448 <_RBTree_Sibling+0x3c> <== NEVER TAKEN
2008414: 82 10 20 00 clr %g1
if(!(the_node->parent)) return NULL;
2008418: c4 02 00 00 ld [ %o0 ], %g2
200841c: 80 a0 a0 00 cmp %g2, 0
2008420: 02 80 00 0a be 2008448 <_RBTree_Sibling+0x3c> <== NEVER TAKEN
2008424: 01 00 00 00 nop
if(!(the_node->parent->parent)) return NULL;
2008428: c6 00 80 00 ld [ %g2 ], %g3
200842c: 80 a0 e0 00 cmp %g3, 0
2008430: 02 80 00 06 be 2008448 <_RBTree_Sibling+0x3c>
2008434: 01 00 00 00 nop
if(the_node == the_node->parent->child[RBT_LEFT])
2008438: c2 00 a0 04 ld [ %g2 + 4 ], %g1
200843c: 80 a2 00 01 cmp %o0, %g1
2008440: 22 80 00 02 be,a 2008448 <_RBTree_Sibling+0x3c>
2008444: c2 00 a0 08 ld [ %g2 + 8 ], %g1
return the_node->parent->child[RBT_RIGHT];
else
return the_node->parent->child[RBT_LEFT];
}
2008448: 81 c3 e0 08 retl
200844c: 90 10 00 01 mov %g1, %o0
02008a28 <_RBTree_Validate_insert_unprotected>:
* append operation.
*/
void _RBTree_Validate_insert_unprotected(
RBTree_Node *the_node
)
{
2008a28: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *u,*g;
/* note: the insert root case is handled already */
/* if the parent is black, nothing needs to be done
* otherwise may need to loop a few times */
while (_RBTree_Is_red(_RBTree_Parent(the_node))) {
2008a2c: 10 80 00 1f b 2008aa8 <_RBTree_Validate_insert_unprotected+0x80>
2008a30: b6 10 20 01 mov 1, %i3
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(!(the_node->parent->parent->parent)) return NULL;
2008a34: 80 a0 60 00 cmp %g1, 0
2008a38: 02 80 00 27 be 2008ad4 <_RBTree_Validate_insert_unprotected+0xac><== NEVER TAKEN
2008a3c: c2 07 60 04 ld [ %i5 + 4 ], %g1
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(the_node == the_node->parent->child[RBT_LEFT])
2008a40: 80 a2 00 01 cmp %o0, %g1
2008a44: 22 80 00 02 be,a 2008a4c <_RBTree_Validate_insert_unprotected+0x24>
2008a48: c2 07 60 08 ld [ %i5 + 8 ], %g1
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008a4c: 80 a0 60 00 cmp %g1, 0
2008a50: 22 80 00 21 be,a 2008ad4 <_RBTree_Validate_insert_unprotected+0xac>
2008a54: c2 07 60 04 ld [ %i5 + 4 ], %g1
2008a58: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
2008a5c: 80 a0 a0 01 cmp %g2, 1
2008a60: 32 80 00 1d bne,a 2008ad4 <_RBTree_Validate_insert_unprotected+0xac>
2008a64: c2 07 60 04 ld [ %i5 + 4 ], %g1
u = _RBTree_Parent_sibling(the_node);
g = the_node->parent->parent;
/* if uncle is red, repaint uncle/parent black and grandparent red */
if(_RBTree_Is_red(u)) {
the_node->parent->color = RBT_BLACK;
2008a68: c0 22 20 10 clr [ %o0 + 0x10 ]
u->color = RBT_BLACK;
2008a6c: c0 20 60 10 clr [ %g1 + 0x10 ]
g->color = RBT_RED;
2008a70: c4 27 60 10 st %g2, [ %i5 + 0x10 ]
2008a74: 10 80 00 0d b 2008aa8 <_RBTree_Validate_insert_unprotected+0x80>
2008a78: b0 10 00 1d mov %i5, %i0
RBTree_Direction dir = the_node != the_node->parent->child[0];
RBTree_Direction pdir = the_node->parent != g->child[0];
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
_RBTree_Rotate(the_node->parent, pdir);
2008a7c: 7f ff ff cc call 20089ac <_RBTree_Rotate>
2008a80: 92 10 00 1c mov %i4, %o1
the_node = the_node->child[pdir];
2008a84: 83 2f 20 02 sll %i4, 2, %g1
2008a88: b0 06 00 01 add %i0, %g1, %i0
2008a8c: f0 06 20 04 ld [ %i0 + 4 ], %i0
}
the_node->parent->color = RBT_BLACK;
2008a90: c2 06 00 00 ld [ %i0 ], %g1
g->color = RBT_RED;
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
2008a94: 90 10 00 1d mov %i5, %o0
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
}
the_node->parent->color = RBT_BLACK;
2008a98: c0 20 60 10 clr [ %g1 + 0x10 ]
g->color = RBT_RED;
2008a9c: f6 27 60 10 st %i3, [ %i5 + 0x10 ]
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
2008aa0: 7f ff ff c3 call 20089ac <_RBTree_Rotate>
2008aa4: 92 26 c0 1c sub %i3, %i4, %o1
ISR_Level level;
_ISR_Disable( level );
_RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
2008aa8: d0 06 00 00 ld [ %i0 ], %o0
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
2008aac: fa 02 00 00 ld [ %o0 ], %i5
2008ab0: 80 a7 60 00 cmp %i5, 0
2008ab4: 22 80 00 14 be,a 2008b04 <_RBTree_Validate_insert_unprotected+0xdc>
2008ab8: c0 26 20 10 clr [ %i0 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008abc: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
2008ac0: 80 a0 60 01 cmp %g1, 1
2008ac4: 12 80 00 10 bne 2008b04 <_RBTree_Validate_insert_unprotected+0xdc>
2008ac8: 01 00 00 00 nop
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(!(the_node->parent->parent->parent)) return NULL;
2008acc: 10 bf ff da b 2008a34 <_RBTree_Validate_insert_unprotected+0xc>
2008ad0: c2 07 40 00 ld [ %i5 ], %g1
u->color = RBT_BLACK;
g->color = RBT_RED;
the_node = g;
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
RBTree_Direction pdir = the_node->parent != g->child[0];
2008ad4: 82 1a 00 01 xor %o0, %g1, %g1
2008ad8: 80 a0 00 01 cmp %g0, %g1
the_node->parent->color = RBT_BLACK;
u->color = RBT_BLACK;
g->color = RBT_RED;
the_node = g;
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
2008adc: c2 02 20 04 ld [ %o0 + 4 ], %g1
RBTree_Direction pdir = the_node->parent != g->child[0];
2008ae0: b8 40 20 00 addx %g0, 0, %i4
the_node->parent->color = RBT_BLACK;
u->color = RBT_BLACK;
g->color = RBT_RED;
the_node = g;
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
2008ae4: 82 1e 00 01 xor %i0, %g1, %g1
2008ae8: 80 a0 00 01 cmp %g0, %g1
2008aec: 82 40 20 00 addx %g0, 0, %g1
RBTree_Direction pdir = the_node->parent != g->child[0];
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
2008af0: 80 a0 40 1c cmp %g1, %i4
2008af4: 12 bf ff e2 bne 2008a7c <_RBTree_Validate_insert_unprotected+0x54>
2008af8: 01 00 00 00 nop
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
}
the_node->parent->color = RBT_BLACK;
2008afc: 10 bf ff e6 b 2008a94 <_RBTree_Validate_insert_unprotected+0x6c>
2008b00: c2 06 00 00 ld [ %i0 ], %g1
2008b04: 81 c7 e0 08 ret
2008b08: 81 e8 00 00 restore
0200b97c <_RTEMS_tasks_Post_switch_extension>:
*/
void _RTEMS_tasks_Post_switch_extension(
Thread_Control *executing
)
{
200b97c: 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 ];
200b980: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
if ( !api )
200b984: 80 a7 60 00 cmp %i5, 0
200b988: 02 80 00 1c be 200b9f8 <_RTEMS_tasks_Post_switch_extension+0x7c><== NEVER TAKEN
200b98c: 01 00 00 00 nop
* Signal Processing
*/
asr = &api->Signal;
_ISR_Disable( level );
200b990: 7f ff d9 df call 200210c <sparc_disable_interrupts>
200b994: 01 00 00 00 nop
signal_set = asr->signals_posted;
200b998: f6 07 60 14 ld [ %i5 + 0x14 ], %i3
asr->signals_posted = 0;
200b99c: c0 27 60 14 clr [ %i5 + 0x14 ]
_ISR_Enable( level );
200b9a0: 7f ff d9 df call 200211c <sparc_enable_interrupts>
200b9a4: 01 00 00 00 nop
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
200b9a8: 80 a6 e0 00 cmp %i3, 0
200b9ac: 02 80 00 13 be 200b9f8 <_RTEMS_tasks_Post_switch_extension+0x7c>
200b9b0: 94 07 bf fc add %fp, -4, %o2
return;
asr->nest_level += 1;
200b9b4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200b9b8: d0 07 60 10 ld [ %i5 + 0x10 ], %o0
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
200b9bc: 82 00 60 01 inc %g1
200b9c0: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200b9c4: 39 00 00 3f sethi %hi(0xfc00), %i4
200b9c8: 40 00 07 32 call 200d690 <rtems_task_mode>
200b9cc: 92 17 23 ff or %i4, 0x3ff, %o1 ! ffff <PROM_START+0xffff>
(*asr->handler)( signal_set );
200b9d0: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200b9d4: 9f c0 40 00 call %g1
200b9d8: 90 10 00 1b mov %i3, %o0
asr->nest_level -= 1;
200b9dc: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200b9e0: 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;
200b9e4: 82 00 7f ff add %g1, -1, %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200b9e8: 92 17 23 ff or %i4, 0x3ff, %o1
asr->nest_level += 1;
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
(*asr->handler)( signal_set );
asr->nest_level -= 1;
200b9ec: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200b9f0: 40 00 07 28 call 200d690 <rtems_task_mode>
200b9f4: 94 07 bf fc add %fp, -4, %o2
200b9f8: 81 c7 e0 08 ret
200b9fc: 81 e8 00 00 restore
02007624 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2007624: 9d e3 bf 98 save %sp, -104, %sp
2007628: 11 00 80 74 sethi %hi(0x201d000), %o0
200762c: 92 10 00 18 mov %i0, %o1
2007630: 90 12 20 b4 or %o0, 0xb4, %o0
2007634: 40 00 07 b7 call 2009510 <_Objects_Get>
2007638: 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 ) {
200763c: c2 07 bf fc ld [ %fp + -4 ], %g1
2007640: 80 a0 60 00 cmp %g1, 0
2007644: 12 80 00 25 bne 20076d8 <_Rate_monotonic_Timeout+0xb4> <== NEVER TAKEN
2007648: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
200764c: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
2007650: 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);
2007654: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
2007658: 80 88 80 01 btst %g2, %g1
200765c: 22 80 00 0b be,a 2007688 <_Rate_monotonic_Timeout+0x64>
2007660: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007664: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
2007668: c2 07 60 08 ld [ %i5 + 8 ], %g1
200766c: 80 a0 80 01 cmp %g2, %g1
2007670: 32 80 00 06 bne,a 2007688 <_Rate_monotonic_Timeout+0x64>
2007674: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007678: 13 04 00 ff sethi %hi(0x1003fc00), %o1
200767c: 40 00 0a 46 call 2009f94 <_Thread_Clear_state>
2007680: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 <RAM_END+0xdc3fff8>
2007684: 30 80 00 06 b,a 200769c <_Rate_monotonic_Timeout+0x78>
_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 ) {
2007688: 80 a0 60 01 cmp %g1, 1
200768c: 12 80 00 0d bne 20076c0 <_Rate_monotonic_Timeout+0x9c>
2007690: 82 10 20 04 mov 4, %g1
the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING;
2007694: 82 10 20 03 mov 3, %g1
2007698: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
200769c: 7f ff fe 70 call 200705c <_Rate_monotonic_Initiate_statistics>
20076a0: 90 10 00 1d mov %i5, %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
20076a4: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076a8: 11 00 80 74 sethi %hi(0x201d000), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
20076ac: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076b0: 90 12 22 e4 or %o0, 0x2e4, %o0
20076b4: 40 00 0e f7 call 200b290 <_Watchdog_Insert>
20076b8: 92 07 60 10 add %i5, 0x10, %o1
20076bc: 30 80 00 02 b,a 20076c4 <_Rate_monotonic_Timeout+0xa0>
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else
the_period->state = RATE_MONOTONIC_EXPIRED;
20076c0: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
/**
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
20076c4: 03 00 80 74 sethi %hi(0x201d000), %g1
20076c8: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 201d220 <_Thread_Dispatch_disable_level>
20076cc: 84 00 bf ff add %g2, -1, %g2
20076d0: c4 20 62 20 st %g2, [ %g1 + 0x220 ]
return _Thread_Dispatch_disable_level;
20076d4: c2 00 62 20 ld [ %g1 + 0x220 ], %g1
20076d8: 81 c7 e0 08 ret
20076dc: 81 e8 00 00 restore
02008548 <_Scheduler_priority_Yield>:
* ready chain
* select heir
*/
void _Scheduler_priority_Yield(void)
{
2008548: 9d e3 bf a0 save %sp, -96, %sp
Scheduler_priority_Per_thread *sched_info;
ISR_Level level;
Thread_Control *executing;
Chain_Control *ready;
executing = _Thread_Executing;
200854c: 37 00 80 6d sethi %hi(0x201b400), %i3
2008550: b6 16 e1 cc or %i3, 0x1cc, %i3 ! 201b5cc <_Per_CPU_Information>
2008554: fa 06 e0 0c ld [ %i3 + 0xc ], %i5
sched_info = (Scheduler_priority_Per_thread *) executing->scheduler_info;
ready = sched_info->ready_chain;
2008558: c2 07 60 8c ld [ %i5 + 0x8c ], %g1
_ISR_Disable( level );
200855c: 7f ff e6 ec call 200210c <sparc_disable_interrupts>
2008560: f8 00 40 00 ld [ %g1 ], %i4
2008564: b0 10 00 08 mov %o0, %i0
if ( !_Chain_Has_only_one_node( ready ) ) {
2008568: c4 07 00 00 ld [ %i4 ], %g2
200856c: c2 07 20 08 ld [ %i4 + 8 ], %g1
2008570: 80 a0 80 01 cmp %g2, %g1
2008574: 22 80 00 1b be,a 20085e0 <_Scheduler_priority_Yield+0x98>
2008578: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
200857c: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
2008580: c2 07 60 04 ld [ %i5 + 4 ], %g1
next->previous = previous;
2008584: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
2008588: c4 20 40 00 st %g2, [ %g1 ]
Chain_Control *the_chain,
Chain_Node *the_node
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
200858c: c2 07 20 08 ld [ %i4 + 8 ], %g1
RTEMS_INLINE_ROUTINE void _Chain_Append_unprotected(
Chain_Control *the_chain,
Chain_Node *the_node
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
2008590: 84 07 20 04 add %i4, 4, %g2
Chain_Node *old_last = tail->previous;
the_node->next = tail;
tail->previous = the_node;
2008594: fa 27 20 08 st %i5, [ %i4 + 8 ]
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
the_node->next = tail;
2008598: c4 27 40 00 st %g2, [ %i5 ]
tail->previous = the_node;
old_last->next = the_node;
200859c: fa 20 40 00 st %i5, [ %g1 ]
the_node->previous = old_last;
20085a0: c2 27 60 04 st %g1, [ %i5 + 4 ]
_Chain_Extract_unprotected( &executing->Object.Node );
_Chain_Append_unprotected( ready, &executing->Object.Node );
_ISR_Flash( level );
20085a4: 7f ff e6 de call 200211c <sparc_enable_interrupts>
20085a8: 01 00 00 00 nop
20085ac: 7f ff e6 d8 call 200210c <sparc_disable_interrupts>
20085b0: 01 00 00 00 nop
20085b4: b0 10 00 08 mov %o0, %i0
if ( _Thread_Is_heir( executing ) )
20085b8: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1
20085bc: 80 a7 40 01 cmp %i5, %g1
20085c0: 12 80 00 04 bne 20085d0 <_Scheduler_priority_Yield+0x88> <== NEVER TAKEN
20085c4: 84 10 20 01 mov 1, %g2
_Thread_Heir = (Thread_Control *) _Chain_First( ready );
20085c8: c2 07 00 00 ld [ %i4 ], %g1
20085cc: c2 26 e0 10 st %g1, [ %i3 + 0x10 ]
_Thread_Dispatch_necessary = true;
20085d0: 03 00 80 6d sethi %hi(0x201b400), %g1
20085d4: 82 10 61 cc or %g1, 0x1cc, %g1 ! 201b5cc <_Per_CPU_Information>
20085d8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
20085dc: 30 80 00 05 b,a 20085f0 <_Scheduler_priority_Yield+0xa8>
}
else if ( !_Thread_Is_heir( executing ) )
20085e0: 80 a7 40 01 cmp %i5, %g1
20085e4: 02 80 00 03 be 20085f0 <_Scheduler_priority_Yield+0xa8> <== ALWAYS TAKEN
20085e8: 82 10 20 01 mov 1, %g1
_Thread_Dispatch_necessary = true;
20085ec: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] <== NOT EXECUTED
_ISR_Enable( level );
20085f0: 7f ff e6 cb call 200211c <sparc_enable_interrupts>
20085f4: 81 e8 00 00 restore
020070a8 <_TOD_Validate>:
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
20070a8: 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();
20070ac: 03 00 80 73 sethi %hi(0x201cc00), %g1
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
return false;
20070b0: ba 10 20 00 clr %i5
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
20070b4: 80 a6 20 00 cmp %i0, 0
20070b8: 02 80 00 2b be 2007164 <_TOD_Validate+0xbc> <== NEVER TAKEN
20070bc: d2 00 62 18 ld [ %g1 + 0x218 ], %o1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
20070c0: 11 00 03 d0 sethi %hi(0xf4000), %o0
20070c4: 40 00 46 6f call 2018a80 <.udiv>
20070c8: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
20070cc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
20070d0: 80 a0 40 08 cmp %g1, %o0
20070d4: 3a 80 00 25 bcc,a 2007168 <_TOD_Validate+0xc0>
20070d8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
20070dc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
20070e0: 80 a0 60 3b cmp %g1, 0x3b
20070e4: 38 80 00 21 bgu,a 2007168 <_TOD_Validate+0xc0>
20070e8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
20070ec: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
20070f0: 80 a0 60 3b cmp %g1, 0x3b
20070f4: 38 80 00 1d bgu,a 2007168 <_TOD_Validate+0xc0>
20070f8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
20070fc: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2007100: 80 a0 60 17 cmp %g1, 0x17
2007104: 38 80 00 19 bgu,a 2007168 <_TOD_Validate+0xc0>
2007108: b0 0f 60 01 and %i5, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
200710c: c2 06 20 04 ld [ %i0 + 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) ||
2007110: 80 a0 60 00 cmp %g1, 0
2007114: 02 80 00 14 be 2007164 <_TOD_Validate+0xbc> <== NEVER TAKEN
2007118: 80 a0 60 0c cmp %g1, 0xc
(the_tod->month == 0) ||
200711c: 38 80 00 13 bgu,a 2007168 <_TOD_Validate+0xc0>
2007120: b0 0f 60 01 and %i5, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2007124: c6 06 00 00 ld [ %i0 ], %g3
(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) ||
2007128: 80 a0 e7 c3 cmp %g3, 0x7c3
200712c: 28 80 00 0f bleu,a 2007168 <_TOD_Validate+0xc0>
2007130: b0 0f 60 01 and %i5, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2007134: c4 06 20 08 ld [ %i0 + 8 ], %g2
(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) ||
2007138: 80 a0 a0 00 cmp %g2, 0
200713c: 02 80 00 0a be 2007164 <_TOD_Validate+0xbc> <== NEVER TAKEN
2007140: 80 88 e0 03 btst 3, %g3
2007144: 07 00 80 6e sethi %hi(0x201b800), %g3
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
2007148: 12 80 00 03 bne 2007154 <_TOD_Validate+0xac>
200714c: 86 10 e3 30 or %g3, 0x330, %g3 ! 201bb30 <_TOD_Days_per_month>
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
2007150: 82 00 60 0d add %g1, 0xd, %g1
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
2007154: 83 28 60 02 sll %g1, 2, %g1
2007158: c2 00 c0 01 ld [ %g3 + %g1 ], %g1
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
200715c: 80 a0 40 02 cmp %g1, %g2
2007160: ba 60 3f ff subx %g0, -1, %i5
if ( the_tod->day > days_in_month )
return false;
return true;
}
2007164: b0 0f 60 01 and %i5, 1, %i0
2007168: 81 c7 e0 08 ret
200716c: 81 e8 00 00 restore
02008648 <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
2008648: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
200864c: f8 06 20 10 ld [ %i0 + 0x10 ], %i4
/*
* 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 );
2008650: 40 00 03 54 call 20093a0 <_Thread_Set_transient>
2008654: 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 )
2008658: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200865c: 80 a0 40 19 cmp %g1, %i1
2008660: 02 80 00 05 be 2008674 <_Thread_Change_priority+0x2c>
2008664: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
2008668: 90 10 00 18 mov %i0, %o0
200866c: 40 00 03 34 call 200933c <_Thread_Set_priority>
2008670: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
2008674: 7f ff e6 a6 call 200210c <sparc_disable_interrupts>
2008678: 01 00 00 00 nop
200867c: b6 10 00 08 mov %o0, %i3
/*
* 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;
2008680: f2 07 60 10 ld [ %i5 + 0x10 ], %i1
if ( state != STATES_TRANSIENT ) {
2008684: 80 a6 60 04 cmp %i1, 4
2008688: 02 80 00 10 be 20086c8 <_Thread_Change_priority+0x80>
200868c: b8 0f 20 04 and %i4, 4, %i4
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
2008690: 80 a7 20 00 cmp %i4, 0
2008694: 12 80 00 03 bne 20086a0 <_Thread_Change_priority+0x58> <== NEVER TAKEN
2008698: 82 0e 7f fb and %i1, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
200869c: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
20086a0: 7f ff e6 9f call 200211c <sparc_enable_interrupts>
20086a4: 90 10 00 1b mov %i3, %o0
if ( _States_Is_waiting_on_thread_queue( state ) ) {
20086a8: 03 00 00 ef sethi %hi(0x3bc00), %g1
20086ac: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
20086b0: 80 8e 40 01 btst %i1, %g1
20086b4: 02 80 00 29 be 2008758 <_Thread_Change_priority+0x110>
20086b8: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
20086bc: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
20086c0: 40 00 02 f1 call 2009284 <_Thread_queue_Requeue>
20086c4: 93 e8 00 1d restore %g0, %i5, %o1
}
return;
}
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) ) {
20086c8: 80 a7 20 00 cmp %i4, 0
20086cc: 12 80 00 0b bne 20086f8 <_Thread_Change_priority+0xb0> <== NEVER TAKEN
20086d0: 03 00 80 69 sethi %hi(0x201a400), %g1
* 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 );
20086d4: c0 27 60 10 clr [ %i5 + 0x10 ]
if ( prepend_it )
20086d8: 80 a6 a0 00 cmp %i2, 0
20086dc: 02 80 00 04 be 20086ec <_Thread_Change_priority+0xa4>
20086e0: 82 10 63 a4 or %g1, 0x3a4, %g1
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
20086e4: 10 80 00 03 b 20086f0 <_Thread_Change_priority+0xa8>
20086e8: c2 00 60 28 ld [ %g1 + 0x28 ], %g1
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
20086ec: c2 00 60 24 ld [ %g1 + 0x24 ], %g1
20086f0: 9f c0 40 00 call %g1
20086f4: 90 10 00 1d mov %i5, %o0
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
20086f8: 7f ff e6 89 call 200211c <sparc_enable_interrupts>
20086fc: 90 10 00 1b mov %i3, %o0
2008700: 7f ff e6 83 call 200210c <sparc_disable_interrupts>
2008704: 01 00 00 00 nop
2008708: b0 10 00 08 mov %o0, %i0
* This kernel routine implements the scheduling decision logic for
* the scheduler. It does NOT dispatch.
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( void )
{
_Scheduler.Operations.schedule();
200870c: 03 00 80 69 sethi %hi(0x201a400), %g1
2008710: c2 00 63 ac ld [ %g1 + 0x3ac ], %g1 ! 201a7ac <_Scheduler+0x8>
2008714: 9f c0 40 00 call %g1
2008718: 01 00 00 00 nop
* is also the heir thread, and false otherwise.
*/
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing_also_the_heir( void )
{
return ( _Thread_Executing == _Thread_Heir );
200871c: 03 00 80 6d sethi %hi(0x201b400), %g1
2008720: 82 10 61 cc or %g1, 0x1cc, %g1 ! 201b5cc <_Per_CPU_Information>
2008724: c4 00 60 0c ld [ %g1 + 0xc ], %g2
* We altered the set of thread priorities. So let's figure out
* who is the heir and if we need to switch to them.
*/
_Scheduler_Schedule();
if ( !_Thread_Is_executing_also_the_heir() &&
2008728: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200872c: 80 a0 80 03 cmp %g2, %g3
2008730: 02 80 00 08 be 2008750 <_Thread_Change_priority+0x108>
2008734: 01 00 00 00 nop
2008738: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200873c: 80 a0 a0 00 cmp %g2, 0
2008740: 02 80 00 04 be 2008750 <_Thread_Change_priority+0x108>
2008744: 01 00 00 00 nop
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
2008748: 84 10 20 01 mov 1, %g2 ! 1 <PROM_START+0x1>
200874c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
_ISR_Enable( level );
2008750: 7f ff e6 73 call 200211c <sparc_enable_interrupts>
2008754: 81 e8 00 00 restore
2008758: 81 c7 e0 08 ret
200875c: 81 e8 00 00 restore
0200894c <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
200894c: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2008950: 90 10 00 18 mov %i0, %o0
2008954: 40 00 00 6c call 2008b04 <_Thread_Get>
2008958: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200895c: c2 07 bf fc ld [ %fp + -4 ], %g1
2008960: 80 a0 60 00 cmp %g1, 0
2008964: 12 80 00 09 bne 2008988 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN
2008968: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
200896c: 7f ff ff 7d call 2008760 <_Thread_Clear_state>
2008970: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_END+0xdc00018>
/**
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2008974: 03 00 80 6c sethi %hi(0x201b000), %g1
2008978: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 201b3a0 <_Thread_Dispatch_disable_level>
200897c: 84 00 bf ff add %g2, -1, %g2
2008980: c4 20 63 a0 st %g2, [ %g1 + 0x3a0 ]
return _Thread_Dispatch_disable_level;
2008984: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1
2008988: 81 c7 e0 08 ret
200898c: 81 e8 00 00 restore
02008990 <_Thread_Dispatch>:
* dispatch thread
* no dispatch thread
*/
void _Thread_Dispatch( void )
{
2008990: 9d e3 bf 90 save %sp, -112, %sp
Thread_Control *executing;
Thread_Control *heir;
ISR_Level level;
executing = _Thread_Executing;
2008994: 33 00 80 6d sethi %hi(0x201b400), %i1
2008998: 82 16 61 cc or %i1, 0x1cc, %g1 ! 201b5cc <_Per_CPU_Information>
_ISR_Disable( level );
200899c: 7f ff e5 dc call 200210c <sparc_disable_interrupts>
20089a0: fa 00 60 0c ld [ %g1 + 0xc ], %i5
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
20089a4: 37 00 80 6d sethi %hi(0x201b400), %i3
* This routine sets thread dispatch level to the
* value passed in.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value)
{
_Thread_Dispatch_disable_level = value;
20089a8: 23 00 80 6c sethi %hi(0x201b000), %l1
#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;
20089ac: 21 00 80 6c sethi %hi(0x201b000), %l0
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
20089b0: b6 16 e0 50 or %i3, 0x50, %i3
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
20089b4: 31 00 80 6d sethi %hi(0x201b400), %i0
Thread_Control *heir;
ISR_Level level;
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
20089b8: 10 80 00 3a b 2008aa0 <_Thread_Dispatch+0x110>
20089bc: 35 00 80 6d sethi %hi(0x201b400), %i2
20089c0: 84 10 20 01 mov 1, %g2
20089c4: c4 24 63 a0 st %g2, [ %l1 + 0x3a0 ]
heir = _Thread_Heir;
_Thread_Dispatch_set_disable_level( 1 );
_Thread_Dispatch_necessary = false;
20089c8: c0 28 60 18 clrb [ %g1 + 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 )
20089cc: 80 a7 00 1d cmp %i4, %i5
20089d0: 02 80 00 39 be 2008ab4 <_Thread_Dispatch+0x124>
20089d4: f8 20 60 0c st %i4, [ %g1 + 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 )
20089d8: c2 07 20 7c ld [ %i4 + 0x7c ], %g1
20089dc: 80 a0 60 01 cmp %g1, 1
20089e0: 12 80 00 03 bne 20089ec <_Thread_Dispatch+0x5c>
20089e4: c2 04 23 04 ld [ %l0 + 0x304 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
20089e8: c2 27 20 78 st %g1, [ %i4 + 0x78 ]
_ISR_Enable( level );
20089ec: 7f ff e5 cc call 200211c <sparc_enable_interrupts>
20089f0: 01 00 00 00 nop
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
20089f4: 40 00 0c db call 200bd60 <_TOD_Get_uptime>
20089f8: 90 07 bf f0 add %fp, -16, %o0
_Timestamp_Subtract(
20089fc: 90 10 00 1b mov %i3, %o0
2008a00: 92 07 bf f0 add %fp, -16, %o1
2008a04: 40 00 02 f7 call 20095e0 <_Timespec_Subtract>
2008a08: 94 07 bf f8 add %fp, -8, %o2
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
2008a0c: 90 07 60 84 add %i5, 0x84, %o0
2008a10: 40 00 02 db call 200957c <_Timespec_Add_to>
2008a14: 92 07 bf f8 add %fp, -8, %o1
_Thread_Time_of_last_context_switch = uptime;
2008a18: c2 07 bf f0 ld [ %fp + -16 ], %g1
2008a1c: c2 26 c0 00 st %g1, [ %i3 ]
2008a20: c2 07 bf f4 ld [ %fp + -12 ], %g1
2008a24: c2 26 e0 04 st %g1, [ %i3 + 4 ]
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
2008a28: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
2008a2c: 80 a0 60 00 cmp %g1, 0
2008a30: 02 80 00 06 be 2008a48 <_Thread_Dispatch+0xb8> <== NEVER TAKEN
2008a34: 90 10 00 1d mov %i5, %o0
executing->libc_reent = *_Thread_libc_reent;
2008a38: c4 00 40 00 ld [ %g1 ], %g2
2008a3c: c4 27 61 54 st %g2, [ %i5 + 0x154 ]
*_Thread_libc_reent = heir->libc_reent;
2008a40: c4 07 21 54 ld [ %i4 + 0x154 ], %g2
2008a44: c4 20 40 00 st %g2, [ %g1 ]
}
_User_extensions_Thread_switch( executing, heir );
2008a48: 40 00 03 94 call 2009898 <_User_extensions_Thread_switch>
2008a4c: 92 10 00 1c mov %i4, %o1
if ( executing->fp_context != NULL )
_Context_Save_fp( &executing->fp_context );
#endif
#endif
_Context_Switch( &executing->Registers, &heir->Registers );
2008a50: 90 07 60 c8 add %i5, 0xc8, %o0
2008a54: 40 00 04 ba call 2009d3c <_CPU_Context_switch>
2008a58: 92 07 20 c8 add %i4, 0xc8, %o1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
2008a5c: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
2008a60: 80 a0 60 00 cmp %g1, 0
2008a64: 02 80 00 0c be 2008a94 <_Thread_Dispatch+0x104>
2008a68: d0 06 a0 24 ld [ %i2 + 0x24 ], %o0
2008a6c: 80 a7 40 08 cmp %i5, %o0
2008a70: 02 80 00 09 be 2008a94 <_Thread_Dispatch+0x104>
2008a74: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
2008a78: 02 80 00 04 be 2008a88 <_Thread_Dispatch+0xf8>
2008a7c: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
2008a80: 40 00 04 75 call 2009c54 <_CPU_Context_save_fp>
2008a84: 90 02 21 50 add %o0, 0x150, %o0
_Context_Restore_fp( &executing->fp_context );
2008a88: 40 00 04 90 call 2009cc8 <_CPU_Context_restore_fp>
2008a8c: 90 07 61 50 add %i5, 0x150, %o0
_Thread_Allocated_fp = executing;
2008a90: fa 26 a0 24 st %i5, [ %i2 + 0x24 ]
if ( executing->fp_context != NULL )
_Context_Restore_fp( &executing->fp_context );
#endif
#endif
executing = _Thread_Executing;
2008a94: 82 16 61 cc or %i1, 0x1cc, %g1
_ISR_Disable( level );
2008a98: 7f ff e5 9d call 200210c <sparc_disable_interrupts>
2008a9c: fa 00 60 0c ld [ %g1 + 0xc ], %i5
Thread_Control *heir;
ISR_Level level;
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
2008aa0: 82 16 61 cc or %i1, 0x1cc, %g1
2008aa4: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2
2008aa8: 80 a0 a0 00 cmp %g2, 0
2008aac: 32 bf ff c5 bne,a 20089c0 <_Thread_Dispatch+0x30>
2008ab0: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
2008ab4: 03 00 80 6c sethi %hi(0x201b000), %g1
2008ab8: c0 20 63 a0 clr [ %g1 + 0x3a0 ] ! 201b3a0 <_Thread_Dispatch_disable_level>
}
post_switch:
_Thread_Dispatch_set_disable_level( 0 );
_ISR_Enable( level );
2008abc: 7f ff e5 98 call 200211c <sparc_enable_interrupts>
2008ac0: 01 00 00 00 nop
_API_extensions_Run_postswitch();
2008ac4: 7f ff f8 7c call 2006cb4 <_API_extensions_Run_postswitch>
2008ac8: 01 00 00 00 nop
}
2008acc: 81 c7 e0 08 ret
2008ad0: 81 e8 00 00 restore
0200d9c0 <_Thread_Handler>:
*
* Output parameters: NONE
*/
void _Thread_Handler( void )
{
200d9c0: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static char doneConstructors;
char doneCons;
#endif
executing = _Thread_Executing;
200d9c4: 03 00 80 6d sethi %hi(0x201b400), %g1
200d9c8: fa 00 61 d8 ld [ %g1 + 0x1d8 ], %i5 ! 201b5d8 <_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();
200d9cc: 3f 00 80 36 sethi %hi(0x200d800), %i7
200d9d0: be 17 e1 c0 or %i7, 0x1c0, %i7 ! 200d9c0 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
200d9d4: d0 07 60 ac ld [ %i5 + 0xac ], %o0
_ISR_Set_level(level);
200d9d8: 7f ff d1 d1 call 200211c <sparc_enable_interrupts>
200d9dc: 91 2a 20 08 sll %o0, 8, %o0
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200d9e0: 03 00 80 6c sethi %hi(0x201b000), %g1
doneConstructors = 1;
200d9e4: 84 10 20 01 mov 1, %g2
level = executing->Start.isr_level;
_ISR_Set_level(level);
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200d9e8: f8 08 60 60 ldub [ %g1 + 0x60 ], %i4
doneConstructors = 1;
200d9ec: c4 28 60 60 stb %g2, [ %g1 + 0x60 ]
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200d9f0: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
200d9f4: 80 a0 60 00 cmp %g1, 0
200d9f8: 02 80 00 0c be 200da28 <_Thread_Handler+0x68>
200d9fc: 03 00 80 6d sethi %hi(0x201b400), %g1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Allocated_fp );
200da00: d0 00 60 24 ld [ %g1 + 0x24 ], %o0 ! 201b424 <_Thread_Allocated_fp>
200da04: 80 a7 40 08 cmp %i5, %o0
200da08: 02 80 00 08 be 200da28 <_Thread_Handler+0x68>
200da0c: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200da10: 22 80 00 06 be,a 200da28 <_Thread_Handler+0x68>
200da14: fa 20 60 24 st %i5, [ %g1 + 0x24 ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200da18: 7f ff f0 8f call 2009c54 <_CPU_Context_save_fp>
200da1c: 90 02 21 50 add %o0, 0x150, %o0
_Thread_Allocated_fp = executing;
200da20: 03 00 80 6d sethi %hi(0x201b400), %g1
200da24: fa 20 60 24 st %i5, [ %g1 + 0x24 ] ! 201b424 <_Thread_Allocated_fp>
/*
* 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 );
200da28: 7f ff ef 2d call 20096dc <_User_extensions_Thread_begin>
200da2c: 90 10 00 1d mov %i5, %o0
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
200da30: 7f ff ec 29 call 2008ad4 <_Thread_Enable_dispatch>
200da34: b9 2f 20 18 sll %i4, 0x18, %i4
/*
* _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) */ {
200da38: 80 a7 20 00 cmp %i4, 0
200da3c: 32 80 00 05 bne,a 200da50 <_Thread_Handler+0x90>
200da40: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
INIT_NAME ();
200da44: 40 00 33 0d call 201a678 <_init>
200da48: 01 00 00 00 nop
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200da4c: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
200da50: 80 a0 60 00 cmp %g1, 0
200da54: 12 80 00 06 bne 200da6c <_Thread_Handler+0xac> <== NEVER TAKEN
200da58: 01 00 00 00 nop
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
200da5c: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
200da60: 9f c0 40 00 call %g1
200da64: d0 07 60 9c ld [ %i5 + 0x9c ], %o0
INIT_NAME ();
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
200da68: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
* 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 );
200da6c: 7f ff ef 2d call 2009720 <_User_extensions_Thread_exitted>
200da70: 90 10 00 1d mov %i5, %o0
_Internal_error_Occurred(
200da74: 90 10 20 00 clr %o0
200da78: 92 10 20 01 mov 1, %o1
200da7c: 7f ff e7 31 call 2007740 <_Internal_error_Occurred>
200da80: 94 10 20 05 mov 5, %o2
02008bb4 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
2008bb4: 9d e3 bf a0 save %sp, -96, %sp
2008bb8: c2 07 a0 6c ld [ %fp + 0x6c ], %g1
2008bbc: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2
2008bc0: e0 00 40 00 ld [ %g1 ], %l0
/*
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
2008bc4: c0 26 61 58 clr [ %i1 + 0x158 ]
2008bc8: c0 26 61 5c clr [ %i1 + 0x15c ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
2008bcc: c0 26 61 54 clr [ %i1 + 0x154 ]
/*
* 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 );
2008bd0: 90 10 00 19 mov %i1, %o0
2008bd4: 40 00 02 02 call 20093dc <_Thread_Stack_Allocate>
2008bd8: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
2008bdc: 80 a2 00 1b cmp %o0, %i3
2008be0: 0a 80 00 61 bcs 2008d64 <_Thread_Initialize+0x1b0>
2008be4: 80 a2 20 00 cmp %o0, 0
2008be8: 02 80 00 5f be 2008d64 <_Thread_Initialize+0x1b0> <== NEVER TAKEN
2008bec: 80 a7 20 00 cmp %i4, 0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
2008bf0: c2 06 60 c0 ld [ %i1 + 0xc0 ], %g1
the_stack->size = size;
2008bf4: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ]
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
2008bf8: c2 26 60 b8 st %g1, [ %i1 + 0xb8 ]
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
2008bfc: 02 80 00 07 be 2008c18 <_Thread_Initialize+0x64>
2008c00: b6 10 20 00 clr %i3
fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE );
2008c04: 40 00 03 f8 call 2009be4 <_Workspace_Allocate>
2008c08: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
2008c0c: b6 92 20 00 orcc %o0, 0, %i3
2008c10: 02 80 00 46 be 2008d28 <_Thread_Initialize+0x174>
2008c14: b8 10 20 00 clr %i4
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2008c18: 03 00 80 6d sethi %hi(0x201b400), %g1
2008c1c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 ! 201b434 <_Thread_Maximum_extensions>
fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE );
if ( !fp_area )
goto failed;
fp_area = _Context_Fp_start( fp_area, 0 );
}
the_thread->fp_context = fp_area;
2008c20: f6 26 61 50 st %i3, [ %i1 + 0x150 ]
the_thread->Start.fp_context = fp_area;
2008c24: f6 26 60 bc st %i3, [ %i1 + 0xbc ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2008c28: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
2008c2c: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
2008c30: c0 26 60 68 clr [ %i1 + 0x68 ]
the_watchdog->user_data = user_data;
2008c34: c0 26 60 6c clr [ %i1 + 0x6c ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2008c38: 80 a2 20 00 cmp %o0, 0
2008c3c: 02 80 00 08 be 2008c5c <_Thread_Initialize+0xa8>
2008c40: b8 10 20 00 clr %i4
extensions_area = _Workspace_Allocate(
2008c44: 90 02 20 01 inc %o0
2008c48: 40 00 03 e7 call 2009be4 <_Workspace_Allocate>
2008c4c: 91 2a 20 02 sll %o0, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
2008c50: b8 92 20 00 orcc %o0, 0, %i4
2008c54: 22 80 00 36 be,a 2008d2c <_Thread_Initialize+0x178>
2008c58: b4 10 20 00 clr %i2
* if they are linked to the thread. An extension user may
* create the extension long after tasks have been created
* so they cannot rely on the thread create user extension
* call.
*/
if ( the_thread->extensions ) {
2008c5c: 80 a7 20 00 cmp %i4, 0
2008c60: 02 80 00 0c be 2008c90 <_Thread_Initialize+0xdc>
2008c64: f8 26 61 60 st %i4, [ %i1 + 0x160 ]
for ( i = 0; i <= _Thread_Maximum_extensions ; i++ )
2008c68: 03 00 80 6d sethi %hi(0x201b400), %g1
2008c6c: c4 00 60 34 ld [ %g1 + 0x34 ], %g2 ! 201b434 <_Thread_Maximum_extensions>
2008c70: 10 80 00 05 b 2008c84 <_Thread_Initialize+0xd0>
2008c74: 82 10 20 00 clr %g1
the_thread->extensions[i] = NULL;
2008c78: 87 28 60 02 sll %g1, 2, %g3
* 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++ )
2008c7c: 82 00 60 01 inc %g1
the_thread->extensions[i] = NULL;
2008c80: c0 21 00 03 clr [ %g4 + %g3 ]
* 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++ )
2008c84: 80 a0 40 02 cmp %g1, %g2
2008c88: 28 bf ff fc bleu,a 2008c78 <_Thread_Initialize+0xc4>
2008c8c: c8 06 61 60 ld [ %i1 + 0x160 ], %g4
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
2008c90: c2 07 a0 60 ld [ %fp + 0x60 ], %g1
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
2008c94: f4 2e 60 a0 stb %i2, [ %i1 + 0xa0 ]
the_thread->Start.budget_algorithm = budget_algorithm;
2008c98: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ]
the_thread->Start.budget_callout = budget_callout;
2008c9c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
the_thread->Wait.queue = NULL;
2008ca0: c0 26 60 44 clr [ %i1 + 0x44 ]
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
the_thread->Start.budget_callout = budget_callout;
2008ca4: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2008ca8: c2 07 a0 68 ld [ %fp + 0x68 ], %g1
the_thread->current_state = STATES_DORMANT;
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
2008cac: c0 26 60 1c clr [ %i1 + 0x1c ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2008cb0: c2 26 60 ac st %g1, [ %i1 + 0xac ]
the_thread->current_state = STATES_DORMANT;
2008cb4: 82 10 20 01 mov 1, %g1
2008cb8: c2 26 60 10 st %g1, [ %i1 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
2008cbc: 03 00 80 69 sethi %hi(0x201a400), %g1
2008cc0: c2 00 63 bc ld [ %g1 + 0x3bc ], %g1 ! 201a7bc <_Scheduler+0x18>
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
the_thread->real_priority = priority;
2008cc4: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
2008cc8: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ]
2008ccc: 9f c0 40 00 call %g1
2008cd0: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
2008cd4: b4 92 20 00 orcc %o0, 0, %i2
2008cd8: 02 80 00 15 be 2008d2c <_Thread_Initialize+0x178>
2008cdc: 90 10 00 19 mov %i1, %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
2008ce0: 40 00 01 97 call 200933c <_Thread_Set_priority>
2008ce4: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008ce8: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2008cec: 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 );
2008cf0: c0 26 60 84 clr [ %i1 + 0x84 ]
2008cf4: c0 26 60 88 clr [ %i1 + 0x88 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008cf8: 83 28 60 02 sll %g1, 2, %g1
2008cfc: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2008d00: e0 26 60 0c st %l0, [ %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 );
2008d04: 90 10 00 19 mov %i1, %o0
2008d08: 40 00 02 a7 call 20097a4 <_User_extensions_Thread_create>
2008d0c: b0 10 20 01 mov 1, %i0
if ( extension_status )
2008d10: 80 8a 20 ff btst 0xff, %o0
2008d14: 02 80 00 06 be 2008d2c <_Thread_Initialize+0x178>
2008d18: 01 00 00 00 nop
2008d1c: b0 0e 20 01 and %i0, 1, %i0
2008d20: 81 c7 e0 08 ret
2008d24: 81 e8 00 00 restore
size_t actual_stack_size = 0;
void *stack = NULL;
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
void *fp_area;
#endif
void *sched = NULL;
2008d28: b4 10 20 00 clr %i2
extension_status = _User_extensions_Thread_create( the_thread );
if ( extension_status )
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
2008d2c: 40 00 03 b6 call 2009c04 <_Workspace_Free>
2008d30: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
2008d34: 40 00 03 b4 call 2009c04 <_Workspace_Free>
2008d38: d0 06 61 58 ld [ %i1 + 0x158 ], %o0
2008d3c: 40 00 03 b2 call 2009c04 <_Workspace_Free>
2008d40: d0 06 61 5c ld [ %i1 + 0x15c ], %o0
_Workspace_Free( extensions_area );
2008d44: 40 00 03 b0 call 2009c04 <_Workspace_Free>
2008d48: 90 10 00 1c mov %i4, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
2008d4c: 40 00 03 ae call 2009c04 <_Workspace_Free>
2008d50: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
2008d54: 40 00 03 ac call 2009c04 <_Workspace_Free>
2008d58: 90 10 00 1a mov %i2, %o0
_Thread_Stack_Free( the_thread );
2008d5c: 40 00 01 b7 call 2009438 <_Thread_Stack_Free>
2008d60: 90 10 00 19 mov %i1, %o0
* 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 */
2008d64: b0 10 20 00 clr %i0
_Workspace_Free( sched );
_Thread_Stack_Free( the_thread );
return false;
}
2008d68: b0 0e 20 01 and %i0, 1, %i0
2008d6c: 81 c7 e0 08 ret
2008d70: 81 e8 00 00 restore
02009020 <_Thread_queue_Enqueue_priority>:
Thread_blocking_operation_States _Thread_queue_Enqueue_priority (
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread,
ISR_Level *level_p
)
{
2009020: 9d e3 bf a0 save %sp, -96, %sp
Priority_Control priority;
States_Control block_state;
_Chain_Initialize_empty( &the_thread->Wait.Block2n );
priority = the_thread->current_priority;
2009024: f8 06 60 14 ld [ %i1 + 0x14 ], %i4
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
2009028: 82 06 60 38 add %i1, 0x38, %g1
200902c: 84 06 60 3c add %i1, 0x3c, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
2009030: c2 26 60 40 st %g1, [ %i1 + 0x40 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2009034: c4 26 60 38 st %g2, [ %i1 + 0x38 ]
head->previous = NULL;
2009038: c0 26 60 3c clr [ %i1 + 0x3c ]
RTEMS_INLINE_ROUTINE uint32_t _Thread_queue_Header_number (
Priority_Control the_priority
)
{
return (the_priority / TASK_QUEUE_DATA_PRIORITIES_PER_HEADER);
200903c: 83 37 20 06 srl %i4, 6, %g1
header_index = _Thread_queue_Header_number( priority );
header = &the_thread_queue->Queues.Priority[ header_index ];
block_state = the_thread_queue->state;
2009040: e2 06 20 38 ld [ %i0 + 0x38 ], %l1
_Chain_Initialize_empty( &the_thread->Wait.Block2n );
priority = the_thread->current_priority;
header_index = _Thread_queue_Header_number( priority );
header = &the_thread_queue->Queues.Priority[ header_index ];
2009044: 85 28 60 02 sll %g1, 2, %g2
2009048: b7 28 60 04 sll %g1, 4, %i3
the_thread->Wait.queue = the_thread_queue;
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
200904c: 25 00 80 69 sethi %hi(0x201a400), %l2
_Chain_Initialize_empty( &the_thread->Wait.Block2n );
priority = the_thread->current_priority;
header_index = _Thread_queue_Header_number( priority );
header = &the_thread_queue->Queues.Priority[ header_index ];
2009050: b6 26 c0 02 sub %i3, %g2, %i3
block_state = the_thread_queue->state;
if ( _Thread_queue_Is_reverse_search( priority ) )
2009054: 80 8f 20 20 btst 0x20, %i4
2009058: 12 80 00 28 bne 20090f8 <_Thread_queue_Enqueue_priority+0xd8>
200905c: b6 06 00 1b add %i0, %i3, %i3
RTEMS_INLINE_ROUTINE bool _Chain_Is_tail(
Chain_Control *the_chain,
const Chain_Node *the_node
)
{
return (the_node == _Chain_Tail(the_chain));
2009060: a4 06 e0 04 add %i3, 4, %l2
goto restart_reverse_search;
restart_forward_search:
search_priority = PRIORITY_MINIMUM - 1;
_ISR_Disable( level );
2009064: 7f ff e4 2a call 200210c <sparc_disable_interrupts>
2009068: 01 00 00 00 nop
200906c: 82 10 00 08 mov %o0, %g1
if ( _Thread_queue_Is_reverse_search( priority ) )
goto restart_reverse_search;
restart_forward_search:
search_priority = PRIORITY_MINIMUM - 1;
2009070: a0 10 3f ff mov -1, %l0
_ISR_Disable( level );
search_thread = (Thread_Control *) _Chain_First( header );
while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) {
2009074: 10 80 00 11 b 20090b8 <_Thread_queue_Enqueue_priority+0x98>
2009078: fa 06 c0 00 ld [ %i3 ], %i5
search_priority = search_thread->current_priority;
if ( priority <= search_priority )
200907c: 80 a7 00 10 cmp %i4, %l0
2009080: 28 80 00 12 bleu,a 20090c8 <_Thread_queue_Enqueue_priority+0xa8>
2009084: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
break;
search_priority = search_thread->current_priority;
if ( priority <= search_priority )
break;
#endif
_ISR_Flash( level );
2009088: 7f ff e4 25 call 200211c <sparc_enable_interrupts>
200908c: 90 10 00 01 mov %g1, %o0
2009090: 7f ff e4 1f call 200210c <sparc_disable_interrupts>
2009094: 01 00 00 00 nop
2009098: 82 10 00 08 mov %o0, %g1
RTEMS_INLINE_ROUTINE bool _States_Are_set (
States_Control the_states,
States_Control mask
)
{
return ( (the_states & mask) != STATES_READY);
200909c: c4 07 60 10 ld [ %i5 + 0x10 ], %g2
if ( !_States_Are_set( search_thread->current_state, block_state) ) {
20090a0: 80 8c 40 02 btst %l1, %g2
20090a4: 32 80 00 05 bne,a 20090b8 <_Thread_queue_Enqueue_priority+0x98>
20090a8: fa 07 40 00 ld [ %i5 ], %i5
_ISR_Enable( level );
20090ac: 7f ff e4 1c call 200211c <sparc_enable_interrupts>
20090b0: 01 00 00 00 nop
goto restart_forward_search;
20090b4: 30 bf ff ec b,a 2009064 <_Thread_queue_Enqueue_priority+0x44>
restart_forward_search:
search_priority = PRIORITY_MINIMUM - 1;
_ISR_Disable( level );
search_thread = (Thread_Control *) _Chain_First( header );
while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) {
20090b8: 80 a7 40 12 cmp %i5, %l2
20090bc: 32 bf ff f0 bne,a 200907c <_Thread_queue_Enqueue_priority+0x5c>
20090c0: e0 07 60 14 ld [ %i5 + 0x14 ], %l0
}
search_thread =
(Thread_Control *)search_thread->Object.Node.next;
}
if ( the_thread_queue->sync_state !=
20090c4: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
20090c8: 80 a0 a0 01 cmp %g2, 1
20090cc: 32 80 00 3c bne,a 20091bc <_Thread_queue_Enqueue_priority+0x19c><== NEVER TAKEN
20090d0: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
if ( priority == search_priority )
20090d4: 80 a7 00 10 cmp %i4, %l0
20090d8: 02 80 00 2d be 200918c <_Thread_queue_Enqueue_priority+0x16c>
20090dc: c0 26 20 30 clr [ %i0 + 0x30 ]
goto equal_priority;
search_node = (Chain_Node *) search_thread;
previous_node = search_node->previous;
20090e0: c4 07 60 04 ld [ %i5 + 4 ], %g2
the_node = (Chain_Node *) the_thread;
the_node->next = search_node;
20090e4: fa 26 40 00 st %i5, [ %i1 ]
the_node->previous = previous_node;
20090e8: c4 26 60 04 st %g2, [ %i1 + 4 ]
previous_node->next = the_node;
20090ec: f2 20 80 00 st %i1, [ %g2 ]
search_node->previous = the_node;
20090f0: 10 80 00 2d b 20091a4 <_Thread_queue_Enqueue_priority+0x184>
20090f4: f2 27 60 04 st %i1, [ %i5 + 4 ]
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
_ISR_Disable( level );
20090f8: 7f ff e4 05 call 200210c <sparc_disable_interrupts>
20090fc: e0 0c a2 fc ldub [ %l2 + 0x2fc ], %l0
the_thread->Wait.queue = the_thread_queue;
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
2009100: a0 04 20 01 inc %l0
_ISR_Disable( level );
2009104: 82 10 00 08 mov %o0, %g1
search_thread = (Thread_Control *) _Chain_Last( header );
while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) {
2009108: 10 80 00 11 b 200914c <_Thread_queue_Enqueue_priority+0x12c>
200910c: fa 06 e0 08 ld [ %i3 + 8 ], %i5
search_priority = search_thread->current_priority;
if ( priority >= search_priority )
2009110: 80 a7 00 10 cmp %i4, %l0
2009114: 3a 80 00 12 bcc,a 200915c <_Thread_queue_Enqueue_priority+0x13c>
2009118: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
break;
search_priority = search_thread->current_priority;
if ( priority >= search_priority )
break;
#endif
_ISR_Flash( level );
200911c: 7f ff e4 00 call 200211c <sparc_enable_interrupts>
2009120: 90 10 00 01 mov %g1, %o0
2009124: 7f ff e3 fa call 200210c <sparc_disable_interrupts>
2009128: 01 00 00 00 nop
200912c: 82 10 00 08 mov %o0, %g1
2009130: c4 07 60 10 ld [ %i5 + 0x10 ], %g2
if ( !_States_Are_set( search_thread->current_state, block_state) ) {
2009134: 80 8c 40 02 btst %l1, %g2
2009138: 32 80 00 05 bne,a 200914c <_Thread_queue_Enqueue_priority+0x12c>
200913c: fa 07 60 04 ld [ %i5 + 4 ], %i5
_ISR_Enable( level );
2009140: 7f ff e3 f7 call 200211c <sparc_enable_interrupts>
2009144: 01 00 00 00 nop
goto restart_reverse_search;
2009148: 30 bf ff ec b,a 20090f8 <_Thread_queue_Enqueue_priority+0xd8>
restart_reverse_search:
search_priority = PRIORITY_MAXIMUM + 1;
_ISR_Disable( level );
search_thread = (Thread_Control *) _Chain_Last( header );
while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) {
200914c: 80 a7 40 1b cmp %i5, %i3
2009150: 32 bf ff f0 bne,a 2009110 <_Thread_queue_Enqueue_priority+0xf0>
2009154: e0 07 60 14 ld [ %i5 + 0x14 ], %l0
}
search_thread = (Thread_Control *)
search_thread->Object.Node.previous;
}
if ( the_thread_queue->sync_state !=
2009158: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
200915c: 80 a0 a0 01 cmp %g2, 1
2009160: 32 80 00 17 bne,a 20091bc <_Thread_queue_Enqueue_priority+0x19c><== NEVER TAKEN
2009164: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED
THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
goto synchronize;
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED;
if ( priority == search_priority )
2009168: 80 a7 00 10 cmp %i4, %l0
200916c: 02 80 00 08 be 200918c <_Thread_queue_Enqueue_priority+0x16c>
2009170: c0 26 20 30 clr [ %i0 + 0x30 ]
goto equal_priority;
search_node = (Chain_Node *) search_thread;
next_node = search_node->next;
2009174: c4 07 40 00 ld [ %i5 ], %g2
the_node = (Chain_Node *) the_thread;
the_node->next = next_node;
the_node->previous = search_node;
2009178: fa 26 60 04 st %i5, [ %i1 + 4 ]
search_node = (Chain_Node *) search_thread;
next_node = search_node->next;
the_node = (Chain_Node *) the_thread;
the_node->next = next_node;
200917c: c4 26 40 00 st %g2, [ %i1 ]
the_node->previous = search_node;
search_node->next = the_node;
2009180: f2 27 40 00 st %i1, [ %i5 ]
next_node->previous = the_node;
2009184: 10 80 00 08 b 20091a4 <_Thread_queue_Enqueue_priority+0x184>
2009188: f2 20 a0 04 st %i1, [ %g2 + 4 ]
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
equal_priority: /* add at end of priority group */
search_node = _Chain_Tail( &search_thread->Wait.Block2n );
previous_node = search_node->previous;
200918c: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
the_thread->Wait.queue = the_thread_queue;
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
equal_priority: /* add at end of priority group */
search_node = _Chain_Tail( &search_thread->Wait.Block2n );
2009190: 86 07 60 3c add %i5, 0x3c, %g3
previous_node = search_node->previous;
the_node = (Chain_Node *) the_thread;
the_node->next = search_node;
the_node->previous = previous_node;
2009194: c4 26 60 04 st %g2, [ %i1 + 4 ]
equal_priority: /* add at end of priority group */
search_node = _Chain_Tail( &search_thread->Wait.Block2n );
previous_node = search_node->previous;
the_node = (Chain_Node *) the_thread;
the_node->next = search_node;
2009198: c6 26 40 00 st %g3, [ %i1 ]
the_node->previous = previous_node;
previous_node->next = the_node;
200919c: f2 20 80 00 st %i1, [ %g2 ]
search_node->previous = the_node;
20091a0: f2 27 60 40 st %i1, [ %i5 + 0x40 ]
the_thread->Wait.queue = the_thread_queue;
20091a4: f0 26 60 44 st %i0, [ %i1 + 0x44 ]
_ISR_Enable( level );
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
20091a8: b0 10 20 01 mov 1, %i0
the_node->next = search_node;
the_node->previous = previous_node;
previous_node->next = the_node;
search_node->previous = the_node;
the_thread->Wait.queue = the_thread_queue;
_ISR_Enable( level );
20091ac: 7f ff e3 dc call 200211c <sparc_enable_interrupts>
20091b0: 90 10 00 01 mov %g1, %o0
return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
20091b4: 81 c7 e0 08 ret
20091b8: 81 e8 00 00 restore
* the mutex by an ISR or timed out.
*
* WARNING! Returning with interrupts disabled!
*/
*level_p = level;
return the_thread_queue->sync_state;
20091bc: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 <== NOT EXECUTED
}
20091c0: 81 c7 e0 08 ret <== NOT EXECUTED
20091c4: 81 e8 00 00 restore <== NOT EXECUTED
02009284 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
2009284: 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 )
2009288: 80 a6 20 00 cmp %i0, 0
200928c: 02 80 00 19 be 20092f0 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN
2009290: 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 ) {
2009294: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
2009298: 80 a7 20 01 cmp %i4, 1
200929c: 12 80 00 15 bne 20092f0 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN
20092a0: 01 00 00 00 nop
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
20092a4: 7f ff e3 9a call 200210c <sparc_disable_interrupts>
20092a8: 01 00 00 00 nop
20092ac: ba 10 00 08 mov %o0, %i5
20092b0: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
20092b4: 03 00 00 ef sethi %hi(0x3bc00), %g1
20092b8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
20092bc: 80 88 80 01 btst %g2, %g1
20092c0: 02 80 00 0a be 20092e8 <_Thread_queue_Requeue+0x64> <== NEVER TAKEN
20092c4: 90 10 00 18 mov %i0, %o0
_Thread_queue_Enter_critical_section( tq );
_Thread_queue_Extract_priority_helper( tq, the_thread, true );
20092c8: 92 10 00 19 mov %i1, %o1
20092cc: 94 10 20 01 mov 1, %o2
20092d0: 40 00 0c 14 call 200c320 <_Thread_queue_Extract_priority_helper>
20092d4: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
20092d8: 90 10 00 18 mov %i0, %o0
20092dc: 92 10 00 19 mov %i1, %o1
20092e0: 7f ff ff 50 call 2009020 <_Thread_queue_Enqueue_priority>
20092e4: 94 07 bf fc add %fp, -4, %o2
}
_ISR_Enable( level );
20092e8: 7f ff e3 8d call 200211c <sparc_enable_interrupts>
20092ec: 90 10 00 1d mov %i5, %o0
20092f0: 81 c7 e0 08 ret
20092f4: 81 e8 00 00 restore
020092f8 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
20092f8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
20092fc: 90 10 00 18 mov %i0, %o0
2009300: 7f ff fe 01 call 2008b04 <_Thread_Get>
2009304: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009308: c2 07 bf fc ld [ %fp + -4 ], %g1
200930c: 80 a0 60 00 cmp %g1, 0
2009310: 12 80 00 09 bne 2009334 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN
2009314: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
2009318: 40 00 0c 39 call 200c3fc <_Thread_queue_Process_timeout>
200931c: 01 00 00 00 nop
/**
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2009320: 03 00 80 6c sethi %hi(0x201b000), %g1
2009324: c4 00 63 a0 ld [ %g1 + 0x3a0 ], %g2 ! 201b3a0 <_Thread_Dispatch_disable_level>
2009328: 84 00 bf ff add %g2, -1, %g2
200932c: c4 20 63 a0 st %g2, [ %g1 + 0x3a0 ]
return _Thread_Dispatch_disable_level;
2009330: c2 00 63 a0 ld [ %g1 + 0x3a0 ], %g1
2009334: 81 c7 e0 08 ret
2009338: 81 e8 00 00 restore
02016d3c <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
2016d3c: 9d e3 bf 88 save %sp, -120, %sp
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
2016d40: 27 00 80 f0 sethi %hi(0x203c000), %l3
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2016d44: a8 07 bf e8 add %fp, -24, %l4
2016d48: a4 07 bf ec add %fp, -20, %l2
2016d4c: b6 07 bf f4 add %fp, -12, %i3
2016d50: b4 07 bf f8 add %fp, -8, %i2
2016d54: e4 27 bf e8 st %l2, [ %fp + -24 ]
head->previous = NULL;
2016d58: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
2016d5c: e8 27 bf f0 st %l4, [ %fp + -16 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2016d60: f4 27 bf f4 st %i2, [ %fp + -12 ]
head->previous = NULL;
2016d64: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
2016d68: f6 27 bf fc st %i3, [ %fp + -4 ]
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016d6c: b2 06 20 30 add %i0, 0x30, %i1
/*
* 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 );
2016d70: b8 06 20 68 add %i0, 0x68, %i4
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016d74: a2 06 20 08 add %i0, 8, %l1
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
2016d78: a0 06 20 40 add %i0, 0x40, %l0
{
/*
* 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;
2016d7c: e8 26 20 78 st %l4, [ %i0 + 0x78 ]
static void _Timer_server_Process_tod_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
2016d80: 2b 00 80 f0 sethi %hi(0x203c000), %l5
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
2016d84: c2 04 e2 a4 ld [ %l3 + 0x2a4 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2016d88: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016d8c: 94 10 00 1b mov %i3, %o2
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2016d90: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016d94: 90 10 00 19 mov %i1, %o0
2016d98: 40 00 11 68 call 201b338 <_Watchdog_Adjust_to_chain>
2016d9c: 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;
2016da0: 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();
2016da4: fa 05 62 1c ld [ %l5 + 0x21c ], %i5
/*
* 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 ) {
2016da8: 80 a7 40 0a cmp %i5, %o2
2016dac: 08 80 00 06 bleu 2016dc4 <_Timer_server_Body+0x88>
2016db0: 92 27 40 0a sub %i5, %o2, %o1
/*
* 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 );
2016db4: 90 10 00 1c mov %i4, %o0
2016db8: 40 00 11 60 call 201b338 <_Watchdog_Adjust_to_chain>
2016dbc: 94 10 00 1b mov %i3, %o2
2016dc0: 30 80 00 06 b,a 2016dd8 <_Timer_server_Body+0x9c>
} else if ( snapshot < last_snapshot ) {
2016dc4: 1a 80 00 05 bcc 2016dd8 <_Timer_server_Body+0x9c>
2016dc8: 90 10 00 1c mov %i4, %o0
/*
* 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 );
2016dcc: 92 10 20 01 mov 1, %o1
2016dd0: 40 00 11 33 call 201b29c <_Watchdog_Adjust>
2016dd4: 94 22 80 1d sub %o2, %i5, %o2
}
watchdogs->last_snapshot = snapshot;
2016dd8: fa 26 20 74 st %i5, [ %i0 + 0x74 ]
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
2016ddc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
2016de0: 40 00 02 b6 call 20178b8 <_Chain_Get>
2016de4: 01 00 00 00 nop
if ( timer == NULL ) {
2016de8: 92 92 20 00 orcc %o0, 0, %o1
2016dec: 02 80 00 0c be 2016e1c <_Timer_server_Body+0xe0>
2016df0: 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 ) {
2016df4: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
2016df8: 80 a0 60 01 cmp %g1, 1
2016dfc: 02 80 00 05 be 2016e10 <_Timer_server_Body+0xd4>
2016e00: 90 10 00 19 mov %i1, %o0
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
2016e04: 80 a0 60 03 cmp %g1, 3
2016e08: 12 bf ff f5 bne 2016ddc <_Timer_server_Body+0xa0> <== NEVER TAKEN
2016e0c: 90 10 00 1c mov %i4, %o0
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
2016e10: 40 00 11 7c call 201b400 <_Watchdog_Insert>
2016e14: 92 02 60 10 add %o1, 0x10, %o1
2016e18: 30 bf ff f1 b,a 2016ddc <_Timer_server_Body+0xa0>
* of zero it will be processed in the next iteration of the timer server
* body loop.
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
2016e1c: 7f ff e3 82 call 200fc24 <sparc_disable_interrupts>
2016e20: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
2016e24: c2 07 bf e8 ld [ %fp + -24 ], %g1
2016e28: 80 a0 40 12 cmp %g1, %l2
2016e2c: 12 80 00 0a bne 2016e54 <_Timer_server_Body+0x118> <== NEVER TAKEN
2016e30: 01 00 00 00 nop
ts->insert_chain = NULL;
2016e34: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
2016e38: 7f ff e3 7f call 200fc34 <sparc_enable_interrupts>
2016e3c: 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 ) ) {
2016e40: c2 07 bf f4 ld [ %fp + -12 ], %g1
2016e44: 80 a0 40 1a cmp %g1, %i2
2016e48: 12 80 00 06 bne 2016e60 <_Timer_server_Body+0x124>
2016e4c: 01 00 00 00 nop
2016e50: 30 80 00 18 b,a 2016eb0 <_Timer_server_Body+0x174>
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
2016e54: 7f ff e3 78 call 200fc34 <sparc_enable_interrupts> <== NOT EXECUTED
2016e58: 01 00 00 00 nop <== NOT EXECUTED
2016e5c: 30 bf ff ca b,a 2016d84 <_Timer_server_Body+0x48> <== NOT EXECUTED
/*
* It is essential that interrupts are disable here since an interrupt
* service routine may remove a watchdog from the chain.
*/
_ISR_Disable( level );
2016e60: 7f ff e3 71 call 200fc24 <sparc_disable_interrupts>
2016e64: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2016e68: fa 07 bf f4 ld [ %fp + -12 ], %i5
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected(
Chain_Control *the_chain
)
{
if ( !_Chain_Is_empty(the_chain))
2016e6c: 80 a7 40 1a cmp %i5, %i2
2016e70: 02 80 00 0d be 2016ea4 <_Timer_server_Body+0x168>
2016e74: 01 00 00 00 nop
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *old_first = head->next;
Chain_Node *new_first = old_first->next;
2016e78: c2 07 40 00 ld [ %i5 ], %g1
head->next = new_first;
new_first->previous = head;
2016e7c: f6 20 60 04 st %i3, [ %g1 + 4 ]
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *old_first = head->next;
Chain_Node *new_first = old_first->next;
head->next = new_first;
2016e80: c2 27 bf f4 st %g1, [ %fp + -12 ]
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
2016e84: c0 27 60 08 clr [ %i5 + 8 ]
_ISR_Enable( level );
2016e88: 7f ff e3 6b call 200fc34 <sparc_enable_interrupts>
2016e8c: 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 );
2016e90: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
2016e94: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
2016e98: 9f c0 40 00 call %g1
2016e9c: d2 07 60 24 ld [ %i5 + 0x24 ], %o1
}
2016ea0: 30 bf ff f0 b,a 2016e60 <_Timer_server_Body+0x124>
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
_ISR_Enable( level );
} else {
_ISR_Enable( level );
2016ea4: 7f ff e3 64 call 200fc34 <sparc_enable_interrupts>
2016ea8: 01 00 00 00 nop
2016eac: 30 bf ff b4 b,a 2016d7c <_Timer_server_Body+0x40>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
2016eb0: c0 2e 20 7c clrb [ %i0 + 0x7c ]
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
2016eb4: 7f ff ff 73 call 2016c80 <_Thread_Disable_dispatch>
2016eb8: 01 00 00 00 nop
_Thread_Set_state( ts->thread, STATES_DELAYING );
2016ebc: d0 06 00 00 ld [ %i0 ], %o0
2016ec0: 40 00 0f 66 call 201ac58 <_Thread_Set_state>
2016ec4: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
2016ec8: 7f ff ff 75 call 2016c9c <_Timer_server_Reset_interval_system_watchdog>
2016ecc: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
2016ed0: 7f ff ff 87 call 2016cec <_Timer_server_Reset_tod_system_watchdog>
2016ed4: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
2016ed8: 40 00 0d 1b call 201a344 <_Thread_Enable_dispatch>
2016edc: 01 00 00 00 nop
ts->active = true;
2016ee0: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016ee4: 90 10 00 11 mov %l1, %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;
2016ee8: c2 2e 20 7c stb %g1, [ %i0 + 0x7c ]
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016eec: 40 00 11 9f call 201b568 <_Watchdog_Remove>
2016ef0: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
2016ef4: 40 00 11 9d call 201b568 <_Watchdog_Remove>
2016ef8: 90 10 00 10 mov %l0, %o0
2016efc: 30 bf ff a0 b,a 2016d7c <_Timer_server_Body+0x40>
02016f00 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
2016f00: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
2016f04: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
2016f08: 80 a0 60 00 cmp %g1, 0
2016f0c: 12 80 00 49 bne 2017030 <_Timer_server_Schedule_operation_method+0x130>
2016f10: ba 10 00 19 mov %i1, %i5
* is the reference point for the delta chain. Thus if we do not update the
* reference point we have to add DT to the initial delta of the watchdog
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
2016f14: 7f ff ff 5b call 2016c80 <_Thread_Disable_dispatch>
2016f18: 01 00 00 00 nop
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
2016f1c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
2016f20: 80 a0 60 01 cmp %g1, 1
2016f24: 12 80 00 1f bne 2016fa0 <_Timer_server_Schedule_operation_method+0xa0>
2016f28: 80 a0 60 03 cmp %g1, 3
/*
* We have to advance the last known ticks value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
2016f2c: 7f ff e3 3e call 200fc24 <sparc_disable_interrupts>
2016f30: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
2016f34: 03 00 80 f0 sethi %hi(0x203c000), %g1
2016f38: c4 00 62 a4 ld [ %g1 + 0x2a4 ], %g2 ! 203c2a4 <_Watchdog_Ticks_since_boot>
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2016f3c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
last_snapshot = ts->Interval_watchdogs.last_snapshot;
2016f40: c8 06 20 3c ld [ %i0 + 0x3c ], %g4
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
2016f44: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
2016f48: 80 a0 40 03 cmp %g1, %g3
2016f4c: 02 80 00 08 be 2016f6c <_Timer_server_Schedule_operation_method+0x6c>
2016f50: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
2016f54: de 00 60 10 ld [ %g1 + 0x10 ], %o7
if (delta_interval > delta) {
2016f58: 80 a3 c0 04 cmp %o7, %g4
2016f5c: 08 80 00 03 bleu 2016f68 <_Timer_server_Schedule_operation_method+0x68>
2016f60: 86 10 20 00 clr %g3
delta_interval -= delta;
2016f64: 86 23 c0 04 sub %o7, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
2016f68: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
2016f6c: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
2016f70: 7f ff e3 31 call 200fc34 <sparc_enable_interrupts>
2016f74: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
2016f78: 90 06 20 30 add %i0, 0x30, %o0
2016f7c: 40 00 11 21 call 201b400 <_Watchdog_Insert>
2016f80: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2016f84: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2016f88: 80 a0 60 00 cmp %g1, 0
2016f8c: 12 80 00 27 bne 2017028 <_Timer_server_Schedule_operation_method+0x128>
2016f90: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
2016f94: 7f ff ff 42 call 2016c9c <_Timer_server_Reset_interval_system_watchdog>
2016f98: 90 10 00 18 mov %i0, %o0
2016f9c: 30 80 00 23 b,a 2017028 <_Timer_server_Schedule_operation_method+0x128>
}
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
2016fa0: 12 80 00 22 bne 2017028 <_Timer_server_Schedule_operation_method+0x128>
2016fa4: 01 00 00 00 nop
/*
* We have to advance the last known seconds value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
2016fa8: 7f ff e3 1f call 200fc24 <sparc_disable_interrupts>
2016fac: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2016fb0: c4 06 20 68 ld [ %i0 + 0x68 ], %g2
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
2016fb4: de 06 20 74 ld [ %i0 + 0x74 ], %o7
/*
* 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();
2016fb8: 03 00 80 f0 sethi %hi(0x203c000), %g1
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
2016fbc: 86 06 20 6c add %i0, 0x6c, %g3
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
2016fc0: 80 a0 80 03 cmp %g2, %g3
2016fc4: 02 80 00 0d be 2016ff8 <_Timer_server_Schedule_operation_method+0xf8>
2016fc8: c2 00 62 1c ld [ %g1 + 0x21c ], %g1
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
2016fcc: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4
if ( snapshot > last_snapshot ) {
2016fd0: 80 a0 40 0f cmp %g1, %o7
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
2016fd4: 86 01 00 0f add %g4, %o7, %g3
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 ) {
2016fd8: 08 80 00 07 bleu 2016ff4 <_Timer_server_Schedule_operation_method+0xf4>
2016fdc: 86 20 c0 01 sub %g3, %g1, %g3
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
2016fe0: 9e 20 40 0f sub %g1, %o7, %o7
if (delta_interval > delta) {
2016fe4: 80 a1 00 0f cmp %g4, %o7
2016fe8: 08 80 00 03 bleu 2016ff4 <_Timer_server_Schedule_operation_method+0xf4><== NEVER TAKEN
2016fec: 86 10 20 00 clr %g3
delta_interval -= delta;
2016ff0: 86 21 00 0f sub %g4, %o7, %g3
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
delta_interval += delta;
}
first_watchdog->delta_interval = delta_interval;
2016ff4: c6 20 a0 10 st %g3, [ %g2 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
2016ff8: c2 26 20 74 st %g1, [ %i0 + 0x74 ]
_ISR_Enable( level );
2016ffc: 7f ff e3 0e call 200fc34 <sparc_enable_interrupts>
2017000: 01 00 00 00 nop
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
2017004: 90 06 20 68 add %i0, 0x68, %o0
2017008: 40 00 10 fe call 201b400 <_Watchdog_Insert>
201700c: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2017010: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2017014: 80 a0 60 00 cmp %g1, 0
2017018: 12 80 00 04 bne 2017028 <_Timer_server_Schedule_operation_method+0x128>
201701c: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
2017020: 7f ff ff 33 call 2016cec <_Timer_server_Reset_tod_system_watchdog>
2017024: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
2017028: 40 00 0c c7 call 201a344 <_Thread_Enable_dispatch>
201702c: 81 e8 00 00 restore
* 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 );
2017030: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
2017034: 40 00 02 0d call 2017868 <_Chain_Append>
2017038: 81 e8 00 00 restore
02009624 <_User_extensions_Handler_initialization>:
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _User_extensions_Handler_initialization(void)
{
2009624: 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;
2009628: 03 00 80 69 sethi %hi(0x201a400), %g1
200962c: 82 10 62 bc or %g1, 0x2bc, %g1 ! 201a6bc <Configuration>
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2009630: 05 00 80 6d sethi %hi(0x201b400), %g2
initial_extensions = Configuration.User_extension_table;
2009634: f4 00 60 3c ld [ %g1 + 0x3c ], %i2
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;
2009638: f6 00 60 38 ld [ %g1 + 0x38 ], %i3
200963c: 82 10 a1 88 or %g2, 0x188, %g1
2009640: 86 00 60 04 add %g1, 4, %g3
head->previous = NULL;
2009644: c0 20 60 04 clr [ %g1 + 4 ]
tail->previous = head;
2009648: c2 20 60 08 st %g1, [ %g1 + 8 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200964c: c6 20 a1 88 st %g3, [ %g2 + 0x188 ]
2009650: 05 00 80 6c sethi %hi(0x201b000), %g2
2009654: 82 10 a3 a4 or %g2, 0x3a4, %g1 ! 201b3a4 <_User_extensions_Switches_list>
2009658: 86 00 60 04 add %g1, 4, %g3
head->previous = NULL;
200965c: c0 20 60 04 clr [ %g1 + 4 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2009660: c6 20 a3 a4 st %g3, [ %g2 + 0x3a4 ]
initial_extensions = Configuration.User_extension_table;
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
2009664: 80 a6 a0 00 cmp %i2, 0
2009668: 02 80 00 1b be 20096d4 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200966c: c2 20 60 08 st %g1, [ %g1 + 8 ]
extension = (User_extensions_Control *)
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
2009670: 83 2e e0 02 sll %i3, 2, %g1
2009674: bb 2e e0 04 sll %i3, 4, %i5
2009678: ba 27 40 01 sub %i5, %g1, %i5
200967c: ba 07 40 1b add %i5, %i3, %i5
2009680: bb 2f 60 02 sll %i5, 2, %i5
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
2009684: 40 00 01 66 call 2009c1c <_Workspace_Allocate_or_fatal_error>
2009688: 90 10 00 1d mov %i5, %o0
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200968c: 94 10 00 1d mov %i5, %o2
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
2009690: b8 10 00 08 mov %o0, %i4
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
2009694: 92 10 20 00 clr %o1
2009698: 40 00 13 cc call 200e5c8 <memset>
200969c: ba 10 20 00 clr %i5
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
20096a0: 10 80 00 0b b 20096cc <_User_extensions_Handler_initialization+0xa8>
20096a4: 80 a7 40 1b cmp %i5, %i3
RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table(
User_extensions_Control *extension,
const User_extensions_Table *extension_table
)
{
extension->Callouts = *extension_table;
20096a8: 90 07 20 14 add %i4, 0x14, %o0
20096ac: 92 06 80 09 add %i2, %o1, %o1
20096b0: 40 00 13 8a call 200e4d8 <memcpy>
20096b4: 94 10 20 20 mov 0x20, %o2
_User_extensions_Add_set( extension );
20096b8: 90 10 00 1c mov %i4, %o0
20096bc: 40 00 0b 74 call 200c48c <_User_extensions_Add_set>
20096c0: ba 07 60 01 inc %i5
_User_extensions_Add_set_with_table (extension, &initial_extensions[i]);
extension++;
20096c4: b8 07 20 34 add %i4, 0x34, %i4
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
20096c8: 80 a7 40 1b cmp %i5, %i3
20096cc: 12 bf ff f7 bne 20096a8 <_User_extensions_Handler_initialization+0x84>
20096d0: 93 2f 60 05 sll %i5, 5, %o1
20096d4: 81 c7 e0 08 ret
20096d8: 81 e8 00 00 restore
0200b384 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200b384: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200b388: 7f ff de fb call 2002f74 <sparc_disable_interrupts>
200b38c: ba 10 00 18 mov %i0, %i5
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200b390: c2 06 00 00 ld [ %i0 ], %g1
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200b394: b8 06 20 04 add %i0, 4, %i4
* hence the compiler must not assume *header to remain
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
200b398: 80 a0 40 1c cmp %g1, %i4
200b39c: 02 80 00 1f be 200b418 <_Watchdog_Adjust+0x94>
200b3a0: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200b3a4: 02 80 00 1a be 200b40c <_Watchdog_Adjust+0x88>
200b3a8: b6 10 20 01 mov 1, %i3
200b3ac: 80 a6 60 01 cmp %i1, 1
200b3b0: 12 80 00 1a bne 200b418 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200b3b4: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200b3b8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200b3bc: 10 80 00 07 b 200b3d8 <_Watchdog_Adjust+0x54>
200b3c0: b4 00 80 1a add %g2, %i2, %i2
break;
case WATCHDOG_FORWARD:
while ( units ) {
if ( units < _Watchdog_First( header )->delta_interval ) {
200b3c4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200b3c8: 80 a6 80 02 cmp %i2, %g2
200b3cc: 3a 80 00 05 bcc,a 200b3e0 <_Watchdog_Adjust+0x5c>
200b3d0: f6 20 60 10 st %i3, [ %g1 + 0x10 ]
_Watchdog_First( header )->delta_interval -= units;
200b3d4: b4 20 80 1a sub %g2, %i2, %i2
break;
200b3d8: 10 80 00 10 b 200b418 <_Watchdog_Adjust+0x94>
200b3dc: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
} else {
units -= _Watchdog_First( header )->delta_interval;
200b3e0: b4 26 80 02 sub %i2, %g2, %i2
_Watchdog_First( header )->delta_interval = 1;
_ISR_Enable( level );
200b3e4: 7f ff de e8 call 2002f84 <sparc_enable_interrupts>
200b3e8: 01 00 00 00 nop
_Watchdog_Tickle( header );
200b3ec: 40 00 00 90 call 200b62c <_Watchdog_Tickle>
200b3f0: 90 10 00 1d mov %i5, %o0
_ISR_Disable( level );
200b3f4: 7f ff de e0 call 2002f74 <sparc_disable_interrupts>
200b3f8: 01 00 00 00 nop
if ( _Chain_Is_empty( header ) )
200b3fc: c2 07 40 00 ld [ %i5 ], %g1
200b400: 80 a0 40 1c cmp %g1, %i4
200b404: 02 80 00 05 be 200b418 <_Watchdog_Adjust+0x94>
200b408: 01 00 00 00 nop
switch ( direction ) {
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200b40c: 80 a6 a0 00 cmp %i2, 0
200b410: 32 bf ff ed bne,a 200b3c4 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN
200b414: c2 07 40 00 ld [ %i5 ], %g1
}
break;
}
}
_ISR_Enable( level );
200b418: 7f ff de db call 2002f84 <sparc_enable_interrupts>
200b41c: 91 e8 00 08 restore %g0, %o0, %o0
02009a3c <_Watchdog_Remove>:
*/
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
2009a3c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
2009a40: 7f ff e1 b3 call 200210c <sparc_disable_interrupts>
2009a44: ba 10 00 18 mov %i0, %i5
previous_state = the_watchdog->state;
2009a48: f0 06 20 08 ld [ %i0 + 8 ], %i0
switch ( previous_state ) {
2009a4c: 80 a6 20 01 cmp %i0, 1
2009a50: 22 80 00 1d be,a 2009ac4 <_Watchdog_Remove+0x88>
2009a54: c0 27 60 08 clr [ %i5 + 8 ]
2009a58: 0a 80 00 1c bcs 2009ac8 <_Watchdog_Remove+0x8c>
2009a5c: 03 00 80 6d sethi %hi(0x201b400), %g1
2009a60: 80 a6 20 03 cmp %i0, 3
2009a64: 18 80 00 19 bgu 2009ac8 <_Watchdog_Remove+0x8c> <== NEVER TAKEN
2009a68: 01 00 00 00 nop
2009a6c: c2 07 40 00 ld [ %i5 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
2009a70: c0 27 60 08 clr [ %i5 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
2009a74: c4 00 40 00 ld [ %g1 ], %g2
2009a78: 80 a0 a0 00 cmp %g2, 0
2009a7c: 02 80 00 07 be 2009a98 <_Watchdog_Remove+0x5c>
2009a80: 05 00 80 6d sethi %hi(0x201b400), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
2009a84: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
2009a88: c4 07 60 10 ld [ %i5 + 0x10 ], %g2
2009a8c: 84 00 c0 02 add %g3, %g2, %g2
2009a90: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
2009a94: 05 00 80 6d sethi %hi(0x201b400), %g2
2009a98: c4 00 a0 b0 ld [ %g2 + 0xb0 ], %g2 ! 201b4b0 <_Watchdog_Sync_count>
2009a9c: 80 a0 a0 00 cmp %g2, 0
2009aa0: 22 80 00 07 be,a 2009abc <_Watchdog_Remove+0x80>
2009aa4: c4 07 60 04 ld [ %i5 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
2009aa8: 05 00 80 6d sethi %hi(0x201b400), %g2
2009aac: c6 00 a1 d4 ld [ %g2 + 0x1d4 ], %g3 ! 201b5d4 <_Per_CPU_Information+0x8>
2009ab0: 05 00 80 6d sethi %hi(0x201b400), %g2
2009ab4: c6 20 a0 48 st %g3, [ %g2 + 0x48 ] ! 201b448 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
2009ab8: c4 07 60 04 ld [ %i5 + 4 ], %g2
next->previous = previous;
2009abc: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
2009ac0: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
2009ac4: 03 00 80 6d sethi %hi(0x201b400), %g1
2009ac8: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201b4b4 <_Watchdog_Ticks_since_boot>
2009acc: c2 27 60 18 st %g1, [ %i5 + 0x18 ]
_ISR_Enable( level );
2009ad0: 7f ff e1 93 call 200211c <sparc_enable_interrupts>
2009ad4: 01 00 00 00 nop
return( previous_state );
}
2009ad8: 81 c7 e0 08 ret
2009adc: 81 e8 00 00 restore
0200ab8c <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200ab8c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200ab90: 7f ff df ce call 2002ac8 <sparc_disable_interrupts>
200ab94: ba 10 00 18 mov %i0, %i5
200ab98: b0 10 00 08 mov %o0, %i0
printk( "Watchdog Chain: %s %p\n", name, header );
200ab9c: 11 00 80 6c sethi %hi(0x201b000), %o0
200aba0: 94 10 00 19 mov %i1, %o2
200aba4: 90 12 23 f8 or %o0, 0x3f8, %o0
200aba8: 7f ff e6 72 call 2004570 <printk>
200abac: 92 10 00 1d mov %i5, %o1
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200abb0: f8 06 40 00 ld [ %i1 ], %i4
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200abb4: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200abb8: 80 a7 00 19 cmp %i4, %i1
200abbc: 12 80 00 04 bne 200abcc <_Watchdog_Report_chain+0x40>
200abc0: 92 10 00 1c mov %i4, %o1
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200abc4: 10 80 00 0d b 200abf8 <_Watchdog_Report_chain+0x6c>
200abc8: 11 00 80 6d sethi %hi(0x201b400), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200abcc: 40 00 00 0f call 200ac08 <_Watchdog_Report>
200abd0: 90 10 20 00 clr %o0
_ISR_Disable( level );
printk( "Watchdog Chain: %s %p\n", name, header );
if ( !_Chain_Is_empty( header ) ) {
for ( node = _Chain_First( header ) ;
node != _Chain_Tail(header) ;
node = node->next )
200abd4: f8 07 00 00 ld [ %i4 ], %i4
Chain_Node *node;
_ISR_Disable( level );
printk( "Watchdog Chain: %s %p\n", name, header );
if ( !_Chain_Is_empty( header ) ) {
for ( node = _Chain_First( header ) ;
200abd8: 80 a7 00 19 cmp %i4, %i1
200abdc: 12 bf ff fc bne 200abcc <_Watchdog_Report_chain+0x40> <== NEVER TAKEN
200abe0: 92 10 00 1c mov %i4, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200abe4: 11 00 80 6d sethi %hi(0x201b400), %o0
200abe8: 92 10 00 1d mov %i5, %o1
200abec: 7f ff e6 61 call 2004570 <printk>
200abf0: 90 12 20 10 or %o0, 0x10, %o0
200abf4: 30 80 00 03 b,a 200ac00 <_Watchdog_Report_chain+0x74>
} else {
printk( "Chain is empty\n" );
200abf8: 7f ff e6 5e call 2004570 <printk>
200abfc: 90 12 20 20 or %o0, 0x20, %o0
}
_ISR_Enable( level );
200ac00: 7f ff df b6 call 2002ad8 <sparc_enable_interrupts>
200ac04: 81 e8 00 00 restore
02006cb4 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
2006cb4: 9d e3 bf 98 save %sp, -104, %sp
2006cb8: 10 80 00 09 b 2006cdc <rtems_chain_get_with_wait+0x28>
2006cbc: ba 10 00 18 mov %i0, %i5
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
) {
rtems_event_set out;
sc = rtems_event_receive(
2006cc0: 92 10 20 00 clr %o1
2006cc4: 94 10 00 1a mov %i2, %o2
2006cc8: 7f ff fd 03 call 20060d4 <rtems_event_receive>
2006ccc: 96 07 bf fc add %fp, -4, %o3
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
2006cd0: 80 a2 20 00 cmp %o0, 0
2006cd4: 32 80 00 09 bne,a 2006cf8 <rtems_chain_get_with_wait+0x44><== ALWAYS TAKEN
2006cd8: f8 26 c0 00 st %i4, [ %i3 ]
*/
RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get(
rtems_chain_control *the_chain
)
{
return _Chain_Get( the_chain );
2006cdc: 40 00 01 5e call 2007254 <_Chain_Get>
2006ce0: 90 10 00 1d mov %i5, %o0
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
2006ce4: b8 92 20 00 orcc %o0, 0, %i4
2006ce8: 02 bf ff f6 be 2006cc0 <rtems_chain_get_with_wait+0xc>
2006cec: 90 10 00 19 mov %i1, %o0
2006cf0: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
2006cf4: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
2006cf8: 81 c7 e0 08 ret
2006cfc: 91 e8 00 08 restore %g0, %o0, %o0
02008f40 <rtems_iterate_over_all_threads>:
#include <rtems/system.h>
#include <rtems/score/thread.h>
void rtems_iterate_over_all_threads(rtems_per_thread_routine routine)
{
2008f40: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
2008f44: 80 a6 20 00 cmp %i0, 0
2008f48: 02 80 00 1e be 2008fc0 <rtems_iterate_over_all_threads+0x80><== NEVER TAKEN
2008f4c: ba 10 20 01 mov 1, %i5
return;
for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) {
#if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG)
if ( !_Objects_Information_table[ api_index ] )
2008f50: 35 00 80 77 sethi %hi(0x201dc00), %i2
#endif
#include <rtems/system.h>
#include <rtems/score/thread.h>
void rtems_iterate_over_all_threads(rtems_per_thread_routine routine)
2008f54: 83 2f 60 02 sll %i5, 2, %g1
if ( !routine )
return;
for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) {
#if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG)
if ( !_Objects_Information_table[ api_index ] )
2008f58: 84 16 a2 18 or %i2, 0x218, %g2
2008f5c: c2 00 80 01 ld [ %g2 + %g1 ], %g1
2008f60: 80 a0 60 00 cmp %g1, 0
2008f64: 22 80 00 14 be,a 2008fb4 <rtems_iterate_over_all_threads+0x74>
2008f68: ba 07 60 01 inc %i5
continue;
#endif
information = _Objects_Information_table[ api_index ][ 1 ];
2008f6c: f6 00 60 04 ld [ %g1 + 4 ], %i3
if ( !information )
2008f70: 80 a6 e0 00 cmp %i3, 0
2008f74: 12 80 00 0b bne 2008fa0 <rtems_iterate_over_all_threads+0x60>
2008f78: b8 10 20 01 mov 1, %i4
Objects_Information *information;
if ( !routine )
return;
for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) {
2008f7c: 10 80 00 0e b 2008fb4 <rtems_iterate_over_all_threads+0x74>
2008f80: ba 07 60 01 inc %i5
information = _Objects_Information_table[ api_index ][ 1 ];
if ( !information )
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
the_thread = (Thread_Control *)information->local_table[ i ];
2008f84: 83 2f 20 02 sll %i4, 2, %g1
2008f88: d0 00 80 01 ld [ %g2 + %g1 ], %o0
if ( !the_thread )
2008f8c: 80 a2 20 00 cmp %o0, 0
2008f90: 02 80 00 04 be 2008fa0 <rtems_iterate_over_all_threads+0x60>
2008f94: b8 07 20 01 inc %i4
continue;
(*routine)(the_thread);
2008f98: 9f c6 00 00 call %i0
2008f9c: 01 00 00 00 nop
information = _Objects_Information_table[ api_index ][ 1 ];
if ( !information )
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
2008fa0: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1
2008fa4: 80 a7 00 01 cmp %i4, %g1
2008fa8: 28 bf ff f7 bleu,a 2008f84 <rtems_iterate_over_all_threads+0x44>
2008fac: c4 06 e0 1c ld [ %i3 + 0x1c ], %g2
Objects_Information *information;
if ( !routine )
return;
for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) {
2008fb0: ba 07 60 01 inc %i5
2008fb4: 80 a7 60 04 cmp %i5, 4
2008fb8: 12 bf ff e8 bne 2008f58 <rtems_iterate_over_all_threads+0x18>
2008fbc: 83 2f 60 02 sll %i5, 2, %g1
2008fc0: 81 c7 e0 08 ret
2008fc4: 81 e8 00 00 restore
0201471c <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
201471c: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2014720: 80 a6 20 00 cmp %i0, 0
2014724: 02 80 00 39 be 2014808 <rtems_partition_create+0xec>
2014728: 82 10 20 03 mov 3, %g1
return RTEMS_INVALID_NAME;
if ( !starting_address )
201472c: 80 a6 60 00 cmp %i1, 0
2014730: 02 80 00 36 be 2014808 <rtems_partition_create+0xec>
2014734: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2014738: 80 a7 60 00 cmp %i5, 0
201473c: 02 80 00 33 be 2014808 <rtems_partition_create+0xec> <== NEVER TAKEN
2014740: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2014744: 02 80 00 31 be 2014808 <rtems_partition_create+0xec>
2014748: 82 10 20 08 mov 8, %g1
201474c: 80 a6 a0 00 cmp %i2, 0
2014750: 02 80 00 2e be 2014808 <rtems_partition_create+0xec>
2014754: 80 a6 80 1b cmp %i2, %i3
2014758: 0a 80 00 2c bcs 2014808 <rtems_partition_create+0xec>
201475c: 80 8e e0 07 btst 7, %i3
2014760: 12 80 00 2a bne 2014808 <rtems_partition_create+0xec>
2014764: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
2014768: 12 80 00 28 bne 2014808 <rtems_partition_create+0xec>
201476c: 82 10 20 09 mov 9, %g1
/**
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2014770: 03 00 80 f0 sethi %hi(0x203c000), %g1
2014774: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 203c190 <_Thread_Dispatch_disable_level>
2014778: 84 00 a0 01 inc %g2
201477c: c4 20 61 90 st %g2, [ %g1 + 0x190 ]
return _Thread_Dispatch_disable_level;
2014780: c2 00 61 90 ld [ %g1 + 0x190 ], %g1
* 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 );
2014784: 23 00 80 ef sethi %hi(0x203bc00), %l1
2014788: 40 00 12 26 call 2019020 <_Objects_Allocate>
201478c: 90 14 63 a4 or %l1, 0x3a4, %o0 ! 203bfa4 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2014790: a0 92 20 00 orcc %o0, 0, %l0
2014794: 32 80 00 06 bne,a 20147ac <rtems_partition_create+0x90>
2014798: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
201479c: 40 00 16 ea call 201a344 <_Thread_Enable_dispatch>
20147a0: 01 00 00 00 nop
return RTEMS_TOO_MANY;
20147a4: 10 80 00 19 b 2014808 <rtems_partition_create+0xec>
20147a8: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
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,
length / buffer_size, buffer_size );
20147ac: 92 10 00 1b mov %i3, %o1
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
20147b0: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
20147b4: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
20147b8: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
20147bc: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
20147c0: 40 00 5e b9 call 202c2a4 <.udiv>
20147c4: 90 10 00 1a mov %i2, %o0
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,
20147c8: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
20147cc: 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,
20147d0: 96 10 00 1b mov %i3, %o3
20147d4: b8 04 20 24 add %l0, 0x24, %i4
20147d8: 40 00 0c 47 call 20178f4 <_Chain_Initialize>
20147dc: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
20147e0: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
20147e4: a2 14 63 a4 or %l1, 0x3a4, %l1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20147e8: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
20147ec: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20147f0: 85 28 a0 02 sll %g2, 2, %g2
20147f4: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
20147f8: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
20147fc: 40 00 16 d2 call 201a344 <_Thread_Enable_dispatch>
2014800: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
2014804: 82 10 20 00 clr %g1
}
2014808: 81 c7 e0 08 ret
201480c: 91 e8 00 01 restore %g0, %g1, %o0
020071b4 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
20071b4: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Rate_monotonic_Control *)
20071b8: 11 00 80 74 sethi %hi(0x201d000), %o0
20071bc: 92 10 00 18 mov %i0, %o1
20071c0: 90 12 20 b4 or %o0, 0xb4, %o0
20071c4: 40 00 08 d3 call 2009510 <_Objects_Get>
20071c8: 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 ) {
20071cc: c2 07 bf fc ld [ %fp + -4 ], %g1
20071d0: 80 a0 60 00 cmp %g1, 0
20071d4: 12 80 00 65 bne 2007368 <rtems_rate_monotonic_period+0x1b4>
20071d8: ba 10 00 08 mov %o0, %i5
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
20071dc: 37 00 80 75 sethi %hi(0x201d400), %i3
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
20071e0: c4 02 20 40 ld [ %o0 + 0x40 ], %g2
20071e4: b6 16 e0 4c or %i3, 0x4c, %i3
20071e8: c2 06 e0 0c ld [ %i3 + 0xc ], %g1
20071ec: 80 a0 80 01 cmp %g2, %g1
20071f0: 02 80 00 06 be 2007208 <rtems_rate_monotonic_period+0x54>
20071f4: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
20071f8: 40 00 0c 44 call 200a308 <_Thread_Enable_dispatch>
20071fc: b0 10 20 17 mov 0x17, %i0
return RTEMS_NOT_OWNER_OF_RESOURCE;
2007200: 81 c7 e0 08 ret
2007204: 81 e8 00 00 restore
}
if ( length == RTEMS_PERIOD_STATUS ) {
2007208: 12 80 00 0d bne 200723c <rtems_rate_monotonic_period+0x88>
200720c: 01 00 00 00 nop
switch ( the_period->state ) {
2007210: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2007214: 80 a0 60 04 cmp %g1, 4
2007218: 18 80 00 05 bgu 200722c <rtems_rate_monotonic_period+0x78><== NEVER TAKEN
200721c: b0 10 20 00 clr %i0
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2007220: 05 00 80 6c sethi %hi(0x201b000), %g2
2007224: 84 10 a1 10 or %g2, 0x110, %g2 ! 201b110 <CSWTCH.2>
2007228: f0 08 80 01 ldub [ %g2 + %g1 ], %i0
case RATE_MONOTONIC_ACTIVE:
default: /* unreached -- only to remove warnings */
return_value = RTEMS_SUCCESSFUL;
break;
}
_Thread_Enable_dispatch();
200722c: 40 00 0c 37 call 200a308 <_Thread_Enable_dispatch>
2007230: 01 00 00 00 nop
return( return_value );
2007234: 81 c7 e0 08 ret
2007238: 81 e8 00 00 restore
}
_ISR_Disable( level );
200723c: 7f ff ee fd call 2002e30 <sparc_disable_interrupts>
2007240: 01 00 00 00 nop
2007244: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
2007248: f8 07 60 38 ld [ %i5 + 0x38 ], %i4
200724c: 80 a7 20 00 cmp %i4, 0
2007250: 12 80 00 15 bne 20072a4 <rtems_rate_monotonic_period+0xf0>
2007254: 80 a7 20 02 cmp %i4, 2
_ISR_Enable( level );
2007258: 7f ff ee fa call 2002e40 <sparc_enable_interrupts>
200725c: 01 00 00 00 nop
/*
* Baseline statistics information for the beginning of a period.
*/
_Rate_monotonic_Initiate_statistics( the_period );
2007260: 7f ff ff 7f call 200705c <_Rate_monotonic_Initiate_statistics>
2007264: 90 10 00 1d mov %i5, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2007268: 82 10 20 02 mov 2, %g1
200726c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007270: 03 00 80 1d sethi %hi(0x2007400), %g1
2007274: 82 10 62 24 or %g1, 0x224, %g1 ! 2007624 <_Rate_monotonic_Timeout>
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2007278: c0 27 60 18 clr [ %i5 + 0x18 ]
the_watchdog->routine = routine;
200727c: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
the_watchdog->id = id;
2007280: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
the_watchdog->user_data = user_data;
2007284: c0 27 60 34 clr [ %i5 + 0x34 ]
_Rate_monotonic_Timeout,
id,
NULL
);
the_period->next_length = length;
2007288: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200728c: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007290: 11 00 80 74 sethi %hi(0x201d000), %o0
2007294: 92 07 60 10 add %i5, 0x10, %o1
2007298: 40 00 0f fe call 200b290 <_Watchdog_Insert>
200729c: 90 12 22 e4 or %o0, 0x2e4, %o0
20072a0: 30 80 00 1b b,a 200730c <rtems_rate_monotonic_period+0x158>
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
20072a4: 12 80 00 1e bne 200731c <rtems_rate_monotonic_period+0x168>
20072a8: 80 a7 20 04 cmp %i4, 4
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
20072ac: 7f ff ff 86 call 20070c4 <_Rate_monotonic_Update_statistics>
20072b0: 90 10 00 1d mov %i5, %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;
20072b4: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
20072b8: f2 27 60 3c st %i1, [ %i5 + 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;
20072bc: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
20072c0: 7f ff ee e0 call 2002e40 <sparc_enable_interrupts>
20072c4: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
20072c8: d0 06 e0 0c ld [ %i3 + 0xc ], %o0
20072cc: c2 07 60 08 ld [ %i5 + 8 ], %g1
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
20072d0: 13 00 00 10 sethi %hi(0x4000), %o1
20072d4: 40 00 0e 2f call 200ab90 <_Thread_Set_state>
20072d8: c2 22 20 20 st %g1, [ %o0 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
20072dc: 7f ff ee d5 call 2002e30 <sparc_disable_interrupts>
20072e0: 01 00 00 00 nop
local_state = the_period->state;
20072e4: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
20072e8: f8 27 60 38 st %i4, [ %i5 + 0x38 ]
_ISR_Enable( level );
20072ec: 7f ff ee d5 call 2002e40 <sparc_enable_interrupts>
20072f0: 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 )
20072f4: 80 a6 a0 03 cmp %i2, 3
20072f8: 12 80 00 05 bne 200730c <rtems_rate_monotonic_period+0x158>
20072fc: 01 00 00 00 nop
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
2007300: d0 06 e0 0c ld [ %i3 + 0xc ], %o0
2007304: 40 00 0b 24 call 2009f94 <_Thread_Clear_state>
2007308: 13 00 00 10 sethi %hi(0x4000), %o1
_Thread_Enable_dispatch();
200730c: 40 00 0b ff call 200a308 <_Thread_Enable_dispatch>
2007310: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
2007314: 81 c7 e0 08 ret
2007318: 81 e8 00 00 restore
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
200731c: 12 bf ff b9 bne 2007200 <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
2007320: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
2007324: 7f ff ff 68 call 20070c4 <_Rate_monotonic_Update_statistics>
2007328: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
200732c: 7f ff ee c5 call 2002e40 <sparc_enable_interrupts>
2007330: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2007334: 82 10 20 02 mov 2, %g1
2007338: 92 07 60 10 add %i5, 0x10, %o1
200733c: 11 00 80 74 sethi %hi(0x201d000), %o0
2007340: 90 12 22 e4 or %o0, 0x2e4, %o0 ! 201d2e4 <_Watchdog_Ticks_chain>
2007344: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
2007348: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200734c: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007350: 40 00 0f d0 call 200b290 <_Watchdog_Insert>
2007354: b0 10 20 06 mov 6, %i0
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2007358: 40 00 0b ec call 200a308 <_Thread_Enable_dispatch>
200735c: 01 00 00 00 nop
return RTEMS_TIMEOUT;
2007360: 81 c7 e0 08 ret
2007364: 81 e8 00 00 restore
#endif
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2007368: b0 10 20 04 mov 4, %i0
}
200736c: 81 c7 e0 08 ret
2007370: 81 e8 00 00 restore
02007374 <rtems_rate_monotonic_report_statistics_with_plugin>:
*/
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
2007374: 9d e3 bf 38 save %sp, -200, %sp
rtems_id id;
rtems_rate_monotonic_period_statistics the_stats;
rtems_rate_monotonic_period_status the_status;
char name[5];
if ( !print )
2007378: 80 a6 60 00 cmp %i1, 0
200737c: 02 80 00 75 be 2007550 <rtems_rate_monotonic_report_statistics_with_plugin+0x1dc><== NEVER TAKEN
2007380: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
2007384: 13 00 80 6c sethi %hi(0x201b000), %o1
2007388: 9f c6 40 00 call %i1
200738c: 92 12 61 18 or %o1, 0x118, %o1 ! 201b118 <CSWTCH.2+0x8>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
2007390: 90 10 00 18 mov %i0, %o0
2007394: 13 00 80 6c sethi %hi(0x201b000), %o1
2007398: 9f c6 40 00 call %i1
200739c: 92 12 61 38 or %o1, 0x138, %o1 ! 201b138 <CSWTCH.2+0x28>
(*print)( context, "--- Wall times are in seconds ---\n" );
20073a0: 90 10 00 18 mov %i0, %o0
20073a4: 13 00 80 6c sethi %hi(0x201b000), %o1
20073a8: 9f c6 40 00 call %i1
20073ac: 92 12 61 60 or %o1, 0x160, %o1 ! 201b160 <CSWTCH.2+0x50>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
20073b0: 90 10 00 18 mov %i0, %o0
20073b4: 13 00 80 6c sethi %hi(0x201b000), %o1
20073b8: 9f c6 40 00 call %i1
20073bc: 92 12 61 88 or %o1, 0x188, %o1 ! 201b188 <CSWTCH.2+0x78>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
20073c0: 90 10 00 18 mov %i0, %o0
20073c4: 13 00 80 6c sethi %hi(0x201b000), %o1
20073c8: 9f c6 40 00 call %i1
20073cc: 92 12 61 d8 or %o1, 0x1d8, %o1 ! 201b1d8 <CSWTCH.2+0xc8>
/*
* 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 ;
20073d0: 03 00 80 74 sethi %hi(0x201d000), %g1
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
20073d4: 21 00 80 6c sethi %hi(0x201b000), %l0
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,
20073d8: 35 00 80 6c sethi %hi(0x201b000), %i2
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);
(*print)( context,
20073dc: 37 00 80 6c sethi %hi(0x201b000), %i3
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
20073e0: 39 00 80 69 sethi %hi(0x201a400), %i4
/*
* 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 ;
20073e4: fa 00 60 bc ld [ %g1 + 0xbc ], %i5
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
20073e8: a0 14 22 28 or %l0, 0x228, %l0
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,
20073ec: b4 16 a2 40 or %i2, 0x240, %i2
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);
(*print)( context,
20073f0: b6 16 e2 60 or %i3, 0x260, %i3
/*
* 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 ;
20073f4: 10 80 00 52 b 200753c <rtems_rate_monotonic_report_statistics_with_plugin+0x1c8>
20073f8: b8 17 20 28 or %i4, 0x28, %i4
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
20073fc: 40 00 17 7c call 200d1ec <rtems_rate_monotonic_get_statistics>
2007400: 92 07 bf a0 add %fp, -96, %o1
if ( status != RTEMS_SUCCESSFUL )
2007404: 80 a2 20 00 cmp %o0, 0
2007408: 32 80 00 4d bne,a 200753c <rtems_rate_monotonic_report_statistics_with_plugin+0x1c8>
200740c: ba 07 60 01 inc %i5
#if defined(RTEMS_DEBUG)
status = rtems_rate_monotonic_get_status( id, &the_status );
if ( status != RTEMS_SUCCESSFUL )
continue;
#else
(void) rtems_rate_monotonic_get_status( id, &the_status );
2007410: 92 07 bf d8 add %fp, -40, %o1
2007414: 40 00 17 a3 call 200d2a0 <rtems_rate_monotonic_get_status>
2007418: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
200741c: d0 07 bf d8 ld [ %fp + -40 ], %o0
2007420: 92 10 20 05 mov 5, %o1
2007424: 40 00 00 af call 20076e0 <rtems_object_get_name>
2007428: 94 07 bf f8 add %fp, -8, %o2
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
200742c: d8 1f bf a0 ldd [ %fp + -96 ], %o4
2007430: 92 10 00 10 mov %l0, %o1
2007434: 90 10 00 18 mov %i0, %o0
2007438: 94 10 00 1d mov %i5, %o2
200743c: 9f c6 40 00 call %i1
2007440: 96 07 bf f8 add %fp, -8, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
2007444: d2 07 bf a0 ld [ %fp + -96 ], %o1
2007448: 80 a2 60 00 cmp %o1, 0
200744c: 12 80 00 07 bne 2007468 <rtems_rate_monotonic_report_statistics_with_plugin+0xf4>
2007450: 94 07 bf f0 add %fp, -16, %o2
(*print)( context, "\n" );
2007454: 90 10 00 18 mov %i0, %o0
2007458: 9f c6 40 00 call %i1
200745c: 92 10 00 1c mov %i4, %o1
continue;
2007460: 10 80 00 37 b 200753c <rtems_rate_monotonic_report_statistics_with_plugin+0x1c8>
2007464: ba 07 60 01 inc %i5
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 );
2007468: 40 00 0e 6b call 200ae14 <_Timespec_Divide_by_integer>
200746c: 90 07 bf b8 add %fp, -72, %o0
(*print)( context,
2007470: d0 07 bf ac ld [ %fp + -84 ], %o0
2007474: 40 00 43 be call 201836c <.div>
2007478: 92 10 23 e8 mov 0x3e8, %o1
200747c: a6 10 00 08 mov %o0, %l3
2007480: d0 07 bf b4 ld [ %fp + -76 ], %o0
2007484: 40 00 43 ba call 201836c <.div>
2007488: 92 10 23 e8 mov 0x3e8, %o1
200748c: c2 07 bf f0 ld [ %fp + -16 ], %g1
2007490: a2 10 00 08 mov %o0, %l1
2007494: d0 07 bf f4 ld [ %fp + -12 ], %o0
2007498: e8 07 bf a8 ld [ %fp + -88 ], %l4
200749c: e4 07 bf b0 ld [ %fp + -80 ], %l2
20074a0: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
20074a4: 40 00 43 b2 call 201836c <.div>
20074a8: 92 10 23 e8 mov 0x3e8, %o1
20074ac: 96 10 00 13 mov %l3, %o3
20074b0: 98 10 00 12 mov %l2, %o4
20074b4: 9a 10 00 11 mov %l1, %o5
20074b8: 94 10 00 14 mov %l4, %o2
20074bc: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
20074c0: 92 10 00 1a mov %i2, %o1
20074c4: 9f c6 40 00 call %i1
20074c8: 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);
20074cc: d2 07 bf a0 ld [ %fp + -96 ], %o1
20074d0: 94 07 bf f0 add %fp, -16, %o2
20074d4: 40 00 0e 50 call 200ae14 <_Timespec_Divide_by_integer>
20074d8: 90 07 bf d0 add %fp, -48, %o0
(*print)( context,
20074dc: d0 07 bf c4 ld [ %fp + -60 ], %o0
20074e0: 40 00 43 a3 call 201836c <.div>
20074e4: 92 10 23 e8 mov 0x3e8, %o1
20074e8: a6 10 00 08 mov %o0, %l3
20074ec: d0 07 bf cc ld [ %fp + -52 ], %o0
20074f0: 40 00 43 9f call 201836c <.div>
20074f4: 92 10 23 e8 mov 0x3e8, %o1
20074f8: c2 07 bf f0 ld [ %fp + -16 ], %g1
20074fc: a2 10 00 08 mov %o0, %l1
2007500: d0 07 bf f4 ld [ %fp + -12 ], %o0
2007504: e8 07 bf c0 ld [ %fp + -64 ], %l4
2007508: e4 07 bf c8 ld [ %fp + -56 ], %l2
200750c: 92 10 23 e8 mov 0x3e8, %o1
2007510: 40 00 43 97 call 201836c <.div>
2007514: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2007518: 92 10 00 1b mov %i3, %o1
200751c: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
2007520: 94 10 00 14 mov %l4, %o2
2007524: 90 10 00 18 mov %i0, %o0
2007528: 96 10 00 13 mov %l3, %o3
200752c: 98 10 00 12 mov %l2, %o4
2007530: 9f c6 40 00 call %i1
2007534: 9a 10 00 11 mov %l1, %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 ;
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2007538: ba 07 60 01 inc %i5
/*
* 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 ;
200753c: 03 00 80 74 sethi %hi(0x201d000), %g1
/*
* 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 ;
2007540: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 ! 201d0c0 <_Rate_monotonic_Information+0xc>
2007544: 80 a7 40 01 cmp %i5, %g1
2007548: 08 bf ff ad bleu 20073fc <rtems_rate_monotonic_report_statistics_with_plugin+0x88>
200754c: 90 10 00 1d mov %i5, %o0
2007550: 81 c7 e0 08 ret
2007554: 81 e8 00 00 restore
02015c8c <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
2015c8c: 9d e3 bf 98 save %sp, -104, %sp
2015c90: 90 10 00 18 mov %i0, %o0
register Thread_Control *the_thread;
Objects_Locations location;
RTEMS_API_Control *api;
ASR_Information *asr;
if ( !signal_set )
2015c94: 80 a6 60 00 cmp %i1, 0
2015c98: 02 80 00 2e be 2015d50 <rtems_signal_send+0xc4>
2015c9c: b0 10 20 0a mov 0xa, %i0
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2015ca0: 40 00 11 b5 call 201a374 <_Thread_Get>
2015ca4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2015ca8: c2 07 bf fc ld [ %fp + -4 ], %g1
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2015cac: b8 10 00 08 mov %o0, %i4
switch ( location ) {
2015cb0: 80 a0 60 00 cmp %g1, 0
2015cb4: 12 80 00 27 bne 2015d50 <rtems_signal_send+0xc4>
2015cb8: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
2015cbc: fa 02 21 58 ld [ %o0 + 0x158 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
2015cc0: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2015cc4: 80 a0 60 00 cmp %g1, 0
2015cc8: 02 80 00 24 be 2015d58 <rtems_signal_send+0xcc>
2015ccc: 01 00 00 00 nop
if ( asr->is_enabled ) {
2015cd0: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2015cd4: 80 a0 60 00 cmp %g1, 0
2015cd8: 02 80 00 15 be 2015d2c <rtems_signal_send+0xa0>
2015cdc: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2015ce0: 7f ff e7 d1 call 200fc24 <sparc_disable_interrupts>
2015ce4: 01 00 00 00 nop
*signal_set |= signals;
2015ce8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2015cec: b2 10 40 19 or %g1, %i1, %i1
2015cf0: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2015cf4: 7f ff e7 d0 call 200fc34 <sparc_enable_interrupts>
2015cf8: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
2015cfc: 03 00 80 f0 sethi %hi(0x203c000), %g1
2015d00: 82 10 63 c4 or %g1, 0x3c4, %g1 ! 203c3c4 <_Per_CPU_Information>
2015d04: c4 00 60 08 ld [ %g1 + 8 ], %g2
2015d08: 80 a0 a0 00 cmp %g2, 0
2015d0c: 02 80 00 0f be 2015d48 <rtems_signal_send+0xbc>
2015d10: 01 00 00 00 nop
2015d14: c4 00 60 0c ld [ %g1 + 0xc ], %g2
2015d18: 80 a7 00 02 cmp %i4, %g2
2015d1c: 12 80 00 0b bne 2015d48 <rtems_signal_send+0xbc> <== NEVER TAKEN
2015d20: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
2015d24: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
2015d28: 30 80 00 08 b,a 2015d48 <rtems_signal_send+0xbc>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2015d2c: 7f ff e7 be call 200fc24 <sparc_disable_interrupts>
2015d30: 01 00 00 00 nop
*signal_set |= signals;
2015d34: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2015d38: b2 10 40 19 or %g1, %i1, %i1
2015d3c: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
2015d40: 7f ff e7 bd call 200fc34 <sparc_enable_interrupts>
2015d44: 01 00 00 00 nop
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
2015d48: 40 00 11 7f call 201a344 <_Thread_Enable_dispatch>
2015d4c: b0 10 20 00 clr %i0 ! 0 <PROM_START>
return RTEMS_SUCCESSFUL;
2015d50: 81 c7 e0 08 ret
2015d54: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
2015d58: 40 00 11 7b call 201a344 <_Thread_Enable_dispatch>
2015d5c: b0 10 20 0b mov 0xb, %i0
return RTEMS_NOT_DEFINED;
2015d60: 81 c7 e0 08 ret
2015d64: 81 e8 00 00 restore
0200d690 <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
200d690: 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 )
200d694: 80 a6 a0 00 cmp %i2, 0
200d698: 02 80 00 5a be 200d800 <rtems_task_mode+0x170>
200d69c: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
200d6a0: 03 00 80 6d sethi %hi(0x201b400), %g1
200d6a4: f8 00 61 d8 ld [ %g1 + 0x1d8 ], %i4 ! 201b5d8 <_Per_CPU_Information+0xc>
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200d6a8: c2 0f 20 74 ldub [ %i4 + 0x74 ], %g1
if ( !previous_mode_set )
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
api = executing->API_Extensions[ THREAD_API_RTEMS ];
200d6ac: fa 07 21 58 ld [ %i4 + 0x158 ], %i5
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200d6b0: 80 a0 00 01 cmp %g0, %g1
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200d6b4: c2 07 20 7c ld [ %i4 + 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;
200d6b8: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200d6bc: 80 a0 60 00 cmp %g1, 0
200d6c0: 02 80 00 03 be 200d6cc <rtems_task_mode+0x3c>
200d6c4: b7 2e e0 08 sll %i3, 8, %i3
old_mode |= RTEMS_NO_TIMESLICE;
else
old_mode |= RTEMS_TIMESLICE;
200d6c8: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200d6cc: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
200d6d0: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200d6d4: 7f ff f1 f5 call 2009ea8 <_CPU_ISR_Get_level>
200d6d8: a0 60 3f ff subx %g0, -1, %l0
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;
200d6dc: a1 2c 20 0a sll %l0, 0xa, %l0
200d6e0: a0 14 00 08 or %l0, %o0, %l0
old_mode |= _ISR_Get_level();
200d6e4: b6 14 00 1b or %l0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200d6e8: 80 8e 61 00 btst 0x100, %i1
200d6ec: 02 80 00 06 be 200d704 <rtems_task_mode+0x74>
200d6f0: f6 26 80 00 st %i3, [ %i2 ]
*/
RTEMS_INLINE_ROUTINE bool _Modes_Is_preempt (
Modes_Control mode_set
)
{
return (mode_set & RTEMS_PREEMPT_MASK) == RTEMS_PREEMPT;
200d6f4: 82 0e 21 00 and %i0, 0x100, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
200d6f8: 80 a0 00 01 cmp %g0, %g1
200d6fc: 82 60 3f ff subx %g0, -1, %g1
200d700: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
200d704: 80 8e 62 00 btst 0x200, %i1
200d708: 02 80 00 0b be 200d734 <rtems_task_mode+0xa4>
200d70c: 80 8e 60 0f btst 0xf, %i1
if ( _Modes_Is_timeslice(mode_set) ) {
200d710: 80 8e 22 00 btst 0x200, %i0
200d714: 22 80 00 07 be,a 200d730 <rtems_task_mode+0xa0>
200d718: c0 27 20 7c clr [ %i4 + 0x7c ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
200d71c: 82 10 20 01 mov 1, %g1
200d720: c2 27 20 7c st %g1, [ %i4 + 0x7c ]
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200d724: 03 00 80 6c sethi %hi(0x201b000), %g1
200d728: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201b304 <_Thread_Ticks_per_timeslice>
200d72c: c2 27 20 78 st %g1, [ %i4 + 0x78 ]
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200d730: 80 8e 60 0f btst 0xf, %i1
200d734: 02 80 00 06 be 200d74c <rtems_task_mode+0xbc>
200d738: 80 8e 64 00 btst 0x400, %i1
*/
RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level (
Modes_Control mode_set
)
{
return ( mode_set & RTEMS_INTERRUPT_MASK );
200d73c: 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 ) );
200d740: 7f ff d2 77 call 200211c <sparc_enable_interrupts>
200d744: 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 ) {
200d748: 80 8e 64 00 btst 0x400, %i1
200d74c: 02 80 00 14 be 200d79c <rtems_task_mode+0x10c>
200d750: 88 10 20 00 clr %g4
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200d754: c4 0f 60 08 ldub [ %i5 + 8 ], %g2
*/
RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled (
Modes_Control mode_set
)
{
return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR;
200d758: 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(
200d75c: 80 a0 00 18 cmp %g0, %i0
200d760: 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 ) {
200d764: 80 a0 40 02 cmp %g1, %g2
200d768: 22 80 00 0e be,a 200d7a0 <rtems_task_mode+0x110>
200d76c: 03 00 80 6d sethi %hi(0x201b400), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
200d770: 7f ff d2 67 call 200210c <sparc_disable_interrupts>
200d774: c2 2f 60 08 stb %g1, [ %i5 + 8 ]
_signals = information->signals_pending;
200d778: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
information->signals_pending = information->signals_posted;
200d77c: c4 07 60 14 ld [ %i5 + 0x14 ], %g2
information->signals_posted = _signals;
200d780: c2 27 60 14 st %g1, [ %i5 + 0x14 ]
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
_signals = information->signals_pending;
information->signals_pending = information->signals_posted;
200d784: c4 27 60 18 st %g2, [ %i5 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
200d788: 7f ff d2 65 call 200211c <sparc_enable_interrupts>
200d78c: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
200d790: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
/*
* This is specific to the RTEMS API
*/
is_asr_enabled = false;
needs_asr_dispatching = false;
200d794: 80 a0 00 01 cmp %g0, %g1
200d798: 88 40 20 00 addx %g0, 0, %g4
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
200d79c: 03 00 80 6d sethi %hi(0x201b400), %g1
200d7a0: c4 00 60 fc ld [ %g1 + 0xfc ], %g2 ! 201b4fc <_System_state_Current>
200d7a4: 80 a0 a0 03 cmp %g2, 3
200d7a8: 12 80 00 16 bne 200d800 <rtems_task_mode+0x170>
200d7ac: 82 10 20 00 clr %g1
bool are_signals_pending
)
{
Thread_Control *executing;
executing = _Thread_Executing;
200d7b0: 07 00 80 6d sethi %hi(0x201b400), %g3
if ( are_signals_pending ||
200d7b4: 80 89 20 ff btst 0xff, %g4
bool are_signals_pending
)
{
Thread_Control *executing;
executing = _Thread_Executing;
200d7b8: 86 10 e1 cc or %g3, 0x1cc, %g3
if ( are_signals_pending ||
200d7bc: 12 80 00 0a bne 200d7e4 <rtems_task_mode+0x154>
200d7c0: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
200d7c4: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
200d7c8: 80 a0 80 03 cmp %g2, %g3
200d7cc: 02 80 00 0d be 200d800 <rtems_task_mode+0x170>
200d7d0: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
200d7d4: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200d7d8: 80 a0 a0 00 cmp %g2, 0
200d7dc: 02 80 00 09 be 200d800 <rtems_task_mode+0x170> <== NEVER TAKEN
200d7e0: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
200d7e4: 84 10 20 01 mov 1, %g2 ! 1 <PROM_START+0x1>
200d7e8: 03 00 80 6d sethi %hi(0x201b400), %g1
200d7ec: 82 10 61 cc or %g1, 0x1cc, %g1 ! 201b5cc <_Per_CPU_Information>
200d7f0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
200d7f4: 7f ff ec 67 call 2008990 <_Thread_Dispatch>
200d7f8: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
200d7fc: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
200d800: 81 c7 e0 08 ret
200d804: 91 e8 00 01 restore %g0, %g1, %o0
0200a9b4 <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200a9b4: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200a9b8: 80 a6 60 00 cmp %i1, 0
200a9bc: 02 80 00 07 be 200a9d8 <rtems_task_set_priority+0x24>
200a9c0: 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 ) );
200a9c4: 03 00 80 61 sethi %hi(0x2018400), %g1
200a9c8: c2 08 61 8c ldub [ %g1 + 0x18c ], %g1 ! 201858c <rtems_maximum_priority>
200a9cc: 80 a6 40 01 cmp %i1, %g1
200a9d0: 18 80 00 1c bgu 200aa40 <rtems_task_set_priority+0x8c>
200a9d4: b0 10 20 13 mov 0x13, %i0
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200a9d8: 80 a6 a0 00 cmp %i2, 0
200a9dc: 02 80 00 19 be 200aa40 <rtems_task_set_priority+0x8c>
200a9e0: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200a9e4: 40 00 09 28 call 200ce84 <_Thread_Get>
200a9e8: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200a9ec: c2 07 bf fc ld [ %fp + -4 ], %g1
200a9f0: 80 a0 60 00 cmp %g1, 0
200a9f4: 12 80 00 13 bne 200aa40 <rtems_task_set_priority+0x8c>
200a9f8: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200a9fc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200aa00: 80 a6 60 00 cmp %i1, 0
200aa04: 02 80 00 0d be 200aa38 <rtems_task_set_priority+0x84>
200aa08: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200aa0c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200aa10: 80 a0 60 00 cmp %g1, 0
200aa14: 02 80 00 06 be 200aa2c <rtems_task_set_priority+0x78>
200aa18: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200aa1c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200aa20: 80 a0 40 19 cmp %g1, %i1
200aa24: 08 80 00 05 bleu 200aa38 <rtems_task_set_priority+0x84> <== ALWAYS TAKEN
200aa28: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200aa2c: 92 10 00 19 mov %i1, %o1
200aa30: 40 00 07 e6 call 200c9c8 <_Thread_Change_priority>
200aa34: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200aa38: 40 00 09 07 call 200ce54 <_Thread_Enable_dispatch>
200aa3c: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
200aa40: 81 c7 e0 08 ret
200aa44: 81 e8 00 00 restore
02016694 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2016694: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2016698: 11 00 80 f1 sethi %hi(0x203c400), %o0
201669c: 92 10 00 18 mov %i0, %o1
20166a0: 90 12 20 54 or %o0, 0x54, %o0
20166a4: 40 00 0b aa call 201954c <_Objects_Get>
20166a8: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
20166ac: c2 07 bf fc ld [ %fp + -4 ], %g1
20166b0: 80 a0 60 00 cmp %g1, 0
20166b4: 12 80 00 0c bne 20166e4 <rtems_timer_cancel+0x50>
20166b8: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
20166bc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
20166c0: 80 a0 60 04 cmp %g1, 4
20166c4: 02 80 00 04 be 20166d4 <rtems_timer_cancel+0x40> <== NEVER TAKEN
20166c8: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
20166cc: 40 00 13 a7 call 201b568 <_Watchdog_Remove>
20166d0: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
20166d4: 40 00 0f 1c call 201a344 <_Thread_Enable_dispatch>
20166d8: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
20166dc: 81 c7 e0 08 ret
20166e0: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20166e4: 81 c7 e0 08 ret
20166e8: 91 e8 20 04 restore %g0, 4, %o0
02016b90 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2016b90: 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;
2016b94: 03 00 80 f1 sethi %hi(0x203c400), %g1
2016b98: f8 00 60 94 ld [ %g1 + 0x94 ], %i4 ! 203c494 <_Timer_server>
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2016b9c: ba 10 00 18 mov %i0, %i5
Timer_Control *the_timer;
Objects_Locations location;
rtems_interval seconds;
Timer_server_Control *timer_server = _Timer_server;
if ( !timer_server )
2016ba0: 80 a7 20 00 cmp %i4, 0
2016ba4: 02 80 00 32 be 2016c6c <rtems_timer_server_fire_when+0xdc>
2016ba8: b0 10 20 0e mov 0xe, %i0
return RTEMS_INCORRECT_STATE;
if ( !_TOD_Is_set )
2016bac: 03 00 80 f0 sethi %hi(0x203c000), %g1
2016bb0: c2 08 61 a0 ldub [ %g1 + 0x1a0 ], %g1 ! 203c1a0 <_TOD_Is_set>
2016bb4: 80 a0 60 00 cmp %g1, 0
2016bb8: 02 80 00 2d be 2016c6c <rtems_timer_server_fire_when+0xdc><== NEVER TAKEN
2016bbc: b0 10 20 0b mov 0xb, %i0
return RTEMS_NOT_DEFINED;
if ( !routine )
2016bc0: 80 a6 a0 00 cmp %i2, 0
2016bc4: 02 80 00 2a be 2016c6c <rtems_timer_server_fire_when+0xdc>
2016bc8: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
2016bcc: 90 10 00 19 mov %i1, %o0
2016bd0: 7f ff f4 11 call 2013c14 <_TOD_Validate>
2016bd4: b0 10 20 14 mov 0x14, %i0
2016bd8: 80 8a 20 ff btst 0xff, %o0
2016bdc: 02 80 00 27 be 2016c78 <rtems_timer_server_fire_when+0xe8>
2016be0: 01 00 00 00 nop
return RTEMS_INVALID_CLOCK;
seconds = _TOD_To_seconds( wall_time );
2016be4: 7f ff f3 d8 call 2013b44 <_TOD_To_seconds>
2016be8: 90 10 00 19 mov %i1, %o0
if ( seconds <= _TOD_Seconds_since_epoch() )
2016bec: 21 00 80 f0 sethi %hi(0x203c000), %l0
2016bf0: c2 04 22 1c ld [ %l0 + 0x21c ], %g1 ! 203c21c <_TOD_Now>
2016bf4: 80 a2 00 01 cmp %o0, %g1
2016bf8: 08 80 00 1d bleu 2016c6c <rtems_timer_server_fire_when+0xdc>
2016bfc: b2 10 00 08 mov %o0, %i1
2016c00: 11 00 80 f1 sethi %hi(0x203c400), %o0
2016c04: 92 10 00 1d mov %i5, %o1
2016c08: 90 12 20 54 or %o0, 0x54, %o0
2016c0c: 40 00 0a 50 call 201954c <_Objects_Get>
2016c10: 94 07 bf fc add %fp, -4, %o2
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2016c14: c2 07 bf fc ld [ %fp + -4 ], %g1
2016c18: 80 a0 60 00 cmp %g1, 0
2016c1c: 12 80 00 16 bne 2016c74 <rtems_timer_server_fire_when+0xe4>
2016c20: b0 10 00 08 mov %o0, %i0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
2016c24: 40 00 12 51 call 201b568 <_Watchdog_Remove>
2016c28: 90 02 20 10 add %o0, 0x10, %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
2016c2c: 82 10 20 03 mov 3, %g1
2016c30: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2016c34: c2 04 22 1c ld [ %l0 + 0x21c ], %g1
(*timer_server->schedule_operation)( timer_server, the_timer );
2016c38: 92 10 00 18 mov %i0, %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();
2016c3c: b2 26 40 01 sub %i1, %g1, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
2016c40: c2 07 20 04 ld [ %i4 + 4 ], %g1
2016c44: 90 10 00 1c mov %i4, %o0
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2016c48: c0 26 20 18 clr [ %i0 + 0x18 ]
the_watchdog->routine = routine;
2016c4c: f4 26 20 2c st %i2, [ %i0 + 0x2c ]
the_watchdog->id = id;
2016c50: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
the_watchdog->user_data = user_data;
2016c54: f6 26 20 34 st %i3, [ %i0 + 0x34 ]
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();
2016c58: f2 26 20 1c st %i1, [ %i0 + 0x1c ]
(*timer_server->schedule_operation)( timer_server, the_timer );
2016c5c: 9f c0 40 00 call %g1
2016c60: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
2016c64: 40 00 0d b8 call 201a344 <_Thread_Enable_dispatch>
2016c68: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2016c6c: 81 c7 e0 08 ret
2016c70: 81 e8 00 00 restore
#endif
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2016c74: b0 10 20 04 mov 4, %i0
}
2016c78: 81 c7 e0 08 ret
2016c7c: 81 e8 00 00 restore