RTEMS 4.11Annotated Report
Mon Apr 4 14:52:58 2011
02006c54 <_API_extensions_Run_postdriver>:
*
* _API_extensions_Run_postdriver
*/
void _API_extensions_Run_postdriver( void )
{
2006c54: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2006c58: 39 00 80 56 sethi %hi(0x2015800), %i4
2006c5c: fa 07 21 24 ld [ %i4 + 0x124 ], %i5 ! 2015924 <_API_extensions_List>
2006c60: b8 17 21 24 or %i4, 0x124, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2006c64: b8 07 20 04 add %i4, 4, %i4
2006c68: 80 a7 40 1c cmp %i5, %i4
2006c6c: 02 80 00 09 be 2006c90 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
2006c70: 01 00 00 00 nop
* Currently all APIs configure this hook so it is always non-NULL.
*/
#if defined(FUNCTIONALITY_NOT_CURRENTLY_USED_BY_ANY_API)
if ( the_extension->postdriver_hook )
#endif
(*the_extension->postdriver_hook)();
2006c74: c2 07 60 08 ld [ %i5 + 8 ], %g1
2006c78: 9f c0 40 00 call %g1
2006c7c: 01 00 00 00 nop
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
!_Chain_Is_tail( &_API_extensions_List, the_node ) ;
the_node = the_node->next ) {
2006c80: fa 07 40 00 ld [ %i5 ], %i5
void _API_extensions_Run_postdriver( void )
{
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2006c84: 80 a7 40 1c cmp %i5, %i4
2006c88: 32 bf ff fc bne,a 2006c78 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN
2006c8c: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2006c90: 81 c7 e0 08 ret
2006c94: 81 e8 00 00 restore
02006c98 <_API_extensions_Run_postswitch>:
*
* _API_extensions_Run_postswitch
*/
void _API_extensions_Run_postswitch( void )
{
2006c98: 9d e3 bf a0 save %sp, -96, %sp
2006c9c: 39 00 80 56 sethi %hi(0x2015800), %i4
2006ca0: fa 07 21 24 ld [ %i4 + 0x124 ], %i5 ! 2015924 <_API_extensions_List>
2006ca4: b8 17 21 24 or %i4, 0x124, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2006ca8: b8 07 20 04 add %i4, 4, %i4
2006cac: 80 a7 40 1c cmp %i5, %i4
2006cb0: 02 80 00 0a be 2006cd8 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN
2006cb4: 37 00 80 56 sethi %hi(0x2015800), %i3
2006cb8: b6 16 e1 5c or %i3, 0x15c, %i3 ! 201595c <_Per_CPU_Information>
!_Chain_Is_tail( &_API_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (API_extensions_Control *) the_node;
(*the_extension->postswitch_hook)( _Thread_Executing );
2006cbc: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2006cc0: 9f c0 40 00 call %g1
2006cc4: d0 06 e0 0c ld [ %i3 + 0xc ], %o0
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
!_Chain_Is_tail( &_API_extensions_List, the_node ) ;
the_node = the_node->next ) {
2006cc8: fa 07 40 00 ld [ %i5 ], %i5
void _API_extensions_Run_postswitch( void )
{
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2006ccc: 80 a7 40 1c cmp %i5, %i4
2006cd0: 32 bf ff fc bne,a 2006cc0 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN
2006cd4: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED
2006cd8: 81 c7 e0 08 ret
2006cdc: 81 e8 00 00 restore
02010a58 <_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
)
{
2010a58: 9d e3 bf a0 save %sp, -96, %sp
size_t message_buffering_required;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
the_message_queue->number_of_pending_messages = 0;
2010a5c: c0 26 20 48 clr [ %i0 + 0x48 ]
)
{
size_t message_buffering_required;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
2010a60: f4 26 20 44 st %i2, [ %i0 + 0x44 ]
the_message_queue->number_of_pending_messages = 0;
the_message_queue->maximum_message_size = maximum_message_size;
2010a64: 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)) {
2010a68: 80 8e e0 03 btst 3, %i3
2010a6c: 02 80 00 0a be 2010a94 <_CORE_message_queue_Initialize+0x3c>
2010a70: a0 10 00 1b mov %i3, %l0
allocated_message_size += sizeof(uint32_t);
2010a74: a0 06 e0 04 add %i3, 4, %l0
allocated_message_size &= ~(sizeof(uint32_t) - 1);
2010a78: a0 0c 3f fc and %l0, -4, %l0
}
if (allocated_message_size < maximum_message_size)
2010a7c: 80 a6 c0 10 cmp %i3, %l0
2010a80: 08 80 00 05 bleu 2010a94 <_CORE_message_queue_Initialize+0x3c><== ALWAYS TAKEN
2010a84: ba 10 20 00 clr %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010a88: b0 0f 60 01 and %i5, 1, %i0
2010a8c: 81 c7 e0 08 ret
2010a90: 81 e8 00 00 restore
/*
* 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));
2010a94: b8 04 20 10 add %l0, 0x10, %i4
/*
* 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 *
2010a98: 92 10 00 1a mov %i2, %o1
2010a9c: 90 10 00 1c mov %i4, %o0
2010aa0: 40 00 3f 25 call 2020734 <.umul>
2010aa4: ba 10 20 00 clr %i5
(allocated_message_size + sizeof(CORE_message_queue_Buffer_control));
if (message_buffering_required < allocated_message_size)
2010aa8: 80 a2 00 10 cmp %o0, %l0
2010aac: 2a bf ff f8 bcs,a 2010a8c <_CORE_message_queue_Initialize+0x34><== NEVER TAKEN
2010ab0: b0 0f 60 01 and %i5, 1, %i0
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
_Workspace_Allocate( message_buffering_required );
2010ab4: 40 00 0c c0 call 2013db4 <_Workspace_Allocate>
2010ab8: 01 00 00 00 nop
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
2010abc: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
2010ac0: 80 a2 20 00 cmp %o0, 0
2010ac4: 02 bf ff f1 be 2010a88 <_CORE_message_queue_Initialize+0x30>
2010ac8: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
2010acc: 90 06 20 60 add %i0, 0x60, %o0
2010ad0: 94 10 00 1a mov %i2, %o2
2010ad4: 40 00 14 cc call 2015e04 <_Chain_Initialize>
2010ad8: 96 10 00 1c mov %i4, %o3
allocated_message_size + sizeof( CORE_message_queue_Buffer_control )
);
_Chain_Initialize_empty( &the_message_queue->Pending_messages );
_Thread_queue_Initialize(
2010adc: c4 06 40 00 ld [ %i1 ], %g2
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 );
2010ae0: 82 06 20 50 add %i0, 0x50, %g1
2010ae4: 84 18 a0 01 xor %g2, 1, %g2
2010ae8: 80 a0 00 02 cmp %g0, %g2
2010aec: 84 06 20 54 add %i0, 0x54, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
2010af0: c2 26 20 58 st %g1, [ %i0 + 0x58 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2010af4: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
2010af8: 90 10 00 18 mov %i0, %o0
head->previous = NULL;
2010afc: c0 26 20 54 clr [ %i0 + 0x54 ]
2010b00: 92 60 3f ff subx %g0, -1, %o1
2010b04: 94 10 20 80 mov 0x80, %o2
2010b08: 96 10 20 06 mov 6, %o3
2010b0c: 40 00 09 fb call 20132f8 <_Thread_queue_Initialize>
2010b10: ba 10 20 01 mov 1, %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010b14: b0 0f 60 01 and %i5, 1, %i0
2010b18: 81 c7 e0 08 ret
2010b1c: 81 e8 00 00 restore
02006fa4 <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
2006fa4: 9d e3 bf a0 save %sp, -96, %sp
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
2006fa8: 3b 00 80 55 sethi %hi(0x2015400), %i5
2006fac: c2 07 63 30 ld [ %i5 + 0x330 ], %g1 ! 2015730 <_Thread_Dispatch_disable_level>
2006fb0: 80 a0 60 00 cmp %g1, 0
2006fb4: 02 80 00 05 be 2006fc8 <_CORE_mutex_Seize+0x24>
2006fb8: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
2006fbc: 80 a6 a0 00 cmp %i2, 0
2006fc0: 12 80 00 1a bne 2007028 <_CORE_mutex_Seize+0x84> <== ALWAYS TAKEN
2006fc4: 03 00 80 56 sethi %hi(0x2015800), %g1
2006fc8: 90 10 00 18 mov %i0, %o0
2006fcc: 40 00 13 f1 call 200bf90 <_CORE_mutex_Seize_interrupt_trylock>
2006fd0: 92 07 a0 54 add %fp, 0x54, %o1
2006fd4: 80 a2 20 00 cmp %o0, 0
2006fd8: 02 80 00 12 be 2007020 <_CORE_mutex_Seize+0x7c>
2006fdc: 80 a6 a0 00 cmp %i2, 0
2006fe0: 02 80 00 1a be 2007048 <_CORE_mutex_Seize+0xa4>
2006fe4: 01 00 00 00 nop
2006fe8: c4 07 63 30 ld [ %i5 + 0x330 ], %g2
2006fec: 03 00 80 56 sethi %hi(0x2015800), %g1
2006ff0: c2 00 61 68 ld [ %g1 + 0x168 ], %g1 ! 2015968 <_Per_CPU_Information+0xc>
RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section (
Thread_queue_Control *the_thread_queue
)
{
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
2006ff4: 86 10 20 01 mov 1, %g3
2006ff8: c6 26 20 30 st %g3, [ %i0 + 0x30 ]
2006ffc: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
2007000: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
2007004: 82 00 a0 01 add %g2, 1, %g1
2007008: c2 27 63 30 st %g1, [ %i5 + 0x330 ]
200700c: 7f ff eb d5 call 2001f60 <sparc_enable_interrupts>
2007010: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2007014: 90 10 00 18 mov %i0, %o0
2007018: 7f ff ff c1 call 2006f1c <_CORE_mutex_Seize_interrupt_blocking>
200701c: 92 10 00 1b mov %i3, %o1
2007020: 81 c7 e0 08 ret
2007024: 81 e8 00 00 restore
2007028: c2 00 60 8c ld [ %g1 + 0x8c ], %g1
200702c: 80 a0 60 01 cmp %g1, 1
2007030: 28 bf ff e7 bleu,a 2006fcc <_CORE_mutex_Seize+0x28>
2007034: 90 10 00 18 mov %i0, %o0
2007038: 90 10 20 00 clr %o0
200703c: 92 10 20 00 clr %o1
2007040: 40 00 01 dc call 20077b0 <_Internal_error_Occurred>
2007044: 94 10 20 12 mov 0x12, %o2
2007048: 7f ff eb c6 call 2001f60 <sparc_enable_interrupts>
200704c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2007050: 03 00 80 56 sethi %hi(0x2015800), %g1
2007054: c2 00 61 68 ld [ %g1 + 0x168 ], %g1 ! 2015968 <_Per_CPU_Information+0xc>
2007058: 84 10 20 01 mov 1, %g2
200705c: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
2007060: 81 c7 e0 08 ret
2007064: 81 e8 00 00 restore
020071dc <_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
)
{
20071dc: 9d e3 bf a0 save %sp, -96, %sp
20071e0: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
20071e4: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
20071e8: 40 00 07 6e call 2008fa0 <_Thread_queue_Dequeue>
20071ec: 90 10 00 1d mov %i5, %o0
20071f0: 80 a2 20 00 cmp %o0, 0
20071f4: 02 80 00 04 be 2007204 <_CORE_semaphore_Surrender+0x28>
20071f8: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
20071fc: 81 c7 e0 08 ret
2007200: 81 e8 00 00 restore
if ( !_Objects_Is_local_id( the_thread->Object.id ) )
(*api_semaphore_mp_support) ( the_thread, id );
#endif
} else {
_ISR_Disable( level );
2007204: 7f ff eb 53 call 2001f50 <sparc_disable_interrupts>
2007208: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
200720c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
2007210: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
2007214: 80 a0 40 02 cmp %g1, %g2
2007218: 1a 80 00 05 bcc 200722c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
200721c: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
2007220: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007224: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
2007228: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
200722c: 7f ff eb 4d call 2001f60 <sparc_enable_interrupts>
2007230: 01 00 00 00 nop
}
return status;
}
2007234: 81 c7 e0 08 ret
2007238: 81 e8 00 00 restore
0200bf28 <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
200bf28: 9d e3 bf a0 save %sp, -96, %sp
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
200bf2c: c0 26 20 04 clr [ %i0 + 4 ]
size_t node_size
)
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
200bf30: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200bf34: 80 a6 a0 00 cmp %i2, 0
200bf38: 02 80 00 12 be 200bf80 <_Chain_Initialize+0x58> <== NEVER TAKEN
200bf3c: 90 10 00 18 mov %i0, %o0
200bf40: b4 06 bf ff add %i2, -1, %i2
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
Chain_Node *next = starting_address;
200bf44: 82 10 00 19 mov %i1, %g1
head->previous = NULL;
while ( count-- ) {
200bf48: 92 10 00 1a mov %i2, %o1
)
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
200bf4c: 10 80 00 05 b 200bf60 <_Chain_Initialize+0x38>
200bf50: 84 10 00 18 mov %i0, %g2
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200bf54: 84 10 00 01 mov %g1, %g2
200bf58: b4 06 bf ff add %i2, -1, %i2
current->next = next;
next->previous = current;
current = next;
next = (Chain_Node *)
200bf5c: 82 10 00 03 mov %g3, %g1
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
current->next = next;
200bf60: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
200bf64: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200bf68: 80 a6 a0 00 cmp %i2, 0
200bf6c: 12 bf ff fa bne 200bf54 <_Chain_Initialize+0x2c>
200bf70: 86 00 40 1b add %g1, %i3, %g3
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
200bf74: 40 00 16 66 call 201190c <.umul>
200bf78: 90 10 00 1b mov %i3, %o0
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200bf7c: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
200bf80: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
200bf84: d0 26 20 08 st %o0, [ %i0 + 8 ]
}
200bf88: 81 c7 e0 08 ret
200bf8c: 81 e8 00 00 restore
02005f34 <_Event_Surrender>:
*/
void _Event_Surrender(
Thread_Control *the_thread
)
{
2005f34: 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 ];
2005f38: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
option_set = (rtems_option) the_thread->Wait.option;
_ISR_Disable( level );
2005f3c: 7f ff f0 05 call 2001f50 <sparc_disable_interrupts>
2005f40: f6 06 20 30 ld [ %i0 + 0x30 ], %i3
2005f44: b8 10 00 08 mov %o0, %i4
pending_events = api->pending_events;
2005f48: c4 07 40 00 ld [ %i5 ], %g2
event_condition = (rtems_event_set) the_thread->Wait.count;
2005f4c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
seized_events = _Event_sets_Get( pending_events, event_condition );
/*
* No events were seized in this operation
*/
if ( _Event_sets_Is_empty( seized_events ) ) {
2005f50: 86 88 40 02 andcc %g1, %g2, %g3
2005f54: 02 80 00 3a be 200603c <_Event_Surrender+0x108>
2005f58: 09 00 80 56 sethi %hi(0x2015800), %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() &&
2005f5c: 88 11 21 5c or %g4, 0x15c, %g4 ! 201595c <_Per_CPU_Information>
2005f60: f2 01 20 08 ld [ %g4 + 8 ], %i1
2005f64: 80 a6 60 00 cmp %i1, 0
2005f68: 32 80 00 1d bne,a 2005fdc <_Event_Surrender+0xa8>
2005f6c: c8 01 20 0c ld [ %g4 + 0xc ], %g4
*/
RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event (
States_Control the_states
)
{
return (the_states & STATES_WAITING_FOR_EVENT);
2005f70: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
}
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Is_waiting_for_event( the_thread->current_state ) ) {
2005f74: 80 89 21 00 btst 0x100, %g4
2005f78: 02 80 00 31 be 200603c <_Event_Surrender+0x108>
2005f7c: 80 a0 40 03 cmp %g1, %g3
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
2005f80: 02 80 00 04 be 2005f90 <_Event_Surrender+0x5c>
2005f84: 80 8e e0 02 btst 2, %i3
2005f88: 02 80 00 2d be 200603c <_Event_Surrender+0x108> <== NEVER TAKEN
2005f8c: 01 00 00 00 nop
api->pending_events = _Event_sets_Clear( pending_events, seized_events );
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2005f90: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
RTEMS_INLINE_ROUTINE rtems_event_set _Event_sets_Clear(
rtems_event_set the_event_set,
rtems_event_set the_mask
)
{
return ( the_event_set & ~(the_mask) );
2005f94: 84 28 80 03 andn %g2, %g3, %g2
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Is_waiting_for_event( the_thread->current_state ) ) {
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
api->pending_events = _Event_sets_Clear( pending_events, seized_events );
2005f98: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
2005f9c: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2005fa0: c6 20 40 00 st %g3, [ %g1 ]
_ISR_Flash( level );
2005fa4: 7f ff ef ef call 2001f60 <sparc_enable_interrupts>
2005fa8: 90 10 00 1c mov %i4, %o0
2005fac: 7f ff ef e9 call 2001f50 <sparc_disable_interrupts>
2005fb0: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
2005fb4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
2005fb8: 80 a0 60 02 cmp %g1, 2
2005fbc: 02 80 00 22 be 2006044 <_Event_Surrender+0x110>
2005fc0: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
2005fc4: 90 10 00 1c mov %i4, %o0
2005fc8: 7f ff ef e6 call 2001f60 <sparc_enable_interrupts>
2005fcc: 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 );
2005fd0: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
2005fd4: 40 00 0a 2c call 2008884 <_Thread_Clear_state>
2005fd8: 81 e8 00 00 restore
/*
* If we are in an ISR and sending to the current thread, then
* we have a critical section issue to deal with.
*/
if ( _ISR_Is_in_progress() &&
2005fdc: 80 a6 00 04 cmp %i0, %g4
2005fe0: 32 bf ff e5 bne,a 2005f74 <_Event_Surrender+0x40>
2005fe4: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
2005fe8: 09 00 80 56 sethi %hi(0x2015800), %g4
2005fec: f2 01 21 b0 ld [ %g4 + 0x1b0 ], %i1 ! 20159b0 <_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 ) &&
2005ff0: 80 a6 60 02 cmp %i1, 2
2005ff4: 02 80 00 07 be 2006010 <_Event_Surrender+0xdc> <== NEVER TAKEN
2005ff8: 80 a0 40 03 cmp %g1, %g3
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
2005ffc: f2 01 21 b0 ld [ %g4 + 0x1b0 ], %i1
* 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) ||
2006000: 80 a6 60 01 cmp %i1, 1
2006004: 32 bf ff dc bne,a 2005f74 <_Event_Surrender+0x40>
2006008: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
200600c: 80 a0 40 03 cmp %g1, %g3
2006010: 02 80 00 04 be 2006020 <_Event_Surrender+0xec>
2006014: 80 8e e0 02 btst 2, %i3
2006018: 02 80 00 09 be 200603c <_Event_Surrender+0x108> <== NEVER TAKEN
200601c: 01 00 00 00 nop
api->pending_events = _Event_sets_Clear( pending_events,seized_events );
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006020: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
2006024: 84 28 80 03 andn %g2, %g3, %g2
if ( _ISR_Is_in_progress() &&
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
api->pending_events = _Event_sets_Clear( pending_events,seized_events );
2006028: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
200602c: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006030: c6 20 40 00 st %g3, [ %g1 ]
_Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
2006034: 82 10 20 03 mov 3, %g1
2006038: c2 21 21 b0 st %g1, [ %g4 + 0x1b0 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
200603c: 7f ff ef c9 call 2001f60 <sparc_enable_interrupts>
2006040: 91 e8 00 1c restore %g0, %i4, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
2006044: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
_ISR_Enable( level );
_Thread_Unblock( the_thread );
} else {
_Watchdog_Deactivate( &the_thread->Timer );
_ISR_Enable( level );
2006048: 7f ff ef c6 call 2001f60 <sparc_enable_interrupts>
200604c: 90 10 00 1c mov %i4, %o0
(void) _Watchdog_Remove( &the_thread->Timer );
2006050: 40 00 0f 2b call 2009cfc <_Watchdog_Remove>
2006054: 90 06 20 48 add %i0, 0x48, %o0
2006058: 33 04 00 ff sethi %hi(0x1003fc00), %i1
200605c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
2006060: 40 00 0a 09 call 2008884 <_Thread_Clear_state>
2006064: 81 e8 00 00 restore
02006068 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *ignored
)
{
2006068: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
ISR_Level level;
the_thread = _Thread_Get( id, &location );
200606c: 90 10 00 18 mov %i0, %o0
2006070: 40 00 0b 00 call 2008c70 <_Thread_Get>
2006074: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2006078: c2 07 bf fc ld [ %fp + -4 ], %g1
200607c: 80 a0 60 00 cmp %g1, 0
2006080: 12 80 00 15 bne 20060d4 <_Event_Timeout+0x6c> <== NEVER TAKEN
2006084: 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 );
2006088: 7f ff ef b2 call 2001f50 <sparc_disable_interrupts>
200608c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
2006090: 03 00 80 56 sethi %hi(0x2015800), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
2006094: c2 00 61 68 ld [ %g1 + 0x168 ], %g1 ! 2015968 <_Per_CPU_Information+0xc>
2006098: 80 a7 40 01 cmp %i5, %g1
200609c: 02 80 00 10 be 20060dc <_Event_Timeout+0x74>
20060a0: c0 27 60 24 clr [ %i5 + 0x24 ]
if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
20060a4: 82 10 20 06 mov 6, %g1
20060a8: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
20060ac: 7f ff ef ad call 2001f60 <sparc_enable_interrupts>
20060b0: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
20060b4: 90 10 00 1d mov %i5, %o0
20060b8: 13 04 00 ff sethi %hi(0x1003fc00), %o1
20060bc: 40 00 09 f2 call 2008884 <_Thread_Clear_state>
20060c0: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 <RAM_END+0xdc3fff8>
*/
RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void )
{
RTEMS_COMPILER_MEMORY_BARRIER();
_Thread_Dispatch_disable_level -= 1;
20060c4: 03 00 80 55 sethi %hi(0x2015400), %g1
20060c8: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2015730 <_Thread_Dispatch_disable_level>
20060cc: 84 00 bf ff add %g2, -1, %g2
20060d0: c4 20 63 30 st %g2, [ %g1 + 0x330 ]
20060d4: 81 c7 e0 08 ret
20060d8: 81 e8 00 00 restore
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
20060dc: 03 00 80 56 sethi %hi(0x2015800), %g1
20060e0: c4 00 61 b0 ld [ %g1 + 0x1b0 ], %g2 ! 20159b0 <_Event_Sync_state>
20060e4: 80 a0 a0 01 cmp %g2, 1
20060e8: 32 bf ff f0 bne,a 20060a8 <_Event_Timeout+0x40>
20060ec: 82 10 20 06 mov 6, %g1
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
20060f0: 84 10 20 02 mov 2, %g2
20060f4: c4 20 61 b0 st %g2, [ %g1 + 0x1b0 ]
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
20060f8: 10 bf ff ec b 20060a8 <_Event_Timeout+0x40>
20060fc: 82 10 20 06 mov 6, %g1
0200c14c <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200c14c: 9d e3 bf 98 save %sp, -104, %sp
200c150: ba 10 00 18 mov %i0, %i5
Heap_Statistics *const stats = &heap->stats;
uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE
200c154: a0 06 60 04 add %i1, 4, %l0
- HEAP_ALLOC_BONUS;
uintptr_t const page_size = heap->page_size;
200c158: ec 06 20 10 ld [ %i0 + 0x10 ], %l6
Heap_Block *block = NULL;
uintptr_t alloc_begin = 0;
uint32_t search_count = 0;
bool search_again = false;
if ( block_size_floor < alloc_size ) {
200c15c: 80 a6 40 10 cmp %i1, %l0
200c160: 18 80 00 23 bgu 200c1ec <_Heap_Allocate_aligned_with_boundary+0xa0>
200c164: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
200c168: 80 a6 e0 00 cmp %i3, 0
200c16c: 12 80 00 7d bne 200c360 <_Heap_Allocate_aligned_with_boundary+0x214>
200c170: 80 a6 40 1b cmp %i1, %i3
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200c174: e2 07 60 08 ld [ %i5 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200c178: 80 a7 40 11 cmp %i5, %l1
200c17c: 02 80 00 18 be 200c1dc <_Heap_Allocate_aligned_with_boundary+0x90>
200c180: b8 10 20 00 clr %i4
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200c184: 82 05 a0 07 add %l6, 7, %g1
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200c188: ae 10 20 04 mov 4, %l7
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200c18c: c2 27 bf fc st %g1, [ %fp + -4 ]
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200c190: 10 80 00 0b b 200c1bc <_Heap_Allocate_aligned_with_boundary+0x70>
200c194: ae 25 c0 19 sub %l7, %i1, %l7
* The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag
* field. Thus the value is about one unit larger than the real block
* size. The greater than operator takes this into account.
*/
if ( block->size_and_flag > block_size_floor ) {
if ( alignment == 0 ) {
200c198: 12 80 00 17 bne 200c1f4 <_Heap_Allocate_aligned_with_boundary+0xa8>
200c19c: b0 04 60 08 add %l1, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200c1a0: 80 a6 20 00 cmp %i0, 0
200c1a4: 12 80 00 5b bne 200c310 <_Heap_Allocate_aligned_with_boundary+0x1c4>
200c1a8: b8 07 20 01 inc %i4
break;
}
block = block->next;
200c1ac: e2 04 60 08 ld [ %l1 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200c1b0: 80 a7 40 11 cmp %i5, %l1
200c1b4: 22 80 00 0b be,a 200c1e0 <_Heap_Allocate_aligned_with_boundary+0x94>
200c1b8: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
/*
* The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag
* field. Thus the value is about one unit larger than the real block
* size. The greater than operator takes this into account.
*/
if ( block->size_and_flag > block_size_floor ) {
200c1bc: e4 04 60 04 ld [ %l1 + 4 ], %l2
200c1c0: 80 a4 00 12 cmp %l0, %l2
200c1c4: 0a bf ff f5 bcs 200c198 <_Heap_Allocate_aligned_with_boundary+0x4c>
200c1c8: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
200c1cc: e2 04 60 08 ld [ %l1 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200c1d0: 80 a7 40 11 cmp %i5, %l1
200c1d4: 12 bf ff fa bne 200c1bc <_Heap_Allocate_aligned_with_boundary+0x70>
200c1d8: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200c1dc: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200c1e0: 80 a0 40 1c cmp %g1, %i4
200c1e4: 0a 80 00 5a bcs 200c34c <_Heap_Allocate_aligned_with_boundary+0x200>
200c1e8: b0 10 20 00 clr %i0
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200c1ec: 81 c7 e0 08 ret
200c1f0: 81 e8 00 00 restore
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
200c1f4: c4 07 bf fc ld [ %fp + -4 ], %g2
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200c1f8: ea 07 60 14 ld [ %i5 + 0x14 ], %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;
200c1fc: a4 0c bf fe and %l2, -2, %l2
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
200c200: 82 20 80 15 sub %g2, %l5, %g1
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
200c204: a4 04 40 12 add %l1, %l2, %l2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200c208: 92 10 00 1a mov %i2, %o1
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
uintptr_t alloc_begin = alloc_end - alloc_size;
200c20c: b0 05 c0 12 add %l7, %l2, %i0
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200c210: a4 00 40 12 add %g1, %l2, %l2
200c214: 40 00 16 a4 call 2011ca4 <.urem>
200c218: 90 10 00 18 mov %i0, %o0
200c21c: b0 26 00 08 sub %i0, %o0, %i0
uintptr_t alloc_begin = alloc_end - alloc_size;
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
/* Ensure that the we have a valid new block at the end */
if ( alloc_begin > alloc_begin_ceiling ) {
200c220: 80 a4 80 18 cmp %l2, %i0
200c224: 1a 80 00 06 bcc 200c23c <_Heap_Allocate_aligned_with_boundary+0xf0>
200c228: a8 04 60 08 add %l1, 8, %l4
200c22c: 90 10 00 12 mov %l2, %o0
200c230: 40 00 16 9d call 2011ca4 <.urem>
200c234: 92 10 00 1a mov %i2, %o1
200c238: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
200c23c: 80 a6 e0 00 cmp %i3, 0
200c240: 02 80 00 24 be 200c2d0 <_Heap_Allocate_aligned_with_boundary+0x184>
200c244: 80 a5 00 18 cmp %l4, %i0
/* Ensure that the we have a valid new block at the end */
if ( alloc_begin > alloc_begin_ceiling ) {
alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment );
}
alloc_end = alloc_begin + alloc_size;
200c248: a4 06 00 19 add %i0, %i1, %l2
200c24c: 92 10 00 1b mov %i3, %o1
200c250: 40 00 16 95 call 2011ca4 <.urem>
200c254: 90 10 00 12 mov %l2, %o0
200c258: 90 24 80 08 sub %l2, %o0, %o0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200c25c: 80 a6 00 08 cmp %i0, %o0
200c260: 1a 80 00 1b bcc 200c2cc <_Heap_Allocate_aligned_with_boundary+0x180>
200c264: 80 a2 00 12 cmp %o0, %l2
200c268: 1a 80 00 1a bcc 200c2d0 <_Heap_Allocate_aligned_with_boundary+0x184>
200c26c: 80 a5 00 18 cmp %l4, %i0
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
200c270: a6 05 00 19 add %l4, %i1, %l3
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
if ( boundary_line < boundary_floor ) {
200c274: 80 a4 c0 08 cmp %l3, %o0
200c278: 08 80 00 08 bleu 200c298 <_Heap_Allocate_aligned_with_boundary+0x14c>
200c27c: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200c280: 10 bf ff c9 b 200c1a4 <_Heap_Allocate_aligned_with_boundary+0x58>
200c284: 80 a6 20 00 cmp %i0, 0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200c288: 1a 80 00 11 bcc 200c2cc <_Heap_Allocate_aligned_with_boundary+0x180>
200c28c: 80 a4 c0 08 cmp %l3, %o0
if ( boundary_line < boundary_floor ) {
200c290: 18 bf ff c4 bgu 200c1a0 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN
200c294: b0 10 20 00 clr %i0
return 0;
}
alloc_begin = boundary_line - alloc_size;
200c298: b0 22 00 19 sub %o0, %i1, %i0
200c29c: 92 10 00 1a mov %i2, %o1
200c2a0: 40 00 16 81 call 2011ca4 <.urem>
200c2a4: 90 10 00 18 mov %i0, %o0
200c2a8: 92 10 00 1b mov %i3, %o1
200c2ac: b0 26 00 08 sub %i0, %o0, %i0
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
alloc_end = alloc_begin + alloc_size;
200c2b0: a4 06 00 19 add %i0, %i1, %l2
200c2b4: 40 00 16 7c call 2011ca4 <.urem>
200c2b8: 90 10 00 12 mov %l2, %o0
200c2bc: 90 24 80 08 sub %l2, %o0, %o0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200c2c0: 80 a2 00 12 cmp %o0, %l2
200c2c4: 0a bf ff f1 bcs 200c288 <_Heap_Allocate_aligned_with_boundary+0x13c>
200c2c8: 80 a6 00 08 cmp %i0, %o0
boundary_line = _Heap_Align_down( alloc_end, boundary );
}
}
/* Ensure that the we have a valid new block at the beginning */
if ( alloc_begin >= alloc_begin_floor ) {
200c2cc: 80 a5 00 18 cmp %l4, %i0
200c2d0: 18 80 00 22 bgu 200c358 <_Heap_Allocate_aligned_with_boundary+0x20c>
200c2d4: 82 10 3f f8 mov -8, %g1
200c2d8: 90 10 00 18 mov %i0, %o0
200c2dc: a4 20 40 11 sub %g1, %l1, %l2
200c2e0: 92 10 00 16 mov %l6, %o1
200c2e4: 40 00 16 70 call 2011ca4 <.urem>
200c2e8: a4 04 80 18 add %l2, %i0, %l2
uintptr_t const alloc_block_begin =
(uintptr_t) _Heap_Block_of_alloc_area( alloc_begin, page_size );
uintptr_t const free_size = alloc_block_begin - block_begin;
if ( free_size >= min_block_size || free_size == 0 ) {
200c2ec: 90 a4 80 08 subcc %l2, %o0, %o0
200c2f0: 02 bf ff ad be 200c1a4 <_Heap_Allocate_aligned_with_boundary+0x58>
200c2f4: 80 a6 20 00 cmp %i0, 0
200c2f8: 80 a2 00 15 cmp %o0, %l5
return alloc_begin;
}
}
return 0;
200c2fc: 82 40 3f ff addx %g0, -1, %g1
200c300: b0 0e 00 01 and %i0, %g1, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200c304: 80 a6 20 00 cmp %i0, 0
200c308: 02 bf ff a9 be 200c1ac <_Heap_Allocate_aligned_with_boundary+0x60>
200c30c: b8 07 20 01 inc %i4
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200c310: c4 07 60 48 ld [ %i5 + 0x48 ], %g2
stats->searches += search_count;
200c314: c2 07 60 4c ld [ %i5 + 0x4c ], %g1
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200c318: 84 00 a0 01 inc %g2
stats->searches += search_count;
200c31c: 82 00 40 1c add %g1, %i4, %g1
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200c320: c4 27 60 48 st %g2, [ %i5 + 0x48 ]
stats->searches += search_count;
200c324: c2 27 60 4c st %g1, [ %i5 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
200c328: 90 10 00 1d mov %i5, %o0
200c32c: 92 10 00 11 mov %l1, %o1
200c330: 94 10 00 18 mov %i0, %o2
200c334: 7f ff ec cf call 2007670 <_Heap_Block_allocate>
200c338: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200c33c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200c340: 80 a0 40 1c cmp %g1, %i4
200c344: 1a 80 00 03 bcc 200c350 <_Heap_Allocate_aligned_with_boundary+0x204>
200c348: 01 00 00 00 nop
stats->max_search = search_count;
200c34c: f8 27 60 44 st %i4, [ %i5 + 0x44 ]
}
return (void *) alloc_begin;
}
200c350: 81 c7 e0 08 ret
200c354: 81 e8 00 00 restore
if ( free_size >= min_block_size || free_size == 0 ) {
return alloc_begin;
}
}
return 0;
200c358: 10 bf ff 92 b 200c1a0 <_Heap_Allocate_aligned_with_boundary+0x54>
200c35c: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
200c360: 18 bf ff a3 bgu 200c1ec <_Heap_Allocate_aligned_with_boundary+0xa0>
200c364: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
200c368: 22 bf ff 83 be,a 200c174 <_Heap_Allocate_aligned_with_boundary+0x28>
200c36c: b4 10 00 16 mov %l6, %i2
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200c370: 10 bf ff 82 b 200c178 <_Heap_Allocate_aligned_with_boundary+0x2c>
200c374: e2 07 60 08 ld [ %i5 + 8 ], %l1
0200c674 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
200c674: 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;
200c678: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200c67c: 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;
200c680: 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;
200c684: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
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;
200c688: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
200c68c: 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;
200c690: 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 ) {
200c694: 80 a6 40 1d cmp %i1, %i5
200c698: 08 80 00 05 bleu 200c6ac <_Heap_Extend+0x38>
200c69c: a2 10 20 00 clr %l1
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200c6a0: b0 0c 60 01 and %l1, 1, %i0
200c6a4: 81 c7 e0 08 ret
200c6a8: 81 e8 00 00 restore
if ( extend_area_end < extend_area_begin ) {
return false;
}
extend_area_ok = _Heap_Get_first_and_last_block(
200c6ac: 90 10 00 19 mov %i1, %o0
200c6b0: 92 10 00 1a mov %i2, %o1
200c6b4: 94 10 00 10 mov %l0, %o2
200c6b8: 98 07 bf f8 add %fp, -8, %o4
200c6bc: 7f ff ec 48 call 20077dc <_Heap_Get_first_and_last_block>
200c6c0: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200c6c4: 80 8a 20 ff btst 0xff, %o0
200c6c8: 02 bf ff f6 be 200c6a0 <_Heap_Extend+0x2c>
200c6cc: aa 10 20 00 clr %l5
200c6d0: a2 10 00 1c mov %i4, %l1
200c6d4: ac 10 20 00 clr %l6
200c6d8: a6 10 20 00 clr %l3
200c6dc: 10 80 00 14 b 200c72c <_Heap_Extend+0xb8>
200c6e0: a8 10 20 00 clr %l4
return false;
}
if ( extend_area_end == sub_area_begin ) {
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
200c6e4: 2a 80 00 02 bcs,a 200c6ec <_Heap_Extend+0x78>
200c6e8: ac 10 00 11 mov %l1, %l6
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200c6ec: 90 10 00 1a mov %i2, %o0
200c6f0: 40 00 16 c1 call 20121f4 <.urem>
200c6f4: 92 10 00 10 mov %l0, %o1
200c6f8: 82 06 bf f8 add %i2, -8, %g1
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200c6fc: 80 a6 80 19 cmp %i2, %i1
200c700: 02 80 00 1c be 200c770 <_Heap_Extend+0xfc>
200c704: 82 20 40 08 sub %g1, %o0, %g1
start_block->prev_size = extend_area_end;
merge_above_block = end_block;
} else if ( sub_area_end < extend_area_begin ) {
200c708: 80 a6 40 1a cmp %i1, %i2
200c70c: 38 80 00 02 bgu,a 200c714 <_Heap_Extend+0xa0>
200c710: aa 10 00 01 mov %g1, %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;
200c714: e2 00 60 04 ld [ %g1 + 4 ], %l1
200c718: a2 0c 7f fe and %l1, -2, %l1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200c71c: a2 04 40 01 add %l1, %g1, %l1
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200c720: 80 a7 00 11 cmp %i4, %l1
200c724: 22 80 00 1b be,a 200c790 <_Heap_Extend+0x11c>
200c728: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
return false;
}
do {
uintptr_t const sub_area_begin = (start_block != first_block) ?
(uintptr_t) start_block : heap->area_begin;
200c72c: 80 a4 40 1c cmp %l1, %i4
200c730: 02 80 00 66 be 200c8c8 <_Heap_Extend+0x254>
200c734: 82 10 00 11 mov %l1, %g1
uintptr_t const sub_area_end = start_block->prev_size;
Heap_Block *const end_block =
_Heap_Block_of_alloc_area( sub_area_end, page_size );
if (
200c738: 80 a0 40 1d cmp %g1, %i5
200c73c: 0a 80 00 70 bcs 200c8fc <_Heap_Extend+0x288>
200c740: f4 04 40 00 ld [ %l1 ], %i2
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
}
if ( extend_area_end == sub_area_begin ) {
200c744: 80 a0 40 1d cmp %g1, %i5
200c748: 12 bf ff e7 bne 200c6e4 <_Heap_Extend+0x70>
200c74c: 80 a7 40 1a cmp %i5, %i2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200c750: 90 10 00 1a mov %i2, %o0
200c754: 40 00 16 a8 call 20121f4 <.urem>
200c758: 92 10 00 10 mov %l0, %o1
200c75c: 82 06 bf f8 add %i2, -8, %g1
200c760: a8 10 00 11 mov %l1, %l4
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200c764: 80 a6 80 19 cmp %i2, %i1
200c768: 12 bf ff e8 bne 200c708 <_Heap_Extend+0x94> <== ALWAYS TAKEN
200c76c: 82 20 40 08 sub %g1, %o0, %g1
start_block->prev_size = extend_area_end;
200c770: fa 24 40 00 st %i5, [ %l1 ]
- 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;
200c774: e2 00 60 04 ld [ %g1 + 4 ], %l1
200c778: a2 0c 7f fe and %l1, -2, %l1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200c77c: a2 04 40 01 add %l1, %g1, %l1
} else if ( sub_area_end < extend_area_begin ) {
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200c780: 80 a7 00 11 cmp %i4, %l1
200c784: 12 bf ff ea bne 200c72c <_Heap_Extend+0xb8> <== NEVER TAKEN
200c788: a6 10 00 01 mov %g1, %l3
if ( extend_area_begin < heap->area_begin ) {
200c78c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200c790: 80 a6 40 01 cmp %i1, %g1
200c794: 3a 80 00 55 bcc,a 200c8e8 <_Heap_Extend+0x274>
200c798: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200c79c: f2 26 20 18 st %i1, [ %i0 + 0x18 ]
} else if ( heap->area_end < extend_area_end ) {
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
200c7a0: c2 07 bf f8 ld [ %fp + -8 ], %g1
200c7a4: c4 07 bf fc ld [ %fp + -4 ], %g2
extend_last_block->prev_size = extend_first_block_size;
extend_last_block->size_and_flag = 0;
_Heap_Protection_block_initialize( heap, extend_last_block );
if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) {
200c7a8: c8 06 20 20 ld [ %i0 + 0x20 ], %g4
heap->area_begin = extend_area_begin;
} else if ( heap->area_end < extend_area_end ) {
heap->area_end = extend_area_end;
}
extend_first_block_size =
200c7ac: 86 20 80 01 sub %g2, %g1, %g3
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
extend_first_block->prev_size = extend_area_end;
200c7b0: fa 20 40 00 st %i5, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200c7b4: b8 10 e0 01 or %g3, 1, %i4
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 =
200c7b8: f8 20 60 04 st %i4, [ %g1 + 4 ]
extend_first_block_size | HEAP_PREV_BLOCK_USED;
_Heap_Protection_block_initialize( heap, extend_first_block );
extend_last_block->prev_size = extend_first_block_size;
200c7bc: c6 20 80 00 st %g3, [ %g2 ]
extend_last_block->size_and_flag = 0;
_Heap_Protection_block_initialize( heap, extend_last_block );
if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) {
200c7c0: 80 a1 00 01 cmp %g4, %g1
200c7c4: 08 80 00 43 bleu 200c8d0 <_Heap_Extend+0x25c>
200c7c8: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
200c7cc: c2 26 20 20 st %g1, [ %i0 + 0x20 ]
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200c7d0: 80 a5 20 00 cmp %l4, 0
200c7d4: 02 80 00 63 be 200c960 <_Heap_Extend+0x2ec>
200c7d8: 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;
200c7dc: f8 06 20 10 ld [ %i0 + 0x10 ], %i4
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up(
uintptr_t value,
uintptr_t alignment
)
{
uintptr_t remainder = value % alignment;
200c7e0: 92 10 00 1c mov %i4, %o1
200c7e4: 40 00 16 84 call 20121f4 <.urem>
200c7e8: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200c7ec: 80 a2 20 00 cmp %o0, 0
200c7f0: 02 80 00 04 be 200c800 <_Heap_Extend+0x18c>
200c7f4: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
200c7f8: b2 06 40 1c add %i1, %i4, %i1
200c7fc: 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 =
200c800: 82 06 7f f8 add %i1, -8, %g1
uintptr_t const first_block_begin = (uintptr_t) first_block;
uintptr_t const new_first_block_size =
first_block_begin - new_first_block_begin;
Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin;
new_first_block->prev_size = first_block->prev_size;
200c804: c4 26 7f f8 st %g2, [ %i1 + -8 ]
uintptr_t const new_first_block_alloc_begin =
_Heap_Align_up( extend_area_begin + HEAP_BLOCK_HEADER_SIZE, page_size );
uintptr_t const new_first_block_begin =
new_first_block_alloc_begin - HEAP_BLOCK_HEADER_SIZE;
uintptr_t const first_block_begin = (uintptr_t) first_block;
uintptr_t const new_first_block_size =
200c808: 84 25 00 01 sub %l4, %g1, %g2
first_block_begin - new_first_block_begin;
Heap_Block *const new_first_block = (Heap_Block *) new_first_block_begin;
new_first_block->prev_size = first_block->prev_size;
new_first_block->size_and_flag = new_first_block_size | HEAP_PREV_BLOCK_USED;
200c80c: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
200c810: 90 10 00 18 mov %i0, %o0
200c814: 92 10 00 01 mov %g1, %o1
200c818: 7f ff ff 8d call 200c64c <_Heap_Free_block>
200c81c: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200c820: 80 a4 e0 00 cmp %l3, 0
200c824: 02 80 00 3b be 200c910 <_Heap_Extend+0x29c>
200c828: 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);
200c82c: 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(
200c830: ba 27 40 13 sub %i5, %l3, %i5
200c834: 40 00 16 70 call 20121f4 <.urem>
200c838: 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)
200c83c: c2 04 e0 04 ld [ %l3 + 4 ], %g1
200c840: ba 27 40 08 sub %i5, %o0, %i5
200c844: 82 20 40 1d sub %g1, %i5, %g1
| HEAP_PREV_BLOCK_USED;
200c848: 82 10 60 01 or %g1, 1, %g1
page_size
);
Heap_Block *const new_last_block =
_Heap_Block_at( last_block, last_block_new_size );
new_last_block->size_and_flag =
200c84c: 84 07 40 13 add %i5, %l3, %g2
200c850: c2 20 a0 04 st %g1, [ %g2 + 4 ]
RTEMS_INLINE_ROUTINE void _Heap_Block_set_size(
Heap_Block *block,
uintptr_t size
)
{
uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED;
200c854: c2 04 e0 04 ld [ %l3 + 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 );
200c858: 90 10 00 18 mov %i0, %o0
200c85c: 82 08 60 01 and %g1, 1, %g1
200c860: 92 10 00 13 mov %l3, %o1
block->size_and_flag = size | flag;
200c864: ba 17 40 01 or %i5, %g1, %i5
200c868: 7f ff ff 79 call 200c64c <_Heap_Free_block>
200c86c: fa 24 e0 04 st %i5, [ %l3 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200c870: 80 a4 e0 00 cmp %l3, 0
200c874: 02 80 00 34 be 200c944 <_Heap_Extend+0x2d0>
200c878: 80 a5 20 00 cmp %l4, 0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200c87c: 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(
200c880: c6 06 20 20 ld [ %i0 + 0x20 ], %g3
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;
200c884: c4 00 60 04 ld [ %g1 + 4 ], %g2
* 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(
200c888: 86 20 c0 01 sub %g3, %g1, %g3
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;
200c88c: 84 08 a0 01 and %g2, 1, %g2
block->size_and_flag = size | flag;
200c890: 84 10 80 03 or %g2, %g3, %g2
200c894: c4 20 60 04 st %g2, [ %g1 + 4 ]
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
/* Statistics */
stats->size += extended_size;
200c898: c2 06 20 2c ld [ %i0 + 0x2c ], %g1
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200c89c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
stats->size += extended_size;
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
200c8a0: a2 10 20 01 mov 1, %l1
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200c8a4: a4 20 80 12 sub %g2, %l2, %l2
/* Statistics */
stats->size += extended_size;
200c8a8: 82 00 40 12 add %g1, %l2, %g1
if ( extended_size_ptr != NULL )
200c8ac: 80 a6 e0 00 cmp %i3, 0
200c8b0: 02 bf ff 7c be 200c6a0 <_Heap_Extend+0x2c> <== NEVER TAKEN
200c8b4: c2 26 20 2c st %g1, [ %i0 + 0x2c ]
*extended_size_ptr = extended_size;
200c8b8: e4 26 c0 00 st %l2, [ %i3 ]
return true;
}
200c8bc: b0 0c 60 01 and %l1, 1, %i0
200c8c0: 81 c7 e0 08 ret
200c8c4: 81 e8 00 00 restore
return false;
}
do {
uintptr_t const sub_area_begin = (start_block != first_block) ?
(uintptr_t) start_block : heap->area_begin;
200c8c8: 10 bf ff 9c b 200c738 <_Heap_Extend+0xc4>
200c8cc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
extend_last_block->size_and_flag = 0;
_Heap_Protection_block_initialize( heap, extend_last_block );
if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) {
heap->first_block = extend_first_block;
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
200c8d0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200c8d4: 80 a0 40 02 cmp %g1, %g2
200c8d8: 2a bf ff be bcs,a 200c7d0 <_Heap_Extend+0x15c>
200c8dc: c4 26 20 24 st %g2, [ %i0 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200c8e0: 10 bf ff bd b 200c7d4 <_Heap_Extend+0x160>
200c8e4: 80 a5 20 00 cmp %l4, 0
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
if ( extend_area_begin < heap->area_begin ) {
heap->area_begin = extend_area_begin;
} else if ( heap->area_end < extend_area_end ) {
200c8e8: 80 a7 40 01 cmp %i5, %g1
200c8ec: 38 bf ff ad bgu,a 200c7a0 <_Heap_Extend+0x12c>
200c8f0: 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;
200c8f4: 10 bf ff ac b 200c7a4 <_Heap_Extend+0x130>
200c8f8: c2 07 bf f8 ld [ %fp + -8 ], %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 (
200c8fc: 80 a6 40 1a cmp %i1, %i2
200c900: 1a bf ff 92 bcc 200c748 <_Heap_Extend+0xd4>
200c904: 80 a0 40 1d cmp %g1, %i5
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
200c908: 10 bf ff 66 b 200c6a0 <_Heap_Extend+0x2c>
200c90c: a2 10 20 00 clr %l1
);
}
if ( merge_above_block != NULL ) {
_Heap_Merge_above( heap, merge_above_block, extend_area_end );
} else if ( link_above_block != NULL ) {
200c910: 80 a5 60 00 cmp %l5, 0
200c914: 02 bf ff d7 be 200c870 <_Heap_Extend+0x1fc>
200c918: 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;
200c91c: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200c920: c2 07 bf fc ld [ %fp + -4 ], %g1
200c924: 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 );
200c928: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200c92c: 84 10 c0 02 or %g3, %g2, %g2
200c930: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200c934: c4 00 60 04 ld [ %g1 + 4 ], %g2
200c938: 84 10 a0 01 or %g2, 1, %g2
200c93c: 10 bf ff cd b 200c870 <_Heap_Extend+0x1fc>
200c940: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200c944: 32 bf ff cf bne,a 200c880 <_Heap_Extend+0x20c>
200c948: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200c94c: d2 07 bf f8 ld [ %fp + -8 ], %o1
200c950: 7f ff ff 3f call 200c64c <_Heap_Free_block>
200c954: 90 10 00 18 mov %i0, %o0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200c958: 10 bf ff ca b 200c880 <_Heap_Extend+0x20c>
200c95c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
_Heap_Merge_below( heap, extend_area_begin, merge_below_block );
} else if ( link_below_block != NULL ) {
200c960: 80 a5 a0 00 cmp %l6, 0
200c964: 02 bf ff b0 be 200c824 <_Heap_Extend+0x1b0>
200c968: 80 a4 e0 00 cmp %l3, 0
{
uintptr_t const last_block_begin = (uintptr_t) last_block;
uintptr_t const link_begin = (uintptr_t) link;
last_block->size_and_flag =
(link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED;
200c96c: ac 25 80 02 sub %l6, %g2, %l6
200c970: 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 =
200c974: 10 bf ff ac b 200c824 <_Heap_Extend+0x1b0>
200c978: ec 20 a0 04 st %l6, [ %g2 + 4 ]
0200c378 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200c378: 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 ) {
200c37c: 80 a6 60 00 cmp %i1, 0
200c380: 02 80 00 56 be 200c4d8 <_Heap_Free+0x160>
200c384: 84 10 20 01 mov 1, %g2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200c388: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200c38c: 40 00 16 46 call 2011ca4 <.urem>
200c390: 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
200c394: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200c398: 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);
200c39c: 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;
200c3a0: 80 a7 40 01 cmp %i5, %g1
200c3a4: 0a 80 00 4d bcs 200c4d8 <_Heap_Free+0x160>
200c3a8: 84 10 20 00 clr %g2
200c3ac: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
200c3b0: 80 a7 40 04 cmp %i5, %g4
200c3b4: 38 80 00 4a bgu,a 200c4dc <_Heap_Free+0x164>
200c3b8: b0 08 a0 01 and %g2, 1, %i0
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c3bc: de 07 60 04 ld [ %i5 + 4 ], %o7
- 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;
200c3c0: b2 0b ff fe and %o7, -2, %i1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200c3c4: 86 06 40 1d add %i1, %i5, %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;
200c3c8: 80 a0 40 03 cmp %g1, %g3
200c3cc: 38 80 00 44 bgu,a 200c4dc <_Heap_Free+0x164> <== NEVER TAKEN
200c3d0: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200c3d4: 80 a1 00 03 cmp %g4, %g3
200c3d8: 2a 80 00 41 bcs,a 200c4dc <_Heap_Free+0x164> <== NEVER TAKEN
200c3dc: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200c3e0: da 00 e0 04 ld [ %g3 + 4 ], %o5
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200c3e4: 80 8b 60 01 btst 1, %o5
200c3e8: 02 80 00 3c be 200c4d8 <_Heap_Free+0x160> <== NEVER TAKEN
200c3ec: 98 0b 7f fe and %o5, -2, %o4
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 ));
200c3f0: 80 a1 00 03 cmp %g4, %g3
200c3f4: 02 80 00 06 be 200c40c <_Heap_Free+0x94>
200c3f8: 9a 10 20 00 clr %o5
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c3fc: 84 00 c0 0c add %g3, %o4, %g2
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
200c400: da 00 a0 04 ld [ %g2 + 4 ], %o5
200c404: 9a 0b 60 01 and %o5, 1, %o5
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
200c408: 9a 1b 60 01 xor %o5, 1, %o5
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
if ( !_Heap_Is_prev_used( block ) ) {
200c40c: 80 8b e0 01 btst 1, %o7
200c410: 12 80 00 1c bne 200c480 <_Heap_Free+0x108>
200c414: 80 8b 60 ff btst 0xff, %o5
uintptr_t const prev_size = block->prev_size;
200c418: 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);
200c41c: 9e 27 40 0b sub %i5, %o3, %o7
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;
200c420: 80 a0 40 0f cmp %g1, %o7
200c424: 18 80 00 2d bgu 200c4d8 <_Heap_Free+0x160> <== NEVER TAKEN
200c428: 84 10 20 00 clr %g2
200c42c: 80 a1 00 0f cmp %g4, %o7
200c430: 2a 80 00 2b bcs,a 200c4dc <_Heap_Free+0x164> <== NEVER TAKEN
200c434: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
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;
200c438: c2 03 e0 04 ld [ %o7 + 4 ], %g1
return( false );
}
/* As we always coalesce free blocks, the block that preceedes prev_block
must have been used. */
if ( !_Heap_Is_prev_used ( prev_block) ) {
200c43c: 80 88 60 01 btst 1, %g1
200c440: 02 80 00 26 be 200c4d8 <_Heap_Free+0x160> <== NEVER TAKEN
200c444: 80 8b 60 ff btst 0xff, %o5
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200c448: 02 80 00 39 be 200c52c <_Heap_Free+0x1b4>
200c44c: 96 06 40 0b add %i1, %o3, %o3
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c450: c2 00 e0 08 ld [ %g3 + 8 ], %g1
200c454: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
200c458: c6 06 20 38 ld [ %i0 + 0x38 ], %g3
RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block )
{
Heap_Block *next = block->next;
Heap_Block *prev = block->prev;
prev->next = next;
200c45c: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
200c460: c4 20 60 0c st %g2, [ %g1 + 0xc ]
200c464: 82 00 ff ff add %g3, -1, %g1
200c468: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
200c46c: 98 02 c0 0c add %o3, %o4, %o4
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200c470: 82 13 20 01 or %o4, 1, %g1
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
200c474: d8 23 00 0f st %o4, [ %o4 + %o7 ]
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;
200c478: 10 80 00 0e b 200c4b0 <_Heap_Free+0x138>
200c47c: c2 23 e0 04 st %g1, [ %o7 + 4 ]
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
200c480: 22 80 00 19 be,a 200c4e4 <_Heap_Free+0x16c>
200c484: c4 06 20 08 ld [ %i0 + 8 ], %g2
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200c488: c4 00 e0 08 ld [ %g3 + 8 ], %g2
200c48c: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
)
{
Heap_Block *next = old_block->next;
Heap_Block *prev = old_block->prev;
new_block->next = next;
200c490: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = prev;
200c494: c2 27 60 0c st %g1, [ %i5 + 0xc ]
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
200c498: 98 03 00 19 add %o4, %i1, %o4
next->prev = new_block;
200c49c: fa 20 a0 0c st %i5, [ %g2 + 0xc ]
prev->next = new_block;
200c4a0: fa 20 60 08 st %i5, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200c4a4: 84 13 20 01 or %o4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200c4a8: d8 23 00 1d st %o4, [ %o4 + %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;
200c4ac: c4 27 60 04 st %g2, [ %i5 + 4 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200c4b0: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
200c4b4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->free_size += block_size;
200c4b8: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200c4bc: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
200c4c0: 82 00 60 01 inc %g1
stats->free_size += block_size;
200c4c4: b2 00 c0 19 add %g3, %i1, %i1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200c4c8: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
200c4cc: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->free_size += block_size;
200c4d0: f2 26 20 30 st %i1, [ %i0 + 0x30 ]
return( true );
200c4d4: 84 10 20 01 mov 1, %g2
}
200c4d8: b0 08 a0 01 and %g2, 1, %i0
200c4dc: 81 c7 e0 08 ret
200c4e0: 81 e8 00 00 restore
next_block->prev_size = size;
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
200c4e4: 82 16 60 01 or %i1, 1, %g1
200c4e8: c2 27 60 04 st %g1, [ %i5 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200c4ec: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200c4f0: f0 27 60 0c st %i0, [ %i5 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200c4f4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200c4f8: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200c4fc: fa 20 a0 0c st %i5, [ %g2 + 0xc ]
} 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;
200c500: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
200c504: f2 26 40 1d st %i1, [ %i1 + %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;
200c508: c4 20 e0 04 st %g2, [ %g3 + 4 ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
if ( stats->max_free_blocks < stats->free_blocks ) {
200c50c: c4 06 20 3c ld [ %i0 + 0x3c ], %g2
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200c510: 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;
200c514: fa 26 20 08 st %i5, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200c518: 80 a0 40 02 cmp %g1, %g2
200c51c: 08 bf ff e5 bleu 200c4b0 <_Heap_Free+0x138>
200c520: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200c524: 10 bf ff e3 b 200c4b0 <_Heap_Free+0x138>
200c528: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
} else { /* coalesce prev */
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200c52c: 82 12 e0 01 or %o3, 1, %g1
200c530: c2 23 e0 04 st %g1, [ %o7 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200c534: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
200c538: d6 26 40 1d st %o3, [ %i1 + %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;
200c53c: 82 08 7f fe and %g1, -2, %g1
200c540: 10 bf ff dc b 200c4b0 <_Heap_Free+0x138>
200c544: c2 20 e0 04 st %g1, [ %g3 + 4 ]
0200d0b8 <_Heap_Get_information>:
void _Heap_Get_information(
Heap_Control *the_heap,
Heap_Information_block *the_info
)
{
200d0b8: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *the_block = the_heap->first_block;
200d0bc: fa 06 20 20 ld [ %i0 + 0x20 ], %i5
Heap_Block *const end = the_heap->last_block;
200d0c0: f8 06 20 24 ld [ %i0 + 0x24 ], %i4
memset(the_info, 0, sizeof(*the_info));
200d0c4: 92 10 20 00 clr %o1
200d0c8: 90 10 00 19 mov %i1, %o0
200d0cc: 40 00 09 16 call 200f524 <memset>
200d0d0: 94 10 20 18 mov 0x18, %o2
while ( the_block != end ) {
200d0d4: 80 a7 40 1c cmp %i5, %i4
200d0d8: 02 80 00 17 be 200d134 <_Heap_Get_information+0x7c> <== NEVER TAKEN
200d0dc: 01 00 00 00 nop
200d0e0: c6 07 60 04 ld [ %i5 + 4 ], %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;
200d0e4: 84 08 ff fe and %g3, -2, %g2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d0e8: ba 07 40 02 add %i5, %g2, %i5
if ( info->largest < the_size )
info->largest = the_size;
the_block = next_block;
}
}
200d0ec: c6 07 60 04 ld [ %i5 + 4 ], %g3
while ( the_block != end ) {
uintptr_t const the_size = _Heap_Block_size(the_block);
Heap_Block *const next_block = _Heap_Block_at(the_block, the_size);
Heap_Information *info;
if ( _Heap_Is_prev_used(next_block) )
200d0f0: 80 88 e0 01 btst 1, %g3
200d0f4: 02 80 00 03 be 200d100 <_Heap_Get_information+0x48>
200d0f8: 82 10 00 19 mov %i1, %g1
info = &the_info->Used;
200d0fc: 82 06 60 0c add %i1, 0xc, %g1
else
info = &the_info->Free;
info->number++;
200d100: de 00 40 00 ld [ %g1 ], %o7
info->total += the_size;
200d104: f0 00 60 08 ld [ %g1 + 8 ], %i0
if ( info->largest < the_size )
200d108: c8 00 60 04 ld [ %g1 + 4 ], %g4
if ( _Heap_Is_prev_used(next_block) )
info = &the_info->Used;
else
info = &the_info->Free;
info->number++;
200d10c: 9e 03 e0 01 inc %o7
info->total += the_size;
200d110: b0 06 00 02 add %i0, %g2, %i0
if ( _Heap_Is_prev_used(next_block) )
info = &the_info->Used;
else
info = &the_info->Free;
info->number++;
200d114: de 20 40 00 st %o7, [ %g1 ]
info->total += the_size;
if ( info->largest < the_size )
200d118: 80 a1 00 02 cmp %g4, %g2
200d11c: 1a 80 00 03 bcc 200d128 <_Heap_Get_information+0x70>
200d120: f0 20 60 08 st %i0, [ %g1 + 8 ]
info->largest = the_size;
200d124: c4 20 60 04 st %g2, [ %g1 + 4 ]
Heap_Block *the_block = the_heap->first_block;
Heap_Block *const end = the_heap->last_block;
memset(the_info, 0, sizeof(*the_info));
while ( the_block != end ) {
200d128: 80 a7 00 1d cmp %i4, %i5
200d12c: 12 bf ff ef bne 200d0e8 <_Heap_Get_information+0x30>
200d130: 84 08 ff fe and %g3, -2, %g2
200d134: 81 c7 e0 08 ret
200d138: 81 e8 00 00 restore
02013844 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
2013844: 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);
2013848: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
201384c: 7f ff f9 16 call 2011ca4 <.urem>
2013850: 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
2013854: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
2013858: 84 06 7f f8 add %i1, -8, %g2
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
201385c: 84 20 80 08 sub %g2, %o0, %g2
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
2013860: 80 a0 80 01 cmp %g2, %g1
2013864: 0a 80 00 16 bcs 20138bc <_Heap_Size_of_alloc_area+0x78>
2013868: 86 10 20 00 clr %g3
201386c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
2013870: 80 a0 80 04 cmp %g2, %g4
2013874: 18 80 00 13 bgu 20138c0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
2013878: b0 08 e0 01 and %g3, 1, %i0
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
201387c: f0 00 a0 04 ld [ %g2 + 4 ], %i0
2013880: b0 0e 3f fe and %i0, -2, %i0
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
2013884: 84 06 00 02 add %i0, %g2, %g2
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
2013888: 80 a0 40 02 cmp %g1, %g2
201388c: 18 80 00 0d bgu 20138c0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
2013890: b0 08 e0 01 and %g3, 1, %i0
2013894: 80 a1 00 02 cmp %g4, %g2
2013898: 0a 80 00 0a bcs 20138c0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201389c: 01 00 00 00 nop
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
20138a0: c2 00 a0 04 ld [ %g2 + 4 ], %g1
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if (
!_Heap_Is_block_in_heap( heap, next_block )
|| !_Heap_Is_prev_used( next_block )
20138a4: 80 88 60 01 btst 1, %g1
20138a8: 02 80 00 06 be 20138c0 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
20138ac: 84 20 80 19 sub %g2, %i1, %g2
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
20138b0: 86 10 20 01 mov 1, %g3
|| !_Heap_Is_prev_used( next_block )
) {
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
20138b4: 84 00 a0 04 add %g2, 4, %g2
20138b8: c4 26 80 00 st %g2, [ %i2 ]
return true;
}
20138bc: b0 08 e0 01 and %g3, 1, %i0
20138c0: 81 c7 e0 08 ret
20138c4: 81 e8 00 00 restore
0200868c <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
200868c: 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;
2008690: 3b 00 80 21 sethi %hi(0x2008400), %i5
Heap_Control *heap,
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
2008694: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
2008698: f6 06 20 14 ld [ %i0 + 0x14 ], %i3
Heap_Block *const first_block = heap->first_block;
200869c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
Heap_Block *const last_block = heap->last_block;
20086a0: 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;
20086a4: 80 a6 a0 00 cmp %i2, 0
20086a8: 02 80 00 04 be 20086b8 <_Heap_Walk+0x2c>
20086ac: ba 17 62 20 or %i5, 0x220, %i5
20086b0: 3b 00 80 21 sethi %hi(0x2008400), %i5
20086b4: ba 17 62 28 or %i5, 0x228, %i5 ! 2008628 <_Heap_Walk_print>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
20086b8: 03 00 80 60 sethi %hi(0x2018000), %g1
20086bc: c4 00 60 4c ld [ %g1 + 0x4c ], %g2 ! 201804c <_System_state_Current>
20086c0: 80 a0 a0 03 cmp %g2, 3
20086c4: 02 80 00 05 be 20086d8 <_Heap_Walk+0x4c>
20086c8: 82 10 20 01 mov 1, %g1
block = next_block;
} while ( block != first_block );
return true;
}
20086cc: b0 08 60 01 and %g1, 1, %i0
20086d0: 81 c7 e0 08 ret
20086d4: 81 e8 00 00 restore
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)(
20086d8: da 06 20 18 ld [ %i0 + 0x18 ], %o5
20086dc: c6 06 20 1c ld [ %i0 + 0x1c ], %g3
20086e0: c4 06 20 08 ld [ %i0 + 8 ], %g2
20086e4: c2 06 20 0c ld [ %i0 + 0xc ], %g1
20086e8: 90 10 00 19 mov %i1, %o0
20086ec: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
20086f0: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
20086f4: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
20086f8: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
20086fc: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2008700: 92 10 20 00 clr %o1
2008704: 96 10 00 10 mov %l0, %o3
2008708: 15 00 80 55 sethi %hi(0x2015400), %o2
200870c: 98 10 00 1b mov %i3, %o4
2008710: 9f c7 40 00 call %i5
2008714: 94 12 a2 00 or %o2, 0x200, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
2008718: 80 a4 20 00 cmp %l0, 0
200871c: 02 80 00 28 be 20087bc <_Heap_Walk+0x130>
2008720: 80 8c 20 07 btst 7, %l0
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
2008724: 12 80 00 2d bne 20087d8 <_Heap_Walk+0x14c>
2008728: 90 10 00 1b mov %i3, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200872c: 7f ff e4 e8 call 2001acc <.urem>
2008730: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
2008734: 80 a2 20 00 cmp %o0, 0
2008738: 12 80 00 30 bne 20087f8 <_Heap_Walk+0x16c>
200873c: 90 07 20 08 add %i4, 8, %o0
2008740: 7f ff e4 e3 call 2001acc <.urem>
2008744: 92 10 00 10 mov %l0, %o1
);
return false;
}
if (
2008748: 80 a2 20 00 cmp %o0, 0
200874c: 32 80 00 33 bne,a 2008818 <_Heap_Walk+0x18c>
2008750: 90 10 00 19 mov %i1, %o0
block = next_block;
} while ( block != first_block );
return true;
}
2008754: e8 07 20 04 ld [ %i4 + 4 ], %l4
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2008758: 80 8d 20 01 btst 1, %l4
200875c: 22 80 00 36 be,a 2008834 <_Heap_Walk+0x1a8>
2008760: 90 10 00 19 mov %i1, %o0
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2008764: c2 04 60 04 ld [ %l1 + 4 ], %g1
2008768: 82 08 7f fe and %g1, -2, %g1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200876c: 82 04 40 01 add %l1, %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;
2008770: c4 00 60 04 ld [ %g1 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
2008774: 80 88 a0 01 btst 1, %g2
2008778: 02 80 00 0a be 20087a0 <_Heap_Walk+0x114>
200877c: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
2008780: 02 80 00 33 be 200884c <_Heap_Walk+0x1c0>
2008784: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
2008788: 92 10 20 01 mov 1, %o1
200878c: 15 00 80 55 sethi %hi(0x2015400), %o2
2008790: 9f c7 40 00 call %i5
2008794: 94 12 a3 78 or %o2, 0x378, %o2 ! 2015778 <_Status_Object_name_errors_to_status+0x1f0>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008798: 10 bf ff cd b 20086cc <_Heap_Walk+0x40>
200879c: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
20087a0: 90 10 00 19 mov %i1, %o0
20087a4: 92 10 20 01 mov 1, %o1
20087a8: 15 00 80 55 sethi %hi(0x2015400), %o2
20087ac: 9f c7 40 00 call %i5
20087b0: 94 12 a3 60 or %o2, 0x360, %o2 ! 2015760 <_Status_Object_name_errors_to_status+0x1d8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20087b4: 10 bf ff c6 b 20086cc <_Heap_Walk+0x40>
20087b8: 82 10 20 00 clr %g1
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
(*printer)( source, true, "page size is zero\n" );
20087bc: 90 10 00 19 mov %i1, %o0
20087c0: 92 10 20 01 mov 1, %o1
20087c4: 15 00 80 55 sethi %hi(0x2015400), %o2
20087c8: 9f c7 40 00 call %i5
20087cc: 94 12 a2 98 or %o2, 0x298, %o2 ! 2015698 <_Status_Object_name_errors_to_status+0x110>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20087d0: 10 bf ff bf b 20086cc <_Heap_Walk+0x40>
20087d4: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
20087d8: 90 10 00 19 mov %i1, %o0
20087dc: 92 10 20 01 mov 1, %o1
20087e0: 96 10 00 10 mov %l0, %o3
20087e4: 15 00 80 55 sethi %hi(0x2015400), %o2
20087e8: 9f c7 40 00 call %i5
20087ec: 94 12 a2 b0 or %o2, 0x2b0, %o2 ! 20156b0 <_Status_Object_name_errors_to_status+0x128>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20087f0: 10 bf ff b7 b 20086cc <_Heap_Walk+0x40>
20087f4: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
20087f8: 90 10 00 19 mov %i1, %o0
20087fc: 92 10 20 01 mov 1, %o1
2008800: 96 10 00 1b mov %i3, %o3
2008804: 15 00 80 55 sethi %hi(0x2015400), %o2
2008808: 9f c7 40 00 call %i5
200880c: 94 12 a2 d0 or %o2, 0x2d0, %o2 ! 20156d0 <_Status_Object_name_errors_to_status+0x148>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008810: 10 bf ff af b 20086cc <_Heap_Walk+0x40>
2008814: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
2008818: 92 10 20 01 mov 1, %o1
200881c: 96 10 00 1c mov %i4, %o3
2008820: 15 00 80 55 sethi %hi(0x2015400), %o2
2008824: 9f c7 40 00 call %i5
2008828: 94 12 a2 f8 or %o2, 0x2f8, %o2 ! 20156f8 <_Status_Object_name_errors_to_status+0x170>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200882c: 10 bf ff a8 b 20086cc <_Heap_Walk+0x40>
2008830: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
2008834: 92 10 20 01 mov 1, %o1
2008838: 15 00 80 55 sethi %hi(0x2015400), %o2
200883c: 9f c7 40 00 call %i5
2008840: 94 12 a3 30 or %o2, 0x330, %o2 ! 2015730 <_Status_Object_name_errors_to_status+0x1a8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008844: 10 bf ff a2 b 20086cc <_Heap_Walk+0x40>
2008848: 82 10 20 00 clr %g1
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200884c: f4 06 20 08 ld [ %i0 + 8 ], %i2
int source,
Heap_Walk_printer printer,
Heap_Control *heap
)
{
uintptr_t const page_size = heap->page_size;
2008850: ea 06 20 10 ld [ %i0 + 0x10 ], %l5
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 ) {
2008854: 80 a6 00 1a cmp %i0, %i2
2008858: 02 80 00 0d be 200888c <_Heap_Walk+0x200>
200885c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
2008860: 80 a0 40 1a cmp %g1, %i2
2008864: 28 80 00 bc bleu,a 2008b54 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN
2008868: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
200886c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
2008870: 92 10 20 01 mov 1, %o1
2008874: 96 10 00 1a mov %i2, %o3
2008878: 15 00 80 55 sethi %hi(0x2015400), %o2
200887c: 9f c7 40 00 call %i5
2008880: 94 12 a3 a8 or %o2, 0x3a8, %o2 ! 20157a8 <_Status_Object_name_errors_to_status+0x220>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008884: 10 bf ff 92 b 20086cc <_Heap_Walk+0x40>
2008888: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200888c: 2d 00 80 56 sethi %hi(0x2015800), %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)(
2008890: 2f 00 80 56 sethi %hi(0x2015800), %l7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008894: a4 10 00 1c mov %i4, %l2
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008898: ac 15 a1 d8 or %l6, 0x1d8, %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)(
200889c: ae 15 e1 c0 or %l7, 0x1c0, %l7
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
20088a0: 2b 00 80 56 sethi %hi(0x2015800), %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;
20088a4: a6 0d 3f fe and %l4, -2, %l3
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
20088a8: b4 04 c0 12 add %l3, %l2, %i2
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;
20088ac: 80 a0 40 1a cmp %g1, %i2
20088b0: 28 80 00 0b bleu,a 20088dc <_Heap_Walk+0x250> <== ALWAYS TAKEN
20088b4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
uintptr_t const next_block_begin = (uintptr_t) next_block;
bool const is_not_last_block = block != last_block;
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
(*printer)(
20088b8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
20088bc: 92 10 20 01 mov 1, %o1
20088c0: 96 10 00 12 mov %l2, %o3
20088c4: 15 00 80 56 sethi %hi(0x2015800), %o2
20088c8: 98 10 00 1a mov %i2, %o4
20088cc: 9f c7 40 00 call %i5
20088d0: 94 12 a0 50 or %o2, 0x50, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
20088d4: 10 bf ff 7e b 20086cc <_Heap_Walk+0x40>
20088d8: 82 10 20 00 clr %g1
20088dc: 80 a0 40 1a cmp %g1, %i2
20088e0: 0a bf ff f7 bcs 20088bc <_Heap_Walk+0x230>
20088e4: 90 10 00 19 mov %i1, %o0
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
bool const prev_used = _Heap_Is_prev_used( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
uintptr_t const next_block_begin = (uintptr_t) next_block;
bool const is_not_last_block = block != last_block;
20088e8: 82 1c 80 11 xor %l2, %l1, %g1
20088ec: 80 a0 00 01 cmp %g0, %g1
20088f0: 82 40 20 00 addx %g0, 0, %g1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
20088f4: 90 10 00 13 mov %l3, %o0
20088f8: c2 27 bf fc st %g1, [ %fp + -4 ]
20088fc: 7f ff e4 74 call 2001acc <.urem>
2008900: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
2008904: 80 a2 20 00 cmp %o0, 0
2008908: 02 80 00 05 be 200891c <_Heap_Walk+0x290>
200890c: c2 07 bf fc ld [ %fp + -4 ], %g1
2008910: 80 88 60 ff btst 0xff, %g1
2008914: 12 80 00 76 bne 2008aec <_Heap_Walk+0x460>
2008918: 90 10 00 19 mov %i1, %o0
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200891c: 80 a6 c0 13 cmp %i3, %l3
2008920: 08 80 00 05 bleu 2008934 <_Heap_Walk+0x2a8>
2008924: 80 a4 80 1a cmp %l2, %i2
2008928: 80 88 60 ff btst 0xff, %g1
200892c: 12 80 00 78 bne 2008b0c <_Heap_Walk+0x480> <== ALWAYS TAKEN
2008930: 80 a4 80 1a cmp %l2, %i2
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
2008934: 2a 80 00 06 bcs,a 200894c <_Heap_Walk+0x2c0>
2008938: c2 06 a0 04 ld [ %i2 + 4 ], %g1
200893c: 80 88 60 ff btst 0xff, %g1
2008940: 12 80 00 7d bne 2008b34 <_Heap_Walk+0x4a8>
2008944: 90 10 00 19 mov %i1, %o0
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
2008948: c2 06 a0 04 ld [ %i2 + 4 ], %g1
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
200894c: 80 88 60 01 btst 1, %g1
2008950: 02 80 00 19 be 20089b4 <_Heap_Walk+0x328>
2008954: a8 0d 20 01 and %l4, 1, %l4
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
2008958: 80 a5 20 00 cmp %l4, 0
200895c: 22 80 00 0e be,a 2008994 <_Heap_Walk+0x308>
2008960: da 04 80 00 ld [ %l2 ], %o5
(*printer)(
2008964: 90 10 00 19 mov %i1, %o0
2008968: 92 10 20 00 clr %o1
200896c: 94 10 00 17 mov %l7, %o2
2008970: 96 10 00 12 mov %l2, %o3
2008974: 9f c7 40 00 call %i5
2008978: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
200897c: 80 a7 00 1a cmp %i4, %i2
2008980: 02 80 00 42 be 2008a88 <_Heap_Walk+0x3fc>
2008984: a4 10 00 1a mov %i2, %l2
2008988: e8 06 a0 04 ld [ %i2 + 4 ], %l4
200898c: 10 bf ff c6 b 20088a4 <_Heap_Walk+0x218>
2008990: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008994: 96 10 00 12 mov %l2, %o3
2008998: 90 10 00 19 mov %i1, %o0
200899c: 92 10 20 00 clr %o1
20089a0: 94 10 00 16 mov %l6, %o2
20089a4: 9f c7 40 00 call %i5
20089a8: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
20089ac: 10 bf ff f5 b 2008980 <_Heap_Walk+0x2f4>
20089b0: 80 a7 00 1a cmp %i4, %i2
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 ?
20089b4: da 04 a0 0c ld [ %l2 + 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)(
20089b8: c2 06 20 08 ld [ %i0 + 8 ], %g1
20089bc: 05 00 80 55 sethi %hi(0x2015400), %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;
20089c0: c8 06 20 0c ld [ %i0 + 0xc ], %g4
20089c4: 80 a0 40 0d cmp %g1, %o5
20089c8: 02 80 00 05 be 20089dc <_Heap_Walk+0x350>
20089cc: 86 10 a1 c0 or %g2, 0x1c0, %g3
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
20089d0: 80 a6 00 0d cmp %i0, %o5
20089d4: 02 80 00 3c be 2008ac4 <_Heap_Walk+0x438>
20089d8: 86 15 61 88 or %l5, 0x188, %g3
block->next,
block->next == last_free_block ?
20089dc: c2 04 a0 08 ld [ %l2 + 8 ], %g1
Heap_Block *const last_free_block = _Heap_Free_list_last( heap );
bool const prev_used = _Heap_Is_prev_used( block );
uintptr_t const block_size = _Heap_Block_size( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
(*printer)(
20089e0: 1f 00 80 55 sethi %hi(0x2015400), %o7
20089e4: 80 a1 00 01 cmp %g4, %g1
20089e8: 02 80 00 05 be 20089fc <_Heap_Walk+0x370>
20089ec: 84 13 e1 e0 or %o7, 0x1e0, %g2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
20089f0: 80 a6 00 01 cmp %i0, %g1
20089f4: 02 80 00 31 be 2008ab8 <_Heap_Walk+0x42c>
20089f8: 84 15 61 88 or %l5, 0x188, %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)(
20089fc: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
2008a00: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2008a04: c4 23 a0 64 st %g2, [ %sp + 0x64 ]
2008a08: 90 10 00 19 mov %i1, %o0
2008a0c: 92 10 20 00 clr %o1
2008a10: 15 00 80 56 sethi %hi(0x2015800), %o2
2008a14: 96 10 00 12 mov %l2, %o3
2008a18: 94 12 a1 18 or %o2, 0x118, %o2
2008a1c: 9f c7 40 00 call %i5
2008a20: 98 10 00 13 mov %l3, %o4
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
2008a24: da 06 80 00 ld [ %i2 ], %o5
2008a28: 80 a4 c0 0d cmp %l3, %o5
2008a2c: 12 80 00 19 bne 2008a90 <_Heap_Walk+0x404>
2008a30: 80 a5 20 00 cmp %l4, 0
);
return false;
}
if ( !prev_used ) {
2008a34: 02 80 00 27 be 2008ad0 <_Heap_Walk+0x444>
2008a38: 90 10 00 19 mov %i1, %o0
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
2008a3c: c2 06 20 08 ld [ %i0 + 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 ) {
2008a40: 80 a6 00 01 cmp %i0, %g1
2008a44: 02 80 00 0b be 2008a70 <_Heap_Walk+0x3e4> <== NEVER TAKEN
2008a48: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
2008a4c: 80 a4 80 01 cmp %l2, %g1
2008a50: 02 bf ff cc be 2008980 <_Heap_Walk+0x2f4>
2008a54: 80 a7 00 1a cmp %i4, %i2
return true;
}
free_block = free_block->next;
2008a58: 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 ) {
2008a5c: 80 a6 00 01 cmp %i0, %g1
2008a60: 12 bf ff fc bne 2008a50 <_Heap_Walk+0x3c4>
2008a64: 80 a4 80 01 cmp %l2, %g1
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
2008a68: 90 10 00 19 mov %i1, %o0
2008a6c: 92 10 20 01 mov 1, %o1
2008a70: 96 10 00 12 mov %l2, %o3
2008a74: 15 00 80 56 sethi %hi(0x2015800), %o2
2008a78: 9f c7 40 00 call %i5
2008a7c: 94 12 a2 00 or %o2, 0x200, %o2 ! 2015a00 <_Status_Object_name_errors_to_status+0x478>
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008a80: 10 bf ff 13 b 20086cc <_Heap_Walk+0x40>
2008a84: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
2008a88: 10 bf ff 11 b 20086cc <_Heap_Walk+0x40>
2008a8c: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
2008a90: f4 23 a0 5c st %i2, [ %sp + 0x5c ]
2008a94: 90 10 00 19 mov %i1, %o0
2008a98: 92 10 20 01 mov 1, %o1
2008a9c: 96 10 00 12 mov %l2, %o3
2008aa0: 15 00 80 56 sethi %hi(0x2015800), %o2
2008aa4: 98 10 00 13 mov %l3, %o4
2008aa8: 9f c7 40 00 call %i5
2008aac: 94 12 a1 50 or %o2, 0x150, %o2
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008ab0: 10 bf ff 07 b 20086cc <_Heap_Walk+0x40>
2008ab4: 82 10 20 00 clr %g1
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008ab8: 05 00 80 55 sethi %hi(0x2015400), %g2
2008abc: 10 bf ff d0 b 20089fc <_Heap_Walk+0x370>
2008ac0: 84 10 a1 f0 or %g2, 0x1f0, %g2 ! 20155f0 <_Status_Object_name_errors_to_status+0x68>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
2008ac4: 07 00 80 55 sethi %hi(0x2015400), %g3
2008ac8: 10 bf ff c5 b 20089dc <_Heap_Walk+0x350>
2008acc: 86 10 e1 d0 or %g3, 0x1d0, %g3 ! 20155d0 <_Status_Object_name_errors_to_status+0x48>
return false;
}
if ( !prev_used ) {
(*printer)(
2008ad0: 92 10 20 01 mov 1, %o1
2008ad4: 96 10 00 12 mov %l2, %o3
2008ad8: 15 00 80 56 sethi %hi(0x2015800), %o2
2008adc: 9f c7 40 00 call %i5
2008ae0: 94 12 a1 90 or %o2, 0x190, %o2 ! 2015990 <_Status_Object_name_errors_to_status+0x408>
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008ae4: 10 bf fe fa b 20086cc <_Heap_Walk+0x40>
2008ae8: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
2008aec: 92 10 20 01 mov 1, %o1
2008af0: 96 10 00 12 mov %l2, %o3
2008af4: 15 00 80 56 sethi %hi(0x2015800), %o2
2008af8: 98 10 00 13 mov %l3, %o4
2008afc: 9f c7 40 00 call %i5
2008b00: 94 12 a0 80 or %o2, 0x80, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
2008b04: 10 bf fe f2 b 20086cc <_Heap_Walk+0x40>
2008b08: 82 10 20 00 clr %g1
}
if ( block_size < min_block_size && is_not_last_block ) {
(*printer)(
2008b0c: 90 10 00 19 mov %i1, %o0
2008b10: 92 10 20 01 mov 1, %o1
2008b14: 96 10 00 12 mov %l2, %o3
2008b18: 15 00 80 56 sethi %hi(0x2015800), %o2
2008b1c: 98 10 00 13 mov %l3, %o4
2008b20: 94 12 a0 b0 or %o2, 0xb0, %o2
2008b24: 9f c7 40 00 call %i5
2008b28: 9a 10 00 1b mov %i3, %o5
block,
block_size,
min_block_size
);
return false;
2008b2c: 10 bf fe e8 b 20086cc <_Heap_Walk+0x40>
2008b30: 82 10 20 00 clr %g1
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
(*printer)(
2008b34: 92 10 20 01 mov 1, %o1
2008b38: 96 10 00 12 mov %l2, %o3
2008b3c: 15 00 80 56 sethi %hi(0x2015800), %o2
2008b40: 98 10 00 1a mov %i2, %o4
2008b44: 9f c7 40 00 call %i5
2008b48: 94 12 a0 e0 or %o2, 0xe0, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
2008b4c: 10 bf fe e0 b 20086cc <_Heap_Walk+0x40>
2008b50: 82 10 20 00 clr %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;
2008b54: 80 a6 80 13 cmp %i2, %l3
2008b58: 18 bf ff 46 bgu 2008870 <_Heap_Walk+0x1e4> <== NEVER TAKEN
2008b5c: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008b60: c2 27 bf fc st %g1, [ %fp + -4 ]
2008b64: 90 06 a0 08 add %i2, 8, %o0
2008b68: 7f ff e3 d9 call 2001acc <.urem>
2008b6c: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008b70: 80 a2 20 00 cmp %o0, 0
2008b74: 12 80 00 36 bne 2008c4c <_Heap_Walk+0x5c0> <== NEVER TAKEN
2008b78: c2 07 bf fc ld [ %fp + -4 ], %g1
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2008b7c: c4 06 a0 04 ld [ %i2 + 4 ], %g2
2008b80: 84 08 bf fe and %g2, -2, %g2
block = next_block;
} while ( block != first_block );
return true;
}
2008b84: 84 06 80 02 add %i2, %g2, %g2
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
2008b88: c4 00 a0 04 ld [ %g2 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008b8c: 80 88 a0 01 btst 1, %g2
2008b90: 12 80 00 27 bne 2008c2c <_Heap_Walk+0x5a0> <== NEVER TAKEN
2008b94: 84 10 00 18 mov %i0, %g2
2008b98: 10 80 00 19 b 2008bfc <_Heap_Walk+0x570>
2008b9c: a4 10 00 1a mov %i2, %l2
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 ) {
2008ba0: 80 a6 00 1a cmp %i0, %i2
2008ba4: 02 bf ff 3a be 200888c <_Heap_Walk+0x200>
2008ba8: 80 a6 80 01 cmp %i2, %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;
2008bac: 0a bf ff 31 bcs 2008870 <_Heap_Walk+0x1e4>
2008bb0: 90 10 00 19 mov %i1, %o0
2008bb4: 80 a6 80 13 cmp %i2, %l3
2008bb8: 18 bf ff 2f bgu 2008874 <_Heap_Walk+0x1e8> <== NEVER TAKEN
2008bbc: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008bc0: c2 27 bf fc st %g1, [ %fp + -4 ]
2008bc4: 90 06 a0 08 add %i2, 8, %o0
2008bc8: 7f ff e3 c1 call 2001acc <.urem>
2008bcc: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008bd0: 80 a2 20 00 cmp %o0, 0
2008bd4: 12 80 00 1e bne 2008c4c <_Heap_Walk+0x5c0>
2008bd8: c2 07 bf fc ld [ %fp + -4 ], %g1
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2008bdc: c6 06 a0 04 ld [ %i2 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008be0: 84 10 00 12 mov %l2, %g2
2008be4: 86 08 ff fe and %g3, -2, %g3
block = next_block;
} while ( block != first_block );
return true;
}
2008be8: 86 06 80 03 add %i2, %g3, %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;
2008bec: c6 00 e0 04 ld [ %g3 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008bf0: 80 88 e0 01 btst 1, %g3
2008bf4: 12 80 00 0e bne 2008c2c <_Heap_Walk+0x5a0>
2008bf8: a4 10 00 1a mov %i2, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
2008bfc: d8 06 a0 0c ld [ %i2 + 0xc ], %o4
2008c00: 80 a3 00 02 cmp %o4, %g2
2008c04: 22 bf ff e7 be,a 2008ba0 <_Heap_Walk+0x514>
2008c08: f4 06 a0 08 ld [ %i2 + 8 ], %i2
(*printer)(
2008c0c: 90 10 00 19 mov %i1, %o0
2008c10: 92 10 20 01 mov 1, %o1
2008c14: 96 10 00 1a mov %i2, %o3
2008c18: 15 00 80 56 sethi %hi(0x2015800), %o2
2008c1c: 9f c7 40 00 call %i5
2008c20: 94 12 a0 18 or %o2, 0x18, %o2 ! 2015818 <_Status_Object_name_errors_to_status+0x290>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008c24: 10 bf fe aa b 20086cc <_Heap_Walk+0x40>
2008c28: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
2008c2c: 90 10 00 19 mov %i1, %o0
2008c30: 92 10 20 01 mov 1, %o1
2008c34: 96 10 00 1a mov %i2, %o3
2008c38: 15 00 80 55 sethi %hi(0x2015400), %o2
2008c3c: 9f c7 40 00 call %i5
2008c40: 94 12 a3 f8 or %o2, 0x3f8, %o2 ! 20157f8 <_Status_Object_name_errors_to_status+0x270>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008c44: 10 bf fe a2 b 20086cc <_Heap_Walk+0x40>
2008c48: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
2008c4c: 90 10 00 19 mov %i1, %o0
2008c50: 92 10 20 01 mov 1, %o1
2008c54: 96 10 00 1a mov %i2, %o3
2008c58: 15 00 80 55 sethi %hi(0x2015400), %o2
2008c5c: 9f c7 40 00 call %i5
2008c60: 94 12 a3 c8 or %o2, 0x3c8, %o2 ! 20157c8 <_Status_Object_name_errors_to_status+0x240>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008c64: 10 bf fe 9a b 20086cc <_Heap_Walk+0x40>
2008c68: 82 10 20 00 clr %g1
02006b70 <_IO_Initialize_all_drivers>:
*
* Output Parameters: NONE
*/
void _IO_Initialize_all_drivers( void )
{
2006b70: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
2006b74: 39 00 80 56 sethi %hi(0x2015800), %i4
2006b78: c2 07 21 f4 ld [ %i4 + 0x1f4 ], %g1 ! 20159f4 <_IO_Number_of_drivers>
2006b7c: 80 a0 60 00 cmp %g1, 0
2006b80: 02 80 00 0c be 2006bb0 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
2006b84: ba 10 20 00 clr %i5
2006b88: b8 17 21 f4 or %i4, 0x1f4, %i4
(void) rtems_io_initialize( major, 0, NULL );
2006b8c: 90 10 00 1d mov %i5, %o0
2006b90: 92 10 20 00 clr %o1
2006b94: 40 00 14 cd call 200bec8 <rtems_io_initialize>
2006b98: 94 10 20 00 clr %o2
void _IO_Initialize_all_drivers( void )
{
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
2006b9c: c2 07 00 00 ld [ %i4 ], %g1
2006ba0: ba 07 60 01 inc %i5
2006ba4: 80 a0 40 1d cmp %g1, %i5
2006ba8: 18 bf ff fa bgu 2006b90 <_IO_Initialize_all_drivers+0x20>
2006bac: 90 10 00 1d mov %i5, %o0
2006bb0: 81 c7 e0 08 ret
2006bb4: 81 e8 00 00 restore
02006aa4 <_IO_Manager_initialization>:
* workspace.
*
*/
void _IO_Manager_initialization(void)
{
2006aa4: 9d e3 bf a0 save %sp, -96, %sp
uint32_t index;
rtems_driver_address_table *driver_table;
uint32_t drivers_in_table;
uint32_t number_of_drivers;
driver_table = Configuration.Device_driver_table;
2006aa8: 03 00 80 52 sethi %hi(0x2014800), %g1
2006aac: 82 10 62 7c or %g1, 0x27c, %g1 ! 2014a7c <Configuration>
drivers_in_table = Configuration.number_of_device_drivers;
2006ab0: f8 00 60 30 ld [ %g1 + 0x30 ], %i4
number_of_drivers = Configuration.maximum_drivers;
2006ab4: f2 00 60 2c ld [ %g1 + 0x2c ], %i1
/*
* If the user claims there are less drivers than are actually in
* the table, then let's just go with the table's count.
*/
if ( number_of_drivers <= drivers_in_table )
2006ab8: 80 a7 00 19 cmp %i4, %i1
2006abc: 0a 80 00 08 bcs 2006adc <_IO_Manager_initialization+0x38>
2006ac0: fa 00 60 34 ld [ %g1 + 0x34 ], %i5
* If the maximum number of driver is the same as the number in the
* table, then we do not have to copy the driver table. They can't
* register any dynamically.
*/
if ( number_of_drivers == drivers_in_table ) {
_IO_Driver_address_table = driver_table;
2006ac4: 03 00 80 56 sethi %hi(0x2015800), %g1
2006ac8: fa 20 61 f8 st %i5, [ %g1 + 0x1f8 ] ! 20159f8 <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
2006acc: 03 00 80 56 sethi %hi(0x2015800), %g1
2006ad0: f8 20 61 f4 st %i4, [ %g1 + 0x1f4 ] ! 20159f4 <_IO_Number_of_drivers>
return;
2006ad4: 81 c7 e0 08 ret
2006ad8: 81 e8 00 00 restore
* have to allocate a new driver table and copy theirs to it.
*/
_IO_Driver_address_table = (rtems_driver_address_table *)
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
2006adc: 83 2e 60 03 sll %i1, 3, %g1
2006ae0: b5 2e 60 05 sll %i1, 5, %i2
2006ae4: b4 26 80 01 sub %i2, %g1, %i2
* The application requested extra slots in the driver table, so we
* have to allocate a new driver table and copy theirs to it.
*/
_IO_Driver_address_table = (rtems_driver_address_table *)
_Workspace_Allocate_or_fatal_error(
2006ae8: 40 00 0d 0f call 2009f24 <_Workspace_Allocate_or_fatal_error>
2006aec: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
2006af0: 03 00 80 56 sethi %hi(0x2015800), %g1
/*
* The application requested extra slots in the driver table, so we
* have to allocate a new driver table and copy theirs to it.
*/
_IO_Driver_address_table = (rtems_driver_address_table *)
2006af4: 37 00 80 56 sethi %hi(0x2015800), %i3
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
2006af8: f2 20 61 f4 st %i1, [ %g1 + 0x1f4 ]
/*
* The application requested extra slots in the driver table, so we
* have to allocate a new driver table and copy theirs to it.
*/
_IO_Driver_address_table = (rtems_driver_address_table *)
2006afc: d0 26 e1 f8 st %o0, [ %i3 + 0x1f8 ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
2006b00: 92 10 20 00 clr %o1
2006b04: 40 00 20 3f call 200ec00 <memset>
2006b08: 94 10 00 1a mov %i2, %o2
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2006b0c: 80 a7 20 00 cmp %i4, 0
2006b10: 02 bf ff f1 be 2006ad4 <_IO_Manager_initialization+0x30> <== NEVER TAKEN
2006b14: f6 06 e1 f8 ld [ %i3 + 0x1f8 ], %i3
2006b18: 82 10 20 00 clr %g1
2006b1c: 88 10 20 00 clr %g4
_IO_Driver_address_table[index] = driver_table[index];
2006b20: c4 07 40 01 ld [ %i5 + %g1 ], %g2
2006b24: 86 07 40 01 add %i5, %g1, %g3
2006b28: c4 26 c0 01 st %g2, [ %i3 + %g1 ]
2006b2c: f4 00 e0 04 ld [ %g3 + 4 ], %i2
2006b30: 84 06 c0 01 add %i3, %g1, %g2
2006b34: f4 20 a0 04 st %i2, [ %g2 + 4 ]
2006b38: f4 00 e0 08 ld [ %g3 + 8 ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2006b3c: 88 01 20 01 inc %g4
_IO_Driver_address_table[index] = driver_table[index];
2006b40: f4 20 a0 08 st %i2, [ %g2 + 8 ]
2006b44: f4 00 e0 0c ld [ %g3 + 0xc ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2006b48: 82 00 60 18 add %g1, 0x18, %g1
_IO_Driver_address_table[index] = driver_table[index];
2006b4c: f4 20 a0 0c st %i2, [ %g2 + 0xc ]
2006b50: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2006b54: 80 a1 00 1c cmp %g4, %i4
_IO_Driver_address_table[index] = driver_table[index];
2006b58: f4 20 a0 10 st %i2, [ %g2 + 0x10 ]
2006b5c: c6 00 e0 14 ld [ %g3 + 0x14 ], %g3
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2006b60: 12 bf ff f0 bne 2006b20 <_IO_Manager_initialization+0x7c>
2006b64: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
2006b68: 81 c7 e0 08 ret
2006b6c: 81 e8 00 00 restore
02007864 <_Objects_Allocate>:
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2007864: 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 )
2007868: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
200786c: 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 )
2007870: 80 a0 60 00 cmp %g1, 0
2007874: 02 80 00 19 be 20078d8 <_Objects_Allocate+0x74> <== NEVER TAKEN
2007878: 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 );
200787c: b8 07 60 20 add %i5, 0x20, %i4
2007880: 7f ff fd 64 call 2006e10 <_Chain_Get>
2007884: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
2007888: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
200788c: 80 a0 60 00 cmp %g1, 0
2007890: 02 80 00 12 be 20078d8 <_Objects_Allocate+0x74>
2007894: 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 ) {
2007898: 80 a2 20 00 cmp %o0, 0
200789c: 02 80 00 11 be 20078e0 <_Objects_Allocate+0x7c>
20078a0: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
20078a4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
20078a8: d0 16 20 0a lduh [ %i0 + 0xa ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
20078ac: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
20078b0: 40 00 28 51 call 20119f4 <.udiv>
20078b4: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
20078b8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
20078bc: 91 2a 20 02 sll %o0, 2, %o0
20078c0: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
20078c4: c4 17 60 2c lduh [ %i5 + 0x2c ], %g2
block = (uint32_t) _Objects_Get_index( the_object->id ) -
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
information->inactive_per_block[ block ]--;
20078c8: 86 00 ff ff add %g3, -1, %g3
20078cc: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
20078d0: 82 00 bf ff add %g2, -1, %g1
20078d4: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
20078d8: 81 c7 e0 08 ret
20078dc: 81 e8 00 00 restore
* If the list is empty then we are out of objects and need to
* extend information base.
*/
if ( !the_object ) {
_Objects_Extend_information( information );
20078e0: 40 00 00 10 call 2007920 <_Objects_Extend_information>
20078e4: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
20078e8: 7f ff fd 4a call 2006e10 <_Chain_Get>
20078ec: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
20078f0: b0 92 20 00 orcc %o0, 0, %i0
20078f4: 32 bf ff ed bne,a 20078a8 <_Objects_Allocate+0x44>
20078f8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
);
}
#endif
return the_object;
}
20078fc: 81 c7 e0 08 ret
2007900: 81 e8 00 00 restore
02007920 <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
2007920: 9d e3 bf 90 save %sp, -112, %sp
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
2007924: e0 06 20 34 ld [ %i0 + 0x34 ], %l0
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007928: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
200792c: 80 a4 20 00 cmp %l0, 0
2007930: 02 80 00 a6 be 2007bc8 <_Objects_Extend_information+0x2a8>
2007934: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
2007938: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2
200793c: b3 2e 60 10 sll %i1, 0x10, %i1
2007940: 92 10 00 1a mov %i2, %o1
2007944: 40 00 28 2c call 20119f4 <.udiv>
2007948: 91 36 60 10 srl %i1, 0x10, %o0
200794c: a7 2a 20 10 sll %o0, 0x10, %l3
2007950: a7 34 e0 10 srl %l3, 0x10, %l3
for ( ; block < block_count; block++ ) {
2007954: 80 a4 e0 00 cmp %l3, 0
2007958: 02 80 00 a3 be 2007be4 <_Objects_Extend_information+0x2c4><== NEVER TAKEN
200795c: 90 10 00 1a mov %i2, %o0
if ( information->object_blocks[ block ] == NULL ) {
2007960: c2 04 00 00 ld [ %l0 ], %g1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007964: ba 10 00 1c mov %i4, %i5
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
2007968: 80 a0 60 00 cmp %g1, 0
200796c: 12 80 00 08 bne 200798c <_Objects_Extend_information+0x6c><== ALWAYS TAKEN
2007970: b6 10 20 00 clr %i3
do_extend = false;
2007974: 10 80 00 a0 b 2007bf4 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED
2007978: b4 10 20 00 clr %i2 <== NOT EXECUTED
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
200797c: c2 04 00 01 ld [ %l0 + %g1 ], %g1
2007980: 80 a0 60 00 cmp %g1, 0
2007984: 22 80 00 08 be,a 20079a4 <_Objects_Extend_information+0x84>
2007988: b4 10 20 00 clr %i2
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
200798c: b6 06 e0 01 inc %i3
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
2007990: ba 07 40 1a add %i5, %i2, %i5
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
2007994: 80 a4 c0 1b cmp %l3, %i3
2007998: 18 bf ff f9 bgu 200797c <_Objects_Extend_information+0x5c>
200799c: 83 2e e0 02 sll %i3, 2, %g1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
20079a0: b4 10 20 01 mov 1, %i2
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
20079a4: b3 36 60 10 srl %i1, 0x10, %i1
/*
* We need to limit the number of objects to the maximum number
* representable in the index portion of the object Id. In the
* case of 16-bit Ids, this is only 256 object instances.
*/
if ( maximum > OBJECTS_ID_FINAL_INDEX ) {
20079a8: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
20079ac: b2 06 40 08 add %i1, %o0, %i1
/*
* We need to limit the number of objects to the maximum number
* representable in the index portion of the object Id. In the
* case of 16-bit Ids, this is only 256 object instances.
*/
if ( maximum > OBJECTS_ID_FINAL_INDEX ) {
20079b0: 82 10 63 ff or %g1, 0x3ff, %g1
20079b4: 80 a6 40 01 cmp %i1, %g1
20079b8: 18 80 00 93 bgu 2007c04 <_Objects_Extend_information+0x2e4>
20079bc: 01 00 00 00 nop
/*
* Allocate the name table, and the objects and if it fails either return or
* generate a fatal error depending on auto-extending being active.
*/
block_size = information->allocation_size * information->size;
20079c0: 40 00 27 d3 call 201190c <.umul>
20079c4: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
20079c8: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
20079cc: 80 a0 60 00 cmp %g1, 0
20079d0: 02 80 00 6a be 2007b78 <_Objects_Extend_information+0x258>
20079d4: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
20079d8: 40 00 09 45 call 2009eec <_Workspace_Allocate>
20079dc: 01 00 00 00 nop
if ( !new_object_block )
20079e0: a0 92 20 00 orcc %o0, 0, %l0
20079e4: 02 80 00 88 be 2007c04 <_Objects_Extend_information+0x2e4>
20079e8: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
20079ec: 80 8e a0 ff btst 0xff, %i2
20079f0: 22 80 00 3f be,a 2007aec <_Objects_Extend_information+0x1cc>
20079f4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
20079f8: b4 04 e0 01 add %l3, 1, %i2
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
20079fc: 91 2e a0 01 sll %i2, 1, %o0
2007a00: 90 02 00 1a add %o0, %i2, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
2007a04: 90 06 40 08 add %i1, %o0, %o0
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
2007a08: 90 02 00 1c add %o0, %i4, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
2007a0c: 40 00 09 38 call 2009eec <_Workspace_Allocate>
2007a10: 91 2a 20 02 sll %o0, 2, %o0
if ( !object_blocks ) {
2007a14: a2 92 20 00 orcc %o0, 0, %l1
2007a18: 02 80 00 79 be 2007bfc <_Objects_Extend_information+0x2dc>
2007a1c: b5 2e a0 02 sll %i2, 2, %i2
* Take the block count down. Saves all the (block_count - 1)
* in the copies.
*/
block_count--;
if ( information->maximum > minimum_index ) {
2007a20: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
2007a24: 80 a7 00 01 cmp %i4, %g1
2007a28: a4 04 40 1a add %l1, %i2, %l2
2007a2c: 0a 80 00 57 bcs 2007b88 <_Objects_Extend_information+0x268>
2007a30: b4 04 80 1a add %l2, %i2, %i2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
2007a34: 80 a7 20 00 cmp %i4, 0
2007a38: 02 80 00 07 be 2007a54 <_Objects_Extend_information+0x134><== NEVER TAKEN
2007a3c: 82 10 20 00 clr %g1
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
2007a40: 85 28 60 02 sll %g1, 2, %g2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
2007a44: 82 00 60 01 inc %g1
2007a48: 80 a7 00 01 cmp %i4, %g1
2007a4c: 18 bf ff fd bgu 2007a40 <_Objects_Extend_information+0x120><== NEVER TAKEN
2007a50: c0 20 80 1a clr [ %g2 + %i2 ]
2007a54: a7 2c e0 02 sll %l3, 2, %l3
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2007a58: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
2007a5c: c0 24 40 13 clr [ %l1 + %l3 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2007a60: 86 07 40 03 add %i5, %g3, %g3
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
2007a64: 80 a7 40 03 cmp %i5, %g3
2007a68: 1a 80 00 0a bcc 2007a90 <_Objects_Extend_information+0x170><== NEVER TAKEN
2007a6c: c0 24 80 13 clr [ %l2 + %l3 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
2007a70: 83 2f 60 02 sll %i5, 2, %g1
2007a74: 84 10 00 1d mov %i5, %g2
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
2007a78: 82 06 80 01 add %i2, %g1, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
2007a7c: c0 20 40 00 clr [ %g1 ]
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
index++ ) {
2007a80: 84 00 a0 01 inc %g2
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
2007a84: 80 a0 c0 02 cmp %g3, %g2
2007a88: 18 bf ff fd bgu 2007a7c <_Objects_Extend_information+0x15c>
2007a8c: 82 00 60 04 add %g1, 4, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
2007a90: 7f ff e9 30 call 2001f50 <sparc_disable_interrupts>
2007a94: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2007a98: c6 06 00 00 ld [ %i0 ], %g3
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
2007a9c: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
2007aa0: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
information->maximum = (Objects_Maximum) maximum;
2007aa4: f2 36 20 10 sth %i1, [ %i0 + 0x10 ]
2007aa8: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2007aac: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
2007ab0: e2 26 20 34 st %l1, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
2007ab4: e4 26 20 30 st %l2, [ %i0 + 0x30 ]
information->local_table = local_table;
2007ab8: f4 26 20 1c st %i2, [ %i0 + 0x1c ]
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
2007abc: b3 2e 60 10 sll %i1, 0x10, %i1
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2007ac0: 03 00 00 40 sethi %hi(0x10000), %g1
2007ac4: b3 36 60 10 srl %i1, 0x10, %i1
2007ac8: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2007acc: 82 10 40 02 or %g1, %g2, %g1
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2007ad0: 82 10 40 19 or %g1, %i1, %g1
2007ad4: c2 26 20 0c st %g1, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
2007ad8: 7f ff e9 22 call 2001f60 <sparc_enable_interrupts>
2007adc: 01 00 00 00 nop
_Workspace_Free( old_tables );
2007ae0: 40 00 09 0b call 2009f0c <_Workspace_Free>
2007ae4: 90 10 00 1c mov %i4, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
2007ae8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2007aec: b7 2e e0 02 sll %i3, 2, %i3
2007af0: e0 20 40 1b st %l0, [ %g1 + %i3 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
2007af4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2007af8: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
2007afc: d2 00 40 1b ld [ %g1 + %i3 ], %o1
2007b00: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
2007b04: 90 07 bf f4 add %fp, -12, %o0
2007b08: 40 00 11 08 call 200bf28 <_Chain_Initialize>
2007b0c: 39 00 00 40 sethi %hi(0x10000), %i4
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
2007b10: 10 80 00 0d b 2007b44 <_Objects_Extend_information+0x224>
2007b14: b4 06 20 20 add %i0, 0x20, %i2
the_object->id = _Objects_Build_id(
2007b18: c6 16 20 04 lduh [ %i0 + 4 ], %g3
2007b1c: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2007b20: 87 28 e0 1b sll %g3, 0x1b, %g3
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2007b24: 84 10 80 1c or %g2, %i4, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2007b28: 84 10 80 03 or %g2, %g3, %g2
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2007b2c: 84 10 80 1d or %g2, %i5, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2007b30: 90 10 00 1a mov %i2, %o0
2007b34: 92 10 00 01 mov %g1, %o1
index++;
2007b38: ba 07 60 01 inc %i5
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2007b3c: 7f ff fc a1 call 2006dc0 <_Chain_Append>
2007b40: c4 20 60 08 st %g2, [ %g1 + 8 ]
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
2007b44: 7f ff fc b3 call 2006e10 <_Chain_Get>
2007b48: 90 07 bf f4 add %fp, -12, %o0
2007b4c: 82 92 20 00 orcc %o0, 0, %g1
2007b50: 32 bf ff f2 bne,a 2007b18 <_Objects_Extend_information+0x1f8>
2007b54: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
2007b58: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
2007b5c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
2007b60: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
2007b64: c8 20 c0 1b st %g4, [ %g3 + %i3 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
2007b68: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
2007b6c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
2007b70: 81 c7 e0 08 ret
2007b74: 81 e8 00 00 restore
if ( information->auto_extend ) {
new_object_block = _Workspace_Allocate( block_size );
if ( !new_object_block )
return;
} else {
new_object_block = _Workspace_Allocate_or_fatal_error( block_size );
2007b78: 40 00 08 eb call 2009f24 <_Workspace_Allocate_or_fatal_error>
2007b7c: 01 00 00 00 nop
2007b80: 10 bf ff 9b b 20079ec <_Objects_Extend_information+0xcc>
2007b84: a0 10 00 08 mov %o0, %l0
/*
* Copy each section of the table over. This has to be performed as
* separate parts as size of each block has changed.
*/
memcpy( object_blocks,
2007b88: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
2007b8c: a7 2c e0 02 sll %l3, 2, %l3
/*
* Copy each section of the table over. This has to be performed as
* separate parts as size of each block has changed.
*/
memcpy( object_blocks,
2007b90: 40 00 1b e0 call 200eb10 <memcpy>
2007b94: 94 10 00 13 mov %l3, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
2007b98: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
2007b9c: 94 10 00 13 mov %l3, %o2
2007ba0: 40 00 1b dc call 200eb10 <memcpy>
2007ba4: 90 10 00 12 mov %l2, %o0
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
2007ba8: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
2007bac: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
2007bb0: b8 07 00 01 add %i4, %g1, %i4
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
2007bb4: 90 10 00 1a mov %i2, %o0
2007bb8: 40 00 1b d6 call 200eb10 <memcpy>
2007bbc: 95 2f 20 02 sll %i4, 2, %o2
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2007bc0: 10 bf ff a7 b 2007a5c <_Objects_Extend_information+0x13c>
2007bc4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
2007bc8: d0 16 20 14 lduh [ %i0 + 0x14 ], %o0
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007bcc: ba 10 00 1c mov %i4, %i5
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
2007bd0: b4 10 20 01 mov 1, %i2
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2007bd4: b6 10 20 00 clr %i3
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
2007bd8: a6 10 20 00 clr %l3
2007bdc: 10 bf ff 72 b 20079a4 <_Objects_Extend_information+0x84>
2007be0: b3 2e 60 10 sll %i1, 0x10, %i1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007be4: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
2007be8: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2007bec: 10 bf ff 6e b 20079a4 <_Objects_Extend_information+0x84> <== NOT EXECUTED
2007bf0: b6 10 20 00 clr %i3 <== NOT EXECUTED
2007bf4: 10 bf ff 6c b 20079a4 <_Objects_Extend_information+0x84> <== NOT EXECUTED
2007bf8: b6 10 20 00 clr %i3 <== NOT EXECUTED
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
if ( !object_blocks ) {
_Workspace_Free( new_object_block );
2007bfc: 40 00 08 c4 call 2009f0c <_Workspace_Free>
2007c00: 90 10 00 10 mov %l0, %o0
return;
2007c04: 81 c7 e0 08 ret
2007c08: 81 e8 00 00 restore
02007cb0 <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
2007cb0: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
2007cb4: 80 a6 60 00 cmp %i1, 0
2007cb8: 02 80 00 17 be 2007d14 <_Objects_Get_information+0x64>
2007cbc: 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 );
2007cc0: 40 00 12 22 call 200c548 <_Objects_API_maximum_class>
2007cc4: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
2007cc8: 80 a2 20 00 cmp %o0, 0
2007ccc: 02 80 00 12 be 2007d14 <_Objects_Get_information+0x64>
2007cd0: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
2007cd4: 0a 80 00 10 bcs 2007d14 <_Objects_Get_information+0x64>
2007cd8: 03 00 80 55 sethi %hi(0x2015400), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
2007cdc: b1 2e 20 02 sll %i0, 2, %i0
2007ce0: 82 10 62 98 or %g1, 0x298, %g1
2007ce4: c2 00 40 18 ld [ %g1 + %i0 ], %g1
2007ce8: 80 a0 60 00 cmp %g1, 0
2007cec: 02 80 00 0a be 2007d14 <_Objects_Get_information+0x64> <== NEVER TAKEN
2007cf0: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
2007cf4: fa 00 40 19 ld [ %g1 + %i1 ], %i5
if ( !info )
2007cf8: 80 a7 60 00 cmp %i5, 0
2007cfc: 02 80 00 06 be 2007d14 <_Objects_Get_information+0x64> <== NEVER TAKEN
2007d00: 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 )
2007d04: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1
return NULL;
2007d08: 80 a0 00 01 cmp %g0, %g1
2007d0c: 82 60 20 00 subx %g0, 0, %g1
2007d10: ba 0f 40 01 and %i5, %g1, %i5
#endif
return info;
}
2007d14: 81 c7 e0 08 ret
2007d18: 91 e8 00 1d restore %g0, %i5, %o0
02009a58 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
2009a58: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
2009a5c: 80 a6 60 00 cmp %i1, 0
2009a60: 02 80 00 3c be 2009b50 <_Objects_Get_name_as_string+0xf8>
2009a64: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
2009a68: 02 80 00 35 be 2009b3c <_Objects_Get_name_as_string+0xe4>
2009a6c: 80 a6 20 00 cmp %i0, 0
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2009a70: 02 80 00 35 be 2009b44 <_Objects_Get_name_as_string+0xec>
2009a74: 03 00 80 7b sethi %hi(0x201ec00), %g1
information = _Objects_Get_information_id( tmpId );
2009a78: 7f ff ff ba call 2009960 <_Objects_Get_information_id>
2009a7c: 90 10 00 18 mov %i0, %o0
if ( !information )
2009a80: 80 a2 20 00 cmp %o0, 0
2009a84: 02 80 00 33 be 2009b50 <_Objects_Get_name_as_string+0xf8>
2009a88: 92 10 00 18 mov %i0, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
2009a8c: 40 00 00 34 call 2009b5c <_Objects_Get>
2009a90: 94 07 bf fc add %fp, -4, %o2
switch ( location ) {
2009a94: c2 07 bf fc ld [ %fp + -4 ], %g1
2009a98: 80 a0 60 00 cmp %g1, 0
2009a9c: 32 80 00 2e bne,a 2009b54 <_Objects_Get_name_as_string+0xfc>
2009aa0: b4 10 20 00 clr %i2
if ( information->is_string ) {
s = the_object->name.name_p;
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
2009aa4: c2 02 20 0c ld [ %o0 + 0xc ], %g1
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
lname[ 4 ] = '\0';
2009aa8: c0 2f bf f4 clrb [ %fp + -12 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2009aac: 85 30 60 18 srl %g1, 0x18, %g2
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
2009ab0: 87 30 60 08 srl %g1, 8, %g3
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009ab4: 89 30 60 10 srl %g1, 0x10, %g4
lname[ 2 ] = (u32_name >> 8) & 0xff;
2009ab8: c6 2f bf f2 stb %g3, [ %fp + -14 ]
lname[ 3 ] = (u32_name >> 0) & 0xff;
2009abc: c2 2f bf f3 stb %g1, [ %fp + -13 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2009ac0: c4 2f bf f0 stb %g2, [ %fp + -16 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009ac4: c8 2f bf f1 stb %g4, [ %fp + -15 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2009ac8: 86 10 00 02 mov %g2, %g3
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009acc: b2 86 7f ff addcc %i1, -1, %i1
2009ad0: 02 80 00 19 be 2009b34 <_Objects_Get_name_as_string+0xdc> <== NEVER TAKEN
2009ad4: 82 10 00 1a mov %i2, %g1
2009ad8: 80 a0 a0 00 cmp %g2, 0
2009adc: 02 80 00 16 be 2009b34 <_Objects_Get_name_as_string+0xdc>
2009ae0: 1f 00 80 77 sethi %hi(0x201dc00), %o7
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
lname[ 4 ] = '\0';
s = lname;
2009ae4: 84 07 bf f0 add %fp, -16, %g2
* This method objects the name of an object and returns its name
* in the form of a C string. It attempts to be careful about
* overflowing the user's string and about returning unprintable characters.
*/
char *_Objects_Get_name_as_string(
2009ae8: b2 06 80 19 add %i2, %i1, %i1
2009aec: 10 80 00 05 b 2009b00 <_Objects_Get_name_as_string+0xa8>
2009af0: 9e 13 e1 bc or %o7, 0x1bc, %o7
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009af4: 80 a1 20 00 cmp %g4, 0
2009af8: 02 80 00 0f be 2009b34 <_Objects_Get_name_as_string+0xdc>
2009afc: c6 08 80 00 ldub [ %g2 ], %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
2009b00: f0 03 c0 00 ld [ %o7 ], %i0
2009b04: 88 08 e0 ff and %g3, 0xff, %g4
2009b08: 88 06 00 04 add %i0, %g4, %g4
2009b0c: c8 49 20 01 ldsb [ %g4 + 1 ], %g4
2009b10: 80 89 20 97 btst 0x97, %g4
2009b14: 12 80 00 03 bne 2009b20 <_Objects_Get_name_as_string+0xc8>
2009b18: 84 00 a0 01 inc %g2
2009b1c: 86 10 20 2a mov 0x2a, %g3
2009b20: c6 28 40 00 stb %g3, [ %g1 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009b24: 82 00 60 01 inc %g1
2009b28: 80 a0 40 19 cmp %g1, %i1
2009b2c: 32 bf ff f2 bne,a 2009af4 <_Objects_Get_name_as_string+0x9c>
2009b30: c8 48 80 00 ldsb [ %g2 ], %g4
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2009b34: 40 00 03 8a call 200a95c <_Thread_Enable_dispatch>
2009b38: c0 28 40 00 clrb [ %g1 ]
return name;
}
return NULL; /* unreachable path */
}
2009b3c: 81 c7 e0 08 ret
2009b40: 91 e8 00 1a restore %g0, %i2, %o0
return NULL;
if ( name == NULL )
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2009b44: c2 00 61 58 ld [ %g1 + 0x158 ], %g1
2009b48: 10 bf ff cc b 2009a78 <_Objects_Get_name_as_string+0x20>
2009b4c: f0 00 60 08 ld [ %g1 + 8 ], %i0
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
2009b50: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
2009b54: 81 c7 e0 08 ret
2009b58: 91 e8 00 1a restore %g0, %i2, %o0
02007f2c <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
2007f2c: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
2007f30: 90 10 20 00 clr %o0
)
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
2007f34: 80 a6 20 00 cmp %i0, 0
2007f38: 02 80 00 19 be 2007f9c <_Objects_Get_next+0x70>
2007f3c: ba 10 00 18 mov %i0, %i5
return NULL;
if ( !location_p )
2007f40: 80 a6 a0 00 cmp %i2, 0
2007f44: 02 80 00 16 be 2007f9c <_Objects_Get_next+0x70>
2007f48: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
2007f4c: 02 80 00 14 be 2007f9c <_Objects_Get_next+0x70>
2007f50: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
2007f54: 80 a0 60 00 cmp %g1, 0
2007f58: 22 80 00 13 be,a 2007fa4 <_Objects_Get_next+0x78>
2007f5c: f2 06 20 08 ld [ %i0 + 8 ], %i1
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007f60: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2007f64: 83 2e 60 10 sll %i1, 0x10, %g1
*location_p = OBJECTS_ERROR;
goto final;
}
/* try to grab one */
object = _Objects_Get(information, next_id, location_p);
2007f68: 92 10 00 19 mov %i1, %o1
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007f6c: 83 30 60 10 srl %g1, 0x10, %g1
*location_p = OBJECTS_ERROR;
goto final;
}
/* try to grab one */
object = _Objects_Get(information, next_id, location_p);
2007f70: 90 10 00 1d mov %i5, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007f74: 80 a0 80 01 cmp %g2, %g1
2007f78: 0a 80 00 13 bcs 2007fc4 <_Objects_Get_next+0x98>
2007f7c: 94 10 00 1a mov %i2, %o2
*location_p = OBJECTS_ERROR;
goto final;
}
/* try to grab one */
object = _Objects_Get(information, next_id, location_p);
2007f80: 40 00 00 18 call 2007fe0 <_Objects_Get>
2007f84: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
2007f88: c2 06 80 00 ld [ %i2 ], %g1
2007f8c: 80 a0 60 00 cmp %g1, 0
2007f90: 32 bf ff f5 bne,a 2007f64 <_Objects_Get_next+0x38>
2007f94: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
*next_id_p = next_id;
2007f98: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
2007f9c: 81 c7 e0 08 ret
2007fa0: 91 e8 00 08 restore %g0, %o0, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007fa4: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2007fa8: 83 2e 60 10 sll %i1, 0x10, %g1
*location_p = OBJECTS_ERROR;
goto final;
}
/* try to grab one */
object = _Objects_Get(information, next_id, location_p);
2007fac: 92 10 00 19 mov %i1, %o1
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007fb0: 83 30 60 10 srl %g1, 0x10, %g1
*location_p = OBJECTS_ERROR;
goto final;
}
/* try to grab one */
object = _Objects_Get(information, next_id, location_p);
2007fb4: 90 10 00 1d mov %i5, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2007fb8: 80 a0 80 01 cmp %g2, %g1
2007fbc: 1a bf ff f1 bcc 2007f80 <_Objects_Get_next+0x54> <== ALWAYS TAKEN
2007fc0: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
2007fc4: 82 10 20 01 mov 1, %g1
2007fc8: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
2007fcc: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
2007fd0: 82 10 3f ff mov -1, %g1
2007fd4: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
2007fd8: 81 c7 e0 08 ret
2007fdc: 91 e8 00 08 restore %g0, %o0, %o0
02009540 <_Objects_Id_to_name>:
*/
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
2009540: 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;
2009544: 80 a6 20 00 cmp %i0, 0
2009548: 12 80 00 06 bne 2009560 <_Objects_Id_to_name+0x20>
200954c: 83 36 20 18 srl %i0, 0x18, %g1
2009550: 03 00 80 76 sethi %hi(0x201d800), %g1
2009554: c2 00 62 38 ld [ %g1 + 0x238 ], %g1 ! 201da38 <_Per_CPU_Information+0xc>
2009558: f0 00 60 08 ld [ %g1 + 8 ], %i0
200955c: 83 36 20 18 srl %i0, 0x18, %g1
2009560: 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 )
2009564: 84 00 7f ff add %g1, -1, %g2
2009568: 80 a0 a0 02 cmp %g2, 2
200956c: 18 80 00 17 bgu 20095c8 <_Objects_Id_to_name+0x88>
2009570: 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 ] )
2009574: 83 28 60 02 sll %g1, 2, %g1
2009578: 05 00 80 75 sethi %hi(0x201d400), %g2
200957c: 84 10 a3 68 or %g2, 0x368, %g2 ! 201d768 <_Objects_Information_table>
2009580: c2 00 80 01 ld [ %g2 + %g1 ], %g1
2009584: 80 a0 60 00 cmp %g1, 0
2009588: 02 80 00 10 be 20095c8 <_Objects_Id_to_name+0x88>
200958c: 85 36 20 1b srl %i0, 0x1b, %g2
return OBJECTS_INVALID_ID;
the_class = _Objects_Get_class( tmpId );
information = _Objects_Information_table[ the_api ][ the_class ];
2009590: 85 28 a0 02 sll %g2, 2, %g2
2009594: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
2009598: 80 a2 20 00 cmp %o0, 0
200959c: 02 80 00 0b be 20095c8 <_Objects_Id_to_name+0x88> <== NEVER TAKEN
20095a0: 92 10 00 18 mov %i0, %o1
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string )
return OBJECTS_INVALID_ID;
#endif
the_object = _Objects_Get( information, tmpId, &ignored_location );
20095a4: 7f ff ff ca call 20094cc <_Objects_Get>
20095a8: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
20095ac: 80 a2 20 00 cmp %o0, 0
20095b0: 02 80 00 06 be 20095c8 <_Objects_Id_to_name+0x88>
20095b4: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
20095b8: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
20095bc: 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();
20095c0: 40 00 03 93 call 200a40c <_Thread_Enable_dispatch>
20095c4: c2 26 40 00 st %g1, [ %i1 ]
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
}
20095c8: 81 c7 e0 08 ret
20095cc: 91 e8 00 1d restore %g0, %i5, %o0
02007f94 <_Objects_Shrink_information>:
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
2007f94: 9d e3 bf a0 save %sp, -96, %sp
/*
* Search the list to find block or chunk with all objects inactive.
*/
index_base = _Objects_Get_index( information->minimum_id );
2007f98: fa 16 20 0a lduh [ %i0 + 0xa ], %i5
block_count = (information->maximum - index_base) /
2007f9c: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4
2007fa0: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
2007fa4: 92 10 00 1c mov %i4, %o1
2007fa8: 40 00 26 93 call 20119f4 <.udiv>
2007fac: 90 22 00 1d sub %o0, %i5, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2007fb0: 80 a2 20 00 cmp %o0, 0
2007fb4: 02 80 00 34 be 2008084 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN
2007fb8: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
2007fbc: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
2007fc0: c2 01 00 00 ld [ %g4 ], %g1
2007fc4: 80 a7 00 01 cmp %i4, %g1
2007fc8: 02 80 00 0f be 2008004 <_Objects_Shrink_information+0x70> <== NEVER TAKEN
2007fcc: 82 10 20 00 clr %g1
2007fd0: 10 80 00 07 b 2007fec <_Objects_Shrink_information+0x58>
2007fd4: b6 10 20 04 mov 4, %i3
2007fd8: 86 06 e0 04 add %i3, 4, %g3
2007fdc: 80 a7 00 02 cmp %i4, %g2
2007fe0: 02 80 00 0a be 2008008 <_Objects_Shrink_information+0x74>
2007fe4: ba 07 40 1c add %i5, %i4, %i5
2007fe8: b6 10 00 03 mov %g3, %i3
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2007fec: 82 00 60 01 inc %g1
2007ff0: 80 a0 40 08 cmp %g1, %o0
2007ff4: 32 bf ff f9 bne,a 2007fd8 <_Objects_Shrink_information+0x44>
2007ff8: c4 01 00 1b ld [ %g4 + %i3 ], %g2
2007ffc: 81 c7 e0 08 ret
2008000: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
2008004: b6 10 20 00 clr %i3 <== NOT EXECUTED
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2008008: 10 80 00 06 b 2008020 <_Objects_Shrink_information+0x8c>
200800c: d0 06 20 20 ld [ %i0 + 0x20 ], %o0
if ((index >= index_base) &&
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
}
}
while ( the_object );
2008010: 80 a7 20 00 cmp %i4, 0
2008014: 22 80 00 12 be,a 200805c <_Objects_Shrink_information+0xc8>
2008018: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
index = _Objects_Get_index( the_object->id );
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
200801c: 90 10 00 1c mov %i4, %o0
* Assume the Inactive chain is never empty at this point
*/
the_object = (Objects_Control *) _Chain_First( &information->Inactive );
do {
index = _Objects_Get_index( the_object->id );
2008020: c2 12 20 0a lduh [ %o0 + 0xa ], %g1
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
if ((index >= index_base) &&
2008024: 80 a0 40 1d cmp %g1, %i5
2008028: 0a bf ff fa bcs 2008010 <_Objects_Shrink_information+0x7c>
200802c: f8 02 00 00 ld [ %o0 ], %i4
(index < (index_base + information->allocation_size))) {
2008030: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
2008034: 84 07 40 02 add %i5, %g2, %g2
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
if ((index >= index_base) &&
2008038: 80 a0 40 02 cmp %g1, %g2
200803c: 1a bf ff f6 bcc 2008014 <_Objects_Shrink_information+0x80>
2008040: 80 a7 20 00 cmp %i4, 0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
2008044: 7f ff fb 6a call 2006dec <_Chain_Extract>
2008048: 01 00 00 00 nop
}
}
while ( the_object );
200804c: 80 a7 20 00 cmp %i4, 0
2008050: 12 bf ff f4 bne 2008020 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN
2008054: 90 10 00 1c mov %i4, %o0
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
2008058: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
200805c: 40 00 07 ac call 2009f0c <_Workspace_Free>
2008060: d0 00 40 1b ld [ %g1 + %i3 ], %o0
information->object_blocks[ block ] = NULL;
2008064: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
2008068: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
information->object_blocks[ block ] = NULL;
200806c: c0 20 40 1b clr [ %g1 + %i3 ]
information->inactive_per_block[ block ] = 0;
2008070: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
2008074: c2 16 20 14 lduh [ %i0 + 0x14 ], %g1
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
information->object_blocks[ block ] = NULL;
information->inactive_per_block[ block ] = 0;
2008078: c0 20 c0 1b clr [ %g3 + %i3 ]
information->inactive -= information->allocation_size;
200807c: 82 20 80 01 sub %g2, %g1, %g1
2008080: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
2008084: 81 c7 e0 08 ret
2008088: 81 e8 00 00 restore
02008d7c <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
2008d7c: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if(!the_node) return;
2008d80: 80 a6 60 00 cmp %i1, 0
2008d84: 02 80 00 4c be 2008eb4 <_RBTree_Extract_unprotected+0x138>
2008d88: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
2008d8c: c2 06 20 08 ld [ %i0 + 8 ], %g1
2008d90: 80 a0 40 19 cmp %g1, %i1
2008d94: 02 80 00 61 be 2008f18 <_RBTree_Extract_unprotected+0x19c>
2008d98: c2 06 60 08 ld [ %i1 + 8 ], %g1
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
}
}
/* check if max needs to be updated: note, min can equal max (1 element) */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
2008d9c: c4 06 20 0c ld [ %i0 + 0xc ], %g2
2008da0: 80 a0 80 19 cmp %g2, %i1
2008da4: 02 80 00 51 be 2008ee8 <_RBTree_Extract_unprotected+0x16c>
2008da8: f8 06 60 04 ld [ %i1 + 4 ], %i4
* 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]) {
2008dac: ba 97 20 00 orcc %i4, 0, %i5
2008db0: 22 80 00 54 be,a 2008f00 <_RBTree_Extract_unprotected+0x184><== ALWAYS TAKEN
2008db4: b8 90 60 00 orcc %g1, 0, %i4
2008db8: 80 a0 60 00 cmp %g1, 0
2008dbc: 32 80 00 05 bne,a 2008dd0 <_RBTree_Extract_unprotected+0x54><== NEVER TAKEN
2008dc0: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
* 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 ) {
leaf->parent = the_node->parent;
2008dc4: 10 80 00 3e b 2008ebc <_RBTree_Extract_unprotected+0x140>
2008dc8: c2 06 40 00 ld [ %i1 ], %g1
* search tree property, but may violate the red-black properties.
*/
if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) {
target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */
while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT];
2008dcc: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2008dd0: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED
2008dd4: 32 bf ff fe bne,a 2008dcc <_RBTree_Extract_unprotected+0x50><== NOT EXECUTED
2008dd8: 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];
2008ddc: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED
if(leaf) {
2008de0: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED
2008de4: 02 80 00 52 be 2008f2c <_RBTree_Extract_unprotected+0x1b0><== NOT EXECUTED
2008de8: 01 00 00 00 nop <== NOT EXECUTED
leaf->parent = target->parent;
2008dec: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED
2008df0: 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);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008df4: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED
target->parent->child[dir] = leaf;
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008df8: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008dfc: c8 00 a0 04 ld [ %g2 + 4 ], %g4 <== NOT EXECUTED
* 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;
target->color = the_node->color;
2008e00: c6 06 60 10 ld [ %i1 + 0x10 ], %g3 <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008e04: 88 19 00 1d xor %g4, %i5, %g4 <== NOT EXECUTED
2008e08: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED
2008e0c: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED
target->parent->child[dir] = leaf;
2008e10: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED
2008e14: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED
2008e18: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008e1c: c8 00 60 04 ld [ %g1 + 4 ], %g4 <== 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;
2008e20: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 <== NOT EXECUTED
dir = target != target->parent->child[0];
target->parent->child[dir] = leaf;
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008e24: 88 19 00 19 xor %g4, %i1, %g4 <== NOT EXECUTED
2008e28: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED
2008e2c: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED
the_node->parent->child[dir] = target;
2008e30: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED
2008e34: 82 00 40 04 add %g1, %g4, %g1 <== NOT EXECUTED
2008e38: fa 20 60 04 st %i5, [ %g1 + 4 ] <== NOT EXECUTED
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
2008e3c: c2 06 60 08 ld [ %i1 + 8 ], %g1 <== NOT EXECUTED
* 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;
target->color = the_node->color;
2008e40: c6 27 60 10 st %g3, [ %i5 + 0x10 ] <== NOT EXECUTED
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
2008e44: c2 27 60 08 st %g1, [ %i5 + 8 ] <== NOT EXECUTED
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
2008e48: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
the_node->child[RBT_RIGHT]->parent = target;
2008e4c: c6 06 60 08 ld [ %i1 + 8 ], %g3 <== NOT EXECUTED
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
2008e50: c2 27 60 04 st %g1, [ %i5 + 4 ] <== NOT EXECUTED
the_node->child[RBT_LEFT]->parent = target;
2008e54: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
the_node->child[RBT_RIGHT]->parent = target;
2008e58: fa 20 c0 00 st %i5, [ %g3 ] <== NOT EXECUTED
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
the_node->child[RBT_LEFT]->parent = target;
2008e5c: fa 20 40 00 st %i5, [ %g1 ] <== 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;
2008e60: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED
2008e64: c2 27 40 00 st %g1, [ %i5 ] <== NOT EXECUTED
* 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 */
2008e68: 80 a0 a0 00 cmp %g2, 0
2008e6c: 32 80 00 0c bne,a 2008e9c <_RBTree_Extract_unprotected+0x120>
2008e70: c2 06 20 04 ld [ %i0 + 4 ], %g1
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008e74: 80 a7 20 00 cmp %i4, 0
2008e78: 22 80 00 09 be,a 2008e9c <_RBTree_Extract_unprotected+0x120>
2008e7c: c2 06 20 04 ld [ %i0 + 4 ], %g1
2008e80: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
2008e84: 80 a0 60 01 cmp %g1, 1
2008e88: 22 80 00 04 be,a 2008e98 <_RBTree_Extract_unprotected+0x11c><== ALWAYS TAKEN
2008e8c: c0 27 20 10 clr [ %i4 + 0x10 ]
if (_RBTree_Is_red(leaf))
leaf->color = RBT_BLACK; /* case 2 */
else if(leaf)
_RBTree_Extract_validate_unprotected(leaf); /* case 3 */
2008e90: 7f ff fe e8 call 2008a30 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2008e94: 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;
2008e98: 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;
2008e9c: c0 26 60 08 clr [ %i1 + 8 ]
2008ea0: c0 26 60 04 clr [ %i1 + 4 ]
2008ea4: 80 a0 60 00 cmp %g1, 0
2008ea8: 02 80 00 03 be 2008eb4 <_RBTree_Extract_unprotected+0x138>
2008eac: c0 26 40 00 clr [ %i1 ]
2008eb0: c0 20 60 10 clr [ %g1 + 0x10 ]
2008eb4: 81 c7 e0 08 ret
2008eb8: 81 e8 00 00 restore
* 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 ) {
leaf->parent = the_node->parent;
2008ebc: c2 27 00 00 st %g1, [ %i4 ]
_RBTree_Extract_validate_unprotected(the_node);
}
victim_color = the_node->color;
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
2008ec0: c2 06 40 00 ld [ %i1 ], %g1
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;
2008ec4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
2008ec8: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008ecc: 86 18 c0 19 xor %g3, %i1, %g3
2008ed0: 80 a0 00 03 cmp %g0, %g3
2008ed4: 86 40 20 00 addx %g0, 0, %g3
the_node->parent->child[dir] = leaf;
2008ed8: 87 28 e0 02 sll %g3, 2, %g3
2008edc: 82 00 40 03 add %g1, %g3, %g1
2008ee0: 10 bf ff e2 b 2008e68 <_RBTree_Extract_unprotected+0xec>
2008ee4: f8 20 60 04 st %i4, [ %g1 + 4 ]
the_rbtree->first[RBT_LEFT] = NULL;
}
}
/* check if max needs to be updated: note, min can equal max (1 element) */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
if (the_node->child[RBT_LEFT])
2008ee8: 80 a7 20 00 cmp %i4, 0
2008eec: 02 80 00 19 be 2008f50 <_RBTree_Extract_unprotected+0x1d4>
2008ef0: ba 97 20 00 orcc %i4, 0, %i5
* 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]) {
2008ef4: 12 bf ff b1 bne 2008db8 <_RBTree_Extract_unprotected+0x3c><== ALWAYS TAKEN
2008ef8: f8 26 20 0c st %i4, [ %i0 + 0xc ]
* 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 ) {
2008efc: b8 90 60 00 orcc %g1, 0, %i4 <== NOT EXECUTED
2008f00: 32 bf ff ef bne,a 2008ebc <_RBTree_Extract_unprotected+0x140>
2008f04: c2 06 40 00 ld [ %i1 ], %g1
leaf->parent = the_node->parent;
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(the_node);
2008f08: 7f ff fe ca call 2008a30 <_RBTree_Extract_validate_unprotected>
2008f0c: 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];
2008f10: 10 bf ff ed b 2008ec4 <_RBTree_Extract_unprotected+0x148>
2008f14: c2 06 40 00 ld [ %i1 ], %g1
if(!the_node) return;
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
if (the_node->child[RBT_RIGHT])
2008f18: 80 a0 60 00 cmp %g1, 0
2008f1c: 22 80 00 08 be,a 2008f3c <_RBTree_Extract_unprotected+0x1c0>
2008f20: c4 06 40 00 ld [ %i1 ], %g2
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
2008f24: 10 bf ff 9e b 2008d9c <_RBTree_Extract_unprotected+0x20>
2008f28: c2 26 20 08 st %g1, [ %i0 + 8 ]
leaf = target->child[RBT_LEFT];
if(leaf) {
leaf->parent = target->parent;
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
2008f2c: 7f ff fe c1 call 2008a30 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2008f30: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008f34: 10 bf ff b1 b 2008df8 <_RBTree_Extract_unprotected+0x7c> <== NOT EXECUTED
2008f38: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED
if (the_node == the_rbtree->first[RBT_LEFT]) {
if (the_node->child[RBT_RIGHT])
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
else {
the_rbtree->first[RBT_LEFT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
2008f3c: 80 a6 00 02 cmp %i0, %g2
2008f40: 12 bf ff 97 bne 2008d9c <_RBTree_Extract_unprotected+0x20>
2008f44: c4 26 20 08 st %g2, [ %i0 + 8 ]
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
2008f48: 10 bf ff 95 b 2008d9c <_RBTree_Extract_unprotected+0x20>
2008f4c: 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]) {
if (the_node->child[RBT_LEFT])
the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT];
else {
the_rbtree->first[RBT_RIGHT] = the_node->parent;
2008f50: c4 06 40 00 ld [ %i1 ], %g2
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
2008f54: 80 a6 00 02 cmp %i0, %g2
2008f58: 12 bf ff 95 bne 2008dac <_RBTree_Extract_unprotected+0x30>
2008f5c: c4 26 20 0c st %g2, [ %i0 + 0xc ]
the_rbtree->first[RBT_RIGHT]))
the_rbtree->first[RBT_RIGHT] = NULL;
2008f60: 10 bf ff 93 b 2008dac <_RBTree_Extract_unprotected+0x30>
2008f64: c0 26 20 0c clr [ %i0 + 0xc ]
02008a30 <_RBTree_Extract_validate_unprotected>:
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
RBTree_Node *the_node
)
{
2008a30: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
2008a34: c4 06 00 00 ld [ %i0 ], %g2
if(!parent->parent) return;
2008a38: c2 00 80 00 ld [ %g2 ], %g1
2008a3c: 80 a0 60 00 cmp %g1, 0
2008a40: 02 80 00 cd be 2008d74 <_RBTree_Extract_validate_unprotected+0x344>
2008a44: 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 == the_node->parent->child[RBT_LEFT])
2008a48: c2 00 a0 04 ld [ %g2 + 4 ], %g1
2008a4c: 80 a6 00 01 cmp %i0, %g1
2008a50: 22 80 00 02 be,a 2008a58 <_RBTree_Extract_validate_unprotected+0x28>
2008a54: c2 00 a0 08 ld [ %g2 + 8 ], %g1
/* sibling is black, see if both of its children are also black. */
if (sibling &&
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
sibling->color = RBT_RED;
2008a58: 96 10 20 01 mov 1, %o3
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008a5c: 80 a6 20 00 cmp %i0, 0
2008a60: 22 80 00 07 be,a 2008a7c <_RBTree_Extract_validate_unprotected+0x4c><== NEVER TAKEN
2008a64: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED
2008a68: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
2008a6c: 80 a0 e0 01 cmp %g3, 1
2008a70: 22 80 00 5b be,a 2008bdc <_RBTree_Extract_validate_unprotected+0x1ac>
2008a74: 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) {
2008a78: c6 00 80 00 ld [ %g2 ], %g3
2008a7c: 80 a0 e0 00 cmp %g3, 0
2008a80: 02 80 00 56 be 2008bd8 <_RBTree_Extract_validate_unprotected+0x1a8>
2008a84: 80 a0 60 00 cmp %g1, 0
2008a88: 02 bf ff f6 be 2008a60 <_RBTree_Extract_validate_unprotected+0x30><== NEVER TAKEN
2008a8c: 80 a6 20 00 cmp %i0, 0
2008a90: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
2008a94: 80 a1 20 01 cmp %g4, 1
2008a98: 22 80 00 27 be,a 2008b34 <_RBTree_Extract_validate_unprotected+0x104>
2008a9c: de 00 a0 04 ld [ %g2 + 4 ], %o7
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]) &&
2008aa0: c6 00 60 08 ld [ %g1 + 8 ], %g3
2008aa4: 80 a0 e0 00 cmp %g3, 0
2008aa8: 22 80 00 07 be,a 2008ac4 <_RBTree_Extract_validate_unprotected+0x94>
2008aac: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008ab0: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
2008ab4: 80 a0 e0 01 cmp %g3, 1
2008ab8: 22 80 00 57 be,a 2008c14 <_RBTree_Extract_validate_unprotected+0x1e4>
2008abc: c6 00 a0 04 ld [ %g2 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
2008ac0: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008ac4: 80 a0 e0 00 cmp %g3, 0
2008ac8: 22 80 00 07 be,a 2008ae4 <_RBTree_Extract_validate_unprotected+0xb4>
2008acc: d6 20 60 10 st %o3, [ %g1 + 0x10 ]
2008ad0: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
2008ad4: 80 a0 e0 01 cmp %g3, 1
2008ad8: 22 80 00 4f be,a 2008c14 <_RBTree_Extract_validate_unprotected+0x1e4>
2008adc: c6 00 a0 04 ld [ %g2 + 4 ], %g3
sibling->color = RBT_RED;
2008ae0: d6 20 60 10 st %o3, [ %g1 + 0x10 ]
2008ae4: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1
2008ae8: 80 a0 60 01 cmp %g1, 1
2008aec: 22 80 00 3b be,a 2008bd8 <_RBTree_Extract_validate_unprotected+0x1a8>
2008af0: c0 20 a0 10 clr [ %g2 + 0x10 ]
if (_RBTree_Is_red(parent)) {
parent->color = RBT_BLACK;
break;
}
the_node = parent; /* done if parent is red */
parent = the_node->parent;
2008af4: c6 00 80 00 ld [ %g2 ], %g3
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
2008af8: 80 a0 e0 00 cmp %g3, 0
2008afc: 02 80 00 3e be 2008bf4 <_RBTree_Extract_validate_unprotected+0x1c4><== NEVER TAKEN
2008b00: b0 10 00 02 mov %g2, %i0
if(!(the_node->parent->parent)) return NULL;
2008b04: c2 00 c0 00 ld [ %g3 ], %g1
2008b08: 80 a0 60 00 cmp %g1, 0
2008b0c: 02 80 00 3d be 2008c00 <_RBTree_Extract_validate_unprotected+0x1d0>
2008b10: 82 10 20 00 clr %g1
if(the_node == the_node->parent->child[RBT_LEFT])
2008b14: c2 00 e0 04 ld [ %g3 + 4 ], %g1
2008b18: 80 a0 80 01 cmp %g2, %g1
2008b1c: 02 80 00 3b be 2008c08 <_RBTree_Extract_validate_unprotected+0x1d8>
2008b20: 80 a6 20 00 cmp %i0, 0
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008b24: 12 bf ff d1 bne 2008a68 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN
2008b28: 84 10 00 03 mov %g3, %g2
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) {
2008b2c: 10 bf ff d4 b 2008a7c <_RBTree_Extract_validate_unprotected+0x4c><== NOT EXECUTED
2008b30: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED
* 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;
2008b34: c8 20 a0 10 st %g4, [ %g2 + 0x10 ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
2008b38: 9e 1b c0 18 xor %o7, %i0, %o7
2008b3c: 80 a0 00 0f cmp %g0, %o7
2008b40: 9a 40 20 00 addx %g0, 0, %o5
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2008b44: 88 21 00 0d sub %g4, %o5, %g4
2008b48: 89 29 20 02 sll %g4, 2, %g4
2008b4c: 88 00 80 04 add %g2, %g4, %g4
2008b50: de 01 20 04 ld [ %g4 + 4 ], %o7
2008b54: 80 a3 e0 00 cmp %o7, 0
2008b58: 02 80 00 16 be 2008bb0 <_RBTree_Extract_validate_unprotected+0x180><== NEVER TAKEN
2008b5c: c0 20 60 10 clr [ %g1 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008b60: 83 2b 60 02 sll %o5, 2, %g1
2008b64: 98 03 c0 01 add %o7, %g1, %o4
2008b68: d4 03 20 04 ld [ %o4 + 4 ], %o2
2008b6c: d4 21 20 04 st %o2, [ %g4 + 4 ]
if (c->child[dir])
2008b70: c8 03 20 04 ld [ %o4 + 4 ], %g4
2008b74: 80 a1 20 00 cmp %g4, 0
2008b78: 02 80 00 04 be 2008b88 <_RBTree_Extract_validate_unprotected+0x158><== NEVER TAKEN
2008b7c: 82 03 c0 01 add %o7, %g1, %g1
c->child[dir]->parent = the_node;
2008b80: c4 21 00 00 st %g2, [ %g4 ]
2008b84: c6 00 80 00 ld [ %g2 ], %g3
c->child[dir] = the_node;
2008b88: c4 20 60 04 st %g2, [ %g1 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008b8c: c2 00 e0 04 ld [ %g3 + 4 ], %g1
c->parent = the_node->parent;
2008b90: c6 23 c0 00 st %g3, [ %o7 ]
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;
2008b94: 82 18 80 01 xor %g2, %g1, %g1
c->parent = the_node->parent;
the_node->parent = c;
2008b98: de 20 80 00 st %o7, [ %g2 ]
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;
2008b9c: 80 a0 00 01 cmp %g0, %g1
2008ba0: 82 40 20 00 addx %g0, 0, %g1
2008ba4: 83 28 60 02 sll %g1, 2, %g1
2008ba8: 86 00 c0 01 add %g3, %g1, %g3
2008bac: de 20 e0 04 st %o7, [ %g3 + 4 ]
_RBTree_Rotate(parent, dir);
sibling = parent->child[!dir];
2008bb0: 80 a0 00 0d cmp %g0, %o5
2008bb4: 82 60 3f ff subx %g0, -1, %g1
2008bb8: 83 28 60 02 sll %g1, 2, %g1
2008bbc: 82 00 80 01 add %g2, %g1, %g1
2008bc0: c2 00 60 04 ld [ %g1 + 4 ], %g1
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
2008bc4: 80 a0 60 00 cmp %g1, 0
2008bc8: 32 bf ff b7 bne,a 2008aa4 <_RBTree_Extract_validate_unprotected+0x74><== ALWAYS TAKEN
2008bcc: c6 00 60 08 ld [ %g1 + 8 ], %g3
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008bd0: 10 bf ff a4 b 2008a60 <_RBTree_Extract_validate_unprotected+0x30><== NOT EXECUTED
2008bd4: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2008bd8: c2 06 00 00 ld [ %i0 ], %g1
2008bdc: c2 00 40 00 ld [ %g1 ], %g1
2008be0: 80 a0 60 00 cmp %g1, 0
2008be4: 22 80 00 02 be,a 2008bec <_RBTree_Extract_validate_unprotected+0x1bc>
2008be8: c0 26 20 10 clr [ %i0 + 0x10 ]
2008bec: 81 c7 e0 08 ret
2008bf0: 81 e8 00 00 restore
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
2008bf4: 82 10 20 00 clr %g1 <== NOT EXECUTED
2008bf8: 10 bf ff 99 b 2008a5c <_RBTree_Extract_validate_unprotected+0x2c><== NOT EXECUTED
2008bfc: 84 10 20 00 clr %g2 <== NOT EXECUTED
if(!(the_node->parent->parent)) return NULL;
2008c00: 10 bf ff 97 b 2008a5c <_RBTree_Extract_validate_unprotected+0x2c>
2008c04: 84 10 00 03 mov %g3, %g2
if(the_node == the_node->parent->child[RBT_LEFT])
return the_node->parent->child[RBT_RIGHT];
2008c08: c2 00 e0 08 ld [ %g3 + 8 ], %g1
2008c0c: 10 bf ff 94 b 2008a5c <_RBTree_Extract_validate_unprotected+0x2c>
2008c10: 84 10 00 03 mov %g3, %g2
* 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];
2008c14: 86 18 c0 18 xor %g3, %i0, %g3
2008c18: 80 a0 00 03 cmp %g0, %g3
2008c1c: 86 40 20 00 addx %g0, 0, %g3
if (!_RBTree_Is_red(sibling->child[!dir])) {
2008c20: 80 a0 00 03 cmp %g0, %g3
2008c24: 9e 60 3f ff subx %g0, -1, %o7
2008c28: 9f 2b e0 02 sll %o7, 2, %o7
2008c2c: 88 00 40 0f add %g1, %o7, %g4
2008c30: c8 01 20 04 ld [ %g4 + 4 ], %g4
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008c34: 80 a1 20 00 cmp %g4, 0
2008c38: 22 80 00 07 be,a 2008c54 <_RBTree_Extract_validate_unprotected+0x224>
2008c3c: 89 28 e0 02 sll %g3, 2, %g4
2008c40: da 01 20 10 ld [ %g4 + 0x10 ], %o5
2008c44: 80 a3 60 01 cmp %o5, 1
2008c48: 22 80 00 28 be,a 2008ce8 <_RBTree_Extract_validate_unprotected+0x2b8>
2008c4c: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
2008c50: 89 28 e0 02 sll %g3, 2, %g4
2008c54: 88 00 40 04 add %g1, %g4, %g4
_RBTree_Rotate(sibling, !dir);
2008c58: 98 18 e0 01 xor %g3, 1, %o4
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[!dir])) {
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
2008c5c: d6 01 20 04 ld [ %g4 + 4 ], %o3
* 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])) {
sibling->color = RBT_RED;
2008c60: 88 10 20 01 mov 1, %g4
2008c64: c8 20 60 10 st %g4, [ %g1 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2008c68: 88 21 00 0c sub %g4, %o4, %g4
2008c6c: 9b 29 20 02 sll %g4, 2, %o5
2008c70: 9a 00 40 0d add %g1, %o5, %o5
2008c74: c8 03 60 04 ld [ %o5 + 4 ], %g4
2008c78: 80 a1 20 00 cmp %g4, 0
2008c7c: 02 80 00 16 be 2008cd4 <_RBTree_Extract_validate_unprotected+0x2a4><== NEVER TAKEN
2008c80: c0 22 e0 10 clr [ %o3 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008c84: 99 2b 20 02 sll %o4, 2, %o4
2008c88: 96 01 00 0c add %g4, %o4, %o3
2008c8c: d4 02 e0 04 ld [ %o3 + 4 ], %o2
2008c90: d4 23 60 04 st %o2, [ %o5 + 4 ]
if (c->child[dir])
2008c94: da 02 e0 04 ld [ %o3 + 4 ], %o5
2008c98: 80 a3 60 00 cmp %o5, 0
2008c9c: 32 80 00 02 bne,a 2008ca4 <_RBTree_Extract_validate_unprotected+0x274>
2008ca0: c2 23 40 00 st %g1, [ %o5 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008ca4: da 00 40 00 ld [ %g1 ], %o5
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
2008ca8: 98 01 00 0c add %g4, %o4, %o4
2008cac: c2 23 20 04 st %g1, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008cb0: d8 03 60 04 ld [ %o5 + 4 ], %o4
c->parent = the_node->parent;
2008cb4: da 21 00 00 st %o5, [ %g4 ]
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;
2008cb8: 98 18 40 0c xor %g1, %o4, %o4
c->parent = the_node->parent;
the_node->parent = c;
2008cbc: c8 20 40 00 st %g4, [ %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;
2008cc0: 80 a0 00 0c cmp %g0, %o4
2008cc4: 82 40 20 00 addx %g0, 0, %g1
2008cc8: 83 28 60 02 sll %g1, 2, %g1
2008ccc: 9a 03 40 01 add %o5, %g1, %o5
2008cd0: c8 23 60 04 st %g4, [ %o5 + 4 ]
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
sibling = parent->child[!dir];
2008cd4: 82 00 80 0f add %g2, %o7, %g1
2008cd8: c2 00 60 04 ld [ %g1 + 4 ], %g1
2008cdc: 9e 00 40 0f add %g1, %o7, %o7
2008ce0: c8 03 e0 04 ld [ %o7 + 4 ], %g4
}
sibling->color = parent->color;
2008ce4: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
2008ce8: de 20 60 10 st %o7, [ %g1 + 0x10 ]
parent->color = RBT_BLACK;
2008cec: c0 20 a0 10 clr [ %g2 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2008cf0: 9e 10 20 01 mov 1, %o7
2008cf4: 9e 23 c0 03 sub %o7, %g3, %o7
2008cf8: 9f 2b e0 02 sll %o7, 2, %o7
2008cfc: 9e 00 80 0f add %g2, %o7, %o7
2008d00: c2 03 e0 04 ld [ %o7 + 4 ], %g1
2008d04: 80 a0 60 00 cmp %g1, 0
2008d08: 02 bf ff b4 be 2008bd8 <_RBTree_Extract_validate_unprotected+0x1a8><== NEVER TAKEN
2008d0c: c0 21 20 10 clr [ %g4 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008d10: 87 28 e0 02 sll %g3, 2, %g3
2008d14: 88 00 40 03 add %g1, %g3, %g4
2008d18: da 01 20 04 ld [ %g4 + 4 ], %o5
2008d1c: da 23 e0 04 st %o5, [ %o7 + 4 ]
if (c->child[dir])
2008d20: c8 01 20 04 ld [ %g4 + 4 ], %g4
2008d24: 80 a1 20 00 cmp %g4, 0
2008d28: 32 80 00 02 bne,a 2008d30 <_RBTree_Extract_validate_unprotected+0x300>
2008d2c: c4 21 00 00 st %g2, [ %g4 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008d30: c8 00 80 00 ld [ %g2 ], %g4
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
2008d34: 86 00 40 03 add %g1, %g3, %g3
2008d38: c4 20 e0 04 st %g2, [ %g3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008d3c: c6 01 20 04 ld [ %g4 + 4 ], %g3
c->parent = the_node->parent;
2008d40: c8 20 40 00 st %g4, [ %g1 ]
the_node->parent = c;
2008d44: c2 20 80 00 st %g1, [ %g2 ]
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;
2008d48: 86 18 c0 02 xor %g3, %g2, %g3
2008d4c: 80 a0 00 03 cmp %g0, %g3
2008d50: 84 40 20 00 addx %g0, 0, %g2
2008d54: 85 28 a0 02 sll %g2, 2, %g2
2008d58: 88 01 00 02 add %g4, %g2, %g4
2008d5c: c2 21 20 04 st %g1, [ %g4 + 4 ]
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2008d60: c2 06 00 00 ld [ %i0 ], %g1
2008d64: c2 00 40 00 ld [ %g1 ], %g1
2008d68: 80 a0 60 00 cmp %g1, 0
2008d6c: 22 bf ff a0 be,a 2008bec <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN
2008d70: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED
2008d74: 81 c7 e0 08 ret
2008d78: 81 e8 00 00 restore
02008fdc <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
2008fdc: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
2008fe0: 7f ff e6 8a call 2002a08 <sparc_disable_interrupts>
2008fe4: 01 00 00 00 nop
return_node = _RBTree_Find_unprotected( the_rbtree, the_value );
_ISR_Enable( level );
return return_node;
}
2008fe8: 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) {
2008fec: 80 a6 20 00 cmp %i0, 0
2008ff0: 32 80 00 0b bne,a 200901c <_RBTree_Find+0x40> <== ALWAYS TAKEN
2008ff4: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2008ff8: 30 80 00 0c b,a 2009028 <_RBTree_Find+0x4c> <== NOT EXECUTED
if (the_value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_value > iter_node->value;
2008ffc: 82 40 20 00 addx %g0, 0, %g1
iter_node = iter_node->child[dir];
2009000: 83 28 60 02 sll %g1, 2, %g1
2009004: b0 06 00 01 add %i0, %g1, %i0
2009008: 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) {
200900c: 80 a6 20 00 cmp %i0, 0
2009010: 02 80 00 06 be 2009028 <_RBTree_Find+0x4c> <== NEVER TAKEN
2009014: 01 00 00 00 nop
if (the_value == iter_node->value) return(iter_node);
2009018: c2 06 20 0c ld [ %i0 + 0xc ], %g1
200901c: 80 a6 40 01 cmp %i1, %g1
2009020: 12 bf ff f7 bne 2008ffc <_RBTree_Find+0x20>
2009024: 80 a0 40 19 cmp %g1, %i1
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
return_node = _RBTree_Find_unprotected( the_rbtree, the_value );
_ISR_Enable( level );
2009028: 7f ff e6 7c call 2002a18 <sparc_enable_interrupts>
200902c: 01 00 00 00 nop
return return_node;
}
2009030: 81 c7 e0 08 ret
2009034: 81 e8 00 00 restore
02008f90 <_RBTree_Find_header>:
*/
RBTree_Control *_RBTree_Find_header(
RBTree_Node *the_node
)
{
2008f90: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Control *return_header;
return_header = NULL;
_ISR_Disable( level );
2008f94: 7f ff e6 9d call 2002a08 <sparc_disable_interrupts>
2008f98: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
2008f9c: 80 a6 20 00 cmp %i0, 0
2008fa0: 02 80 00 0b be 2008fcc <_RBTree_Find_header+0x3c> <== NEVER TAKEN
2008fa4: ba 10 20 00 clr %i5
if(!(the_node->parent)) return NULL;
2008fa8: fa 06 00 00 ld [ %i0 ], %i5
2008fac: 80 a7 60 00 cmp %i5, 0
2008fb0: 32 80 00 04 bne,a 2008fc0 <_RBTree_Find_header+0x30> <== ALWAYS TAKEN
2008fb4: c2 07 40 00 ld [ %i5 ], %g1
2008fb8: 30 80 00 05 b,a 2008fcc <_RBTree_Find_header+0x3c> <== NOT EXECUTED
2008fbc: c2 07 40 00 ld [ %i5 ], %g1
while(the_node->parent) the_node = the_node->parent;
2008fc0: 80 a0 60 00 cmp %g1, 0
2008fc4: 32 bf ff fe bne,a 2008fbc <_RBTree_Find_header+0x2c>
2008fc8: ba 10 00 01 mov %g1, %i5
return_header = _RBTree_Find_header_unprotected( the_node );
_ISR_Enable( level );
2008fcc: 7f ff e6 93 call 2002a18 <sparc_enable_interrupts>
2008fd0: b0 10 00 1d mov %i5, %i0
return return_header;
}
2008fd4: 81 c7 e0 08 ret
2008fd8: 81 e8 00 00 restore
02009224 <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
2009224: 9d e3 bf a0 save %sp, -96, %sp
if(!the_node) return (RBTree_Node*)-1;
2009228: 80 a6 60 00 cmp %i1, 0
200922c: 02 80 00 14 be 200927c <_RBTree_Insert_unprotected+0x58> <== NEVER TAKEN
2009230: 82 10 3f ff mov -1, %g1
RBTree_Node *iter_node = the_rbtree->root;
2009234: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (!iter_node) { /* special case: first node inserted */
2009238: 80 a0 60 00 cmp %g1, 0
200923c: 22 80 00 23 be,a 20092c8 <_RBTree_Insert_unprotected+0xa4>
2009240: c0 26 60 10 clr [ %i1 + 0x10 ]
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
the_rbtree->first[dir] = the_node;
2009244: 10 80 00 0a b 200926c <_RBTree_Insert_unprotected+0x48>
2009248: c6 06 60 0c ld [ %i1 + 0xc ], %g3
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);
RBTree_Direction dir = the_node->value > iter_node->value;
200924c: 9e 40 20 00 addx %g0, 0, %o7
if (!iter_node->child[dir]) {
2009250: 89 2b e0 02 sll %o7, 2, %g4
2009254: 88 00 40 04 add %g1, %g4, %g4
2009258: c4 01 20 04 ld [ %g4 + 4 ], %g2
200925c: 80 a0 a0 00 cmp %g2, 0
2009260: 22 80 00 09 be,a 2009284 <_RBTree_Insert_unprotected+0x60>
2009264: c0 26 60 08 clr [ %i1 + 8 ]
2009268: 82 10 00 02 mov %g2, %g1
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);
200926c: c4 00 60 0c ld [ %g1 + 0xc ], %g2
2009270: 80 a0 c0 02 cmp %g3, %g2
2009274: 12 bf ff f6 bne 200924c <_RBTree_Insert_unprotected+0x28>
2009278: 80 a0 80 03 cmp %g2, %g3
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
200927c: 81 c7 e0 08 ret
2009280: 91 e8 00 01 restore %g0, %g1, %o0
/* 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;
2009284: c0 26 60 04 clr [ %i1 + 4 ]
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First(
RBTree_Control *the_rbtree,
RBTree_Direction dir
)
{
return the_rbtree->first[dir];
2009288: 9e 03 e0 02 add %o7, 2, %o7
200928c: 9f 2b e0 02 sll %o7, 2, %o7
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
2009290: c4 06 00 0f ld [ %i0 + %o7 ], %g2
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;
the_node->color = RBT_RED;
2009294: 86 10 20 01 mov 1, %g3
iter_node->child[dir] = the_node;
2009298: f2 21 20 04 st %i1, [ %g4 + 4 ]
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;
the_node->color = RBT_RED;
200929c: c6 26 60 10 st %g3, [ %i1 + 0x10 ]
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
20092a0: 80 a0 40 02 cmp %g1, %g2
20092a4: 02 80 00 07 be 20092c0 <_RBTree_Insert_unprotected+0x9c>
20092a8: c2 26 40 00 st %g1, [ %i1 ]
}
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
20092ac: 7f ff ff 72 call 2009074 <_RBTree_Validate_insert_unprotected>
20092b0: 90 10 00 19 mov %i1, %o0
}
return (RBTree_Node*)0;
20092b4: 82 10 20 00 clr %g1
}
20092b8: 81 c7 e0 08 ret
20092bc: 91 e8 00 01 restore %g0, %g1, %o0
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
the_rbtree->first[dir] = the_node;
20092c0: 10 bf ff fb b 20092ac <_RBTree_Insert_unprotected+0x88>
20092c4: f2 26 00 0f st %i1, [ %i0 + %o7 ]
RBTree_Node *iter_node = the_rbtree->root;
if (!iter_node) { /* special case: first node inserted */
the_node->color = RBT_BLACK;
the_rbtree->root = the_node;
20092c8: f2 26 20 04 st %i1, [ %i0 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
20092cc: f2 26 20 0c st %i1, [ %i0 + 0xc ]
20092d0: f2 26 20 08 st %i1, [ %i0 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
20092d4: f0 26 40 00 st %i0, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
20092d8: c0 26 60 08 clr [ %i1 + 8 ]
20092dc: 10 bf ff e8 b 200927c <_RBTree_Insert_unprotected+0x58>
20092e0: c0 26 60 04 clr [ %i1 + 4 ]
02009074 <_RBTree_Validate_insert_unprotected>:
* append operation.
*/
void _RBTree_Validate_insert_unprotected(
RBTree_Node *the_node
)
{
2009074: 9d e3 bf a0 save %sp, -96, %sp
} else { /* if uncle is black */
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) {
2009078: 96 10 20 01 mov 1, %o3
ISR_Level level;
_ISR_Disable( level );
_RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
200907c: c2 06 00 00 ld [ %i0 ], %g1
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
2009080: c4 00 40 00 ld [ %g1 ], %g2
2009084: 86 90 a0 00 orcc %g2, 0, %g3
2009088: 22 80 00 06 be,a 20090a0 <_RBTree_Validate_insert_unprotected+0x2c>
200908c: 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);
2009090: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
2009094: 80 a1 20 01 cmp %g4, 1
2009098: 22 80 00 04 be,a 20090a8 <_RBTree_Validate_insert_unprotected+0x34>
200909c: c8 00 80 00 ld [ %g2 ], %g4
20090a0: 81 c7 e0 08 ret
20090a4: 81 e8 00 00 restore
)
{
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;
20090a8: 80 a1 20 00 cmp %g4, 0
20090ac: 02 80 00 0c be 20090dc <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN
20090b0: de 00 a0 04 ld [ %g2 + 4 ], %o7
{
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])
20090b4: 80 a0 40 0f cmp %g1, %o7
20090b8: 02 80 00 59 be 200921c <_RBTree_Validate_insert_unprotected+0x1a8>
20090bc: 88 10 00 0f mov %o7, %g4
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
20090c0: 80 a1 20 00 cmp %g4, 0
20090c4: 22 80 00 07 be,a 20090e0 <_RBTree_Validate_insert_unprotected+0x6c>
20090c8: c8 00 60 04 ld [ %g1 + 4 ], %g4
20090cc: da 01 20 10 ld [ %g4 + 0x10 ], %o5
20090d0: 80 a3 60 01 cmp %o5, 1
20090d4: 22 80 00 4c be,a 2009204 <_RBTree_Validate_insert_unprotected+0x190>
20090d8: c0 20 60 10 clr [ %g1 + 0x10 ]
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];
20090dc: c8 00 60 04 ld [ %g1 + 4 ], %g4
RBTree_Direction pdir = the_node->parent != g->child[0];
20090e0: 9e 18 40 0f xor %g1, %o7, %o7
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];
20090e4: 88 19 00 18 xor %g4, %i0, %g4
20090e8: 80 a0 00 04 cmp %g0, %g4
20090ec: 9a 40 20 00 addx %g0, 0, %o5
RBTree_Direction pdir = the_node->parent != g->child[0];
20090f0: 80 a0 00 0f cmp %g0, %o7
20090f4: 88 40 20 00 addx %g0, 0, %g4
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
20090f8: 80 a3 40 04 cmp %o5, %g4
20090fc: 02 80 00 46 be 2009214 <_RBTree_Validate_insert_unprotected+0x1a0>
2009100: 98 22 c0 0d sub %o3, %o5, %o4
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2009104: 98 22 c0 04 sub %o3, %g4, %o4
2009108: 9b 2b 20 02 sll %o4, 2, %o5
200910c: 9a 00 40 0d add %g1, %o5, %o5
2009110: de 03 60 04 ld [ %o5 + 4 ], %o7
2009114: 80 a3 e0 00 cmp %o7, 0
2009118: 02 80 00 16 be 2009170 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN
200911c: 89 29 20 02 sll %g4, 2, %g4
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2009120: 94 03 c0 04 add %o7, %g4, %o2
2009124: d2 02 a0 04 ld [ %o2 + 4 ], %o1
2009128: d2 23 60 04 st %o1, [ %o5 + 4 ]
if (c->child[dir])
200912c: da 02 a0 04 ld [ %o2 + 4 ], %o5
2009130: 80 a3 60 00 cmp %o5, 0
2009134: 22 80 00 05 be,a 2009148 <_RBTree_Validate_insert_unprotected+0xd4>
2009138: 9a 03 c0 04 add %o7, %g4, %o5
c->child[dir]->parent = the_node;
200913c: c2 23 40 00 st %g1, [ %o5 ]
2009140: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
2009144: 9a 03 c0 04 add %o7, %g4, %o5
2009148: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200914c: da 00 a0 04 ld [ %g2 + 4 ], %o5
c->parent = the_node->parent;
2009150: c4 23 c0 00 st %g2, [ %o7 ]
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;
2009154: 9a 18 40 0d xor %g1, %o5, %o5
c->parent = the_node->parent;
the_node->parent = c;
2009158: de 20 40 00 st %o7, [ %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;
200915c: 80 a0 00 0d cmp %g0, %o5
2009160: 82 40 20 00 addx %g0, 0, %g1
2009164: 83 28 60 02 sll %g1, 2, %g1
2009168: 84 00 80 01 add %g2, %g1, %g2
200916c: de 20 a0 04 st %o7, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
2009170: b0 06 00 04 add %i0, %g4, %i0
2009174: f0 06 20 04 ld [ %i0 + 4 ], %i0
2009178: c2 06 00 00 ld [ %i0 ], %g1
}
the_node->parent->color = RBT_BLACK;
200917c: c0 20 60 10 clr [ %g1 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2009180: 88 00 c0 04 add %g3, %g4, %g4
2009184: c2 01 20 04 ld [ %g4 + 4 ], %g1
2009188: 80 a0 60 00 cmp %g1, 0
200918c: 02 bf ff bc be 200907c <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN
2009190: d6 20 e0 10 st %o3, [ %g3 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2009194: 99 2b 20 02 sll %o4, 2, %o4
2009198: 84 00 40 0c add %g1, %o4, %g2
200919c: de 00 a0 04 ld [ %g2 + 4 ], %o7
20091a0: de 21 20 04 st %o7, [ %g4 + 4 ]
if (c->child[dir])
20091a4: c4 00 a0 04 ld [ %g2 + 4 ], %g2
20091a8: 80 a0 a0 00 cmp %g2, 0
20091ac: 32 80 00 02 bne,a 20091b4 <_RBTree_Validate_insert_unprotected+0x140>
20091b0: c6 20 80 00 st %g3, [ %g2 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20091b4: c4 00 c0 00 ld [ %g3 ], %g2
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
20091b8: 98 00 40 0c add %g1, %o4, %o4
20091bc: c6 23 20 04 st %g3, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20091c0: c8 00 a0 04 ld [ %g2 + 4 ], %g4
c->parent = the_node->parent;
20091c4: c4 20 40 00 st %g2, [ %g1 ]
the_node->parent = c;
20091c8: c2 20 c0 00 st %g1, [ %g3 ]
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;
20091cc: 88 19 00 03 xor %g4, %g3, %g4
20091d0: 80 a0 00 04 cmp %g0, %g4
20091d4: 86 40 20 00 addx %g0, 0, %g3
20091d8: 87 28 e0 02 sll %g3, 2, %g3
20091dc: 84 00 80 03 add %g2, %g3, %g2
20091e0: c2 20 a0 04 st %g1, [ %g2 + 4 ]
ISR_Level level;
_ISR_Disable( level );
_RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
20091e4: c2 06 00 00 ld [ %i0 ], %g1
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
20091e8: c4 00 40 00 ld [ %g1 ], %g2
20091ec: 86 90 a0 00 orcc %g2, 0, %g3
20091f0: 32 bf ff a9 bne,a 2009094 <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN
20091f4: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
20091f8: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED
20091fc: 81 c7 e0 08 ret <== NOT EXECUTED
2009200: 81 e8 00 00 restore <== NOT EXECUTED
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;
u->color = RBT_BLACK;
2009204: c0 21 20 10 clr [ %g4 + 0x10 ]
g->color = RBT_RED;
2009208: da 20 a0 10 st %o5, [ %g2 + 0x10 ]
200920c: 10 bf ff 9c b 200907c <_RBTree_Validate_insert_unprotected+0x8>
2009210: b0 10 00 02 mov %g2, %i0
2009214: 10 bf ff da b 200917c <_RBTree_Validate_insert_unprotected+0x108>
2009218: 89 2b 60 02 sll %o5, 2, %g4
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])
return the_node->parent->child[RBT_RIGHT];
200921c: 10 bf ff a9 b 20090c0 <_RBTree_Validate_insert_unprotected+0x4c>
2009220: c8 00 a0 08 ld [ %g2 + 8 ], %g4
020067ac <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
20067ac: 9d e3 bf 98 save %sp, -104, %sp
rtems_initialization_tasks_table *user_tasks;
/*
* Move information into local variables
*/
user_tasks = Configuration_RTEMS_API.User_initialization_tasks_table;
20067b0: 03 00 80 52 sethi %hi(0x2014800), %g1
20067b4: 82 10 62 c4 or %g1, 0x2c4, %g1 ! 2014ac4 <Configuration_RTEMS_API>
20067b8: fa 00 60 2c ld [ %g1 + 0x2c ], %i5
maximum = Configuration_RTEMS_API.number_of_initialization_tasks;
/*
* Verify that we have a set of user tasks to iterate
*/
if ( !user_tasks )
20067bc: 80 a7 60 00 cmp %i5, 0
20067c0: 02 80 00 18 be 2006820 <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
20067c4: f6 00 60 28 ld [ %g1 + 0x28 ], %i3
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
20067c8: 80 a6 e0 00 cmp %i3, 0
20067cc: 02 80 00 15 be 2006820 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
20067d0: b8 10 20 00 clr %i4
return_value = rtems_task_create(
20067d4: d4 07 60 04 ld [ %i5 + 4 ], %o2
20067d8: d0 07 40 00 ld [ %i5 ], %o0
20067dc: d2 07 60 08 ld [ %i5 + 8 ], %o1
20067e0: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
20067e4: d8 07 60 0c ld [ %i5 + 0xc ], %o4
20067e8: 7f ff ff 70 call 20065a8 <rtems_task_create>
20067ec: 9a 07 bf fc add %fp, -4, %o5
user_tasks[ index ].stack_size,
user_tasks[ index ].mode_set,
user_tasks[ index ].attribute_set,
&id
);
if ( !rtems_is_status_successful( return_value ) )
20067f0: 94 92 20 00 orcc %o0, 0, %o2
20067f4: 12 80 00 0d bne 2006828 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
20067f8: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
20067fc: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
2006800: 40 00 00 0e call 2006838 <rtems_task_start>
2006804: d2 07 60 10 ld [ %i5 + 0x10 ], %o1
id,
user_tasks[ index ].entry_point,
user_tasks[ index ].argument
);
if ( !rtems_is_status_successful( return_value ) )
2006808: 94 92 20 00 orcc %o0, 0, %o2
200680c: 12 80 00 07 bne 2006828 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2006810: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
2006814: 80 a7 00 1b cmp %i4, %i3
2006818: 12 bf ff ef bne 20067d4 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
200681c: ba 07 60 1c add %i5, 0x1c, %i5
2006820: 81 c7 e0 08 ret
2006824: 81 e8 00 00 restore
id,
user_tasks[ index ].entry_point,
user_tasks[ index ].argument
);
if ( !rtems_is_status_successful( return_value ) )
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
2006828: 90 10 20 01 mov 1, %o0
200682c: 40 00 03 e1 call 20077b0 <_Internal_error_Occurred>
2006830: 92 10 20 01 mov 1, %o1
0200bc88 <_RTEMS_tasks_Post_switch_extension>:
*/
void _RTEMS_tasks_Post_switch_extension(
Thread_Control *executing
)
{
200bc88: 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 ];
200bc8c: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
if ( !api )
200bc90: 80 a7 60 00 cmp %i5, 0
200bc94: 02 80 00 1e be 200bd0c <_RTEMS_tasks_Post_switch_extension+0x84><== NEVER TAKEN
200bc98: 01 00 00 00 nop
* Signal Processing
*/
asr = &api->Signal;
_ISR_Disable( level );
200bc9c: 7f ff d8 ad call 2001f50 <sparc_disable_interrupts>
200bca0: 01 00 00 00 nop
signal_set = asr->signals_posted;
200bca4: f8 07 60 14 ld [ %i5 + 0x14 ], %i4
asr->signals_posted = 0;
200bca8: c0 27 60 14 clr [ %i5 + 0x14 ]
_ISR_Enable( level );
200bcac: 7f ff d8 ad call 2001f60 <sparc_enable_interrupts>
200bcb0: 01 00 00 00 nop
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
200bcb4: 80 a7 20 00 cmp %i4, 0
200bcb8: 32 80 00 04 bne,a 200bcc8 <_RTEMS_tasks_Post_switch_extension+0x40>
200bcbc: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200bcc0: 81 c7 e0 08 ret
200bcc4: 81 e8 00 00 restore
return;
asr->nest_level += 1;
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200bcc8: d0 07 60 10 ld [ %i5 + 0x10 ], %o0
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
200bccc: 82 00 60 01 inc %g1
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200bcd0: 94 07 bf fc add %fp, -4, %o2
200bcd4: 37 00 00 3f sethi %hi(0xfc00), %i3
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
200bcd8: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200bcdc: 40 00 07 d2 call 200dc24 <rtems_task_mode>
200bce0: 92 16 e3 ff or %i3, 0x3ff, %o1
(*asr->handler)( signal_set );
200bce4: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200bce8: 9f c0 40 00 call %g1
200bcec: 90 10 00 1c mov %i4, %o0
asr->nest_level -= 1;
200bcf0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200bcf4: 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;
200bcf8: 82 00 7f ff add %g1, -1, %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200bcfc: 92 16 e3 ff or %i3, 0x3ff, %o1
200bd00: 94 07 bf fc add %fp, -4, %o2
200bd04: 40 00 07 c8 call 200dc24 <rtems_task_mode>
200bd08: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
200bd0c: 81 c7 e0 08 ret
200bd10: 81 e8 00 00 restore
0200bbf0 <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
200bbf0: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200bbf4: 80 a0 60 00 cmp %g1, 0
200bbf8: 22 80 00 0c be,a 200bc28 <_RTEMS_tasks_Switch_extension+0x38>
200bbfc: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
tvp->tval = *tvp->ptr;
200bc00: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
200bc04: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
200bc08: c8 00 80 00 ld [ %g2 ], %g4
200bc0c: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
200bc10: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200bc14: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
200bc18: 80 a0 60 00 cmp %g1, 0
200bc1c: 32 bf ff fa bne,a 200bc04 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
200bc20: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
tvp->tval = *tvp->ptr;
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
200bc24: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
while (tvp) {
200bc28: 80 a0 60 00 cmp %g1, 0
200bc2c: 02 80 00 0b be 200bc58 <_RTEMS_tasks_Switch_extension+0x68>
200bc30: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
200bc34: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
200bc38: c6 00 60 0c ld [ %g1 + 0xc ], %g3
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
tvp->gval = *tvp->ptr;
200bc3c: c8 00 80 00 ld [ %g2 ], %g4
200bc40: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
200bc44: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200bc48: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
200bc4c: 80 a0 60 00 cmp %g1, 0
200bc50: 32 bf ff fa bne,a 200bc38 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
200bc54: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
200bc58: 81 c3 e0 08 retl
02007a74 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2007a74: 9d e3 bf 98 save %sp, -104, %sp
2007a78: 11 00 80 77 sethi %hi(0x201dc00), %o0
2007a7c: 92 10 00 18 mov %i0, %o1
2007a80: 90 12 21 04 or %o0, 0x104, %o0
2007a84: 40 00 08 1a call 2009aec <_Objects_Get>
2007a88: 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 ) {
2007a8c: c2 07 bf fc ld [ %fp + -4 ], %g1
2007a90: 80 a0 60 00 cmp %g1, 0
2007a94: 12 80 00 16 bne 2007aec <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN
2007a98: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
2007a9c: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
2007aa0: 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);
2007aa4: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
2007aa8: 80 88 80 01 btst %g2, %g1
2007aac: 22 80 00 08 be,a 2007acc <_Rate_monotonic_Timeout+0x58>
2007ab0: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007ab4: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
2007ab8: c2 07 60 08 ld [ %i5 + 8 ], %g1
2007abc: 80 a0 80 01 cmp %g2, %g1
2007ac0: 02 80 00 19 be 2007b24 <_Rate_monotonic_Timeout+0xb0>
2007ac4: 13 04 00 ff sethi %hi(0x1003fc00), %o1
_Thread_Unblock( the_thread );
_Rate_monotonic_Initiate_statistics( the_period );
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) {
2007ac8: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007acc: 80 a0 60 01 cmp %g1, 1
2007ad0: 02 80 00 09 be 2007af4 <_Rate_monotonic_Timeout+0x80>
2007ad4: 82 10 20 04 mov 4, %g1
_Rate_monotonic_Initiate_statistics( the_period );
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else
the_period->state = RATE_MONOTONIC_EXPIRED;
2007ad8: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
*/
RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void )
{
RTEMS_COMPILER_MEMORY_BARRIER();
_Thread_Dispatch_disable_level -= 1;
2007adc: 03 00 80 77 sethi %hi(0x201dc00), %g1
2007ae0: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 201de70 <_Thread_Dispatch_disable_level>
2007ae4: 84 00 bf ff add %g2, -1, %g2
2007ae8: c4 20 62 70 st %g2, [ %g1 + 0x270 ]
2007aec: 81 c7 e0 08 ret
2007af0: 81 e8 00 00 restore
_Rate_monotonic_Initiate_statistics( the_period );
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) {
the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING;
2007af4: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
2007af8: 90 10 00 1d mov %i5, %o0
_Rate_monotonic_Initiate_statistics( the_period );
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) {
the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING;
2007afc: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
2007b00: 7f ff fe 5c call 2007470 <_Rate_monotonic_Initiate_statistics>
2007b04: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b08: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b0c: 11 00 80 77 sethi %hi(0x201dc00), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b10: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b14: 90 12 23 34 or %o0, 0x334, %o0
2007b18: 40 00 0f cf call 200ba54 <_Watchdog_Insert>
2007b1c: 92 07 60 10 add %i5, 0x10, %o1
2007b20: 30 bf ff ef b,a 2007adc <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007b24: 40 00 0a af call 200a5e0 <_Thread_Clear_state>
2007b28: 92 12 63 f8 or %o1, 0x3f8, %o1
the_thread = the_period->owner;
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
the_thread->Wait.id == the_period->Object.id ) {
_Thread_Unblock( the_thread );
_Rate_monotonic_Initiate_statistics( the_period );
2007b2c: 10 bf ff f5 b 2007b00 <_Rate_monotonic_Timeout+0x8c>
2007b30: 90 10 00 1d mov %i5, %o0
02008654 <_Scheduler_priority_Yield>:
* ready chain
* select heir
*/
void _Scheduler_priority_Yield(void)
{
2008654: 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;
2008658: 37 00 80 56 sethi %hi(0x2015800), %i3
200865c: b6 16 e1 5c or %i3, 0x15c, %i3 ! 201595c <_Per_CPU_Information>
2008660: fa 06 e0 0c ld [ %i3 + 0xc ], %i5
sched_info = (Scheduler_priority_Per_thread *) executing->scheduler_info;
ready = sched_info->ready_chain;
2008664: c2 07 60 8c ld [ %i5 + 0x8c ], %g1
_ISR_Disable( level );
2008668: 7f ff e6 3a call 2001f50 <sparc_disable_interrupts>
200866c: f8 00 40 00 ld [ %g1 ], %i4
2008670: b0 10 00 08 mov %o0, %i0
if ( !_Chain_Has_only_one_node( ready ) ) {
2008674: c4 07 00 00 ld [ %i4 ], %g2
2008678: c2 07 20 08 ld [ %i4 + 8 ], %g1
200867c: 80 a0 80 01 cmp %g2, %g1
2008680: 02 80 00 16 be 20086d8 <_Scheduler_priority_Yield+0x84>
2008684: 86 07 20 04 add %i4, 4, %g3
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
2008688: c2 07 60 04 ld [ %i5 + 4 ], %g1
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
200868c: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
next->previous = previous;
2008690: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
2008694: 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;
2008698: c2 07 20 08 ld [ %i4 + 8 ], %g1
the_node->next = tail;
200869c: c6 27 40 00 st %g3, [ %i5 ]
tail->previous = the_node;
20086a0: fa 27 20 08 st %i5, [ %i4 + 8 ]
old_last->next = the_node;
20086a4: fa 20 40 00 st %i5, [ %g1 ]
the_node->previous = old_last;
20086a8: c2 27 60 04 st %g1, [ %i5 + 4 ]
_Chain_Extract_unprotected( &executing->Object.Node );
_Chain_Append_unprotected( ready, &executing->Object.Node );
_ISR_Flash( level );
20086ac: 7f ff e6 2d call 2001f60 <sparc_enable_interrupts>
20086b0: 01 00 00 00 nop
20086b4: 7f ff e6 27 call 2001f50 <sparc_disable_interrupts>
20086b8: 01 00 00 00 nop
if ( _Thread_Is_heir( executing ) )
20086bc: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1
20086c0: 80 a7 40 01 cmp %i5, %g1
20086c4: 02 80 00 0b be 20086f0 <_Scheduler_priority_Yield+0x9c> <== ALWAYS TAKEN
20086c8: 82 10 20 01 mov 1, %g1
_Thread_Heir = (Thread_Control *) _Chain_First( ready );
_Thread_Dispatch_necessary = true;
}
else if ( !_Thread_Is_heir( executing ) )
_Thread_Dispatch_necessary = true;
20086cc: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] <== NOT EXECUTED
_ISR_Enable( level );
20086d0: 7f ff e6 24 call 2001f60 <sparc_enable_interrupts>
20086d4: 81 e8 00 00 restore
if ( _Thread_Is_heir( executing ) )
_Thread_Heir = (Thread_Control *) _Chain_First( ready );
_Thread_Dispatch_necessary = true;
}
else if ( !_Thread_Is_heir( executing ) )
20086d8: c2 06 e0 10 ld [ %i3 + 0x10 ], %g1
20086dc: 80 a7 40 01 cmp %i5, %g1
20086e0: 02 bf ff fc be 20086d0 <_Scheduler_priority_Yield+0x7c> <== ALWAYS TAKEN
20086e4: 82 10 20 01 mov 1, %g1
_Thread_Dispatch_necessary = true;
20086e8: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ] <== NOT EXECUTED
20086ec: 30 bf ff f9 b,a 20086d0 <_Scheduler_priority_Yield+0x7c> <== NOT EXECUTED
_Chain_Append_unprotected( ready, &executing->Object.Node );
_ISR_Flash( level );
if ( _Thread_Is_heir( executing ) )
_Thread_Heir = (Thread_Control *) _Chain_First( ready );
20086f0: c2 07 00 00 ld [ %i4 ], %g1
20086f4: c2 26 e0 10 st %g1, [ %i3 + 0x10 ]
_Thread_Dispatch_necessary = true;
}
else if ( !_Thread_Is_heir( executing ) )
_Thread_Dispatch_necessary = true;
20086f8: 82 10 20 01 mov 1, %g1
20086fc: c2 2e e0 18 stb %g1, [ %i3 + 0x18 ]
2008700: 30 bf ff f4 b,a 20086d0 <_Scheduler_priority_Yield+0x7c>
020088d0 <_Scheduler_simple_Ready_queue_Enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
20088d0: 03 00 80 55 sethi %hi(0x2015400), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
20088d4: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 ! 2015664 <_Scheduler>
*/
for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) {
current = (Thread_Control *) the_node;
/* break when AT HEAD OF (or PAST) our priority */
if ( the_thread->current_priority <= current->current_priority ) {
20088d8: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
20088dc: c2 00 40 00 ld [ %g1 ], %g1
20088e0: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
20088e4: 80 a0 80 03 cmp %g2, %g3
20088e8: 3a 80 00 08 bcc,a 2008908 <_Scheduler_simple_Ready_queue_Enqueue_first+0x38>
20088ec: c2 00 60 04 ld [ %g1 + 4 ], %g1
* Do NOT need to check for end of chain because there is always
* at least one task on the ready chain -- the IDLE task. It can
* never block, should never attempt to obtain a semaphore or mutex,
* and thus will always be there.
*/
for ( the_node = _Chain_First(ready) ; ; the_node = the_node->next ) {
20088f0: c2 00 40 00 ld [ %g1 ], %g1
current = (Thread_Control *) the_node;
/* break when AT HEAD OF (or PAST) our priority */
if ( the_thread->current_priority <= current->current_priority ) {
20088f4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
20088f8: 80 a0 80 03 cmp %g2, %g3
20088fc: 2a bf ff fe bcs,a 20088f4 <_Scheduler_simple_Ready_queue_Enqueue_first+0x24><== NEVER TAKEN
2008900: c2 00 40 00 ld [ %g1 ], %g1
current = (Thread_Control *)current->Object.Node.previous;
2008904: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2008908: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
200890c: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
2008910: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
2008914: c4 22 00 00 st %g2, [ %o0 ]
}
}
/* enqueue */
_Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node );
}
2008918: 81 c3 e0 08 retl
200891c: d0 20 a0 04 st %o0, [ %g2 + 4 ]
020072e4 <_TOD_Tickle_ticks>:
*
* Output parameters: NONE
*/
void _TOD_Tickle_ticks( void )
{
20072e4: 9d e3 bf 98 save %sp, -104, %sp
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
20072e8: 05 00 80 56 sethi %hi(0x2015800), %g2
{
Timestamp_Control tick;
uint32_t seconds;
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
20072ec: 03 00 80 52 sethi %hi(0x2014800), %g1
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
20072f0: c6 00 a0 44 ld [ %g2 + 0x44 ], %g3
{
Timestamp_Control tick;
uint32_t seconds;
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
20072f4: c2 00 62 88 ld [ %g1 + 0x288 ], %g1
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
20072f8: 86 00 e0 01 inc %g3
{
Timestamp_Control tick;
uint32_t seconds;
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
20072fc: bb 28 60 07 sll %g1, 7, %i5
2007300: 89 28 60 02 sll %g1, 2, %g4
2007304: 88 27 40 04 sub %i5, %g4, %g4
2007308: 82 01 00 01 add %g4, %g1, %g1
200730c: 83 28 60 03 sll %g1, 3, %g1
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
/* Update the timespec format uptime */
_Timestamp_Add_to( &_TOD_Uptime, &tick );
2007310: 92 07 bf f8 add %fp, -8, %o1
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
2007314: c6 20 a0 44 st %g3, [ %g2 + 0x44 ]
{
Timestamp_Control tick;
uint32_t seconds;
/* Convert the tick quantum to a timestamp */
_Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() );
2007318: c2 27 bf fc st %g1, [ %fp + -4 ]
200731c: c0 27 bf f8 clr [ %fp + -8 ]
/* Update the counter of ticks since boot */
_Watchdog_Ticks_since_boot += 1;
/* Update the timespec format uptime */
_Timestamp_Add_to( &_TOD_Uptime, &tick );
2007320: 11 00 80 55 sethi %hi(0x2015400), %o0
2007324: 40 00 09 20 call 20097a4 <_Timespec_Add_to>
2007328: 90 12 23 ac or %o0, 0x3ac, %o0 ! 20157ac <_TOD_Uptime>
/* we do not care how much the uptime changed */
/* Update the timespec format TOD */
seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick );
200732c: 92 07 bf f8 add %fp, -8, %o1
2007330: 11 00 80 55 sethi %hi(0x2015400), %o0
2007334: 40 00 09 1c call 20097a4 <_Timespec_Add_to>
2007338: 90 12 23 bc or %o0, 0x3bc, %o0 ! 20157bc <_TOD_Now>
while ( seconds ) {
200733c: ba 92 20 00 orcc %o0, 0, %i5
2007340: 02 80 00 08 be 2007360 <_TOD_Tickle_ticks+0x7c>
2007344: 39 00 80 55 sethi %hi(0x2015400), %i4
*/
RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void )
{
_Watchdog_Tickle( &_Watchdog_Seconds_chain );
2007348: b8 17 23 e8 or %i4, 0x3e8, %i4 ! 20157e8 <_Watchdog_Seconds_chain>
200734c: 40 00 0a a2 call 2009dd4 <_Watchdog_Tickle>
2007350: 90 10 00 1c mov %i4, %o0
2007354: ba 87 7f ff addcc %i5, -1, %i5
2007358: 12 bf ff fd bne 200734c <_TOD_Tickle_ticks+0x68> <== NEVER TAKEN
200735c: 01 00 00 00 nop
2007360: 81 c7 e0 08 ret
2007364: 81 e8 00 00 restore
02007498 <_TOD_Validate>:
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
2007498: 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();
200749c: 03 00 80 76 sethi %hi(0x201d800), %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;
20074a0: 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) ||
20074a4: 80 a6 20 00 cmp %i0, 0
20074a8: 02 80 00 2c be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN
20074ac: d2 00 62 48 ld [ %g1 + 0x248 ], %o1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
20074b0: 11 00 03 d0 sethi %hi(0xf4000), %o0
20074b4: 40 00 48 6f call 2019670 <.udiv>
20074b8: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
20074bc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
20074c0: 80 a2 00 01 cmp %o0, %g1
20074c4: 28 80 00 26 bleu,a 200755c <_TOD_Validate+0xc4>
20074c8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
20074cc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
20074d0: 80 a0 60 3b cmp %g1, 0x3b
20074d4: 38 80 00 22 bgu,a 200755c <_TOD_Validate+0xc4>
20074d8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
20074dc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
20074e0: 80 a0 60 3b cmp %g1, 0x3b
20074e4: 38 80 00 1e bgu,a 200755c <_TOD_Validate+0xc4>
20074e8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
20074ec: c2 06 20 0c ld [ %i0 + 0xc ], %g1
20074f0: 80 a0 60 17 cmp %g1, 0x17
20074f4: 38 80 00 1a bgu,a 200755c <_TOD_Validate+0xc4>
20074f8: b0 0f 60 01 and %i5, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
20074fc: 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) ||
2007500: 80 a0 60 00 cmp %g1, 0
2007504: 02 80 00 15 be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN
2007508: 80 a0 60 0c cmp %g1, 0xc
(the_tod->month == 0) ||
200750c: 38 80 00 14 bgu,a 200755c <_TOD_Validate+0xc4>
2007510: b0 0f 60 01 and %i5, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2007514: c4 06 00 00 ld [ %i0 ], %g2
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
2007518: 80 a0 a7 c3 cmp %g2, 0x7c3
200751c: 28 80 00 10 bleu,a 200755c <_TOD_Validate+0xc4>
2007520: b0 0f 60 01 and %i5, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2007524: c6 06 20 08 ld [ %i0 + 8 ], %g3
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2007528: 80 a0 e0 00 cmp %g3, 0
200752c: 02 80 00 0b be 2007558 <_TOD_Validate+0xc0> <== NEVER TAKEN
2007530: 80 88 a0 03 btst 3, %g2
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
2007534: 32 80 00 0c bne,a 2007564 <_TOD_Validate+0xcc>
2007538: 83 28 60 02 sll %g1, 2, %g1
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
200753c: 82 00 60 0d add %g1, 0xd, %g1
2007540: 05 00 80 71 sethi %hi(0x201c400), %g2
2007544: 83 28 60 02 sll %g1, 2, %g1
2007548: 84 10 a3 60 or %g2, 0x360, %g2
200754c: c2 00 80 01 ld [ %g2 + %g1 ], %g1
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
2007550: 80 a0 40 03 cmp %g1, %g3
2007554: ba 60 3f ff subx %g0, -1, %i5
if ( the_tod->day > days_in_month )
return false;
return true;
}
2007558: b0 0f 60 01 and %i5, 1, %i0
200755c: 81 c7 e0 08 ret
2007560: 81 e8 00 00 restore
return false;
if ( (the_tod->year % 4) == 0 )
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
2007564: 05 00 80 71 sethi %hi(0x201c400), %g2
2007568: 84 10 a3 60 or %g2, 0x360, %g2 ! 201c760 <_TOD_Days_per_month>
200756c: c2 00 80 01 ld [ %g2 + %g1 ], %g1
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
2007570: 80 a0 40 03 cmp %g1, %g3
2007574: 10 bf ff f9 b 2007558 <_TOD_Validate+0xc0>
2007578: ba 60 3f ff subx %g0, -1, %i5
0200875c <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
200875c: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
2008760: 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 );
2008764: 40 00 03 96 call 20095bc <_Thread_Set_transient>
2008768: 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 )
200876c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
2008770: 80 a0 40 19 cmp %g1, %i1
2008774: 02 80 00 05 be 2008788 <_Thread_Change_priority+0x2c>
2008778: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
200877c: 90 10 00 18 mov %i0, %o0
2008780: 40 00 03 75 call 2009554 <_Thread_Set_priority>
2008784: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
2008788: 7f ff e5 f2 call 2001f50 <sparc_disable_interrupts>
200878c: 01 00 00 00 nop
2008790: b0 10 00 08 mov %o0, %i0
/*
* If the thread has more than STATES_TRANSIENT set, then it is blocked,
* If it is blocked on a thread queue, then we need to requeue it.
*/
state = the_thread->current_state;
2008794: f6 07 60 10 ld [ %i5 + 0x10 ], %i3
if ( state != STATES_TRANSIENT ) {
2008798: 80 a6 e0 04 cmp %i3, 4
200879c: 02 80 00 18 be 20087fc <_Thread_Change_priority+0xa0>
20087a0: 80 8f 20 04 btst 4, %i4
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
20087a4: 02 80 00 0b be 20087d0 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
20087a8: 82 0e ff fb and %i3, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
20087ac: 7f ff e5 ed call 2001f60 <sparc_enable_interrupts> <== NOT EXECUTED
20087b0: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED
*/
RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue (
States_Control the_states
)
{
return (the_states & STATES_WAITING_ON_THREAD_QUEUE);
20087b4: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
20087b8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
20087bc: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED
20087c0: 32 80 00 0d bne,a 20087f4 <_Thread_Change_priority+0x98> <== NOT EXECUTED
20087c4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
20087c8: 81 c7 e0 08 ret
20087cc: 81 e8 00 00 restore
*/
state = the_thread->current_state;
if ( state != STATES_TRANSIENT ) {
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
20087d0: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
20087d4: 7f ff e5 e3 call 2001f60 <sparc_enable_interrupts>
20087d8: 90 10 00 18 mov %i0, %o0
20087dc: 03 00 00 ef sethi %hi(0x3bc00), %g1
20087e0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
20087e4: 80 8e c0 01 btst %i3, %g1
20087e8: 02 bf ff f8 be 20087c8 <_Thread_Change_priority+0x6c>
20087ec: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
20087f0: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
20087f4: 40 00 03 28 call 2009494 <_Thread_queue_Requeue>
20087f8: 93 e8 00 1d restore %g0, %i5, %o1
20087fc: 39 00 80 52 sethi %hi(0x2014800), %i4
}
return;
}
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) ) {
2008800: 12 80 00 08 bne 2008820 <_Thread_Change_priority+0xc4> <== NEVER TAKEN
2008804: b8 17 23 64 or %i4, 0x364, %i4 ! 2014b64 <_Scheduler>
* 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 );
if ( prepend_it )
2008808: 80 a6 a0 00 cmp %i2, 0
200880c: 02 80 00 1a be 2008874 <_Thread_Change_priority+0x118>
2008810: c0 27 60 10 clr [ %i5 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
2008814: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
2008818: 9f c0 40 00 call %g1
200881c: 90 10 00 1d mov %i5, %o0
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
2008820: 7f ff e5 d0 call 2001f60 <sparc_enable_interrupts>
2008824: 90 10 00 18 mov %i0, %o0
2008828: 7f ff e5 ca call 2001f50 <sparc_disable_interrupts>
200882c: 01 00 00 00 nop
* 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();
2008830: c2 07 20 08 ld [ %i4 + 8 ], %g1
2008834: 9f c0 40 00 call %g1
2008838: 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 );
200883c: 03 00 80 56 sethi %hi(0x2015800), %g1
2008840: 82 10 61 5c or %g1, 0x15c, %g1 ! 201595c <_Per_CPU_Information>
2008844: 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() &&
2008848: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200884c: 80 a0 80 03 cmp %g2, %g3
2008850: 02 80 00 07 be 200886c <_Thread_Change_priority+0x110>
2008854: 01 00 00 00 nop
2008858: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200885c: 80 a0 a0 00 cmp %g2, 0
2008860: 02 80 00 03 be 200886c <_Thread_Change_priority+0x110>
2008864: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
2008868: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
_ISR_Enable( level );
200886c: 7f ff e5 bd call 2001f60 <sparc_enable_interrupts>
2008870: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
2008874: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
2008878: 9f c0 40 00 call %g1
200887c: 90 10 00 1d mov %i5, %o0
2008880: 30 bf ff e8 b,a 2008820 <_Thread_Change_priority+0xc4>
02008a90 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
2008a90: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2008a94: 90 10 00 18 mov %i0, %o0
2008a98: 40 00 00 76 call 2008c70 <_Thread_Get>
2008a9c: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2008aa0: c2 07 bf fc ld [ %fp + -4 ], %g1
2008aa4: 80 a0 60 00 cmp %g1, 0
2008aa8: 12 80 00 08 bne 2008ac8 <_Thread_Delay_ended+0x38> <== NEVER TAKEN
2008aac: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
2008ab0: 7f ff ff 75 call 2008884 <_Thread_Clear_state>
2008ab4: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_END+0xdc00018>
2008ab8: 03 00 80 55 sethi %hi(0x2015400), %g1
2008abc: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2015730 <_Thread_Dispatch_disable_level>
2008ac0: 84 00 bf ff add %g2, -1, %g2
2008ac4: c4 20 63 30 st %g2, [ %g1 + 0x330 ]
2008ac8: 81 c7 e0 08 ret
2008acc: 81 e8 00 00 restore
02008ad0 <_Thread_Dispatch>:
* dispatch thread
* no dispatch thread
*/
void _Thread_Dispatch( void )
{
2008ad0: 9d e3 bf 90 save %sp, -112, %sp
Thread_Control *executing;
Thread_Control *heir;
ISR_Level level;
executing = _Thread_Executing;
2008ad4: 37 00 80 56 sethi %hi(0x2015800), %i3
2008ad8: b6 16 e1 5c or %i3, 0x15c, %i3 ! 201595c <_Per_CPU_Information>
_ISR_Disable( level );
2008adc: 7f ff e5 1d call 2001f50 <sparc_disable_interrupts>
2008ae0: fa 06 e0 0c ld [ %i3 + 0xc ], %i5
while ( _Thread_Dispatch_necessary == true ) {
2008ae4: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1
2008ae8: 80 a0 60 00 cmp %g1, 0
2008aec: 02 80 00 4e be 2008c24 <_Thread_Dispatch+0x154>
2008af0: 31 00 80 55 sethi %hi(0x2015400), %i0
heir = _Thread_Heir;
2008af4: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4
_Thread_Dispatch_disable_level = 1;
2008af8: 82 10 20 01 mov 1, %g1
2008afc: c2 26 23 30 st %g1, [ %i0 + 0x330 ]
_Thread_Dispatch_necessary = false;
2008b00: c0 2e e0 18 clrb [ %i3 + 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 )
2008b04: 80 a7 40 1c cmp %i5, %i4
2008b08: 02 80 00 47 be 2008c24 <_Thread_Dispatch+0x154>
2008b0c: f8 26 e0 0c st %i4, [ %i3 + 0xc ]
2008b10: 35 00 80 55 sethi %hi(0x2015400), %i2
2008b14: 23 00 80 55 sethi %hi(0x2015400), %l1
2008b18: b4 16 a3 e0 or %i2, 0x3e0, %i2
2008b1c: a2 14 63 b8 or %l1, 0x3b8, %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;
2008b20: 27 00 80 55 sethi %hi(0x2015400), %l3
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
2008b24: a0 10 00 1a mov %i2, %l0
#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 );
2008b28: 33 00 80 55 sethi %hi(0x2015400), %i1
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
heir = _Thread_Heir;
_Thread_Dispatch_disable_level = 1;
2008b2c: 10 80 00 38 b 2008c0c <_Thread_Dispatch+0x13c>
2008b30: a4 10 20 01 mov 1, %l2
rtems_ada_self = heir->rtems_ada_self;
#endif
if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE )
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
_ISR_Enable( level );
2008b34: 7f ff e5 0b call 2001f60 <sparc_enable_interrupts>
2008b38: 01 00 00 00 nop
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
2008b3c: 40 00 0d 69 call 200c0e0 <_TOD_Get_uptime>
2008b40: 90 07 bf f0 add %fp, -16, %o0
_Timestamp_Subtract(
2008b44: 90 10 00 10 mov %l0, %o0
2008b48: 92 07 bf f0 add %fp, -16, %o1
2008b4c: 40 00 03 2f call 2009808 <_Timespec_Subtract>
2008b50: 94 07 bf f8 add %fp, -8, %o2
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
2008b54: 90 07 60 84 add %i5, 0x84, %o0
2008b58: 40 00 03 13 call 20097a4 <_Timespec_Add_to>
2008b5c: 92 07 bf f8 add %fp, -8, %o1
_Thread_Time_of_last_context_switch = uptime;
2008b60: c4 07 bf f0 ld [ %fp + -16 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
2008b64: c2 04 40 00 ld [ %l1 ], %g1
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
_Thread_Time_of_last_context_switch = uptime;
2008b68: c4 26 80 00 st %g2, [ %i2 ]
2008b6c: c4 07 bf f4 ld [ %fp + -12 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
2008b70: 80 a0 60 00 cmp %g1, 0
2008b74: 02 80 00 06 be 2008b8c <_Thread_Dispatch+0xbc> <== NEVER TAKEN
2008b78: c4 26 a0 04 st %g2, [ %i2 + 4 ]
executing->libc_reent = *_Thread_libc_reent;
2008b7c: c4 00 40 00 ld [ %g1 ], %g2
2008b80: c4 27 61 54 st %g2, [ %i5 + 0x154 ]
*_Thread_libc_reent = heir->libc_reent;
2008b84: c4 07 21 54 ld [ %i4 + 0x154 ], %g2
2008b88: c4 20 40 00 st %g2, [ %g1 ]
}
_User_extensions_Thread_switch( executing, heir );
2008b8c: 90 10 00 1d mov %i5, %o0
2008b90: 40 00 03 e2 call 2009b18 <_User_extensions_Thread_switch>
2008b94: 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 );
2008b98: 90 07 60 c8 add %i5, 0xc8, %o0
2008b9c: 40 00 05 2b call 200a048 <_CPU_Context_switch>
2008ba0: 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) &&
2008ba4: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
2008ba8: 80 a0 60 00 cmp %g1, 0
2008bac: 02 80 00 0c be 2008bdc <_Thread_Dispatch+0x10c>
2008bb0: d0 06 63 b4 ld [ %i1 + 0x3b4 ], %o0
2008bb4: 80 a7 40 08 cmp %i5, %o0
2008bb8: 02 80 00 09 be 2008bdc <_Thread_Dispatch+0x10c>
2008bbc: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
2008bc0: 02 80 00 04 be 2008bd0 <_Thread_Dispatch+0x100>
2008bc4: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
2008bc8: 40 00 04 e6 call 2009f60 <_CPU_Context_save_fp>
2008bcc: 90 02 21 50 add %o0, 0x150, %o0
_Context_Restore_fp( &executing->fp_context );
2008bd0: 40 00 05 01 call 2009fd4 <_CPU_Context_restore_fp>
2008bd4: 90 07 61 50 add %i5, 0x150, %o0
_Thread_Allocated_fp = executing;
2008bd8: fa 26 63 b4 st %i5, [ %i1 + 0x3b4 ]
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
2008bdc: 7f ff e4 dd call 2001f50 <sparc_disable_interrupts>
2008be0: fa 06 e0 0c ld [ %i3 + 0xc ], %i5
Thread_Control *heir;
ISR_Level level;
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
2008be4: c2 0e e0 18 ldub [ %i3 + 0x18 ], %g1
2008be8: 80 a0 60 00 cmp %g1, 0
2008bec: 02 80 00 0e be 2008c24 <_Thread_Dispatch+0x154>
2008bf0: 01 00 00 00 nop
heir = _Thread_Heir;
2008bf4: f8 06 e0 10 ld [ %i3 + 0x10 ], %i4
_Thread_Dispatch_disable_level = 1;
2008bf8: e4 26 23 30 st %l2, [ %i0 + 0x330 ]
_Thread_Dispatch_necessary = false;
2008bfc: c0 2e e0 18 clrb [ %i3 + 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 )
2008c00: 80 a7 00 1d cmp %i4, %i5
2008c04: 02 80 00 08 be 2008c24 <_Thread_Dispatch+0x154> <== NEVER TAKEN
2008c08: f8 26 e0 0c st %i4, [ %i3 + 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 )
2008c0c: c2 07 20 7c ld [ %i4 + 0x7c ], %g1
2008c10: 80 a0 60 01 cmp %g1, 1
2008c14: 12 bf ff c8 bne 2008b34 <_Thread_Dispatch+0x64>
2008c18: c2 04 e2 94 ld [ %l3 + 0x294 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
2008c1c: 10 bf ff c6 b 2008b34 <_Thread_Dispatch+0x64>
2008c20: c2 27 20 78 st %g1, [ %i4 + 0x78 ]
_ISR_Disable( level );
}
post_switch:
_Thread_Dispatch_disable_level = 0;
2008c24: c0 26 23 30 clr [ %i0 + 0x330 ]
_ISR_Enable( level );
2008c28: 7f ff e4 ce call 2001f60 <sparc_enable_interrupts>
2008c2c: 01 00 00 00 nop
_API_extensions_Run_postswitch();
2008c30: 7f ff f8 1a call 2006c98 <_API_extensions_Run_postswitch>
2008c34: 01 00 00 00 nop
}
2008c38: 81 c7 e0 08 ret
2008c3c: 81 e8 00 00 restore
0200dfc8 <_Thread_Handler>:
*
* Output parameters: NONE
*/
void _Thread_Handler( void )
{
200dfc8: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static char doneConstructors;
char doneCons;
#endif
executing = _Thread_Executing;
200dfcc: 03 00 80 56 sethi %hi(0x2015800), %g1
200dfd0: fa 00 61 68 ld [ %g1 + 0x168 ], %i5 ! 2015968 <_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();
200dfd4: 3f 00 80 37 sethi %hi(0x200dc00), %i7
200dfd8: be 17 e3 c8 or %i7, 0x3c8, %i7 ! 200dfc8 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
200dfdc: d0 07 60 ac ld [ %i5 + 0xac ], %o0
_ISR_Set_level(level);
200dfe0: 7f ff cf e0 call 2001f60 <sparc_enable_interrupts>
200dfe4: 91 2a 20 08 sll %o0, 8, %o0
doneConstructors = 1;
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200dfe8: c4 07 61 50 ld [ %i5 + 0x150 ], %g2
level = executing->Start.isr_level;
_ISR_Set_level(level);
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200dfec: 03 00 80 54 sethi %hi(0x2015000), %g1
doneConstructors = 1;
200dff0: 86 10 20 01 mov 1, %g3
level = executing->Start.isr_level;
_ISR_Set_level(level);
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200dff4: f6 08 63 f0 ldub [ %g1 + 0x3f0 ], %i3
doneConstructors = 1;
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200dff8: 80 a0 a0 00 cmp %g2, 0
200dffc: 02 80 00 0c be 200e02c <_Thread_Handler+0x64>
200e000: c6 28 63 f0 stb %g3, [ %g1 + 0x3f0 ]
#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 );
200e004: 39 00 80 55 sethi %hi(0x2015400), %i4
200e008: d0 07 23 b4 ld [ %i4 + 0x3b4 ], %o0 ! 20157b4 <_Thread_Allocated_fp>
200e00c: 80 a7 40 08 cmp %i5, %o0
200e010: 02 80 00 07 be 200e02c <_Thread_Handler+0x64>
200e014: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200e018: 22 80 00 05 be,a 200e02c <_Thread_Handler+0x64>
200e01c: fa 27 23 b4 st %i5, [ %i4 + 0x3b4 ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200e020: 7f ff ef d0 call 2009f60 <_CPU_Context_save_fp>
200e024: 90 02 21 50 add %o0, 0x150, %o0
_Thread_Allocated_fp = executing;
200e028: fa 27 23 b4 st %i5, [ %i4 + 0x3b4 ]
/*
* 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 );
200e02c: 7f ff ee 39 call 2009910 <_User_extensions_Thread_begin>
200e030: 90 10 00 1d mov %i5, %o0
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
200e034: 7f ff eb 03 call 2008c40 <_Thread_Enable_dispatch>
200e038: b7 2e e0 18 sll %i3, 0x18, %i3
/*
* _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) */ {
200e03c: 80 a6 e0 00 cmp %i3, 0
200e040: 02 80 00 0c be 200e070 <_Thread_Handler+0xa8>
200e044: 01 00 00 00 nop
INIT_NAME ();
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200e048: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
200e04c: 80 a0 60 00 cmp %g1, 0
200e050: 22 80 00 0c be,a 200e080 <_Thread_Handler+0xb8> <== ALWAYS TAKEN
200e054: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
* was placed in return_argument. This assumed that if it returned
* anything (which is not supporting in all APIs), then it would be
* able to fit in a (void *).
*/
_User_extensions_Thread_exitted( executing );
200e058: 7f ff ee 42 call 2009960 <_User_extensions_Thread_exitted>
200e05c: 90 10 00 1d mov %i5, %o0
_Internal_error_Occurred(
200e060: 90 10 20 00 clr %o0
200e064: 92 10 20 01 mov 1, %o1
200e068: 7f ff e5 d2 call 20077b0 <_Internal_error_Occurred>
200e06c: 94 10 20 05 mov 5, %o2
* _init could be a weak symbol and we SHOULD test it but it isn't
* in any configuration I know of and it generates a warning on every
* RTEMS target configuration. --joel (12 May 2007)
*/
if (!doneCons) /* && (volatile void *)_init) */ {
INIT_NAME ();
200e070: 40 00 1a 72 call 2014a38 <_init>
200e074: 01 00 00 00 nop
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200e078: 10 bf ff f5 b 200e04c <_Thread_Handler+0x84>
200e07c: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
200e080: 9f c0 40 00 call %g1
200e084: d0 07 60 9c ld [ %i5 + 0x9c ], %o0
INIT_NAME ();
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
200e088: 10 bf ff f4 b 200e058 <_Thread_Handler+0x90>
200e08c: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
02008d1c <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
2008d1c: 9d e3 bf a0 save %sp, -96, %sp
2008d20: c2 07 a0 6c ld [ %fp + 0x6c ], %g1
2008d24: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2
2008d28: 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;
2008d2c: c0 26 61 58 clr [ %i1 + 0x158 ]
2008d30: c0 26 61 5c clr [ %i1 + 0x15c ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
2008d34: 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 );
2008d38: 90 10 00 19 mov %i1, %o0
2008d3c: 40 00 02 2f call 20095f8 <_Thread_Stack_Allocate>
2008d40: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
2008d44: 80 a2 00 1b cmp %o0, %i3
2008d48: 0a 80 00 4b bcs 2008e74 <_Thread_Initialize+0x158>
2008d4c: 80 a2 20 00 cmp %o0, 0
2008d50: 02 80 00 49 be 2008e74 <_Thread_Initialize+0x158> <== NEVER TAKEN
2008d54: 80 a7 20 00 cmp %i4, 0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
2008d58: c2 06 60 c0 ld [ %i1 + 0xc0 ], %g1
the_stack->size = size;
2008d5c: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ]
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
2008d60: 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 ) {
2008d64: 12 80 00 48 bne 2008e84 <_Thread_Initialize+0x168>
2008d68: b6 10 20 00 clr %i3
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2008d6c: 23 00 80 55 sethi %hi(0x2015400), %l1
2008d70: c2 04 63 c4 ld [ %l1 + 0x3c4 ], %g1 ! 20157c4 <_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;
2008d74: f6 26 61 50 st %i3, [ %i1 + 0x150 ]
the_thread->Start.fp_context = fp_area;
2008d78: f6 26 60 bc st %i3, [ %i1 + 0xbc ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2008d7c: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
2008d80: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
2008d84: c0 26 60 68 clr [ %i1 + 0x68 ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2008d88: 80 a0 60 00 cmp %g1, 0
2008d8c: 12 80 00 46 bne 2008ea4 <_Thread_Initialize+0x188>
2008d90: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2008d94: c0 26 61 60 clr [ %i1 + 0x160 ]
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
2008d98: b8 10 20 00 clr %i4
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
2008d9c: c4 07 a0 60 ld [ %fp + 0x60 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
2008da0: 03 00 80 52 sethi %hi(0x2014800), %g1
2008da4: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ]
the_thread->Start.budget_callout = budget_callout;
2008da8: c4 07 a0 64 ld [ %fp + 0x64 ], %g2
2008dac: c2 00 63 7c ld [ %g1 + 0x37c ], %g1
2008db0: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2008db4: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
2008db8: f4 2e 60 a0 stb %i2, [ %i1 + 0xa0 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2008dbc: c4 26 60 ac st %g2, [ %i1 + 0xac ]
the_thread->current_state = STATES_DORMANT;
2008dc0: 84 10 20 01 mov 1, %g2
the_thread->Wait.queue = NULL;
2008dc4: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
2008dc8: c4 26 60 10 st %g2, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
2008dcc: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
2008dd0: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
2008dd4: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ]
2008dd8: 9f c0 40 00 call %g1
2008ddc: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
2008de0: b4 92 20 00 orcc %o0, 0, %i2
2008de4: 22 80 00 13 be,a 2008e30 <_Thread_Initialize+0x114>
2008de8: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
2008dec: 90 10 00 19 mov %i1, %o0
2008df0: 40 00 01 d9 call 2009554 <_Thread_Set_priority>
2008df4: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008df8: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2008dfc: 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 );
2008e00: c0 26 60 84 clr [ %i1 + 0x84 ]
2008e04: c0 26 60 88 clr [ %i1 + 0x88 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008e08: 83 28 60 02 sll %g1, 2, %g1
2008e0c: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2008e10: 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 );
2008e14: 90 10 00 19 mov %i1, %o0
2008e18: 40 00 02 f9 call 20099fc <_User_extensions_Thread_create>
2008e1c: b0 10 20 01 mov 1, %i0
if ( extension_status )
2008e20: 80 8a 20 ff btst 0xff, %o0
2008e24: 32 80 00 12 bne,a 2008e6c <_Thread_Initialize+0x150>
2008e28: b0 0e 20 01 and %i0, 1, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
2008e2c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
2008e30: 40 00 04 37 call 2009f0c <_Workspace_Free>
2008e34: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
2008e38: 40 00 04 35 call 2009f0c <_Workspace_Free>
2008e3c: d0 06 61 58 ld [ %i1 + 0x158 ], %o0
2008e40: 40 00 04 33 call 2009f0c <_Workspace_Free>
2008e44: d0 06 61 5c ld [ %i1 + 0x15c ], %o0
_Workspace_Free( extensions_area );
2008e48: 40 00 04 31 call 2009f0c <_Workspace_Free>
2008e4c: 90 10 00 1c mov %i4, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
2008e50: 40 00 04 2f call 2009f0c <_Workspace_Free>
2008e54: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
2008e58: 40 00 04 2d call 2009f0c <_Workspace_Free>
2008e5c: 90 10 00 1a mov %i2, %o0
_Thread_Stack_Free( the_thread );
2008e60: 40 00 02 01 call 2009664 <_Thread_Stack_Free>
2008e64: 90 10 00 19 mov %i1, %o0
return false;
}
2008e68: b0 0e 20 01 and %i0, 1, %i0
2008e6c: 81 c7 e0 08 ret
2008e70: 81 e8 00 00 restore
* Allocate and Initialize the stack for this thread.
*/
#if !defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API)
actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size );
if ( !actual_stack_size || actual_stack_size < stack_size )
return false; /* stack allocation failed */
2008e74: b0 10 20 00 clr %i0
_Workspace_Free( sched );
_Thread_Stack_Free( the_thread );
return false;
}
2008e78: b0 0e 20 01 and %i0, 1, %i0
2008e7c: 81 c7 e0 08 ret
2008e80: 81 e8 00 00 restore
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE );
2008e84: 40 00 04 1a call 2009eec <_Workspace_Allocate>
2008e88: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
2008e8c: b6 92 20 00 orcc %o0, 0, %i3
2008e90: 32 bf ff b8 bne,a 2008d70 <_Thread_Initialize+0x54>
2008e94: 23 00 80 55 sethi %hi(0x2015400), %l1
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
2008e98: b8 10 20 00 clr %i4
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;
2008e9c: 10 bf ff e4 b 2008e2c <_Thread_Initialize+0x110>
2008ea0: b4 10 20 00 clr %i2
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
2008ea4: 82 00 60 01 inc %g1
2008ea8: 40 00 04 11 call 2009eec <_Workspace_Allocate>
2008eac: 91 28 60 02 sll %g1, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
2008eb0: b8 92 20 00 orcc %o0, 0, %i4
2008eb4: 02 80 00 10 be 2008ef4 <_Thread_Initialize+0x1d8>
2008eb8: 86 10 00 1c mov %i4, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2008ebc: f8 26 61 60 st %i4, [ %i1 + 0x160 ]
2008ec0: c8 04 63 c4 ld [ %l1 + 0x3c4 ], %g4
* 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++ )
2008ec4: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2008ec8: 10 80 00 03 b 2008ed4 <_Thread_Initialize+0x1b8>
2008ecc: 82 10 20 00 clr %g1
2008ed0: c6 06 61 60 ld [ %i1 + 0x160 ], %g3
* so they cannot rely on the thread create user extension
* call.
*/
if ( the_thread->extensions ) {
for ( i = 0; i <= _Thread_Maximum_extensions ; i++ )
the_thread->extensions[i] = NULL;
2008ed4: 85 28 a0 02 sll %g2, 2, %g2
2008ed8: c0 20 c0 02 clr [ %g3 + %g2 ]
* create the extension long after tasks have been created
* so they cannot rely on the thread create user extension
* call.
*/
if ( the_thread->extensions ) {
for ( i = 0; i <= _Thread_Maximum_extensions ; i++ )
2008edc: 82 00 60 01 inc %g1
2008ee0: 80 a0 40 04 cmp %g1, %g4
2008ee4: 08 bf ff fb bleu 2008ed0 <_Thread_Initialize+0x1b4>
2008ee8: 84 10 00 01 mov %g1, %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
2008eec: 10 bf ff ad b 2008da0 <_Thread_Initialize+0x84>
2008ef0: c4 07 a0 60 ld [ %fp + 0x60 ], %g2
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;
2008ef4: 10 bf ff ce b 2008e2c <_Thread_Initialize+0x110>
2008ef8: b4 10 20 00 clr %i2
02009494 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
2009494: 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 )
2009498: 80 a6 20 00 cmp %i0, 0
200949c: 02 80 00 13 be 20094e8 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
20094a0: 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 ) {
20094a4: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
20094a8: 80 a7 20 01 cmp %i4, 1
20094ac: 02 80 00 04 be 20094bc <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
20094b0: 01 00 00 00 nop
20094b4: 81 c7 e0 08 ret <== NOT EXECUTED
20094b8: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
20094bc: 7f ff e2 a5 call 2001f50 <sparc_disable_interrupts>
20094c0: 01 00 00 00 nop
20094c4: ba 10 00 08 mov %o0, %i5
20094c8: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
20094cc: 03 00 00 ef sethi %hi(0x3bc00), %g1
20094d0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
20094d4: 80 88 80 01 btst %g2, %g1
20094d8: 12 80 00 06 bne 20094f0 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
20094dc: 90 10 00 18 mov %i0, %o0
_Thread_queue_Enter_critical_section( tq );
_Thread_queue_Extract_priority_helper( tq, the_thread, true );
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
}
_ISR_Enable( level );
20094e0: 7f ff e2 a0 call 2001f60 <sparc_enable_interrupts>
20094e4: 90 10 00 1d mov %i5, %o0
20094e8: 81 c7 e0 08 ret
20094ec: 81 e8 00 00 restore
ISR_Level level_ignored;
_ISR_Disable( level );
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
_Thread_queue_Enter_critical_section( tq );
_Thread_queue_Extract_priority_helper( tq, the_thread, true );
20094f0: 92 10 00 19 mov %i1, %o1
20094f4: 94 10 20 01 mov 1, %o2
20094f8: 40 00 0c 7d call 200c6ec <_Thread_queue_Extract_priority_helper>
20094fc: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
2009500: 90 10 00 18 mov %i0, %o0
2009504: 92 10 00 19 mov %i1, %o1
2009508: 7f ff ff 37 call 20091e4 <_Thread_queue_Enqueue_priority>
200950c: 94 07 bf fc add %fp, -4, %o2
2009510: 30 bf ff f4 b,a 20094e0 <_Thread_queue_Requeue+0x4c>
02009514 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
2009514: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2009518: 90 10 00 18 mov %i0, %o0
200951c: 7f ff fd d5 call 2008c70 <_Thread_Get>
2009520: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009524: c2 07 bf fc ld [ %fp + -4 ], %g1
2009528: 80 a0 60 00 cmp %g1, 0
200952c: 12 80 00 08 bne 200954c <_Thread_queue_Timeout+0x38> <== NEVER TAKEN
2009530: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
2009534: 40 00 0c a7 call 200c7d0 <_Thread_queue_Process_timeout>
2009538: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE void _Thread_Unnest_dispatch( void )
{
RTEMS_COMPILER_MEMORY_BARRIER();
_Thread_Dispatch_disable_level -= 1;
200953c: 03 00 80 55 sethi %hi(0x2015400), %g1
2009540: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2015730 <_Thread_Dispatch_disable_level>
2009544: 84 00 bf ff add %g2, -1, %g2
2009548: c4 20 63 30 st %g2, [ %g1 + 0x330 ]
200954c: 81 c7 e0 08 ret
2009550: 81 e8 00 00 restore
02016520 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
2016520: 9d e3 bf 88 save %sp, -120, %sp
2016524: 23 00 80 f0 sethi %hi(0x203c000), %l1
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2016528: a6 07 bf e8 add %fp, -24, %l3
201652c: b2 07 bf ec add %fp, -20, %i1
2016530: b6 07 bf f4 add %fp, -12, %i3
2016534: a4 07 bf f8 add %fp, -8, %l2
2016538: 21 00 80 f0 sethi %hi(0x203c000), %l0
201653c: 29 00 80 f0 sethi %hi(0x203c000), %l4
2016540: f2 27 bf e8 st %i1, [ %fp + -24 ]
head->previous = NULL;
2016544: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
2016548: e6 27 bf f0 st %l3, [ %fp + -16 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
201654c: e4 27 bf f4 st %l2, [ %fp + -12 ]
head->previous = NULL;
2016550: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
2016554: f6 27 bf fc st %i3, [ %fp + -4 ]
2016558: a2 14 63 c4 or %l1, 0x3c4, %l1
201655c: b8 06 20 30 add %i0, 0x30, %i4
2016560: a0 14 23 3c or %l0, 0x33c, %l0
2016564: b4 06 20 68 add %i0, 0x68, %i2
2016568: a8 15 22 b0 or %l4, 0x2b0, %l4
201656c: ae 06 20 08 add %i0, 8, %l7
2016570: ac 06 20 40 add %i0, 0x40, %l6
_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;
2016574: aa 10 20 01 mov 1, %l5
{
/*
* 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;
2016578: e6 26 20 78 st %l3, [ %i0 + 0x78 ]
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
201657c: c2 04 40 00 ld [ %l1 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2016580: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016584: 94 10 00 1b mov %i3, %o2
2016588: 90 10 00 1c mov %i4, %o0
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
201658c: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016590: 40 00 12 a6 call 201b028 <_Watchdog_Adjust_to_chain>
2016594: 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;
2016598: 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();
201659c: fa 04 00 00 ld [ %l0 ], %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 ) {
20165a0: 80 a7 40 0a cmp %i5, %o2
20165a4: 18 80 00 2e bgu 201665c <_Timer_server_Body+0x13c>
20165a8: 92 27 40 0a sub %i5, %o2, %o1
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
} else if ( snapshot < last_snapshot ) {
20165ac: 80 a7 40 0a cmp %i5, %o2
20165b0: 0a 80 00 2f bcs 201666c <_Timer_server_Body+0x14c>
20165b4: 90 10 00 1a mov %i2, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
20165b8: 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 );
20165bc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20165c0: 40 00 02 fb call 20171ac <_Chain_Get>
20165c4: 01 00 00 00 nop
if ( timer == NULL ) {
20165c8: 92 92 20 00 orcc %o0, 0, %o1
20165cc: 02 80 00 10 be 201660c <_Timer_server_Body+0xec>
20165d0: 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 ) {
20165d4: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
20165d8: 80 a0 60 01 cmp %g1, 1
20165dc: 02 80 00 28 be 201667c <_Timer_server_Body+0x15c>
20165e0: 80 a0 60 03 cmp %g1, 3
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
20165e4: 12 bf ff f6 bne 20165bc <_Timer_server_Body+0x9c> <== NEVER TAKEN
20165e8: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20165ec: 40 00 12 c1 call 201b0f0 <_Watchdog_Insert>
20165f0: 90 10 00 1a mov %i2, %o0
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
20165f4: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20165f8: 40 00 02 ed call 20171ac <_Chain_Get>
20165fc: 01 00 00 00 nop
if ( timer == NULL ) {
2016600: 92 92 20 00 orcc %o0, 0, %o1
2016604: 32 bf ff f5 bne,a 20165d8 <_Timer_server_Body+0xb8> <== NEVER TAKEN
2016608: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 <== NOT EXECUTED
* of zero it will be processed in the next iteration of the timer server
* body loop.
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
201660c: 7f ff e2 33 call 200eed8 <sparc_disable_interrupts>
2016610: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
2016614: c2 07 bf e8 ld [ %fp + -24 ], %g1
2016618: 80 a0 40 19 cmp %g1, %i1
201661c: 02 80 00 1c be 201668c <_Timer_server_Body+0x16c> <== ALWAYS TAKEN
2016620: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
2016624: 7f ff e2 31 call 200eee8 <sparc_enable_interrupts> <== NOT EXECUTED
2016628: 01 00 00 00 nop <== NOT EXECUTED
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
201662c: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2016630: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016634: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED
2016638: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
201663c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016640: 40 00 12 7a call 201b028 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED
2016644: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
2016648: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED
static void _Timer_server_Process_tod_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
201664c: fa 04 00 00 ld [ %l0 ], %i5 <== NOT EXECUTED
/*
* Process the seconds chain. Start by checking that the Time
* of Day (TOD) has not been set backwards. If it has then
* we want to adjust the watchdogs->Chain to indicate this.
*/
if ( snapshot > last_snapshot ) {
2016650: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED
2016654: 08 bf ff d7 bleu 20165b0 <_Timer_server_Body+0x90> <== NOT EXECUTED
2016658: 92 27 40 0a sub %i5, %o2, %o1 <== NOT EXECUTED
/*
* This path is for normal forward movement and cases where the
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
201665c: 90 10 00 1a mov %i2, %o0
2016660: 40 00 12 72 call 201b028 <_Watchdog_Adjust_to_chain>
2016664: 94 10 00 1b mov %i3, %o2
2016668: 30 bf ff d4 b,a 20165b8 <_Timer_server_Body+0x98>
/*
* The current TOD is before the last TOD which indicates that
* TOD has been set backwards.
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
201666c: 92 10 20 01 mov 1, %o1
2016670: 40 00 12 3f call 201af6c <_Watchdog_Adjust>
2016674: 94 22 80 1d sub %o2, %i5, %o2
2016678: 30 bf ff d0 b,a 20165b8 <_Timer_server_Body+0x98>
Timer_server_Control *ts,
Timer_Control *timer
)
{
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
201667c: 90 10 00 1c mov %i4, %o0
2016680: 40 00 12 9c call 201b0f0 <_Watchdog_Insert>
2016684: 92 02 60 10 add %o1, 0x10, %o1
2016688: 30 bf ff cd b,a 20165bc <_Timer_server_Body+0x9c>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
201668c: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
2016690: 7f ff e2 16 call 200eee8 <sparc_enable_interrupts>
2016694: 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 ) ) {
2016698: c2 07 bf f4 ld [ %fp + -12 ], %g1
201669c: 80 a0 40 12 cmp %g1, %l2
20166a0: 12 80 00 0c bne 20166d0 <_Timer_server_Body+0x1b0>
20166a4: 01 00 00 00 nop
20166a8: 30 80 00 13 b,a 20166f4 <_Timer_server_Body+0x1d4>
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *old_first = head->next;
Chain_Node *new_first = old_first->next;
head->next = new_first;
new_first->previous = head;
20166ac: 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;
20166b0: c2 27 bf f4 st %g1, [ %fp + -12 ]
* service routine may remove a watchdog from the chain.
*/
_ISR_Disable( level );
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
20166b4: c0 27 60 08 clr [ %i5 + 8 ]
_ISR_Enable( level );
20166b8: 7f ff e2 0c call 200eee8 <sparc_enable_interrupts>
20166bc: 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 );
20166c0: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
20166c4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
20166c8: 9f c0 40 00 call %g1
20166cc: d2 07 60 24 ld [ %i5 + 0x24 ], %o1
/*
* It is essential that interrupts are disable here since an interrupt
* service routine may remove a watchdog from the chain.
*/
_ISR_Disable( level );
20166d0: 7f ff e2 02 call 200eed8 <sparc_disable_interrupts>
20166d4: 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;
20166d8: 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))
20166dc: 80 a7 40 12 cmp %i5, %l2
20166e0: 32 bf ff f3 bne,a 20166ac <_Timer_server_Body+0x18c>
20166e4: c2 07 40 00 ld [ %i5 ], %g1
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
_ISR_Enable( level );
} else {
_ISR_Enable( level );
20166e8: 7f ff e2 00 call 200eee8 <sparc_enable_interrupts>
20166ec: 01 00 00 00 nop
20166f0: 30 bf ff a2 b,a 2016578 <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
20166f4: c0 2e 20 7c clrb [ %i0 + 0x7c ]
20166f8: c2 05 00 00 ld [ %l4 ], %g1
20166fc: 82 00 60 01 inc %g1
2016700: c2 25 00 00 st %g1, [ %l4 ]
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
2016704: d0 06 00 00 ld [ %i0 ], %o0
2016708: 40 00 10 65 call 201a89c <_Thread_Set_state>
201670c: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
2016710: 7f ff ff 5c call 2016480 <_Timer_server_Reset_interval_system_watchdog>
2016714: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
2016718: 7f ff ff 6e call 20164d0 <_Timer_server_Reset_tod_system_watchdog>
201671c: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
2016720: 40 00 0d ee call 2019ed8 <_Thread_Enable_dispatch>
2016724: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016728: 90 10 00 17 mov %l7, %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;
201672c: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ]
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016730: 40 00 12 d7 call 201b28c <_Watchdog_Remove>
2016734: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
2016738: 40 00 12 d5 call 201b28c <_Watchdog_Remove>
201673c: 90 10 00 16 mov %l6, %o0
2016740: 30 bf ff 8e b,a 2016578 <_Timer_server_Body+0x58>
02016744 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
2016744: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
2016748: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
201674c: 80 a0 60 00 cmp %g1, 0
2016750: 02 80 00 05 be 2016764 <_Timer_server_Schedule_operation_method+0x20>
2016754: ba 10 00 19 mov %i1, %i5
* 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 );
2016758: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
201675c: 40 00 02 80 call 201715c <_Chain_Append>
2016760: 81 e8 00 00 restore
2016764: 03 00 80 f0 sethi %hi(0x203c000), %g1
2016768: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 203c2b0 <_Thread_Dispatch_disable_level>
201676c: 84 00 a0 01 inc %g2
2016770: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ]
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
2016774: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
2016778: 80 a0 60 01 cmp %g1, 1
201677c: 02 80 00 28 be 201681c <_Timer_server_Schedule_operation_method+0xd8>
2016780: 80 a0 60 03 cmp %g1, 3
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
if ( !ts->active ) {
_Timer_server_Reset_interval_system_watchdog( ts );
}
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
2016784: 02 80 00 04 be 2016794 <_Timer_server_Schedule_operation_method+0x50>
2016788: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
201678c: 40 00 0d d3 call 2019ed8 <_Thread_Enable_dispatch>
2016790: 81 e8 00 00 restore
} else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) {
/*
* We have to advance the last known seconds value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
2016794: 7f ff e1 d1 call 200eed8 <sparc_disable_interrupts>
2016798: 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;
201679c: c4 06 20 68 ld [ %i0 + 0x68 ], %g2
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
20167a0: c6 06 20 74 ld [ %i0 + 0x74 ], %g3
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
20167a4: 88 06 20 6c add %i0, 0x6c, %g4
/*
* We have to advance the last known seconds value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
20167a8: 03 00 80 f0 sethi %hi(0x203c000), %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
20167ac: 80 a0 80 04 cmp %g2, %g4
20167b0: 02 80 00 0d be 20167e4 <_Timer_server_Schedule_operation_method+0xa0>
20167b4: c2 00 63 3c ld [ %g1 + 0x33c ], %g1
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
20167b8: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
if ( snapshot > last_snapshot ) {
20167bc: 80 a0 40 03 cmp %g1, %g3
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
20167c0: 88 03 c0 03 add %o7, %g3, %g4
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
if ( snapshot > last_snapshot ) {
20167c4: 08 80 00 07 bleu 20167e0 <_Timer_server_Schedule_operation_method+0x9c>
20167c8: 88 21 00 01 sub %g4, %g1, %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
20167cc: 86 20 40 03 sub %g1, %g3, %g3
if (delta_interval > delta) {
20167d0: 80 a3 c0 03 cmp %o7, %g3
20167d4: 08 80 00 03 bleu 20167e0 <_Timer_server_Schedule_operation_method+0x9c><== NEVER TAKEN
20167d8: 88 10 20 00 clr %g4
delta_interval -= delta;
20167dc: 88 23 c0 03 sub %o7, %g3, %g4
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
delta_interval += delta;
}
first_watchdog->delta_interval = delta_interval;
20167e0: c8 20 a0 10 st %g4, [ %g2 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
20167e4: c2 26 20 74 st %g1, [ %i0 + 0x74 ]
_ISR_Enable( level );
20167e8: 7f ff e1 c0 call 200eee8 <sparc_enable_interrupts>
20167ec: 01 00 00 00 nop
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20167f0: 90 06 20 68 add %i0, 0x68, %o0
20167f4: 40 00 12 3f call 201b0f0 <_Watchdog_Insert>
20167f8: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
20167fc: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2016800: 80 a0 60 00 cmp %g1, 0
2016804: 12 bf ff e2 bne 201678c <_Timer_server_Schedule_operation_method+0x48>
2016808: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
201680c: 7f ff ff 31 call 20164d0 <_Timer_server_Reset_tod_system_watchdog>
2016810: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
2016814: 40 00 0d b1 call 2019ed8 <_Thread_Enable_dispatch>
2016818: 81 e8 00 00 restore
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
/*
* We have to advance the last known ticks value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
201681c: 7f ff e1 af call 200eed8 <sparc_disable_interrupts>
2016820: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
2016824: 05 00 80 f0 sethi %hi(0x203c000), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2016828: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
201682c: c4 00 a3 c4 ld [ %g2 + 0x3c4 ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
2016830: 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 );
2016834: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
2016838: 80 a0 40 03 cmp %g1, %g3
201683c: 02 80 00 08 be 201685c <_Timer_server_Schedule_operation_method+0x118>
2016840: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
2016844: de 00 60 10 ld [ %g1 + 0x10 ], %o7
if (delta_interval > delta) {
2016848: 80 a1 00 0f cmp %g4, %o7
201684c: 1a 80 00 03 bcc 2016858 <_Timer_server_Schedule_operation_method+0x114>
2016850: 86 10 20 00 clr %g3
delta_interval -= delta;
2016854: 86 23 c0 04 sub %o7, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
2016858: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
201685c: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
2016860: 7f ff e1 a2 call 200eee8 <sparc_enable_interrupts>
2016864: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
2016868: 90 06 20 30 add %i0, 0x30, %o0
201686c: 40 00 12 21 call 201b0f0 <_Watchdog_Insert>
2016870: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2016874: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2016878: 80 a0 60 00 cmp %g1, 0
201687c: 12 bf ff c4 bne 201678c <_Timer_server_Schedule_operation_method+0x48>
2016880: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
2016884: 7f ff fe ff call 2016480 <_Timer_server_Reset_interval_system_watchdog>
2016888: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
201688c: 40 00 0d 93 call 2019ed8 <_Thread_Enable_dispatch>
2016890: 81 e8 00 00 restore
020097a4 <_Timespec_Add_to>:
uint32_t _Timespec_Add_to(
struct timespec *time,
const struct timespec *add
)
{
20097a4: 9d e3 bf a0 save %sp, -96, %sp
20097a8: 82 10 00 18 mov %i0, %g1
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
20097ac: c6 06 00 00 ld [ %i0 ], %g3
time->tv_nsec += add->tv_nsec;
20097b0: c8 00 60 04 ld [ %g1 + 4 ], %g4
uint32_t _Timespec_Add_to(
struct timespec *time,
const struct timespec *add
)
{
uint32_t seconds = add->tv_sec;
20097b4: f0 06 40 00 ld [ %i1 ], %i0
/* Add the basics */
time->tv_sec += add->tv_sec;
time->tv_nsec += add->tv_nsec;
20097b8: c4 06 60 04 ld [ %i1 + 4 ], %g2
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
20097bc: 86 00 c0 18 add %g3, %i0, %g3
time->tv_nsec += add->tv_nsec;
20097c0: 84 01 00 02 add %g4, %g2, %g2
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
20097c4: c6 20 40 00 st %g3, [ %g1 ]
time->tv_nsec += add->tv_nsec;
/* Now adjust it so nanoseconds is in range */
while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
20097c8: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4
20097cc: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff <RAM_END+0x395ac9ff>
20097d0: 80 a0 80 04 cmp %g2, %g4
20097d4: 08 80 00 0b bleu 2009800 <_Timespec_Add_to+0x5c>
20097d8: c4 20 60 04 st %g2, [ %g1 + 4 ]
time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
20097dc: 1f 31 19 4d sethi %hi(0xc4653400), %o7
20097e0: 9e 13 e2 00 or %o7, 0x200, %o7 ! c4653600 <RAM_END+0xc2253600>
20097e4: 84 00 80 0f add %g2, %o7, %g2
time->tv_sec++;
20097e8: 86 00 e0 01 inc %g3
/* Add the basics */
time->tv_sec += add->tv_sec;
time->tv_nsec += add->tv_nsec;
/* Now adjust it so nanoseconds is in range */
while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
20097ec: 80 a0 80 04 cmp %g2, %g4
20097f0: 18 bf ff fd bgu 20097e4 <_Timespec_Add_to+0x40> <== NEVER TAKEN
20097f4: b0 06 20 01 inc %i0
20097f8: c4 20 60 04 st %g2, [ %g1 + 4 ]
20097fc: c6 20 40 00 st %g3, [ %g1 ]
time->tv_sec++;
seconds++;
}
return seconds;
}
2009800: 81 c7 e0 08 ret
2009804: 81 e8 00 00 restore
020099ac <_User_extensions_Fatal>:
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
20099ac: 9d e3 bf a0 save %sp, -96, %sp
20099b0: 39 00 80 56 sethi %hi(0x2015800), %i4
20099b4: b8 17 21 18 or %i4, 0x118, %i4 ! 2015918 <_User_extensions_List>
20099b8: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
20099bc: 80 a7 40 1c cmp %i5, %i4
20099c0: 02 80 00 0d be 20099f4 <_User_extensions_Fatal+0x48> <== NEVER TAKEN
20099c4: 01 00 00 00 nop
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.fatal != NULL )
20099c8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
20099cc: 80 a0 60 00 cmp %g1, 0
20099d0: 02 80 00 05 be 20099e4 <_User_extensions_Fatal+0x38>
20099d4: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
20099d8: 92 10 00 19 mov %i1, %o1
20099dc: 9f c0 40 00 call %g1
20099e0: 94 10 00 1a mov %i2, %o2
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
20099e4: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
20099e8: 80 a7 40 1c cmp %i5, %i4
20099ec: 32 bf ff f8 bne,a 20099cc <_User_extensions_Fatal+0x20>
20099f0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
20099f4: 81 c7 e0 08 ret
20099f8: 81 e8 00 00 restore
02009858 <_User_extensions_Handler_initialization>:
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _User_extensions_Handler_initialization(void)
{
2009858: 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;
200985c: 07 00 80 52 sethi %hi(0x2014800), %g3
2009860: 86 10 e2 7c or %g3, 0x27c, %g3 ! 2014a7c <Configuration>
initial_extensions = Configuration.User_extension_table;
2009864: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3
2009868: 3b 00 80 56 sethi %hi(0x2015800), %i5
200986c: 09 00 80 55 sethi %hi(0x2015400), %g4
2009870: 84 17 61 18 or %i5, 0x118, %g2
2009874: 82 11 23 34 or %g4, 0x334, %g1
2009878: b4 00 a0 04 add %g2, 4, %i2
200987c: b8 00 60 04 add %g1, 4, %i4
2009880: f4 27 61 18 st %i2, [ %i5 + 0x118 ]
head->previous = NULL;
2009884: c0 20 a0 04 clr [ %g2 + 4 ]
tail->previous = head;
2009888: c4 20 a0 08 st %g2, [ %g2 + 8 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200988c: f8 21 23 34 st %i4, [ %g4 + 0x334 ]
head->previous = NULL;
2009890: c0 20 60 04 clr [ %g1 + 4 ]
tail->previous = head;
2009894: c2 20 60 08 st %g1, [ %g1 + 8 ]
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
2009898: 80 a6 e0 00 cmp %i3, 0
200989c: 02 80 00 1b be 2009908 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
20098a0: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2
extension = (User_extensions_Control *)
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
20098a4: 83 2e a0 02 sll %i2, 2, %g1
20098a8: b9 2e a0 04 sll %i2, 4, %i4
20098ac: b8 27 00 01 sub %i4, %g1, %i4
20098b0: b8 07 00 1a add %i4, %i2, %i4
20098b4: b9 2f 20 02 sll %i4, 2, %i4
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
20098b8: 40 00 01 9b call 2009f24 <_Workspace_Allocate_or_fatal_error>
20098bc: 90 10 00 1c mov %i4, %o0
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
20098c0: 92 10 20 00 clr %o1
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
20098c4: ba 10 00 08 mov %o0, %i5
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
20098c8: 40 00 14 ce call 200ec00 <memset>
20098cc: 94 10 00 1c mov %i4, %o2
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
20098d0: 80 a6 a0 00 cmp %i2, 0
20098d4: 02 80 00 0d be 2009908 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
20098d8: b8 10 20 00 clr %i4
RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table(
User_extensions_Control *extension,
const User_extensions_Table *extension_table
)
{
extension->Callouts = *extension_table;
20098dc: 92 10 00 1b mov %i3, %o1
20098e0: 94 10 20 20 mov 0x20, %o2
20098e4: 40 00 14 8b call 200eb10 <memcpy>
20098e8: 90 07 60 14 add %i5, 0x14, %o0
_User_extensions_Add_set( extension );
20098ec: 40 00 0b dc call 200c85c <_User_extensions_Add_set>
20098f0: 90 10 00 1d mov %i5, %o0
20098f4: b8 07 20 01 inc %i4
_User_extensions_Add_set_with_table (extension, &initial_extensions[i]);
extension++;
20098f8: ba 07 60 34 add %i5, 0x34, %i5
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
20098fc: 80 a7 00 1a cmp %i4, %i2
2009900: 12 bf ff f7 bne 20098dc <_User_extensions_Handler_initialization+0x84>
2009904: b6 06 e0 20 add %i3, 0x20, %i3
2009908: 81 c7 e0 08 ret
200990c: 81 e8 00 00 restore
02009910 <_User_extensions_Thread_begin>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_begin (
Thread_Control *executing
)
{
2009910: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009914: 39 00 80 56 sethi %hi(0x2015800), %i4
2009918: fa 07 21 18 ld [ %i4 + 0x118 ], %i5 ! 2015918 <_User_extensions_List>
200991c: b8 17 21 18 or %i4, 0x118, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
2009920: b8 07 20 04 add %i4, 4, %i4
2009924: 80 a7 40 1c cmp %i5, %i4
2009928: 02 80 00 0c be 2009958 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN
200992c: 01 00 00 00 nop
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_begin != NULL )
2009930: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
2009934: 80 a0 60 00 cmp %g1, 0
2009938: 02 80 00 04 be 2009948 <_User_extensions_Thread_begin+0x38>
200993c: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_begin)( executing );
2009940: 9f c0 40 00 call %g1
2009944: 01 00 00 00 nop
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
2009948: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200994c: 80 a7 40 1c cmp %i5, %i4
2009950: 32 bf ff f9 bne,a 2009934 <_User_extensions_Thread_begin+0x24>
2009954: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
2009958: 81 c7 e0 08 ret
200995c: 81 e8 00 00 restore
020099fc <_User_extensions_Thread_create>:
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
20099fc: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009a00: 39 00 80 56 sethi %hi(0x2015800), %i4
2009a04: fa 07 21 18 ld [ %i4 + 0x118 ], %i5 ! 2015918 <_User_extensions_List>
2009a08: b8 17 21 18 or %i4, 0x118, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
2009a0c: b8 07 20 04 add %i4, 4, %i4
2009a10: 80 a7 40 1c cmp %i5, %i4
2009a14: 02 80 00 12 be 2009a5c <_User_extensions_Thread_create+0x60><== NEVER TAKEN
2009a18: 82 10 20 01 mov 1, %g1
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
status = (*the_extension->Callouts.thread_create)(
2009a1c: 37 00 80 56 sethi %hi(0x2015800), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
2009a20: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2009a24: 80 a0 60 00 cmp %g1, 0
2009a28: 02 80 00 08 be 2009a48 <_User_extensions_Thread_create+0x4c>
2009a2c: 84 16 e1 5c or %i3, 0x15c, %g2
status = (*the_extension->Callouts.thread_create)(
2009a30: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
2009a34: 9f c0 40 00 call %g1
2009a38: 92 10 00 18 mov %i0, %o1
_Thread_Executing,
the_thread
);
if ( !status )
2009a3c: 80 8a 20 ff btst 0xff, %o0
2009a40: 02 80 00 0a be 2009a68 <_User_extensions_Thread_create+0x6c>
2009a44: 82 10 20 00 clr %g1
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
2009a48: fa 07 40 00 ld [ %i5 ], %i5
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
2009a4c: 80 a7 40 1c cmp %i5, %i4
2009a50: 32 bf ff f5 bne,a 2009a24 <_User_extensions_Thread_create+0x28>
2009a54: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
if ( !status )
return false;
}
}
return true;
2009a58: 82 10 20 01 mov 1, %g1
}
2009a5c: b0 08 60 01 and %g1, 1, %i0
2009a60: 81 c7 e0 08 ret
2009a64: 81 e8 00 00 restore
2009a68: b0 08 60 01 and %g1, 1, %i0
2009a6c: 81 c7 e0 08 ret
2009a70: 81 e8 00 00 restore
02009a74 <_User_extensions_Thread_delete>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_delete (
Thread_Control *the_thread
)
{
2009a74: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last(
Chain_Control *the_chain
)
{
return _Chain_Tail( the_chain )->previous;
2009a78: 39 00 80 56 sethi %hi(0x2015800), %i4
2009a7c: b8 17 21 18 or %i4, 0x118, %i4 ! 2015918 <_User_extensions_List>
2009a80: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
2009a84: 80 a7 40 1c cmp %i5, %i4
2009a88: 02 80 00 0d be 2009abc <_User_extensions_Thread_delete+0x48><== NEVER TAKEN
2009a8c: 37 00 80 56 sethi %hi(0x2015800), %i3
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_delete != NULL )
2009a90: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
2009a94: 80 a0 60 00 cmp %g1, 0
2009a98: 02 80 00 05 be 2009aac <_User_extensions_Thread_delete+0x38>
2009a9c: 84 16 e1 5c or %i3, 0x15c, %g2
(*the_extension->Callouts.thread_delete)(
2009aa0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
2009aa4: 9f c0 40 00 call %g1
2009aa8: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
2009aac: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
2009ab0: 80 a7 40 1c cmp %i5, %i4
2009ab4: 32 bf ff f8 bne,a 2009a94 <_User_extensions_Thread_delete+0x20>
2009ab8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
2009abc: 81 c7 e0 08 ret
2009ac0: 81 e8 00 00 restore
02009960 <_User_extensions_Thread_exitted>:
}
void _User_extensions_Thread_exitted (
Thread_Control *executing
)
{
2009960: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last(
Chain_Control *the_chain
)
{
return _Chain_Tail( the_chain )->previous;
2009964: 39 00 80 56 sethi %hi(0x2015800), %i4
2009968: b8 17 21 18 or %i4, 0x118, %i4 ! 2015918 <_User_extensions_List>
200996c: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
2009970: 80 a7 40 1c cmp %i5, %i4
2009974: 02 80 00 0c be 20099a4 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN
2009978: 01 00 00 00 nop
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_exitted != NULL )
200997c: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
2009980: 80 a0 60 00 cmp %g1, 0
2009984: 02 80 00 04 be 2009994 <_User_extensions_Thread_exitted+0x34>
2009988: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_exitted)( executing );
200998c: 9f c0 40 00 call %g1
2009990: 01 00 00 00 nop
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
2009994: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
2009998: 80 a7 40 1c cmp %i5, %i4
200999c: 32 bf ff f9 bne,a 2009980 <_User_extensions_Thread_exitted+0x20>
20099a0: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
20099a4: 81 c7 e0 08 ret
20099a8: 81 e8 00 00 restore
0200a800 <_User_extensions_Thread_restart>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_restart (
Thread_Control *the_thread
)
{
200a800: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
200a804: 39 00 80 73 sethi %hi(0x201cc00), %i4
200a808: fa 07 20 b8 ld [ %i4 + 0xb8 ], %i5 ! 201ccb8 <_User_extensions_List>
200a80c: b8 17 20 b8 or %i4, 0xb8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a810: b8 07 20 04 add %i4, 4, %i4
200a814: 80 a7 40 1c cmp %i5, %i4
200a818: 02 80 00 0d be 200a84c <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN
200a81c: 37 00 80 73 sethi %hi(0x201cc00), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_restart != NULL )
200a820: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200a824: 80 a0 60 00 cmp %g1, 0
200a828: 02 80 00 05 be 200a83c <_User_extensions_Thread_restart+0x3c>
200a82c: 84 16 e0 fc or %i3, 0xfc, %g2
(*the_extension->Callouts.thread_restart)(
200a830: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a834: 9f c0 40 00 call %g1
200a838: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
200a83c: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a840: 80 a7 40 1c cmp %i5, %i4
200a844: 32 bf ff f8 bne,a 200a824 <_User_extensions_Thread_restart+0x24>
200a848: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200a84c: 81 c7 e0 08 ret
200a850: 81 e8 00 00 restore
02009ac4 <_User_extensions_Thread_start>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_start (
Thread_Control *the_thread
)
{
2009ac4: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009ac8: 39 00 80 56 sethi %hi(0x2015800), %i4
2009acc: fa 07 21 18 ld [ %i4 + 0x118 ], %i5 ! 2015918 <_User_extensions_List>
2009ad0: b8 17 21 18 or %i4, 0x118, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
2009ad4: b8 07 20 04 add %i4, 4, %i4
2009ad8: 80 a7 40 1c cmp %i5, %i4
2009adc: 02 80 00 0d be 2009b10 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN
2009ae0: 37 00 80 56 sethi %hi(0x2015800), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_start != NULL )
2009ae4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2009ae8: 80 a0 60 00 cmp %g1, 0
2009aec: 02 80 00 05 be 2009b00 <_User_extensions_Thread_start+0x3c>
2009af0: 84 16 e1 5c or %i3, 0x15c, %g2
(*the_extension->Callouts.thread_start)(
2009af4: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
2009af8: 9f c0 40 00 call %g1
2009afc: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
2009b00: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
2009b04: 80 a7 40 1c cmp %i5, %i4
2009b08: 32 bf ff f8 bne,a 2009ae8 <_User_extensions_Thread_start+0x24>
2009b0c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2009b10: 81 c7 e0 08 ret
2009b14: 81 e8 00 00 restore
02009b18 <_User_extensions_Thread_switch>:
void _User_extensions_Thread_switch (
Thread_Control *executing,
Thread_Control *heir
)
{
2009b18: 9d e3 bf a0 save %sp, -96, %sp
2009b1c: 39 00 80 55 sethi %hi(0x2015400), %i4
2009b20: fa 07 23 34 ld [ %i4 + 0x334 ], %i5 ! 2015734 <_User_extensions_Switches_list>
2009b24: b8 17 23 34 or %i4, 0x334, %i4
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
2009b28: b8 07 20 04 add %i4, 4, %i4
2009b2c: 80 a7 40 1c cmp %i5, %i4
2009b30: 02 80 00 0a be 2009b58 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN
2009b34: 01 00 00 00 nop
!_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ;
the_node = the_node->next ) {
the_extension_switch = (User_extensions_Switch_control *) the_node;
(*the_extension_switch->thread_switch)( executing, heir );
2009b38: c2 07 60 08 ld [ %i5 + 8 ], %g1
2009b3c: 90 10 00 18 mov %i0, %o0
2009b40: 9f c0 40 00 call %g1
2009b44: 92 10 00 19 mov %i1, %o1
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
!_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ;
the_node = the_node->next ) {
2009b48: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
2009b4c: 80 a7 40 1c cmp %i5, %i4
2009b50: 32 bf ff fb bne,a 2009b3c <_User_extensions_Thread_switch+0x24>
2009b54: c2 07 60 08 ld [ %i5 + 8 ], %g1
2009b58: 81 c7 e0 08 ret
2009b5c: 81 e8 00 00 restore
0200bb20 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200bb20: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200bb24: 7f ff dc e9 call 2002ec8 <sparc_disable_interrupts>
200bb28: 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;
200bb2c: 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 );
200bb30: b6 06 20 04 add %i0, 4, %i3
* hence the compiler must not assume *header to remain
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
200bb34: 80 a0 40 1b cmp %g1, %i3
200bb38: 02 80 00 1e be 200bbb0 <_Watchdog_Adjust+0x90>
200bb3c: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200bb40: 12 80 00 1e bne 200bbb8 <_Watchdog_Adjust+0x98>
200bb44: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200bb48: 80 a6 a0 00 cmp %i2, 0
200bb4c: 02 80 00 19 be 200bbb0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bb50: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bb54: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bb58: 80 a6 80 1c cmp %i2, %i4
200bb5c: 1a 80 00 0a bcc 200bb84 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
200bb60: b2 10 20 01 mov 1, %i1
_Watchdog_First( header )->delta_interval -= units;
200bb64: 10 80 00 1c b 200bbd4 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED
200bb68: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED
switch ( direction ) {
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200bb6c: 02 80 00 11 be 200bbb0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bb70: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bb74: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bb78: 80 a7 00 1a cmp %i4, %i2
200bb7c: 38 80 00 16 bgu,a 200bbd4 <_Watchdog_Adjust+0xb4>
200bb80: b8 27 00 1a sub %i4, %i2, %i4
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
_Watchdog_First( header )->delta_interval = 1;
200bb84: f2 20 60 10 st %i1, [ %g1 + 0x10 ]
_ISR_Enable( level );
200bb88: 7f ff dc d4 call 2002ed8 <sparc_enable_interrupts>
200bb8c: 01 00 00 00 nop
_Watchdog_Tickle( header );
200bb90: 40 00 00 b0 call 200be50 <_Watchdog_Tickle>
200bb94: 90 10 00 1d mov %i5, %o0
_ISR_Disable( level );
200bb98: 7f ff dc cc call 2002ec8 <sparc_disable_interrupts>
200bb9c: 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;
200bba0: c2 07 40 00 ld [ %i5 ], %g1
if ( _Chain_Is_empty( header ) )
200bba4: 80 a6 c0 01 cmp %i3, %g1
200bba8: 32 bf ff f1 bne,a 200bb6c <_Watchdog_Adjust+0x4c>
200bbac: b4 a6 80 1c subcc %i2, %i4, %i2
}
break;
}
}
_ISR_Enable( level );
200bbb0: 7f ff dc ca call 2002ed8 <sparc_enable_interrupts>
200bbb4: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
200bbb8: 12 bf ff fe bne 200bbb0 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bbbc: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200bbc0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200bbc4: b4 00 80 1a add %g2, %i2, %i2
200bbc8: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
200bbcc: 7f ff dc c3 call 2002ed8 <sparc_enable_interrupts>
200bbd0: 91 e8 00 08 restore %g0, %o0, %o0
break;
case WATCHDOG_FORWARD:
while ( units ) {
if ( units < _Watchdog_First( header )->delta_interval ) {
_Watchdog_First( header )->delta_interval -= units;
break;
200bbd4: 10 bf ff f7 b 200bbb0 <_Watchdog_Adjust+0x90>
200bbd8: f8 20 60 10 st %i4, [ %g1 + 0x10 ]
02009cfc <_Watchdog_Remove>:
*/
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
2009cfc: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
2009d00: 7f ff e0 94 call 2001f50 <sparc_disable_interrupts>
2009d04: 01 00 00 00 nop
previous_state = the_watchdog->state;
2009d08: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
2009d0c: 80 a7 60 01 cmp %i5, 1
2009d10: 02 80 00 2a be 2009db8 <_Watchdog_Remove+0xbc>
2009d14: 03 00 80 56 sethi %hi(0x2015800), %g1
2009d18: 1a 80 00 09 bcc 2009d3c <_Watchdog_Remove+0x40>
2009d1c: 80 a7 60 03 cmp %i5, 3
_Watchdog_Sync_level = _ISR_Nest_level;
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
2009d20: 03 00 80 56 sethi %hi(0x2015800), %g1
2009d24: c2 00 60 44 ld [ %g1 + 0x44 ], %g1 ! 2015844 <_Watchdog_Ticks_since_boot>
2009d28: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
2009d2c: 7f ff e0 8d call 2001f60 <sparc_enable_interrupts>
2009d30: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
2009d34: 81 c7 e0 08 ret
2009d38: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
2009d3c: 18 bf ff fa bgu 2009d24 <_Watchdog_Remove+0x28> <== NEVER TAKEN
2009d40: 03 00 80 56 sethi %hi(0x2015800), %g1
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
_ISR_Enable( level );
return( previous_state );
}
2009d44: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
2009d48: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
2009d4c: c4 00 40 00 ld [ %g1 ], %g2
2009d50: 80 a0 a0 00 cmp %g2, 0
2009d54: 02 80 00 07 be 2009d70 <_Watchdog_Remove+0x74>
2009d58: 05 00 80 56 sethi %hi(0x2015800), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
2009d5c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
2009d60: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
2009d64: 84 00 c0 02 add %g3, %g2, %g2
2009d68: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
2009d6c: 05 00 80 56 sethi %hi(0x2015800), %g2
2009d70: c4 00 a0 40 ld [ %g2 + 0x40 ], %g2 ! 2015840 <_Watchdog_Sync_count>
2009d74: 80 a0 a0 00 cmp %g2, 0
2009d78: 22 80 00 07 be,a 2009d94 <_Watchdog_Remove+0x98>
2009d7c: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
2009d80: 05 00 80 56 sethi %hi(0x2015800), %g2
2009d84: c6 00 a1 64 ld [ %g2 + 0x164 ], %g3 ! 2015964 <_Per_CPU_Information+0x8>
2009d88: 05 00 80 55 sethi %hi(0x2015400), %g2
2009d8c: c6 20 a3 d8 st %g3, [ %g2 + 0x3d8 ] ! 20157d8 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
2009d90: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
2009d94: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
2009d98: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
2009d9c: 03 00 80 56 sethi %hi(0x2015800), %g1
2009da0: c2 00 60 44 ld [ %g1 + 0x44 ], %g1 ! 2015844 <_Watchdog_Ticks_since_boot>
2009da4: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
2009da8: 7f ff e0 6e call 2001f60 <sparc_enable_interrupts>
2009dac: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
2009db0: 81 c7 e0 08 ret
2009db4: 81 e8 00 00 restore
_Watchdog_Sync_level = _ISR_Nest_level;
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
2009db8: c2 00 60 44 ld [ %g1 + 0x44 ], %g1
/*
* It is not actually on the chain so just change the state and
* the Insert operation we interrupted will be aborted.
*/
the_watchdog->state = WATCHDOG_INACTIVE;
2009dbc: c0 26 20 08 clr [ %i0 + 8 ]
_Watchdog_Sync_level = _ISR_Nest_level;
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
2009dc0: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
2009dc4: 7f ff e0 67 call 2001f60 <sparc_enable_interrupts>
2009dc8: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
2009dcc: 81 c7 e0 08 ret
2009dd0: 81 e8 00 00 restore
0200b328 <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200b328: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200b32c: 7f ff dd ba call 2002a14 <sparc_disable_interrupts>
200b330: 01 00 00 00 nop
200b334: ba 10 00 08 mov %o0, %i5
printk( "Watchdog Chain: %s %p\n", name, header );
200b338: 11 00 80 6f sethi %hi(0x201bc00), %o0
200b33c: 94 10 00 19 mov %i1, %o2
200b340: 92 10 00 18 mov %i0, %o1
200b344: 7f ff e4 ce call 200467c <printk>
200b348: 90 12 23 f8 or %o0, 0x3f8, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200b34c: 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 );
200b350: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200b354: 80 a7 00 19 cmp %i4, %i1
200b358: 02 80 00 0f be 200b394 <_Watchdog_Report_chain+0x6c>
200b35c: 11 00 80 70 sethi %hi(0x201c000), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200b360: 92 10 00 1c mov %i4, %o1
200b364: 40 00 00 0f call 200b3a0 <_Watchdog_Report>
200b368: 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 )
200b36c: 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 ) ;
200b370: 80 a7 00 19 cmp %i4, %i1
200b374: 12 bf ff fc bne 200b364 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
200b378: 92 10 00 1c mov %i4, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200b37c: 11 00 80 70 sethi %hi(0x201c000), %o0
200b380: 92 10 00 18 mov %i0, %o1
200b384: 7f ff e4 be call 200467c <printk>
200b388: 90 12 20 10 or %o0, 0x10, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
200b38c: 7f ff dd a6 call 2002a24 <sparc_enable_interrupts>
200b390: 91 e8 00 1d restore %g0, %i5, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200b394: 7f ff e4 ba call 200467c <printk>
200b398: 90 12 20 20 or %o0, 0x20, %o0
200b39c: 30 bf ff fc b,a 200b38c <_Watchdog_Report_chain+0x64>
02007144 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
2007144: 9d e3 bf 98 save %sp, -104, %sp
2007148: ba 10 00 18 mov %i0, %i5
*/
RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get(
rtems_chain_control *the_chain
)
{
return _Chain_Get( the_chain );
200714c: 40 00 01 7f call 2007748 <_Chain_Get>
2007150: 90 10 00 1d mov %i5, %o0
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
) {
rtems_event_set out;
sc = rtems_event_receive(
2007154: 92 10 20 00 clr %o1
2007158: b8 10 00 08 mov %o0, %i4
200715c: 94 10 00 1a mov %i2, %o2
2007160: 90 10 00 19 mov %i1, %o0
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
2007164: 80 a7 20 00 cmp %i4, 0
2007168: 12 80 00 0a bne 2007190 <rtems_chain_get_with_wait+0x4c>
200716c: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
2007170: 7f ff fc f6 call 2006548 <rtems_event_receive>
2007174: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
2007178: 80 a2 20 00 cmp %o0, 0
200717c: 02 bf ff f4 be 200714c <rtems_chain_get_with_wait+0x8> <== NEVER TAKEN
2007180: b0 10 00 08 mov %o0, %i0
timeout,
&out
);
}
*node_ptr = node;
2007184: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
2007188: 81 c7 e0 08 ret
200718c: 81 e8 00 00 restore
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
2007190: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
2007194: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
2007198: 81 c7 e0 08 ret
200719c: 91 e8 00 08 restore %g0, %o0, %o0
02007db8 <rtems_io_register_driver>:
rtems_status_code rtems_io_register_driver(
rtems_device_major_number major,
const rtems_driver_address_table *driver_table,
rtems_device_major_number *registered_major
)
{
2007db8: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
2007dbc: 03 00 80 66 sethi %hi(0x2019800), %g1
2007dc0: c4 00 62 d4 ld [ %g1 + 0x2d4 ], %g2 ! 2019ad4 <_Per_CPU_Information+0x8>
rtems_status_code rtems_io_register_driver(
rtems_device_major_number major,
const rtems_driver_address_table *driver_table,
rtems_device_major_number *registered_major
)
{
2007dc4: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
2007dc8: 03 00 80 66 sethi %hi(0x2019800), %g1
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
2007dcc: 88 10 20 12 mov 0x12, %g4
rtems_device_major_number *registered_major
)
{
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
2007dd0: 80 a0 a0 00 cmp %g2, 0
2007dd4: 02 80 00 04 be 2007de4 <rtems_io_register_driver+0x2c>
2007dd8: de 00 63 64 ld [ %g1 + 0x364 ], %o7
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007ddc: 81 c7 e0 08 ret
2007de0: 91 e8 00 04 restore %g0, %g4, %o0
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
2007de4: 80 a6 a0 00 cmp %i2, 0
2007de8: 02 80 00 3f be 2007ee4 <rtems_io_register_driver+0x12c>
2007dec: 80 a6 60 00 cmp %i1, 0
return RTEMS_INVALID_ADDRESS;
/* Set it to an invalid value */
*registered_major = major_limit;
if ( driver_table == NULL )
2007df0: 02 80 00 3d be 2007ee4 <rtems_io_register_driver+0x12c>
2007df4: de 26 80 00 st %o7, [ %i2 ]
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007df8: c4 06 40 00 ld [ %i1 ], %g2
2007dfc: 80 a0 a0 00 cmp %g2, 0
2007e00: 22 80 00 36 be,a 2007ed8 <rtems_io_register_driver+0x120>
2007e04: c4 06 60 04 ld [ %i1 + 4 ], %g2
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
if ( major >= major_limit )
2007e08: 80 a3 c0 18 cmp %o7, %i0
2007e0c: 08 bf ff f4 bleu 2007ddc <rtems_io_register_driver+0x24>
2007e10: 88 10 20 0a mov 0xa, %g4
rtems_fatal_error_occurred( 99 );
}
}
#endif
_Thread_Dispatch_disable_level += 1;
2007e14: 05 00 80 66 sethi %hi(0x2019800), %g2
2007e18: c8 00 a0 a0 ld [ %g2 + 0xa0 ], %g4 ! 20198a0 <_Thread_Dispatch_disable_level>
2007e1c: 88 01 20 01 inc %g4
2007e20: c8 20 a0 a0 st %g4, [ %g2 + 0xa0 ]
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
2007e24: 80 a6 20 00 cmp %i0, 0
2007e28: 12 80 00 32 bne 2007ef0 <rtems_io_register_driver+0x138>
2007e2c: 1f 00 80 66 sethi %hi(0x2019800), %o7
static rtems_status_code rtems_io_obtain_major_number(
rtems_device_major_number *major
)
{
rtems_device_major_number n = _IO_Number_of_drivers;
2007e30: c8 00 63 64 ld [ %g1 + 0x364 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2007e34: 80 a1 20 00 cmp %g4, 0
2007e38: 02 80 00 45 be 2007f4c <rtems_io_register_driver+0x194> <== NEVER TAKEN
2007e3c: c2 03 e3 68 ld [ %o7 + 0x368 ], %g1
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007e40: 10 80 00 06 b 2007e58 <rtems_io_register_driver+0xa0>
2007e44: c4 00 40 00 ld [ %g1 ], %g2
rtems_device_major_number n = _IO_Number_of_drivers;
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2007e48: 80 a6 00 04 cmp %i0, %g4
2007e4c: 02 80 00 35 be 2007f20 <rtems_io_register_driver+0x168>
2007e50: 82 00 60 18 add %g1, 0x18, %g1
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007e54: c4 00 40 00 ld [ %g1 ], %g2
2007e58: 80 a0 a0 00 cmp %g2, 0
2007e5c: 32 bf ff fb bne,a 2007e48 <rtems_io_register_driver+0x90>
2007e60: b0 06 20 01 inc %i0
2007e64: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007e68: 80 a0 a0 00 cmp %g2, 0
2007e6c: 32 bf ff f7 bne,a 2007e48 <rtems_io_register_driver+0x90>
2007e70: b0 06 20 01 inc %i0
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007e74: f0 26 80 00 st %i0, [ %i2 ]
2007e78: 83 2e 20 03 sll %i0, 3, %g1
if ( m != n )
2007e7c: 80 a1 00 18 cmp %g4, %i0
2007e80: 02 80 00 29 be 2007f24 <rtems_io_register_driver+0x16c> <== NEVER TAKEN
2007e84: 9b 2e 20 05 sll %i0, 5, %o5
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007e88: c8 00 c0 00 ld [ %g3 ], %g4
2007e8c: c4 03 e3 68 ld [ %o7 + 0x368 ], %g2
2007e90: 82 23 40 01 sub %o5, %g1, %g1
2007e94: c8 20 80 01 st %g4, [ %g2 + %g1 ]
2007e98: c8 00 e0 04 ld [ %g3 + 4 ], %g4
2007e9c: 82 00 80 01 add %g2, %g1, %g1
2007ea0: c8 20 60 04 st %g4, [ %g1 + 4 ]
2007ea4: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007ea8: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007eac: c4 20 60 08 st %g2, [ %g1 + 8 ]
2007eb0: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007eb4: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007eb8: c4 20 60 0c st %g2, [ %g1 + 0xc ]
2007ebc: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
2007ec0: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
2007ec4: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
2007ec8: 40 00 08 35 call 2009f9c <_Thread_Enable_dispatch>
2007ecc: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
2007ed0: 40 00 20 ea call 2010278 <rtems_io_initialize>
2007ed4: 81 e8 00 00 restore
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007ed8: 80 a0 a0 00 cmp %g2, 0
2007edc: 12 bf ff cc bne 2007e0c <rtems_io_register_driver+0x54>
2007ee0: 80 a3 c0 18 cmp %o7, %i0
if ( driver_table == NULL )
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
2007ee4: 88 10 20 09 mov 9, %g4
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007ee8: 81 c7 e0 08 ret
2007eec: 91 e8 00 04 restore %g0, %g4, %o0
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
2007ef0: c8 03 e3 68 ld [ %o7 + 0x368 ], %g4
2007ef4: 83 2e 20 03 sll %i0, 3, %g1
2007ef8: 9b 2e 20 05 sll %i0, 5, %o5
2007efc: 84 23 40 01 sub %o5, %g1, %g2
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007f00: d8 01 00 02 ld [ %g4 + %g2 ], %o4
2007f04: 80 a3 20 00 cmp %o4, 0
2007f08: 02 80 00 0b be 2007f34 <rtems_io_register_driver+0x17c>
2007f0c: 84 01 00 02 add %g4, %g2, %g2
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
2007f10: 40 00 08 23 call 2009f9c <_Thread_Enable_dispatch>
2007f14: 01 00 00 00 nop
return RTEMS_RESOURCE_IN_USE;
2007f18: 10 bf ff b1 b 2007ddc <rtems_io_register_driver+0x24>
2007f1c: 88 10 20 0c mov 0xc, %g4 ! c <PROM_START+0xc>
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007f20: f0 26 80 00 st %i0, [ %i2 ]
if ( major == 0 ) {
rtems_status_code sc = rtems_io_obtain_major_number( registered_major );
if ( sc != RTEMS_SUCCESSFUL ) {
_Thread_Enable_dispatch();
2007f24: 40 00 08 1e call 2009f9c <_Thread_Enable_dispatch>
2007f28: 01 00 00 00 nop
return sc;
2007f2c: 10 bf ff ac b 2007ddc <rtems_io_register_driver+0x24>
2007f30: 88 10 20 05 mov 5, %g4 ! 5 <PROM_START+0x5>
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007f34: c4 00 a0 04 ld [ %g2 + 4 ], %g2
2007f38: 80 a0 a0 00 cmp %g2, 0
2007f3c: 12 bf ff f5 bne 2007f10 <rtems_io_register_driver+0x158>
2007f40: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
2007f44: 10 bf ff d1 b 2007e88 <rtems_io_register_driver+0xd0>
2007f48: f0 26 80 00 st %i0, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007f4c: 10 bf ff f6 b 2007f24 <rtems_io_register_driver+0x16c> <== NOT EXECUTED
2007f50: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
02009490 <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)
{
2009490: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
2009494: 80 a6 20 00 cmp %i0, 0
2009498: 02 80 00 23 be 2009524 <rtems_iterate_over_all_threads+0x94><== NEVER TAKEN
200949c: 37 00 80 7a sethi %hi(0x201e800), %i3
20094a0: b6 16 e2 4c or %i3, 0x24c, %i3 ! 201ea4c <_Objects_Information_table+0x4>
#endif
#include <rtems/system.h>
#include <rtems/score/thread.h>
void rtems_iterate_over_all_threads(rtems_per_thread_routine routine)
20094a4: b4 06 e0 0c add %i3, 0xc, %i2
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 ] )
20094a8: c2 06 c0 00 ld [ %i3 ], %g1
20094ac: 80 a0 60 00 cmp %g1, 0
20094b0: 22 80 00 1a be,a 2009518 <rtems_iterate_over_all_threads+0x88>
20094b4: b6 06 e0 04 add %i3, 4, %i3
continue;
#endif
information = _Objects_Information_table[ api_index ][ 1 ];
20094b8: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
20094bc: 80 a7 20 00 cmp %i4, 0
20094c0: 22 80 00 16 be,a 2009518 <rtems_iterate_over_all_threads+0x88>
20094c4: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
20094c8: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
20094cc: 84 90 60 00 orcc %g1, 0, %g2
20094d0: 22 80 00 12 be,a 2009518 <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
20094d4: b6 06 e0 04 add %i3, 4, %i3 <== NOT EXECUTED
20094d8: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
20094dc: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
20094e0: 83 2f 60 02 sll %i5, 2, %g1
20094e4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1
if ( !the_thread )
20094e8: 90 90 60 00 orcc %g1, 0, %o0
20094ec: 02 80 00 05 be 2009500 <rtems_iterate_over_all_threads+0x70>
20094f0: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
20094f4: 9f c6 00 00 call %i0
20094f8: 01 00 00 00 nop
20094fc: c4 17 20 10 lduh [ %i4 + 0x10 ], %g2
information = _Objects_Information_table[ api_index ][ 1 ];
if ( !information )
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
2009500: 83 28 a0 10 sll %g2, 0x10, %g1
2009504: 83 30 60 10 srl %g1, 0x10, %g1
2009508: 80 a0 40 1d cmp %g1, %i5
200950c: 3a bf ff f5 bcc,a 20094e0 <rtems_iterate_over_all_threads+0x50>
2009510: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
2009514: b6 06 e0 04 add %i3, 4, %i3
Objects_Information *information;
if ( !routine )
return;
for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) {
2009518: 80 a6 c0 1a cmp %i3, %i2
200951c: 32 bf ff e4 bne,a 20094ac <rtems_iterate_over_all_threads+0x1c>
2009520: c2 06 c0 00 ld [ %i3 ], %g1
2009524: 81 c7 e0 08 ret
2009528: 81 e8 00 00 restore
02008154 <rtems_object_get_class_information>:
rtems_status_code rtems_object_get_class_information(
int the_api,
int the_class,
rtems_object_api_class_information *info
)
{
2008154: 9d e3 bf a0 save %sp, -96, %sp
2008158: 90 10 00 18 mov %i0, %o0
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
200815c: 80 a6 a0 00 cmp %i2, 0
2008160: 02 80 00 21 be 20081e4 <rtems_object_get_class_information+0x90>
2008164: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
2008168: 93 2e 60 10 sll %i1, 0x10, %o1
if ( !obj_info )
return RTEMS_INVALID_NUMBER;
200816c: b0 10 20 0a mov 0xa, %i0
* Validate parameters and look up information structure.
*/
if ( !info )
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
2008170: 40 00 07 55 call 2009ec4 <_Objects_Get_information>
2008174: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
2008178: 80 a2 20 00 cmp %o0, 0
200817c: 02 80 00 1a be 20081e4 <rtems_object_get_class_information+0x90>
2008180: 01 00 00 00 nop
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
2008184: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
2008188: c8 12 20 10 lduh [ %o0 + 0x10 ], %g4
return RTEMS_INVALID_NUMBER;
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
200818c: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
2008190: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
2008194: c4 26 a0 04 st %g2, [ %i2 + 4 ]
return RTEMS_INVALID_NUMBER;
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
2008198: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
200819c: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
20081a0: c8 26 a0 08 st %g4, [ %i2 + 8 ]
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
20081a4: 80 a1 20 00 cmp %g4, 0
20081a8: 02 80 00 0d be 20081dc <rtems_object_get_class_information+0x88><== NEVER TAKEN
20081ac: 84 10 20 00 clr %g2
20081b0: de 02 20 1c ld [ %o0 + 0x1c ], %o7
20081b4: 86 10 20 01 mov 1, %g3
20081b8: 82 10 20 01 mov 1, %g1
if ( !obj_info->local_table[i] )
20081bc: 87 28 e0 02 sll %g3, 2, %g3
20081c0: c6 03 c0 03 ld [ %o7 + %g3 ], %g3
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
20081c4: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
20081c8: 80 a0 00 03 cmp %g0, %g3
20081cc: 84 60 bf ff subx %g2, -1, %g2
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
20081d0: 80 a1 00 01 cmp %g4, %g1
20081d4: 1a bf ff fa bcc 20081bc <rtems_object_get_class_information+0x68>
20081d8: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
20081dc: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
20081e0: b0 10 20 00 clr %i0
}
20081e4: 81 c7 e0 08 ret
20081e8: 81 e8 00 00 restore
02013e74 <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
2013e74: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2013e78: 80 a6 20 00 cmp %i0, 0
2013e7c: 12 80 00 04 bne 2013e8c <rtems_partition_create+0x18>
2013e80: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013e84: 81 c7 e0 08 ret
2013e88: 91 e8 00 01 restore %g0, %g1, %o0
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
return RTEMS_INVALID_NAME;
if ( !starting_address )
2013e8c: 80 a6 60 00 cmp %i1, 0
2013e90: 02 bf ff fd be 2013e84 <rtems_partition_create+0x10>
2013e94: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2013e98: 80 a7 60 00 cmp %i5, 0
2013e9c: 02 bf ff fa be 2013e84 <rtems_partition_create+0x10> <== NEVER TAKEN
2013ea0: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2013ea4: 02 bf ff f8 be 2013e84 <rtems_partition_create+0x10>
2013ea8: 82 10 20 08 mov 8, %g1
2013eac: 80 a6 a0 00 cmp %i2, 0
2013eb0: 02 bf ff f5 be 2013e84 <rtems_partition_create+0x10>
2013eb4: 80 a6 80 1b cmp %i2, %i3
2013eb8: 0a bf ff f3 bcs 2013e84 <rtems_partition_create+0x10>
2013ebc: 80 8e e0 07 btst 7, %i3
2013ec0: 12 bf ff f1 bne 2013e84 <rtems_partition_create+0x10>
2013ec4: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
2013ec8: 12 bf ff ef bne 2013e84 <rtems_partition_create+0x10>
2013ecc: 82 10 20 09 mov 9, %g1
2013ed0: 03 00 80 f0 sethi %hi(0x203c000), %g1
2013ed4: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 203c2b0 <_Thread_Dispatch_disable_level>
2013ed8: 84 00 a0 01 inc %g2
2013edc: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ]
* 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 );
2013ee0: 23 00 80 f0 sethi %hi(0x203c000), %l1
2013ee4: 40 00 12 f6 call 2018abc <_Objects_Allocate>
2013ee8: 90 14 60 c4 or %l1, 0xc4, %o0 ! 203c0c4 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2013eec: a0 92 20 00 orcc %o0, 0, %l0
2013ef0: 02 80 00 1a be 2013f58 <rtems_partition_create+0xe4>
2013ef4: 92 10 00 1b mov %i3, %o1
#endif
the_partition->starting_address = starting_address;
the_partition->length = length;
the_partition->buffer_size = buffer_size;
the_partition->attribute_set = attribute_set;
2013ef8: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
2013efc: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
2013f00: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
2013f04: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
2013f08: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
2013f0c: 40 00 61 08 call 202c32c <.udiv>
2013f10: 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,
2013f14: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
2013f18: 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,
2013f1c: 96 10 00 1b mov %i3, %o3
2013f20: b8 04 20 24 add %l0, 0x24, %i4
2013f24: 40 00 0c b1 call 20171e8 <_Chain_Initialize>
2013f28: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013f2c: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013f30: a2 14 60 c4 or %l1, 0xc4, %l1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013f34: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013f38: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013f3c: 85 28 a0 02 sll %g2, 2, %g2
2013f40: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2013f44: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
2013f48: 40 00 17 e4 call 2019ed8 <_Thread_Enable_dispatch>
2013f4c: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
2013f50: 10 bf ff cd b 2013e84 <rtems_partition_create+0x10>
2013f54: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
2013f58: 40 00 17 e0 call 2019ed8 <_Thread_Enable_dispatch>
2013f5c: 01 00 00 00 nop
return RTEMS_TOO_MANY;
2013f60: 10 bf ff c9 b 2013e84 <rtems_partition_create+0x10>
2013f64: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
020075d0 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
20075d0: 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 *)
20075d4: 11 00 80 77 sethi %hi(0x201dc00), %o0
20075d8: 92 10 00 18 mov %i0, %o1
20075dc: 90 12 21 04 or %o0, 0x104, %o0
20075e0: 40 00 09 43 call 2009aec <_Objects_Get>
20075e4: 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 ) {
20075e8: c2 07 bf fc ld [ %fp + -4 ], %g1
20075ec: 80 a0 60 00 cmp %g1, 0
20075f0: 12 80 00 0d bne 2007624 <rtems_rate_monotonic_period+0x54>
20075f4: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
20075f8: c4 02 20 40 ld [ %o0 + 0x40 ], %g2
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
20075fc: 39 00 80 78 sethi %hi(0x201e000), %i4
2007600: b8 17 20 9c or %i4, 0x9c, %i4 ! 201e09c <_Per_CPU_Information>
2007604: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007608: 80 a0 80 01 cmp %g2, %g1
200760c: 02 80 00 08 be 200762c <rtems_rate_monotonic_period+0x5c>
2007610: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
2007614: 40 00 0c e2 call 200a99c <_Thread_Enable_dispatch>
2007618: b0 10 20 17 mov 0x17, %i0
return RTEMS_NOT_OWNER_OF_RESOURCE;
200761c: 81 c7 e0 08 ret
2007620: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2007624: 81 c7 e0 08 ret
2007628: 91 e8 20 04 restore %g0, 4, %o0
if ( !_Thread_Is_executing( the_period->owner ) ) {
_Thread_Enable_dispatch();
return RTEMS_NOT_OWNER_OF_RESOURCE;
}
if ( length == RTEMS_PERIOD_STATUS ) {
200762c: 12 80 00 0e bne 2007664 <rtems_rate_monotonic_period+0x94>
2007630: 01 00 00 00 nop
switch ( the_period->state ) {
2007634: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2007638: 80 a0 60 04 cmp %g1, 4
200763c: 18 80 00 06 bgu 2007654 <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
2007640: b0 10 20 00 clr %i0
2007644: 83 28 60 02 sll %g1, 2, %g1
2007648: 05 00 80 6f sethi %hi(0x201bc00), %g2
200764c: 84 10 a1 4c or %g2, 0x14c, %g2 ! 201bd4c <CSWTCH.2>
2007650: f0 00 80 01 ld [ %g2 + %g1 ], %i0
the_period->state = RATE_MONOTONIC_ACTIVE;
the_period->next_length = length;
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2007654: 40 00 0c d2 call 200a99c <_Thread_Enable_dispatch>
2007658: 01 00 00 00 nop
return RTEMS_TIMEOUT;
200765c: 81 c7 e0 08 ret
2007660: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
2007664: 7f ff ed e2 call 2002dec <sparc_disable_interrupts>
2007668: 01 00 00 00 nop
200766c: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
2007670: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
2007674: 80 a6 e0 00 cmp %i3, 0
2007678: 02 80 00 14 be 20076c8 <rtems_rate_monotonic_period+0xf8>
200767c: 80 a6 e0 02 cmp %i3, 2
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
2007680: 02 80 00 29 be 2007724 <rtems_rate_monotonic_period+0x154>
2007684: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
2007688: 12 bf ff e5 bne 200761c <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
200768c: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
2007690: 7f ff ff 92 call 20074d8 <_Rate_monotonic_Update_statistics>
2007694: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
2007698: 7f ff ed d9 call 2002dfc <sparc_enable_interrupts>
200769c: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
20076a0: 82 10 20 02 mov 2, %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076a4: 92 07 60 10 add %i5, 0x10, %o1
20076a8: 11 00 80 77 sethi %hi(0x201dc00), %o0
the_period->next_length = length;
20076ac: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
20076b0: 90 12 23 34 or %o0, 0x334, %o0
*/
_Rate_monotonic_Update_statistics( the_period );
_ISR_Enable( level );
the_period->state = RATE_MONOTONIC_ACTIVE;
20076b4: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
20076b8: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076bc: 40 00 10 e6 call 200ba54 <_Watchdog_Insert>
20076c0: b0 10 20 06 mov 6, %i0
20076c4: 30 bf ff e4 b,a 2007654 <rtems_rate_monotonic_period+0x84>
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
20076c8: 7f ff ed cd call 2002dfc <sparc_enable_interrupts>
20076cc: 01 00 00 00 nop
/*
* Baseline statistics information for the beginning of a period.
*/
_Rate_monotonic_Initiate_statistics( the_period );
20076d0: 7f ff ff 68 call 2007470 <_Rate_monotonic_Initiate_statistics>
20076d4: 90 10 00 1d mov %i5, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
20076d8: 82 10 20 02 mov 2, %g1
20076dc: 92 07 60 10 add %i5, 0x10, %o1
20076e0: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
20076e4: 11 00 80 77 sethi %hi(0x201dc00), %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20076e8: 03 00 80 1e sethi %hi(0x2007800), %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076ec: 90 12 23 34 or %o0, 0x334, %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20076f0: 82 10 62 74 or %g1, 0x274, %g1
the_watchdog->id = id;
20076f4: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20076f8: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20076fc: c0 27 60 18 clr [ %i5 + 0x18 ]
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
2007700: c0 27 60 34 clr [ %i5 + 0x34 ]
_Rate_monotonic_Timeout,
id,
NULL
);
the_period->next_length = length;
2007704: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007708: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200770c: 40 00 10 d2 call 200ba54 <_Watchdog_Insert>
2007710: b0 10 20 00 clr %i0
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2007714: 40 00 0c a2 call 200a99c <_Thread_Enable_dispatch>
2007718: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
200771c: 81 c7 e0 08 ret
2007720: 81 e8 00 00 restore
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
2007724: 7f ff ff 6d call 20074d8 <_Rate_monotonic_Update_statistics>
2007728: 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;
200772c: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
2007730: 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;
2007734: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
2007738: 7f ff ed b1 call 2002dfc <sparc_enable_interrupts>
200773c: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
2007740: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007744: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
2007748: 90 10 00 01 mov %g1, %o0
200774c: 13 00 00 10 sethi %hi(0x4000), %o1
2007750: 40 00 0e e0 call 200b2d0 <_Thread_Set_state>
2007754: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
2007758: 7f ff ed a5 call 2002dec <sparc_disable_interrupts>
200775c: 01 00 00 00 nop
local_state = the_period->state;
2007760: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
2007764: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
2007768: 7f ff ed a5 call 2002dfc <sparc_enable_interrupts>
200776c: 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 )
2007770: 80 a6 a0 03 cmp %i2, 3
2007774: 22 80 00 06 be,a 200778c <rtems_rate_monotonic_period+0x1bc>
2007778: d0 07 20 0c ld [ %i4 + 0xc ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
200777c: 40 00 0c 88 call 200a99c <_Thread_Enable_dispatch>
2007780: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
2007784: 81 c7 e0 08 ret
2007788: 81 e8 00 00 restore
/*
* If it did, then we want to unblock ourself and continue as
* if nothing happen. The period was reset in the timeout routine.
*/
if ( local_state == RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING )
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
200778c: 40 00 0b 95 call 200a5e0 <_Thread_Clear_state>
2007790: 13 00 00 10 sethi %hi(0x4000), %o1
2007794: 30 bf ff fa b,a 200777c <rtems_rate_monotonic_period+0x1ac>
02007798 <rtems_rate_monotonic_report_statistics_with_plugin>:
*/
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
2007798: 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 )
200779c: 80 a6 60 00 cmp %i1, 0
20077a0: 02 80 00 48 be 20078c0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
20077a4: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
20077a8: 13 00 80 6f sethi %hi(0x201bc00), %o1
20077ac: 9f c6 40 00 call %i1
20077b0: 92 12 61 60 or %o1, 0x160, %o1 ! 201bd60 <CSWTCH.2+0x14>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
20077b4: 90 10 00 18 mov %i0, %o0
20077b8: 13 00 80 6f sethi %hi(0x201bc00), %o1
20077bc: 9f c6 40 00 call %i1
20077c0: 92 12 61 80 or %o1, 0x180, %o1 ! 201bd80 <CSWTCH.2+0x34>
(*print)( context, "--- Wall times are in seconds ---\n" );
20077c4: 90 10 00 18 mov %i0, %o0
20077c8: 13 00 80 6f sethi %hi(0x201bc00), %o1
20077cc: 9f c6 40 00 call %i1
20077d0: 92 12 61 a8 or %o1, 0x1a8, %o1 ! 201bda8 <CSWTCH.2+0x5c>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
20077d4: 90 10 00 18 mov %i0, %o0
20077d8: 13 00 80 6f sethi %hi(0x201bc00), %o1
20077dc: 9f c6 40 00 call %i1
20077e0: 92 12 61 d0 or %o1, 0x1d0, %o1 ! 201bdd0 <CSWTCH.2+0x84>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
20077e4: 90 10 00 18 mov %i0, %o0
20077e8: 13 00 80 6f sethi %hi(0x201bc00), %o1
20077ec: 9f c6 40 00 call %i1
20077f0: 92 12 62 20 or %o1, 0x220, %o1 ! 201be20 <CSWTCH.2+0xd4>
/*
* 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 ;
20077f4: 39 00 80 77 sethi %hi(0x201dc00), %i4
20077f8: b8 17 21 04 or %i4, 0x104, %i4 ! 201dd04 <_Rate_monotonic_Information>
20077fc: fa 07 20 08 ld [ %i4 + 8 ], %i5
2007800: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007804: 80 a7 40 01 cmp %i5, %g1
2007808: 18 80 00 2e bgu 20078c0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
200780c: 35 00 80 6f sethi %hi(0x201bc00), %i2
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,
2007810: 23 00 80 6f sethi %hi(0x201bc00), %l1
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,
2007814: 21 00 80 6f sethi %hi(0x201bc00), %l0
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
2007818: 37 00 80 6c sethi %hi(0x201b000), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
200781c: b4 16 a2 70 or %i2, 0x270, %i2
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,
2007820: a2 14 62 88 or %l1, 0x288, %l1
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,
2007824: a0 14 22 a8 or %l0, 0x2a8, %l0
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
2007828: 10 80 00 06 b 2007840 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
200782c: b6 16 e0 68 or %i3, 0x68, %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 ;
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2007830: 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 ;
2007834: 80 a0 40 1d cmp %g1, %i5
2007838: 0a 80 00 22 bcs 20078c0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
200783c: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
2007840: 90 10 00 1d mov %i5, %o0
2007844: 40 00 18 a9 call 200dae8 <rtems_rate_monotonic_get_statistics>
2007848: 92 07 bf a0 add %fp, -96, %o1
if ( status != RTEMS_SUCCESSFUL )
200784c: 80 a2 20 00 cmp %o0, 0
2007850: 32 bf ff f8 bne,a 2007830 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
2007854: c2 07 20 0c ld [ %i4 + 0xc ], %g1
#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 );
2007858: 92 07 bf d8 add %fp, -40, %o1
200785c: 40 00 18 d2 call 200dba4 <rtems_rate_monotonic_get_status>
2007860: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
2007864: d0 07 bf d8 ld [ %fp + -40 ], %o0
2007868: 92 10 20 05 mov 5, %o1
200786c: 40 00 00 b2 call 2007b34 <rtems_object_get_name>
2007870: 94 07 bf f8 add %fp, -8, %o2
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
2007874: d8 1f bf a0 ldd [ %fp + -96 ], %o4
2007878: 92 10 00 1a mov %i2, %o1
200787c: 94 10 00 1d mov %i5, %o2
2007880: 90 10 00 18 mov %i0, %o0
2007884: 9f c6 40 00 call %i1
2007888: 96 07 bf f8 add %fp, -8, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
200788c: c2 07 bf a0 ld [ %fp + -96 ], %g1
struct timespec cpu_average;
struct timespec *min_cpu = &the_stats.min_cpu_time;
struct timespec *max_cpu = &the_stats.max_cpu_time;
struct timespec *total_cpu = &the_stats.total_cpu_time;
_Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average );
2007890: 94 07 bf f0 add %fp, -16, %o2
2007894: 90 07 bf b8 add %fp, -72, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
2007898: 80 a0 60 00 cmp %g1, 0
200789c: 12 80 00 0b bne 20078c8 <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
20078a0: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
20078a4: 9f c6 40 00 call %i1
20078a8: 90 10 00 18 mov %i0, %o0
/*
* Cycle through all possible ids and try to report on each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
20078ac: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
20078b0: 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 ;
20078b4: 80 a0 40 1d cmp %g1, %i5
20078b8: 1a bf ff e3 bcc 2007844 <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
20078bc: 90 10 00 1d mov %i5, %o0
20078c0: 81 c7 e0 08 ret
20078c4: 81 e8 00 00 restore
struct timespec cpu_average;
struct timespec *min_cpu = &the_stats.min_cpu_time;
struct timespec *max_cpu = &the_stats.max_cpu_time;
struct timespec *total_cpu = &the_stats.total_cpu_time;
_Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average );
20078c8: 40 00 0f 27 call 200b564 <_Timespec_Divide_by_integer>
20078cc: 92 10 00 01 mov %g1, %o1
(*print)( context,
20078d0: d0 07 bf ac ld [ %fp + -84 ], %o0
20078d4: 40 00 45 aa call 2018f7c <.div>
20078d8: 92 10 23 e8 mov 0x3e8, %o1
20078dc: aa 10 00 08 mov %o0, %l5
20078e0: d0 07 bf b4 ld [ %fp + -76 ], %o0
20078e4: 40 00 45 a6 call 2018f7c <.div>
20078e8: 92 10 23 e8 mov 0x3e8, %o1
20078ec: c2 07 bf f0 ld [ %fp + -16 ], %g1
20078f0: a6 10 00 08 mov %o0, %l3
20078f4: d0 07 bf f4 ld [ %fp + -12 ], %o0
20078f8: e4 07 bf a8 ld [ %fp + -88 ], %l2
20078fc: e8 07 bf b0 ld [ %fp + -80 ], %l4
2007900: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2007904: 40 00 45 9e call 2018f7c <.div>
2007908: 92 10 23 e8 mov 0x3e8, %o1
200790c: 96 10 00 15 mov %l5, %o3
2007910: 98 10 00 14 mov %l4, %o4
2007914: 9a 10 00 13 mov %l3, %o5
2007918: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
200791c: 92 10 00 11 mov %l1, %o1
2007920: 94 10 00 12 mov %l2, %o2
2007924: 9f c6 40 00 call %i1
2007928: 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);
200792c: d2 07 bf a0 ld [ %fp + -96 ], %o1
2007930: 94 07 bf f0 add %fp, -16, %o2
2007934: 40 00 0f 0c call 200b564 <_Timespec_Divide_by_integer>
2007938: 90 07 bf d0 add %fp, -48, %o0
(*print)( context,
200793c: d0 07 bf c4 ld [ %fp + -60 ], %o0
2007940: 40 00 45 8f call 2018f7c <.div>
2007944: 92 10 23 e8 mov 0x3e8, %o1
2007948: a8 10 00 08 mov %o0, %l4
200794c: d0 07 bf cc ld [ %fp + -52 ], %o0
2007950: 40 00 45 8b call 2018f7c <.div>
2007954: 92 10 23 e8 mov 0x3e8, %o1
2007958: c2 07 bf f0 ld [ %fp + -16 ], %g1
200795c: a4 10 00 08 mov %o0, %l2
2007960: d0 07 bf f4 ld [ %fp + -12 ], %o0
2007964: ea 07 bf c0 ld [ %fp + -64 ], %l5
2007968: e6 07 bf c8 ld [ %fp + -56 ], %l3
200796c: 92 10 23 e8 mov 0x3e8, %o1
2007970: 40 00 45 83 call 2018f7c <.div>
2007974: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2007978: 92 10 00 10 mov %l0, %o1
200797c: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
2007980: 94 10 00 15 mov %l5, %o2
2007984: 90 10 00 18 mov %i0, %o0
2007988: 96 10 00 14 mov %l4, %o3
200798c: 98 10 00 13 mov %l3, %o4
2007990: 9f c6 40 00 call %i1
2007994: 9a 10 00 12 mov %l2, %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 ;
2007998: 10 bf ff a6 b 2007830 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
200799c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
020079b8 <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
20079b8: 9d e3 bf a0 save %sp, -96, %sp
rtems_fatal_error_occurred( 99 );
}
}
#endif
_Thread_Dispatch_disable_level += 1;
20079bc: 03 00 80 77 sethi %hi(0x201dc00), %g1
20079c0: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 201de70 <_Thread_Dispatch_disable_level>
20079c4: 84 00 a0 01 inc %g2
20079c8: c4 20 62 70 st %g2, [ %g1 + 0x270 ]
/*
* Cycle through all possible ids and try to reset each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
20079cc: 39 00 80 77 sethi %hi(0x201dc00), %i4
20079d0: b8 17 21 04 or %i4, 0x104, %i4 ! 201dd04 <_Rate_monotonic_Information>
20079d4: fa 07 20 08 ld [ %i4 + 8 ], %i5
20079d8: c2 07 20 0c ld [ %i4 + 0xc ], %g1
20079dc: 80 a7 40 01 cmp %i5, %g1
20079e0: 18 80 00 09 bgu 2007a04 <rtems_rate_monotonic_reset_all_statistics+0x4c><== NEVER TAKEN
20079e4: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
20079e8: 40 00 00 09 call 2007a0c <rtems_rate_monotonic_reset_statistics>
20079ec: 90 10 00 1d mov %i5, %o0
/*
* Cycle through all possible ids and try to reset each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
20079f0: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
20079f4: ba 07 60 01 inc %i5
/*
* Cycle through all possible ids and try to reset each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
20079f8: 80 a0 40 1d cmp %g1, %i5
20079fc: 1a bf ff fb bcc 20079e8 <rtems_rate_monotonic_reset_all_statistics+0x30>
2007a00: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
2007a04: 40 00 0b e6 call 200a99c <_Thread_Enable_dispatch>
2007a08: 81 e8 00 00 restore
02015418 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
2015418: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
RTEMS_API_Control *api;
ASR_Information *asr;
if ( !signal_set )
201541c: 80 a6 60 00 cmp %i1, 0
2015420: 12 80 00 04 bne 2015430 <rtems_signal_send+0x18>
2015424: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015428: 81 c7 e0 08 ret
201542c: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2015430: 90 10 00 18 mov %i0, %o0
2015434: 40 00 12 b5 call 2019f08 <_Thread_Get>
2015438: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
201543c: c2 07 bf fc ld [ %fp + -4 ], %g1
2015440: 80 a0 60 00 cmp %g1, 0
2015444: 12 80 00 20 bne 20154c4 <rtems_signal_send+0xac>
2015448: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
201544c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
2015450: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2015454: 80 a0 60 00 cmp %g1, 0
2015458: 02 80 00 1e be 20154d0 <rtems_signal_send+0xb8>
201545c: 01 00 00 00 nop
if ( asr->is_enabled ) {
2015460: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2015464: 80 a0 60 00 cmp %g1, 0
2015468: 02 80 00 1e be 20154e0 <rtems_signal_send+0xc8>
201546c: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2015470: 7f ff e6 9a call 200eed8 <sparc_disable_interrupts>
2015474: 01 00 00 00 nop
*signal_set |= signals;
2015478: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
201547c: b2 10 40 19 or %g1, %i1, %i1
2015480: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2015484: 7f ff e6 99 call 200eee8 <sparc_enable_interrupts>
2015488: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201548c: 03 00 80 f1 sethi %hi(0x203c400), %g1
2015490: 82 10 60 e4 or %g1, 0xe4, %g1 ! 203c4e4 <_Per_CPU_Information>
2015494: c4 00 60 08 ld [ %g1 + 8 ], %g2
2015498: 80 a0 a0 00 cmp %g2, 0
201549c: 02 80 00 06 be 20154b4 <rtems_signal_send+0x9c>
20154a0: 01 00 00 00 nop
20154a4: c4 00 60 0c ld [ %g1 + 0xc ], %g2
20154a8: 80 a7 00 02 cmp %i4, %g2
20154ac: 02 80 00 15 be 2015500 <rtems_signal_send+0xe8> <== ALWAYS TAKEN
20154b0: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
20154b4: 40 00 12 89 call 2019ed8 <_Thread_Enable_dispatch>
20154b8: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
20154bc: 10 bf ff db b 2015428 <rtems_signal_send+0x10>
20154c0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
20154c4: 82 10 20 04 mov 4, %g1
}
20154c8: 81 c7 e0 08 ret
20154cc: 91 e8 00 01 restore %g0, %g1, %o0
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
_Thread_Enable_dispatch();
20154d0: 40 00 12 82 call 2019ed8 <_Thread_Enable_dispatch>
20154d4: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
20154d8: 10 bf ff d4 b 2015428 <rtems_signal_send+0x10>
20154dc: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
20154e0: 7f ff e6 7e call 200eed8 <sparc_disable_interrupts>
20154e4: 01 00 00 00 nop
*signal_set |= signals;
20154e8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
20154ec: b2 10 40 19 or %g1, %i1, %i1
20154f0: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
20154f4: 7f ff e6 7d call 200eee8 <sparc_enable_interrupts>
20154f8: 01 00 00 00 nop
20154fc: 30 bf ff ee b,a 20154b4 <rtems_signal_send+0x9c>
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
if ( asr->is_enabled ) {
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
2015500: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
2015504: 30 bf ff ec b,a 20154b4 <rtems_signal_send+0x9c>
0200dc24 <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
200dc24: 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 )
200dc28: 80 a6 a0 00 cmp %i2, 0
200dc2c: 02 80 00 3b be 200dd18 <rtems_task_mode+0xf4>
200dc30: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
200dc34: 21 00 80 56 sethi %hi(0x2015800), %l0
200dc38: a0 14 21 5c or %l0, 0x15c, %l0 ! 201595c <_Per_CPU_Information>
200dc3c: fa 04 20 0c ld [ %l0 + 0xc ], %i5
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200dc40: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200dc44: c2 07 60 7c ld [ %i5 + 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;
200dc48: 80 a0 00 02 cmp %g0, %g2
if ( !previous_mode_set )
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
api = executing->API_Extensions[ THREAD_API_RTEMS ];
200dc4c: f8 07 61 58 ld [ %i5 + 0x158 ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200dc50: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200dc54: 80 a0 60 00 cmp %g1, 0
200dc58: 12 80 00 40 bne 200dd58 <rtems_task_mode+0x134>
200dc5c: b7 2e e0 08 sll %i3, 8, %i3
old_mode |= RTEMS_NO_TIMESLICE;
else
old_mode |= RTEMS_TIMESLICE;
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200dc60: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
200dc64: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200dc68: 7f ff f1 53 call 200a1b4 <_CPU_ISR_Get_level>
200dc6c: a2 60 3f ff subx %g0, -1, %l1
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;
200dc70: a3 2c 60 0a sll %l1, 0xa, %l1
200dc74: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200dc78: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200dc7c: 80 8e 61 00 btst 0x100, %i1
200dc80: 02 80 00 06 be 200dc98 <rtems_task_mode+0x74>
200dc84: 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;
200dc88: 82 0e 21 00 and %i0, 0x100, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
200dc8c: 80 a0 00 01 cmp %g0, %g1
200dc90: 82 60 3f ff subx %g0, -1, %g1
200dc94: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
200dc98: 80 8e 62 00 btst 0x200, %i1
200dc9c: 12 80 00 21 bne 200dd20 <rtems_task_mode+0xfc>
200dca0: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200dca4: 80 8e 60 0f btst 0xf, %i1
200dca8: 12 80 00 27 bne 200dd44 <rtems_task_mode+0x120>
200dcac: 01 00 00 00 nop
* This is specific to the RTEMS API
*/
is_asr_enabled = false;
needs_asr_dispatching = false;
if ( mask & RTEMS_ASR_MASK ) {
200dcb0: 80 8e 64 00 btst 0x400, %i1
200dcb4: 02 80 00 14 be 200dd04 <rtems_task_mode+0xe0>
200dcb8: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200dcbc: c4 0f 20 08 ldub [ %i4 + 8 ], %g2
*/
RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled (
Modes_Control mode_set
)
{
return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR;
200dcc0: 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(
200dcc4: 80 a0 00 18 cmp %g0, %i0
200dcc8: 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 ) {
200dccc: 80 a0 80 01 cmp %g2, %g1
200dcd0: 22 80 00 0e be,a 200dd08 <rtems_task_mode+0xe4>
200dcd4: 03 00 80 56 sethi %hi(0x2015800), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
200dcd8: 7f ff d0 9e call 2001f50 <sparc_disable_interrupts>
200dcdc: c2 2f 20 08 stb %g1, [ %i4 + 8 ]
_signals = information->signals_pending;
200dce0: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
200dce4: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
200dce8: c4 27 20 14 st %g2, [ %i4 + 0x14 ]
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
_signals = information->signals_pending;
information->signals_pending = information->signals_posted;
200dcec: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
200dcf0: 7f ff d0 9c call 2001f60 <sparc_enable_interrupts>
200dcf4: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
200dcf8: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
/*
* This is specific to the RTEMS API
*/
is_asr_enabled = false;
needs_asr_dispatching = false;
200dcfc: 80 a0 00 01 cmp %g0, %g1
200dd00: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
200dd04: 03 00 80 56 sethi %hi(0x2015800), %g1
200dd08: c4 00 60 8c ld [ %g1 + 0x8c ], %g2 ! 201588c <_System_state_Current>
200dd0c: 80 a0 a0 03 cmp %g2, 3
200dd10: 02 80 00 1f be 200dd8c <rtems_task_mode+0x168>
200dd14: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
200dd18: 81 c7 e0 08 ret
200dd1c: 91 e8 00 01 restore %g0, %g1, %o0
*/
if ( mask & RTEMS_PREEMPT_MASK )
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
if ( mask & RTEMS_TIMESLICE_MASK ) {
if ( _Modes_Is_timeslice(mode_set) ) {
200dd20: 22 bf ff e1 be,a 200dca4 <rtems_task_mode+0x80>
200dd24: c0 27 60 7c clr [ %i5 + 0x7c ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200dd28: 03 00 80 55 sethi %hi(0x2015400), %g1
200dd2c: c2 00 62 94 ld [ %g1 + 0x294 ], %g1 ! 2015694 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200dd30: 80 8e 60 0f btst 0xf, %i1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
if ( mask & RTEMS_TIMESLICE_MASK ) {
if ( _Modes_Is_timeslice(mode_set) ) {
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200dd34: c2 27 60 78 st %g1, [ %i5 + 0x78 ]
if ( mask & RTEMS_PREEMPT_MASK )
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
if ( mask & RTEMS_TIMESLICE_MASK ) {
if ( _Modes_Is_timeslice(mode_set) ) {
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
200dd38: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200dd3c: 02 bf ff dd be 200dcb0 <rtems_task_mode+0x8c>
200dd40: c2 27 60 7c st %g1, [ %i5 + 0x7c ]
*/
RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level (
Modes_Control mode_set
)
{
return ( mode_set & RTEMS_INTERRUPT_MASK );
200dd44: 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 ) );
200dd48: 7f ff d0 86 call 2001f60 <sparc_enable_interrupts>
200dd4c: 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 ) {
200dd50: 10 bf ff d9 b 200dcb4 <rtems_task_mode+0x90>
200dd54: 80 8e 64 00 btst 0x400, %i1
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;
200dd58: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
old_mode |= RTEMS_NO_TIMESLICE;
else
old_mode |= RTEMS_TIMESLICE;
200dd5c: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200dd60: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200dd64: 7f ff f1 14 call 200a1b4 <_CPU_ISR_Get_level>
200dd68: a2 60 3f ff subx %g0, -1, %l1
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;
200dd6c: a3 2c 60 0a sll %l1, 0xa, %l1
200dd70: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200dd74: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200dd78: 80 8e 61 00 btst 0x100, %i1
200dd7c: 02 bf ff c7 be 200dc98 <rtems_task_mode+0x74>
200dd80: 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;
200dd84: 10 bf ff c2 b 200dc8c <rtems_task_mode+0x68>
200dd88: 82 0e 21 00 and %i0, 0x100, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
200dd8c: 80 88 e0 ff btst 0xff, %g3
200dd90: 12 80 00 0a bne 200ddb8 <rtems_task_mode+0x194>
200dd94: c4 04 20 0c ld [ %l0 + 0xc ], %g2
200dd98: c6 04 20 10 ld [ %l0 + 0x10 ], %g3
200dd9c: 80 a0 80 03 cmp %g2, %g3
200dda0: 02 bf ff de be 200dd18 <rtems_task_mode+0xf4>
200dda4: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
200dda8: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200ddac: 80 a0 a0 00 cmp %g2, 0
200ddb0: 02 bf ff da be 200dd18 <rtems_task_mode+0xf4> <== NEVER TAKEN
200ddb4: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
200ddb8: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
200ddbc: c2 2c 20 18 stb %g1, [ %l0 + 0x18 ]
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
200ddc0: 7f ff eb 44 call 2008ad0 <_Thread_Dispatch>
200ddc4: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
200ddc8: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
200ddcc: 81 c7 e0 08 ret
200ddd0: 91 e8 00 01 restore %g0, %g1, %o0
0200b1b0 <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200b1b0: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200b1b4: 80 a6 60 00 cmp %i1, 0
200b1b8: 02 80 00 07 be 200b1d4 <rtems_task_set_priority+0x24>
200b1bc: 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 ) );
200b1c0: 03 00 80 65 sethi %hi(0x2019400), %g1
200b1c4: c2 08 60 bc ldub [ %g1 + 0xbc ], %g1 ! 20194bc <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
200b1c8: 80 a6 40 01 cmp %i1, %g1
200b1cc: 18 80 00 1c bgu 200b23c <rtems_task_set_priority+0x8c>
200b1d0: b0 10 20 13 mov 0x13, %i0
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200b1d4: 80 a6 a0 00 cmp %i2, 0
200b1d8: 02 80 00 19 be 200b23c <rtems_task_set_priority+0x8c>
200b1dc: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200b1e0: 40 00 09 a3 call 200d86c <_Thread_Get>
200b1e4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200b1e8: c2 07 bf fc ld [ %fp + -4 ], %g1
200b1ec: 80 a0 60 00 cmp %g1, 0
200b1f0: 12 80 00 13 bne 200b23c <rtems_task_set_priority+0x8c>
200b1f4: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200b1f8: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200b1fc: 80 a6 60 00 cmp %i1, 0
200b200: 02 80 00 0d be 200b234 <rtems_task_set_priority+0x84>
200b204: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200b208: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200b20c: 80 a0 60 00 cmp %g1, 0
200b210: 02 80 00 06 be 200b228 <rtems_task_set_priority+0x78>
200b214: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200b218: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200b21c: 80 a6 40 01 cmp %i1, %g1
200b220: 1a 80 00 05 bcc 200b234 <rtems_task_set_priority+0x84> <== ALWAYS TAKEN
200b224: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200b228: 92 10 00 19 mov %i1, %o1
200b22c: 40 00 08 4b call 200d358 <_Thread_Change_priority>
200b230: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200b234: 40 00 09 82 call 200d83c <_Thread_Enable_dispatch>
200b238: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
200b23c: 81 c7 e0 08 ret
200b240: 81 e8 00 00 restore
02007608 <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
2007608: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
200760c: 80 a6 60 00 cmp %i1, 0
2007610: 02 80 00 1e be 2007688 <rtems_task_variable_delete+0x80>
2007614: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
2007618: 90 10 00 18 mov %i0, %o0
200761c: 40 00 09 27 call 2009ab8 <_Thread_Get>
2007620: 92 07 bf fc add %fp, -4, %o1
switch (location) {
2007624: c2 07 bf fc ld [ %fp + -4 ], %g1
2007628: 80 a0 60 00 cmp %g1, 0
200762c: 12 80 00 19 bne 2007690 <rtems_task_variable_delete+0x88>
2007630: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
2007634: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
2007638: 80 a0 60 00 cmp %g1, 0
200763c: 02 80 00 10 be 200767c <rtems_task_variable_delete+0x74>
2007640: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2007644: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007648: 80 a0 80 19 cmp %g2, %i1
200764c: 32 80 00 09 bne,a 2007670 <rtems_task_variable_delete+0x68>
2007650: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
2007654: 10 80 00 18 b 20076b4 <rtems_task_variable_delete+0xac>
2007658: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
200765c: 80 a0 80 19 cmp %g2, %i1
2007660: 22 80 00 0e be,a 2007698 <rtems_task_variable_delete+0x90>
2007664: c4 02 40 00 ld [ %o1 ], %g2
2007668: 82 10 00 09 mov %o1, %g1
_RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp );
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
200766c: d2 00 40 00 ld [ %g1 ], %o1
the_thread = _Thread_Get (tid, &location);
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
2007670: 80 a2 60 00 cmp %o1, 0
2007674: 32 bf ff fa bne,a 200765c <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
2007678: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
200767c: 40 00 09 03 call 2009a88 <_Thread_Enable_dispatch>
2007680: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
2007684: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2007688: 81 c7 e0 08 ret
200768c: 91 e8 00 01 restore %g0, %g1, %o0
2007690: 81 c7 e0 08 ret
2007694: 91 e8 00 01 restore %g0, %g1, %o0
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
if (prev)
prev->next = tvp->next;
2007698: c4 20 40 00 st %g2, [ %g1 ]
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
_RTEMS_Tasks_Invoke_task_variable_dtor( the_thread, tvp );
200769c: 40 00 00 2d call 2007750 <_RTEMS_Tasks_Invoke_task_variable_dtor>
20076a0: 01 00 00 00 nop
_Thread_Enable_dispatch();
20076a4: 40 00 08 f9 call 2009a88 <_Thread_Enable_dispatch>
20076a8: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
20076ac: 10 bf ff f7 b 2007688 <rtems_task_variable_delete+0x80>
20076b0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
while (tvp) {
if (tvp->ptr == ptr) {
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
20076b4: 92 10 00 01 mov %g1, %o1
20076b8: 10 bf ff f9 b 200769c <rtems_task_variable_delete+0x94>
20076bc: c4 22 21 64 st %g2, [ %o0 + 0x164 ]
020076c0 <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
20076c0: 9d e3 bf 98 save %sp, -104, %sp
20076c4: 90 10 00 18 mov %i0, %o0
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
20076c8: 80 a6 60 00 cmp %i1, 0
20076cc: 02 80 00 1b be 2007738 <rtems_task_variable_get+0x78>
20076d0: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !result )
20076d4: 80 a6 a0 00 cmp %i2, 0
20076d8: 02 80 00 1c be 2007748 <rtems_task_variable_get+0x88>
20076dc: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
20076e0: 40 00 08 f6 call 2009ab8 <_Thread_Get>
20076e4: 92 07 bf fc add %fp, -4, %o1
switch (location) {
20076e8: c2 07 bf fc ld [ %fp + -4 ], %g1
20076ec: 80 a0 60 00 cmp %g1, 0
20076f0: 12 80 00 12 bne 2007738 <rtems_task_variable_get+0x78>
20076f4: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/*
* Figure out if the variable is in this task's list.
*/
tvp = the_thread->task_variables;
20076f8: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
20076fc: 80 a0 60 00 cmp %g1, 0
2007700: 32 80 00 07 bne,a 200771c <rtems_task_variable_get+0x5c>
2007704: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007708: 30 80 00 0e b,a 2007740 <rtems_task_variable_get+0x80>
200770c: 80 a0 60 00 cmp %g1, 0
2007710: 02 80 00 0c be 2007740 <rtems_task_variable_get+0x80> <== NEVER TAKEN
2007714: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2007718: c4 00 60 04 ld [ %g1 + 4 ], %g2
200771c: 80 a0 80 19 cmp %g2, %i1
2007720: 32 bf ff fb bne,a 200770c <rtems_task_variable_get+0x4c>
2007724: c2 00 40 00 ld [ %g1 ], %g1
/*
* Should this return the current (i.e not the
* saved) value if `tid' is the current task?
*/
*result = tvp->tval;
2007728: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
200772c: b0 10 20 00 clr %i0
/*
* Should this return the current (i.e not the
* saved) value if `tid' is the current task?
*/
*result = tvp->tval;
_Thread_Enable_dispatch();
2007730: 40 00 08 d6 call 2009a88 <_Thread_Enable_dispatch>
2007734: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
2007738: 81 c7 e0 08 ret
200773c: 81 e8 00 00 restore
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
2007740: 40 00 08 d2 call 2009a88 <_Thread_Enable_dispatch>
2007744: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
2007748: 81 c7 e0 08 ret
200774c: 81 e8 00 00 restore
02015e70 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2015e70: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2015e74: 11 00 80 f1 sethi %hi(0x203c400), %o0
2015e78: 92 10 00 18 mov %i0, %o1
2015e7c: 90 12 21 74 or %o0, 0x174, %o0
2015e80: 40 00 0c 6a call 2019028 <_Objects_Get>
2015e84: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2015e88: c2 07 bf fc ld [ %fp + -4 ], %g1
2015e8c: 80 a0 60 00 cmp %g1, 0
2015e90: 12 80 00 0c bne 2015ec0 <rtems_timer_cancel+0x50>
2015e94: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
2015e98: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2015e9c: 80 a0 60 04 cmp %g1, 4
2015ea0: 02 80 00 04 be 2015eb0 <rtems_timer_cancel+0x40> <== NEVER TAKEN
2015ea4: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
2015ea8: 40 00 14 f9 call 201b28c <_Watchdog_Remove>
2015eac: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
2015eb0: 40 00 10 0a call 2019ed8 <_Thread_Enable_dispatch>
2015eb4: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
2015eb8: 81 c7 e0 08 ret
2015ebc: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015ec0: 81 c7 e0 08 ret
2015ec4: 91 e8 20 04 restore %g0, 4, %o0
02016394 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2016394: 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;
2016398: 03 00 80 f1 sethi %hi(0x203c400), %g1
201639c: fa 00 61 b4 ld [ %g1 + 0x1b4 ], %i5 ! 203c5b4 <_Timer_server>
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
20163a0: b8 10 00 18 mov %i0, %i4
Timer_Control *the_timer;
Objects_Locations location;
rtems_interval seconds;
Timer_server_Control *timer_server = _Timer_server;
if ( !timer_server )
20163a4: 80 a7 60 00 cmp %i5, 0
20163a8: 02 80 00 32 be 2016470 <rtems_timer_server_fire_when+0xdc>
20163ac: b0 10 20 0e mov 0xe, %i0
return RTEMS_INCORRECT_STATE;
if ( !_TOD_Is_set )
20163b0: 03 00 80 f0 sethi %hi(0x203c000), %g1
20163b4: c2 08 62 c0 ldub [ %g1 + 0x2c0 ], %g1 ! 203c2c0 <_TOD_Is_set>
20163b8: 80 a0 60 00 cmp %g1, 0
20163bc: 02 80 00 2d be 2016470 <rtems_timer_server_fire_when+0xdc><== NEVER TAKEN
20163c0: b0 10 20 0b mov 0xb, %i0
return RTEMS_NOT_DEFINED;
if ( !routine )
20163c4: 80 a6 a0 00 cmp %i2, 0
20163c8: 02 80 00 2a be 2016470 <rtems_timer_server_fire_when+0xdc>
20163cc: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
20163d0: 90 10 00 19 mov %i1, %o0
20163d4: 7f ff f3 df call 2013350 <_TOD_Validate>
20163d8: b0 10 20 14 mov 0x14, %i0
20163dc: 80 8a 20 ff btst 0xff, %o0
20163e0: 02 80 00 24 be 2016470 <rtems_timer_server_fire_when+0xdc>
20163e4: 01 00 00 00 nop
return RTEMS_INVALID_CLOCK;
seconds = _TOD_To_seconds( wall_time );
20163e8: 7f ff f3 a6 call 2013280 <_TOD_To_seconds>
20163ec: 90 10 00 19 mov %i1, %o0
if ( seconds <= _TOD_Seconds_since_epoch() )
20163f0: 21 00 80 f0 sethi %hi(0x203c000), %l0
20163f4: c2 04 23 3c ld [ %l0 + 0x33c ], %g1 ! 203c33c <_TOD_Now>
20163f8: 80 a2 00 01 cmp %o0, %g1
20163fc: 08 80 00 1d bleu 2016470 <rtems_timer_server_fire_when+0xdc>
2016400: b2 10 00 08 mov %o0, %i1
2016404: 92 10 00 1c mov %i4, %o1
2016408: 11 00 80 f1 sethi %hi(0x203c400), %o0
201640c: 94 07 bf fc add %fp, -4, %o2
2016410: 40 00 0b 06 call 2019028 <_Objects_Get>
2016414: 90 12 21 74 or %o0, 0x174, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2016418: c2 07 bf fc ld [ %fp + -4 ], %g1
201641c: 80 a0 60 00 cmp %g1, 0
2016420: 12 80 00 16 bne 2016478 <rtems_timer_server_fire_when+0xe4>
2016424: b0 10 00 08 mov %o0, %i0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
2016428: 40 00 13 99 call 201b28c <_Watchdog_Remove>
201642c: 90 02 20 10 add %o0, 0x10, %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2016430: c4 04 23 3c ld [ %l0 + 0x33c ], %g2
(*timer_server->schedule_operation)( timer_server, the_timer );
2016434: c2 07 60 04 ld [ %i5 + 4 ], %g1
2016438: 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();
201643c: b2 26 40 02 sub %i1, %g2, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
2016440: 90 10 00 1d mov %i5, %o0
the_timer = _Timer_Get( id, &location );
switch ( location ) {
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
2016444: 84 10 20 03 mov 3, %g2
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2016448: f4 26 20 2c st %i2, [ %i0 + 0x2c ]
201644c: c4 26 20 38 st %g2, [ %i0 + 0x38 ]
the_watchdog->id = id;
2016450: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
the_watchdog->user_data = user_data;
2016454: f6 26 20 34 st %i3, [ %i0 + 0x34 ]
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2016458: f2 26 20 1c st %i1, [ %i0 + 0x1c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
201645c: c0 26 20 18 clr [ %i0 + 0x18 ]
(*timer_server->schedule_operation)( timer_server, the_timer );
2016460: 9f c0 40 00 call %g1
2016464: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
2016468: 40 00 0e 9c call 2019ed8 <_Thread_Enable_dispatch>
201646c: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2016470: 81 c7 e0 08 ret
2016474: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2016478: 81 c7 e0 08 ret
201647c: 91 e8 20 04 restore %g0, 4, %o0