RTEMS 4.11Annotated Report
Wed Aug 29 09:27:44 2012
020086a4 <_API_extensions_Run_postdriver>:
/*
* _API_extensions_Run_postdriver
*/
void _API_extensions_Run_postdriver( void )
{
20086a4: 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;
20086a8: 39 00 80 74 sethi %hi(0x201d000), %i4
20086ac: fa 07 23 f4 ld [ %i4 + 0x3f4 ], %i5 ! 201d3f4 <_API_extensions_List>
20086b0: b8 17 23 f4 or %i4, 0x3f4, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20086b4: b8 07 20 04 add %i4, 4, %i4
20086b8: 80 a7 40 1c cmp %i5, %i4
20086bc: 02 80 00 09 be 20086e0 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
20086c0: 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)();
20086c4: c2 07 60 08 ld [ %i5 + 8 ], %g1
20086c8: 9f c0 40 00 call %g1
20086cc: 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 ) {
20086d0: 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 );
20086d4: 80 a7 40 1c cmp %i5, %i4
20086d8: 32 bf ff fc bne,a 20086c8 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN
20086dc: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
20086e0: 81 c7 e0 08 ret
20086e4: 81 e8 00 00 restore
020086e8 <_API_extensions_Run_postswitch>:
/*
* _API_extensions_Run_postswitch
*/
void _API_extensions_Run_postswitch( void )
{
20086e8: 9d e3 bf a0 save %sp, -96, %sp
20086ec: 39 00 80 74 sethi %hi(0x201d000), %i4
20086f0: fa 07 23 f4 ld [ %i4 + 0x3f4 ], %i5 ! 201d3f4 <_API_extensions_List>
20086f4: 37 00 80 75 sethi %hi(0x201d400), %i3
20086f8: b8 17 23 f4 or %i4, 0x3f4, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20086fc: b8 07 20 04 add %i4, 4, %i4
2008700: 80 a7 40 1c cmp %i5, %i4
2008704: 02 80 00 09 be 2008728 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN
2008708: b6 16 e0 30 or %i3, 0x30, %i3
!_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 );
200870c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2008710: 9f c0 40 00 call %g1
2008714: 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 ) {
2008718: 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 );
200871c: 80 a7 40 1c cmp %i5, %i4
2008720: 32 bf ff fc bne,a 2008710 <_API_extensions_Run_postswitch+0x28><== NEVER TAKEN
2008724: c2 07 60 0c ld [ %i5 + 0xc ], %g1 <== NOT EXECUTED
2008728: 81 c7 e0 08 ret
200872c: 81 e8 00 00 restore
02011d10 <_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
)
{
2011d10: 9d e3 bf a0 save %sp, -96, %sp
size_t message_buffering_required = 0;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
the_message_queue->number_of_pending_messages = 0;
2011d14: c0 26 20 48 clr [ %i0 + 0x48 ]
)
{
size_t message_buffering_required = 0;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
2011d18: f4 26 20 44 st %i2, [ %i0 + 0x44 ]
/*
* 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)) {
2011d1c: 80 8e e0 03 btst 3, %i3
2011d20: 02 80 00 0b be 2011d4c <_CORE_message_queue_Initialize+0x3c>
2011d24: f6 26 20 4c st %i3, [ %i0 + 0x4c ]
allocated_message_size += sizeof(uint32_t);
2011d28: 96 06 e0 04 add %i3, 4, %o3
allocated_message_size &= ~(sizeof(uint32_t) - 1);
2011d2c: 96 0a ff fc and %o3, -4, %o3
}
if (allocated_message_size < maximum_message_size)
2011d30: 80 a6 c0 0b cmp %i3, %o3
2011d34: 08 80 00 08 bleu 2011d54 <_CORE_message_queue_Initialize+0x44>
2011d38: ba 02 e0 10 add %o3, 0x10, %i5
return false;
2011d3c: b0 10 20 00 clr %i0
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2011d40: b0 0e 20 01 and %i0, 1, %i0
2011d44: 81 c7 e0 08 ret
2011d48: 81 e8 00 00 restore
/*
* 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)) {
2011d4c: 96 10 00 1b mov %i3, %o3
/*
* Calculate how much total memory is required for message buffering and
* check for overflow on the multiplication.
*/
if ( !size_t_mult32_with_overflow(
2011d50: ba 02 e0 10 add %o3, 0x10, %i5
size_t a,
size_t b,
size_t *c
)
{
long long x = (long long)a*b;
2011d54: 90 10 20 00 clr %o0
2011d58: 92 10 00 1a mov %i2, %o1
2011d5c: 94 10 20 00 clr %o2
2011d60: 40 00 41 84 call 2022370 <__muldi3>
2011d64: 96 10 00 1d mov %i5, %o3
if ( x > SIZE_MAX )
2011d68: 80 a2 20 00 cmp %o0, 0
2011d6c: 34 bf ff f5 bg,a 2011d40 <_CORE_message_queue_Initialize+0x30>
2011d70: b0 10 20 00 clr %i0
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
_Workspace_Allocate( message_buffering_required );
2011d74: 40 00 0c a2 call 2014ffc <_Workspace_Allocate>
2011d78: 90 10 00 09 mov %o1, %o0
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
2011d7c: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
2011d80: 80 a2 20 00 cmp %o0, 0
2011d84: 02 bf ff ee be 2011d3c <_CORE_message_queue_Initialize+0x2c><== NEVER TAKEN
2011d88: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
2011d8c: 90 06 20 60 add %i0, 0x60, %o0
2011d90: 94 10 00 1a mov %i2, %o2
2011d94: 7f ff ff c6 call 2011cac <_Chain_Initialize>
2011d98: 96 10 00 1d mov %i5, %o3
*/
RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority(
CORE_message_queue_Attributes *the_attribute
)
{
return
2011d9c: 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 );
2011da0: 82 06 20 50 add %i0, 0x50, %g1
2011da4: 84 18 a0 01 xor %g2, 1, %g2
allocated_message_size + sizeof( CORE_message_queue_Buffer_control )
);
_Chain_Initialize_empty( &the_message_queue->Pending_messages );
_Thread_queue_Initialize(
2011da8: 80 a0 00 02 cmp %g0, %g2
2011dac: 84 06 20 54 add %i0, 0x54, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
2011db0: 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;
2011db4: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
2011db8: 90 10 00 18 mov %i0, %o0
head->previous = NULL;
2011dbc: c0 26 20 54 clr [ %i0 + 0x54 ]
2011dc0: 92 60 3f ff subx %g0, -1, %o1
2011dc4: 94 10 20 80 mov 0x80, %o2
2011dc8: 96 10 20 06 mov 6, %o3
2011dcc: 40 00 0a 3a call 20146b4 <_Thread_queue_Initialize>
2011dd0: b0 10 20 01 mov 1, %i0
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2011dd4: b0 0e 20 01 and %i0, 1, %i0
2011dd8: 81 c7 e0 08 ret
2011ddc: 81 e8 00 00 restore
02008a50 <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
2008a50: 9d e3 bf a0 save %sp, -96, %sp
* This routine returns true if thread dispatch indicates
* that we are in a critical section.
*/
RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void)
{
if ( _Thread_Dispatch_disable_level == 0 )
2008a54: 3b 00 80 74 sethi %hi(0x201d000), %i5
2008a58: c2 07 62 10 ld [ %i5 + 0x210 ], %g1 ! 201d210 <_Thread_Dispatch_disable_level>
2008a5c: 80 a0 60 00 cmp %g1, 0
2008a60: 02 80 00 20 be 2008ae0 <_CORE_mutex_Seize+0x90>
2008a64: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
2008a68: 80 a6 a0 00 cmp %i2, 0
2008a6c: 02 80 00 2d be 2008b20 <_CORE_mutex_Seize+0xd0>
2008a70: 90 10 00 18 mov %i0, %o0
2008a74: 03 00 80 74 sethi %hi(0x201d000), %g1
2008a78: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 ! 201d350 <_System_state_Current>
2008a7c: 80 a0 60 01 cmp %g1, 1
2008a80: 38 80 00 2f bgu,a 2008b3c <_CORE_mutex_Seize+0xec>
2008a84: 90 10 20 00 clr %o0
2008a88: 40 00 12 d6 call 200d5e0 <_CORE_mutex_Seize_interrupt_trylock>
2008a8c: 92 07 a0 54 add %fp, 0x54, %o1
2008a90: 80 a2 20 00 cmp %o0, 0
2008a94: 02 80 00 28 be 2008b34 <_CORE_mutex_Seize+0xe4> <== ALWAYS TAKEN
2008a98: 01 00 00 00 nop
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2008a9c: c4 07 62 10 ld [ %i5 + 0x210 ], %g2
2008aa0: 03 00 80 75 sethi %hi(0x201d400), %g1
2008aa4: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 ! 201d43c <_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;
2008aa8: 86 10 20 01 mov 1, %g3
2008aac: c6 26 20 30 st %g3, [ %i0 + 0x30 ]
2008ab0: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
2008ab4: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
2008ab8: 82 00 a0 01 add %g2, 1, %g1
2008abc: c2 27 62 10 st %g1, [ %i5 + 0x210 ]
return _Thread_Dispatch_disable_level;
2008ac0: c2 07 62 10 ld [ %i5 + 0x210 ], %g1
2008ac4: 7f ff e7 2c call 2002774 <sparc_enable_interrupts>
2008ac8: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2008acc: 90 10 00 18 mov %i0, %o0
2008ad0: 7f ff ff b9 call 20089b4 <_CORE_mutex_Seize_interrupt_blocking>
2008ad4: 92 10 00 1b mov %i3, %o1
2008ad8: 81 c7 e0 08 ret
2008adc: 81 e8 00 00 restore
2008ae0: 90 10 00 18 mov %i0, %o0
2008ae4: 40 00 12 bf call 200d5e0 <_CORE_mutex_Seize_interrupt_trylock>
2008ae8: 92 07 a0 54 add %fp, 0x54, %o1
2008aec: 80 a2 20 00 cmp %o0, 0
2008af0: 02 bf ff fa be 2008ad8 <_CORE_mutex_Seize+0x88>
2008af4: 80 a6 a0 00 cmp %i2, 0
2008af8: 12 bf ff e9 bne 2008a9c <_CORE_mutex_Seize+0x4c>
2008afc: 01 00 00 00 nop
2008b00: 7f ff e7 1d call 2002774 <sparc_enable_interrupts>
2008b04: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2008b08: 03 00 80 75 sethi %hi(0x201d400), %g1
2008b0c: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 ! 201d43c <_Per_CPU_Information+0xc>
2008b10: 84 10 20 01 mov 1, %g2
2008b14: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
2008b18: 81 c7 e0 08 ret
2008b1c: 81 e8 00 00 restore
2008b20: 40 00 12 b0 call 200d5e0 <_CORE_mutex_Seize_interrupt_trylock>
2008b24: 92 07 a0 54 add %fp, 0x54, %o1
2008b28: 80 a2 20 00 cmp %o0, 0
2008b2c: 12 bf ff f5 bne 2008b00 <_CORE_mutex_Seize+0xb0> <== NEVER TAKEN
2008b30: 01 00 00 00 nop
2008b34: 81 c7 e0 08 ret
2008b38: 81 e8 00 00 restore
2008b3c: 92 10 20 00 clr %o1
2008b40: 40 00 01 c2 call 2009248 <_Internal_error_Occurred>
2008b44: 94 10 20 12 mov 0x12, %o2
02008cc4 <_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
)
{
2008cc4: 9d e3 bf a0 save %sp, -96, %sp
2008cc8: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2008ccc: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
2008cd0: 40 00 07 bb call 200abbc <_Thread_queue_Dequeue>
2008cd4: 90 10 00 1d mov %i5, %o0
2008cd8: 80 a2 20 00 cmp %o0, 0
2008cdc: 02 80 00 04 be 2008cec <_CORE_semaphore_Surrender+0x28>
2008ce0: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
2008ce4: 81 c7 e0 08 ret
2008ce8: 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 );
2008cec: 7f ff e6 9e call 2002764 <sparc_disable_interrupts>
2008cf0: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
2008cf4: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
2008cf8: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
2008cfc: 80 a0 40 02 cmp %g1, %g2
2008d00: 1a 80 00 05 bcc 2008d14 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
2008d04: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
2008d08: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2008d0c: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
2008d10: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
2008d14: 7f ff e6 98 call 2002774 <sparc_enable_interrupts>
2008d18: 01 00 00 00 nop
}
return status;
}
2008d1c: 81 c7 e0 08 ret
2008d20: 81 e8 00 00 restore
02008880 <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
2008880: 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;
2008884: 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 );
2008888: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200888c: 80 a6 a0 00 cmp %i2, 0
2008890: 02 80 00 13 be 20088dc <_Chain_Initialize+0x5c> <== NEVER TAKEN
2008894: 92 06 bf ff add %i2, -1, %o1
2008898: 86 10 00 09 mov %o1, %g3
200889c: 82 10 00 19 mov %i1, %g1
20088a0: 84 10 00 18 mov %i0, %g2
current->next = next;
20088a4: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
20088a8: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
20088ac: 86 00 ff ff add %g3, -1, %g3
20088b0: 84 10 00 01 mov %g1, %g2
20088b4: 80 a0 ff ff cmp %g3, -1
20088b8: 12 bf ff fb bne 20088a4 <_Chain_Initialize+0x24>
20088bc: 82 00 40 1b add %g1, %i3, %g1
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
20088c0: 40 00 3f 63 call 201864c <.umul>
20088c4: 90 10 00 1b mov %i3, %o0
20088c8: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
20088cc: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
20088d0: d0 26 20 08 st %o0, [ %i0 + 8 ]
20088d4: 81 c7 e0 08 ret
20088d8: 81 e8 00 00 restore
)
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
20088dc: 10 bf ff fc b 20088cc <_Chain_Initialize+0x4c> <== NOT EXECUTED
20088e0: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED
020078f0 <_Event_Surrender>:
*/
void _Event_Surrender(
Thread_Control *the_thread
)
{
20078f0: 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 ];
20078f4: fa 06 21 50 ld [ %i0 + 0x150 ], %i5
option_set = (rtems_option) the_thread->Wait.option;
_ISR_Disable( level );
20078f8: 7f ff eb 9b call 2002764 <sparc_disable_interrupts>
20078fc: f6 06 20 30 ld [ %i0 + 0x30 ], %i3
pending_events = api->pending_events;
2007900: c4 07 40 00 ld [ %i5 ], %g2
event_condition = (rtems_event_set) the_thread->Wait.count;
2007904: 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 ) ) {
2007908: 86 88 40 02 andcc %g1, %g2, %g3
200790c: 02 80 00 39 be 20079f0 <_Event_Surrender+0x100>
2007910: 09 00 80 75 sethi %hi(0x201d400), %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() &&
2007914: 88 11 20 30 or %g4, 0x30, %g4 ! 201d430 <_Per_CPU_Information>
2007918: f8 01 20 08 ld [ %g4 + 8 ], %i4
200791c: 80 a7 20 00 cmp %i4, 0
2007920: 32 80 00 1c bne,a 2007990 <_Event_Surrender+0xa0>
2007924: 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);
2007928: 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 ) ) {
200792c: 80 89 21 00 btst 0x100, %g4
2007930: 02 80 00 30 be 20079f0 <_Event_Surrender+0x100>
2007934: 80 a0 40 03 cmp %g1, %g3
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
2007938: 02 80 00 04 be 2007948 <_Event_Surrender+0x58>
200793c: 80 8e e0 02 btst 2, %i3
2007940: 02 80 00 2c be 20079f0 <_Event_Surrender+0x100> <== NEVER TAKEN
2007944: 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;
2007948: 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) );
200794c: 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 );
2007950: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
2007954: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2007958: c6 20 40 00 st %g3, [ %g1 ]
_ISR_Flash( level );
200795c: 7f ff eb 86 call 2002774 <sparc_enable_interrupts>
2007960: 01 00 00 00 nop
2007964: 7f ff eb 80 call 2002764 <sparc_disable_interrupts>
2007968: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
200796c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
2007970: 80 a0 60 02 cmp %g1, 2
2007974: 02 80 00 21 be 20079f8 <_Event_Surrender+0x108>
2007978: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
200797c: 7f ff eb 7e call 2002774 <sparc_enable_interrupts>
2007980: 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 );
2007984: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
2007988: 40 00 0a bc call 200a478 <_Thread_Clear_state>
200798c: 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() &&
2007990: 80 a6 00 04 cmp %i0, %g4
2007994: 32 bf ff e6 bne,a 200792c <_Event_Surrender+0x3c>
2007998: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
200799c: 09 00 80 75 sethi %hi(0x201d400), %g4
20079a0: f8 01 20 90 ld [ %g4 + 0x90 ], %i4 ! 201d490 <_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 ) &&
20079a4: 80 a7 20 02 cmp %i4, 2
20079a8: 02 80 00 07 be 20079c4 <_Event_Surrender+0xd4> <== NEVER TAKEN
20079ac: 80 a0 40 03 cmp %g1, %g3
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
20079b0: f8 01 20 90 ld [ %g4 + 0x90 ], %i4
* 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) ||
20079b4: 80 a7 20 01 cmp %i4, 1
20079b8: 32 bf ff dd bne,a 200792c <_Event_Surrender+0x3c>
20079bc: 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) ) {
20079c0: 80 a0 40 03 cmp %g1, %g3
20079c4: 02 80 00 04 be 20079d4 <_Event_Surrender+0xe4>
20079c8: 80 8e e0 02 btst 2, %i3
20079cc: 02 80 00 09 be 20079f0 <_Event_Surrender+0x100> <== NEVER TAKEN
20079d0: 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;
20079d4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
20079d8: 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 );
20079dc: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
20079e0: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
20079e4: c6 20 40 00 st %g3, [ %g1 ]
_Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
20079e8: 82 10 20 03 mov 3, %g1
20079ec: c2 21 20 90 st %g1, [ %g4 + 0x90 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
20079f0: 7f ff eb 61 call 2002774 <sparc_enable_interrupts>
20079f4: 91 e8 00 08 restore %g0, %o0, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
20079f8: 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 );
20079fc: 7f ff eb 5e call 2002774 <sparc_enable_interrupts>
2007a00: 33 04 00 ff sethi %hi(0x1003fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
2007a04: 40 00 0f 64 call 200b794 <_Watchdog_Remove>
2007a08: 90 06 20 48 add %i0, 0x48, %o0
2007a0c: b2 16 63 f8 or %i1, 0x3f8, %i1
2007a10: 40 00 0a 9a call 200a478 <_Thread_Clear_state>
2007a14: 81 e8 00 00 restore
02007a18 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *ignored
)
{
2007a18: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
ISR_Level level;
the_thread = _Thread_Get( id, &location );
2007a1c: 90 10 00 18 mov %i0, %o0
2007a20: 40 00 0b 96 call 200a878 <_Thread_Get>
2007a24: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2007a28: c2 07 bf fc ld [ %fp + -4 ], %g1
2007a2c: 80 a0 60 00 cmp %g1, 0
2007a30: 12 80 00 16 bne 2007a88 <_Event_Timeout+0x70> <== NEVER TAKEN
2007a34: 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 );
2007a38: 7f ff eb 4b call 2002764 <sparc_disable_interrupts>
2007a3c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
2007a40: 03 00 80 75 sethi %hi(0x201d400), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
2007a44: c2 00 60 3c ld [ %g1 + 0x3c ], %g1 ! 201d43c <_Per_CPU_Information+0xc>
2007a48: 80 a7 40 01 cmp %i5, %g1
2007a4c: 02 80 00 11 be 2007a90 <_Event_Timeout+0x78>
2007a50: 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;
2007a54: 82 10 20 06 mov 6, %g1
2007a58: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
2007a5c: 7f ff eb 46 call 2002774 <sparc_enable_interrupts>
2007a60: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007a64: 90 10 00 1d mov %i5, %o0
2007a68: 13 04 00 ff sethi %hi(0x1003fc00), %o1
2007a6c: 40 00 0a 83 call 200a478 <_Thread_Clear_state>
2007a70: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 <RAM_END+0xdc3fff8>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2007a74: 03 00 80 74 sethi %hi(0x201d000), %g1
2007a78: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 201d210 <_Thread_Dispatch_disable_level>
2007a7c: 84 00 bf ff add %g2, -1, %g2
2007a80: c4 20 62 10 st %g2, [ %g1 + 0x210 ]
return _Thread_Dispatch_disable_level;
2007a84: c2 00 62 10 ld [ %g1 + 0x210 ], %g1
2007a88: 81 c7 e0 08 ret
2007a8c: 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 )
2007a90: 03 00 80 75 sethi %hi(0x201d400), %g1
2007a94: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 201d490 <_Event_Sync_state>
2007a98: 80 a0 a0 01 cmp %g2, 1
2007a9c: 32 bf ff ef bne,a 2007a58 <_Event_Timeout+0x40>
2007aa0: 82 10 20 06 mov 6, %g1
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
2007aa4: 84 10 20 02 mov 2, %g2
2007aa8: c4 20 60 90 st %g2, [ %g1 + 0x90 ]
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
2007aac: 10 bf ff eb b 2007a58 <_Event_Timeout+0x40>
2007ab0: 82 10 20 06 mov 6, %g1
0200d76c <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200d76c: 9d e3 bf 98 save %sp, -104, %sp
Heap_Statistics *const stats = &heap->stats;
uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE
200d770: a2 06 60 04 add %i1, 4, %l1
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200d774: a0 10 00 18 mov %i0, %l0
Heap_Block *block = NULL;
uintptr_t alloc_begin = 0;
uint32_t search_count = 0;
bool search_again = false;
if ( block_size_floor < alloc_size ) {
200d778: 80 a6 40 11 cmp %i1, %l1
200d77c: 18 80 00 85 bgu 200d990 <_Heap_Allocate_aligned_with_boundary+0x224>
200d780: ea 06 20 10 ld [ %i0 + 0x10 ], %l5
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
200d784: 80 a6 e0 00 cmp %i3, 0
200d788: 12 80 00 7c bne 200d978 <_Heap_Allocate_aligned_with_boundary+0x20c>
200d78c: 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;
200d790: fa 04 20 08 ld [ %l0 + 8 ], %i5
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d794: 80 a4 00 1d cmp %l0, %i5
200d798: 02 80 00 18 be 200d7f8 <_Heap_Allocate_aligned_with_boundary+0x8c>
200d79c: b8 10 20 00 clr %i4
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;
200d7a0: ac 10 20 04 mov 4, %l6
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
200d7a4: ae 05 60 07 add %l5, 7, %l7
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200d7a8: ac 25 80 19 sub %l6, %i1, %l6
200d7ac: 10 80 00 0b b 200d7d8 <_Heap_Allocate_aligned_with_boundary+0x6c>
200d7b0: ec 27 bf fc st %l6, [ %fp + -4 ]
* 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 ) {
200d7b4: 12 80 00 18 bne 200d814 <_Heap_Allocate_aligned_with_boundary+0xa8>
200d7b8: b0 07 60 08 add %i5, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d7bc: 80 a6 20 00 cmp %i0, 0
200d7c0: 12 80 00 4d bne 200d8f4 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN
200d7c4: b8 07 20 01 inc %i4
break;
}
block = block->next;
200d7c8: fa 07 60 08 ld [ %i5 + 8 ], %i5
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d7cc: 80 a4 00 1d cmp %l0, %i5
200d7d0: 22 80 00 0b be,a 200d7fc <_Heap_Allocate_aligned_with_boundary+0x90>
200d7d4: c2 04 20 44 ld [ %l0 + 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 ) {
200d7d8: c2 07 60 04 ld [ %i5 + 4 ], %g1
200d7dc: 80 a4 40 01 cmp %l1, %g1
200d7e0: 0a bf ff f5 bcs 200d7b4 <_Heap_Allocate_aligned_with_boundary+0x48>
200d7e4: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
200d7e8: fa 07 60 08 ld [ %i5 + 8 ], %i5
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d7ec: 80 a4 00 1d cmp %l0, %i5
200d7f0: 12 bf ff fa bne 200d7d8 <_Heap_Allocate_aligned_with_boundary+0x6c>
200d7f4: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d7f8: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
200d7fc: 80 a0 40 1c cmp %g1, %i4
200d800: 1a 80 00 03 bcc 200d80c <_Heap_Allocate_aligned_with_boundary+0xa0>
200d804: b0 10 20 00 clr %i0
stats->max_search = search_count;
200d808: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
}
return (void *) alloc_begin;
200d80c: 81 c7 e0 08 ret
200d810: 81 e8 00 00 restore
uintptr_t alignment,
uintptr_t boundary
)
{
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
200d814: e8 04 20 14 ld [ %l0 + 0x14 ], %l4
- 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;
200d818: a4 08 7f fe and %g1, -2, %l2
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;
200d81c: c2 07 bf fc ld [ %fp + -4 ], %g1
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;
200d820: 84 25 c0 14 sub %l7, %l4, %g2
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;
200d824: a4 07 40 12 add %i5, %l2, %l2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d828: 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;
200d82c: b0 00 40 12 add %g1, %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
200d830: a4 00 80 12 add %g2, %l2, %l2
200d834: 40 00 2c 6c call 20189e4 <.urem>
200d838: 90 10 00 18 mov %i0, %o0
200d83c: 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 ) {
200d840: 80 a4 80 18 cmp %l2, %i0
200d844: 1a 80 00 06 bcc 200d85c <_Heap_Allocate_aligned_with_boundary+0xf0>
200d848: a6 07 60 08 add %i5, 8, %l3
200d84c: 90 10 00 12 mov %l2, %o0
200d850: 40 00 2c 65 call 20189e4 <.urem>
200d854: 92 10 00 1a mov %i2, %o1
200d858: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
200d85c: 80 a6 e0 00 cmp %i3, 0
200d860: 02 80 00 37 be 200d93c <_Heap_Allocate_aligned_with_boundary+0x1d0>
200d864: 80 a4 c0 18 cmp %l3, %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;
200d868: 86 06 00 19 add %i0, %i1, %g3
200d86c: 92 10 00 1b mov %i3, %o1
200d870: 90 10 00 03 mov %g3, %o0
200d874: 40 00 2c 5c call 20189e4 <.urem>
200d878: c6 27 bf f8 st %g3, [ %fp + -8 ]
200d87c: c6 07 bf f8 ld [ %fp + -8 ], %g3
200d880: 90 20 c0 08 sub %g3, %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 ) {
200d884: 80 a6 00 08 cmp %i0, %o0
200d888: 1a 80 00 2c bcc 200d938 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200d88c: a4 04 c0 19 add %l3, %i1, %l2
200d890: 80 a2 00 03 cmp %o0, %g3
200d894: 2a 80 00 12 bcs,a 200d8dc <_Heap_Allocate_aligned_with_boundary+0x170>
200d898: 80 a4 80 08 cmp %l2, %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 ) {
200d89c: 10 80 00 28 b 200d93c <_Heap_Allocate_aligned_with_boundary+0x1d0>
200d8a0: 80 a4 c0 18 cmp %l3, %i0
200d8a4: 92 10 00 1a mov %i2, %o1
200d8a8: 40 00 2c 4f call 20189e4 <.urem>
200d8ac: 90 10 00 18 mov %i0, %o0
200d8b0: 92 10 00 1b mov %i3, %o1
200d8b4: b0 26 00 08 sub %i0, %o0, %i0
if ( boundary_line < boundary_floor ) {
return 0;
}
alloc_begin = boundary_line - alloc_size;
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
alloc_end = alloc_begin + alloc_size;
200d8b8: ac 06 00 19 add %i0, %i1, %l6
200d8bc: 40 00 2c 4a call 20189e4 <.urem>
200d8c0: 90 10 00 16 mov %l6, %o0
200d8c4: 90 25 80 08 sub %l6, %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 ) {
200d8c8: 80 a2 00 16 cmp %o0, %l6
200d8cc: 1a 80 00 1b bcc 200d938 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200d8d0: 80 a6 00 08 cmp %i0, %o0
200d8d4: 1a 80 00 19 bcc 200d938 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200d8d8: 80 a4 80 08 cmp %l2, %o0
if ( boundary_line < boundary_floor ) {
200d8dc: 08 bf ff f2 bleu 200d8a4 <_Heap_Allocate_aligned_with_boundary+0x138>
200d8e0: b0 22 00 19 sub %o0, %i1, %i0
return 0;
200d8e4: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d8e8: 80 a6 20 00 cmp %i0, 0
200d8ec: 02 bf ff b7 be 200d7c8 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN
200d8f0: 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;
200d8f4: c6 04 20 48 ld [ %l0 + 0x48 ], %g3
stats->searches += search_count;
200d8f8: c4 04 20 4c ld [ %l0 + 0x4c ], %g2
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200d8fc: 86 00 e0 01 inc %g3
stats->searches += search_count;
200d900: 84 00 80 1c add %g2, %i4, %g2
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200d904: c6 24 20 48 st %g3, [ %l0 + 0x48 ]
stats->searches += search_count;
200d908: c4 24 20 4c st %g2, [ %l0 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
200d90c: 90 10 00 10 mov %l0, %o0
200d910: 92 10 00 1d mov %i5, %o1
200d914: 94 10 00 18 mov %i0, %o2
200d918: 7f ff ee 00 call 2009118 <_Heap_Block_allocate>
200d91c: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d920: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
200d924: 80 a0 40 1c cmp %g1, %i4
200d928: 2a bf ff b9 bcs,a 200d80c <_Heap_Allocate_aligned_with_boundary+0xa0>
200d92c: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200d930: 81 c7 e0 08 ret
200d934: 81 e8 00 00 restore
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 ) {
200d938: 80 a4 c0 18 cmp %l3, %i0
200d93c: 18 bf ff ea bgu 200d8e4 <_Heap_Allocate_aligned_with_boundary+0x178>
200d940: 82 10 3f f8 mov -8, %g1
200d944: 90 10 00 18 mov %i0, %o0
200d948: a4 20 40 1d sub %g1, %i5, %l2
200d94c: 92 10 00 15 mov %l5, %o1
200d950: 40 00 2c 25 call 20189e4 <.urem>
200d954: 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 ) {
200d958: 90 a4 80 08 subcc %l2, %o0, %o0
200d95c: 02 bf ff 99 be 200d7c0 <_Heap_Allocate_aligned_with_boundary+0x54>
200d960: 80 a6 20 00 cmp %i0, 0
200d964: 80 a2 00 14 cmp %o0, %l4
200d968: 1a bf ff 96 bcc 200d7c0 <_Heap_Allocate_aligned_with_boundary+0x54>
200d96c: 80 a6 20 00 cmp %i0, 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 ) {
if ( boundary_line < boundary_floor ) {
return 0;
200d970: 10 bf ff de b 200d8e8 <_Heap_Allocate_aligned_with_boundary+0x17c>
200d974: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
200d978: 18 80 00 06 bgu 200d990 <_Heap_Allocate_aligned_with_boundary+0x224>
200d97c: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
200d980: 22 bf ff 84 be,a 200d790 <_Heap_Allocate_aligned_with_boundary+0x24>
200d984: b4 10 00 15 mov %l5, %i2
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200d988: 10 bf ff 83 b 200d794 <_Heap_Allocate_aligned_with_boundary+0x28>
200d98c: fa 04 20 08 ld [ %l0 + 8 ], %i5
uint32_t search_count = 0;
bool search_again = false;
if ( block_size_floor < alloc_size ) {
/* Integer overflow occured */
return NULL;
200d990: 81 c7 e0 08 ret
200d994: 91 e8 20 00 restore %g0, 0, %o0
0200d9b0 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
200d9b0: 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;
200d9b4: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200d9b8: 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;
200d9bc: a0 06 40 1a add %i1, %i2, %l0
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
Heap_Statistics *const stats = &heap->stats;
Heap_Block *const first_block = heap->first_block;
200d9c0: ee 06 20 20 ld [ %i0 + 0x20 ], %l7
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;
200d9c4: e2 06 20 10 ld [ %i0 + 0x10 ], %l1
uintptr_t const min_block_size = heap->min_block_size;
200d9c8: d6 06 20 14 ld [ %i0 + 0x14 ], %o3
uintptr_t const free_size = stats->free_size;
uintptr_t extend_first_block_size = 0;
uintptr_t extended_size = 0;
bool extend_area_ok = false;
if ( extend_area_end < extend_area_begin ) {
200d9cc: 80 a6 40 10 cmp %i1, %l0
200d9d0: 08 80 00 06 bleu 200d9e8 <_Heap_Extend+0x38>
200d9d4: e6 06 20 30 ld [ %i0 + 0x30 ], %l3
return false;
200d9d8: b0 10 20 00 clr %i0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d9dc: b0 0e 20 01 and %i0, 1, %i0
200d9e0: 81 c7 e0 08 ret
200d9e4: 81 e8 00 00 restore
if ( extend_area_end < extend_area_begin ) {
return false;
}
extend_area_ok = _Heap_Get_first_and_last_block(
200d9e8: 90 10 00 19 mov %i1, %o0
200d9ec: 92 10 00 1a mov %i2, %o1
200d9f0: 94 10 00 11 mov %l1, %o2
200d9f4: 98 07 bf f8 add %fp, -8, %o4
200d9f8: 7f ff ed 6d call 2008fac <_Heap_Get_first_and_last_block>
200d9fc: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200da00: 80 8a 20 ff btst 0xff, %o0
200da04: 02 bf ff f5 be 200d9d8 <_Heap_Extend+0x28>
200da08: ba 10 00 17 mov %l7, %i5
200da0c: aa 10 20 00 clr %l5
200da10: ac 10 20 00 clr %l6
200da14: a4 10 20 00 clr %l2
200da18: 10 80 00 10 b 200da58 <_Heap_Extend+0xa8>
200da1c: 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 ) {
200da20: 2a 80 00 02 bcs,a 200da28 <_Heap_Extend+0x78>
200da24: ac 10 00 1d mov %i5, %l6
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200da28: 80 a7 00 19 cmp %i4, %i1
200da2c: 22 80 00 1e be,a 200daa4 <_Heap_Extend+0xf4>
200da30: e0 27 40 00 st %l0, [ %i5 ]
start_block->prev_size = extend_area_end;
merge_above_block = end_block;
} else if ( sub_area_end < extend_area_begin ) {
200da34: 80 a6 40 1c cmp %i1, %i4
200da38: 38 80 00 02 bgu,a 200da40 <_Heap_Extend+0x90>
200da3c: aa 10 00 08 mov %o0, %l5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200da40: fa 02 20 04 ld [ %o0 + 4 ], %i5
200da44: ba 0f 7f fe and %i5, -2, %i5
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200da48: ba 02 00 1d add %o0, %i5, %i5
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200da4c: 80 a5 c0 1d cmp %l7, %i5
200da50: 22 80 00 1c be,a 200dac0 <_Heap_Extend+0x110>
200da54: 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;
200da58: 80 a7 40 17 cmp %i5, %l7
200da5c: 22 80 00 03 be,a 200da68 <_Heap_Extend+0xb8>
200da60: f4 06 20 18 ld [ %i0 + 0x18 ], %i2
200da64: b4 10 00 1d mov %i5, %i2
uintptr_t const sub_area_end = start_block->prev_size;
200da68: f8 07 40 00 ld [ %i5 ], %i4
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200da6c: 92 10 00 11 mov %l1, %o1
200da70: 40 00 2c a2 call 2018cf8 <.urem>
200da74: 90 10 00 1c mov %i4, %o0
200da78: 82 07 3f f8 add %i4, -8, %g1
Heap_Block *const end_block =
_Heap_Block_of_alloc_area( sub_area_end, page_size );
if (
200da7c: 80 a6 80 10 cmp %i2, %l0
200da80: 0a 80 00 69 bcs 200dc24 <_Heap_Extend+0x274>
200da84: 90 20 40 08 sub %g1, %o0, %o0
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
}
if ( extend_area_end == sub_area_begin ) {
200da88: 80 a6 80 10 cmp %i2, %l0
200da8c: 12 bf ff e5 bne 200da20 <_Heap_Extend+0x70>
200da90: 80 a4 00 1c cmp %l0, %i4
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 ) {
200da94: 80 a7 00 19 cmp %i4, %i1
200da98: 12 bf ff e7 bne 200da34 <_Heap_Extend+0x84> <== ALWAYS TAKEN
200da9c: a8 10 00 1d mov %i5, %l4
start_block->prev_size = extend_area_end;
200daa0: e0 27 40 00 st %l0, [ %i5 ] <== NOT EXECUTED
- 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;
200daa4: fa 02 20 04 ld [ %o0 + 4 ], %i5
200daa8: ba 0f 7f fe and %i5, -2, %i5
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200daac: ba 02 00 1d add %o0, %i5, %i5
} 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 );
200dab0: 80 a5 c0 1d cmp %l7, %i5
200dab4: 12 bf ff e9 bne 200da58 <_Heap_Extend+0xa8> <== NEVER TAKEN
200dab8: a4 10 00 08 mov %o0, %l2
if ( extend_area_begin < heap->area_begin ) {
200dabc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200dac0: 80 a6 40 01 cmp %i1, %g1
200dac4: 3a 80 00 53 bcc,a 200dc10 <_Heap_Extend+0x260>
200dac8: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200dacc: 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;
200dad0: c2 07 bf f8 ld [ %fp + -8 ], %g1
200dad4: 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 ) {
200dad8: 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 =
200dadc: 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;
200dae0: e0 20 40 00 st %l0, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200dae4: ba 10 e0 01 or %g3, 1, %i5
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 =
200dae8: fa 20 60 04 st %i5, [ %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;
200daec: 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 ) {
200daf0: 80 a1 00 01 cmp %g4, %g1
200daf4: 08 80 00 41 bleu 200dbf8 <_Heap_Extend+0x248>
200daf8: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
200dafc: 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 ) {
200db00: 80 a5 20 00 cmp %l4, 0
200db04: 02 80 00 4d be 200dc38 <_Heap_Extend+0x288>
200db08: 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;
200db0c: fa 06 20 10 ld [ %i0 + 0x10 ], %i5
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up(
uintptr_t value,
uintptr_t alignment
)
{
uintptr_t remainder = value % alignment;
200db10: 92 10 00 1d mov %i5, %o1
200db14: 40 00 2c 79 call 2018cf8 <.urem>
200db18: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200db1c: 80 a2 20 00 cmp %o0, 0
200db20: 02 80 00 04 be 200db30 <_Heap_Extend+0x180>
200db24: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
200db28: b2 06 40 1d add %i1, %i5, %i1
200db2c: 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 =
200db30: 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;
200db34: 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 =
200db38: 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;
200db3c: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
200db40: 90 10 00 18 mov %i0, %o0
200db44: 92 10 00 01 mov %g1, %o1
200db48: 7f ff ff 90 call 200d988 <_Heap_Free_block>
200db4c: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200db50: 80 a4 a0 00 cmp %l2, 0
200db54: 02 80 00 40 be 200dc54 <_Heap_Extend+0x2a4>
200db58: a0 04 3f f8 add %l0, -8, %l0
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200db5c: 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(
200db60: a0 24 00 12 sub %l0, %l2, %l0
200db64: 40 00 2c 65 call 2018cf8 <.urem>
200db68: 90 10 00 10 mov %l0, %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)
200db6c: c2 04 a0 04 ld [ %l2 + 4 ], %g1
200db70: a0 24 00 08 sub %l0, %o0, %l0
200db74: 82 20 40 10 sub %g1, %l0, %g1
| HEAP_PREV_BLOCK_USED;
200db78: 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 =
200db7c: 84 04 00 12 add %l0, %l2, %g2
200db80: 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;
200db84: c2 04 a0 04 ld [ %l2 + 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 );
200db88: 90 10 00 18 mov %i0, %o0
200db8c: 82 08 60 01 and %g1, 1, %g1
200db90: 92 10 00 12 mov %l2, %o1
block->size_and_flag = size | flag;
200db94: a0 14 00 01 or %l0, %g1, %l0
200db98: 7f ff ff 7c call 200d988 <_Heap_Free_block>
200db9c: e0 24 a0 04 st %l0, [ %l2 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200dba0: 80 a4 a0 00 cmp %l2, 0
200dba4: 02 80 00 39 be 200dc88 <_Heap_Extend+0x2d8>
200dba8: 80 a5 20 00 cmp %l4, 0
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
heap->last_block,
(uintptr_t) heap->first_block - (uintptr_t) heap->last_block
200dbac: 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(
200dbb0: fa 06 20 20 ld [ %i0 + 0x20 ], %i5
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;
200dbb4: c8 00 60 04 ld [ %g1 + 4 ], %g4
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
/* Statistics */
stats->size += extended_size;
200dbb8: c4 06 20 2c ld [ %i0 + 0x2c ], %g2
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200dbbc: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
* This feature will be used to terminate the scattered heap area list. See
* also _Heap_Extend().
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
200dbc0: ba 27 40 01 sub %i5, %g1, %i5
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;
200dbc4: 88 09 20 01 and %g4, 1, %g4
block->size_and_flag = size | flag;
200dbc8: 88 17 40 04 or %i5, %g4, %g4
200dbcc: c8 20 60 04 st %g4, [ %g1 + 4 ]
200dbd0: a6 20 c0 13 sub %g3, %l3, %l3
/* Statistics */
stats->size += extended_size;
200dbd4: 82 00 80 13 add %g2, %l3, %g1
if ( extended_size_ptr != NULL )
200dbd8: 80 a6 e0 00 cmp %i3, 0
200dbdc: 02 80 00 32 be 200dca4 <_Heap_Extend+0x2f4> <== NEVER TAKEN
200dbe0: c2 26 20 2c st %g1, [ %i0 + 0x2c ]
*extended_size_ptr = extended_size;
200dbe4: e6 26 c0 00 st %l3, [ %i3 ]
return true;
200dbe8: b0 10 20 01 mov 1, %i0
}
200dbec: b0 0e 20 01 and %i0, 1, %i0
200dbf0: 81 c7 e0 08 ret
200dbf4: 81 e8 00 00 restore
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 ) {
200dbf8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200dbfc: 80 a0 40 02 cmp %g1, %g2
200dc00: 2a bf ff c0 bcs,a 200db00 <_Heap_Extend+0x150>
200dc04: c4 26 20 24 st %g2, [ %i0 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200dc08: 10 bf ff bf b 200db04 <_Heap_Extend+0x154>
200dc0c: 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 ) {
200dc10: 80 a4 00 01 cmp %l0, %g1
200dc14: 38 bf ff af bgu,a 200dad0 <_Heap_Extend+0x120>
200dc18: e0 26 20 1c st %l0, [ %i0 + 0x1c ]
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
200dc1c: 10 bf ff ae b 200dad4 <_Heap_Extend+0x124>
200dc20: 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 (
200dc24: 80 a6 40 1c cmp %i1, %i4
200dc28: 1a bf ff 99 bcc 200da8c <_Heap_Extend+0xdc>
200dc2c: 80 a6 80 10 cmp %i2, %l0
uintptr_t extend_first_block_size = 0;
uintptr_t extended_size = 0;
bool extend_area_ok = false;
if ( extend_area_end < extend_area_begin ) {
return false;
200dc30: 10 bf ff 6b b 200d9dc <_Heap_Extend+0x2c>
200dc34: b0 10 20 00 clr %i0
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 ) {
200dc38: 80 a5 a0 00 cmp %l6, 0
200dc3c: 02 bf ff c6 be 200db54 <_Heap_Extend+0x1a4>
200dc40: 80 a4 a0 00 cmp %l2, 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;
200dc44: ac 25 80 02 sub %l6, %g2, %l6
200dc48: 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 =
200dc4c: 10 bf ff c2 b 200db54 <_Heap_Extend+0x1a4>
200dc50: ec 20 a0 04 st %l6, [ %g2 + 4 ]
);
}
if ( merge_above_block != NULL ) {
_Heap_Merge_above( heap, merge_above_block, extend_area_end );
} else if ( link_above_block != NULL ) {
200dc54: 80 a5 60 00 cmp %l5, 0
200dc58: 02 bf ff d2 be 200dba0 <_Heap_Extend+0x1f0>
200dc5c: 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;
200dc60: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200dc64: c2 07 bf fc ld [ %fp + -4 ], %g1
200dc68: 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 );
200dc6c: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200dc70: 84 10 80 03 or %g2, %g3, %g2
200dc74: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200dc78: c4 00 60 04 ld [ %g1 + 4 ], %g2
200dc7c: 84 10 a0 01 or %g2, 1, %g2
200dc80: 10 bf ff c8 b 200dba0 <_Heap_Extend+0x1f0>
200dc84: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200dc88: 32 bf ff ca bne,a 200dbb0 <_Heap_Extend+0x200>
200dc8c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200dc90: d2 07 bf f8 ld [ %fp + -8 ], %o1
200dc94: 7f ff ff 3d call 200d988 <_Heap_Free_block>
200dc98: 90 10 00 18 mov %i0, %o0
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
heap->last_block,
(uintptr_t) heap->first_block - (uintptr_t) heap->last_block
200dc9c: 10 bf ff c5 b 200dbb0 <_Heap_Extend+0x200>
200dca0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
stats->size += extended_size;
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
200dca4: 10 bf ff 4e b 200d9dc <_Heap_Extend+0x2c> <== NOT EXECUTED
200dca8: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED
0200d998 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200d998: 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 ) {
200d99c: 80 a6 60 00 cmp %i1, 0
200d9a0: 02 80 00 3c be 200da90 <_Heap_Free+0xf8>
200d9a4: 82 10 20 01 mov 1, %g1
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d9a8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200d9ac: 40 00 2c 0e call 20189e4 <.urem>
200d9b0: 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
200d9b4: c4 06 20 20 ld [ %i0 + 0x20 ], %g2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d9b8: 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);
200d9bc: 90 27 40 08 sub %i5, %o0, %o0
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200d9c0: 80 a2 00 02 cmp %o0, %g2
200d9c4: 0a 80 00 30 bcs 200da84 <_Heap_Free+0xec>
200d9c8: 82 10 20 00 clr %g1
200d9cc: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
200d9d0: 80 a2 00 04 cmp %o0, %g4
200d9d4: 38 80 00 2d bgu,a 200da88 <_Heap_Free+0xf0>
200d9d8: b0 08 60 ff and %g1, 0xff, %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;
200d9dc: f6 02 20 04 ld [ %o0 + 4 ], %i3
200d9e0: ba 0e ff fe and %i3, -2, %i5
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d9e4: 86 02 00 1d add %o0, %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;
200d9e8: 80 a0 80 03 cmp %g2, %g3
200d9ec: 38 80 00 27 bgu,a 200da88 <_Heap_Free+0xf0> <== NEVER TAKEN
200d9f0: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED
200d9f4: 80 a1 00 03 cmp %g4, %g3
200d9f8: 2a 80 00 24 bcs,a 200da88 <_Heap_Free+0xf0> <== NEVER TAKEN
200d9fc: b0 08 60 ff and %g1, 0xff, %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;
200da00: f8 00 e0 04 ld [ %g3 + 4 ], %i4
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200da04: 80 8f 20 01 btst 1, %i4
200da08: 02 80 00 1f be 200da84 <_Heap_Free+0xec> <== NEVER TAKEN
200da0c: 80 a1 00 03 cmp %g4, %g3
return true;
}
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
200da10: 02 80 00 23 be 200da9c <_Heap_Free+0x104>
200da14: b8 0f 3f fe and %i4, -2, %i4
200da18: 82 00 c0 1c add %g3, %i4, %g1
200da1c: c2 00 60 04 ld [ %g1 + 4 ], %g1
200da20: 80 88 60 01 btst 1, %g1
200da24: 12 80 00 1f bne 200daa0 <_Heap_Free+0x108>
200da28: 80 8e e0 01 btst 1, %i3
if ( !_Heap_Is_prev_used( block ) ) {
200da2c: 02 80 00 20 be 200daac <_Heap_Free+0x114>
200da30: b2 10 20 01 mov 1, %i1
RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace(
Heap_Block *old_block,
Heap_Block *new_block
)
{
Heap_Block *next = old_block->next;
200da34: c4 00 e0 08 ld [ %g3 + 8 ], %g2
Heap_Block *prev = old_block->prev;
200da38: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
new_block->next = next;
200da3c: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = prev;
200da40: c2 22 20 0c st %g1, [ %o0 + 0xc ]
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
200da44: b8 07 00 1d add %i4, %i5, %i4
next->prev = new_block;
200da48: d0 20 a0 0c st %o0, [ %g2 + 0xc ]
prev->next = new_block;
200da4c: d0 20 60 08 st %o0, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200da50: 84 17 20 01 or %i4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200da54: f8 22 00 1c st %i4, [ %o0 + %i4 ]
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;
200da58: c4 22 20 04 st %g2, [ %o0 + 4 ]
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200da5c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200da60: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
stats->free_size += block_size;
200da64: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200da68: 82 00 60 01 inc %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200da6c: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
stats->free_size += block_size;
200da70: ba 00 c0 1d add %g3, %i5, %i5
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200da74: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200da78: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
stats->free_size += block_size;
200da7c: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
return( true );
200da80: 82 10 20 01 mov 1, %g1
200da84: b0 08 60 ff and %g1, 0xff, %i0
200da88: 81 c7 e0 08 ret
200da8c: 81 e8 00 00 restore
200da90: b0 08 60 ff and %g1, 0xff, %i0
200da94: 81 c7 e0 08 ret
200da98: 81 e8 00 00 restore
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 ) ) {
200da9c: 80 8e e0 01 btst 1, %i3
200daa0: 32 80 00 1e bne,a 200db18 <_Heap_Free+0x180>
200daa4: c4 06 20 08 ld [ %i0 + 8 ], %g2
if ( !_Heap_Protection_determine_block_free( heap, block ) ) {
return true;
}
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
200daa8: b2 10 20 00 clr %i1
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
if ( !_Heap_Is_prev_used( block ) ) {
uintptr_t const prev_size = block->prev_size;
200daac: f4 02 00 00 ld [ %o0 ], %i2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200dab0: b6 22 00 1a sub %o0, %i2, %i3
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;
200dab4: 80 a0 80 1b cmp %g2, %i3
200dab8: 18 bf ff f3 bgu 200da84 <_Heap_Free+0xec> <== NEVER TAKEN
200dabc: 82 10 20 00 clr %g1
200dac0: 80 a1 00 1b cmp %g4, %i3
200dac4: 2a bf ff f1 bcs,a 200da88 <_Heap_Free+0xf0> <== NEVER TAKEN
200dac8: b0 08 60 ff and %g1, 0xff, %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;
200dacc: c4 06 e0 04 ld [ %i3 + 4 ], %g2
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) ) {
200dad0: 80 88 a0 01 btst 1, %g2
200dad4: 02 bf ff ec be 200da84 <_Heap_Free+0xec> <== NEVER TAKEN
200dad8: 80 8e 60 ff btst 0xff, %i1
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200dadc: 22 80 00 21 be,a 200db60 <_Heap_Free+0x1c8>
200dae0: b4 07 40 1a add %i5, %i2, %i2
return _Heap_Free_list_tail(heap)->prev;
}
RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block )
{
Heap_Block *next = block->next;
200dae4: c2 00 e0 08 ld [ %g3 + 8 ], %g1
Heap_Block *prev = block->prev;
200dae8: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
200daec: c6 06 20 38 ld [ %i0 + 0x38 ], %g3
prev->next = next;
200daf0: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
200daf4: c4 20 60 0c st %g2, [ %g1 + 0xc ]
200daf8: 82 00 ff ff add %g3, -1, %g1
200dafc: 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;
200db00: b8 07 40 1c add %i5, %i4, %i4
200db04: b4 07 00 1a add %i4, %i2, %i2
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200db08: 82 16 a0 01 or %i2, 1, %g1
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
200db0c: f4 26 c0 1a st %i2, [ %i3 + %i2 ]
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;
200db10: 10 bf ff d3 b 200da5c <_Heap_Free+0xc4>
200db14: c2 26 e0 04 st %g1, [ %i3 + 4 ]
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;
200db18: 82 17 60 01 or %i5, 1, %g1
200db1c: c2 22 20 04 st %g1, [ %o0 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200db20: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200db24: f0 22 20 0c st %i0, [ %o0 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200db28: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200db2c: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200db30: d0 20 a0 0c st %o0, [ %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;
200db34: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
200db38: fa 22 00 1d st %i5, [ %o0 + %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;
200db3c: 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 ) {
200db40: 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;
200db44: 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;
200db48: d0 26 20 08 st %o0, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200db4c: 80 a0 40 02 cmp %g1, %g2
200db50: 08 bf ff c3 bleu 200da5c <_Heap_Free+0xc4>
200db54: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200db58: 10 bf ff c1 b 200da5c <_Heap_Free+0xc4>
200db5c: 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;
200db60: 82 16 a0 01 or %i2, 1, %g1
200db64: c2 26 e0 04 st %g1, [ %i3 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200db68: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
200db6c: f4 22 00 1d st %i2, [ %o0 + %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;
200db70: 82 08 7f fe and %g1, -2, %g1
200db74: 10 bf ff ba b 200da5c <_Heap_Free+0xc4>
200db78: c2 20 e0 04 st %g1, [ %g3 + 4 ]
0202ee08 <_Heap_Get_free_information>:
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
202ee08: c2 02 20 08 ld [ %o0 + 8 ], %g1
)
{
Heap_Block *the_block;
Heap_Block *const tail = _Heap_Free_list_tail(the_heap);
info->number = 0;
202ee0c: c0 22 40 00 clr [ %o1 ]
info->largest = 0;
202ee10: c0 22 60 04 clr [ %o1 + 4 ]
info->total = 0;
202ee14: c0 22 60 08 clr [ %o1 + 8 ]
for(the_block = _Heap_Free_list_first(the_heap);
202ee18: 88 10 20 01 mov 1, %g4
202ee1c: 9a 10 20 00 clr %o5
202ee20: 80 a2 00 01 cmp %o0, %g1
202ee24: 12 80 00 04 bne 202ee34 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN
202ee28: 86 10 20 00 clr %g3
202ee2c: 30 80 00 10 b,a 202ee6c <_Heap_Get_free_information+0x64><== NOT EXECUTED
202ee30: 88 10 00 0c mov %o4, %g4
- 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;
202ee34: c4 00 60 04 ld [ %g1 + 4 ], %g2
202ee38: 98 01 20 01 add %g4, 1, %o4
202ee3c: 84 08 bf fe and %g2, -2, %g2
/* As we always coalesce free blocks, prev block must have been used. */
_HAssert(_Heap_Is_prev_used(the_block));
info->number++;
info->total += the_size;
if ( info->largest < the_size )
202ee40: 80 a0 80 0d cmp %g2, %o5
202ee44: 08 80 00 03 bleu 202ee50 <_Heap_Get_free_information+0x48>
202ee48: 86 00 c0 02 add %g3, %g2, %g3
info->largest = the_size;
202ee4c: c4 22 60 04 st %g2, [ %o1 + 4 ]
info->largest = 0;
info->total = 0;
for(the_block = _Heap_Free_list_first(the_heap);
the_block != tail;
the_block = the_block->next)
202ee50: c2 00 60 08 ld [ %g1 + 8 ], %g1
info->number = 0;
info->largest = 0;
info->total = 0;
for(the_block = _Heap_Free_list_first(the_heap);
202ee54: 80 a2 00 01 cmp %o0, %g1
202ee58: 32 bf ff f6 bne,a 202ee30 <_Heap_Get_free_information+0x28>
202ee5c: da 02 60 04 ld [ %o1 + 4 ], %o5
202ee60: c8 22 40 00 st %g4, [ %o1 ]
202ee64: 81 c3 e0 08 retl
202ee68: c6 22 60 08 st %g3, [ %o1 + 8 ]
202ee6c: 81 c3 e0 08 retl <== NOT EXECUTED
0200ae60 <_Heap_Greedy_allocate>:
Heap_Block *_Heap_Greedy_allocate(
Heap_Control *heap,
const uintptr_t *block_sizes,
size_t block_count
)
{
200ae60: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *allocated_blocks = NULL;
Heap_Block *blocks = NULL;
Heap_Block *current;
size_t i;
for (i = 0; i < block_count; ++i) {
200ae64: 80 a6 a0 00 cmp %i2, 0
200ae68: 02 80 00 35 be 200af3c <_Heap_Greedy_allocate+0xdc>
200ae6c: b8 10 00 18 mov %i0, %i4
200ae70: ba 10 20 00 clr %i5
200ae74: b6 10 20 00 clr %i3
#include "config.h"
#endif
#include <rtems/score/heap.h>
Heap_Block *_Heap_Greedy_allocate(
200ae78: 83 2f 60 02 sll %i5, 2, %g1
* @brief See _Heap_Allocate_aligned_with_boundary() with alignment and
* boundary equals zero.
*/
RTEMS_INLINE_ROUTINE void *_Heap_Allocate( Heap_Control *heap, uintptr_t size )
{
return _Heap_Allocate_aligned_with_boundary( heap, size, 0, 0 );
200ae7c: d2 06 40 01 ld [ %i1 + %g1 ], %o1
200ae80: 94 10 20 00 clr %o2
200ae84: 96 10 20 00 clr %o3
200ae88: 40 00 1d a1 call 201250c <_Heap_Allocate_aligned_with_boundary>
200ae8c: 90 10 00 1c mov %i4, %o0
size_t i;
for (i = 0; i < block_count; ++i) {
void *next = _Heap_Allocate( heap, block_sizes [i] );
if ( next != NULL ) {
200ae90: 82 92 20 00 orcc %o0, 0, %g1
200ae94: 22 80 00 09 be,a 200aeb8 <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN
200ae98: ba 07 60 01 inc %i5 <== NOT EXECUTED
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200ae9c: d2 07 20 10 ld [ %i4 + 0x10 ], %o1
200aea0: 40 00 49 d0 call 201d5e0 <.urem>
200aea4: b0 00 7f f8 add %g1, -8, %i0
uintptr_t alloc_begin,
uintptr_t page_size
)
{
return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size )
- HEAP_BLOCK_HEADER_SIZE);
200aea8: 90 26 00 08 sub %i0, %o0, %o0
Heap_Block *next_block = _Heap_Block_of_alloc_area(
(uintptr_t) next,
heap->page_size
);
next_block->next = allocated_blocks;
200aeac: f6 22 20 08 st %i3, [ %o0 + 8 ]
200aeb0: b6 10 00 08 mov %o0, %i3
Heap_Block *allocated_blocks = NULL;
Heap_Block *blocks = NULL;
Heap_Block *current;
size_t i;
for (i = 0; i < block_count; ++i) {
200aeb4: ba 07 60 01 inc %i5
200aeb8: 80 a7 40 1a cmp %i5, %i2
200aebc: 12 bf ff f0 bne 200ae7c <_Heap_Greedy_allocate+0x1c>
200aec0: 83 2f 60 02 sll %i5, 2, %g1
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200aec4: fa 07 20 08 ld [ %i4 + 8 ], %i5
next_block->next = allocated_blocks;
allocated_blocks = next_block;
}
}
while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) {
200aec8: 80 a7 00 1d cmp %i4, %i5
200aecc: 02 80 00 17 be 200af28 <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN
200aed0: b0 10 20 00 clr %i0
200aed4: 10 80 00 03 b 200aee0 <_Heap_Greedy_allocate+0x80>
200aed8: b4 10 20 00 clr %i2
200aedc: ba 10 00 01 mov %g1, %i5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200aee0: d6 07 60 04 ld [ %i5 + 4 ], %o3
_Heap_Block_allocate(
200aee4: 92 10 00 1d mov %i5, %o1
200aee8: 96 0a ff fe and %o3, -2, %o3
200aeec: 94 07 60 08 add %i5, 8, %o2
200aef0: 90 10 00 1c mov %i4, %o0
200aef4: 40 00 00 e0 call 200b274 <_Heap_Block_allocate>
200aef8: 96 02 ff f8 add %o3, -8, %o3
current,
_Heap_Alloc_area_of_block( current ),
_Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE
);
current->next = blocks;
200aefc: f4 27 60 08 st %i2, [ %i5 + 8 ]
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200af00: c2 07 20 08 ld [ %i4 + 8 ], %g1
next_block->next = allocated_blocks;
allocated_blocks = next_block;
}
}
while ( (current = _Heap_Free_list_first( heap )) != free_list_tail ) {
200af04: 80 a7 00 01 cmp %i4, %g1
200af08: 12 bf ff f5 bne 200aedc <_Heap_Greedy_allocate+0x7c>
200af0c: b4 10 00 1d mov %i5, %i2
200af10: 10 80 00 06 b 200af28 <_Heap_Greedy_allocate+0xc8>
200af14: b0 10 00 1d mov %i5, %i0
}
while ( allocated_blocks != NULL ) {
current = allocated_blocks;
allocated_blocks = allocated_blocks->next;
_Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) );
200af18: 92 06 e0 08 add %i3, 8, %o1
200af1c: 90 10 00 1c mov %i4, %o0
200af20: 40 00 1e 06 call 2012738 <_Heap_Free>
200af24: b6 10 00 1a mov %i2, %i3
current->next = blocks;
blocks = current;
}
while ( allocated_blocks != NULL ) {
200af28: 80 a6 e0 00 cmp %i3, 0
200af2c: 32 bf ff fb bne,a 200af18 <_Heap_Greedy_allocate+0xb8>
200af30: f4 06 e0 08 ld [ %i3 + 8 ], %i2
allocated_blocks = allocated_blocks->next;
_Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) );
}
return blocks;
}
200af34: 81 c7 e0 08 ret
200af38: 81 e8 00 00 restore
const uintptr_t *block_sizes,
size_t block_count
)
{
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
Heap_Block *allocated_blocks = NULL;
200af3c: 10 bf ff e2 b 200aec4 <_Heap_Greedy_allocate+0x64>
200af40: b6 10 20 00 clr %i3
0200af44 <_Heap_Greedy_free>:
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
200af44: 9d e3 bf a0 save %sp, -96, %sp
while ( blocks != NULL ) {
200af48: 80 a6 60 00 cmp %i1, 0
200af4c: 02 80 00 09 be 200af70 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN
200af50: 01 00 00 00 nop
Heap_Block *current = blocks;
blocks = blocks->next;
200af54: fa 06 60 08 ld [ %i1 + 8 ], %i5
_Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) );
200af58: 92 06 60 08 add %i1, 8, %o1
200af5c: 40 00 1d f7 call 2012738 <_Heap_Free>
200af60: 90 10 00 18 mov %i0, %o0
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
while ( blocks != NULL ) {
200af64: b2 97 60 00 orcc %i5, 0, %i1
200af68: 32 bf ff fc bne,a 200af58 <_Heap_Greedy_free+0x14>
200af6c: fa 06 60 08 ld [ %i1 + 8 ], %i5
200af70: 81 c7 e0 08 ret
200af74: 81 e8 00 00 restore
02044ca4 <_Heap_Iterate>:
void _Heap_Iterate(
Heap_Control *heap,
Heap_Block_visitor visitor,
void *visitor_arg
)
{
2044ca4: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *current = heap->first_block;
2044ca8: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
Heap_Block *end = heap->last_block;
2044cac: f8 06 20 24 ld [ %i0 + 0x24 ], %i4
bool stop = false;
while ( !stop && current != end ) {
2044cb0: 80 a0 40 1c cmp %g1, %i4
2044cb4: 32 80 00 08 bne,a 2044cd4 <_Heap_Iterate+0x30> <== ALWAYS TAKEN
2044cb8: d2 00 60 04 ld [ %g1 + 4 ], %o1
2044cbc: 30 80 00 10 b,a 2044cfc <_Heap_Iterate+0x58> <== NOT EXECUTED
2044cc0: 90 1a 20 01 xor %o0, 1, %o0
2044cc4: 80 8a 20 ff btst 0xff, %o0
2044cc8: 02 80 00 0d be 2044cfc <_Heap_Iterate+0x58> <== NEVER TAKEN
2044ccc: 01 00 00 00 nop
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2044cd0: d2 00 60 04 ld [ %g1 + 4 ], %o1
uintptr_t size = _Heap_Block_size( current );
Heap_Block *next = _Heap_Block_at( current, size );
bool used = _Heap_Is_prev_used( next );
stop = (*visitor)( current, size, used, visitor_arg );
2044cd4: 90 10 00 01 mov %g1, %o0
2044cd8: 92 0a 7f fe and %o1, -2, %o1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
2044cdc: ba 00 40 09 add %g1, %o1, %i5
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;
2044ce0: d4 07 60 04 ld [ %i5 + 4 ], %o2
2044ce4: 96 10 00 1a mov %i2, %o3
2044ce8: 9f c6 40 00 call %i1
2044cec: 94 0a a0 01 and %o2, 1, %o2
{
Heap_Block *current = heap->first_block;
Heap_Block *end = heap->last_block;
bool stop = false;
while ( !stop && current != end ) {
2044cf0: 80 a7 00 1d cmp %i4, %i5
2044cf4: 12 bf ff f3 bne 2044cc0 <_Heap_Iterate+0x1c>
2044cf8: 82 10 00 1d mov %i5, %g1
2044cfc: 81 c7 e0 08 ret
2044d00: 81 e8 00 00 restore
0200dca4 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
200dca4: 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);
200dca8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200dcac: 40 00 2b 4e call 20189e4 <.urem>
200dcb0: 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
200dcb4: 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);
200dcb8: 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);
200dcbc: 90 20 80 08 sub %g2, %o0, %o0
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200dcc0: 80 a2 00 01 cmp %o0, %g1
200dcc4: 0a 80 00 16 bcs 200dd1c <_Heap_Size_of_alloc_area+0x78>
200dcc8: 84 10 20 00 clr %g2
200dccc: c6 06 20 24 ld [ %i0 + 0x24 ], %g3
200dcd0: 80 a2 00 03 cmp %o0, %g3
200dcd4: 18 80 00 13 bgu 200dd20 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200dcd8: b0 08 a0 ff and %g2, 0xff, %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;
200dcdc: c8 02 20 04 ld [ %o0 + 4 ], %g4
200dce0: 88 09 3f fe and %g4, -2, %g4
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200dce4: 90 02 00 04 add %o0, %g4, %o0
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200dce8: 80 a0 40 08 cmp %g1, %o0
200dcec: 18 80 00 0d bgu 200dd20 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200dcf0: 01 00 00 00 nop
200dcf4: 80 a0 c0 08 cmp %g3, %o0
200dcf8: 0a 80 00 0a bcs 200dd20 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200dcfc: 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;
200dd00: c2 02 20 04 ld [ %o0 + 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 )
200dd04: 80 88 60 01 btst 1, %g1
200dd08: 02 80 00 06 be 200dd20 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200dd0c: 90 22 00 19 sub %o0, %i1, %o0
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
200dd10: 84 10 20 01 mov 1, %g2
|| !_Heap_Is_prev_used( next_block )
) {
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
200dd14: 90 02 20 04 add %o0, 4, %o0
200dd18: d0 26 80 00 st %o0, [ %i2 ]
200dd1c: b0 08 a0 ff and %g2, 0xff, %i0
200dd20: 81 c7 e0 08 ret
200dd24: 81 e8 00 00 restore
02009ee8 <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
2009ee8: 9d e3 bf 80 save %sp, -128, %sp
uintptr_t const page_size = heap->page_size;
2009eec: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
uintptr_t const min_block_size = heap->min_block_size;
2009ef0: e0 06 20 14 ld [ %i0 + 0x14 ], %l0
Heap_Block *const first_block = heap->first_block;
2009ef4: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
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;
2009ef8: 80 a6 a0 00 cmp %i2, 0
2009efc: 02 80 00 0c be 2009f2c <_Heap_Walk+0x44>
2009f00: e2 06 20 24 ld [ %i0 + 0x24 ], %l1
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2009f04: 03 00 80 7e sethi %hi(0x201f800), %g1
2009f08: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 201f860 <_System_state_Current>
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;
2009f0c: 07 00 80 27 sethi %hi(0x2009c00), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
2009f10: 82 10 20 01 mov 1, %g1
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;
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2009f14: 80 a0 a0 03 cmp %g2, 3
2009f18: 02 80 00 0c be 2009f48 <_Heap_Walk+0x60> <== ALWAYS TAKEN
2009f1c: ae 10 e2 84 or %g3, 0x284, %l7
2009f20: b0 08 60 ff and %g1, 0xff, %i0
2009f24: 81 c7 e0 08 ret
2009f28: 81 e8 00 00 restore
2009f2c: 03 00 80 7e sethi %hi(0x201f800), %g1
2009f30: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 201f860 <_System_state_Current>
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;
2009f34: 07 00 80 27 sethi %hi(0x2009c00), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
2009f38: 82 10 20 01 mov 1, %g1
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;
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2009f3c: 80 a0 a0 03 cmp %g2, 3
2009f40: 12 bf ff f8 bne 2009f20 <_Heap_Walk+0x38>
2009f44: ae 10 e2 7c or %g3, 0x27c, %l7
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)(
2009f48: da 06 20 18 ld [ %i0 + 0x18 ], %o5
2009f4c: c8 06 20 1c ld [ %i0 + 0x1c ], %g4
2009f50: c4 06 20 08 ld [ %i0 + 8 ], %g2
2009f54: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2009f58: 90 10 00 19 mov %i1, %o0
2009f5c: c8 23 a0 5c st %g4, [ %sp + 0x5c ]
2009f60: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
2009f64: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
2009f68: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
2009f6c: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2009f70: 92 10 20 00 clr %o1
2009f74: 96 10 00 1b mov %i3, %o3
2009f78: 15 00 80 70 sethi %hi(0x201c000), %o2
2009f7c: 98 10 00 10 mov %l0, %o4
2009f80: 9f c5 c0 00 call %l7
2009f84: 94 12 a3 80 or %o2, 0x380, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
2009f88: 80 a6 e0 00 cmp %i3, 0
2009f8c: 02 80 00 2a be 200a034 <_Heap_Walk+0x14c>
2009f90: 80 8e e0 07 btst 7, %i3
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
2009f94: 12 80 00 2f bne 200a050 <_Heap_Walk+0x168>
2009f98: 90 10 00 10 mov %l0, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2009f9c: 7f ff de f5 call 2001b70 <.urem>
2009fa0: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
2009fa4: 80 a2 20 00 cmp %o0, 0
2009fa8: 12 80 00 32 bne 200a070 <_Heap_Walk+0x188>
2009fac: 90 07 20 08 add %i4, 8, %o0
2009fb0: 7f ff de f0 call 2001b70 <.urem>
2009fb4: 92 10 00 1b mov %i3, %o1
);
return false;
}
if (
2009fb8: 80 a2 20 00 cmp %o0, 0
2009fbc: 32 80 00 35 bne,a 200a090 <_Heap_Walk+0x1a8>
2009fc0: 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;
2009fc4: ec 07 20 04 ld [ %i4 + 4 ], %l6
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2009fc8: b4 8d a0 01 andcc %l6, 1, %i2
2009fcc: 22 80 00 38 be,a 200a0ac <_Heap_Walk+0x1c4>
2009fd0: 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;
2009fd4: c2 04 60 04 ld [ %l1 + 4 ], %g1
2009fd8: 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);
2009fdc: 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;
2009fe0: fa 00 60 04 ld [ %g1 + 4 ], %i5
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
2009fe4: 80 8f 60 01 btst 1, %i5
2009fe8: 02 80 00 0c be 200a018 <_Heap_Walk+0x130>
2009fec: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
2009ff0: 02 80 00 35 be 200a0c4 <_Heap_Walk+0x1dc>
2009ff4: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
2009ff8: 92 10 20 01 mov 1, %o1
2009ffc: 15 00 80 71 sethi %hi(0x201c400), %o2
200a000: 9f c5 c0 00 call %l7
200a004: 94 12 a0 f8 or %o2, 0xf8, %o2 ! 201c4f8 <__log2table+0x2d8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a008: 82 10 20 00 clr %g1
200a00c: b0 08 60 ff and %g1, 0xff, %i0
200a010: 81 c7 e0 08 ret
200a014: 81 e8 00 00 restore
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
200a018: 90 10 00 19 mov %i1, %o0
200a01c: 92 10 20 01 mov 1, %o1
200a020: 15 00 80 71 sethi %hi(0x201c400), %o2
200a024: 9f c5 c0 00 call %l7
200a028: 94 12 a0 e0 or %o2, 0xe0, %o2 ! 201c4e0 <__log2table+0x2c0>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a02c: 10 bf ff f8 b 200a00c <_Heap_Walk+0x124>
200a030: 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" );
200a034: 90 10 00 19 mov %i1, %o0
200a038: 92 10 20 01 mov 1, %o1
200a03c: 15 00 80 71 sethi %hi(0x201c400), %o2
200a040: 9f c5 c0 00 call %l7
200a044: 94 12 a0 18 or %o2, 0x18, %o2 ! 201c418 <__log2table+0x1f8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a048: 10 bf ff f1 b 200a00c <_Heap_Walk+0x124>
200a04c: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
200a050: 90 10 00 19 mov %i1, %o0
200a054: 92 10 20 01 mov 1, %o1
200a058: 15 00 80 71 sethi %hi(0x201c400), %o2
200a05c: 96 10 00 1b mov %i3, %o3
200a060: 9f c5 c0 00 call %l7
200a064: 94 12 a0 30 or %o2, 0x30, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a068: 10 bf ff e9 b 200a00c <_Heap_Walk+0x124>
200a06c: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
200a070: 90 10 00 19 mov %i1, %o0
200a074: 92 10 20 01 mov 1, %o1
200a078: 15 00 80 71 sethi %hi(0x201c400), %o2
200a07c: 96 10 00 10 mov %l0, %o3
200a080: 9f c5 c0 00 call %l7
200a084: 94 12 a0 50 or %o2, 0x50, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a088: 10 bf ff e1 b 200a00c <_Heap_Walk+0x124>
200a08c: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
200a090: 92 10 20 01 mov 1, %o1
200a094: 15 00 80 71 sethi %hi(0x201c400), %o2
200a098: 96 10 00 1c mov %i4, %o3
200a09c: 9f c5 c0 00 call %l7
200a0a0: 94 12 a0 78 or %o2, 0x78, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a0a4: 10 bf ff da b 200a00c <_Heap_Walk+0x124>
200a0a8: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
200a0ac: 92 10 20 01 mov 1, %o1
200a0b0: 15 00 80 71 sethi %hi(0x201c400), %o2
200a0b4: 9f c5 c0 00 call %l7
200a0b8: 94 12 a0 b0 or %o2, 0xb0, %o2 ! 201c4b0 <__log2table+0x290>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a0bc: 10 bf ff d4 b 200a00c <_Heap_Walk+0x124>
200a0c0: 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;
200a0c4: fa 06 20 08 ld [ %i0 + 8 ], %i5
int source,
Heap_Walk_printer printer,
Heap_Control *heap
)
{
uintptr_t const page_size = heap->page_size;
200a0c8: e8 06 20 10 ld [ %i0 + 0x10 ], %l4
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 ) {
200a0cc: 80 a6 00 1d cmp %i0, %i5
200a0d0: 02 80 00 0d be 200a104 <_Heap_Walk+0x21c>
200a0d4: da 06 20 20 ld [ %i0 + 0x20 ], %o5
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200a0d8: 80 a3 40 1d cmp %o5, %i5
200a0dc: 28 80 00 bf bleu,a 200a3d8 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN
200a0e0: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
200a0e4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
200a0e8: 92 10 20 01 mov 1, %o1
200a0ec: 15 00 80 71 sethi %hi(0x201c400), %o2
200a0f0: 96 10 00 1d mov %i5, %o3
200a0f4: 9f c5 c0 00 call %l7
200a0f8: 94 12 a1 28 or %o2, 0x128, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a0fc: 10 bf ff c4 b 200a00c <_Heap_Walk+0x124>
200a100: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200a104: 27 00 80 71 sethi %hi(0x201c400), %l3
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
200a108: 25 00 80 71 sethi %hi(0x201c400), %l2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
200a10c: aa 10 00 1c mov %i4, %l5
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200a110: a6 14 e3 58 or %l3, 0x358, %l3
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
200a114: a4 14 a3 40 or %l2, 0x340, %l2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
200a118: 29 00 80 71 sethi %hi(0x201c400), %l4
- 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;
200a11c: ac 0d bf fe and %l6, -2, %l6
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200a120: ba 05 80 15 add %l6, %l5, %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;
200a124: 80 a3 40 1d cmp %o5, %i5
200a128: 28 80 00 0b bleu,a 200a154 <_Heap_Walk+0x26c> <== ALWAYS TAKEN
200a12c: de 06 20 24 ld [ %i0 + 0x24 ], %o7
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)(
200a130: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
200a134: 92 10 20 01 mov 1, %o1
200a138: 96 10 00 15 mov %l5, %o3
200a13c: 15 00 80 71 sethi %hi(0x201c400), %o2
200a140: 98 10 00 1d mov %i5, %o4
200a144: 9f c5 c0 00 call %l7
200a148: 94 12 a1 d0 or %o2, 0x1d0, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
200a14c: 10 bf ff 75 b 2009f20 <_Heap_Walk+0x38>
200a150: 82 10 20 00 clr %g1
200a154: 80 a3 c0 1d cmp %o7, %i5
200a158: 0a bf ff f7 bcs 200a134 <_Heap_Walk+0x24c>
200a15c: 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;
200a160: 9e 1d 40 11 xor %l5, %l1, %o7
200a164: 80 a0 00 0f cmp %g0, %o7
200a168: 9a 40 20 00 addx %g0, 0, %o5
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200a16c: 90 10 00 16 mov %l6, %o0
200a170: da 27 bf fc st %o5, [ %fp + -4 ]
200a174: 7f ff de 7f call 2001b70 <.urem>
200a178: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
200a17c: 80 a2 20 00 cmp %o0, 0
200a180: 02 80 00 18 be 200a1e0 <_Heap_Walk+0x2f8>
200a184: da 07 bf fc ld [ %fp + -4 ], %o5
200a188: 80 8b 60 ff btst 0xff, %o5
200a18c: 12 80 00 8b bne 200a3b8 <_Heap_Walk+0x4d0>
200a190: 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;
200a194: de 07 60 04 ld [ %i5 + 4 ], %o7
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
200a198: 80 8b e0 01 btst 1, %o7
200a19c: 02 80 00 2b be 200a248 <_Heap_Walk+0x360>
200a1a0: 80 a6 a0 00 cmp %i2, 0
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
200a1a4: 22 80 00 21 be,a 200a228 <_Heap_Walk+0x340>
200a1a8: da 05 40 00 ld [ %l5 ], %o5
(*printer)(
200a1ac: 90 10 00 19 mov %i1, %o0
200a1b0: 92 10 20 00 clr %o1
200a1b4: 94 10 00 12 mov %l2, %o2
200a1b8: 96 10 00 15 mov %l5, %o3
200a1bc: 9f c5 c0 00 call %l7
200a1c0: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
200a1c4: 80 a7 00 1d cmp %i4, %i5
200a1c8: 02 80 00 51 be 200a30c <_Heap_Walk+0x424>
200a1cc: aa 10 00 1d mov %i5, %l5
200a1d0: ec 07 60 04 ld [ %i5 + 4 ], %l6
200a1d4: da 06 20 20 ld [ %i0 + 0x20 ], %o5
200a1d8: 10 bf ff d1 b 200a11c <_Heap_Walk+0x234>
200a1dc: b4 0d a0 01 and %l6, 1, %i2
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200a1e0: 80 a5 80 10 cmp %l6, %l0
200a1e4: 0a 80 00 69 bcs 200a388 <_Heap_Walk+0x4a0>
200a1e8: 80 8b 60 ff btst 0xff, %o5
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
200a1ec: 80 a5 40 1d cmp %l5, %i5
200a1f0: 2a bf ff ea bcs,a 200a198 <_Heap_Walk+0x2b0>
200a1f4: de 07 60 04 ld [ %i5 + 4 ], %o7
200a1f8: 80 8b 60 ff btst 0xff, %o5
200a1fc: 22 bf ff e7 be,a 200a198 <_Heap_Walk+0x2b0>
200a200: de 07 60 04 ld [ %i5 + 4 ], %o7
(*printer)(
200a204: 90 10 00 19 mov %i1, %o0
200a208: 92 10 20 01 mov 1, %o1
200a20c: 96 10 00 15 mov %l5, %o3
200a210: 15 00 80 71 sethi %hi(0x201c400), %o2
200a214: 98 10 00 1d mov %i5, %o4
200a218: 9f c5 c0 00 call %l7
200a21c: 94 12 a2 60 or %o2, 0x260, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
200a220: 10 bf ff 40 b 2009f20 <_Heap_Walk+0x38>
200a224: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200a228: 96 10 00 15 mov %l5, %o3
200a22c: 90 10 00 19 mov %i1, %o0
200a230: 92 10 20 00 clr %o1
200a234: 94 10 00 13 mov %l3, %o2
200a238: 9f c5 c0 00 call %l7
200a23c: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
200a240: 10 bf ff e2 b 200a1c8 <_Heap_Walk+0x2e0>
200a244: 80 a7 00 1d cmp %i4, %i5
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 ?
200a248: da 05 60 0c ld [ %l5 + 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)(
200a24c: de 06 20 08 ld [ %i0 + 8 ], %o7
200a250: 80 a3 c0 0d cmp %o7, %o5
200a254: 02 80 00 3d be 200a348 <_Heap_Walk+0x460>
200a258: d8 06 20 0c ld [ %i0 + 0xc ], %o4
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
200a25c: 80 a6 00 0d cmp %i0, %o5
200a260: 02 80 00 40 be 200a360 <_Heap_Walk+0x478>
200a264: 96 15 23 08 or %l4, 0x308, %o3
block->next,
block->next == last_free_block ?
200a268: de 05 60 08 ld [ %l5 + 8 ], %o7
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)(
200a26c: 80 a3 00 0f cmp %o4, %o7
200a270: 02 80 00 33 be 200a33c <_Heap_Walk+0x454>
200a274: 80 a6 00 0f cmp %i0, %o7
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
200a278: 02 80 00 37 be 200a354 <_Heap_Walk+0x46c>
200a27c: 98 15 23 08 or %l4, 0x308, %o4
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)(
200a280: d6 23 a0 5c st %o3, [ %sp + 0x5c ]
200a284: d8 23 a0 64 st %o4, [ %sp + 0x64 ]
200a288: de 23 a0 60 st %o7, [ %sp + 0x60 ]
200a28c: 90 10 00 19 mov %i1, %o0
200a290: 92 10 20 00 clr %o1
200a294: 15 00 80 71 sethi %hi(0x201c400), %o2
200a298: 96 10 00 15 mov %l5, %o3
200a29c: 94 12 a2 98 or %o2, 0x298, %o2
200a2a0: 9f c5 c0 00 call %l7
200a2a4: 98 10 00 16 mov %l6, %o4
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
200a2a8: da 07 40 00 ld [ %i5 ], %o5
200a2ac: 80 a5 80 0d cmp %l6, %o5
200a2b0: 12 80 00 19 bne 200a314 <_Heap_Walk+0x42c>
200a2b4: 80 a6 a0 00 cmp %i2, 0
);
return false;
}
if ( !prev_used ) {
200a2b8: 02 80 00 2d be 200a36c <_Heap_Walk+0x484>
200a2bc: 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;
200a2c0: c4 06 20 08 ld [ %i0 + 8 ], %g2
)
{
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 ) {
200a2c4: 80 a6 00 02 cmp %i0, %g2
200a2c8: 02 80 00 0b be 200a2f4 <_Heap_Walk+0x40c> <== NEVER TAKEN
200a2cc: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
200a2d0: 80 a5 40 02 cmp %l5, %g2
200a2d4: 02 bf ff bd be 200a1c8 <_Heap_Walk+0x2e0>
200a2d8: 80 a7 00 1d cmp %i4, %i5
return true;
}
free_block = free_block->next;
200a2dc: c4 00 a0 08 ld [ %g2 + 8 ], %g2
)
{
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 ) {
200a2e0: 80 a6 00 02 cmp %i0, %g2
200a2e4: 12 bf ff fc bne 200a2d4 <_Heap_Walk+0x3ec>
200a2e8: 80 a5 40 02 cmp %l5, %g2
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
200a2ec: 90 10 00 19 mov %i1, %o0
200a2f0: 92 10 20 01 mov 1, %o1
200a2f4: 15 00 80 71 sethi %hi(0x201c400), %o2
200a2f8: 96 10 00 15 mov %l5, %o3
200a2fc: 9f c5 c0 00 call %l7
200a300: 94 12 a3 80 or %o2, 0x380, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a304: 10 bf ff 42 b 200a00c <_Heap_Walk+0x124>
200a308: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
200a30c: 10 bf ff 05 b 2009f20 <_Heap_Walk+0x38>
200a310: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
200a314: fa 23 a0 5c st %i5, [ %sp + 0x5c ]
200a318: 90 10 00 19 mov %i1, %o0
200a31c: 92 10 20 01 mov 1, %o1
200a320: 15 00 80 71 sethi %hi(0x201c400), %o2
200a324: 96 10 00 15 mov %l5, %o3
200a328: 94 12 a2 d0 or %o2, 0x2d0, %o2
200a32c: 9f c5 c0 00 call %l7
200a330: 98 10 00 16 mov %l6, %o4
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a334: 10 bf ff 36 b 200a00c <_Heap_Walk+0x124>
200a338: 82 10 20 00 clr %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)(
200a33c: 03 00 80 70 sethi %hi(0x201c000), %g1
200a340: 10 bf ff d0 b 200a280 <_Heap_Walk+0x398>
200a344: 98 10 63 60 or %g1, 0x360, %o4 ! 201c360 <__log2table+0x140>
200a348: 03 00 80 70 sethi %hi(0x201c000), %g1
200a34c: 10 bf ff c7 b 200a268 <_Heap_Walk+0x380>
200a350: 96 10 63 40 or %g1, 0x340, %o3 ! 201c340 <__log2table+0x120>
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
200a354: 03 00 80 70 sethi %hi(0x201c000), %g1
200a358: 10 bf ff ca b 200a280 <_Heap_Walk+0x398>
200a35c: 98 10 63 70 or %g1, 0x370, %o4 ! 201c370 <__log2table+0x150>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
200a360: 17 00 80 70 sethi %hi(0x201c000), %o3
200a364: 10 bf ff c1 b 200a268 <_Heap_Walk+0x380>
200a368: 96 12 e3 50 or %o3, 0x350, %o3 ! 201c350 <__log2table+0x130>
return false;
}
if ( !prev_used ) {
(*printer)(
200a36c: 92 10 20 01 mov 1, %o1
200a370: 15 00 80 71 sethi %hi(0x201c400), %o2
200a374: 96 10 00 15 mov %l5, %o3
200a378: 9f c5 c0 00 call %l7
200a37c: 94 12 a3 10 or %o2, 0x310, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a380: 10 bf ff 23 b 200a00c <_Heap_Walk+0x124>
200a384: 82 10 20 00 clr %g1
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200a388: 02 bf ff 9a be 200a1f0 <_Heap_Walk+0x308> <== NEVER TAKEN
200a38c: 80 a5 40 1d cmp %l5, %i5
(*printer)(
200a390: 90 10 00 19 mov %i1, %o0
200a394: 92 10 20 01 mov 1, %o1
200a398: 96 10 00 15 mov %l5, %o3
200a39c: 15 00 80 71 sethi %hi(0x201c400), %o2
200a3a0: 98 10 00 16 mov %l6, %o4
200a3a4: 94 12 a2 30 or %o2, 0x230, %o2
200a3a8: 9f c5 c0 00 call %l7
200a3ac: 9a 10 00 10 mov %l0, %o5
block,
block_size,
min_block_size
);
return false;
200a3b0: 10 bf fe dc b 2009f20 <_Heap_Walk+0x38>
200a3b4: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
200a3b8: 92 10 20 01 mov 1, %o1
200a3bc: 96 10 00 15 mov %l5, %o3
200a3c0: 15 00 80 71 sethi %hi(0x201c400), %o2
200a3c4: 98 10 00 16 mov %l6, %o4
200a3c8: 9f c5 c0 00 call %l7
200a3cc: 94 12 a2 00 or %o2, 0x200, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
200a3d0: 10 bf fe d4 b 2009f20 <_Heap_Walk+0x38>
200a3d4: 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;
200a3d8: 80 a4 c0 1d cmp %l3, %i5
200a3dc: 0a bf ff 43 bcs 200a0e8 <_Heap_Walk+0x200> <== NEVER TAKEN
200a3e0: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200a3e4: da 27 bf fc st %o5, [ %fp + -4 ]
200a3e8: 90 07 60 08 add %i5, 8, %o0
200a3ec: 7f ff dd e1 call 2001b70 <.urem>
200a3f0: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
200a3f4: 80 a2 20 00 cmp %o0, 0
200a3f8: 12 80 00 36 bne 200a4d0 <_Heap_Walk+0x5e8> <== NEVER TAKEN
200a3fc: da 07 bf fc ld [ %fp + -4 ], %o5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200a400: c2 07 60 04 ld [ %i5 + 4 ], %g1
200a404: 82 08 7f fe and %g1, -2, %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;
200a408: 82 07 40 01 add %i5, %g1, %g1
200a40c: c2 00 60 04 ld [ %g1 + 4 ], %g1
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
200a410: 80 88 60 01 btst 1, %g1
200a414: 12 80 00 27 bne 200a4b0 <_Heap_Walk+0x5c8> <== NEVER TAKEN
200a418: a4 10 00 1d mov %i5, %l2
200a41c: 10 80 00 19 b 200a480 <_Heap_Walk+0x598>
200a420: 82 10 00 18 mov %i0, %g1
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 ) {
200a424: 80 a6 00 1d cmp %i0, %i5
200a428: 02 bf ff 37 be 200a104 <_Heap_Walk+0x21c>
200a42c: 80 a7 40 0d cmp %i5, %o5
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200a430: 0a bf ff 2e bcs 200a0e8 <_Heap_Walk+0x200>
200a434: 90 10 00 19 mov %i1, %o0
200a438: 80 a7 40 13 cmp %i5, %l3
200a43c: 18 bf ff 2c bgu 200a0ec <_Heap_Walk+0x204> <== NEVER TAKEN
200a440: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200a444: da 27 bf fc st %o5, [ %fp + -4 ]
200a448: 90 07 60 08 add %i5, 8, %o0
200a44c: 7f ff dd c9 call 2001b70 <.urem>
200a450: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
200a454: 80 a2 20 00 cmp %o0, 0
200a458: 12 80 00 1e bne 200a4d0 <_Heap_Walk+0x5e8>
200a45c: da 07 bf fc ld [ %fp + -4 ], %o5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200a460: de 07 60 04 ld [ %i5 + 4 ], %o7
200a464: 82 10 00 12 mov %l2, %g1
200a468: 9e 0b ff fe and %o7, -2, %o7
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;
200a46c: 9e 03 c0 1d add %o7, %i5, %o7
200a470: de 03 e0 04 ld [ %o7 + 4 ], %o7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
200a474: 80 8b e0 01 btst 1, %o7
200a478: 12 80 00 0e bne 200a4b0 <_Heap_Walk+0x5c8>
200a47c: a4 10 00 1d mov %i5, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
200a480: d8 07 60 0c ld [ %i5 + 0xc ], %o4
200a484: 80 a3 00 01 cmp %o4, %g1
200a488: 22 bf ff e7 be,a 200a424 <_Heap_Walk+0x53c>
200a48c: fa 07 60 08 ld [ %i5 + 8 ], %i5
(*printer)(
200a490: 90 10 00 19 mov %i1, %o0
200a494: 92 10 20 01 mov 1, %o1
200a498: 15 00 80 71 sethi %hi(0x201c400), %o2
200a49c: 96 10 00 1d mov %i5, %o3
200a4a0: 9f c5 c0 00 call %l7
200a4a4: 94 12 a1 98 or %o2, 0x198, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a4a8: 10 bf fe d9 b 200a00c <_Heap_Walk+0x124>
200a4ac: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
200a4b0: 90 10 00 19 mov %i1, %o0
200a4b4: 92 10 20 01 mov 1, %o1
200a4b8: 15 00 80 71 sethi %hi(0x201c400), %o2
200a4bc: 96 10 00 1d mov %i5, %o3
200a4c0: 9f c5 c0 00 call %l7
200a4c4: 94 12 a1 78 or %o2, 0x178, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a4c8: 10 bf fe d1 b 200a00c <_Heap_Walk+0x124>
200a4cc: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
200a4d0: 90 10 00 19 mov %i1, %o0
200a4d4: 92 10 20 01 mov 1, %o1
200a4d8: 15 00 80 71 sethi %hi(0x201c400), %o2
200a4dc: 96 10 00 1d mov %i5, %o3
200a4e0: 9f c5 c0 00 call %l7
200a4e4: 94 12 a1 48 or %o2, 0x148, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a4e8: 10 bf fe c9 b 200a00c <_Heap_Walk+0x124>
200a4ec: 82 10 20 00 clr %g1
020085c0 <_IO_Initialize_all_drivers>:
*
* Output Parameters: NONE
*/
void _IO_Initialize_all_drivers( void )
{
20085c0: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
20085c4: 39 00 80 75 sethi %hi(0x201d400), %i4
20085c8: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1 ! 201d4d4 <_IO_Number_of_drivers>
20085cc: ba 10 20 00 clr %i5
20085d0: 80 a0 60 00 cmp %g1, 0
20085d4: 02 80 00 0b be 2008600 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
20085d8: b8 17 20 d4 or %i4, 0xd4, %i4
(void) rtems_io_initialize( major, 0, NULL );
20085dc: 90 10 00 1d mov %i5, %o0
20085e0: 92 10 20 00 clr %o1
20085e4: 40 00 13 df call 200d560 <rtems_io_initialize>
20085e8: 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 ++ )
20085ec: c2 07 00 00 ld [ %i4 ], %g1
20085f0: ba 07 60 01 inc %i5
20085f4: 80 a0 40 1d cmp %g1, %i5
20085f8: 18 bf ff fa bgu 20085e0 <_IO_Initialize_all_drivers+0x20>
20085fc: 90 10 00 1d mov %i5, %o0
2008600: 81 c7 e0 08 ret
2008604: 81 e8 00 00 restore
020084f0 <_IO_Manager_initialization>:
* workspace.
*
*/
void _IO_Manager_initialization(void)
{
20084f0: 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;
20084f4: 03 00 80 71 sethi %hi(0x201c400), %g1
20084f8: 82 10 60 ac or %g1, 0xac, %g1 ! 201c4ac <Configuration>
drivers_in_table = Configuration.number_of_device_drivers;
20084fc: f8 00 60 3c ld [ %g1 + 0x3c ], %i4
number_of_drivers = Configuration.maximum_drivers;
2008500: f6 00 60 38 ld [ %g1 + 0x38 ], %i3
/*
* 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 )
2008504: 80 a7 00 1b cmp %i4, %i3
2008508: 0a 80 00 08 bcs 2008528 <_IO_Manager_initialization+0x38>
200850c: fa 00 60 40 ld [ %g1 + 0x40 ], %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;
2008510: 03 00 80 75 sethi %hi(0x201d400), %g1
2008514: fa 20 60 d8 st %i5, [ %g1 + 0xd8 ] ! 201d4d8 <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
2008518: 03 00 80 75 sethi %hi(0x201d400), %g1
200851c: f8 20 60 d4 st %i4, [ %g1 + 0xd4 ] ! 201d4d4 <_IO_Number_of_drivers>
return;
2008520: 81 c7 e0 08 ret
2008524: 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 )
2008528: 83 2e e0 03 sll %i3, 3, %g1
200852c: b5 2e e0 05 sll %i3, 5, %i2
2008530: 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(
2008534: 40 00 0d 28 call 200b9d4 <_Workspace_Allocate_or_fatal_error>
2008538: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
200853c: 03 00 80 75 sethi %hi(0x201d400), %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 *)
2008540: 33 00 80 75 sethi %hi(0x201d400), %i1
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
2008544: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ]
/*
* 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 *)
2008548: d0 26 60 d8 st %o0, [ %i1 + 0xd8 ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
200854c: 92 10 20 00 clr %o1
2008550: 40 00 1f 7f call 201034c <memset>
2008554: 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++ )
2008558: 80 a7 20 00 cmp %i4, 0
200855c: 02 bf ff f1 be 2008520 <_IO_Manager_initialization+0x30> <== NEVER TAKEN
2008560: c8 06 60 d8 ld [ %i1 + 0xd8 ], %g4
* registration. The driver table is now allocated in the
* workspace.
*
*/
void _IO_Manager_initialization(void)
2008564: 85 2f 20 03 sll %i4, 3, %g2
2008568: b7 2f 20 05 sll %i4, 5, %i3
200856c: 82 10 20 00 clr %g1
2008570: b6 26 c0 02 sub %i3, %g2, %i3
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
_IO_Driver_address_table[index] = driver_table[index];
2008574: c4 07 40 01 ld [ %i5 + %g1 ], %g2
2008578: 86 07 40 01 add %i5, %g1, %g3
200857c: c4 21 00 01 st %g2, [ %g4 + %g1 ]
2008580: f8 00 e0 04 ld [ %g3 + 4 ], %i4
2008584: 84 01 00 01 add %g4, %g1, %g2
2008588: f8 20 a0 04 st %i4, [ %g2 + 4 ]
200858c: f8 00 e0 08 ld [ %g3 + 8 ], %i4
2008590: 82 00 60 18 add %g1, 0x18, %g1
2008594: f8 20 a0 08 st %i4, [ %g2 + 8 ]
2008598: f8 00 e0 0c ld [ %g3 + 0xc ], %i4
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
200859c: 80 a0 40 1b cmp %g1, %i3
_IO_Driver_address_table[index] = driver_table[index];
20085a0: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
20085a4: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4
20085a8: f8 20 a0 10 st %i4, [ %g2 + 0x10 ]
20085ac: 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++ )
20085b0: 12 bf ff f1 bne 2008574 <_IO_Manager_initialization+0x84>
20085b4: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
20085b8: 81 c7 e0 08 ret
20085bc: 81 e8 00 00 restore
020092fc <_Objects_Allocate>:
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
20092fc: 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 )
2009300: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2009304: 80 a0 60 00 cmp %g1, 0
2009308: 02 80 00 26 be 20093a0 <_Objects_Allocate+0xa4> <== NEVER TAKEN
200930c: ba 10 00 18 mov %i0, %i5
/*
* 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 );
2009310: b8 06 20 20 add %i0, 0x20, %i4
2009314: 7f ff fd 4b call 2008840 <_Chain_Get>
2009318: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
200931c: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
2009320: 80 a0 60 00 cmp %g1, 0
2009324: 02 80 00 16 be 200937c <_Objects_Allocate+0x80>
2009328: 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 ) {
200932c: 80 a2 20 00 cmp %o0, 0
2009330: 02 80 00 15 be 2009384 <_Objects_Allocate+0x88>
2009334: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
2009338: c4 07 60 08 ld [ %i5 + 8 ], %g2
200933c: d0 06 20 08 ld [ %i0 + 8 ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
2009340: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
2009344: 03 00 00 3f sethi %hi(0xfc00), %g1
2009348: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff <PROM_START+0xffff>
200934c: 90 0a 00 01 and %o0, %g1, %o0
2009350: 82 08 80 01 and %g2, %g1, %g1
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
2009354: 40 00 3c f8 call 2018734 <.udiv>
2009358: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
200935c: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
2009360: 91 2a 20 02 sll %o0, 2, %o0
2009364: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
2009368: 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 ]--;
200936c: 86 00 ff ff add %g3, -1, %g3
2009370: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
2009374: 82 00 bf ff add %g2, -1, %g1
2009378: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
200937c: 81 c7 e0 08 ret
2009380: 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 );
2009384: 40 00 00 10 call 20093c4 <_Objects_Extend_information>
2009388: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
200938c: 7f ff fd 2d call 2008840 <_Chain_Get>
2009390: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
2009394: b0 92 20 00 orcc %o0, 0, %i0
2009398: 32 bf ff e9 bne,a 200933c <_Objects_Allocate+0x40>
200939c: c4 07 60 08 ld [ %i5 + 8 ], %g2
* 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 )
return NULL;
20093a0: 81 c7 e0 08 ret
20093a4: 91 e8 20 00 restore %g0, 0, %o0
020093c4 <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
20093c4: 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 )
20093c8: f4 06 20 34 ld [ %i0 + 0x34 ], %i2
/*
* 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 );
20093cc: e2 16 20 0a lduh [ %i0 + 0xa ], %l1
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
20093d0: 80 a6 a0 00 cmp %i2, 0
20093d4: 02 80 00 a5 be 2009668 <_Objects_Extend_information+0x2a4>
20093d8: e0 16 20 10 lduh [ %i0 + 0x10 ], %l0
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
20093dc: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
20093e0: a1 2c 20 10 sll %l0, 0x10, %l0
20093e4: 92 10 00 1b mov %i3, %o1
20093e8: 40 00 3c d3 call 2018734 <.udiv>
20093ec: 91 34 20 10 srl %l0, 0x10, %o0
20093f0: 91 2a 20 10 sll %o0, 0x10, %o0
20093f4: b3 32 20 10 srl %o0, 0x10, %i1
for ( ; block < block_count; block++ ) {
20093f8: 80 a6 60 00 cmp %i1, 0
20093fc: 02 80 00 a2 be 2009684 <_Objects_Extend_information+0x2c0><== NEVER TAKEN
2009400: 90 10 00 1b mov %i3, %o0
if ( information->object_blocks[ block ] == NULL ) {
2009404: c2 06 80 00 ld [ %i2 ], %g1
2009408: 80 a0 60 00 cmp %g1, 0
200940c: 02 80 00 a2 be 2009694 <_Objects_Extend_information+0x2d0><== NEVER TAKEN
2009410: b8 10 00 11 mov %l1, %i4
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2009414: 10 80 00 06 b 200942c <_Objects_Extend_information+0x68>
2009418: ba 10 20 00 clr %i5
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
200941c: c2 06 80 01 ld [ %i2 + %g1 ], %g1
2009420: 80 a0 60 00 cmp %g1, 0
2009424: 22 80 00 08 be,a 2009444 <_Objects_Extend_information+0x80>
2009428: b6 10 20 00 clr %i3
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
200942c: ba 07 60 01 inc %i5
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
2009430: b8 07 00 1b add %i4, %i3, %i4
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
2009434: 80 a6 40 1d cmp %i1, %i5
2009438: 18 bf ff f9 bgu 200941c <_Objects_Extend_information+0x58>
200943c: 83 2f 60 02 sll %i5, 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;
2009440: b6 10 20 01 mov 1, %i3
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
2009444: a1 34 20 10 srl %l0, 0x10, %l0
/*
* 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 ) {
2009448: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
200944c: a0 04 00 08 add %l0, %o0, %l0
/*
* 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 ) {
2009450: 82 10 63 ff or %g1, 0x3ff, %g1
2009454: 80 a4 00 01 cmp %l0, %g1
2009458: 18 80 00 94 bgu 20096a8 <_Objects_Extend_information+0x2e4>
200945c: 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;
2009460: 40 00 3c 7b call 201864c <.umul>
2009464: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
2009468: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
200946c: 80 a0 60 00 cmp %g1, 0
2009470: 02 80 00 6a be 2009618 <_Objects_Extend_information+0x254>
2009474: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
2009478: 40 00 09 49 call 200b99c <_Workspace_Allocate>
200947c: 01 00 00 00 nop
if ( !new_object_block )
2009480: b4 92 20 00 orcc %o0, 0, %i2
2009484: 02 80 00 89 be 20096a8 <_Objects_Extend_information+0x2e4>
2009488: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
200948c: 80 8e e0 ff btst 0xff, %i3
2009490: 22 80 00 3f be,a 200958c <_Objects_Extend_information+0x1c8>
2009494: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
2009498: b6 06 60 01 add %i1, 1, %i3
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
200949c: 91 2e e0 01 sll %i3, 1, %o0
20094a0: 90 02 00 1b add %o0, %i3, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
20094a4: 90 04 00 08 add %l0, %o0, %o0
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
20094a8: 90 02 00 11 add %o0, %l1, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
20094ac: 40 00 09 3c call 200b99c <_Workspace_Allocate>
20094b0: 91 2a 20 02 sll %o0, 2, %o0
if ( !object_blocks ) {
20094b4: a4 92 20 00 orcc %o0, 0, %l2
20094b8: 02 80 00 7a be 20096a0 <_Objects_Extend_information+0x2dc>
20094bc: b7 2e e0 02 sll %i3, 2, %i3
* Take the block count down. Saves all the (block_count - 1)
* in the copies.
*/
block_count--;
if ( information->maximum > minimum_index ) {
20094c0: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
20094c4: 80 a4 40 01 cmp %l1, %g1
20094c8: a6 04 80 1b add %l2, %i3, %l3
20094cc: 0a 80 00 57 bcs 2009628 <_Objects_Extend_information+0x264>
20094d0: b6 04 c0 1b add %l3, %i3, %i3
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
20094d4: 85 2c 60 02 sll %l1, 2, %g2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
20094d8: 80 a4 60 00 cmp %l1, 0
20094dc: 02 80 00 07 be 20094f8 <_Objects_Extend_information+0x134><== NEVER TAKEN
20094e0: 82 10 20 00 clr %g1
local_table[ index ] = NULL;
20094e4: c0 20 40 1b clr [ %g1 + %i3 ]
20094e8: 82 00 60 04 add %g1, 4, %g1
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
20094ec: 80 a0 40 02 cmp %g1, %g2
20094f0: 32 bf ff fe bne,a 20094e8 <_Objects_Extend_information+0x124><== NEVER TAKEN
20094f4: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED
20094f8: b3 2e 60 02 sll %i1, 2, %i1
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
20094fc: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
2009500: c0 24 80 19 clr [ %l2 + %i1 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2009504: 82 07 00 03 add %i4, %g3, %g1
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
2009508: 80 a7 00 01 cmp %i4, %g1
200950c: 1a 80 00 0b bcc 2009538 <_Objects_Extend_information+0x174><== NEVER TAKEN
2009510: c0 24 c0 19 clr [ %l3 + %i1 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
2009514: 85 2f 20 02 sll %i4, 2, %g2
2009518: 87 28 e0 02 sll %g3, 2, %g3
200951c: 84 06 c0 02 add %i3, %g2, %g2
2009520: 82 10 20 00 clr %g1
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
2009524: c0 20 80 01 clr [ %g2 + %g1 ]
2009528: 82 00 60 04 add %g1, 4, %g1
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
200952c: 80 a0 40 03 cmp %g1, %g3
2009530: 32 bf ff fe bne,a 2009528 <_Objects_Extend_information+0x164>
2009534: c0 20 80 01 clr [ %g2 + %g1 ]
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
2009538: 7f ff e4 8b call 2002764 <sparc_disable_interrupts>
200953c: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2009540: 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(
2009544: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
2009548: f2 06 20 34 ld [ %i0 + 0x34 ], %i1
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
information->maximum = (Objects_Maximum) maximum;
200954c: e0 36 20 10 sth %l0, [ %i0 + 0x10 ]
2009550: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2009554: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
2009558: e4 26 20 34 st %l2, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
200955c: e6 26 20 30 st %l3, [ %i0 + 0x30 ]
information->local_table = local_table;
2009560: f6 26 20 1c st %i3, [ %i0 + 0x1c ]
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2009564: 03 00 00 40 sethi %hi(0x10000), %g1
2009568: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
200956c: 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) |
2009570: a0 10 40 10 or %g1, %l0, %l0
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
2009574: e0 26 20 0c st %l0, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
2009578: 7f ff e4 7f call 2002774 <sparc_enable_interrupts>
200957c: 01 00 00 00 nop
_Workspace_Free( old_tables );
2009580: 40 00 09 0f call 200b9bc <_Workspace_Free>
2009584: 90 10 00 19 mov %i1, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
2009588: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
200958c: bb 2f 60 02 sll %i5, 2, %i5
2009590: f4 20 40 1d st %i2, [ %g1 + %i5 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
2009594: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2009598: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
200959c: d2 00 40 1d ld [ %g1 + %i5 ], %o1
20095a0: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
20095a4: 90 07 bf f4 add %fp, -12, %o0
20095a8: 7f ff fc b6 call 2008880 <_Chain_Initialize>
20095ac: 35 00 00 40 sethi %hi(0x10000), %i2
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
20095b0: 10 80 00 0d b 20095e4 <_Objects_Extend_information+0x220>
20095b4: b6 06 20 20 add %i0, 0x20, %i3
the_object->id = _Objects_Build_id(
20095b8: c6 16 20 04 lduh [ %i0 + 4 ], %g3
20095bc: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
20095c0: 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) |
20095c4: 84 10 80 1a or %g2, %i2, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
20095c8: 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) |
20095cc: 84 10 80 1c or %g2, %i4, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
20095d0: 90 10 00 1b mov %i3, %o0
20095d4: 92 10 00 01 mov %g1, %o1
index++;
20095d8: b8 07 20 01 inc %i4
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
20095dc: 7f ff fc 8e call 2008814 <_Chain_Append>
20095e0: 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 ) {
20095e4: 7f ff fc 97 call 2008840 <_Chain_Get>
20095e8: 90 07 bf f4 add %fp, -12, %o0
20095ec: 82 92 20 00 orcc %o0, 0, %g1
20095f0: 32 bf ff f2 bne,a 20095b8 <_Objects_Extend_information+0x1f4>
20095f4: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20095f8: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
20095fc: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
2009600: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
2009604: c8 20 c0 1d st %g4, [ %g3 + %i5 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
2009608: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
200960c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
2009610: 81 c7 e0 08 ret
2009614: 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 );
2009618: 40 00 08 ef call 200b9d4 <_Workspace_Allocate_or_fatal_error>
200961c: 01 00 00 00 nop
2009620: 10 bf ff 9b b 200948c <_Objects_Extend_information+0xc8>
2009624: b4 10 00 08 mov %o0, %i2
/*
* 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,
2009628: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
200962c: b3 2e 60 02 sll %i1, 2, %i1
/*
* 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,
2009630: 40 00 1b 0a call 2010258 <memcpy>
2009634: 94 10 00 19 mov %i1, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
2009638: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
200963c: 94 10 00 19 mov %i1, %o2
2009640: 40 00 1b 06 call 2010258 <memcpy>
2009644: 90 10 00 13 mov %l3, %o0
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
2009648: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
200964c: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
2009650: 94 02 80 11 add %o2, %l1, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
2009654: 90 10 00 1b mov %i3, %o0
2009658: 40 00 1b 00 call 2010258 <memcpy>
200965c: 95 2a a0 02 sll %o2, 2, %o2
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2009660: 10 bf ff a8 b 2009500 <_Objects_Extend_information+0x13c>
2009664: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
2009668: 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 );
200966c: b8 10 00 11 mov %l1, %i4
/*
* 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;
2009670: b6 10 20 01 mov 1, %i3
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2009674: ba 10 20 00 clr %i5
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
2009678: b2 10 20 00 clr %i1
200967c: 10 bf ff 72 b 2009444 <_Objects_Extend_information+0x80>
2009680: a1 2c 20 10 sll %l0, 0x10, %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 );
2009684: b8 10 00 11 mov %l1, %i4 <== 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;
2009688: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
200968c: 10 bf ff 6e b 2009444 <_Objects_Extend_information+0x80> <== NOT EXECUTED
2009690: ba 10 20 00 clr %i5 <== NOT EXECUTED
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
2009694: b6 10 20 00 clr %i3 <== NOT EXECUTED
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2009698: 10 bf ff 6b b 2009444 <_Objects_Extend_information+0x80> <== NOT EXECUTED
200969c: ba 10 20 00 clr %i5 <== 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 );
20096a0: 40 00 08 c7 call 200b9bc <_Workspace_Free>
20096a4: 90 10 00 1a mov %i2, %o0
20096a8: 81 c7 e0 08 ret
20096ac: 81 e8 00 00 restore
02009760 <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
2009760: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
2009764: 80 a6 60 00 cmp %i1, 0
2009768: 02 80 00 19 be 20097cc <_Objects_Get_information+0x6c>
200976c: 01 00 00 00 nop
/*
* 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 );
2009770: 40 00 11 6e call 200dd28 <_Objects_API_maximum_class>
2009774: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
2009778: 80 a2 20 00 cmp %o0, 0
200977c: 02 80 00 14 be 20097cc <_Objects_Get_information+0x6c>
2009780: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
2009784: 0a 80 00 12 bcs 20097cc <_Objects_Get_information+0x6c>
2009788: 03 00 80 74 sethi %hi(0x201d000), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
200978c: b1 2e 20 02 sll %i0, 2, %i0
2009790: 82 10 61 74 or %g1, 0x174, %g1
2009794: c2 00 40 18 ld [ %g1 + %i0 ], %g1
2009798: 80 a0 60 00 cmp %g1, 0
200979c: 02 80 00 0c be 20097cc <_Objects_Get_information+0x6c> <== NEVER TAKEN
20097a0: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
20097a4: f0 00 40 19 ld [ %g1 + %i1 ], %i0
if ( !info )
20097a8: 80 a6 20 00 cmp %i0, 0
20097ac: 02 80 00 08 be 20097cc <_Objects_Get_information+0x6c> <== NEVER TAKEN
20097b0: 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 )
20097b4: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
20097b8: 80 a0 60 00 cmp %g1, 0
20097bc: 02 80 00 04 be 20097cc <_Objects_Get_information+0x6c>
20097c0: 01 00 00 00 nop
return NULL;
#endif
return info;
}
20097c4: 81 c7 e0 08 ret
20097c8: 81 e8 00 00 restore
{
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
return NULL;
20097cc: 81 c7 e0 08 ret
20097d0: 91 e8 20 00 restore %g0, 0, %o0
020175b8 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
20175b8: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
20175bc: 80 a6 60 00 cmp %i1, 0
20175c0: 02 80 00 3d be 20176b4 <_Objects_Get_name_as_string+0xfc>
20175c4: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
20175c8: 02 80 00 3b be 20176b4 <_Objects_Get_name_as_string+0xfc>
20175cc: ba 96 20 00 orcc %i0, 0, %i5
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
20175d0: 02 80 00 36 be 20176a8 <_Objects_Get_name_as_string+0xf0>
20175d4: 03 00 80 c0 sethi %hi(0x2030000), %g1
information = _Objects_Get_information_id( tmpId );
20175d8: 7f ff e2 27 call 200fe74 <_Objects_Get_information_id>
20175dc: 90 10 00 1d mov %i5, %o0
if ( !information )
20175e0: 80 a2 20 00 cmp %o0, 0
20175e4: 02 80 00 34 be 20176b4 <_Objects_Get_name_as_string+0xfc>
20175e8: 92 10 00 1d mov %i5, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
20175ec: 7f ff e2 62 call 200ff74 <_Objects_Get>
20175f0: 94 07 bf f4 add %fp, -12, %o2
switch ( location ) {
20175f4: c2 07 bf f4 ld [ %fp + -12 ], %g1
20175f8: 80 a0 60 00 cmp %g1, 0
20175fc: 32 80 00 2f bne,a 20176b8 <_Objects_Get_name_as_string+0x100>
2017600: 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;
2017604: 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';
2017608: c0 2f bf fc clrb [ %fp + -4 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
201760c: 87 30 60 18 srl %g1, 0x18, %g3
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
2017610: 85 30 60 08 srl %g1, 8, %g2
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
2017614: 89 30 60 10 srl %g1, 0x10, %g4
lname[ 2 ] = (u32_name >> 8) & 0xff;
2017618: c4 2f bf fa stb %g2, [ %fp + -6 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
201761c: c6 2f bf f8 stb %g3, [ %fp + -8 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
2017620: c8 2f bf f9 stb %g4, [ %fp + -7 ]
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
2017624: c2 2f bf fb stb %g1, [ %fp + -5 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2017628: b2 86 7f ff addcc %i1, -1, %i1
201762c: 02 80 00 25 be 20176c0 <_Objects_Get_name_as_string+0x108><== NEVER TAKEN
2017630: 84 10 00 03 mov %g3, %g2
2017634: 80 a0 e0 00 cmp %g3, 0
2017638: 02 80 00 17 be 2017694 <_Objects_Get_name_as_string+0xdc>
201763c: 86 10 00 1a mov %i2, %g3
2017640: 39 00 80 bc sethi %hi(0x202f000), %i4
2017644: 82 10 20 00 clr %g1
2017648: 10 80 00 06 b 2017660 <_Objects_Get_name_as_string+0xa8>
201764c: b8 17 20 20 or %i4, 0x20, %i4
2017650: fa 49 00 01 ldsb [ %g4 + %g1 ], %i5
2017654: 80 a7 60 00 cmp %i5, 0
2017658: 02 80 00 0f be 2017694 <_Objects_Get_name_as_string+0xdc>
201765c: c4 08 40 04 ldub [ %g1 + %g4 ], %g2
*d = (isprint((unsigned char)*s)) ? *s : '*';
2017660: fa 07 00 00 ld [ %i4 ], %i5
2017664: 88 08 a0 ff and %g2, 0xff, %g4
2017668: 88 07 40 04 add %i5, %g4, %g4
201766c: fa 49 20 01 ldsb [ %g4 + 1 ], %i5
2017670: 80 8f 60 97 btst 0x97, %i5
2017674: 12 80 00 03 bne 2017680 <_Objects_Get_name_as_string+0xc8>
2017678: 88 07 bf f8 add %fp, -8, %g4
201767c: 84 10 20 2a mov 0x2a, %g2
2017680: c4 28 c0 00 stb %g2, [ %g3 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2017684: 82 00 60 01 inc %g1
2017688: 80 a0 40 19 cmp %g1, %i1
201768c: 12 bf ff f1 bne 2017650 <_Objects_Get_name_as_string+0x98>
2017690: 86 00 e0 01 inc %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
2017694: c0 28 c0 00 clrb [ %g3 ]
_Thread_Enable_dispatch();
2017698: 7f ff e6 5b call 2011004 <_Thread_Enable_dispatch>
201769c: b0 10 00 1a mov %i2, %i0
return name;
}
return NULL; /* unreachable path */
}
20176a0: 81 c7 e0 08 ret
20176a4: 81 e8 00 00 restore
return NULL;
if ( name == NULL )
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
20176a8: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1
20176ac: 10 bf ff cb b 20175d8 <_Objects_Get_name_as_string+0x20>
20176b0: fa 00 60 08 ld [ %g1 + 8 ], %i5
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
20176b4: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
20176b8: 81 c7 e0 08 ret
20176bc: 91 e8 00 1a restore %g0, %i2, %o0
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
20176c0: 10 bf ff f5 b 2017694 <_Objects_Get_name_as_string+0xdc> <== NOT EXECUTED
20176c4: 86 10 00 1a mov %i2, %g3 <== NOT EXECUTED
02019d58 <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
2019d58: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
2019d5c: 80 a6 20 00 cmp %i0, 0
2019d60: 02 80 00 29 be 2019e04 <_Objects_Get_next+0xac>
2019d64: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( !location_p )
2019d68: 02 80 00 27 be 2019e04 <_Objects_Get_next+0xac>
2019d6c: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
2019d70: 02 80 00 25 be 2019e04 <_Objects_Get_next+0xac>
2019d74: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
2019d78: 80 a0 60 00 cmp %g1, 0
2019d7c: 22 80 00 13 be,a 2019dc8 <_Objects_Get_next+0x70>
2019d80: 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)
2019d84: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
2019d88: 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);
2019d8c: 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)
2019d90: 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);
2019d94: 90 10 00 18 mov %i0, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2019d98: 80 a0 80 01 cmp %g2, %g1
2019d9c: 0a 80 00 13 bcs 2019de8 <_Objects_Get_next+0x90>
2019da0: 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);
2019da4: 7f ff d8 74 call 200ff74 <_Objects_Get>
2019da8: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
2019dac: c2 06 80 00 ld [ %i2 ], %g1
2019db0: 80 a0 60 00 cmp %g1, 0
2019db4: 32 bf ff f5 bne,a 2019d88 <_Objects_Get_next+0x30>
2019db8: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
*next_id_p = next_id;
2019dbc: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
2019dc0: 81 c7 e0 08 ret
2019dc4: 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)
2019dc8: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
2019dcc: 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);
2019dd0: 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)
2019dd4: 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);
2019dd8: 90 10 00 18 mov %i0, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2019ddc: 80 a0 80 01 cmp %g2, %g1
2019de0: 1a bf ff f1 bcc 2019da4 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN
2019de4: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
2019de8: 82 10 20 01 mov 1, %g1
2019dec: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
2019df0: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
2019df4: 82 10 3f ff mov -1, %g1
2019df8: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
2019dfc: 81 c7 e0 08 ret
2019e00: 91 e8 00 08 restore %g0, %o0, %o0
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
2019e04: 10 bf ff ef b 2019dc0 <_Objects_Get_next+0x68>
2019e08: 90 10 20 00 clr %o0
0201ac2c <_Objects_Get_no_protection>:
/*
* You can't just extract the index portion or you can get tricked
* by a value between 1 and maximum.
*/
index = id - information->minimum_id + 1;
201ac2c: c4 02 20 08 ld [ %o0 + 8 ], %g2
if ( information->maximum >= index ) {
201ac30: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1
/*
* You can't just extract the index portion or you can get tricked
* by a value between 1 and maximum.
*/
index = id - information->minimum_id + 1;
201ac34: 92 22 40 02 sub %o1, %g2, %o1
201ac38: 92 02 60 01 inc %o1
if ( information->maximum >= index ) {
201ac3c: 80 a2 40 01 cmp %o1, %g1
201ac40: 18 80 00 09 bgu 201ac64 <_Objects_Get_no_protection+0x38>
201ac44: 93 2a 60 02 sll %o1, 2, %o1
if ( (the_object = information->local_table[ index ]) != NULL ) {
201ac48: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
201ac4c: d0 00 40 09 ld [ %g1 + %o1 ], %o0
201ac50: 80 a2 20 00 cmp %o0, 0
201ac54: 02 80 00 05 be 201ac68 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN
201ac58: 82 10 20 01 mov 1, %g1
*location = OBJECTS_LOCAL;
return the_object;
201ac5c: 81 c3 e0 08 retl
201ac60: c0 22 80 00 clr [ %o2 ]
/*
* This isn't supported or required yet for Global objects so
* if it isn't local, we don't find it.
*/
*location = OBJECTS_ERROR;
201ac64: 82 10 20 01 mov 1, %g1
return NULL;
201ac68: 90 10 20 00 clr %o0
}
201ac6c: 81 c3 e0 08 retl
201ac70: c2 22 80 00 st %g1, [ %o2 ]
0200ffec <_Objects_Id_to_name>:
*/
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
200ffec: 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;
200fff0: 80 a6 20 00 cmp %i0, 0
200fff4: 12 80 00 06 bne 201000c <_Objects_Id_to_name+0x20>
200fff8: 83 36 20 18 srl %i0, 0x18, %g1
200fffc: 03 00 80 c0 sethi %hi(0x2030000), %g1
2010000: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 20303cc <_Per_CPU_Information+0xc>
2010004: f0 00 60 08 ld [ %g1 + 8 ], %i0
2010008: 83 36 20 18 srl %i0, 0x18, %g1
201000c: 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 )
2010010: 84 00 7f ff add %g1, -1, %g2
2010014: 80 a0 a0 02 cmp %g2, 2
2010018: 18 80 00 18 bgu 2010078 <_Objects_Id_to_name+0x8c>
201001c: 83 28 60 02 sll %g1, 2, %g1
the_api = _Objects_Get_API( tmpId );
if ( !_Objects_Is_api_valid( the_api ) )
return OBJECTS_INVALID_ID;
if ( !_Objects_Information_table[ the_api ] )
2010020: 05 00 80 c0 sethi %hi(0x2030000), %g2
2010024: 84 10 a0 c4 or %g2, 0xc4, %g2 ! 20300c4 <_Objects_Information_table>
2010028: c2 00 80 01 ld [ %g2 + %g1 ], %g1
201002c: 80 a0 60 00 cmp %g1, 0
2010030: 02 80 00 12 be 2010078 <_Objects_Id_to_name+0x8c>
2010034: 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 ];
2010038: 85 28 a0 02 sll %g2, 2, %g2
201003c: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
2010040: 80 a2 20 00 cmp %o0, 0
2010044: 02 80 00 0d be 2010078 <_Objects_Id_to_name+0x8c> <== NEVER TAKEN
2010048: 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 );
201004c: 7f ff ff ca call 200ff74 <_Objects_Get>
2010050: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
2010054: 80 a2 20 00 cmp %o0, 0
2010058: 02 80 00 08 be 2010078 <_Objects_Id_to_name+0x8c>
201005c: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
2010060: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2010064: b0 10 20 00 clr %i0
the_object = _Objects_Get( information, tmpId, &ignored_location );
if ( !the_object )
return OBJECTS_INVALID_ID;
*name = the_object->name;
_Thread_Enable_dispatch();
2010068: 40 00 03 e7 call 2011004 <_Thread_Enable_dispatch>
201006c: c2 26 40 00 st %g1, [ %i1 ]
2010070: 81 c7 e0 08 ret
2010074: 81 e8 00 00 restore
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
the_api = _Objects_Get_API( tmpId );
if ( !_Objects_Is_api_valid( the_api ) )
return OBJECTS_INVALID_ID;
2010078: 81 c7 e0 08 ret
201007c: 91 e8 20 03 restore %g0, 3, %o0
02009a50 <_Objects_Shrink_information>:
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
2009a50: 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 );
2009a54: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
block_count = (information->maximum - index_base) /
2009a58: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
2009a5c: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
2009a60: 92 10 00 1b mov %i3, %o1
2009a64: 40 00 3b 34 call 2018734 <.udiv>
2009a68: 90 22 00 1c sub %o0, %i4, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2009a6c: 80 a2 20 00 cmp %o0, 0
2009a70: 02 80 00 36 be 2009b48 <_Objects_Shrink_information+0xf8> <== NEVER TAKEN
2009a74: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
2009a78: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
2009a7c: c2 01 00 00 ld [ %g4 ], %g1
2009a80: 80 a6 c0 01 cmp %i3, %g1
2009a84: 02 80 00 0f be 2009ac0 <_Objects_Shrink_information+0x70> <== NEVER TAKEN
2009a88: 82 10 20 00 clr %g1
2009a8c: 10 80 00 07 b 2009aa8 <_Objects_Shrink_information+0x58>
2009a90: ba 10 20 04 mov 4, %i5
2009a94: c4 01 00 1d ld [ %g4 + %i5 ], %g2
2009a98: 80 a6 c0 02 cmp %i3, %g2
2009a9c: 02 80 00 0a be 2009ac4 <_Objects_Shrink_information+0x74>
2009aa0: 86 07 60 04 add %i5, 4, %g3
2009aa4: ba 10 00 03 mov %g3, %i5
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2009aa8: 82 00 60 01 inc %g1
2009aac: 80 a0 40 08 cmp %g1, %o0
2009ab0: 12 bf ff f9 bne 2009a94 <_Objects_Shrink_information+0x44>
2009ab4: b8 07 00 1b add %i4, %i3, %i4
2009ab8: 81 c7 e0 08 ret
2009abc: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
2009ac0: ba 10 20 00 clr %i5 <== NOT EXECUTED
* 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 );
2009ac4: 35 00 00 3f sethi %hi(0xfc00), %i2
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009ac8: d0 06 20 20 ld [ %i0 + 0x20 ], %o0
2009acc: 10 80 00 05 b 2009ae0 <_Objects_Shrink_information+0x90>
2009ad0: b4 16 a3 ff or %i2, 0x3ff, %i2
if ((index >= index_base) &&
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
}
}
while ( the_object );
2009ad4: 90 96 e0 00 orcc %i3, 0, %o0
2009ad8: 22 80 00 12 be,a 2009b20 <_Objects_Shrink_information+0xd0>
2009adc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
* 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 );
2009ae0: c2 02 20 08 ld [ %o0 + 8 ], %g1
2009ae4: 82 08 40 1a and %g1, %i2, %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) &&
2009ae8: 80 a0 40 1c cmp %g1, %i4
2009aec: 0a bf ff fa bcs 2009ad4 <_Objects_Shrink_information+0x84>
2009af0: f6 02 00 00 ld [ %o0 ], %i3
(index < (index_base + information->allocation_size))) {
2009af4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
2009af8: 84 07 00 02 add %i4, %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) &&
2009afc: 80 a0 40 02 cmp %g1, %g2
2009b00: 3a bf ff f6 bcc,a 2009ad8 <_Objects_Shrink_information+0x88>
2009b04: 90 96 e0 00 orcc %i3, 0, %o0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
2009b08: 40 00 0e ad call 200d5bc <_Chain_Extract>
2009b0c: 01 00 00 00 nop
}
}
while ( the_object );
2009b10: 90 96 e0 00 orcc %i3, 0, %o0
2009b14: 32 bf ff f4 bne,a 2009ae4 <_Objects_Shrink_information+0x94><== ALWAYS TAKEN
2009b18: c2 02 20 08 ld [ %o0 + 8 ], %g1
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
2009b1c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
2009b20: 40 00 07 a7 call 200b9bc <_Workspace_Free>
2009b24: d0 00 40 1d ld [ %g1 + %i5 ], %o0
information->object_blocks[ block ] = NULL;
2009b28: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
2009b2c: 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;
2009b30: c0 20 40 1d clr [ %g1 + %i5 ]
information->inactive_per_block[ block ] = 0;
2009b34: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
2009b38: 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;
2009b3c: c0 20 c0 1d clr [ %g3 + %i5 ]
information->inactive -= information->allocation_size;
2009b40: 82 20 80 01 sub %g2, %g1, %g1
2009b44: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
2009b48: 81 c7 e0 08 ret
2009b4c: 81 e8 00 00 restore
0200aa94 <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
200aa94: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if (!the_node) return;
200aa98: 80 a6 60 00 cmp %i1, 0
200aa9c: 02 80 00 4c be 200abcc <_RBTree_Extract_unprotected+0x138>
200aaa0: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
200aaa4: c2 06 20 08 ld [ %i0 + 8 ], %g1
200aaa8: 80 a0 40 19 cmp %g1, %i1
200aaac: 02 80 00 56 be 200ac04 <_RBTree_Extract_unprotected+0x170>
200aab0: 90 10 00 19 mov %i1, %o0
the_rbtree->first[RBT_LEFT] = next;
}
/* Check if max needs to be updated. min=max for 1 element trees so
* do not use else if here. */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
200aab4: c2 06 20 0c ld [ %i0 + 0xc ], %g1
200aab8: 80 a0 40 19 cmp %g1, %i1
200aabc: 02 80 00 56 be 200ac14 <_RBTree_Extract_unprotected+0x180>
200aac0: 90 10 00 19 mov %i1, %o0
* 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]) {
200aac4: fa 06 60 04 ld [ %i1 + 4 ], %i5
200aac8: 80 a7 60 00 cmp %i5, 0
200aacc: 22 80 00 5a be,a 200ac34 <_RBTree_Extract_unprotected+0x1a0>
200aad0: f8 06 60 08 ld [ %i1 + 8 ], %i4
200aad4: c2 06 60 08 ld [ %i1 + 8 ], %g1
200aad8: 80 a0 60 00 cmp %g1, 0
200aadc: 32 80 00 05 bne,a 200aaf0 <_RBTree_Extract_unprotected+0x5c>
200aae0: c2 07 60 08 ld [ %i5 + 8 ], %g1
200aae4: 10 80 00 3c b 200abd4 <_RBTree_Extract_unprotected+0x140>
200aae8: b8 10 00 1d mov %i5, %i4
target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */
while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT];
200aaec: c2 07 60 08 ld [ %i5 + 8 ], %g1
200aaf0: 80 a0 60 00 cmp %g1, 0
200aaf4: 32 bf ff fe bne,a 200aaec <_RBTree_Extract_unprotected+0x58>
200aaf8: ba 10 00 01 mov %g1, %i5
* 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];
200aafc: f8 07 60 04 ld [ %i5 + 4 ], %i4
if(leaf) {
200ab00: 80 a7 20 00 cmp %i4, 0
200ab04: 02 80 00 48 be 200ac24 <_RBTree_Extract_unprotected+0x190>
200ab08: 01 00 00 00 nop
leaf->parent = target->parent;
200ab0c: c2 07 40 00 ld [ %i5 ], %g1
200ab10: c2 27 00 00 st %g1, [ %i4 ]
} 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];
200ab14: c4 07 40 00 ld [ %i5 ], %g2
target->parent->child[dir] = leaf;
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
200ab18: c2 06 40 00 ld [ %i1 ], %g1
} 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];
200ab1c: c8 00 a0 04 ld [ %g2 + 4 ], %g4
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;
200ab20: c6 07 60 0c ld [ %i5 + 0xc ], %g3
dir = target != target->parent->child[0];
200ab24: 88 1f 40 04 xor %i5, %g4, %g4
200ab28: 80 a0 00 04 cmp %g0, %g4
200ab2c: 88 40 20 00 addx %g0, 0, %g4
target->parent->child[dir] = leaf;
200ab30: 89 29 20 02 sll %g4, 2, %g4
200ab34: 84 00 80 04 add %g2, %g4, %g2
200ab38: f8 20 a0 04 st %i4, [ %g2 + 4 ]
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
200ab3c: c4 00 60 04 ld [ %g1 + 4 ], %g2
200ab40: 84 18 80 19 xor %g2, %i1, %g2
200ab44: 80 a0 00 02 cmp %g0, %g2
200ab48: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = target;
200ab4c: 85 28 a0 02 sll %g2, 2, %g2
200ab50: 82 00 40 02 add %g1, %g2, %g1
200ab54: fa 20 60 04 st %i5, [ %g1 + 4 ]
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
200ab58: c2 06 60 08 ld [ %i1 + 8 ], %g1
200ab5c: c2 27 60 08 st %g1, [ %i5 + 8 ]
if (the_node->child[RBT_RIGHT])
200ab60: c2 06 60 08 ld [ %i1 + 8 ], %g1
200ab64: 80 a0 60 00 cmp %g1, 0
200ab68: 32 80 00 02 bne,a 200ab70 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN
200ab6c: fa 20 40 00 st %i5, [ %g1 ]
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
200ab70: c2 06 60 04 ld [ %i1 + 4 ], %g1
200ab74: c2 27 60 04 st %g1, [ %i5 + 4 ]
if (the_node->child[RBT_LEFT])
200ab78: c2 06 60 04 ld [ %i1 + 4 ], %g1
200ab7c: 80 a0 60 00 cmp %g1, 0
200ab80: 32 80 00 02 bne,a 200ab88 <_RBTree_Extract_unprotected+0xf4>
200ab84: fa 20 40 00 st %i5, [ %g1 ]
/* 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;
200ab88: c4 06 40 00 ld [ %i1 ], %g2
target->color = the_node->color;
200ab8c: c2 06 60 0c ld [ %i1 + 0xc ], %g1
/* 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;
200ab90: c4 27 40 00 st %g2, [ %i5 ]
target->color = the_node->color;
200ab94: c2 27 60 0c st %g1, [ %i5 + 0xc ]
/* fix coloring. leaf has moved up the tree. The color of the deleted
* node is in victim_color. There are two cases:
* 1. Deleted a red node, its child must be black. Nothing must be done.
* 2. Deleted a black node, its child must be red. Paint child black.
*/
if (victim_color == RBT_BLACK) { /* eliminate case 1 */
200ab98: 80 a0 e0 00 cmp %g3, 0
200ab9c: 32 80 00 06 bne,a 200abb4 <_RBTree_Extract_unprotected+0x120>
200aba0: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (leaf) {
200aba4: 80 a7 20 00 cmp %i4, 0
200aba8: 32 80 00 02 bne,a 200abb0 <_RBTree_Extract_unprotected+0x11c>
200abac: c0 27 20 0c clr [ %i4 + 0xc ]
/* 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;
200abb0: 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;
200abb4: c0 26 60 08 clr [ %i1 + 8 ]
200abb8: c0 26 60 04 clr [ %i1 + 4 ]
200abbc: 80 a0 60 00 cmp %g1, 0
200abc0: 02 80 00 03 be 200abcc <_RBTree_Extract_unprotected+0x138>
200abc4: c0 26 40 00 clr [ %i1 ]
200abc8: c0 20 60 0c clr [ %g1 + 0xc ]
200abcc: 81 c7 e0 08 ret
200abd0: 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;
200abd4: c2 06 40 00 ld [ %i1 ], %g1
200abd8: 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];
200abdc: 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;
200abe0: c6 06 60 0c ld [ %i1 + 0xc ], %g3
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
200abe4: c4 00 60 04 ld [ %g1 + 4 ], %g2
200abe8: 84 18 80 19 xor %g2, %i1, %g2
200abec: 80 a0 00 02 cmp %g0, %g2
200abf0: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = leaf;
200abf4: 85 28 a0 02 sll %g2, 2, %g2
200abf8: 82 00 40 02 add %g1, %g2, %g1
200abfc: 10 bf ff e7 b 200ab98 <_RBTree_Extract_unprotected+0x104>
200ac00: f8 20 60 04 st %i4, [ %g1 + 4 ]
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected(
const RBTree_Node *node
)
{
return _RBTree_Next_unprotected( node, RBT_RIGHT );
200ac04: 40 00 00 eb call 200afb0 <_RBTree_Next_unprotected>
200ac08: 92 10 20 01 mov 1, %o1
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
RBTree_Node *next;
next = _RBTree_Successor_unprotected(the_node);
the_rbtree->first[RBT_LEFT] = next;
200ac0c: 10 bf ff aa b 200aab4 <_RBTree_Extract_unprotected+0x20>
200ac10: d0 26 20 08 st %o0, [ %i0 + 8 ]
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected(
const RBTree_Node *node
)
{
return _RBTree_Next_unprotected( node, RBT_LEFT );
200ac14: 40 00 00 e7 call 200afb0 <_RBTree_Next_unprotected>
200ac18: 92 10 20 00 clr %o1
/* Check if max needs to be updated. min=max for 1 element trees so
* do not use else if here. */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
RBTree_Node *previous;
previous = _RBTree_Predecessor_unprotected(the_node);
the_rbtree->first[RBT_RIGHT] = previous;
200ac1c: 10 bf ff aa b 200aac4 <_RBTree_Extract_unprotected+0x30>
200ac20: d0 26 20 0c st %o0, [ %i0 + 0xc ]
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);
200ac24: 7f ff fe d3 call 200a770 <_RBTree_Extract_validate_unprotected>
200ac28: 90 10 00 1d mov %i5, %o0
}
victim_color = target->color;
dir = target != target->parent->child[0];
200ac2c: 10 bf ff bb b 200ab18 <_RBTree_Extract_unprotected+0x84>
200ac30: c4 07 40 00 ld [ %i5 ], %g2
* 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 ) {
200ac34: 80 a7 20 00 cmp %i4, 0
200ac38: 32 bf ff e8 bne,a 200abd8 <_RBTree_Extract_unprotected+0x144>
200ac3c: 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);
200ac40: 7f ff fe cc call 200a770 <_RBTree_Extract_validate_unprotected>
200ac44: 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];
200ac48: 10 bf ff e6 b 200abe0 <_RBTree_Extract_unprotected+0x14c>
200ac4c: c2 06 40 00 ld [ %i1 ], %g1
0200a770 <_RBTree_Extract_validate_unprotected>:
)
{
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
200a770: c2 02 00 00 ld [ %o0 ], %g1
if(!parent->parent) return;
200a774: c4 00 40 00 ld [ %g1 ], %g2
200a778: 80 a0 a0 00 cmp %g2, 0
200a77c: 02 80 00 3f be 200a878 <_RBTree_Extract_validate_unprotected+0x108>
200a780: 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])
200a784: c4 00 60 04 ld [ %g1 + 4 ], %g2
200a788: 80 a2 00 02 cmp %o0, %g2
200a78c: 22 80 00 02 be,a 200a794 <_RBTree_Extract_validate_unprotected+0x24>
200a790: c4 00 60 08 ld [ %g1 + 8 ], %g2
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200a794: c6 02 20 0c ld [ %o0 + 0xc ], %g3
200a798: 80 a0 e0 01 cmp %g3, 1
200a79c: 02 80 00 32 be 200a864 <_RBTree_Extract_validate_unprotected+0xf4>
200a7a0: 9a 10 20 01 mov 1, %o5
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) {
200a7a4: c6 00 40 00 ld [ %g1 ], %g3
200a7a8: 80 a0 e0 00 cmp %g3, 0
200a7ac: 02 80 00 2e be 200a864 <_RBTree_Extract_validate_unprotected+0xf4>
200a7b0: 80 a0 a0 00 cmp %g2, 0
200a7b4: 22 80 00 07 be,a 200a7d0 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN
200a7b8: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED
200a7bc: c8 00 a0 0c ld [ %g2 + 0xc ], %g4
200a7c0: 80 a1 20 01 cmp %g4, 1
200a7c4: 22 80 00 63 be,a 200a950 <_RBTree_Extract_validate_unprotected+0x1e0>
200a7c8: d8 00 60 04 ld [ %g1 + 4 ], %o4
_RBTree_Rotate(parent, dir);
sibling = parent->child[_RBTree_Opposite_direction(dir)];
}
/* sibling is black, see if both of its children are also black. */
if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
200a7cc: c6 00 a0 08 ld [ %g2 + 8 ], %g3
200a7d0: 80 a0 e0 00 cmp %g3, 0
200a7d4: 22 80 00 07 be,a 200a7f0 <_RBTree_Extract_validate_unprotected+0x80>
200a7d8: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200a7dc: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200a7e0: 80 a0 e0 01 cmp %g3, 1
200a7e4: 22 80 00 29 be,a 200a888 <_RBTree_Extract_validate_unprotected+0x118>
200a7e8: c6 00 60 04 ld [ %g1 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
200a7ec: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200a7f0: 80 a0 e0 00 cmp %g3, 0
200a7f4: 22 80 00 07 be,a 200a810 <_RBTree_Extract_validate_unprotected+0xa0>
200a7f8: da 20 a0 0c st %o5, [ %g2 + 0xc ]
200a7fc: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200a800: 80 a0 e0 01 cmp %g3, 1
200a804: 22 80 00 21 be,a 200a888 <_RBTree_Extract_validate_unprotected+0x118>
200a808: c6 00 60 04 ld [ %g1 + 4 ], %g3
sibling->color = RBT_RED;
200a80c: da 20 a0 0c st %o5, [ %g2 + 0xc ]
200a810: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200a814: 80 a0 a0 01 cmp %g2, 1
200a818: 22 80 00 99 be,a 200aa7c <_RBTree_Extract_validate_unprotected+0x30c>
200a81c: c0 20 60 0c clr [ %g1 + 0xc ]
if (_RBTree_Is_red(parent)) {
parent->color = RBT_BLACK;
break;
}
the_node = parent; /* done if parent is red */
parent = the_node->parent;
200a820: c6 00 40 00 ld [ %g1 ], %g3
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
const RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200a824: 80 a0 e0 00 cmp %g3, 0
200a828: 02 80 00 6c be 200a9d8 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN
200a82c: 90 10 00 01 mov %g1, %o0
if(!(the_node->parent->parent)) return NULL;
200a830: c4 00 c0 00 ld [ %g3 ], %g2
200a834: 80 a0 a0 00 cmp %g2, 0
200a838: 02 80 00 69 be 200a9dc <_RBTree_Extract_validate_unprotected+0x26c>
200a83c: 84 10 20 00 clr %g2
if(the_node == the_node->parent->child[RBT_LEFT])
200a840: c4 00 e0 04 ld [ %g3 + 4 ], %g2
200a844: 80 a0 40 02 cmp %g1, %g2
200a848: 22 80 00 0e be,a 200a880 <_RBTree_Extract_validate_unprotected+0x110>
200a84c: c4 00 e0 08 ld [ %g3 + 8 ], %g2
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
const RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200a850: 82 10 00 03 mov %g3, %g1
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200a854: c6 02 20 0c ld [ %o0 + 0xc ], %g3
200a858: 80 a0 e0 01 cmp %g3, 1
200a85c: 32 bf ff d3 bne,a 200a7a8 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN
200a860: c6 00 40 00 ld [ %g1 ], %g3
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200a864: c2 02 00 00 ld [ %o0 ], %g1
200a868: c2 00 40 00 ld [ %g1 ], %g1
200a86c: 80 a0 60 00 cmp %g1, 0
200a870: 02 80 00 5f be 200a9ec <_RBTree_Extract_validate_unprotected+0x27c>
200a874: 01 00 00 00 nop
200a878: 81 c3 e0 08 retl
200a87c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
const RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200a880: 10 bf ff f5 b 200a854 <_RBTree_Extract_validate_unprotected+0xe4>
200a884: 82 10 00 03 mov %g3, %g1
* 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];
200a888: 86 1a 00 03 xor %o0, %g3, %g3
200a88c: 80 a0 00 03 cmp %g0, %g3
200a890: 9a 40 20 00 addx %g0, 0, %o5
*/
RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction(
RBTree_Direction the_dir
)
{
return (RBTree_Direction) !((int) the_dir);
200a894: 86 1b 60 01 xor %o5, 1, %g3
if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) {
200a898: 87 28 e0 02 sll %g3, 2, %g3
200a89c: 88 00 80 03 add %g2, %g3, %g4
200a8a0: 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);
200a8a4: 80 a1 20 00 cmp %g4, 0
200a8a8: 22 80 00 07 be,a 200a8c4 <_RBTree_Extract_validate_unprotected+0x154>
200a8ac: 9b 2b 60 02 sll %o5, 2, %o5
200a8b0: d8 01 20 0c ld [ %g4 + 0xc ], %o4
200a8b4: 80 a3 20 01 cmp %o4, 1
200a8b8: 22 80 00 4f be,a 200a9f4 <_RBTree_Extract_validate_unprotected+0x284>
200a8bc: d6 00 60 0c ld [ %g1 + 0xc ], %o3
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
200a8c0: 9b 2b 60 02 sll %o5, 2, %o5
200a8c4: 98 00 80 0d add %g2, %o5, %o4
200a8c8: c8 03 20 04 ld [ %o4 + 4 ], %g4
* 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[_RBTree_Opposite_direction(dir)])) {
sibling->color = RBT_RED;
200a8cc: 96 10 20 01 mov 1, %o3
200a8d0: d6 20 a0 0c st %o3, [ %g2 + 0xc ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return;
200a8d4: 80 a1 20 00 cmp %g4, 0
200a8d8: 02 80 00 15 be 200a92c <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN
200a8dc: c0 21 20 0c clr [ %g4 + 0xc ]
c = the_node->child[_RBTree_Opposite_direction(dir)];
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
200a8e0: 96 01 00 03 add %g4, %g3, %o3
200a8e4: d4 02 e0 04 ld [ %o3 + 4 ], %o2
200a8e8: d4 23 20 04 st %o2, [ %o4 + 4 ]
if (c->child[dir])
200a8ec: d8 02 e0 04 ld [ %o3 + 4 ], %o4
200a8f0: 80 a3 20 00 cmp %o4, 0
200a8f4: 32 80 00 02 bne,a 200a8fc <_RBTree_Extract_validate_unprotected+0x18c>
200a8f8: c4 23 00 00 st %g2, [ %o4 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a8fc: d8 00 80 00 ld [ %g2 ], %o4
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200a900: 96 01 00 03 add %g4, %g3, %o3
200a904: c4 22 e0 04 st %g2, [ %o3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a908: d6 03 20 04 ld [ %o4 + 4 ], %o3
c->parent = the_node->parent;
200a90c: d8 21 00 00 st %o4, [ %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;
200a910: 96 18 80 0b xor %g2, %o3, %o3
c->parent = the_node->parent;
the_node->parent = c;
200a914: c8 20 80 00 st %g4, [ %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;
200a918: 80 a0 00 0b cmp %g0, %o3
200a91c: 84 40 20 00 addx %g0, 0, %g2
200a920: 85 28 a0 02 sll %g2, 2, %g2
200a924: 98 03 00 02 add %o4, %g2, %o4
200a928: c8 23 20 04 st %g4, [ %o4 + 4 ]
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir));
sibling = parent->child[_RBTree_Opposite_direction(dir)];
}
sibling->color = parent->color;
200a92c: c8 00 60 0c ld [ %g1 + 0xc ], %g4
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) {
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir));
sibling = parent->child[_RBTree_Opposite_direction(dir)];
200a930: 84 00 40 03 add %g1, %g3, %g2
200a934: c4 00 a0 04 ld [ %g2 + 4 ], %g2
}
sibling->color = parent->color;
200a938: c8 20 a0 0c st %g4, [ %g2 + 0xc ]
200a93c: 88 00 80 03 add %g2, %g3, %g4
200a940: c8 01 20 04 ld [ %g4 + 4 ], %g4
parent->color = RBT_BLACK;
200a944: c0 20 60 0c clr [ %g1 + 0xc ]
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
200a948: 10 80 00 33 b 200aa14 <_RBTree_Extract_validate_unprotected+0x2a4>
200a94c: c0 21 20 0c clr [ %g4 + 0xc ]
* 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;
200a950: c8 20 60 0c st %g4, [ %g1 + 0xc ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
200a954: 88 1b 00 08 xor %o4, %o0, %g4
200a958: 80 a0 00 04 cmp %g0, %g4
200a95c: 94 40 20 00 addx %g0, 0, %o2
*/
RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction(
RBTree_Direction the_dir
)
{
return (RBTree_Direction) !((int) the_dir);
200a960: 96 1a a0 01 xor %o2, 1, %o3
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return;
200a964: 97 2a e0 02 sll %o3, 2, %o3
200a968: 98 00 40 0b add %g1, %o3, %o4
200a96c: c8 03 20 04 ld [ %o4 + 4 ], %g4
200a970: 80 a1 20 00 cmp %g4, 0
200a974: 02 80 00 1c be 200a9e4 <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN
200a978: c0 20 a0 0c clr [ %g2 + 0xc ]
c = the_node->child[_RBTree_Opposite_direction(dir)];
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
200a97c: 95 2a a0 02 sll %o2, 2, %o2
200a980: 84 01 00 0a add %g4, %o2, %g2
200a984: d2 00 a0 04 ld [ %g2 + 4 ], %o1
200a988: d2 23 20 04 st %o1, [ %o4 + 4 ]
if (c->child[dir])
200a98c: c4 00 a0 04 ld [ %g2 + 4 ], %g2
200a990: 80 a0 a0 00 cmp %g2, 0
200a994: 02 80 00 04 be 200a9a4 <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN
200a998: 94 01 00 0a add %g4, %o2, %o2
c->child[dir]->parent = the_node;
200a99c: c2 20 80 00 st %g1, [ %g2 ]
200a9a0: c6 00 40 00 ld [ %g1 ], %g3
c->child[dir] = the_node;
200a9a4: c2 22 a0 04 st %g1, [ %o2 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a9a8: c4 00 e0 04 ld [ %g3 + 4 ], %g2
c->parent = the_node->parent;
200a9ac: c6 21 00 00 st %g3, [ %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;
200a9b0: 84 18 40 02 xor %g1, %g2, %g2
200a9b4: 80 a0 00 02 cmp %g0, %g2
200a9b8: 84 40 20 00 addx %g0, 0, %g2
200a9bc: 85 28 a0 02 sll %g2, 2, %g2
200a9c0: 96 00 40 0b add %g1, %o3, %o3
200a9c4: 86 00 c0 02 add %g3, %g2, %g3
c->parent = the_node->parent;
the_node->parent = c;
200a9c8: 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;
200a9cc: c8 20 e0 04 st %g4, [ %g3 + 4 ]
200a9d0: 10 bf ff 7f b 200a7cc <_RBTree_Extract_validate_unprotected+0x5c>
200a9d4: c4 02 e0 04 ld [ %o3 + 4 ], %g2
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
const RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200a9d8: 84 10 20 00 clr %g2 <== NOT EXECUTED
200a9dc: 10 bf ff 9e b 200a854 <_RBTree_Extract_validate_unprotected+0xe4>
200a9e0: 82 10 00 03 mov %g3, %g1
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return;
200a9e4: 10 bf ff 7a b 200a7cc <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED
200a9e8: 84 10 20 00 clr %g2 <== NOT EXECUTED
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200a9ec: 81 c3 e0 08 retl
200a9f0: c0 22 20 0c clr [ %o0 + 0xc ]
200a9f4: 98 00 40 03 add %g1, %g3, %o4
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir));
sibling = parent->child[_RBTree_Opposite_direction(dir)];
}
sibling->color = parent->color;
200a9f8: d6 20 a0 0c st %o3, [ %g2 + 0xc ]
parent->color = RBT_BLACK;
200a9fc: c0 20 60 0c clr [ %g1 + 0xc ]
200aa00: c4 03 20 04 ld [ %o4 + 4 ], %g2
200aa04: 80 a0 a0 00 cmp %g2, 0
200aa08: 02 bf ff 97 be 200a864 <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN
200aa0c: c0 21 20 0c clr [ %g4 + 0xc ]
200aa10: 9b 2b 60 02 sll %o5, 2, %o5
c = the_node->child[_RBTree_Opposite_direction(dir)];
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
200aa14: 88 00 80 0d add %g2, %o5, %g4
200aa18: d8 01 20 04 ld [ %g4 + 4 ], %o4
200aa1c: 86 00 40 03 add %g1, %g3, %g3
200aa20: d8 20 e0 04 st %o4, [ %g3 + 4 ]
if (c->child[dir])
200aa24: c6 01 20 04 ld [ %g4 + 4 ], %g3
200aa28: 80 a0 e0 00 cmp %g3, 0
200aa2c: 32 80 00 02 bne,a 200aa34 <_RBTree_Extract_validate_unprotected+0x2c4>
200aa30: c2 20 c0 00 st %g1, [ %g3 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200aa34: c6 00 40 00 ld [ %g1 ], %g3
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200aa38: 9a 00 80 0d add %g2, %o5, %o5
200aa3c: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200aa40: c8 00 e0 04 ld [ %g3 + 4 ], %g4
c->parent = the_node->parent;
200aa44: c6 20 80 00 st %g3, [ %g2 ]
the_node->parent = c;
200aa48: c4 20 40 00 st %g2, [ %g1 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200aa4c: 88 18 40 04 xor %g1, %g4, %g4
200aa50: 80 a0 00 04 cmp %g0, %g4
200aa54: 82 40 20 00 addx %g0, 0, %g1
200aa58: 83 28 60 02 sll %g1, 2, %g1
200aa5c: 86 00 c0 01 add %g3, %g1, %g3
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200aa60: c2 02 00 00 ld [ %o0 ], %g1
200aa64: c4 20 e0 04 st %g2, [ %g3 + 4 ]
200aa68: c2 00 40 00 ld [ %g1 ], %g1
200aa6c: 80 a0 60 00 cmp %g1, 0
200aa70: 12 bf ff 82 bne 200a878 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
200aa74: 01 00 00 00 nop
200aa78: 30 bf ff dd b,a 200a9ec <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
200aa7c: c2 02 00 00 ld [ %o0 ], %g1
200aa80: c2 00 40 00 ld [ %g1 ], %g1
200aa84: 80 a0 60 00 cmp %g1, 0
200aa88: 12 bf ff 7c bne 200a878 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
200aa8c: 01 00 00 00 nop
200aa90: 30 bf ff d7 b,a 200a9ec <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
0200b688 <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
RBTree_Node *search_node
)
{
200b688: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
200b68c: 7f ff e1 d8 call 2003dec <sparc_disable_interrupts>
200b690: b8 10 00 18 mov %i0, %i4
200b694: b6 10 00 08 mov %o0, %i3
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
RBTree_Node* iter_node = the_rbtree->root;
200b698: fa 06 20 04 ld [ %i0 + 4 ], %i5
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
200b69c: 80 a7 60 00 cmp %i5, 0
200b6a0: 02 80 00 15 be 200b6f4 <_RBTree_Find+0x6c> <== NEVER TAKEN
200b6a4: b0 10 20 00 clr %i0
compare_result = the_rbtree->compare_function(the_node, iter_node);
200b6a8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
200b6ac: 92 10 00 1d mov %i5, %o1
200b6b0: 9f c0 40 00 call %g1
200b6b4: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
200b6b8: 83 3a 20 1f sra %o0, 0x1f, %g1
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( _RBTree_Is_equal( compare_result ) ) {
200b6bc: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
200b6c0: 82 20 40 08 sub %g1, %o0, %g1
200b6c4: 83 30 60 1f srl %g1, 0x1f, %g1
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
200b6c8: 83 28 60 02 sll %g1, 2, %g1
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( _RBTree_Is_equal( compare_result ) ) {
200b6cc: 12 80 00 06 bne 200b6e4 <_RBTree_Find+0x5c>
200b6d0: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
200b6d4: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
200b6d8: 80 a0 a0 00 cmp %g2, 0
200b6dc: 12 80 00 0a bne 200b704 <_RBTree_Find+0x7c>
200b6e0: b0 10 00 1d mov %i5, %i0
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
200b6e4: fa 00 60 04 ld [ %g1 + 4 ], %i5
)
{
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
200b6e8: 80 a7 60 00 cmp %i5, 0
200b6ec: 32 bf ff f0 bne,a 200b6ac <_RBTree_Find+0x24>
200b6f0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return_node = _RBTree_Find_unprotected( the_rbtree, search_node );
_ISR_Enable( level );
200b6f4: 7f ff e1 c2 call 2003dfc <sparc_enable_interrupts>
200b6f8: 90 10 00 1b mov %i3, %o0
return return_node;
}
200b6fc: 81 c7 e0 08 ret
200b700: 81 e8 00 00 restore
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
return_node = _RBTree_Find_unprotected( the_rbtree, search_node );
_ISR_Enable( level );
200b704: 7f ff e1 be call 2003dfc <sparc_enable_interrupts>
200b708: 90 10 00 1b mov %i3, %o0
return return_node;
}
200b70c: 81 c7 e0 08 ret
200b710: 81 e8 00 00 restore
0200baf4 <_RBTree_Initialize>:
void *starting_address,
size_t number_nodes,
size_t node_size,
bool is_unique
)
{
200baf4: 9d e3 bf a0 save %sp, -96, %sp
size_t count;
RBTree_Node *next;
/* TODO: Error message? */
if (!the_rbtree) return;
200baf8: 80 a6 20 00 cmp %i0, 0
200bafc: 02 80 00 0f be 200bb38 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200bb00: 80 a6 e0 00 cmp %i3, 0
RBTree_Control *the_rbtree,
RBTree_Compare_function compare_function,
bool is_unique
)
{
the_rbtree->permanent_null = NULL;
200bb04: c0 26 00 00 clr [ %i0 ]
the_rbtree->root = NULL;
200bb08: c0 26 20 04 clr [ %i0 + 4 ]
the_rbtree->first[0] = NULL;
200bb0c: c0 26 20 08 clr [ %i0 + 8 ]
the_rbtree->first[1] = NULL;
200bb10: c0 26 20 0c clr [ %i0 + 0xc ]
the_rbtree->compare_function = compare_function;
200bb14: f2 26 20 10 st %i1, [ %i0 + 0x10 ]
/* could do sanity checks here */
_RBTree_Initialize_empty(the_rbtree, compare_function, is_unique);
count = number_nodes;
next = starting_address;
while ( count-- ) {
200bb18: 02 80 00 08 be 200bb38 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200bb1c: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ]
_RBTree_Insert_unprotected(the_rbtree, next);
200bb20: 92 10 00 1a mov %i2, %o1
200bb24: 7f ff ff 0b call 200b750 <_RBTree_Insert_unprotected>
200bb28: 90 10 00 18 mov %i0, %o0
/* could do sanity checks here */
_RBTree_Initialize_empty(the_rbtree, compare_function, is_unique);
count = number_nodes;
next = starting_address;
while ( count-- ) {
200bb2c: b6 86 ff ff addcc %i3, -1, %i3
200bb30: 12 bf ff fc bne 200bb20 <_RBTree_Initialize+0x2c>
200bb34: b4 06 80 1c add %i2, %i4, %i2
200bb38: 81 c7 e0 08 ret
200bb3c: 81 e8 00 00 restore
0200ac74 <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
200ac74: 9d e3 bf a0 save %sp, -96, %sp
if(!the_node) return (RBTree_Node*)-1;
200ac78: 80 a6 60 00 cmp %i1, 0
200ac7c: 02 80 00 9c be 200aeec <_RBTree_Insert_unprotected+0x278>
200ac80: b8 10 00 18 mov %i0, %i4
RBTree_Node *iter_node = the_rbtree->root;
200ac84: fa 06 20 04 ld [ %i0 + 4 ], %i5
int compare_result;
if (!iter_node) { /* special case: first node inserted */
200ac88: 80 a7 60 00 cmp %i5, 0
200ac8c: 32 80 00 05 bne,a 200aca0 <_RBTree_Insert_unprotected+0x2c>
200ac90: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
the_node->color = RBT_BLACK;
200ac94: 10 80 00 9a b 200aefc <_RBTree_Insert_unprotected+0x288>
200ac98: c0 26 60 0c clr [ %i1 + 0xc ]
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) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
200ac9c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
200aca0: 92 10 00 1d mov %i5, %o1
200aca4: 9f c0 40 00 call %g1
200aca8: 90 10 00 19 mov %i1, %o0
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
200acac: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
200acb0: b6 38 00 08 xnor %g0, %o0, %i3
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) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
200acb4: 80 a0 a0 00 cmp %g2, 0
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
200acb8: b7 36 e0 1f srl %i3, 0x1f, %i3
if (!iter_node->child[dir]) {
200acbc: 83 2e e0 02 sll %i3, 2, %g1
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) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
200acc0: 02 80 00 05 be 200acd4 <_RBTree_Insert_unprotected+0x60>
200acc4: 82 07 40 01 add %i5, %g1, %g1
200acc8: 80 a2 20 00 cmp %o0, 0
200accc: 02 80 00 8a be 200aef4 <_RBTree_Insert_unprotected+0x280>
200acd0: 01 00 00 00 nop
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
200acd4: f0 00 60 04 ld [ %g1 + 4 ], %i0
200acd8: 80 a6 20 00 cmp %i0, 0
200acdc: 32 bf ff f0 bne,a 200ac9c <_RBTree_Insert_unprotected+0x28>
200ace0: ba 10 00 18 mov %i0, %i5
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
compare_result = the_rbtree->compare_function(
200ace4: c4 07 20 10 ld [ %i4 + 0x10 ], %g2
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First(
const RBTree_Control *the_rbtree,
RBTree_Direction dir
)
{
return the_rbtree->first[dir];
200ace8: b4 06 e0 02 add %i3, 2, %i2
200acec: 87 2e a0 02 sll %i2, 2, %g3
200acf0: d2 07 00 03 ld [ %i4 + %g3 ], %o1
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
200acf4: c0 26 60 08 clr [ %i1 + 8 ]
200acf8: c0 26 60 04 clr [ %i1 + 4 ]
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
200acfc: f2 20 60 04 st %i1, [ %g1 + 4 ]
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
200ad00: 82 10 20 01 mov 1, %g1
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
200ad04: fa 26 40 00 st %i5, [ %i1 ]
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
200ad08: c2 26 60 0c st %g1, [ %i1 + 0xc ]
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
compare_result = the_rbtree->compare_function(
200ad0c: 9f c0 80 00 call %g2
200ad10: 90 10 00 19 mov %i1, %o0
the_node,
_RBTree_First(the_rbtree, dir)
);
if ( (!dir && _RBTree_Is_lesser(compare_result)) ||
200ad14: 80 a6 e0 00 cmp %i3, 0
200ad18: 12 80 00 10 bne 200ad58 <_RBTree_Insert_unprotected+0xe4>
200ad1c: 80 a2 20 00 cmp %o0, 0
200ad20: 06 80 00 10 bl 200ad60 <_RBTree_Insert_unprotected+0xec>
200ad24: b5 2e a0 02 sll %i2, 2, %i2
200ad28: c2 06 40 00 ld [ %i1 ], %g1
if (dir != pdir) {
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
}
the_node->parent->color = RBT_BLACK;
g->color = RBT_RED;
200ad2c: b4 10 20 01 mov 1, %i2
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
const RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
200ad30: c4 00 40 00 ld [ %g1 ], %g2
200ad34: 86 90 a0 00 orcc %g2, 0, %g3
200ad38: 22 80 00 06 be,a 200ad50 <_RBTree_Insert_unprotected+0xdc>
200ad3c: c0 26 60 0c clr [ %i1 + 0xc ]
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200ad40: c8 00 60 0c ld [ %g1 + 0xc ], %g4
200ad44: 80 a1 20 01 cmp %g4, 1
200ad48: 22 80 00 08 be,a 200ad68 <_RBTree_Insert_unprotected+0xf4>
200ad4c: f6 00 80 00 ld [ %g2 ], %i3
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
200ad50: 81 c7 e0 08 ret
200ad54: 81 e8 00 00 restore
compare_result = the_rbtree->compare_function(
the_node,
_RBTree_First(the_rbtree, dir)
);
if ( (!dir && _RBTree_Is_lesser(compare_result)) ||
(dir && _RBTree_Is_greater(compare_result)) ) {
200ad58: 04 bf ff f4 ble 200ad28 <_RBTree_Insert_unprotected+0xb4>
200ad5c: b5 2e a0 02 sll %i2, 2, %i2
the_rbtree->first[dir] = the_node;
200ad60: 10 bf ff f2 b 200ad28 <_RBTree_Insert_unprotected+0xb4>
200ad64: f2 27 00 1a st %i1, [ %i4 + %i2 ]
)
{
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;
200ad68: 80 a6 e0 00 cmp %i3, 0
200ad6c: 02 80 00 0c be 200ad9c <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN
200ad70: c8 00 a0 04 ld [ %g2 + 4 ], %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])
200ad74: 80 a1 00 01 cmp %g4, %g1
200ad78: 02 80 00 5b be 200aee4 <_RBTree_Insert_unprotected+0x270>
200ad7c: ba 10 00 04 mov %g4, %i5
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200ad80: 80 a7 60 00 cmp %i5, 0
200ad84: 22 80 00 07 be,a 200ada0 <_RBTree_Insert_unprotected+0x12c>
200ad88: fa 00 60 04 ld [ %g1 + 4 ], %i5
200ad8c: f8 07 60 0c ld [ %i5 + 0xc ], %i4
200ad90: 80 a7 20 01 cmp %i4, 1
200ad94: 22 80 00 4f be,a 200aed0 <_RBTree_Insert_unprotected+0x25c>
200ad98: c0 20 60 0c clr [ %g1 + 0xc ]
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];
200ad9c: fa 00 60 04 ld [ %g1 + 4 ], %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
200ada0: 88 18 40 04 xor %g1, %g4, %g4
200ada4: 80 a0 00 04 cmp %g0, %g4
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];
200ada8: ba 1e 40 1d xor %i1, %i5, %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
200adac: 88 40 20 00 addx %g0, 0, %g4
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];
200adb0: 80 a0 00 1d cmp %g0, %i5
200adb4: ba 40 20 00 addx %g0, 0, %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
200adb8: 80 a7 40 04 cmp %i5, %g4
200adbc: 02 80 00 20 be 200ae3c <_RBTree_Insert_unprotected+0x1c8>
200adc0: 80 a0 00 04 cmp %g0, %g4
*/
RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction(
RBTree_Direction the_dir
)
{
return (RBTree_Direction) !((int) the_dir);
200adc4: b6 60 3f ff subx %g0, -1, %i3
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return;
200adc8: b7 2e e0 02 sll %i3, 2, %i3
200adcc: b6 00 40 1b add %g1, %i3, %i3
200add0: fa 06 e0 04 ld [ %i3 + 4 ], %i5
200add4: 80 a7 60 00 cmp %i5, 0
200add8: 02 80 00 16 be 200ae30 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN
200addc: b9 29 20 02 sll %g4, 2, %i4
c = the_node->child[_RBTree_Opposite_direction(dir)];
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
200ade0: 9e 07 40 1c add %i5, %i4, %o7
200ade4: da 03 e0 04 ld [ %o7 + 4 ], %o5
200ade8: da 26 e0 04 st %o5, [ %i3 + 4 ]
if (c->child[dir])
200adec: f6 03 e0 04 ld [ %o7 + 4 ], %i3
200adf0: 80 a6 e0 00 cmp %i3, 0
200adf4: 22 80 00 05 be,a 200ae08 <_RBTree_Insert_unprotected+0x194>
200adf8: b6 07 40 1c add %i5, %i4, %i3
c->child[dir]->parent = the_node;
200adfc: c2 26 c0 00 st %g1, [ %i3 ]
200ae00: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
200ae04: b6 07 40 1c add %i5, %i4, %i3
200ae08: c2 26 e0 04 st %g1, [ %i3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200ae0c: f6 00 a0 04 ld [ %g2 + 4 ], %i3
c->parent = the_node->parent;
200ae10: c4 27 40 00 st %g2, [ %i5 ]
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;
200ae14: b6 1e c0 01 xor %i3, %g1, %i3
c->parent = the_node->parent;
the_node->parent = c;
200ae18: fa 20 40 00 st %i5, [ %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;
200ae1c: 80 a0 00 1b cmp %g0, %i3
200ae20: 82 40 20 00 addx %g0, 0, %g1
200ae24: 83 28 60 02 sll %g1, 2, %g1
200ae28: 84 00 80 01 add %g2, %g1, %g2
200ae2c: fa 20 a0 04 st %i5, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
200ae30: b2 06 40 1c add %i1, %i4, %i1
200ae34: f2 06 60 04 ld [ %i1 + 4 ], %i1
200ae38: c2 06 40 00 ld [ %i1 ], %g1
}
the_node->parent->color = RBT_BLACK;
200ae3c: c0 20 60 0c clr [ %g1 + 0xc ]
g->color = RBT_RED;
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
200ae40: 88 26 80 04 sub %i2, %g4, %g4
200ae44: ba 19 20 01 xor %g4, 1, %i5
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return;
200ae48: bb 2f 60 02 sll %i5, 2, %i5
200ae4c: ba 00 c0 1d add %g3, %i5, %i5
200ae50: c4 07 60 04 ld [ %i5 + 4 ], %g2
200ae54: 80 a0 a0 00 cmp %g2, 0
200ae58: 02 bf ff b6 be 200ad30 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN
200ae5c: f4 20 e0 0c st %i2, [ %g3 + 0xc ]
c = the_node->child[_RBTree_Opposite_direction(dir)];
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
200ae60: 89 29 20 02 sll %g4, 2, %g4
200ae64: 82 00 80 04 add %g2, %g4, %g1
200ae68: f8 00 60 04 ld [ %g1 + 4 ], %i4
200ae6c: f8 27 60 04 st %i4, [ %i5 + 4 ]
if (c->child[dir])
200ae70: c2 00 60 04 ld [ %g1 + 4 ], %g1
200ae74: 80 a0 60 00 cmp %g1, 0
200ae78: 32 80 00 02 bne,a 200ae80 <_RBTree_Insert_unprotected+0x20c>
200ae7c: c6 20 40 00 st %g3, [ %g1 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200ae80: fa 00 c0 00 ld [ %g3 ], %i5
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200ae84: 88 00 80 04 add %g2, %g4, %g4
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
c->parent = the_node->parent;
200ae88: fa 20 80 00 st %i5, [ %g2 ]
the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200ae8c: c6 21 20 04 st %g3, [ %g4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200ae90: c8 07 60 04 ld [ %i5 + 4 ], %g4
c->parent = the_node->parent;
the_node->parent = c;
200ae94: c4 20 c0 00 st %g2, [ %g3 ]
200ae98: c2 06 40 00 ld [ %i1 ], %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;
200ae9c: 86 18 c0 04 xor %g3, %g4, %g3
200aea0: 80 a0 00 03 cmp %g0, %g3
200aea4: 86 40 20 00 addx %g0, 0, %g3
200aea8: 87 28 e0 02 sll %g3, 2, %g3
200aeac: ba 07 40 03 add %i5, %g3, %i5
200aeb0: c4 27 60 04 st %g2, [ %i5 + 4 ]
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
const RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
200aeb4: c4 00 40 00 ld [ %g1 ], %g2
200aeb8: 86 90 a0 00 orcc %g2, 0, %g3
200aebc: 32 bf ff a2 bne,a 200ad44 <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN
200aec0: c8 00 60 0c ld [ %g1 + 0xc ], %g4
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200aec4: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
200aec8: 81 c7 e0 08 ret <== NOT EXECUTED
200aecc: 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;
200aed0: c0 27 60 0c clr [ %i5 + 0xc ]
g->color = RBT_RED;
200aed4: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
200aed8: 82 10 00 1b mov %i3, %g1
200aedc: 10 bf ff 95 b 200ad30 <_RBTree_Insert_unprotected+0xbc>
200aee0: b2 10 00 02 mov %g2, %i1
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];
200aee4: 10 bf ff a7 b 200ad80 <_RBTree_Insert_unprotected+0x10c>
200aee8: fa 00 a0 08 ld [ %g2 + 8 ], %i5
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
if(!the_node) return (RBTree_Node*)-1;
200aeec: 81 c7 e0 08 ret
200aef0: 91 e8 3f ff restore %g0, -1, %o0
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) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
200aef4: 81 c7 e0 08 ret
200aef8: 91 e8 00 1d restore %g0, %i5, %o0
RBTree_Node *iter_node = the_rbtree->root;
int compare_result;
if (!iter_node) { /* special case: first node inserted */
the_node->color = RBT_BLACK;
the_rbtree->root = the_node;
200aefc: f2 26 20 04 st %i1, [ %i0 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
200af00: f2 26 20 0c st %i1, [ %i0 + 0xc ]
200af04: f2 26 20 08 st %i1, [ %i0 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
200af08: f0 26 40 00 st %i0, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
200af0c: c0 26 60 08 clr [ %i1 + 8 ]
200af10: c0 26 60 04 clr [ %i1 + 4 ]
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
200af14: 81 c7 e0 08 ret
200af18: 91 e8 20 00 restore %g0, 0, %o0
0200af4c <_RBTree_Iterate_unprotected>:
const RBTree_Control *rbtree,
RBTree_Direction dir,
RBTree_Visitor visitor,
void *visitor_arg
)
{
200af4c: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction(
RBTree_Direction the_dir
)
{
return (RBTree_Direction) !((int) the_dir);
200af50: 80 a0 00 19 cmp %g0, %i1
200af54: 82 60 3f ff subx %g0, -1, %g1
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First(
const RBTree_Control *the_rbtree,
RBTree_Direction dir
)
{
return the_rbtree->first[dir];
200af58: 82 00 60 02 add %g1, 2, %g1
200af5c: 83 28 60 02 sll %g1, 2, %g1
200af60: fa 06 00 01 ld [ %i0 + %g1 ], %i5
RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir );
const RBTree_Node *current = _RBTree_First( rbtree, opp_dir );
bool stop = false;
while ( !stop && current != NULL ) {
200af64: 80 a7 60 00 cmp %i5, 0
200af68: 12 80 00 06 bne 200af80 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN
200af6c: 94 10 00 1b mov %i3, %o2
200af70: 30 80 00 0e b,a 200afa8 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED
200af74: 80 8f 20 ff btst 0xff, %i4
200af78: 02 80 00 0c be 200afa8 <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN
200af7c: 94 10 00 1b mov %i3, %o2
stop = (*visitor)( current, dir, visitor_arg );
200af80: 90 10 00 1d mov %i5, %o0
200af84: 9f c6 80 00 call %i2
200af88: 92 10 00 19 mov %i1, %o1
current = _RBTree_Next_unprotected( current, dir );
200af8c: 92 10 00 19 mov %i1, %o1
RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir );
const RBTree_Node *current = _RBTree_First( rbtree, opp_dir );
bool stop = false;
while ( !stop && current != NULL ) {
stop = (*visitor)( current, dir, visitor_arg );
200af90: b8 10 00 08 mov %o0, %i4
current = _RBTree_Next_unprotected( current, dir );
200af94: 40 00 00 07 call 200afb0 <_RBTree_Next_unprotected>
200af98: 90 10 00 1d mov %i5, %o0
{
RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir );
const RBTree_Node *current = _RBTree_First( rbtree, opp_dir );
bool stop = false;
while ( !stop && current != NULL ) {
200af9c: ba 92 20 00 orcc %o0, 0, %i5
200afa0: 12 bf ff f5 bne 200af74 <_RBTree_Iterate_unprotected+0x28>
200afa4: b8 1f 20 01 xor %i4, 1, %i4
200afa8: 81 c7 e0 08 ret
200afac: 81 e8 00 00 restore
02008190 <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
2008190: 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;
2008194: 03 00 80 71 sethi %hi(0x201c400), %g1
2008198: 82 10 61 00 or %g1, 0x100, %g1 ! 201c500 <Configuration_RTEMS_API>
200819c: 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 )
20081a0: 80 a7 60 00 cmp %i5, 0
20081a4: 02 80 00 18 be 2008204 <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
20081a8: 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++ ) {
20081ac: 80 a6 e0 00 cmp %i3, 0
20081b0: 02 80 00 15 be 2008204 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
20081b4: b8 10 20 00 clr %i4
return_value = rtems_task_create(
20081b8: d4 07 60 04 ld [ %i5 + 4 ], %o2
20081bc: d0 07 40 00 ld [ %i5 ], %o0
20081c0: d2 07 60 08 ld [ %i5 + 8 ], %o1
20081c4: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
20081c8: d8 07 60 0c ld [ %i5 + 0xc ], %o4
20081cc: 7f ff ff 70 call 2007f8c <rtems_task_create>
20081d0: 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 ) )
20081d4: 94 92 20 00 orcc %o0, 0, %o2
20081d8: 12 80 00 0d bne 200820c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
20081dc: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
20081e0: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
20081e4: 40 00 00 0e call 200821c <rtems_task_start>
20081e8: 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 ) )
20081ec: 94 92 20 00 orcc %o0, 0, %o2
20081f0: 12 80 00 07 bne 200820c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
20081f4: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
20081f8: 80 a7 00 1b cmp %i4, %i3
20081fc: 12 bf ff ef bne 20081b8 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
2008200: ba 07 60 1c add %i5, 0x1c, %i5
2008204: 81 c7 e0 08 ret
2008208: 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 );
200820c: 90 10 20 01 mov 1, %o0
2008210: 40 00 04 0e call 2009248 <_Internal_error_Occurred>
2008214: 92 10 20 01 mov 1, %o1
0200d3f0 <_RTEMS_tasks_Post_switch_extension>:
*/
static void _RTEMS_tasks_Post_switch_extension(
Thread_Control *executing
)
{
200d3f0: 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 ];
200d3f4: fa 06 21 50 ld [ %i0 + 0x150 ], %i5
if ( !api )
200d3f8: 80 a7 60 00 cmp %i5, 0
200d3fc: 02 80 00 1e be 200d474 <_RTEMS_tasks_Post_switch_extension+0x84><== NEVER TAKEN
200d400: 01 00 00 00 nop
* Signal Processing
*/
asr = &api->Signal;
_ISR_Disable( level );
200d404: 7f ff d4 d8 call 2002764 <sparc_disable_interrupts>
200d408: 01 00 00 00 nop
signal_set = asr->signals_posted;
200d40c: f8 07 60 14 ld [ %i5 + 0x14 ], %i4
asr->signals_posted = 0;
200d410: c0 27 60 14 clr [ %i5 + 0x14 ]
_ISR_Enable( level );
200d414: 7f ff d4 d8 call 2002774 <sparc_enable_interrupts>
200d418: 01 00 00 00 nop
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
200d41c: 80 a7 20 00 cmp %i4, 0
200d420: 32 80 00 04 bne,a 200d430 <_RTEMS_tasks_Post_switch_extension+0x40>
200d424: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200d428: 81 c7 e0 08 ret
200d42c: 81 e8 00 00 restore
return;
asr->nest_level += 1;
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200d430: d0 07 60 10 ld [ %i5 + 0x10 ], %o0
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
200d434: 82 00 60 01 inc %g1
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200d438: 94 07 bf fc add %fp, -4, %o2
200d43c: 37 00 00 3f sethi %hi(0xfc00), %i3
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
200d440: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
200d444: 40 00 07 e6 call 200f3dc <rtems_task_mode>
200d448: 92 16 e3 ff or %i3, 0x3ff, %o1
(*asr->handler)( signal_set );
200d44c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200d450: 9f c0 40 00 call %g1
200d454: 90 10 00 1c mov %i4, %o0
asr->nest_level -= 1;
200d458: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200d45c: 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;
200d460: 82 00 7f ff add %g1, -1, %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
200d464: 92 16 e3 ff or %i3, 0x3ff, %o1
200d468: 94 07 bf fc add %fp, -4, %o2
200d46c: 40 00 07 dc call 200f3dc <rtems_task_mode>
200d470: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
200d474: 81 c7 e0 08 ret
200d478: 81 e8 00 00 restore
0200d278 <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
200d278: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
while (tvp) {
200d27c: 80 a0 60 00 cmp %g1, 0
200d280: 22 80 00 0c be,a 200d2b0 <_RTEMS_tasks_Switch_extension+0x38>
200d284: c2 02 61 5c ld [ %o1 + 0x15c ], %g1
tvp->tval = *tvp->ptr;
200d288: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
200d28c: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
200d290: c8 00 80 00 ld [ %g2 ], %g4
200d294: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
200d298: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200d29c: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
200d2a0: 80 a0 60 00 cmp %g1, 0
200d2a4: 32 bf ff fa bne,a 200d28c <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
200d2a8: 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;
200d2ac: c2 02 61 5c ld [ %o1 + 0x15c ], %g1
while (tvp) {
200d2b0: 80 a0 60 00 cmp %g1, 0
200d2b4: 02 80 00 0d be 200d2e8 <_RTEMS_tasks_Switch_extension+0x70>
200d2b8: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
200d2bc: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
200d2c0: 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;
200d2c4: c8 00 80 00 ld [ %g2 ], %g4
200d2c8: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
200d2cc: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200d2d0: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
200d2d4: 80 a0 60 00 cmp %g1, 0
200d2d8: 32 bf ff fa bne,a 200d2c0 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
200d2dc: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
200d2e0: 81 c3 e0 08 retl
200d2e4: 01 00 00 00 nop
200d2e8: 81 c3 e0 08 retl
02044540 <_Rate_monotonic_Get_status>:
bool _Rate_monotonic_Get_status(
Rate_monotonic_Control *the_period,
Rate_monotonic_Period_time_t *wall_since_last_period,
Thread_CPU_usage_t *cpu_since_last_period
)
{
2044540: 9d e3 bf 98 save %sp, -104, %sp
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
Timestamp_Control uptime;
#endif
Thread_Control *owning_thread = the_period->owner;
2044544: f6 06 20 40 ld [ %i0 + 0x40 ], %i3
/*
* Determine elapsed wall time since period initiated.
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_TOD_Get_uptime( &uptime );
2044548: 7f ff a8 ce call 202e880 <_TOD_Get_uptime>
204454c: 90 07 bf f8 add %fp, -8, %o0
_Timestamp_Subtract(
2044550: c4 1f bf f8 ldd [ %fp + -8 ], %g2
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
2044554: f8 1e 20 50 ldd [ %i0 + 0x50 ], %i4
* Determine cpu usage since period initiated.
*/
used = owning_thread->cpu_time_used;
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
if (owning_thread == _Thread_Executing) {
2044558: 03 00 81 d2 sethi %hi(0x2074800), %g1
204455c: 82 10 60 00 mov %g1, %g1 ! 2074800 <_Per_CPU_Information>
2044560: de 00 60 0c ld [ %g1 + 0xc ], %o7
2044564: ba a0 c0 1d subcc %g3, %i5, %i5
2044568: b8 60 80 1c subx %g2, %i4, %i4
204456c: f8 3e 40 00 std %i4, [ %i1 ]
if (used < the_period->cpu_usage_period_initiated)
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
2044570: 88 10 20 01 mov 1, %g4
* Determine cpu usage since period initiated.
*/
used = owning_thread->cpu_time_used;
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
if (owning_thread == _Thread_Executing) {
2044574: 80 a3 c0 1b cmp %o7, %i3
2044578: 02 80 00 05 be 204458c <_Rate_monotonic_Get_status+0x4c>
204457c: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
}
2044580: b0 09 20 01 and %g4, 1, %i0
2044584: 81 c7 e0 08 ret
2044588: 81 e8 00 00 restore
204458c: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2044590: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0
2044594: 86 a0 c0 0d subcc %g3, %o5, %g3
2044598: 84 60 80 0c subx %g2, %o4, %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
204459c: ba 87 40 03 addcc %i5, %g3, %i5
20445a0: b8 47 00 02 addx %i4, %g2, %i4
/*
* The cpu usage info was reset while executing. Can't
* determine a status.
*/
if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated))
20445a4: 80 a6 00 1c cmp %i0, %i4
20445a8: 14 bf ff f6 bg 2044580 <_Rate_monotonic_Get_status+0x40> <== NEVER TAKEN
20445ac: 88 10 20 00 clr %g4
20445b0: 02 80 00 09 be 20445d4 <_Rate_monotonic_Get_status+0x94>
20445b4: 80 a6 40 1d cmp %i1, %i5
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
20445b8: ba a7 40 19 subcc %i5, %i1, %i5
if (used < the_period->cpu_usage_period_initiated)
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
20445bc: 88 10 20 01 mov 1, %g4
20445c0: b8 67 00 18 subx %i4, %i0, %i4
}
20445c4: b0 09 20 01 and %g4, 1, %i0
20445c8: f8 3e 80 00 std %i4, [ %i2 ]
20445cc: 81 c7 e0 08 ret
20445d0: 81 e8 00 00 restore
/*
* The cpu usage info was reset while executing. Can't
* determine a status.
*/
if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated))
20445d4: 28 bf ff fa bleu,a 20445bc <_Rate_monotonic_Get_status+0x7c>
20445d8: ba a7 40 19 subcc %i5, %i1, %i5
return false;
20445dc: 10 bf ff e9 b 2044580 <_Rate_monotonic_Get_status+0x40>
20445e0: 88 10 20 00 clr %g4
02044980 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2044980: 9d e3 bf 98 save %sp, -104, %sp
2044984: 11 00 81 d2 sethi %hi(0x2074800), %o0
2044988: 92 10 00 18 mov %i0, %o1
204498c: 90 12 22 d0 or %o0, 0x2d0, %o0
2044990: 7f ff 2d 5f call 200ff0c <_Objects_Get>
2044994: 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 ) {
2044998: c2 07 bf fc ld [ %fp + -4 ], %g1
204499c: 80 a0 60 00 cmp %g1, 0
20449a0: 12 80 00 17 bne 20449fc <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN
20449a4: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
20449a8: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
20449ac: 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);
20449b0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
20449b4: 80 88 80 01 btst %g2, %g1
20449b8: 22 80 00 08 be,a 20449d8 <_Rate_monotonic_Timeout+0x58>
20449bc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
20449c0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
20449c4: c2 07 60 08 ld [ %i5 + 8 ], %g1
20449c8: 80 a0 80 01 cmp %g2, %g1
20449cc: 02 80 00 1a be 2044a34 <_Rate_monotonic_Timeout+0xb4>
20449d0: 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 ) {
20449d4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
20449d8: 80 a0 60 01 cmp %g1, 1
20449dc: 02 80 00 0a be 2044a04 <_Rate_monotonic_Timeout+0x84>
20449e0: 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;
20449e4: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
20449e8: 03 00 81 d1 sethi %hi(0x2074400), %g1
20449ec: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20745e0 <_Thread_Dispatch_disable_level>
20449f0: 84 00 bf ff add %g2, -1, %g2
20449f4: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ]
return _Thread_Dispatch_disable_level;
20449f8: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1
20449fc: 81 c7 e0 08 ret
2044a00: 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;
2044a04: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
2044a08: 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;
2044a0c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
2044a10: 7f ff ff 44 call 2044720 <_Rate_monotonic_Initiate_statistics>
2044a14: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2044a18: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2044a1c: 11 00 81 d1 sethi %hi(0x2074400), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2044a20: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2044a24: 90 12 22 88 or %o0, 0x288, %o0
2044a28: 7f ff 34 8d call 2011c5c <_Watchdog_Insert>
2044a2c: 92 07 60 10 add %i5, 0x10, %o1
2044a30: 30 bf ff ee b,a 20449e8 <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2044a34: 7f ff 30 22 call 2010abc <_Thread_Clear_state>
2044a38: 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 );
2044a3c: 10 bf ff f5 b 2044a10 <_Rate_monotonic_Timeout+0x90>
2044a40: 90 10 00 1d mov %i5, %o0
020445e4 <_Rate_monotonic_Update_statistics>:
}
static void _Rate_monotonic_Update_statistics(
Rate_monotonic_Control *the_period
)
{
20445e4: 9d e3 bf 90 save %sp, -112, %sp
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
20445e8: c4 06 20 58 ld [ %i0 + 0x58 ], %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
20445ec: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
20445f0: 84 00 a0 01 inc %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
20445f4: 80 a0 60 04 cmp %g1, 4
20445f8: 02 80 00 32 be 20446c0 <_Rate_monotonic_Update_statistics+0xdc>
20445fc: c4 26 20 58 st %g2, [ %i0 + 0x58 ]
stats->missed_count++;
/*
* Grab status for time statistics.
*/
valid_status =
2044600: 90 10 00 18 mov %i0, %o0
2044604: 92 07 bf f8 add %fp, -8, %o1
2044608: 7f ff ff ce call 2044540 <_Rate_monotonic_Get_status>
204460c: 94 07 bf f0 add %fp, -16, %o2
_Rate_monotonic_Get_status( the_period, &since_last_period, &executed );
if (!valid_status)
2044610: 80 8a 20 ff btst 0xff, %o0
2044614: 02 80 00 21 be 2044698 <_Rate_monotonic_Update_statistics+0xb4>
2044618: c4 1f bf f0 ldd [ %fp + -16 ], %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
204461c: f8 1e 20 70 ldd [ %i0 + 0x70 ], %i4
* Update CPU time
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_Timestamp_Add_to( &stats->total_cpu_time, &executed );
if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) )
2044620: c2 06 20 60 ld [ %i0 + 0x60 ], %g1
2044624: ba 87 40 03 addcc %i5, %g3, %i5
2044628: b8 47 00 02 addx %i4, %g2, %i4
204462c: 80 a0 40 02 cmp %g1, %g2
2044630: 04 80 00 1c ble 20446a0 <_Rate_monotonic_Update_statistics+0xbc>
2044634: f8 3e 20 70 std %i4, [ %i0 + 0x70 ]
stats->min_cpu_time = executed;
2044638: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) )
204463c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
2044640: 80 a0 40 02 cmp %g1, %g2
2044644: 26 80 00 05 bl,a 2044658 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN
2044648: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED
204464c: 80 a0 40 02 cmp %g1, %g2
2044650: 22 80 00 28 be,a 20446f0 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN
2044654: c2 06 20 6c ld [ %i0 + 0x6c ], %g1
/*
* Update Wall time
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_Timestamp_Add_to( &stats->total_wall_time, &since_last_period );
2044658: c4 1f bf f8 ldd [ %fp + -8 ], %g2
204465c: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4
if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) )
2044660: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
2044664: ba 87 40 03 addcc %i5, %g3, %i5
2044668: b8 47 00 02 addx %i4, %g2, %i4
204466c: 80 a0 40 02 cmp %g1, %g2
2044670: 14 80 00 1b bg 20446dc <_Rate_monotonic_Update_statistics+0xf8>
2044674: f8 3e 20 88 std %i4, [ %i0 + 0x88 ]
2044678: 80 a0 40 02 cmp %g1, %g2
204467c: 22 80 00 15 be,a 20446d0 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN
2044680: c2 06 20 7c ld [ %i0 + 0x7c ], %g1
stats->min_wall_time = since_last_period;
if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) )
2044684: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED
2044688: 80 a0 40 02 cmp %g1, %g2
204468c: 16 80 00 1e bge 2044704 <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN
2044690: 01 00 00 00 nop
stats->max_wall_time = since_last_period;
2044694: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED
2044698: 81 c7 e0 08 ret
204469c: 81 e8 00 00 restore
* Update CPU time
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_Timestamp_Add_to( &stats->total_cpu_time, &executed );
if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) )
20446a0: 32 bf ff e8 bne,a 2044640 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN
20446a4: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED
20446a8: c2 06 20 64 ld [ %i0 + 0x64 ], %g1
20446ac: 80 a0 40 03 cmp %g1, %g3
20446b0: 28 bf ff e4 bleu,a 2044640 <_Rate_monotonic_Update_statistics+0x5c>
20446b4: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
stats->min_cpu_time = executed;
20446b8: 10 bf ff e1 b 204463c <_Rate_monotonic_Update_statistics+0x58>
20446bc: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
*/
stats = &the_period->Statistics;
stats->count++;
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
stats->missed_count++;
20446c0: c2 06 20 5c ld [ %i0 + 0x5c ], %g1
20446c4: 82 00 60 01 inc %g1
20446c8: 10 bf ff ce b 2044600 <_Rate_monotonic_Update_statistics+0x1c>
20446cc: c2 26 20 5c st %g1, [ %i0 + 0x5c ]
* Update Wall time
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_Timestamp_Add_to( &stats->total_wall_time, &since_last_period );
if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) )
20446d0: 80 a0 40 03 cmp %g1, %g3
20446d4: 28 bf ff ed bleu,a 2044688 <_Rate_monotonic_Update_statistics+0xa4>
20446d8: c2 06 20 80 ld [ %i0 + 0x80 ], %g1
stats->min_wall_time = since_last_period;
if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) )
20446dc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1
20446e0: 80 a0 40 02 cmp %g1, %g2
20446e4: 06 bf ff ec bl 2044694 <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN
20446e8: c4 3e 20 78 std %g2, [ %i0 + 0x78 ]
20446ec: 30 80 00 06 b,a 2044704 <_Rate_monotonic_Update_statistics+0x120>
_Timestamp_Add_to( &stats->total_cpu_time, &executed );
if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) )
stats->min_cpu_time = executed;
if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) )
20446f0: 80 a0 40 03 cmp %g1, %g3
20446f4: 3a bf ff da bcc,a 204465c <_Rate_monotonic_Update_statistics+0x78>
20446f8: c4 1f bf f8 ldd [ %fp + -8 ], %g2
stats->max_cpu_time = executed;
20446fc: 10 bf ff d7 b 2044658 <_Rate_monotonic_Update_statistics+0x74>
2044700: c4 3e 20 68 std %g2, [ %i0 + 0x68 ]
_Timestamp_Add_to( &stats->total_wall_time, &since_last_period );
if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) )
stats->min_wall_time = since_last_period;
if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) )
2044704: 12 bf ff e5 bne 2044698 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN
2044708: 01 00 00 00 nop
204470c: c2 06 20 84 ld [ %i0 + 0x84 ], %g1
2044710: 80 a0 40 03 cmp %g1, %g3
2044714: 2a bf ff e1 bcs,a 2044698 <_Rate_monotonic_Update_statistics+0xb4>
2044718: c4 3e 20 80 std %g2, [ %i0 + 0x80 ]
204471c: 30 bf ff df b,a 2044698 <_Rate_monotonic_Update_statistics+0xb4>
0200a73c <_Scheduler_CBS_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_CBS_Allocate(
Thread_Control *the_thread
)
{
200a73c: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_CBS_Per_thread *schinfo;
sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread));
200a740: 40 00 07 1b call 200c3ac <_Workspace_Allocate>
200a744: 90 10 20 1c mov 0x1c, %o0
if ( sched ) {
200a748: 80 a2 20 00 cmp %o0, 0
200a74c: 02 80 00 06 be 200a764 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN
200a750: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
200a754: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info);
schinfo->edf_per_thread.thread = the_thread;
200a758: f0 22 00 00 st %i0, [ %o0 ]
schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
200a75c: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
schinfo->cbs_server = NULL;
200a760: c0 22 20 18 clr [ %o0 + 0x18 ]
}
return sched;
}
200a764: 81 c7 e0 08 ret
200a768: 91 e8 00 08 restore %g0, %o0, %o0
0200bb78 <_Scheduler_CBS_Budget_callout>:
Scheduler_CBS_Server **_Scheduler_CBS_Server_list;
void _Scheduler_CBS_Budget_callout(
Thread_Control *the_thread
)
{
200bb78: 9d e3 bf 98 save %sp, -104, %sp
Priority_Control new_priority;
Scheduler_CBS_Per_thread *sched_info;
Scheduler_CBS_Server_id server_id;
/* Put violating task to background until the end of period. */
new_priority = the_thread->Start.initial_priority;
200bb7c: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
200bb80: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200bb84: 80 a0 40 09 cmp %g1, %o1
200bb88: 32 80 00 02 bne,a 200bb90 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN
200bb8c: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
200bb90: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200bb94: 80 a0 40 09 cmp %g1, %o1
200bb98: 02 80 00 04 be 200bba8 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN
200bb9c: 90 10 00 18 mov %i0, %o0
_Thread_Change_priority(the_thread, new_priority, true);
200bba0: 40 00 01 90 call 200c1e0 <_Thread_Change_priority>
200bba4: 94 10 20 01 mov 1, %o2
/* Invoke callback function if any. */
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
200bba8: fa 06 20 88 ld [ %i0 + 0x88 ], %i5
if ( sched_info->cbs_server->cbs_budget_overrun ) {
200bbac: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200bbb0: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200bbb4: 80 a0 a0 00 cmp %g2, 0
200bbb8: 02 80 00 09 be 200bbdc <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN
200bbbc: 01 00 00 00 nop
_Scheduler_CBS_Get_server_id(
200bbc0: d0 00 40 00 ld [ %g1 ], %o0
200bbc4: 7f ff ff d5 call 200bb18 <_Scheduler_CBS_Get_server_id>
200bbc8: 92 07 bf fc add %fp, -4, %o1
sched_info->cbs_server->task_id,
&server_id
);
sched_info->cbs_server->cbs_budget_overrun( server_id );
200bbcc: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200bbd0: c2 00 60 0c ld [ %g1 + 0xc ], %g1
200bbd4: 9f c0 40 00 call %g1
200bbd8: d0 07 bf fc ld [ %fp + -4 ], %o0
200bbdc: 81 c7 e0 08 ret
200bbe0: 81 e8 00 00 restore
0200b6d0 <_Scheduler_CBS_Cleanup>:
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Cleanup (void)
{
200b6d0: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b6d4: 39 00 80 7f sethi %hi(0x201fc00), %i4
200b6d8: c2 07 21 9c ld [ %i4 + 0x19c ], %g1 ! 201fd9c <_Scheduler_CBS_Maximum_servers>
200b6dc: 80 a0 60 00 cmp %g1, 0
200b6e0: 02 80 00 18 be 200b740 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN
200b6e4: 03 00 80 83 sethi %hi(0x2020c00), %g1
200b6e8: 37 00 80 83 sethi %hi(0x2020c00), %i3
200b6ec: c4 06 e0 d8 ld [ %i3 + 0xd8 ], %g2 ! 2020cd8 <_Scheduler_CBS_Server_list>
200b6f0: ba 10 20 00 clr %i5
200b6f4: b8 17 21 9c or %i4, 0x19c, %i4
if ( _Scheduler_CBS_Server_list[ i ] )
200b6f8: 83 2f 60 02 sll %i5, 2, %g1
200b6fc: c2 00 80 01 ld [ %g2 + %g1 ], %g1
200b700: 80 a0 60 00 cmp %g1, 0
200b704: 02 80 00 05 be 200b718 <_Scheduler_CBS_Cleanup+0x48>
200b708: 90 10 00 1d mov %i5, %o0
_Scheduler_CBS_Destroy_server( i );
200b70c: 40 00 00 46 call 200b824 <_Scheduler_CBS_Destroy_server>
200b710: 01 00 00 00 nop
200b714: c4 06 e0 d8 ld [ %i3 + 0xd8 ], %g2
int _Scheduler_CBS_Cleanup (void)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b718: c2 07 00 00 ld [ %i4 ], %g1
200b71c: ba 07 60 01 inc %i5
200b720: 80 a0 40 1d cmp %g1, %i5
200b724: 18 bf ff f6 bgu 200b6fc <_Scheduler_CBS_Cleanup+0x2c>
200b728: 83 2f 60 02 sll %i5, 2, %g1
if ( _Scheduler_CBS_Server_list[ i ] )
_Scheduler_CBS_Destroy_server( i );
}
_Workspace_Free( _Scheduler_CBS_Server_list );
return SCHEDULER_CBS_OK;
}
200b72c: b0 10 20 00 clr %i0
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
if ( _Scheduler_CBS_Server_list[ i ] )
_Scheduler_CBS_Destroy_server( i );
}
_Workspace_Free( _Scheduler_CBS_Server_list );
200b730: 40 00 08 4b call 200d85c <_Workspace_Free>
200b734: 90 10 00 02 mov %g2, %o0
return SCHEDULER_CBS_OK;
}
200b738: 81 c7 e0 08 ret
200b73c: 81 e8 00 00 restore
200b740: 10 bf ff fb b 200b72c <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED
200b744: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 <== NOT EXECUTED
0200b748 <_Scheduler_CBS_Create_server>:
int _Scheduler_CBS_Create_server (
Scheduler_CBS_Parameters *params,
Scheduler_CBS_Budget_overrun budget_overrun_callback,
rtems_id *server_id
)
{
200b748: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
Scheduler_CBS_Server *the_server;
if ( params->budget <= 0 ||
200b74c: c2 06 20 04 ld [ %i0 + 4 ], %g1
200b750: 80 a0 60 00 cmp %g1, 0
200b754: 04 80 00 30 ble 200b814 <_Scheduler_CBS_Create_server+0xcc>
200b758: b8 10 00 18 mov %i0, %i4
200b75c: c2 06 00 00 ld [ %i0 ], %g1
200b760: 80 a0 60 00 cmp %g1, 0
200b764: 04 80 00 2c ble 200b814 <_Scheduler_CBS_Create_server+0xcc>
200b768: 03 00 80 7f sethi %hi(0x201fc00), %g1
params->deadline <= 0 ||
params->budget >= SCHEDULER_EDF_PRIO_MSB ||
params->deadline >= SCHEDULER_EDF_PRIO_MSB )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b76c: c8 00 61 9c ld [ %g1 + 0x19c ], %g4 ! 201fd9c <_Scheduler_CBS_Maximum_servers>
200b770: 80 a1 20 00 cmp %g4, 0
200b774: 02 80 00 11 be 200b7b8 <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN
200b778: 37 00 80 83 sethi %hi(0x2020c00), %i3
if ( !_Scheduler_CBS_Server_list[i] )
200b77c: fa 06 e0 d8 ld [ %i3 + 0xd8 ], %i5 ! 2020cd8 <_Scheduler_CBS_Server_list>
200b780: c2 07 40 00 ld [ %i5 ], %g1
200b784: 80 a0 60 00 cmp %g1, 0
200b788: 02 80 00 21 be 200b80c <_Scheduler_CBS_Create_server+0xc4>
200b78c: b0 10 20 00 clr %i0
200b790: 10 80 00 06 b 200b7a8 <_Scheduler_CBS_Create_server+0x60>
200b794: 82 10 20 00 clr %g1
200b798: c6 07 40 02 ld [ %i5 + %g2 ], %g3
200b79c: 80 a0 e0 00 cmp %g3, 0
200b7a0: 02 80 00 08 be 200b7c0 <_Scheduler_CBS_Create_server+0x78>
200b7a4: b0 10 00 02 mov %g2, %i0
params->deadline <= 0 ||
params->budget >= SCHEDULER_EDF_PRIO_MSB ||
params->deadline >= SCHEDULER_EDF_PRIO_MSB )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b7a8: 82 00 60 01 inc %g1
200b7ac: 80 a0 40 04 cmp %g1, %g4
200b7b0: 12 bf ff fa bne 200b798 <_Scheduler_CBS_Create_server+0x50>
200b7b4: 85 28 60 02 sll %g1, 2, %g2
if ( !_Scheduler_CBS_Server_list[i] )
break;
}
if ( i == _Scheduler_CBS_Maximum_servers )
return SCHEDULER_CBS_ERROR_FULL;
200b7b8: 81 c7 e0 08 ret
200b7bc: 91 e8 3f e6 restore %g0, -26, %o0
*server_id = i;
200b7c0: c2 26 80 00 st %g1, [ %i2 ]
_Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *)
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
200b7c4: 40 00 08 1e call 200d83c <_Workspace_Allocate>
200b7c8: 90 10 20 10 mov 0x10, %o0
the_server = _Scheduler_CBS_Server_list[*server_id];
200b7cc: c2 06 80 00 ld [ %i2 ], %g1
if ( i == _Scheduler_CBS_Maximum_servers )
return SCHEDULER_CBS_ERROR_FULL;
*server_id = i;
_Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *)
200b7d0: d0 27 40 18 st %o0, [ %i5 + %i0 ]
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
the_server = _Scheduler_CBS_Server_list[*server_id];
200b7d4: c4 06 e0 d8 ld [ %i3 + 0xd8 ], %g2
200b7d8: 83 28 60 02 sll %g1, 2, %g1
200b7dc: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_server )
200b7e0: 80 a0 60 00 cmp %g1, 0
200b7e4: 02 80 00 0e be 200b81c <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN
200b7e8: 86 10 3f ff mov -1, %g3
return SCHEDULER_CBS_ERROR_NO_MEMORY;
the_server->parameters = *params;
200b7ec: c4 07 00 00 ld [ %i4 ], %g2
200b7f0: c4 20 60 04 st %g2, [ %g1 + 4 ]
200b7f4: c4 07 20 04 ld [ %i4 + 4 ], %g2
the_server->task_id = -1;
200b7f8: c6 20 40 00 st %g3, [ %g1 ]
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
the_server = _Scheduler_CBS_Server_list[*server_id];
if ( !the_server )
return SCHEDULER_CBS_ERROR_NO_MEMORY;
the_server->parameters = *params;
200b7fc: c4 20 60 08 st %g2, [ %g1 + 8 ]
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
200b800: f2 20 60 0c st %i1, [ %g1 + 0xc ]
return SCHEDULER_CBS_OK;
200b804: 81 c7 e0 08 ret
200b808: 91 e8 20 00 restore %g0, 0, %o0
params->budget >= SCHEDULER_EDF_PRIO_MSB ||
params->deadline >= SCHEDULER_EDF_PRIO_MSB )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
if ( !_Scheduler_CBS_Server_list[i] )
200b80c: 10 bf ff ed b 200b7c0 <_Scheduler_CBS_Create_server+0x78>
200b810: 82 10 20 00 clr %g1
if ( params->budget <= 0 ||
params->deadline <= 0 ||
params->budget >= SCHEDULER_EDF_PRIO_MSB ||
params->deadline >= SCHEDULER_EDF_PRIO_MSB )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
200b814: 81 c7 e0 08 ret
200b818: 91 e8 3f ee restore %g0, -18, %o0
the_server->parameters = *params;
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
return SCHEDULER_CBS_OK;
}
200b81c: 81 c7 e0 08 ret <== NOT EXECUTED
200b820: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED
0200b8a4 <_Scheduler_CBS_Detach_thread>:
int _Scheduler_CBS_Detach_thread (
Scheduler_CBS_Server_id server_id,
rtems_id task_id
)
{
200b8a4: 9d e3 bf 98 save %sp, -104, %sp
Objects_Locations location;
Thread_Control *the_thread;
Scheduler_CBS_Per_thread *sched_info;
the_thread = _Thread_Get(task_id, &location);
200b8a8: 92 07 bf fc add %fp, -4, %o1
200b8ac: 40 00 03 9b call 200c718 <_Thread_Get>
200b8b0: 90 10 00 19 mov %i1, %o0
/* The routine _Thread_Get may disable dispatch and not enable again. */
if ( the_thread ) {
200b8b4: ba 92 20 00 orcc %o0, 0, %i5
200b8b8: 02 80 00 1e be 200b930 <_Scheduler_CBS_Detach_thread+0x8c>
200b8bc: 01 00 00 00 nop
_Thread_Enable_dispatch();
200b8c0: 40 00 03 89 call 200c6e4 <_Thread_Enable_dispatch>
200b8c4: 01 00 00 00 nop
}
if ( server_id >= _Scheduler_CBS_Maximum_servers )
200b8c8: 03 00 80 7f sethi %hi(0x201fc00), %g1
200b8cc: c2 00 61 9c ld [ %g1 + 0x19c ], %g1 ! 201fd9c <_Scheduler_CBS_Maximum_servers>
200b8d0: 80 a6 00 01 cmp %i0, %g1
200b8d4: 1a 80 00 17 bcc 200b930 <_Scheduler_CBS_Detach_thread+0x8c>
200b8d8: 03 00 80 83 sethi %hi(0x2020c00), %g1
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
if ( !the_thread )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
/* Server is not valid. */
if ( !_Scheduler_CBS_Server_list[server_id] )
200b8dc: c2 00 60 d8 ld [ %g1 + 0xd8 ], %g1 ! 2020cd8 <_Scheduler_CBS_Server_list>
200b8e0: b1 2e 20 02 sll %i0, 2, %i0
200b8e4: c2 00 40 18 ld [ %g1 + %i0 ], %g1
200b8e8: 80 a0 60 00 cmp %g1, 0
200b8ec: 02 80 00 13 be 200b938 <_Scheduler_CBS_Detach_thread+0x94>
200b8f0: 01 00 00 00 nop
return SCHEDULER_CBS_ERROR_NOSERVER;
/* Thread and server are not attached. */
if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id )
200b8f4: c4 00 40 00 ld [ %g1 ], %g2
200b8f8: 80 a0 80 19 cmp %g2, %i1
200b8fc: 12 80 00 0d bne 200b930 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN
200b900: 84 10 3f ff mov -1, %g2
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
sched_info->cbs_server = NULL;
200b904: c8 07 60 88 ld [ %i5 + 0x88 ], %g4
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200b908: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3
return SCHEDULER_CBS_ERROR_NOSERVER;
/* Thread and server are not attached. */
if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
200b90c: c4 20 40 00 st %g2, [ %g1 ]
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
sched_info->cbs_server = NULL;
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
the_thread->budget_callout = the_thread->Start.budget_callout;
200b910: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2
the_thread->is_preemptible = the_thread->Start.is_preemptible;
200b914: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1
if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
sched_info->cbs_server = NULL;
200b918: c0 21 20 18 clr [ %g4 + 0x18 ]
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200b91c: c6 27 60 78 st %g3, [ %i5 + 0x78 ]
the_thread->budget_callout = the_thread->Start.budget_callout;
200b920: c4 27 60 7c st %g2, [ %i5 + 0x7c ]
the_thread->is_preemptible = the_thread->Start.is_preemptible;
200b924: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
return SCHEDULER_CBS_OK;
200b928: 81 c7 e0 08 ret
200b92c: 91 e8 20 00 restore %g0, 0, %o0
if ( the_thread ) {
_Thread_Enable_dispatch();
}
if ( server_id >= _Scheduler_CBS_Maximum_servers )
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
200b930: 81 c7 e0 08 ret
200b934: 91 e8 3f ee restore %g0, -18, %o0
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
the_thread->budget_callout = the_thread->Start.budget_callout;
the_thread->is_preemptible = the_thread->Start.is_preemptible;
return SCHEDULER_CBS_OK;
}
200b938: 81 c7 e0 08 ret
200b93c: 91 e8 3f e7 restore %g0, -25, %o0
0200bb18 <_Scheduler_CBS_Get_server_id>:
rtems_id task_id,
Scheduler_CBS_Server_id *server_id
)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200bb18: 03 00 80 7f sethi %hi(0x201fc00), %g1
200bb1c: c6 00 61 9c ld [ %g1 + 0x19c ], %g3 ! 201fd9c <_Scheduler_CBS_Maximum_servers>
200bb20: 80 a0 e0 00 cmp %g3, 0
200bb24: 02 80 00 11 be 200bb68 <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN
200bb28: 03 00 80 83 sethi %hi(0x2020c00), %g1
200bb2c: c8 00 60 d8 ld [ %g1 + 0xd8 ], %g4 ! 2020cd8 <_Scheduler_CBS_Server_list>
200bb30: 82 10 20 00 clr %g1
#include <rtems/system.h>
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Get_server_id (
200bb34: 85 28 60 02 sll %g1, 2, %g2
Scheduler_CBS_Server_id *server_id
)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
if ( _Scheduler_CBS_Server_list[i] &&
200bb38: c4 01 00 02 ld [ %g4 + %g2 ], %g2
200bb3c: 80 a0 a0 00 cmp %g2, 0
200bb40: 22 80 00 07 be,a 200bb5c <_Scheduler_CBS_Get_server_id+0x44>
200bb44: 82 00 60 01 inc %g1
200bb48: c4 00 80 00 ld [ %g2 ], %g2
200bb4c: 80 a0 80 08 cmp %g2, %o0
200bb50: 22 80 00 08 be,a 200bb70 <_Scheduler_CBS_Get_server_id+0x58>
200bb54: c2 22 40 00 st %g1, [ %o1 ]
rtems_id task_id,
Scheduler_CBS_Server_id *server_id
)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200bb58: 82 00 60 01 inc %g1
200bb5c: 80 a0 40 03 cmp %g1, %g3
200bb60: 12 bf ff f6 bne 200bb38 <_Scheduler_CBS_Get_server_id+0x20>
200bb64: 85 28 60 02 sll %g1, 2, %g2
*server_id = i;
return SCHEDULER_CBS_OK;
}
}
return SCHEDULER_CBS_ERROR_NOSERVER;
}
200bb68: 81 c3 e0 08 retl
200bb6c: 90 10 3f e7 mov -25, %o0
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
if ( _Scheduler_CBS_Server_list[i] &&
_Scheduler_CBS_Server_list[i]->task_id == task_id ) {
*server_id = i;
return SCHEDULER_CBS_OK;
200bb70: 81 c3 e0 08 retl
200bb74: 90 10 20 00 clr %o0
0200bbe4 <_Scheduler_CBS_Initialize>:
}
}
int _Scheduler_CBS_Initialize(void)
{
200bbe4: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
200bbe8: 3b 00 80 7f sethi %hi(0x201fc00), %i5
200bbec: d0 07 61 9c ld [ %i5 + 0x19c ], %o0 ! 201fd9c <_Scheduler_CBS_Maximum_servers>
}
int _Scheduler_CBS_Initialize(void)
{
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
200bbf0: 40 00 07 13 call 200d83c <_Workspace_Allocate>
200bbf4: 91 2a 20 02 sll %o0, 2, %o0
200bbf8: 09 00 80 83 sethi %hi(0x2020c00), %g4
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
200bbfc: 80 a2 20 00 cmp %o0, 0
200bc00: 02 80 00 10 be 200bc40 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN
200bc04: d0 21 20 d8 st %o0, [ %g4 + 0xd8 ]
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
200bc08: c6 07 61 9c ld [ %i5 + 0x19c ], %g3
200bc0c: 80 a0 e0 00 cmp %g3, 0
200bc10: 12 80 00 05 bne 200bc24 <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN
200bc14: 82 10 20 00 clr %g1
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
200bc18: 81 c7 e0 08 ret <== NOT EXECUTED
200bc1c: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED
200bc20: d0 01 20 d8 ld [ %g4 + 0xd8 ], %o0
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
_Scheduler_CBS_Server_list[i] = NULL;
200bc24: 85 28 60 02 sll %g1, 2, %g2
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
200bc28: 82 00 60 01 inc %g1
200bc2c: 80 a0 40 03 cmp %g1, %g3
200bc30: 12 bf ff fc bne 200bc20 <_Scheduler_CBS_Initialize+0x3c>
200bc34: c0 22 00 02 clr [ %o0 + %g2 ]
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
200bc38: 81 c7 e0 08 ret
200bc3c: 91 e8 20 00 restore %g0, 0, %o0
{
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
return SCHEDULER_CBS_ERROR_NO_MEMORY;
200bc40: b0 10 3f ef mov -17, %i0 <== NOT EXECUTED
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
}
200bc44: 81 c7 e0 08 ret <== NOT EXECUTED
200bc48: 81 e8 00 00 restore <== NOT EXECUTED
0200a76c <_Scheduler_CBS_Release_job>:
{
Priority_Control new_priority;
Scheduler_CBS_Per_thread *sched_info =
(Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
Scheduler_CBS_Server *serv_info =
(Scheduler_CBS_Server *) sched_info->cbs_server;
200a76c: c2 02 20 88 ld [ %o0 + 0x88 ], %g1
if (deadline) {
200a770: 80 a2 60 00 cmp %o1, 0
200a774: 02 80 00 11 be 200a7b8 <_Scheduler_CBS_Release_job+0x4c>
200a778: c2 00 60 18 ld [ %g1 + 0x18 ], %g1
/* Initializing or shifting deadline. */
if (serv_info)
200a77c: 80 a0 60 00 cmp %g1, 0
200a780: 02 80 00 13 be 200a7cc <_Scheduler_CBS_Release_job+0x60>
200a784: 07 00 80 7b sethi %hi(0x201ec00), %g3
new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline)
200a788: c4 00 60 04 ld [ %g1 + 4 ], %g2
200a78c: d2 00 e3 98 ld [ %g3 + 0x398 ], %o1
200a790: 92 02 40 02 add %o1, %g2, %o1
200a794: 05 20 00 00 sethi %hi(0x80000000), %g2
200a798: 92 2a 40 02 andn %o1, %g2, %o1
new_priority = the_thread->Start.initial_priority;
}
/* Budget replenishment for the next job. */
if (serv_info)
the_thread->cpu_time_budget = serv_info->parameters.budget;
200a79c: c2 00 60 08 ld [ %g1 + 8 ], %g1
200a7a0: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
the_thread->real_priority = new_priority;
200a7a4: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
_Thread_Change_priority(the_thread, new_priority, true);
200a7a8: 94 10 20 01 mov 1, %o2
200a7ac: 82 13 c0 00 mov %o7, %g1
200a7b0: 40 00 01 38 call 200ac90 <_Thread_Change_priority>
200a7b4: 9e 10 40 00 mov %g1, %o7
/* Switch back to background priority. */
new_priority = the_thread->Start.initial_priority;
}
/* Budget replenishment for the next job. */
if (serv_info)
200a7b8: 80 a0 60 00 cmp %g1, 0
200a7bc: 12 bf ff f8 bne 200a79c <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN
200a7c0: d2 02 20 ac ld [ %o0 + 0xac ], %o1
the_thread->cpu_time_budget = serv_info->parameters.budget;
the_thread->real_priority = new_priority;
200a7c4: 10 bf ff f9 b 200a7a8 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED
200a7c8: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED
/* Initializing or shifting deadline. */
if (serv_info)
new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline)
& ~SCHEDULER_EDF_PRIO_MSB;
else
new_priority = (_Watchdog_Ticks_since_boot + deadline)
200a7cc: 03 00 80 7b sethi %hi(0x201ec00), %g1
200a7d0: c2 00 63 98 ld [ %g1 + 0x398 ], %g1 ! 201ef98 <_Watchdog_Ticks_since_boot>
200a7d4: 92 02 40 01 add %o1, %g1, %o1
200a7d8: 03 20 00 00 sethi %hi(0x80000000), %g1
200a7dc: 10 bf ff f2 b 200a7a4 <_Scheduler_CBS_Release_job+0x38>
200a7e0: 92 2a 40 01 andn %o1, %g1, %o1
0200a7e4 <_Scheduler_CBS_Unblock>:
#include <rtems/score/schedulercbs.h>
void _Scheduler_CBS_Unblock(
Thread_Control *the_thread
)
{
200a7e4: 9d e3 bf a0 save %sp, -96, %sp
Scheduler_CBS_Per_thread *sched_info;
Scheduler_CBS_Server *serv_info;
Priority_Control new_priority;
_Scheduler_EDF_Enqueue(the_thread);
200a7e8: 40 00 00 50 call 200a928 <_Scheduler_EDF_Enqueue>
200a7ec: 90 10 00 18 mov %i0, %o0
/* TODO: flash critical section? */
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server;
200a7f0: c2 06 20 88 ld [ %i0 + 0x88 ], %g1
200a7f4: fa 00 60 18 ld [ %g1 + 0x18 ], %i5
* Late unblock rule for deadline-driven tasks. The remaining time to
* deadline must be sufficient to serve the remaining computation time
* without increased utilization of this task. It might cause a deadline
* miss of another task.
*/
if (serv_info) {
200a7f8: 80 a7 60 00 cmp %i5, 0
200a7fc: 02 80 00 19 be 200a860 <_Scheduler_CBS_Unblock+0x7c>
200a800: 03 00 80 7b sethi %hi(0x201ec00), %g1
time_t budget = serv_info->parameters.budget;
time_t deadline_left = the_thread->cpu_time_budget;
time_t budget_left = the_thread->real_priority -
_Watchdog_Ticks_since_boot;
if ( deadline*budget_left > budget*deadline_left ) {
200a804: d2 07 60 04 ld [ %i5 + 4 ], %o1
*/
if (serv_info) {
time_t deadline = serv_info->parameters.deadline;
time_t budget = serv_info->parameters.budget;
time_t deadline_left = the_thread->cpu_time_budget;
time_t budget_left = the_thread->real_priority -
200a808: d0 00 63 98 ld [ %g1 + 0x398 ], %o0
200a80c: f8 06 20 18 ld [ %i0 + 0x18 ], %i4
_Watchdog_Ticks_since_boot;
if ( deadline*budget_left > budget*deadline_left ) {
200a810: 40 00 3e 17 call 201a06c <.umul>
200a814: 90 27 00 08 sub %i4, %o0, %o0
200a818: d2 06 20 74 ld [ %i0 + 0x74 ], %o1
200a81c: b6 10 00 08 mov %o0, %i3
200a820: 40 00 3e 13 call 201a06c <.umul>
200a824: d0 07 60 08 ld [ %i5 + 8 ], %o0
200a828: 80 a6 c0 08 cmp %i3, %o0
200a82c: 24 80 00 0e ble,a 200a864 <_Scheduler_CBS_Unblock+0x80>
200a830: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
/* Put late unblocked task to background until the end of period. */
new_priority = the_thread->Start.initial_priority;
200a834: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
200a838: 80 a7 00 09 cmp %i4, %o1
200a83c: 32 80 00 02 bne,a 200a844 <_Scheduler_CBS_Unblock+0x60>
200a840: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
200a844: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
200a848: 80 a2 00 09 cmp %o0, %o1
200a84c: 02 80 00 07 be 200a868 <_Scheduler_CBS_Unblock+0x84>
200a850: 3b 00 80 7c sethi %hi(0x201f000), %i5
_Thread_Change_priority(the_thread, new_priority, true);
200a854: 90 10 00 18 mov %i0, %o0
200a858: 40 00 01 0e call 200ac90 <_Thread_Change_priority>
200a85c: 94 10 20 01 mov 1, %o2
200a860: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
* a context switch.
* Pseudo-ISR case:
* Even if the thread isn't preemptible, if the new heir is
* a pseudo-ISR system task, we need to do a context switch.
*/
if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority,
200a864: 3b 00 80 7c sethi %hi(0x201f000), %i5
200a868: ba 17 60 c0 or %i5, 0xc0, %i5 ! 201f0c0 <_Per_CPU_Information>
200a86c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200a870: d2 00 60 14 ld [ %g1 + 0x14 ], %o1
200a874: 03 00 80 78 sethi %hi(0x201e000), %g1
200a878: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 ! 201e1e0 <_Scheduler+0x30>
200a87c: 9f c0 40 00 call %g1
200a880: 01 00 00 00 nop
200a884: 80 a2 20 00 cmp %o0, 0
200a888: 04 80 00 0a ble 200a8b0 <_Scheduler_CBS_Unblock+0xcc>
200a88c: 01 00 00 00 nop
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
200a890: c2 07 60 0c ld [ %i5 + 0xc ], %g1
* Even if the thread isn't preemptible, if the new heir is
* a pseudo-ISR system task, we need to do a context switch.
*/
if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority,
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
200a894: f0 27 60 10 st %i0, [ %i5 + 0x10 ]
if ( _Thread_Executing->is_preemptible ||
200a898: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
200a89c: 80 a0 60 00 cmp %g1, 0
200a8a0: 22 80 00 06 be,a 200a8b8 <_Scheduler_CBS_Unblock+0xd4>
200a8a4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a8a8: 82 10 20 01 mov 1, %g1
200a8ac: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ]
200a8b0: 81 c7 e0 08 ret
200a8b4: 81 e8 00 00 restore
* a pseudo-ISR system task, we need to do a context switch.
*/
if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority,
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
200a8b8: 80 a0 60 00 cmp %g1, 0
200a8bc: 12 bf ff fd bne 200a8b0 <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN
200a8c0: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a8c4: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED
200a8c8: 30 bf ff fa b,a 200a8b0 <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED
0200a73c <_Scheduler_EDF_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_EDF_Allocate(
Thread_Control *the_thread
)
{
200a73c: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_EDF_Per_thread *schinfo;
sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) );
200a740: 40 00 06 f2 call 200c308 <_Workspace_Allocate>
200a744: 90 10 20 18 mov 0x18, %o0
if ( sched ) {
200a748: 80 a2 20 00 cmp %o0, 0
200a74c: 02 80 00 05 be 200a760 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN
200a750: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
200a754: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info);
schinfo->thread = the_thread;
200a758: f0 22 00 00 st %i0, [ %o0 ]
schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
200a75c: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
}
return sched;
}
200a760: 81 c7 e0 08 ret
200a764: 91 e8 00 08 restore %g0, %o0, %o0
0200a920 <_Scheduler_EDF_Unblock>:
#include <rtems/score/scheduleredf.h>
void _Scheduler_EDF_Unblock(
Thread_Control *the_thread
)
{
200a920: 9d e3 bf a0 save %sp, -96, %sp
_Scheduler_EDF_Enqueue(the_thread);
200a924: 7f ff ff a8 call 200a7c4 <_Scheduler_EDF_Enqueue>
200a928: 90 10 00 18 mov %i0, %o0
* a context switch.
* Pseudo-ISR case:
* Even if the thread isn't preemptible, if the new heir is
* a pseudo-ISR system task, we need to do a context switch.
*/
if ( _Scheduler_Is_priority_lower_than(
200a92c: 3b 00 80 7c sethi %hi(0x201f000), %i5
200a930: ba 17 60 00 mov %i5, %i5 ! 201f000 <_Per_CPU_Information>
200a934: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200a938: d0 00 60 14 ld [ %g1 + 0x14 ], %o0
200a93c: 03 00 80 78 sethi %hi(0x201e000), %g1
200a940: c2 00 61 30 ld [ %g1 + 0x130 ], %g1 ! 201e130 <_Scheduler+0x30>
200a944: 9f c0 40 00 call %g1
200a948: d2 06 20 14 ld [ %i0 + 0x14 ], %o1
200a94c: 80 a2 20 00 cmp %o0, 0
200a950: 26 80 00 04 bl,a 200a960 <_Scheduler_EDF_Unblock+0x40>
200a954: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200a958: 81 c7 e0 08 ret
200a95c: 81 e8 00 00 restore
_Thread_Heir->current_priority,
the_thread->current_priority )) {
_Thread_Heir = the_thread;
200a960: f0 27 60 10 st %i0, [ %i5 + 0x10 ]
if ( _Thread_Executing->is_preemptible ||
200a964: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
200a968: 80 a0 60 00 cmp %g1, 0
200a96c: 22 80 00 06 be,a 200a984 <_Scheduler_EDF_Unblock+0x64>
200a970: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a974: 82 10 20 01 mov 1, %g1
200a978: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ]
200a97c: 81 c7 e0 08 ret
200a980: 81 e8 00 00 restore
*/
if ( _Scheduler_Is_priority_lower_than(
_Thread_Heir->current_priority,
the_thread->current_priority )) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
200a984: 80 a0 60 00 cmp %g1, 0
200a988: 12 bf ff f4 bne 200a958 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN
200a98c: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a990: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED
200a994: 30 bf ff fa b,a 200a97c <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED
0200a930 <_Scheduler_simple_Ready_queue_enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
200a930: 03 00 80 75 sethi %hi(0x201d400), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
200a934: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1 ! 201d5b0 <_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 ) {
200a938: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
200a93c: c2 00 40 00 ld [ %g1 ], %g1
200a940: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
200a944: 80 a0 80 03 cmp %g2, %g3
200a948: 3a 80 00 08 bcc,a 200a968 <_Scheduler_simple_Ready_queue_enqueue_first+0x38>
200a94c: 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 ) {
200a950: 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 ) {
200a954: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
200a958: 80 a0 80 03 cmp %g2, %g3
200a95c: 2a bf ff fe bcs,a 200a954 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN
200a960: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
current = (Thread_Control *)current->Object.Node.previous;
200a964: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
200a968: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
200a96c: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
200a970: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
200a974: c4 22 00 00 st %g2, [ %o0 ]
before_node->previous = the_node;
200a978: 81 c3 e0 08 retl
200a97c: d0 20 a0 04 st %o0, [ %g2 + 4 ]
02008a2c <_TOD_Validate>:
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
2008a2c: 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();
2008a30: 03 00 80 7a sethi %hi(0x201e800), %g1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
2008a34: d2 00 63 5c ld [ %g1 + 0x35c ], %o1 ! 201eb5c <Configuration+0x10>
2008a38: 11 00 03 d0 sethi %hi(0xf4000), %o0
2008a3c: 40 00 47 3b call 201a728 <.udiv>
2008a40: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
2008a44: 80 a6 20 00 cmp %i0, 0
2008a48: 02 80 00 2c be 2008af8 <_TOD_Validate+0xcc> <== NEVER TAKEN
2008a4c: 82 10 20 00 clr %g1
2008a50: c4 06 20 18 ld [ %i0 + 0x18 ], %g2
2008a54: 80 a2 00 02 cmp %o0, %g2
2008a58: 28 80 00 26 bleu,a 2008af0 <_TOD_Validate+0xc4>
2008a5c: b0 08 60 01 and %g1, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
2008a60: c4 06 20 14 ld [ %i0 + 0x14 ], %g2
2008a64: 80 a0 a0 3b cmp %g2, 0x3b
2008a68: 38 80 00 22 bgu,a 2008af0 <_TOD_Validate+0xc4>
2008a6c: b0 08 60 01 and %g1, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
2008a70: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
2008a74: 80 a0 a0 3b cmp %g2, 0x3b
2008a78: 38 80 00 1e bgu,a 2008af0 <_TOD_Validate+0xc4>
2008a7c: b0 08 60 01 and %g1, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
2008a80: c4 06 20 0c ld [ %i0 + 0xc ], %g2
2008a84: 80 a0 a0 17 cmp %g2, 0x17
2008a88: 38 80 00 1a bgu,a 2008af0 <_TOD_Validate+0xc4>
2008a8c: b0 08 60 01 and %g1, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
2008a90: c4 06 20 04 ld [ %i0 + 4 ], %g2
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) ||
2008a94: 80 a0 a0 00 cmp %g2, 0
2008a98: 02 80 00 15 be 2008aec <_TOD_Validate+0xc0> <== NEVER TAKEN
2008a9c: 80 a0 a0 0c cmp %g2, 0xc
(the_tod->month == 0) ||
2008aa0: 38 80 00 14 bgu,a 2008af0 <_TOD_Validate+0xc4>
2008aa4: b0 08 60 01 and %g1, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2008aa8: c6 06 00 00 ld [ %i0 ], %g3
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
2008aac: 80 a0 e7 c3 cmp %g3, 0x7c3
2008ab0: 28 80 00 10 bleu,a 2008af0 <_TOD_Validate+0xc4>
2008ab4: b0 08 60 01 and %g1, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2008ab8: c8 06 20 08 ld [ %i0 + 8 ], %g4
(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) ||
2008abc: 80 a1 20 00 cmp %g4, 0
2008ac0: 02 80 00 0b be 2008aec <_TOD_Validate+0xc0> <== NEVER TAKEN
2008ac4: 80 88 e0 03 btst 3, %g3
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
2008ac8: 32 80 00 0f bne,a 2008b04 <_TOD_Validate+0xd8>
2008acc: 85 28 a0 02 sll %g2, 2, %g2
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
2008ad0: 82 00 a0 0d add %g2, 0xd, %g1
2008ad4: 05 00 80 75 sethi %hi(0x201d400), %g2
2008ad8: 83 28 60 02 sll %g1, 2, %g1
2008adc: 84 10 a3 58 or %g2, 0x358, %g2
2008ae0: c2 00 80 01 ld [ %g2 + %g1 ], %g1
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
if ( the_tod->day > days_in_month )
2008ae4: 80 a0 40 04 cmp %g1, %g4
2008ae8: 82 60 3f ff subx %g0, -1, %g1
return false;
return true;
}
2008aec: b0 08 60 01 and %g1, 1, %i0
2008af0: 81 c7 e0 08 ret
2008af4: 81 e8 00 00 restore
2008af8: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED
2008afc: 81 c7 e0 08 ret <== NOT EXECUTED
2008b00: 81 e8 00 00 restore <== NOT EXECUTED
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 ];
2008b04: 03 00 80 75 sethi %hi(0x201d400), %g1
2008b08: 82 10 63 58 or %g1, 0x358, %g1 ! 201d758 <_TOD_Days_per_month>
2008b0c: c2 00 40 02 ld [ %g1 + %g2 ], %g1
if ( the_tod->day > days_in_month )
2008b10: 80 a0 40 04 cmp %g1, %g4
2008b14: 10 bf ff f6 b 2008aec <_TOD_Validate+0xc0>
2008b18: 82 60 3f ff subx %g0, -1, %g1
0200a340 <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
200a340: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
200a344: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
/*
* 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 );
200a348: 40 00 03 a7 call 200b1e4 <_Thread_Set_transient>
200a34c: 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 )
200a350: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200a354: 80 a0 40 19 cmp %g1, %i1
200a358: 02 80 00 05 be 200a36c <_Thread_Change_priority+0x2c>
200a35c: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
200a360: 90 10 00 18 mov %i0, %o0
200a364: 40 00 03 86 call 200b17c <_Thread_Set_priority>
200a368: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
200a36c: 7f ff e0 fe call 2002764 <sparc_disable_interrupts>
200a370: 01 00 00 00 nop
200a374: b2 10 00 08 mov %o0, %i1
/*
* 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;
200a378: f8 07 60 10 ld [ %i5 + 0x10 ], %i4
if ( state != STATES_TRANSIENT ) {
200a37c: 80 a7 20 04 cmp %i4, 4
200a380: 02 80 00 18 be 200a3e0 <_Thread_Change_priority+0xa0>
200a384: 80 8e e0 04 btst 4, %i3
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
200a388: 02 80 00 0b be 200a3b4 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
200a38c: 82 0f 3f fb and %i4, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
200a390: 7f ff e0 f9 call 2002774 <sparc_enable_interrupts> <== NOT EXECUTED
200a394: 90 10 00 19 mov %i1, %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);
200a398: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
200a39c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
200a3a0: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED
200a3a4: 32 80 00 0d bne,a 200a3d8 <_Thread_Change_priority+0x98> <== NOT EXECUTED
200a3a8: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
200a3ac: 81 c7 e0 08 ret
200a3b0: 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 );
200a3b4: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
200a3b8: 7f ff e0 ef call 2002774 <sparc_enable_interrupts>
200a3bc: 90 10 00 19 mov %i1, %o0
200a3c0: 03 00 00 ef sethi %hi(0x3bc00), %g1
200a3c4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
200a3c8: 80 8f 00 01 btst %i4, %g1
200a3cc: 02 bf ff f8 be 200a3ac <_Thread_Change_priority+0x6c>
200a3d0: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
200a3d4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
200a3d8: 40 00 03 38 call 200b0b8 <_Thread_queue_Requeue>
200a3dc: 93 e8 00 1d restore %g0, %i5, %o1
}
return;
}
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) ) {
200a3e0: 22 80 00 1a be,a 200a448 <_Thread_Change_priority+0x108> <== ALWAYS TAKEN
200a3e4: c0 27 60 10 clr [ %i5 + 0x10 ]
200a3e8: 39 00 80 71 sethi %hi(0x201c400), %i4 <== NOT EXECUTED
200a3ec: b8 17 21 a0 or %i4, 0x1a0, %i4 ! 201c5a0 <_Scheduler> <== NOT EXECUTED
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
200a3f0: 7f ff e0 e1 call 2002774 <sparc_enable_interrupts>
200a3f4: 90 10 00 19 mov %i1, %o0
200a3f8: 7f ff e0 db call 2002764 <sparc_disable_interrupts>
200a3fc: 01 00 00 00 nop
200a400: b0 10 00 08 mov %o0, %i0
* This kernel routine implements the scheduling decision logic for
* the scheduler. It does NOT dispatch.
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Schedule( void )
{
_Scheduler.Operations.schedule();
200a404: c2 07 20 08 ld [ %i4 + 8 ], %g1
200a408: 9f c0 40 00 call %g1
200a40c: 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 );
200a410: 03 00 80 75 sethi %hi(0x201d400), %g1
200a414: 82 10 60 30 or %g1, 0x30, %g1 ! 201d430 <_Per_CPU_Information>
200a418: 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() &&
200a41c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200a420: 80 a0 80 03 cmp %g2, %g3
200a424: 02 80 00 07 be 200a440 <_Thread_Change_priority+0x100>
200a428: 01 00 00 00 nop
200a42c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
200a430: 80 a0 a0 00 cmp %g2, 0
200a434: 02 80 00 03 be 200a440 <_Thread_Change_priority+0x100>
200a438: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
200a43c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
_ISR_Enable( level );
200a440: 7f ff e0 cd call 2002774 <sparc_enable_interrupts>
200a444: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
200a448: 39 00 80 71 sethi %hi(0x201c400), %i4
* 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 )
200a44c: 80 a6 a0 00 cmp %i2, 0
200a450: 02 80 00 06 be 200a468 <_Thread_Change_priority+0x128>
200a454: b8 17 21 a0 or %i4, 0x1a0, %i4
200a458: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
200a45c: 9f c0 40 00 call %g1
200a460: 90 10 00 1d mov %i5, %o0
200a464: 30 bf ff e3 b,a 200a3f0 <_Thread_Change_priority+0xb0>
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
200a468: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
200a46c: 9f c0 40 00 call %g1
200a470: 90 10 00 1d mov %i5, %o0
200a474: 30 bf ff df b,a 200a3f0 <_Thread_Change_priority+0xb0>
0200a694 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
200a694: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
200a698: 90 10 00 18 mov %i0, %o0
200a69c: 40 00 00 77 call 200a878 <_Thread_Get>
200a6a0: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200a6a4: c2 07 bf fc ld [ %fp + -4 ], %g1
200a6a8: 80 a0 60 00 cmp %g1, 0
200a6ac: 12 80 00 09 bne 200a6d0 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN
200a6b0: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
200a6b4: 7f ff ff 71 call 200a478 <_Thread_Clear_state>
200a6b8: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_END+0xdc00018>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
200a6bc: 03 00 80 74 sethi %hi(0x201d000), %g1
200a6c0: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 201d210 <_Thread_Dispatch_disable_level>
200a6c4: 84 00 bf ff add %g2, -1, %g2
200a6c8: c4 20 62 10 st %g2, [ %g1 + 0x210 ]
return _Thread_Dispatch_disable_level;
200a6cc: c2 00 62 10 ld [ %g1 + 0x210 ], %g1
200a6d0: 81 c7 e0 08 ret
200a6d4: 81 e8 00 00 restore
0200a6d8 <_Thread_Dispatch>:
* INTERRUPT LATENCY:
* dispatch thread
* no dispatch thread
*/
void _Thread_Dispatch( void )
{
200a6d8: 9d e3 bf 98 save %sp, -104, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
200a6dc: 27 00 80 74 sethi %hi(0x201d000), %l3
200a6e0: c2 04 e2 10 ld [ %l3 + 0x210 ], %g1 ! 201d210 <_Thread_Dispatch_disable_level>
200a6e4: 82 00 60 01 inc %g1
200a6e8: c2 24 e2 10 st %g1, [ %l3 + 0x210 ]
return _Thread_Dispatch_disable_level;
200a6ec: c2 04 e2 10 ld [ %l3 + 0x210 ], %g1
#endif
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
200a6f0: 31 00 80 75 sethi %hi(0x201d400), %i0
200a6f4: b0 16 20 30 or %i0, 0x30, %i0 ! 201d430 <_Per_CPU_Information>
_ISR_Disable( level );
200a6f8: 7f ff e0 1b call 2002764 <sparc_disable_interrupts>
200a6fc: f2 06 20 0c ld [ %i0 + 0xc ], %i1
while ( _Thread_Dispatch_necessary == true ) {
200a700: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1
200a704: 80 a0 60 00 cmp %g1, 0
200a708: 02 80 00 45 be 200a81c <_Thread_Dispatch+0x144>
200a70c: 01 00 00 00 nop
heir = _Thread_Heir;
200a710: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
_Thread_Dispatch_necessary = false;
200a714: c0 2e 20 18 clrb [ %i0 + 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 )
200a718: 80 a6 40 10 cmp %i1, %l0
200a71c: 02 80 00 40 be 200a81c <_Thread_Dispatch+0x144>
200a720: e0 26 20 0c st %l0, [ %i0 + 0xc ]
200a724: 25 00 80 74 sethi %hi(0x201d000), %l2
#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;
200a728: 29 00 80 74 sethi %hi(0x201d000), %l4
200a72c: a4 14 a2 8c or %l2, 0x28c, %l2
#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 );
200a730: 10 80 00 35 b 200a804 <_Thread_Dispatch+0x12c>
200a734: 23 00 80 74 sethi %hi(0x201d000), %l1
_ISR_Enable( level );
200a738: 7f ff e0 0f call 2002774 <sparc_enable_interrupts>
200a73c: 01 00 00 00 nop
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
200a740: 40 00 0b f9 call 200d724 <_TOD_Get_uptime>
200a744: 90 07 bf f8 add %fp, -8, %o0
_Timestamp_Subtract(
200a748: c4 1f bf f8 ldd [ %fp + -8 ], %g2
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
200a74c: f4 1e 20 20 ldd [ %i0 + 0x20 ], %i2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
200a750: f8 1e 60 80 ldd [ %i1 + 0x80 ], %i4
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
200a754: c2 04 80 00 ld [ %l2 ], %g1
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
200a758: b6 a0 c0 1b subcc %g3, %i3, %i3
200a75c: b4 60 80 1a subx %g2, %i2, %i2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
200a760: ba 87 40 1b addcc %i5, %i3, %i5
200a764: b8 47 00 1a addx %i4, %i2, %i4
200a768: f8 3e 60 80 std %i4, [ %i1 + 0x80 ]
200a76c: 80 a0 60 00 cmp %g1, 0
200a770: 02 80 00 06 be 200a788 <_Thread_Dispatch+0xb0> <== NEVER TAKEN
200a774: c4 3e 20 20 std %g2, [ %i0 + 0x20 ]
executing->libc_reent = *_Thread_libc_reent;
200a778: c4 00 40 00 ld [ %g1 ], %g2
200a77c: c4 26 61 4c st %g2, [ %i1 + 0x14c ]
*_Thread_libc_reent = heir->libc_reent;
200a780: c4 04 21 4c ld [ %l0 + 0x14c ], %g2
200a784: c4 20 40 00 st %g2, [ %g1 ]
}
_User_extensions_Thread_switch( executing, heir );
200a788: 90 10 00 19 mov %i1, %o0
200a78c: 40 00 03 91 call 200b5d0 <_User_extensions_Thread_switch>
200a790: 92 10 00 10 mov %l0, %o1
if ( executing->fp_context != NULL )
_Context_Save_fp( &executing->fp_context );
#endif
#endif
_Context_Switch( &executing->Registers, &heir->Registers );
200a794: 90 06 60 c0 add %i1, 0xc0, %o0
200a798: 40 00 04 d8 call 200baf8 <_CPU_Context_switch>
200a79c: 92 04 20 c0 add %l0, 0xc0, %o1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200a7a0: c2 06 61 48 ld [ %i1 + 0x148 ], %g1
200a7a4: 80 a0 60 00 cmp %g1, 0
200a7a8: 02 80 00 0c be 200a7d8 <_Thread_Dispatch+0x100>
200a7ac: d0 04 62 88 ld [ %l1 + 0x288 ], %o0
200a7b0: 80 a6 40 08 cmp %i1, %o0
200a7b4: 02 80 00 09 be 200a7d8 <_Thread_Dispatch+0x100>
200a7b8: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200a7bc: 02 80 00 04 be 200a7cc <_Thread_Dispatch+0xf4>
200a7c0: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200a7c4: 40 00 04 93 call 200ba10 <_CPU_Context_save_fp>
200a7c8: 90 02 21 48 add %o0, 0x148, %o0
_Context_Restore_fp( &executing->fp_context );
200a7cc: 40 00 04 ae call 200ba84 <_CPU_Context_restore_fp>
200a7d0: 90 06 61 48 add %i1, 0x148, %o0
_Thread_Allocated_fp = executing;
200a7d4: f2 24 62 88 st %i1, [ %l1 + 0x288 ]
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
200a7d8: 7f ff df e3 call 2002764 <sparc_disable_interrupts>
200a7dc: f2 06 20 0c ld [ %i0 + 0xc ], %i1
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
200a7e0: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1
200a7e4: 80 a0 60 00 cmp %g1, 0
200a7e8: 02 80 00 0d be 200a81c <_Thread_Dispatch+0x144>
200a7ec: 01 00 00 00 nop
heir = _Thread_Heir;
200a7f0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
_Thread_Dispatch_necessary = false;
200a7f4: c0 2e 20 18 clrb [ %i0 + 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 )
200a7f8: 80 a4 00 19 cmp %l0, %i1
200a7fc: 02 80 00 08 be 200a81c <_Thread_Dispatch+0x144> <== NEVER TAKEN
200a800: e0 26 20 0c st %l0, [ %i0 + 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 )
200a804: c2 04 20 78 ld [ %l0 + 0x78 ], %g1
200a808: 80 a0 60 01 cmp %g1, 1
200a80c: 12 bf ff cb bne 200a738 <_Thread_Dispatch+0x60>
200a810: c2 05 21 70 ld [ %l4 + 0x170 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
200a814: 10 bf ff c9 b 200a738 <_Thread_Dispatch+0x60>
200a818: c2 24 20 74 st %g1, [ %l0 + 0x74 ]
_ISR_Disable( level );
}
post_switch:
_ISR_Enable( level );
200a81c: 7f ff df d6 call 2002774 <sparc_enable_interrupts>
200a820: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
200a824: c2 04 e2 10 ld [ %l3 + 0x210 ], %g1
200a828: 82 00 7f ff add %g1, -1, %g1
200a82c: c2 24 e2 10 st %g1, [ %l3 + 0x210 ]
return _Thread_Dispatch_disable_level;
200a830: c2 04 e2 10 ld [ %l3 + 0x210 ], %g1
_Thread_Unnest_dispatch();
_API_extensions_Run_postswitch();
200a834: 7f ff f7 ad call 20086e8 <_API_extensions_Run_postswitch>
200a838: 01 00 00 00 nop
200a83c: 81 c7 e0 08 ret
200a840: 81 e8 00 00 restore
0200f76c <_Thread_Handler>:
* Input parameters: NONE
*
* Output parameters: NONE
*/
void _Thread_Handler( void )
{
200f76c: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static bool doneConstructors;
bool doCons;
#endif
executing = _Thread_Executing;
200f770: 03 00 80 75 sethi %hi(0x201d400), %g1
200f774: fa 00 60 3c ld [ %g1 + 0x3c ], %i5 ! 201d43c <_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();
200f778: 3f 00 80 3d sethi %hi(0x200f400), %i7
200f77c: be 17 e3 6c or %i7, 0x36c, %i7 ! 200f76c <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
200f780: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0
_ISR_Set_level(level);
200f784: 7f ff cb fc call 2002774 <sparc_enable_interrupts>
200f788: 91 2a 20 08 sll %o0, 8, %o0
#endif
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200f78c: c4 07 61 48 ld [ %i5 + 0x148 ], %g2
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
200f790: 03 00 80 73 sethi %hi(0x201cc00), %g1
doneConstructors = true;
200f794: 86 10 20 01 mov 1, %g3
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
200f798: f6 08 62 18 ldub [ %g1 + 0x218 ], %i3
#endif
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200f79c: 80 a0 a0 00 cmp %g2, 0
200f7a0: 02 80 00 0c be 200f7d0 <_Thread_Handler+0x64>
200f7a4: c6 28 62 18 stb %g3, [ %g1 + 0x218 ]
#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 );
200f7a8: 39 00 80 74 sethi %hi(0x201d000), %i4
200f7ac: d0 07 22 88 ld [ %i4 + 0x288 ], %o0 ! 201d288 <_Thread_Allocated_fp>
200f7b0: 80 a7 40 08 cmp %i5, %o0
200f7b4: 02 80 00 07 be 200f7d0 <_Thread_Handler+0x64>
200f7b8: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200f7bc: 22 80 00 05 be,a 200f7d0 <_Thread_Handler+0x64>
200f7c0: fa 27 22 88 st %i5, [ %i4 + 0x288 ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200f7c4: 7f ff f0 93 call 200ba10 <_CPU_Context_save_fp>
200f7c8: 90 02 21 48 add %o0, 0x148, %o0
_Thread_Allocated_fp = executing;
200f7cc: fa 27 22 88 st %i5, [ %i4 + 0x288 ]
/*
* 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 );
200f7d0: 7f ff ee ff call 200b3cc <_User_extensions_Thread_begin>
200f7d4: 90 10 00 1d mov %i5, %o0
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
200f7d8: 7f ff ec 1b call 200a844 <_Thread_Enable_dispatch>
200f7dc: 01 00 00 00 nop
/*
* _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 (doCons) /* && (volatile void *)_init) */ {
200f7e0: 80 8e e0 ff btst 0xff, %i3
200f7e4: 02 80 00 0c be 200f814 <_Thread_Handler+0xa8>
200f7e8: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f7ec: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
200f7f0: 80 a0 60 00 cmp %g1, 0
200f7f4: 22 80 00 0c be,a 200f824 <_Thread_Handler+0xb8> <== ALWAYS TAKEN
200f7f8: c2 07 60 8c ld [ %i5 + 0x8c ], %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 );
200f7fc: 7f ff ef 08 call 200b41c <_User_extensions_Thread_exitted>
200f800: 90 10 00 1d mov %i5, %o0
_Internal_error_Occurred(
200f804: 90 10 20 00 clr %o0
200f808: 92 10 20 01 mov 1, %o1
200f80c: 7f ff e6 8f call 2009248 <_Internal_error_Occurred>
200f810: 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 (doCons) /* && (volatile void *)_init) */ {
INIT_NAME ();
200f814: 40 00 33 15 call 201c468 <_init>
200f818: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f81c: 10 bf ff f5 b 200f7f0 <_Thread_Handler+0x84>
200f820: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
200f824: 9f c0 40 00 call %g1
200f828: d0 07 60 98 ld [ %i5 + 0x98 ], %o0
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
200f82c: 10 bf ff f4 b 200f7fc <_Thread_Handler+0x90>
200f830: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
0200ab08 <_Thread_Handler_initialization>:
*
* Output parameters: NONE
*/
void _Thread_Handler_initialization(void)
{
200ab08: 9d e3 bf 98 save %sp, -104, %sp
uint32_t ticks_per_timeslice =
200ab0c: 03 00 80 71 sethi %hi(0x201c400), %g1
200ab10: 82 10 60 ac or %g1, 0xac, %g1 ! 201c4ac <Configuration>
#if defined(RTEMS_MULTIPROCESSING)
uint32_t maximum_proxies =
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
200ab14: c6 00 60 2c ld [ %g1 + 0x2c ], %g3
* Output parameters: NONE
*/
void _Thread_Handler_initialization(void)
{
uint32_t ticks_per_timeslice =
200ab18: fa 00 60 18 ld [ %g1 + 0x18 ], %i5
rtems_configuration_get_ticks_per_timeslice();
uint32_t maximum_extensions =
200ab1c: f8 00 60 0c ld [ %g1 + 0xc ], %i4
#if defined(RTEMS_MULTIPROCESSING)
uint32_t maximum_proxies =
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
200ab20: 80 a0 e0 00 cmp %g3, 0
200ab24: 02 80 00 21 be 200aba8 <_Thread_Handler_initialization+0xa0>
200ab28: c4 00 60 28 ld [ %g1 + 0x28 ], %g2
200ab2c: c6 00 60 30 ld [ %g1 + 0x30 ], %g3
200ab30: 80 a0 e0 00 cmp %g3, 0
200ab34: 02 80 00 1d be 200aba8 <_Thread_Handler_initialization+0xa0><== NEVER TAKEN
200ab38: 80 a0 a0 00 cmp %g2, 0
INTERNAL_ERROR_CORE,
true,
INTERNAL_ERROR_BAD_STACK_HOOK
);
if ( stack_allocate_init_hook != NULL )
200ab3c: 22 80 00 05 be,a 200ab50 <_Thread_Handler_initialization+0x48>
200ab40: 03 00 80 75 sethi %hi(0x201d400), %g1
(*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() );
200ab44: 9f c0 80 00 call %g2
200ab48: d0 00 60 08 ld [ %g1 + 8 ], %o0 ! 201d408 <_RTEMS_Objects+0x8>
_Thread_Dispatch_necessary = false;
200ab4c: 03 00 80 75 sethi %hi(0x201d400), %g1
200ab50: 82 10 60 30 or %g1, 0x30, %g1 ! 201d430 <_Per_CPU_Information>
200ab54: c0 28 60 18 clrb [ %g1 + 0x18 ]
_Thread_Executing = NULL;
200ab58: c0 20 60 0c clr [ %g1 + 0xc ]
_Thread_Heir = NULL;
200ab5c: c0 20 60 10 clr [ %g1 + 0x10 ]
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Thread_Allocated_fp = NULL;
200ab60: 03 00 80 74 sethi %hi(0x201d000), %g1
200ab64: c0 20 62 88 clr [ %g1 + 0x288 ] ! 201d288 <_Thread_Allocated_fp>
#endif
_Thread_Maximum_extensions = maximum_extensions;
200ab68: 03 00 80 74 sethi %hi(0x201d000), %g1
200ab6c: f8 20 62 90 st %i4, [ %g1 + 0x290 ] ! 201d290 <_Thread_Maximum_extensions>
_Thread_Ticks_per_timeslice = ticks_per_timeslice;
200ab70: 03 00 80 74 sethi %hi(0x201d000), %g1
200ab74: fa 20 61 70 st %i5, [ %g1 + 0x170 ] ! 201d170 <_Thread_Ticks_per_timeslice>
#if defined(RTEMS_MULTIPROCESSING)
if ( _System_state_Is_multiprocessing )
maximum_internal_threads += 1;
#endif
_Objects_Initialize_information(
200ab78: 82 10 20 08 mov 8, %g1
200ab7c: 11 00 80 74 sethi %hi(0x201d000), %o0
200ab80: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
200ab84: 90 12 23 10 or %o0, 0x310, %o0
200ab88: 92 10 20 01 mov 1, %o1
200ab8c: 94 10 20 01 mov 1, %o2
200ab90: 96 10 20 01 mov 1, %o3
200ab94: 98 10 21 60 mov 0x160, %o4
200ab98: 7f ff fb 4a call 20098c0 <_Objects_Initialize_information>
200ab9c: 9a 10 20 00 clr %o5
200aba0: 81 c7 e0 08 ret
200aba4: 81 e8 00 00 restore
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
rtems_configuration_get_stack_free_hook() == NULL)
_Internal_error_Occurred(
200aba8: 90 10 20 00 clr %o0
200abac: 92 10 20 01 mov 1, %o1
200abb0: 7f ff f9 a6 call 2009248 <_Internal_error_Occurred>
200abb4: 94 10 20 0e mov 0xe, %o2
0200a928 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
200a928: 9d e3 bf a0 save %sp, -96, %sp
200a92c: c2 07 a0 6c ld [ %fp + 0x6c ], %g1
200a930: f4 0f a0 5f ldub [ %fp + 0x5f ], %i2
200a934: 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;
200a938: c0 26 61 50 clr [ %i1 + 0x150 ]
200a93c: c0 26 61 54 clr [ %i1 + 0x154 ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
200a940: c0 26 61 4c clr [ %i1 + 0x14c ]
/*
* 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 );
200a944: 90 10 00 19 mov %i1, %o0
200a948: 40 00 02 36 call 200b220 <_Thread_Stack_Allocate>
200a94c: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
200a950: 80 a2 00 1b cmp %o0, %i3
200a954: 0a 80 00 4b bcs 200aa80 <_Thread_Initialize+0x158>
200a958: 80 a2 20 00 cmp %o0, 0
200a95c: 02 80 00 49 be 200aa80 <_Thread_Initialize+0x158> <== NEVER TAKEN
200a960: 80 a7 20 00 cmp %i4, 0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
200a964: c2 06 60 bc ld [ %i1 + 0xbc ], %g1
the_stack->size = size;
200a968: d0 26 60 b0 st %o0, [ %i1 + 0xb0 ]
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
200a96c: c2 26 60 b4 st %g1, [ %i1 + 0xb4 ]
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
200a970: 12 80 00 48 bne 200aa90 <_Thread_Initialize+0x168>
200a974: b6 10 20 00 clr %i3
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
200a978: 39 00 80 74 sethi %hi(0x201d000), %i4
200a97c: c2 07 22 90 ld [ %i4 + 0x290 ], %g1 ! 201d290 <_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;
200a980: f6 26 61 48 st %i3, [ %i1 + 0x148 ]
the_thread->Start.fp_context = fp_area;
200a984: f6 26 60 b8 st %i3, [ %i1 + 0xb8 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
200a988: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
200a98c: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
200a990: c0 26 60 68 clr [ %i1 + 0x68 ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
200a994: 80 a0 60 00 cmp %g1, 0
200a998: 12 80 00 46 bne 200aab0 <_Thread_Initialize+0x188>
200a99c: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200a9a0: c0 26 61 58 clr [ %i1 + 0x158 ]
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
200a9a4: a2 10 20 00 clr %l1
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
200a9a8: c4 07 a0 60 ld [ %fp + 0x60 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
200a9ac: 03 00 80 71 sethi %hi(0x201c400), %g1
200a9b0: c4 26 60 a0 st %g2, [ %i1 + 0xa0 ]
the_thread->Start.budget_callout = budget_callout;
200a9b4: c4 07 a0 64 ld [ %fp + 0x64 ], %g2
200a9b8: c2 00 61 b8 ld [ %g1 + 0x1b8 ], %g1
200a9bc: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
200a9c0: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
200a9c4: f4 2e 60 9c stb %i2, [ %i1 + 0x9c ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
200a9c8: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ]
the_thread->current_state = STATES_DORMANT;
200a9cc: 84 10 20 01 mov 1, %g2
the_thread->Wait.queue = NULL;
200a9d0: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
200a9d4: c4 26 60 10 st %g2, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
200a9d8: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
200a9dc: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
200a9e0: fa 26 60 ac st %i5, [ %i1 + 0xac ]
200a9e4: 9f c0 40 00 call %g1
200a9e8: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
200a9ec: b8 92 20 00 orcc %o0, 0, %i4
200a9f0: 22 80 00 13 be,a 200aa3c <_Thread_Initialize+0x114>
200a9f4: d0 06 61 4c ld [ %i1 + 0x14c ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
200a9f8: 90 10 00 19 mov %i1, %o0
200a9fc: 40 00 01 e0 call 200b17c <_Thread_Set_priority>
200aa00: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200aa04: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
200aa08: c2 16 60 0a lduh [ %i1 + 0xa ], %g1
static inline void _Timestamp64_implementation_Set_to_zero(
Timestamp64_Control *_time
)
{
*_time = 0;
200aa0c: c0 26 60 80 clr [ %i1 + 0x80 ]
200aa10: c0 26 60 84 clr [ %i1 + 0x84 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200aa14: 83 28 60 02 sll %g1, 2, %g1
200aa18: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
200aa1c: 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 );
200aa20: 90 10 00 19 mov %i1, %o0
200aa24: 40 00 02 a5 call 200b4b8 <_User_extensions_Thread_create>
200aa28: b0 10 20 01 mov 1, %i0
if ( extension_status )
200aa2c: 80 8a 20 ff btst 0xff, %o0
200aa30: 32 80 00 12 bne,a 200aa78 <_Thread_Initialize+0x150>
200aa34: b0 0e 20 ff and %i0, 0xff, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
200aa38: d0 06 61 4c ld [ %i1 + 0x14c ], %o0
200aa3c: 40 00 03 e0 call 200b9bc <_Workspace_Free>
200aa40: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
200aa44: 40 00 03 de call 200b9bc <_Workspace_Free>
200aa48: d0 06 61 50 ld [ %i1 + 0x150 ], %o0
200aa4c: 40 00 03 dc call 200b9bc <_Workspace_Free>
200aa50: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
_Workspace_Free( extensions_area );
200aa54: 40 00 03 da call 200b9bc <_Workspace_Free>
200aa58: 90 10 00 11 mov %l1, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
200aa5c: 40 00 03 d8 call 200b9bc <_Workspace_Free>
200aa60: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
200aa64: 40 00 03 d6 call 200b9bc <_Workspace_Free>
200aa68: 90 10 00 1c mov %i4, %o0
_Thread_Stack_Free( the_thread );
200aa6c: 40 00 01 fd call 200b260 <_Thread_Stack_Free>
200aa70: 90 10 00 19 mov %i1, %o0
200aa74: b0 0e 20 ff and %i0, 0xff, %i0
200aa78: 81 c7 e0 08 ret
200aa7c: 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 */
200aa80: b0 10 20 00 clr %i0
200aa84: b0 0e 20 ff and %i0, 0xff, %i0
200aa88: 81 c7 e0 08 ret
200aa8c: 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 );
200aa90: 40 00 03 c3 call 200b99c <_Workspace_Allocate>
200aa94: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
200aa98: b6 92 20 00 orcc %o0, 0, %i3
200aa9c: 32 bf ff b8 bne,a 200a97c <_Thread_Initialize+0x54>
200aaa0: 39 00 80 74 sethi %hi(0x201d000), %i4
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
200aaa4: a2 10 20 00 clr %l1
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;
200aaa8: 10 bf ff e4 b 200aa38 <_Thread_Initialize+0x110>
200aaac: b8 10 20 00 clr %i4
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
200aab0: 90 00 60 01 add %g1, 1, %o0
200aab4: 40 00 03 ba call 200b99c <_Workspace_Allocate>
200aab8: 91 2a 20 02 sll %o0, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
200aabc: a2 92 20 00 orcc %o0, 0, %l1
200aac0: 02 80 00 10 be 200ab00 <_Thread_Initialize+0x1d8>
200aac4: 86 10 00 11 mov %l1, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200aac8: e2 26 61 58 st %l1, [ %i1 + 0x158 ]
200aacc: c8 07 22 90 ld [ %i4 + 0x290 ], %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++ )
200aad0: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200aad4: 10 80 00 03 b 200aae0 <_Thread_Initialize+0x1b8>
200aad8: 82 10 20 00 clr %g1
200aadc: c6 06 61 58 ld [ %i1 + 0x158 ], %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;
200aae0: 85 28 a0 02 sll %g2, 2, %g2
200aae4: 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++ )
200aae8: 82 00 60 01 inc %g1
200aaec: 80 a0 40 04 cmp %g1, %g4
200aaf0: 08 bf ff fb bleu 200aadc <_Thread_Initialize+0x1b4>
200aaf4: 84 10 00 01 mov %g1, %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
200aaf8: 10 bf ff ad b 200a9ac <_Thread_Initialize+0x84>
200aafc: 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;
200ab00: 10 bf ff ce b 200aa38 <_Thread_Initialize+0x110>
200ab04: b8 10 20 00 clr %i4
0200b0b8 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
200b0b8: 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 )
200b0bc: 80 a6 20 00 cmp %i0, 0
200b0c0: 02 80 00 13 be 200b10c <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
200b0c4: 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 ) {
200b0c8: fa 06 20 34 ld [ %i0 + 0x34 ], %i5
200b0cc: 80 a7 60 01 cmp %i5, 1
200b0d0: 02 80 00 04 be 200b0e0 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
200b0d4: 01 00 00 00 nop
200b0d8: 81 c7 e0 08 ret <== NOT EXECUTED
200b0dc: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
200b0e0: 7f ff dd a1 call 2002764 <sparc_disable_interrupts>
200b0e4: 01 00 00 00 nop
200b0e8: b8 10 00 08 mov %o0, %i4
200b0ec: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
200b0f0: 03 00 00 ef sethi %hi(0x3bc00), %g1
200b0f4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
200b0f8: 80 88 80 01 btst %g2, %g1
200b0fc: 12 80 00 06 bne 200b114 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
200b100: 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 );
200b104: 7f ff dd 9c call 2002774 <sparc_enable_interrupts>
200b108: 90 10 00 1c mov %i4, %o0
200b10c: 81 c7 e0 08 ret
200b110: 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 );
200b114: 92 10 00 19 mov %i1, %o1
200b118: 94 10 20 01 mov 1, %o2
200b11c: 40 00 0b 7a call 200df04 <_Thread_queue_Extract_priority_helper>
200b120: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
200b124: 90 10 00 18 mov %i0, %o0
200b128: 92 10 00 19 mov %i1, %o1
200b12c: 7f ff ff 35 call 200ae00 <_Thread_queue_Enqueue_priority>
200b130: 94 07 bf fc add %fp, -4, %o2
200b134: 30 bf ff f4 b,a 200b104 <_Thread_queue_Requeue+0x4c>
0200b138 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
200b138: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
200b13c: 90 10 00 18 mov %i0, %o0
200b140: 7f ff fd ce call 200a878 <_Thread_Get>
200b144: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200b148: c2 07 bf fc ld [ %fp + -4 ], %g1
200b14c: 80 a0 60 00 cmp %g1, 0
200b150: 12 80 00 09 bne 200b174 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN
200b154: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
200b158: 40 00 0b a4 call 200dfe8 <_Thread_queue_Process_timeout>
200b15c: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
200b160: 03 00 80 74 sethi %hi(0x201d000), %g1
200b164: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 201d210 <_Thread_Dispatch_disable_level>
200b168: 84 00 bf ff add %g2, -1, %g2
200b16c: c4 20 62 10 st %g2, [ %g1 + 0x210 ]
return _Thread_Dispatch_disable_level;
200b170: c2 00 62 10 ld [ %g1 + 0x210 ], %g1
200b174: 81 c7 e0 08 ret
200b178: 81 e8 00 00 restore
02018210 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
2018210: 9d e3 bf 88 save %sp, -120, %sp
2018214: 21 00 80 ed sethi %hi(0x203b400), %l0
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2018218: a4 07 bf e8 add %fp, -24, %l2
201821c: b4 07 bf ec add %fp, -20, %i2
2018220: b8 07 bf f4 add %fp, -12, %i4
2018224: a2 07 bf f8 add %fp, -8, %l1
2018228: 33 00 80 ed sethi %hi(0x203b400), %i1
201822c: 27 00 80 ed sethi %hi(0x203b400), %l3
2018230: f4 27 bf e8 st %i2, [ %fp + -24 ]
head->previous = NULL;
2018234: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
2018238: e4 27 bf f0 st %l2, [ %fp + -16 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
201823c: e2 27 bf f4 st %l1, [ %fp + -12 ]
head->previous = NULL;
2018240: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
2018244: f8 27 bf fc st %i4, [ %fp + -4 ]
2018248: a0 14 21 e8 or %l0, 0x1e8, %l0
201824c: b6 06 20 30 add %i0, 0x30, %i3
2018250: b2 16 60 38 or %i1, 0x38, %i1
2018254: ba 06 20 68 add %i0, 0x68, %i5
2018258: a6 14 e0 f0 or %l3, 0xf0, %l3
201825c: ac 06 20 08 add %i0, 8, %l6
2018260: aa 06 20 40 add %i0, 0x40, %l5
_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;
2018264: a8 10 20 01 mov 1, %l4
{
/*
* 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;
2018268: e4 26 20 78 st %l2, [ %i0 + 0x78 ]
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
201826c: c2 04 00 00 ld [ %l0 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2018270: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2018274: 90 10 00 1b mov %i3, %o0
2018278: 92 20 40 09 sub %g1, %o1, %o1
201827c: 94 10 00 1c mov %i4, %o2
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2018280: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2018284: 40 00 12 59 call 201cbe8 <_Watchdog_Adjust_to_chain>
2018288: 01 00 00 00 nop
201828c: d0 1e 40 00 ldd [ %i1 ], %o0
2018290: 94 10 20 00 clr %o2
2018294: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2018298: 40 00 4d 99 call 202b8fc <__divdi3>
201829c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
20182a0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2
/*
* 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 ) {
20182a4: 80 a2 40 0a cmp %o1, %o2
20182a8: 18 80 00 2b bgu 2018354 <_Timer_server_Body+0x144>
20182ac: ae 10 00 09 mov %o1, %l7
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
} else if ( snapshot < last_snapshot ) {
20182b0: 80 a2 40 0a cmp %o1, %o2
20182b4: 0a 80 00 20 bcs 2018334 <_Timer_server_Body+0x124>
20182b8: 90 10 00 1d mov %i5, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
20182bc: ee 26 20 74 st %l7, [ %i0 + 0x74 ]
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
20182c0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20182c4: 40 00 02 9f call 2018d40 <_Chain_Get>
20182c8: 01 00 00 00 nop
if ( timer == NULL ) {
20182cc: 92 92 20 00 orcc %o0, 0, %o1
20182d0: 02 80 00 10 be 2018310 <_Timer_server_Body+0x100>
20182d4: 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 ) {
20182d8: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
20182dc: 80 a0 60 01 cmp %g1, 1
20182e0: 02 80 00 19 be 2018344 <_Timer_server_Body+0x134>
20182e4: 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 ) {
20182e8: 12 bf ff f6 bne 20182c0 <_Timer_server_Body+0xb0> <== NEVER TAKEN
20182ec: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20182f0: 40 00 12 6f call 201ccac <_Watchdog_Insert>
20182f4: 90 10 00 1d mov %i5, %o0
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
20182f8: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20182fc: 40 00 02 91 call 2018d40 <_Chain_Get>
2018300: 01 00 00 00 nop
if ( timer == NULL ) {
2018304: 92 92 20 00 orcc %o0, 0, %o1
2018308: 32 bf ff f5 bne,a 20182dc <_Timer_server_Body+0xcc> <== NEVER TAKEN
201830c: 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 );
2018310: 7f ff dd 40 call 200f810 <sparc_disable_interrupts>
2018314: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
2018318: c2 07 bf e8 ld [ %fp + -24 ], %g1
201831c: 80 a0 40 1a cmp %g1, %i2
2018320: 02 80 00 12 be 2018368 <_Timer_server_Body+0x158> <== ALWAYS TAKEN
2018324: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
2018328: 7f ff dd 3e call 200f820 <sparc_enable_interrupts> <== NOT EXECUTED
201832c: 01 00 00 00 nop <== NOT EXECUTED
2018330: 30 bf ff cf b,a 201826c <_Timer_server_Body+0x5c> <== NOT EXECUTED
/*
* 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 );
2018334: 92 10 20 01 mov 1, %o1 ! 1 <PROM_START+0x1>
2018338: 40 00 11 fc call 201cb28 <_Watchdog_Adjust>
201833c: 94 22 80 17 sub %o2, %l7, %o2
2018340: 30 bf ff df b,a 20182bc <_Timer_server_Body+0xac>
Timer_server_Control *ts,
Timer_Control *timer
)
{
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
2018344: 90 10 00 1b mov %i3, %o0
2018348: 40 00 12 59 call 201ccac <_Watchdog_Insert>
201834c: 92 02 60 10 add %o1, 0x10, %o1
2018350: 30 bf ff dc b,a 20182c0 <_Timer_server_Body+0xb0>
/*
* 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 );
2018354: 92 22 40 0a sub %o1, %o2, %o1
2018358: 90 10 00 1d mov %i5, %o0
201835c: 40 00 12 23 call 201cbe8 <_Watchdog_Adjust_to_chain>
2018360: 94 10 00 1c mov %i4, %o2
2018364: 30 bf ff d6 b,a 20182bc <_Timer_server_Body+0xac>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
2018368: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
201836c: 7f ff dd 2d call 200f820 <sparc_enable_interrupts>
2018370: 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 ) ) {
2018374: c2 07 bf f4 ld [ %fp + -12 ], %g1
2018378: 80 a0 40 11 cmp %g1, %l1
201837c: 12 80 00 0c bne 20183ac <_Timer_server_Body+0x19c>
2018380: 01 00 00 00 nop
2018384: 30 80 00 13 b,a 20183d0 <_Timer_server_Body+0x1c0>
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;
2018388: f8 20 60 04 st %i4, [ %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;
201838c: 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;
2018390: c0 25 e0 08 clr [ %l7 + 8 ]
_ISR_Enable( level );
2018394: 7f ff dd 23 call 200f820 <sparc_enable_interrupts>
2018398: 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 );
201839c: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0
20183a0: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1
20183a4: 9f c0 40 00 call %g1
20183a8: d2 05 e0 24 ld [ %l7 + 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 );
20183ac: 7f ff dd 19 call 200f810 <sparc_disable_interrupts>
20183b0: 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;
20183b4: ee 07 bf f4 ld [ %fp + -12 ], %l7
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected(
Chain_Control *the_chain
)
{
if ( !_Chain_Is_empty(the_chain))
20183b8: 80 a5 c0 11 cmp %l7, %l1
20183bc: 32 bf ff f3 bne,a 2018388 <_Timer_server_Body+0x178>
20183c0: c2 05 c0 00 ld [ %l7 ], %g1
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
_ISR_Enable( level );
} else {
_ISR_Enable( level );
20183c4: 7f ff dd 17 call 200f820 <sparc_enable_interrupts>
20183c8: 01 00 00 00 nop
20183cc: 30 bf ff a7 b,a 2018268 <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
20183d0: c0 2e 20 7c clrb [ %i0 + 0x7c ]
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20183d4: c2 04 c0 00 ld [ %l3 ], %g1
20183d8: 82 00 60 01 inc %g1
20183dc: c2 24 c0 00 st %g1, [ %l3 ]
return _Thread_Dispatch_disable_level;
20183e0: c2 04 c0 00 ld [ %l3 ], %g1
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
20183e4: d0 06 00 00 ld [ %i0 ], %o0
20183e8: 40 00 10 9c call 201c658 <_Thread_Set_state>
20183ec: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
20183f0: 7f ff ff 05 call 2018004 <_Timer_server_Reset_interval_system_watchdog>
20183f4: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
20183f8: 7f ff ff 17 call 2018054 <_Timer_server_Reset_tod_system_watchdog>
20183fc: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
2018400: 40 00 0e 1c call 201bc70 <_Thread_Enable_dispatch>
2018404: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2018408: 90 10 00 16 mov %l6, %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;
201840c: e8 2e 20 7c stb %l4, [ %i0 + 0x7c ]
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2018410: 40 00 12 86 call 201ce28 <_Watchdog_Remove>
2018414: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
2018418: 40 00 12 84 call 201ce28 <_Watchdog_Remove>
201841c: 90 10 00 15 mov %l5, %o0
2018420: 30 bf ff 92 b,a 2018268 <_Timer_server_Body+0x58>
020180a4 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
20180a4: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
20180a8: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
20180ac: 80 a0 60 00 cmp %g1, 0
20180b0: 02 80 00 05 be 20180c4 <_Timer_server_Schedule_operation_method+0x20>
20180b4: 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 );
20180b8: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
20180bc: 40 00 03 16 call 2018d14 <_Chain_Append>
20180c0: 81 e8 00 00 restore
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20180c4: 03 00 80 ed sethi %hi(0x203b400), %g1
20180c8: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 203b4f0 <_Thread_Dispatch_disable_level>
20180cc: 84 00 a0 01 inc %g2
20180d0: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ]
return _Thread_Dispatch_disable_level;
20180d4: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
20180d8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
20180dc: 80 a0 60 01 cmp %g1, 1
20180e0: 02 80 00 2b be 201818c <_Timer_server_Schedule_operation_method+0xe8>
20180e4: 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 ) {
20180e8: 02 80 00 04 be 20180f8 <_Timer_server_Schedule_operation_method+0x54>
20180ec: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
20180f0: 40 00 0e e0 call 201bc70 <_Thread_Enable_dispatch>
20180f4: 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 );
20180f8: 7f ff dd c6 call 200f810 <sparc_disable_interrupts>
20180fc: 01 00 00 00 nop
2018100: b8 10 00 08 mov %o0, %i4
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
2018104: 03 00 80 ed sethi %hi(0x203b400), %g1
2018108: d0 18 60 38 ldd [ %g1 + 0x38 ], %o0 ! 203b438 <_TOD>
201810c: 94 10 20 00 clr %o2
2018110: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2018114: 40 00 4d fa call 202b8fc <__divdi3>
2018118: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
201811c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
2018120: c4 06 20 74 ld [ %i0 + 0x74 ], %g2
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
2018124: 86 06 20 6c add %i0, 0x6c, %g3
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
2018128: 80 a0 40 03 cmp %g1, %g3
201812c: 02 80 00 0a be 2018154 <_Timer_server_Schedule_operation_method+0xb0>
2018130: 80 a2 40 02 cmp %o1, %g2
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
if ( snapshot > last_snapshot ) {
2018134: 08 80 00 34 bleu 2018204 <_Timer_server_Schedule_operation_method+0x160>
2018138: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
201813c: 84 22 40 02 sub %o1, %g2, %g2
if (delta_interval > delta) {
2018140: 80 a1 00 02 cmp %g4, %g2
2018144: 08 80 00 03 bleu 2018150 <_Timer_server_Schedule_operation_method+0xac><== NEVER TAKEN
2018148: 86 10 20 00 clr %g3
delta_interval -= delta;
201814c: 86 21 00 02 sub %g4, %g2, %g3
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
delta_interval += delta;
}
first_watchdog->delta_interval = delta_interval;
2018150: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
2018154: d2 26 20 74 st %o1, [ %i0 + 0x74 ]
_ISR_Enable( level );
2018158: 7f ff dd b2 call 200f820 <sparc_enable_interrupts>
201815c: 90 10 00 1c mov %i4, %o0
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
2018160: 90 06 20 68 add %i0, 0x68, %o0
2018164: 40 00 12 d2 call 201ccac <_Watchdog_Insert>
2018168: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
201816c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2018170: 80 a0 60 00 cmp %g1, 0
2018174: 12 bf ff df bne 20180f0 <_Timer_server_Schedule_operation_method+0x4c>
2018178: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
201817c: 7f ff ff b6 call 2018054 <_Timer_server_Reset_tod_system_watchdog>
2018180: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
2018184: 40 00 0e bb call 201bc70 <_Thread_Enable_dispatch>
2018188: 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 );
201818c: 7f ff dd a1 call 200f810 <sparc_disable_interrupts>
2018190: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
2018194: 05 00 80 ed sethi %hi(0x203b400), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2018198: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
201819c: c4 00 a1 e8 ld [ %g2 + 0x1e8 ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
20181a0: 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 );
20181a4: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
20181a8: 80 a0 40 03 cmp %g1, %g3
20181ac: 02 80 00 08 be 20181cc <_Timer_server_Schedule_operation_method+0x128>
20181b0: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
20181b4: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
if (delta_interval > delta) {
20181b8: 80 a1 00 1c cmp %g4, %i4
20181bc: 1a 80 00 03 bcc 20181c8 <_Timer_server_Schedule_operation_method+0x124>
20181c0: 86 10 20 00 clr %g3
delta_interval -= delta;
20181c4: 86 27 00 04 sub %i4, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
20181c8: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
20181cc: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
20181d0: 7f ff dd 94 call 200f820 <sparc_enable_interrupts>
20181d4: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
20181d8: 90 06 20 30 add %i0, 0x30, %o0
20181dc: 40 00 12 b4 call 201ccac <_Watchdog_Insert>
20181e0: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
20181e4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
20181e8: 80 a0 60 00 cmp %g1, 0
20181ec: 12 bf ff c1 bne 20180f0 <_Timer_server_Schedule_operation_method+0x4c>
20181f0: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
20181f4: 7f ff ff 84 call 2018004 <_Timer_server_Reset_interval_system_watchdog>
20181f8: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
20181fc: 40 00 0e 9d call 201bc70 <_Thread_Enable_dispatch>
2018200: 81 e8 00 00 restore
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
2018204: 84 01 00 02 add %g4, %g2, %g2
delta_interval += delta;
2018208: 10 bf ff d2 b 2018150 <_Timer_server_Schedule_operation_method+0xac>
201820c: 86 20 80 09 sub %g2, %o1, %g3
0200bb6c <_Timespec_Add_to>:
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200bb6c: d8 02 00 00 ld [ %o0 ], %o4
uint32_t _Timespec_Add_to(
struct timespec *time,
const struct timespec *add
)
{
uint32_t seconds = add->tv_sec;
200bb70: c4 02 40 00 ld [ %o1 ], %g2
/* Add the basics */
time->tv_sec += add->tv_sec;
time->tv_nsec += add->tv_nsec;
200bb74: c6 02 20 04 ld [ %o0 + 4 ], %g3
200bb78: c2 02 60 04 ld [ %o1 + 4 ], %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200bb7c: 98 03 00 02 add %o4, %g2, %o4
time->tv_nsec += add->tv_nsec;
200bb80: 82 00 c0 01 add %g3, %g1, %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200bb84: d8 22 00 00 st %o4, [ %o0 ]
time->tv_nsec += add->tv_nsec;
/* Now adjust it so nanoseconds is in range */
while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
200bb88: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4
200bb8c: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff <RAM_END+0x395ac9ff>
200bb90: 80 a0 40 04 cmp %g1, %g4
200bb94: 08 80 00 0d bleu 200bbc8 <_Timespec_Add_to+0x5c>
200bb98: c2 22 20 04 st %g1, [ %o0 + 4 ]
200bb9c: 98 03 20 01 inc %o4
time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
200bba0: 1b 31 19 4d sethi %hi(0xc4653400), %o5
*
* This routines adds two timespecs. The second argument is added
* to the first.
*/
uint32_t _Timespec_Add_to(
200bba4: 98 23 00 02 sub %o4, %g2, %o4
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 ) {
time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
200bba8: 9a 13 62 00 or %o5, 0x200, %o5
200bbac: 82 00 40 0d add %g1, %o5, %g1
*
* This routines adds two timespecs. The second argument is added
* to the first.
*/
uint32_t _Timespec_Add_to(
200bbb0: 86 03 00 02 add %o4, %g2, %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 ) {
200bbb4: 80 a0 40 04 cmp %g1, %g4
200bbb8: 18 bf ff fd bgu 200bbac <_Timespec_Add_to+0x40> <== NEVER TAKEN
200bbbc: 84 00 a0 01 inc %g2
200bbc0: c2 22 20 04 st %g1, [ %o0 + 4 ]
200bbc4: c6 22 00 00 st %g3, [ %o0 ]
time->tv_sec++;
seconds++;
}
return seconds;
}
200bbc8: 81 c3 e0 08 retl
200bbcc: 90 10 00 02 mov %g2, %o0
0200cc04 <_Timestamp64_Divide>:
const Timestamp64_Control *_lhs,
const Timestamp64_Control *_rhs,
uint32_t *_ival_percentage,
uint32_t *_fval_percentage
)
{
200cc04: 9d e3 bf a0 save %sp, -96, %sp
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
200cc08: d4 1e 40 00 ldd [ %i1 ], %o2
200cc0c: 80 92 80 0b orcc %o2, %o3, %g0
200cc10: 22 80 00 2f be,a 200cccc <_Timestamp64_Divide+0xc8> <== NEVER TAKEN
200cc14: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
* This looks odd but gives the results the proper precision.
*
* TODO: Rounding on the last digit of the fval.
*/
answer = (*_lhs * 100000) / *_rhs;
200cc18: d0 1e 00 00 ldd [ %i0 ], %o0
200cc1c: 83 2a 20 02 sll %o0, 2, %g1
200cc20: 89 32 60 1e srl %o1, 0x1e, %g4
200cc24: 87 2a 60 02 sll %o1, 2, %g3
200cc28: 84 11 00 01 or %g4, %g1, %g2
200cc2c: 83 30 e0 1b srl %g3, 0x1b, %g1
200cc30: 9b 28 e0 05 sll %g3, 5, %o5
200cc34: 99 28 a0 05 sll %g2, 5, %o4
200cc38: 86 a3 40 03 subcc %o5, %g3, %g3
200cc3c: 98 10 40 0c or %g1, %o4, %o4
200cc40: 84 63 00 02 subx %o4, %g2, %g2
200cc44: 92 80 c0 09 addcc %g3, %o1, %o1
200cc48: 83 32 60 1e srl %o1, 0x1e, %g1
200cc4c: 90 40 80 08 addx %g2, %o0, %o0
200cc50: b3 2a 60 02 sll %o1, 2, %i1
200cc54: b1 2a 20 02 sll %o0, 2, %i0
200cc58: 92 82 40 19 addcc %o1, %i1, %o1
200cc5c: b0 10 40 18 or %g1, %i0, %i0
200cc60: 83 32 60 1e srl %o1, 0x1e, %g1
200cc64: 90 42 00 18 addx %o0, %i0, %o0
200cc68: bb 2a 60 02 sll %o1, 2, %i5
200cc6c: b9 2a 20 02 sll %o0, 2, %i4
200cc70: 92 82 40 1d addcc %o1, %i5, %o1
200cc74: b8 10 40 1c or %g1, %i4, %i4
200cc78: 87 32 60 1b srl %o1, 0x1b, %g3
200cc7c: 90 42 00 1c addx %o0, %i4, %o0
200cc80: 83 2a 60 05 sll %o1, 5, %g1
200cc84: 85 2a 20 05 sll %o0, 5, %g2
200cc88: 92 10 00 01 mov %g1, %o1
200cc8c: 40 00 37 ff call 201ac88 <__divdi3>
200cc90: 90 10 c0 02 or %g3, %g2, %o0
*_ival_percentage = answer / 1000;
200cc94: 94 10 20 00 clr %o2
* This looks odd but gives the results the proper precision.
*
* TODO: Rounding on the last digit of the fval.
*/
answer = (*_lhs * 100000) / *_rhs;
200cc98: b8 10 00 08 mov %o0, %i4
200cc9c: ba 10 00 09 mov %o1, %i5
*_ival_percentage = answer / 1000;
200cca0: 40 00 37 fa call 201ac88 <__divdi3>
200cca4: 96 10 23 e8 mov 0x3e8, %o3
*_fval_percentage = answer % 1000;
200cca8: 90 10 00 1c mov %i4, %o0
* TODO: Rounding on the last digit of the fval.
*/
answer = (*_lhs * 100000) / *_rhs;
*_ival_percentage = answer / 1000;
200ccac: d2 26 80 00 st %o1, [ %i2 ]
*_fval_percentage = answer % 1000;
200ccb0: 94 10 20 00 clr %o2
200ccb4: 96 10 23 e8 mov 0x3e8, %o3
200ccb8: 40 00 38 df call 201b034 <__moddi3>
200ccbc: 92 10 00 1d mov %i5, %o1
200ccc0: d2 26 c0 00 st %o1, [ %i3 ]
200ccc4: 81 c7 e0 08 ret
200ccc8: 81 e8 00 00 restore
{
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
*_ival_percentage = 0;
*_fval_percentage = 0;
200cccc: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED
return;
200ccd0: 81 c7 e0 08 ret <== NOT EXECUTED
200ccd4: 81 e8 00 00 restore <== NOT EXECUTED
0200b468 <_User_extensions_Fatal>:
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
200b468: 9d e3 bf a0 save %sp, -96, %sp
200b46c: 39 00 80 74 sethi %hi(0x201d000), %i4
200b470: b8 17 23 e8 or %i4, 0x3e8, %i4 ! 201d3e8 <_User_extensions_List>
200b474: 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 );
200b478: 80 a7 40 1c cmp %i5, %i4
200b47c: 02 80 00 0d be 200b4b0 <_User_extensions_Fatal+0x48> <== NEVER TAKEN
200b480: 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 )
200b484: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200b488: 80 a0 60 00 cmp %g1, 0
200b48c: 02 80 00 05 be 200b4a0 <_User_extensions_Fatal+0x38>
200b490: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
200b494: 92 10 00 19 mov %i1, %o1
200b498: 9f c0 40 00 call %g1
200b49c: 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 ) {
200b4a0: 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 );
200b4a4: 80 a7 40 1c cmp %i5, %i4
200b4a8: 32 bf ff f8 bne,a 200b488 <_User_extensions_Fatal+0x20>
200b4ac: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200b4b0: 81 c7 e0 08 ret
200b4b4: 81 e8 00 00 restore
0200b314 <_User_extensions_Handler_initialization>:
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _User_extensions_Handler_initialization(void)
{
200b314: 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;
200b318: 07 00 80 71 sethi %hi(0x201c400), %g3
200b31c: 86 10 e0 ac or %g3, 0xac, %g3 ! 201c4ac <Configuration>
initial_extensions = Configuration.User_extension_table;
200b320: f6 00 e0 48 ld [ %g3 + 0x48 ], %i3
200b324: 3b 00 80 74 sethi %hi(0x201d000), %i5
200b328: 09 00 80 74 sethi %hi(0x201d000), %g4
200b32c: 84 17 63 e8 or %i5, 0x3e8, %g2
200b330: 82 11 22 14 or %g4, 0x214, %g1
200b334: b4 00 a0 04 add %g2, 4, %i2
200b338: b8 00 60 04 add %g1, 4, %i4
200b33c: f4 27 63 e8 st %i2, [ %i5 + 0x3e8 ]
head->previous = NULL;
200b340: c0 20 a0 04 clr [ %g2 + 4 ]
tail->previous = head;
200b344: 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;
200b348: f8 21 22 14 st %i4, [ %g4 + 0x214 ]
head->previous = NULL;
200b34c: c0 20 60 04 clr [ %g1 + 4 ]
tail->previous = head;
200b350: c2 20 60 08 st %g1, [ %g1 + 8 ]
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
200b354: 80 a6 e0 00 cmp %i3, 0
200b358: 02 80 00 1b be 200b3c4 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200b35c: f4 00 e0 44 ld [ %g3 + 0x44 ], %i2
extension = (User_extensions_Control *)
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
200b360: 83 2e a0 02 sll %i2, 2, %g1
200b364: b9 2e a0 04 sll %i2, 4, %i4
200b368: b8 27 00 01 sub %i4, %g1, %i4
200b36c: b8 07 00 1a add %i4, %i2, %i4
200b370: 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 *)
200b374: 40 00 01 98 call 200b9d4 <_Workspace_Allocate_or_fatal_error>
200b378: 90 10 00 1c mov %i4, %o0
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200b37c: 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 *)
200b380: ba 10 00 08 mov %o0, %i5
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200b384: 40 00 13 f2 call 201034c <memset>
200b388: 94 10 00 1c mov %i4, %o2
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
200b38c: 80 a6 a0 00 cmp %i2, 0
200b390: 02 80 00 0d be 200b3c4 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200b394: 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;
200b398: 92 10 00 1b mov %i3, %o1
200b39c: 94 10 20 20 mov 0x20, %o2
200b3a0: 40 00 13 ae call 2010258 <memcpy>
200b3a4: 90 07 60 14 add %i5, 0x14, %o0
_User_extensions_Add_set( extension );
200b3a8: 40 00 0b 33 call 200e074 <_User_extensions_Add_set>
200b3ac: 90 10 00 1d mov %i5, %o0
200b3b0: b8 07 20 01 inc %i4
_User_extensions_Add_set_with_table (extension, &initial_extensions[i]);
extension++;
200b3b4: 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++ ) {
200b3b8: 80 a7 00 1a cmp %i4, %i2
200b3bc: 12 bf ff f7 bne 200b398 <_User_extensions_Handler_initialization+0x84>
200b3c0: b6 06 e0 20 add %i3, 0x20, %i3
200b3c4: 81 c7 e0 08 ret
200b3c8: 81 e8 00 00 restore
0200b3cc <_User_extensions_Thread_begin>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_begin (
Thread_Control *executing
)
{
200b3cc: 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;
200b3d0: 39 00 80 74 sethi %hi(0x201d000), %i4
200b3d4: fa 07 23 e8 ld [ %i4 + 0x3e8 ], %i5 ! 201d3e8 <_User_extensions_List>
200b3d8: b8 17 23 e8 or %i4, 0x3e8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200b3dc: b8 07 20 04 add %i4, 4, %i4
200b3e0: 80 a7 40 1c cmp %i5, %i4
200b3e4: 02 80 00 0c be 200b414 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN
200b3e8: 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 )
200b3ec: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200b3f0: 80 a0 60 00 cmp %g1, 0
200b3f4: 02 80 00 04 be 200b404 <_User_extensions_Thread_begin+0x38>
200b3f8: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_begin)( executing );
200b3fc: 9f c0 40 00 call %g1
200b400: 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 ) {
200b404: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200b408: 80 a7 40 1c cmp %i5, %i4
200b40c: 32 bf ff f9 bne,a 200b3f0 <_User_extensions_Thread_begin+0x24>
200b410: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200b414: 81 c7 e0 08 ret
200b418: 81 e8 00 00 restore
0200b4b8 <_User_extensions_Thread_create>:
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
200b4b8: 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;
200b4bc: 39 00 80 74 sethi %hi(0x201d000), %i4
200b4c0: fa 07 23 e8 ld [ %i4 + 0x3e8 ], %i5 ! 201d3e8 <_User_extensions_List>
200b4c4: b8 17 23 e8 or %i4, 0x3e8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
200b4c8: b8 07 20 04 add %i4, 4, %i4
200b4cc: 80 a7 40 1c cmp %i5, %i4
200b4d0: 02 80 00 10 be 200b510 <_User_extensions_Thread_create+0x58><== NEVER TAKEN
200b4d4: 37 00 80 75 sethi %hi(0x201d400), %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 ) {
200b4d8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200b4dc: 80 a0 60 00 cmp %g1, 0
200b4e0: 02 80 00 08 be 200b500 <_User_extensions_Thread_create+0x48>
200b4e4: 84 16 e0 30 or %i3, 0x30, %g2
status = (*the_extension->Callouts.thread_create)(
200b4e8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200b4ec: 9f c0 40 00 call %g1
200b4f0: 92 10 00 18 mov %i0, %o1
_Thread_Executing,
the_thread
);
if ( !status )
200b4f4: 80 8a 20 ff btst 0xff, %o0
200b4f8: 22 80 00 0a be,a 200b520 <_User_extensions_Thread_create+0x68>
200b4fc: b0 10 20 00 clr %i0
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 ) {
200b500: 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 );
200b504: 80 a7 40 1c cmp %i5, %i4
200b508: 32 bf ff f5 bne,a 200b4dc <_User_extensions_Thread_create+0x24>
200b50c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
if ( !status )
return false;
}
}
return true;
200b510: b0 10 20 01 mov 1, %i0
}
200b514: b0 0e 20 01 and %i0, 1, %i0
200b518: 81 c7 e0 08 ret
200b51c: 81 e8 00 00 restore
200b520: b0 0e 20 01 and %i0, 1, %i0
200b524: 81 c7 e0 08 ret
200b528: 81 e8 00 00 restore
0200b52c <_User_extensions_Thread_delete>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_delete (
Thread_Control *the_thread
)
{
200b52c: 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;
200b530: 39 00 80 74 sethi %hi(0x201d000), %i4
200b534: b8 17 23 e8 or %i4, 0x3e8, %i4 ! 201d3e8 <_User_extensions_List>
200b538: 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 );
200b53c: 80 a7 40 1c cmp %i5, %i4
200b540: 02 80 00 0d be 200b574 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN
200b544: 37 00 80 75 sethi %hi(0x201d400), %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 )
200b548: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200b54c: 80 a0 60 00 cmp %g1, 0
200b550: 02 80 00 05 be 200b564 <_User_extensions_Thread_delete+0x38>
200b554: 84 16 e0 30 or %i3, 0x30, %g2
(*the_extension->Callouts.thread_delete)(
200b558: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200b55c: 9f c0 40 00 call %g1
200b560: 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 ) {
200b564: 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 );
200b568: 80 a7 40 1c cmp %i5, %i4
200b56c: 32 bf ff f8 bne,a 200b54c <_User_extensions_Thread_delete+0x20>
200b570: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200b574: 81 c7 e0 08 ret
200b578: 81 e8 00 00 restore
0200b41c <_User_extensions_Thread_exitted>:
}
void _User_extensions_Thread_exitted (
Thread_Control *executing
)
{
200b41c: 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;
200b420: 39 00 80 74 sethi %hi(0x201d000), %i4
200b424: b8 17 23 e8 or %i4, 0x3e8, %i4 ! 201d3e8 <_User_extensions_List>
200b428: 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 );
200b42c: 80 a7 40 1c cmp %i5, %i4
200b430: 02 80 00 0c be 200b460 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN
200b434: 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 )
200b438: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200b43c: 80 a0 60 00 cmp %g1, 0
200b440: 02 80 00 04 be 200b450 <_User_extensions_Thread_exitted+0x34>
200b444: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_exitted)( executing );
200b448: 9f c0 40 00 call %g1
200b44c: 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 ) {
200b450: 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 );
200b454: 80 a7 40 1c cmp %i5, %i4
200b458: 32 bf ff f9 bne,a 200b43c <_User_extensions_Thread_exitted+0x20>
200b45c: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200b460: 81 c7 e0 08 ret
200b464: 81 e8 00 00 restore
0200bdd8 <_User_extensions_Thread_restart>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_restart (
Thread_Control *the_thread
)
{
200bdd8: 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;
200bddc: 39 00 80 77 sethi %hi(0x201dc00), %i4
200bde0: fa 07 23 18 ld [ %i4 + 0x318 ], %i5 ! 201df18 <_User_extensions_List>
200bde4: b8 17 23 18 or %i4, 0x318, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200bde8: b8 07 20 04 add %i4, 4, %i4
200bdec: 80 a7 40 1c cmp %i5, %i4
200bdf0: 02 80 00 0d be 200be24 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN
200bdf4: 37 00 80 77 sethi %hi(0x201dc00), %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 )
200bdf8: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200bdfc: 80 a0 60 00 cmp %g1, 0
200be00: 02 80 00 05 be 200be14 <_User_extensions_Thread_restart+0x3c>
200be04: 84 16 e3 60 or %i3, 0x360, %g2
(*the_extension->Callouts.thread_restart)(
200be08: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200be0c: 9f c0 40 00 call %g1
200be10: 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 ) {
200be14: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200be18: 80 a7 40 1c cmp %i5, %i4
200be1c: 32 bf ff f8 bne,a 200bdfc <_User_extensions_Thread_restart+0x24>
200be20: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200be24: 81 c7 e0 08 ret
200be28: 81 e8 00 00 restore
0200b57c <_User_extensions_Thread_start>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_start (
Thread_Control *the_thread
)
{
200b57c: 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;
200b580: 39 00 80 74 sethi %hi(0x201d000), %i4
200b584: fa 07 23 e8 ld [ %i4 + 0x3e8 ], %i5 ! 201d3e8 <_User_extensions_List>
200b588: b8 17 23 e8 or %i4, 0x3e8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200b58c: b8 07 20 04 add %i4, 4, %i4
200b590: 80 a7 40 1c cmp %i5, %i4
200b594: 02 80 00 0d be 200b5c8 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN
200b598: 37 00 80 75 sethi %hi(0x201d400), %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 )
200b59c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200b5a0: 80 a0 60 00 cmp %g1, 0
200b5a4: 02 80 00 05 be 200b5b8 <_User_extensions_Thread_start+0x3c>
200b5a8: 84 16 e0 30 or %i3, 0x30, %g2
(*the_extension->Callouts.thread_start)(
200b5ac: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200b5b0: 9f c0 40 00 call %g1
200b5b4: 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 ) {
200b5b8: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200b5bc: 80 a7 40 1c cmp %i5, %i4
200b5c0: 32 bf ff f8 bne,a 200b5a0 <_User_extensions_Thread_start+0x24>
200b5c4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200b5c8: 81 c7 e0 08 ret
200b5cc: 81 e8 00 00 restore
0200b5d0 <_User_extensions_Thread_switch>:
void _User_extensions_Thread_switch (
Thread_Control *executing,
Thread_Control *heir
)
{
200b5d0: 9d e3 bf a0 save %sp, -96, %sp
200b5d4: 39 00 80 74 sethi %hi(0x201d000), %i4
200b5d8: fa 07 22 14 ld [ %i4 + 0x214 ], %i5 ! 201d214 <_User_extensions_Switches_list>
200b5dc: b8 17 22 14 or %i4, 0x214, %i4
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
200b5e0: b8 07 20 04 add %i4, 4, %i4
200b5e4: 80 a7 40 1c cmp %i5, %i4
200b5e8: 02 80 00 0a be 200b610 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN
200b5ec: 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 );
200b5f0: c2 07 60 08 ld [ %i5 + 8 ], %g1
200b5f4: 90 10 00 18 mov %i0, %o0
200b5f8: 9f c0 40 00 call %g1
200b5fc: 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 ) {
200b600: 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 );
200b604: 80 a7 40 1c cmp %i5, %i4
200b608: 32 bf ff fb bne,a 200b5f4 <_User_extensions_Thread_switch+0x24>
200b60c: c2 07 60 08 ld [ %i5 + 8 ], %g1
200b610: 81 c7 e0 08 ret
200b614: 81 e8 00 00 restore
0200d01c <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200d01c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200d020: 7f ff d9 1f call 200349c <sparc_disable_interrupts>
200d024: 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;
200d028: 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 );
200d02c: b8 06 20 04 add %i0, 4, %i4
* hence the compiler must not assume *header to remain
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
200d030: 80 a0 40 1c cmp %g1, %i4
200d034: 02 80 00 1f be 200d0b0 <_Watchdog_Adjust+0x94>
200d038: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200d03c: 12 80 00 1f bne 200d0b8 <_Watchdog_Adjust+0x9c>
200d040: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200d044: 80 a6 a0 00 cmp %i2, 0
200d048: 02 80 00 1a be 200d0b0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200d04c: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200d050: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200d054: 80 a6 80 02 cmp %i2, %g2
200d058: 1a 80 00 0a bcc 200d080 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
200d05c: b6 10 20 01 mov 1, %i3
_Watchdog_First( header )->delta_interval -= units;
200d060: 10 80 00 1d b 200d0d4 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED
200d064: 84 20 80 1a sub %g2, %i2, %g2 <== NOT EXECUTED
switch ( direction ) {
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200d068: 02 80 00 12 be 200d0b0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200d06c: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200d070: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200d074: 80 a0 80 1a cmp %g2, %i2
200d078: 38 80 00 17 bgu,a 200d0d4 <_Watchdog_Adjust+0xb8>
200d07c: 84 20 80 1a sub %g2, %i2, %g2
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
_Watchdog_First( header )->delta_interval = 1;
200d080: f6 20 60 10 st %i3, [ %g1 + 0x10 ]
while ( units ) {
if ( units < _Watchdog_First( header )->delta_interval ) {
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
200d084: b4 26 80 02 sub %i2, %g2, %i2
_Watchdog_First( header )->delta_interval = 1;
_ISR_Enable( level );
200d088: 7f ff d9 09 call 20034ac <sparc_enable_interrupts>
200d08c: 01 00 00 00 nop
_Watchdog_Tickle( header );
200d090: 40 00 00 a8 call 200d330 <_Watchdog_Tickle>
200d094: 90 10 00 18 mov %i0, %o0
_ISR_Disable( level );
200d098: 7f ff d9 01 call 200349c <sparc_disable_interrupts>
200d09c: 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;
200d0a0: c2 06 00 00 ld [ %i0 ], %g1
if ( _Chain_Is_empty( header ) )
200d0a4: 80 a7 00 01 cmp %i4, %g1
200d0a8: 12 bf ff f0 bne 200d068 <_Watchdog_Adjust+0x4c>
200d0ac: 80 a6 a0 00 cmp %i2, 0
}
break;
}
}
_ISR_Enable( level );
200d0b0: 7f ff d8 ff call 20034ac <sparc_enable_interrupts>
200d0b4: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
200d0b8: 12 bf ff fe bne 200d0b0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200d0bc: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200d0c0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200d0c4: b4 00 80 1a add %g2, %i2, %i2
200d0c8: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
200d0cc: 7f ff d8 f8 call 20034ac <sparc_enable_interrupts>
200d0d0: 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;
200d0d4: 10 bf ff f7 b 200d0b0 <_Watchdog_Adjust+0x94>
200d0d8: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
0200b794 <_Watchdog_Remove>:
*/
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
200b794: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
200b798: 7f ff db f3 call 2002764 <sparc_disable_interrupts>
200b79c: 01 00 00 00 nop
previous_state = the_watchdog->state;
200b7a0: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
200b7a4: 80 a7 60 01 cmp %i5, 1
200b7a8: 02 80 00 2a be 200b850 <_Watchdog_Remove+0xbc>
200b7ac: 03 00 80 74 sethi %hi(0x201d000), %g1
200b7b0: 1a 80 00 09 bcc 200b7d4 <_Watchdog_Remove+0x40>
200b7b4: 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;
200b7b8: 03 00 80 74 sethi %hi(0x201d000), %g1
200b7bc: c2 00 63 08 ld [ %g1 + 0x308 ], %g1 ! 201d308 <_Watchdog_Ticks_since_boot>
200b7c0: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b7c4: 7f ff db ec call 2002774 <sparc_enable_interrupts>
200b7c8: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b7cc: 81 c7 e0 08 ret
200b7d0: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
200b7d4: 18 bf ff fa bgu 200b7bc <_Watchdog_Remove+0x28> <== NEVER TAKEN
200b7d8: 03 00 80 74 sethi %hi(0x201d000), %g1
RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next(
Watchdog_Control *the_watchdog
)
{
return ( (Watchdog_Control *) the_watchdog->Node.next );
200b7dc: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
200b7e0: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
200b7e4: c4 00 40 00 ld [ %g1 ], %g2
200b7e8: 80 a0 a0 00 cmp %g2, 0
200b7ec: 02 80 00 07 be 200b808 <_Watchdog_Remove+0x74>
200b7f0: 05 00 80 74 sethi %hi(0x201d000), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
200b7f4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200b7f8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
200b7fc: 84 00 c0 02 add %g3, %g2, %g2
200b800: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
200b804: 05 00 80 74 sethi %hi(0x201d000), %g2
200b808: c4 00 a3 04 ld [ %g2 + 0x304 ], %g2 ! 201d304 <_Watchdog_Sync_count>
200b80c: 80 a0 a0 00 cmp %g2, 0
200b810: 22 80 00 07 be,a 200b82c <_Watchdog_Remove+0x98>
200b814: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
200b818: 05 00 80 75 sethi %hi(0x201d400), %g2
200b81c: c6 00 a0 38 ld [ %g2 + 0x38 ], %g3 ! 201d438 <_Per_CPU_Information+0x8>
200b820: 05 00 80 74 sethi %hi(0x201d000), %g2
200b824: c6 20 a2 a4 st %g3, [ %g2 + 0x2a4 ] ! 201d2a4 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
200b828: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
200b82c: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
200b830: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
200b834: 03 00 80 74 sethi %hi(0x201d000), %g1
200b838: c2 00 63 08 ld [ %g1 + 0x308 ], %g1 ! 201d308 <_Watchdog_Ticks_since_boot>
200b83c: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b840: 7f ff db cd call 2002774 <sparc_enable_interrupts>
200b844: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b848: 81 c7 e0 08 ret
200b84c: 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;
200b850: c2 00 63 08 ld [ %g1 + 0x308 ], %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;
200b854: 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;
200b858: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b85c: 7f ff db c6 call 2002774 <sparc_enable_interrupts>
200b860: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b864: 81 c7 e0 08 ret
200b868: 81 e8 00 00 restore
0200ca38 <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200ca38: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200ca3c: 7f ff d9 96 call 2003094 <sparc_disable_interrupts>
200ca40: 01 00 00 00 nop
200ca44: b6 10 00 08 mov %o0, %i3
printk( "Watchdog Chain: %s %p\n", name, header );
200ca48: 11 00 80 74 sethi %hi(0x201d000), %o0
200ca4c: 94 10 00 19 mov %i1, %o2
200ca50: 92 10 00 18 mov %i0, %o1
200ca54: 7f ff e1 a2 call 20050dc <printk>
200ca58: 90 12 22 00 or %o0, 0x200, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200ca5c: fa 06 40 00 ld [ %i1 ], %i5
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200ca60: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200ca64: 80 a7 40 19 cmp %i5, %i1
200ca68: 02 80 00 0f be 200caa4 <_Watchdog_Report_chain+0x6c>
200ca6c: 11 00 80 74 sethi %hi(0x201d000), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200ca70: 92 10 00 1d mov %i5, %o1
200ca74: 40 00 00 0f call 200cab0 <_Watchdog_Report>
200ca78: 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 )
200ca7c: fa 07 40 00 ld [ %i5 ], %i5
Chain_Node *node;
_ISR_Disable( level );
printk( "Watchdog Chain: %s %p\n", name, header );
if ( !_Chain_Is_empty( header ) ) {
for ( node = _Chain_First( header ) ;
200ca80: 80 a7 40 19 cmp %i5, %i1
200ca84: 12 bf ff fc bne 200ca74 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
200ca88: 92 10 00 1d mov %i5, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200ca8c: 11 00 80 74 sethi %hi(0x201d000), %o0
200ca90: 92 10 00 18 mov %i0, %o1
200ca94: 7f ff e1 92 call 20050dc <printk>
200ca98: 90 12 22 18 or %o0, 0x218, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
200ca9c: 7f ff d9 82 call 20030a4 <sparc_enable_interrupts>
200caa0: 91 e8 00 1b restore %g0, %i3, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200caa4: 7f ff e1 8e call 20050dc <printk>
200caa8: 90 12 22 28 or %o0, 0x228, %o0
200caac: 30 bf ff fc b,a 200ca9c <_Watchdog_Report_chain+0x64>
0200b7b8 <_Workspace_String_duplicate>:
char *_Workspace_String_duplicate(
const char *string,
size_t len
)
{
200b7b8: 9d e3 bf a0 save %sp, -96, %sp
char *dup = _Workspace_Allocate(len + 1);
200b7bc: 7f ff ff e2 call 200b744 <_Workspace_Allocate>
200b7c0: 90 06 60 01 add %i1, 1, %o0
if (dup != NULL) {
200b7c4: ba 92 20 00 orcc %o0, 0, %i5
200b7c8: 02 80 00 05 be 200b7dc <_Workspace_String_duplicate+0x24> <== NEVER TAKEN
200b7cc: 92 10 00 18 mov %i0, %o1
dup [len] = '\0';
200b7d0: c0 2f 40 19 clrb [ %i5 + %i1 ]
memcpy(dup, string, len);
200b7d4: 40 00 12 ac call 2010284 <memcpy>
200b7d8: 94 10 00 19 mov %i1, %o2
}
return dup;
}
200b7dc: 81 c7 e0 08 ret
200b7e0: 91 e8 00 1d restore %g0, %i5, %o0
02008da8 <check_and_merge>:
rtems_rbtree_control *chunk_tree,
rtems_rbheap_chunk *a,
rtems_rbheap_chunk *b
)
{
if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) {
2008da8: 80 a2 ff f8 cmp %o3, -8
2008dac: 02 80 00 23 be 2008e38 <check_and_merge+0x90>
2008db0: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain(
const Chain_Node *node
)
{
return (node->next == NULL) && (node->previous == NULL);
2008db4: c2 02 c0 00 ld [ %o3 ], %g1
2008db8: 80 a0 60 00 cmp %g1, 0
2008dbc: 22 80 00 1c be,a 2008e2c <check_and_merge+0x84>
2008dc0: c4 02 e0 04 ld [ %o3 + 4 ], %g2
if (b->begin < a->begin) {
2008dc4: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3
2008dc8: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2
2008dcc: 80 a0 c0 02 cmp %g3, %g2
2008dd0: 3a 80 00 07 bcc,a 2008dec <check_and_merge+0x44>
2008dd4: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
2008dd8: 84 10 00 0a mov %o2, %g2
2008ddc: c2 02 80 00 ld [ %o2 ], %g1
2008de0: 94 10 00 0b mov %o3, %o2
2008de4: 96 10 00 02 mov %g2, %o3
a = b;
b = t;
}
a->size += b->size;
2008de8: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
2008dec: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
2008df0: c4 02 e0 04 ld [ %o3 + 4 ], %g2
2008df4: 86 01 00 03 add %g4, %g3, %g3
2008df8: c6 22 a0 1c st %g3, [ %o2 + 0x1c ]
next->previous = previous;
previous->next = next;
2008dfc: c2 20 80 00 st %g1, [ %g2 ]
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
next->previous = previous;
2008e00: c4 20 60 04 st %g2, [ %g1 + 4 ]
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2008e04: c2 02 00 00 ld [ %o0 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2008e08: d0 22 e0 04 st %o0, [ %o3 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
2008e0c: d6 22 00 00 st %o3, [ %o0 ]
the_node->next = before_node;
2008e10: c2 22 c0 00 st %g1, [ %o3 ]
rtems_chain_extract_unprotected(&b->chain_node);
add_to_chain(free_chain, b);
_RBTree_Extract_unprotected(chunk_tree, &b->tree_node);
2008e14: 90 10 00 09 mov %o1, %o0
before_node->previous = the_node;
2008e18: d6 20 60 04 st %o3, [ %g1 + 4 ]
2008e1c: 92 02 e0 08 add %o3, 8, %o1
2008e20: 82 13 c0 00 mov %o7, %g1
2008e24: 40 00 07 1c call 200aa94 <_RBTree_Extract_unprotected>
2008e28: 9e 10 40 00 mov %g1, %o7
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain(
const Chain_Node *node
)
{
return (node->next == NULL) && (node->previous == NULL);
2008e2c: 80 a0 a0 00 cmp %g2, 0
2008e30: 32 bf ff e6 bne,a 2008dc8 <check_and_merge+0x20> <== NEVER TAKEN
2008e34: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED
2008e38: 81 c3 e0 08 retl
020089c8 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
20089c8: 9d e3 bf 98 save %sp, -104, %sp
*/
RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get(
rtems_chain_control *the_chain
)
{
return _Chain_Get( the_chain );
20089cc: 40 00 01 8e call 2009004 <_Chain_Get>
20089d0: 90 10 00 18 mov %i0, %o0
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
) {
rtems_event_set out;
sc = rtems_event_receive(
20089d4: 92 10 20 00 clr %o1
20089d8: ba 10 00 08 mov %o0, %i5
20089dc: 94 10 00 1a mov %i2, %o2
20089e0: 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
20089e4: 80 a7 60 00 cmp %i5, 0
20089e8: 12 80 00 0a bne 2008a10 <rtems_chain_get_with_wait+0x48>
20089ec: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
20089f0: 7f ff fc e9 call 2007d94 <rtems_event_receive>
20089f4: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
20089f8: 80 a2 20 00 cmp %o0, 0
20089fc: 02 bf ff f4 be 20089cc <rtems_chain_get_with_wait+0x4> <== NEVER TAKEN
2008a00: 01 00 00 00 nop
timeout,
&out
);
}
*node_ptr = node;
2008a04: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
2008a08: 81 c7 e0 08 ret
2008a0c: 91 e8 00 08 restore %g0, %o0, %o0
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
2008a10: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
2008a14: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
2008a18: 81 c7 e0 08 ret
2008a1c: 91 e8 00 08 restore %g0, %o0, %o0
02009948 <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
)
{
2009948: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
200994c: 03 00 80 86 sethi %hi(0x2021800), %g1
2009950: c4 00 61 c8 ld [ %g1 + 0x1c8 ], %g2 ! 20219c8 <_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
)
{
2009954: ba 10 00 18 mov %i0, %i5
rtems_device_major_number major_limit = _IO_Number_of_drivers;
2009958: 03 00 80 86 sethi %hi(0x2021800), %g1
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
)
{
200995c: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
2009960: c8 00 62 64 ld [ %g1 + 0x264 ], %g4
if ( rtems_interrupt_is_in_progress() )
2009964: 80 a0 a0 00 cmp %g2, 0
2009968: 12 80 00 20 bne 20099e8 <rtems_io_register_driver+0xa0>
200996c: b0 10 20 12 mov 0x12, %i0
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
2009970: 80 a6 a0 00 cmp %i2, 0
2009974: 02 80 00 22 be 20099fc <rtems_io_register_driver+0xb4>
2009978: 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 )
200997c: 02 80 00 20 be 20099fc <rtems_io_register_driver+0xb4>
2009980: c8 26 80 00 st %g4, [ %i2 ]
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2009984: c4 06 40 00 ld [ %i1 ], %g2
2009988: 80 a0 a0 00 cmp %g2, 0
200998c: 22 80 00 19 be,a 20099f0 <rtems_io_register_driver+0xa8>
2009990: 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 )
2009994: 80 a1 00 1d cmp %g4, %i5
2009998: 08 80 00 14 bleu 20099e8 <rtems_io_register_driver+0xa0>
200999c: b0 10 20 0a mov 0xa, %i0
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20099a0: 05 00 80 85 sethi %hi(0x2021400), %g2
20099a4: c8 00 a3 a0 ld [ %g2 + 0x3a0 ], %g4 ! 20217a0 <_Thread_Dispatch_disable_level>
20099a8: 88 01 20 01 inc %g4
20099ac: c8 20 a3 a0 st %g4, [ %g2 + 0x3a0 ]
return _Thread_Dispatch_disable_level;
20099b0: c4 00 a3 a0 ld [ %g2 + 0x3a0 ], %g2
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
20099b4: 80 a7 60 00 cmp %i5, 0
20099b8: 02 80 00 13 be 2009a04 <rtems_io_register_driver+0xbc>
20099bc: 39 00 80 86 sethi %hi(0x2021800), %i4
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
20099c0: c8 07 22 68 ld [ %i4 + 0x268 ], %g4 ! 2021a68 <_IO_Driver_address_table>
20099c4: 85 2f 60 03 sll %i5, 3, %g2
20099c8: b7 2f 60 05 sll %i5, 5, %i3
20099cc: 82 26 c0 02 sub %i3, %g2, %g1
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
20099d0: f2 01 00 01 ld [ %g4 + %g1 ], %i1
20099d4: 80 a6 60 00 cmp %i1, 0
20099d8: 02 80 00 3a be 2009ac0 <rtems_io_register_driver+0x178>
20099dc: 82 01 00 01 add %g4, %g1, %g1
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
20099e0: 40 00 08 45 call 200baf4 <_Thread_Enable_dispatch>
20099e4: b0 10 20 0c mov 0xc, %i0
return RTEMS_RESOURCE_IN_USE;
20099e8: 81 c7 e0 08 ret
20099ec: 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;
20099f0: 80 a0 a0 00 cmp %g2, 0
20099f4: 12 bf ff e9 bne 2009998 <rtems_io_register_driver+0x50>
20099f8: 80 a1 00 1d cmp %g4, %i5
if ( driver_table == NULL )
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
20099fc: 81 c7 e0 08 ret
2009a00: 91 e8 20 09 restore %g0, 9, %o0
static rtems_status_code rtems_io_obtain_major_number(
rtems_device_major_number *major
)
{
rtems_device_major_number n = _IO_Number_of_drivers;
2009a04: c8 00 62 64 ld [ %g1 + 0x264 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2009a08: 80 a1 20 00 cmp %g4, 0
2009a0c: 02 80 00 33 be 2009ad8 <rtems_io_register_driver+0x190> <== NEVER TAKEN
2009a10: c2 07 22 68 ld [ %i4 + 0x268 ], %g1
2009a14: 30 80 00 04 b,a 2009a24 <rtems_io_register_driver+0xdc>
2009a18: 80 a7 40 04 cmp %i5, %g4
2009a1c: 02 80 00 24 be 2009aac <rtems_io_register_driver+0x164>
2009a20: 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;
2009a24: c4 00 40 00 ld [ %g1 ], %g2
2009a28: 80 a0 a0 00 cmp %g2, 0
2009a2c: 32 bf ff fb bne,a 2009a18 <rtems_io_register_driver+0xd0>
2009a30: ba 07 60 01 inc %i5
2009a34: c4 00 60 04 ld [ %g1 + 4 ], %g2
2009a38: 80 a0 a0 00 cmp %g2, 0
2009a3c: 32 bf ff f7 bne,a 2009a18 <rtems_io_register_driver+0xd0>
2009a40: ba 07 60 01 inc %i5
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2009a44: fa 26 80 00 st %i5, [ %i2 ]
2009a48: 85 2f 60 03 sll %i5, 3, %g2
if ( m != n )
2009a4c: 80 a1 00 1d cmp %g4, %i5
2009a50: 02 80 00 18 be 2009ab0 <rtems_io_register_driver+0x168> <== NEVER TAKEN
2009a54: b7 2f 60 05 sll %i5, 5, %i3
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2009a58: c8 00 c0 00 ld [ %g3 ], %g4
2009a5c: c2 07 22 68 ld [ %i4 + 0x268 ], %g1
2009a60: 84 26 c0 02 sub %i3, %g2, %g2
2009a64: c8 20 40 02 st %g4, [ %g1 + %g2 ]
2009a68: c8 00 e0 04 ld [ %g3 + 4 ], %g4
2009a6c: 82 00 40 02 add %g1, %g2, %g1
2009a70: c8 20 60 04 st %g4, [ %g1 + 4 ]
2009a74: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2009a78: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2009a7c: c4 20 60 08 st %g2, [ %g1 + 8 ]
2009a80: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2009a84: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2009a88: c4 20 60 0c st %g2, [ %g1 + 0xc ]
2009a8c: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2009a90: b0 10 00 1d mov %i5, %i0
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2009a94: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
2009a98: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
2009a9c: 40 00 08 16 call 200baf4 <_Thread_Enable_dispatch>
2009aa0: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
2009aa4: 40 00 20 37 call 2011b80 <rtems_io_initialize>
2009aa8: 81 e8 00 00 restore
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2009aac: fa 26 80 00 st %i5, [ %i2 ]
if ( major == 0 ) {
rtems_status_code sc = rtems_io_obtain_major_number( registered_major );
if ( sc != RTEMS_SUCCESSFUL ) {
_Thread_Enable_dispatch();
2009ab0: 40 00 08 11 call 200baf4 <_Thread_Enable_dispatch>
2009ab4: b0 10 20 05 mov 5, %i0
return sc;
2009ab8: 81 c7 e0 08 ret
2009abc: 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;
2009ac0: c2 00 60 04 ld [ %g1 + 4 ], %g1
2009ac4: 80 a0 60 00 cmp %g1, 0
2009ac8: 12 bf ff c6 bne 20099e0 <rtems_io_register_driver+0x98>
2009acc: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
2009ad0: 10 bf ff e2 b 2009a58 <rtems_io_register_driver+0x110>
2009ad4: fa 26 80 00 st %i5, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2009ad8: 10 bf ff f6 b 2009ab0 <rtems_io_register_driver+0x168> <== NOT EXECUTED
2009adc: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
0200aaf0 <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)
{
200aaf0: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
200aaf4: 80 a6 20 00 cmp %i0, 0
200aaf8: 02 80 00 23 be 200ab84 <rtems_iterate_over_all_threads+0x94><== NEVER TAKEN
200aafc: 37 00 80 7e sethi %hi(0x201f800), %i3
200ab00: b6 16 e3 d8 or %i3, 0x3d8, %i3 ! 201fbd8 <_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)
200ab04: 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 ] )
200ab08: c2 06 c0 00 ld [ %i3 ], %g1
200ab0c: 80 a0 60 00 cmp %g1, 0
200ab10: 22 80 00 1a be,a 200ab78 <rtems_iterate_over_all_threads+0x88>
200ab14: b6 06 e0 04 add %i3, 4, %i3
continue;
#endif
information = _Objects_Information_table[ api_index ][ 1 ];
200ab18: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
200ab1c: 80 a7 20 00 cmp %i4, 0
200ab20: 22 80 00 16 be,a 200ab78 <rtems_iterate_over_all_threads+0x88>
200ab24: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
200ab28: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
200ab2c: 86 90 60 00 orcc %g1, 0, %g3
200ab30: 22 80 00 12 be,a 200ab78 <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
200ab34: b6 06 e0 04 add %i3, 4, %i3 <== NOT EXECUTED
200ab38: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
200ab3c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
200ab40: 83 2f 60 02 sll %i5, 2, %g1
200ab44: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_thread )
200ab48: 90 90 60 00 orcc %g1, 0, %o0
200ab4c: 02 80 00 05 be 200ab60 <rtems_iterate_over_all_threads+0x70>
200ab50: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
200ab54: 9f c6 00 00 call %i0
200ab58: 01 00 00 00 nop
200ab5c: c6 17 20 10 lduh [ %i4 + 0x10 ], %g3
information = _Objects_Information_table[ api_index ][ 1 ];
if ( !information )
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
200ab60: 83 28 e0 10 sll %g3, 0x10, %g1
200ab64: 83 30 60 10 srl %g1, 0x10, %g1
200ab68: 80 a0 40 1d cmp %g1, %i5
200ab6c: 3a bf ff f5 bcc,a 200ab40 <rtems_iterate_over_all_threads+0x50>
200ab70: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
200ab74: 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++ ) {
200ab78: 80 a6 c0 1a cmp %i3, %i2
200ab7c: 32 bf ff e4 bne,a 200ab0c <rtems_iterate_over_all_threads+0x1c>
200ab80: c2 06 c0 00 ld [ %i3 ], %g1
200ab84: 81 c7 e0 08 ret
200ab88: 81 e8 00 00 restore
02009764 <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
)
{
2009764: 9d e3 bf a0 save %sp, -96, %sp
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
2009768: 80 a6 a0 00 cmp %i2, 0
200976c: 02 80 00 21 be 20097f0 <rtems_object_get_class_information+0x8c>
2009770: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
2009774: 93 2e 60 10 sll %i1, 0x10, %o1
2009778: 90 10 00 18 mov %i0, %o0
200977c: 40 00 07 8b call 200b5a8 <_Objects_Get_information>
2009780: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
2009784: 80 a2 20 00 cmp %o0, 0
2009788: 02 80 00 1a be 20097f0 <rtems_object_get_class_information+0x8c>
200978c: 82 10 20 0a mov 0xa, %g1
* Return information about this object class to the user.
*/
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;
2009790: 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;
2009794: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
2009798: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
200979c: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1
return RTEMS_INVALID_NUMBER;
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
20097a0: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
20097a4: c4 26 a0 04 st %g2, [ %i2 + 4 ]
info->auto_extend = obj_info->auto_extend;
20097a8: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
20097ac: 80 a1 20 00 cmp %g4, 0
20097b0: 02 80 00 12 be 20097f8 <rtems_object_get_class_information+0x94><== NEVER TAKEN
20097b4: c8 26 a0 08 st %g4, [ %i2 + 8 ]
20097b8: fa 02 20 1c ld [ %o0 + 0x1c ], %i5
20097bc: 86 10 20 01 mov 1, %g3
20097c0: 82 10 20 01 mov 1, %g1
20097c4: 84 10 20 00 clr %g2
if ( !obj_info->local_table[i] )
20097c8: 87 28 e0 02 sll %g3, 2, %g3
20097cc: c6 07 40 03 ld [ %i5 + %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++ )
20097d0: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
20097d4: 80 a0 00 03 cmp %g0, %g3
20097d8: 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++ )
20097dc: 80 a1 00 01 cmp %g4, %g1
20097e0: 1a bf ff fa bcc 20097c8 <rtems_object_get_class_information+0x64>
20097e4: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
20097e8: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
20097ec: 82 10 20 00 clr %g1
}
20097f0: 81 c7 e0 08 ret
20097f4: 91 e8 00 01 restore %g0, %g1, %o0
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++ )
20097f8: 84 10 20 00 clr %g2 <== NOT EXECUTED
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
return RTEMS_SUCCESSFUL;
20097fc: 82 10 20 00 clr %g1 <== NOT EXECUTED
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
2009800: 10 bf ff fc b 20097f0 <rtems_object_get_class_information+0x8c><== NOT EXECUTED
2009804: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] <== NOT EXECUTED
02015714 <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
2015714: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2015718: 80 a6 20 00 cmp %i0, 0
201571c: 12 80 00 04 bne 201572c <rtems_partition_create+0x18>
2015720: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2015724: 81 c7 e0 08 ret
2015728: 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 )
201572c: 80 a6 60 00 cmp %i1, 0
2015730: 02 bf ff fd be 2015724 <rtems_partition_create+0x10>
2015734: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2015738: 80 a7 60 00 cmp %i5, 0
201573c: 02 bf ff fa be 2015724 <rtems_partition_create+0x10> <== NEVER TAKEN
2015740: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2015744: 02 bf ff f8 be 2015724 <rtems_partition_create+0x10>
2015748: 82 10 20 08 mov 8, %g1
201574c: 80 a6 a0 00 cmp %i2, 0
2015750: 02 bf ff f5 be 2015724 <rtems_partition_create+0x10>
2015754: 80 a6 80 1b cmp %i2, %i3
2015758: 0a bf ff f3 bcs 2015724 <rtems_partition_create+0x10>
201575c: 80 8e e0 07 btst 7, %i3
2015760: 12 bf ff f1 bne 2015724 <rtems_partition_create+0x10>
2015764: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
2015768: 12 bf ff ef bne 2015724 <rtems_partition_create+0x10>
201576c: 82 10 20 09 mov 9, %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2015770: 03 00 80 ed sethi %hi(0x203b400), %g1
2015774: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 203b4f0 <_Thread_Dispatch_disable_level>
2015778: 84 00 a0 01 inc %g2
201577c: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ]
return _Thread_Dispatch_disable_level;
2015780: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1
* This function allocates a partition control block from
* the inactive chain of free partition control blocks.
*/
RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void )
{
return (Partition_Control *) _Objects_Allocate( &_Partition_Information );
2015784: 23 00 80 ec sethi %hi(0x203b000), %l1
2015788: 40 00 13 d6 call 201a6e0 <_Objects_Allocate>
201578c: 90 14 62 e4 or %l1, 0x2e4, %o0 ! 203b2e4 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2015790: a0 92 20 00 orcc %o0, 0, %l0
2015794: 02 80 00 1a be 20157fc <rtems_partition_create+0xe8>
2015798: 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;
201579c: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
20157a0: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
20157a4: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
20157a8: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
20157ac: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
20157b0: 40 00 56 c9 call 202b2d4 <.udiv>
20157b4: 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,
20157b8: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
20157bc: 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,
20157c0: 96 10 00 1b mov %i3, %o3
20157c4: b8 04 20 24 add %l0, 0x24, %i4
20157c8: 40 00 0d 6e call 2018d80 <_Chain_Initialize>
20157cc: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
20157d0: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20157d4: a2 14 62 e4 or %l1, 0x2e4, %l1
20157d8: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
20157dc: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20157e0: 85 28 a0 02 sll %g2, 2, %g2
20157e4: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
20157e8: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
20157ec: 40 00 19 21 call 201bc70 <_Thread_Enable_dispatch>
20157f0: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
20157f4: 10 bf ff cc b 2015724 <rtems_partition_create+0x10>
20157f8: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
20157fc: 40 00 19 1d call 201bc70 <_Thread_Enable_dispatch>
2015800: 01 00 00 00 nop
return RTEMS_TOO_MANY;
2015804: 10 bf ff c8 b 2015724 <rtems_partition_create+0x10>
2015808: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
0201593c <rtems_partition_return_buffer>:
rtems_status_code rtems_partition_return_buffer(
rtems_id id,
void *buffer
)
{
201593c: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Partition_Control *)
2015940: 11 00 80 ec sethi %hi(0x203b000), %o0
2015944: 92 10 00 18 mov %i0, %o1
2015948: 90 12 22 e4 or %o0, 0x2e4, %o0
201594c: 40 00 14 ca call 201ac74 <_Objects_Get>
2015950: 94 07 bf fc add %fp, -4, %o2
register Partition_Control *the_partition;
Objects_Locations location;
the_partition = _Partition_Get( id, &location );
switch ( location ) {
2015954: c2 07 bf fc ld [ %fp + -4 ], %g1
2015958: 80 a0 60 00 cmp %g1, 0
201595c: 12 80 00 19 bne 20159c0 <rtems_partition_return_buffer+0x84>
2015960: ba 10 00 08 mov %o0, %i5
)
{
void *starting;
void *ending;
starting = the_partition->starting_address;
2015964: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
2015968: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
201596c: 82 02 00 01 add %o0, %g1, %g1
ending = _Addresses_Add_offset( starting, the_partition->length );
return (
_Addresses_Is_in_range( the_buffer, starting, ending ) &&
2015970: 80 a6 40 01 cmp %i1, %g1
2015974: 18 80 00 15 bgu 20159c8 <rtems_partition_return_buffer+0x8c><== NEVER TAKEN
2015978: 80 a6 40 08 cmp %i1, %o0
201597c: 0a 80 00 13 bcs 20159c8 <rtems_partition_return_buffer+0x8c>
2015980: 01 00 00 00 nop
offset = (uint32_t) _Addresses_Subtract(
the_buffer,
the_partition->starting_address
);
return ((offset % the_partition->buffer_size) == 0);
2015984: d2 07 60 18 ld [ %i5 + 0x18 ], %o1
2015988: 40 00 56 ff call 202b584 <.urem>
201598c: 90 26 40 08 sub %i1, %o0, %o0
starting = the_partition->starting_address;
ending = _Addresses_Add_offset( starting, the_partition->length );
return (
_Addresses_Is_in_range( the_buffer, starting, ending ) &&
2015990: 80 a2 20 00 cmp %o0, 0
2015994: 12 80 00 0d bne 20159c8 <rtems_partition_return_buffer+0x8c>
2015998: 90 07 60 24 add %i5, 0x24, %o0
RTEMS_INLINE_ROUTINE void _Partition_Free_buffer (
Partition_Control *the_partition,
Chain_Node *the_buffer
)
{
_Chain_Append( &the_partition->Memory, the_buffer );
201599c: 40 00 0c de call 2018d14 <_Chain_Append>
20159a0: 92 10 00 19 mov %i1, %o1
case OBJECTS_LOCAL:
if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) {
_Partition_Free_buffer( the_partition, buffer );
the_partition->number_of_used_blocks -= 1;
20159a4: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
20159a8: b0 10 20 00 clr %i0
switch ( location ) {
case OBJECTS_LOCAL:
if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) {
_Partition_Free_buffer( the_partition, buffer );
the_partition->number_of_used_blocks -= 1;
20159ac: 82 00 7f ff add %g1, -1, %g1
_Thread_Enable_dispatch();
20159b0: 40 00 18 b0 call 201bc70 <_Thread_Enable_dispatch>
20159b4: c2 27 60 20 st %g1, [ %i5 + 0x20 ]
20159b8: 81 c7 e0 08 ret
20159bc: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
20159c0: 81 c7 e0 08 ret
20159c4: 91 e8 20 04 restore %g0, 4, %o0
_Partition_Free_buffer( the_partition, buffer );
the_partition->number_of_used_blocks -= 1;
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
_Thread_Enable_dispatch();
20159c8: 40 00 18 aa call 201bc70 <_Thread_Enable_dispatch>
20159cc: b0 10 20 09 mov 9, %i0
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20159d0: 81 c7 e0 08 ret
20159d4: 81 e8 00 00 restore
020447a4 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
20447a4: 9d e3 bf 98 save %sp, -104, %sp
20447a8: 11 00 81 d2 sethi %hi(0x2074800), %o0
20447ac: 92 10 00 18 mov %i0, %o1
20447b0: 90 12 22 d0 or %o0, 0x2d0, %o0
20447b4: 7f ff 2d d6 call 200ff0c <_Objects_Get>
20447b8: 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 ) {
20447bc: c2 07 bf fc ld [ %fp + -4 ], %g1
20447c0: 80 a0 60 00 cmp %g1, 0
20447c4: 12 80 00 0d bne 20447f8 <rtems_rate_monotonic_period+0x54>
20447c8: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
20447cc: c4 02 20 40 ld [ %o0 + 0x40 ], %g2
20447d0: 39 00 81 d2 sethi %hi(0x2074800), %i4
20447d4: b8 17 20 00 mov %i4, %i4 ! 2074800 <_Per_CPU_Information>
20447d8: c2 07 20 0c ld [ %i4 + 0xc ], %g1
20447dc: 80 a0 80 01 cmp %g2, %g1
20447e0: 02 80 00 08 be 2044800 <rtems_rate_monotonic_period+0x5c>
20447e4: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
20447e8: 7f ff 31 a8 call 2010e88 <_Thread_Enable_dispatch>
20447ec: b0 10 20 17 mov 0x17, %i0
20447f0: 81 c7 e0 08 ret
20447f4: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20447f8: 81 c7 e0 08 ret
20447fc: 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 ) {
2044800: 12 80 00 0e bne 2044838 <rtems_rate_monotonic_period+0x94>
2044804: 01 00 00 00 nop
switch ( the_period->state ) {
2044808: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
204480c: 80 a0 60 04 cmp %g1, 4
2044810: 18 80 00 06 bgu 2044828 <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
2044814: b0 10 20 00 clr %i0
2044818: 83 28 60 02 sll %g1, 2, %g1
204481c: 05 00 81 b9 sethi %hi(0x206e400), %g2
2044820: 84 10 a1 7c or %g2, 0x17c, %g2 ! 206e57c <CSWTCH.23>
2044824: f0 00 80 01 ld [ %g2 + %g1 ], %i0
id,
NULL
);
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2044828: 7f ff 31 98 call 2010e88 <_Thread_Enable_dispatch>
204482c: 01 00 00 00 nop
2044830: 81 c7 e0 08 ret
2044834: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
2044838: 7f fe fe 78 call 2004218 <sparc_disable_interrupts>
204483c: 01 00 00 00 nop
2044840: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
2044844: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
2044848: 80 a6 e0 00 cmp %i3, 0
204484c: 02 80 00 1c be 20448bc <rtems_rate_monotonic_period+0x118>
2044850: 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 ) {
2044854: 02 80 00 2e be 204490c <rtems_rate_monotonic_period+0x168>
2044858: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
204485c: 12 bf ff e5 bne 20447f0 <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
2044860: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
2044864: 7f ff ff 60 call 20445e4 <_Rate_monotonic_Update_statistics>
2044868: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
204486c: 7f fe fe 6f call 2004228 <sparc_enable_interrupts>
2044870: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2044874: 82 10 20 02 mov 2, %g1
2044878: 92 07 60 10 add %i5, 0x10, %o1
204487c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
2044880: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2044884: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2044888: 11 00 81 d1 sethi %hi(0x2074400), %o0
204488c: 7f ff 34 f4 call 2011c5c <_Watchdog_Insert>
2044890: 90 12 22 88 or %o0, 0x288, %o0 ! 2074688 <_Watchdog_Ticks_chain>
2044894: d0 07 60 40 ld [ %i5 + 0x40 ], %o0
2044898: d2 07 60 3c ld [ %i5 + 0x3c ], %o1
204489c: 03 00 81 c0 sethi %hi(0x2070000), %g1
20448a0: c2 00 63 1c ld [ %g1 + 0x31c ], %g1 ! 207031c <_Scheduler+0x34>
20448a4: 9f c0 40 00 call %g1
20448a8: b0 10 20 06 mov 6, %i0
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Scheduler_Release_job(the_period->owner, the_period->next_length);
_Thread_Enable_dispatch();
20448ac: 7f ff 31 77 call 2010e88 <_Thread_Enable_dispatch>
20448b0: 01 00 00 00 nop
20448b4: 81 c7 e0 08 ret
20448b8: 81 e8 00 00 restore
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
20448bc: 7f fe fe 5b call 2004228 <sparc_enable_interrupts>
20448c0: 01 00 00 00 nop
the_period->next_length = length;
/*
* Baseline statistics information for the beginning of a period.
*/
_Rate_monotonic_Initiate_statistics( the_period );
20448c4: 90 10 00 1d mov %i5, %o0
20448c8: 7f ff ff 96 call 2044720 <_Rate_monotonic_Initiate_statistics>
20448cc: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
the_period->state = RATE_MONOTONIC_ACTIVE;
20448d0: 82 10 20 02 mov 2, %g1
20448d4: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20448d8: 03 00 81 12 sethi %hi(0x2044800), %g1
20448dc: 82 10 61 80 or %g1, 0x180, %g1 ! 2044980 <_Rate_monotonic_Timeout>
the_watchdog->id = id;
20448e0: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20448e4: 92 07 60 10 add %i5, 0x10, %o1
20448e8: 11 00 81 d1 sethi %hi(0x2074400), %o0
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20448ec: c0 27 60 18 clr [ %i5 + 0x18 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20448f0: 90 12 22 88 or %o0, 0x288, %o0
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
20448f4: c0 27 60 34 clr [ %i5 + 0x34 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20448f8: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
20448fc: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2044900: 7f ff 34 d7 call 2011c5c <_Watchdog_Insert>
2044904: b0 10 20 00 clr %i0
2044908: 30 bf ff c8 b,a 2044828 <rtems_rate_monotonic_period+0x84>
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
204490c: 7f ff ff 36 call 20445e4 <_Rate_monotonic_Update_statistics>
2044910: 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;
2044914: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
2044918: 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;
204491c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
2044920: 7f fe fe 42 call 2004228 <sparc_enable_interrupts>
2044924: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
2044928: c2 07 20 0c ld [ %i4 + 0xc ], %g1
204492c: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
2044930: 90 10 00 01 mov %g1, %o0
2044934: 13 00 00 10 sethi %hi(0x4000), %o1
2044938: 7f ff 33 aa call 20117e0 <_Thread_Set_state>
204493c: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
2044940: 7f fe fe 36 call 2004218 <sparc_disable_interrupts>
2044944: 01 00 00 00 nop
local_state = the_period->state;
2044948: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
204494c: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
2044950: 7f fe fe 36 call 2004228 <sparc_enable_interrupts>
2044954: 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 )
2044958: 80 a6 a0 03 cmp %i2, 3
204495c: 22 80 00 06 be,a 2044974 <rtems_rate_monotonic_period+0x1d0>
2044960: d0 07 20 0c ld [ %i4 + 0xc ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
2044964: 7f ff 31 49 call 2010e88 <_Thread_Enable_dispatch>
2044968: b0 10 20 00 clr %i0
204496c: 81 c7 e0 08 ret
2044970: 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 );
2044974: 7f ff 30 52 call 2010abc <_Thread_Clear_state>
2044978: 13 00 00 10 sethi %hi(0x4000), %o1
204497c: 30 bf ff fa b,a 2044964 <rtems_rate_monotonic_period+0x1c0>
0202ddb8 <rtems_rate_monotonic_report_statistics_with_plugin>:
*/
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
202ddb8: 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 )
202ddbc: 80 a6 60 00 cmp %i1, 0
202ddc0: 02 80 00 48 be 202dee0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
202ddc4: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
202ddc8: 13 00 81 a5 sethi %hi(0x2069400), %o1
202ddcc: 9f c6 40 00 call %i1
202ddd0: 92 12 62 88 or %o1, 0x288, %o1 ! 2069688 <_TOD_Days_per_month+0x68>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
202ddd4: 90 10 00 18 mov %i0, %o0
202ddd8: 13 00 81 a5 sethi %hi(0x2069400), %o1
202dddc: 9f c6 40 00 call %i1
202dde0: 92 12 62 a8 or %o1, 0x2a8, %o1 ! 20696a8 <_TOD_Days_per_month+0x88>
(*print)( context, "--- Wall times are in seconds ---\n" );
202dde4: 90 10 00 18 mov %i0, %o0
202dde8: 13 00 81 a5 sethi %hi(0x2069400), %o1
202ddec: 9f c6 40 00 call %i1
202ddf0: 92 12 62 d0 or %o1, 0x2d0, %o1 ! 20696d0 <_TOD_Days_per_month+0xb0>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
202ddf4: 90 10 00 18 mov %i0, %o0
202ddf8: 13 00 81 a5 sethi %hi(0x2069400), %o1
202ddfc: 9f c6 40 00 call %i1
202de00: 92 12 62 f8 or %o1, 0x2f8, %o1 ! 20696f8 <_TOD_Days_per_month+0xd8>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
202de04: 90 10 00 18 mov %i0, %o0
202de08: 13 00 81 a5 sethi %hi(0x2069400), %o1
202de0c: 9f c6 40 00 call %i1
202de10: 92 12 63 48 or %o1, 0x348, %o1 ! 2069748 <_TOD_Days_per_month+0x128>
/*
* 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 ;
202de14: 39 00 81 d2 sethi %hi(0x2074800), %i4
202de18: b8 17 22 d0 or %i4, 0x2d0, %i4 ! 2074ad0 <_Rate_monotonic_Information>
202de1c: fa 07 20 08 ld [ %i4 + 8 ], %i5
202de20: c2 07 20 0c ld [ %i4 + 0xc ], %g1
202de24: 80 a7 40 01 cmp %i5, %g1
202de28: 18 80 00 2e bgu 202dee0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
202de2c: 35 00 81 a5 sethi %hi(0x2069400), %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,
202de30: 27 00 81 a5 sethi %hi(0x2069400), %l3
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,
202de34: 25 00 81 a5 sethi %hi(0x2069400), %l2
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
202de38: 37 00 81 ab sethi %hi(0x206ac00), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
202de3c: b4 16 a3 98 or %i2, 0x398, %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,
202de40: a6 14 e3 b0 or %l3, 0x3b0, %l3
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,
202de44: a4 14 a3 d0 or %l2, 0x3d0, %l2
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
202de48: 10 80 00 06 b 202de60 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
202de4c: b6 16 e0 70 or %i3, 0x70, %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++ ) {
202de50: 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 ;
202de54: 80 a0 40 1d cmp %g1, %i5
202de58: 0a 80 00 22 bcs 202dee0 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
202de5c: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
202de60: 90 10 00 1d mov %i5, %o0
202de64: 40 00 58 fe call 204425c <rtems_rate_monotonic_get_statistics>
202de68: 92 07 bf c8 add %fp, -56, %o1
if ( status != RTEMS_SUCCESSFUL )
202de6c: 80 a2 20 00 cmp %o0, 0
202de70: 32 bf ff f8 bne,a 202de50 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
202de74: 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 );
202de78: 92 07 bf b0 add %fp, -80, %o1
202de7c: 40 00 59 6a call 2044424 <rtems_rate_monotonic_get_status>
202de80: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
202de84: d0 07 bf b0 ld [ %fp + -80 ], %o0
202de88: 94 07 bf a0 add %fp, -96, %o2
202de8c: 7f ff 7f 85 call 200dca0 <rtems_object_get_name>
202de90: 92 10 20 05 mov 5, %o1
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
202de94: d8 1f bf c8 ldd [ %fp + -56 ], %o4
202de98: 92 10 00 1a mov %i2, %o1
202de9c: 94 10 00 1d mov %i5, %o2
202dea0: 90 10 00 18 mov %i0, %o0
202dea4: 9f c6 40 00 call %i1
202dea8: 96 07 bf a0 add %fp, -96, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
202deac: c2 07 bf c8 ld [ %fp + -56 ], %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 );
202deb0: 94 07 bf a8 add %fp, -88, %o2
202deb4: 90 07 bf e0 add %fp, -32, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
202deb8: 80 a0 60 00 cmp %g1, 0
202debc: 12 80 00 0b bne 202dee8 <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
202dec0: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
202dec4: 9f c6 40 00 call %i1
202dec8: 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 ;
202decc: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
202ded0: 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 ;
202ded4: 80 a0 40 1d cmp %g1, %i5
202ded8: 1a bf ff e3 bcc 202de64 <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
202dedc: 90 10 00 1d mov %i5, %o0
202dee0: 81 c7 e0 08 ret
202dee4: 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 );
202dee8: 40 00 05 60 call 202f468 <_Timespec_Divide_by_integer>
202deec: 92 10 00 01 mov %g1, %o1
(*print)( context,
202def0: d0 07 bf d4 ld [ %fp + -44 ], %o0
202def4: 40 00 cb a4 call 2060d84 <.div>
202def8: 92 10 23 e8 mov 0x3e8, %o1
202defc: aa 10 00 08 mov %o0, %l5
202df00: d0 07 bf dc ld [ %fp + -36 ], %o0
202df04: 40 00 cb a0 call 2060d84 <.div>
202df08: 92 10 23 e8 mov 0x3e8, %o1
202df0c: c2 07 bf a8 ld [ %fp + -88 ], %g1
202df10: a2 10 00 08 mov %o0, %l1
202df14: d0 07 bf ac ld [ %fp + -84 ], %o0
202df18: e0 07 bf d0 ld [ %fp + -48 ], %l0
202df1c: e8 07 bf d8 ld [ %fp + -40 ], %l4
202df20: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
202df24: 40 00 cb 98 call 2060d84 <.div>
202df28: 92 10 23 e8 mov 0x3e8, %o1
202df2c: 96 10 00 15 mov %l5, %o3
202df30: 98 10 00 14 mov %l4, %o4
202df34: 9a 10 00 11 mov %l1, %o5
202df38: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
202df3c: 92 10 00 13 mov %l3, %o1
202df40: 94 10 00 10 mov %l0, %o2
202df44: 9f c6 40 00 call %i1
202df48: 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);
202df4c: d2 07 bf c8 ld [ %fp + -56 ], %o1
202df50: 94 07 bf a8 add %fp, -88, %o2
202df54: 40 00 05 45 call 202f468 <_Timespec_Divide_by_integer>
202df58: 90 07 bf f8 add %fp, -8, %o0
(*print)( context,
202df5c: d0 07 bf ec ld [ %fp + -20 ], %o0
202df60: 40 00 cb 89 call 2060d84 <.div>
202df64: 92 10 23 e8 mov 0x3e8, %o1
202df68: a8 10 00 08 mov %o0, %l4
202df6c: d0 07 bf f4 ld [ %fp + -12 ], %o0
202df70: 40 00 cb 85 call 2060d84 <.div>
202df74: 92 10 23 e8 mov 0x3e8, %o1
202df78: c2 07 bf a8 ld [ %fp + -88 ], %g1
202df7c: a0 10 00 08 mov %o0, %l0
202df80: d0 07 bf ac ld [ %fp + -84 ], %o0
202df84: ea 07 bf e8 ld [ %fp + -24 ], %l5
202df88: e2 07 bf f0 ld [ %fp + -16 ], %l1
202df8c: 92 10 23 e8 mov 0x3e8, %o1
202df90: 40 00 cb 7d call 2060d84 <.div>
202df94: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
202df98: 92 10 00 12 mov %l2, %o1
202df9c: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
202dfa0: 94 10 00 15 mov %l5, %o2
202dfa4: 90 10 00 18 mov %i0, %o0
202dfa8: 96 10 00 14 mov %l4, %o3
202dfac: 98 10 00 11 mov %l1, %o4
202dfb0: 9f c6 40 00 call %i1
202dfb4: 9a 10 00 10 mov %l0, %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 ;
202dfb8: 10 bf ff a6 b 202de50 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
202dfbc: c2 07 20 0c ld [ %i4 + 0xc ], %g1
0202dfd8 <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
202dfd8: 9d e3 bf a0 save %sp, -96, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
202dfdc: 03 00 81 d1 sethi %hi(0x2074400), %g1
202dfe0: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20745e0 <_Thread_Dispatch_disable_level>
202dfe4: 84 00 a0 01 inc %g2
202dfe8: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ]
return _Thread_Dispatch_disable_level;
202dfec: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1
/*
* 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 ;
202dff0: 39 00 81 d2 sethi %hi(0x2074800), %i4
202dff4: b8 17 22 d0 or %i4, 0x2d0, %i4 ! 2074ad0 <_Rate_monotonic_Information>
202dff8: fa 07 20 08 ld [ %i4 + 8 ], %i5
202dffc: c2 07 20 0c ld [ %i4 + 0xc ], %g1
202e000: 80 a7 40 01 cmp %i5, %g1
202e004: 18 80 00 09 bgu 202e028 <rtems_rate_monotonic_reset_all_statistics+0x50><== NEVER TAKEN
202e008: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
202e00c: 40 00 00 09 call 202e030 <rtems_rate_monotonic_reset_statistics>
202e010: 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 ;
202e014: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
202e018: 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 ;
202e01c: 80 a0 40 1d cmp %g1, %i5
202e020: 1a bf ff fb bcc 202e00c <rtems_rate_monotonic_reset_all_statistics+0x34>
202e024: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
202e028: 7f ff 8b 98 call 2010e88 <_Thread_Enable_dispatch>
202e02c: 81 e8 00 00 restore
02008f70 <rtems_rbheap_allocate>:
return big_enough;
}
void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size)
{
2008f70: 9d e3 bf a0 save %sp, -96, %sp
void *ptr = NULL;
rtems_chain_control *free_chain = &control->free_chunk_chain;
rtems_rbtree_control *chunk_tree = &control->chunk_tree;
uintptr_t alignment = control->alignment;
2008f74: fa 06 20 30 ld [ %i0 + 0x30 ], %i5
#include <stdlib.h>
static uintptr_t align_up(uintptr_t alignment, uintptr_t value)
{
uintptr_t excess = value % alignment;
2008f78: 90 10 00 19 mov %i1, %o0
2008f7c: 40 00 43 a9 call 2019e20 <.urem>
2008f80: 92 10 00 1d mov %i5, %o1
if (excess > 0) {
2008f84: 80 a2 20 00 cmp %o0, 0
2008f88: 02 80 00 26 be 2009020 <rtems_rbheap_allocate+0xb0> <== ALWAYS TAKEN
2008f8c: b6 10 00 19 mov %i1, %i3
value += alignment - excess;
2008f90: ba 06 40 1d add %i1, %i5, %i5 <== NOT EXECUTED
2008f94: b6 27 40 08 sub %i5, %o0, %i3 <== NOT EXECUTED
2008f98: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED
2008f9c: 82 60 3f ff subx %g0, -1, %g1 <== NOT EXECUTED
rtems_chain_control *free_chain = &control->free_chunk_chain;
rtems_rbtree_control *chunk_tree = &control->chunk_tree;
uintptr_t alignment = control->alignment;
uintptr_t aligned_size = align_up(alignment, size);
if (size > 0 && size <= aligned_size) {
2008fa0: 80 88 60 ff btst 0xff, %g1
2008fa4: 02 80 00 1d be 2009018 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2008fa8: 80 a6 60 00 cmp %i1, 0
2008fac: 02 80 00 1b be 2009018 <rtems_rbheap_allocate+0xa8>
2008fb0: 82 06 20 04 add %i0, 4, %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2008fb4: fa 06 00 00 ld [ %i0 ], %i5
{
rtems_chain_node *current = rtems_chain_first(free_chain);
const rtems_chain_node *tail = rtems_chain_tail(free_chain);
rtems_rbheap_chunk *big_enough = NULL;
while (current != tail && big_enough == NULL) {
2008fb8: 80 a7 40 01 cmp %i5, %g1
2008fbc: 02 80 00 17 be 2009018 <rtems_rbheap_allocate+0xa8>
2008fc0: 01 00 00 00 nop
rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current;
if (free_chunk->size >= size) {
2008fc4: f8 07 60 1c ld [ %i5 + 0x1c ], %i4
2008fc8: 80 a6 c0 1c cmp %i3, %i4
2008fcc: 38 80 00 10 bgu,a 200900c <rtems_rbheap_allocate+0x9c>
2008fd0: fa 07 40 00 ld [ %i5 ], %i5
uintptr_t aligned_size = align_up(alignment, size);
if (size > 0 && size <= aligned_size) {
rtems_rbheap_chunk *free_chunk = search_free_chunk(free_chain, aligned_size);
if (free_chunk != NULL) {
2008fd4: 80 a7 60 00 cmp %i5, 0
2008fd8: 02 80 00 10 be 2009018 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2008fdc: 80 a7 00 1b cmp %i4, %i3
uintptr_t free_size = free_chunk->size;
if (free_size > aligned_size) {
2008fe0: 18 80 00 12 bgu 2009028 <rtems_rbheap_allocate+0xb8>
2008fe4: 01 00 00 00 nop
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
2008fe8: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
2008fec: c2 07 60 04 ld [ %i5 + 4 ], %g1
ptr = (void *) new_chunk->begin;
}
} else {
rtems_chain_extract_unprotected(&free_chunk->chain_node);
rtems_chain_set_off_chain(&free_chunk->chain_node);
ptr = (void *) free_chunk->begin;
2008ff0: f0 07 60 18 ld [ %i5 + 0x18 ], %i0
next->previous = previous;
2008ff4: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
2008ff8: c4 20 40 00 st %g2, [ %g1 ]
*/
RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain(
Chain_Node *node
)
{
node->next = node->previous = NULL;
2008ffc: c0 27 60 04 clr [ %i5 + 4 ]
2009000: c0 27 40 00 clr [ %i5 ]
}
}
}
return ptr;
}
2009004: 81 c7 e0 08 ret
2009008: 81 e8 00 00 restore
{
rtems_chain_node *current = rtems_chain_first(free_chain);
const rtems_chain_node *tail = rtems_chain_tail(free_chain);
rtems_rbheap_chunk *big_enough = NULL;
while (current != tail && big_enough == NULL) {
200900c: 80 a0 40 1d cmp %g1, %i5
2009010: 32 bf ff ee bne,a 2008fc8 <rtems_rbheap_allocate+0x58> <== NEVER TAKEN
2009014: f8 07 60 1c ld [ %i5 + 0x1c ], %i4 <== NOT EXECUTED
return big_enough;
}
void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size)
{
void *ptr = NULL;
2009018: 81 c7 e0 08 ret
200901c: 91 e8 20 00 restore %g0, 0, %o0
static uintptr_t align_up(uintptr_t alignment, uintptr_t value)
{
uintptr_t excess = value % alignment;
if (excess > 0) {
2009020: 10 bf ff e0 b 2008fa0 <rtems_rbheap_allocate+0x30>
2009024: 82 10 20 01 mov 1, %g1
if (free_chunk != NULL) {
uintptr_t free_size = free_chunk->size;
if (free_size > aligned_size) {
rtems_rbheap_chunk *new_chunk = get_chunk(control);
2009028: 7f ff ff 46 call 2008d40 <get_chunk>
200902c: 90 10 00 18 mov %i0, %o0
if (new_chunk != NULL) {
2009030: b4 92 20 00 orcc %o0, 0, %i2
2009034: 02 bf ff f9 be 2009018 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2009038: b8 27 00 1b sub %i4, %i3, %i4
uintptr_t new_free_size = free_size - aligned_size;
free_chunk->size = new_free_size;
new_chunk->begin = free_chunk->begin + new_free_size;
200903c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
rtems_rbheap_chunk *new_chunk = get_chunk(control);
if (new_chunk != NULL) {
uintptr_t new_free_size = free_size - aligned_size;
free_chunk->size = new_free_size;
2009040: f8 27 60 1c st %i4, [ %i5 + 0x1c ]
new_chunk->begin = free_chunk->begin + new_free_size;
new_chunk->size = aligned_size;
2009044: f6 26 a0 1c st %i3, [ %i2 + 0x1c ]
if (new_chunk != NULL) {
uintptr_t new_free_size = free_size - aligned_size;
free_chunk->size = new_free_size;
new_chunk->begin = free_chunk->begin + new_free_size;
2009048: b8 07 00 01 add %i4, %g1, %i4
200904c: c0 26 a0 04 clr [ %i2 + 4 ]
2009050: f8 26 a0 18 st %i4, [ %i2 + 0x18 ]
2009054: c0 26 80 00 clr [ %i2 ]
static void insert_into_tree(
rtems_rbtree_control *tree,
rtems_rbheap_chunk *chunk
)
{
_RBTree_Insert_unprotected(tree, &chunk->tree_node);
2009058: 90 06 20 18 add %i0, 0x18, %o0
200905c: 40 00 07 06 call 200ac74 <_RBTree_Insert_unprotected>
2009060: 92 06 a0 08 add %i2, 8, %o1
free_chunk->size = new_free_size;
new_chunk->begin = free_chunk->begin + new_free_size;
new_chunk->size = aligned_size;
rtems_chain_set_off_chain(&new_chunk->chain_node);
insert_into_tree(chunk_tree, new_chunk);
ptr = (void *) new_chunk->begin;
2009064: f0 06 a0 18 ld [ %i2 + 0x18 ], %i0
2009068: 81 c7 e0 08 ret
200906c: 81 e8 00 00 restore
020091b4 <rtems_rbheap_extend_descriptors_with_malloc>:
/* Do nothing */
}
void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control)
{
20091b4: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED
rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk));
20091b8: 7f ff ec a2 call 2004440 <malloc> <== NOT EXECUTED
20091bc: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED
if (chunk != NULL) {
20091c0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
20091c4: 02 80 00 07 be 20091e0 <rtems_rbheap_extend_descriptors_with_malloc+0x2c><== NOT EXECUTED
20091c8: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
20091cc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED
after_node->next = the_node;
20091d0: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
20091d4: c4 22 20 04 st %g2, [ %o0 + 4 ] <== NOT EXECUTED
before_node = after_node->next;
after_node->next = the_node;
the_node->next = before_node;
20091d8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
before_node->previous = the_node;
20091dc: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED
20091e0: 81 c7 e0 08 ret <== NOT EXECUTED
20091e4: 81 e8 00 00 restore <== NOT EXECUTED
02009070 <rtems_rbheap_free>:
_RBTree_Extract_unprotected(chunk_tree, &b->tree_node);
}
}
rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr)
{
2009070: 9d e3 bf 80 save %sp, -128, %sp
2009074: b4 10 00 18 mov %i0, %i2
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (ptr != NULL) {
2009078: 80 a6 60 00 cmp %i1, 0
200907c: 02 80 00 2a be 2009124 <rtems_rbheap_free+0xb4>
2009080: b0 10 20 00 clr %i0
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
RBTree_Node* iter_node = the_rbtree->root;
2009084: fa 06 a0 1c ld [ %i2 + 0x1c ], %i5
#define NULL_PAGE rtems_rbheap_chunk_of_node(NULL)
static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key)
{
rtems_rbheap_chunk chunk = { .begin = key };
2009088: c0 27 bf fc clr [ %fp + -4 ]
200908c: c0 27 bf e0 clr [ %fp + -32 ]
2009090: c0 27 bf e4 clr [ %fp + -28 ]
2009094: c0 27 bf e8 clr [ %fp + -24 ]
2009098: c0 27 bf ec clr [ %fp + -20 ]
200909c: c0 27 bf f0 clr [ %fp + -16 ]
20090a0: c0 27 bf f4 clr [ %fp + -12 ]
20090a4: f2 27 bf f8 st %i1, [ %fp + -8 ]
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
20090a8: 80 a7 60 00 cmp %i5, 0
20090ac: 02 80 00 3e be 20091a4 <rtems_rbheap_free+0x134> <== NEVER TAKEN
20090b0: b8 06 a0 18 add %i2, 0x18, %i4
20090b4: b6 10 20 00 clr %i3
compare_result = the_rbtree->compare_function(the_node, iter_node);
20090b8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
20090bc: 92 10 00 1d mov %i5, %o1
20090c0: 9f c0 40 00 call %g1
20090c4: 90 07 bf e8 add %fp, -24, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
20090c8: 83 3a 20 1f sra %o0, 0x1f, %g1
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( _RBTree_Is_equal( compare_result ) ) {
20090cc: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
20090d0: 82 20 40 08 sub %g1, %o0, %g1
20090d4: 83 30 60 1f srl %g1, 0x1f, %g1
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
20090d8: 83 28 60 02 sll %g1, 2, %g1
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
compare_result = the_rbtree->compare_function(the_node, iter_node);
if ( _RBTree_Is_equal( compare_result ) ) {
20090dc: 12 80 00 06 bne 20090f4 <rtems_rbheap_free+0x84>
20090e0: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
20090e4: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
20090e8: 80 a0 a0 00 cmp %g2, 0
20090ec: 12 80 00 10 bne 200912c <rtems_rbheap_free+0xbc> <== ALWAYS TAKEN
20090f0: b6 10 00 1d mov %i5, %i3
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
20090f4: fa 00 60 04 ld [ %g1 + 4 ], %i5
)
{
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
20090f8: 80 a7 60 00 cmp %i5, 0
20090fc: 32 bf ff f0 bne,a 20090bc <rtems_rbheap_free+0x4c>
2009100: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return rtems_rbheap_chunk_of_node(
2009104: ba 06 ff f8 add %i3, -8, %i5
if (ptr != NULL) {
rtems_chain_control *free_chain = &control->free_chunk_chain;
rtems_rbtree_control *chunk_tree = &control->chunk_tree;
rtems_rbheap_chunk *chunk = find(chunk_tree, (uintptr_t) ptr);
if (chunk != NULL_PAGE) {
2009108: 80 a7 7f f8 cmp %i5, -8
200910c: 02 80 00 06 be 2009124 <rtems_rbheap_free+0xb4>
2009110: b0 10 20 04 mov 4, %i0
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain(
const Chain_Node *node
)
{
return (node->next == NULL) && (node->previous == NULL);
2009114: c2 06 ff f8 ld [ %i3 + -8 ], %g1
2009118: 80 a0 60 00 cmp %g1, 0
200911c: 02 80 00 06 be 2009134 <rtems_rbheap_free+0xc4>
2009120: b0 10 20 0e mov 0xe, %i0
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
2009124: 81 c7 e0 08 ret
2009128: 81 e8 00 00 restore
static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key)
{
rtems_rbheap_chunk chunk = { .begin = key };
return rtems_rbheap_chunk_of_node(
200912c: 10 bf ff f7 b 2009108 <rtems_rbheap_free+0x98>
2009130: ba 06 ff f8 add %i3, -8, %i5
2009134: c2 06 ff fc ld [ %i3 + -4 ], %g1
2009138: 80 a0 60 00 cmp %g1, 0
200913c: 12 bf ff fa bne 2009124 <rtems_rbheap_free+0xb4> <== NEVER TAKEN
2009140: 92 10 20 00 clr %o1
static rtems_rbheap_chunk *get_next(
const rtems_rbheap_chunk *chunk,
RBTree_Direction dir
)
{
return rtems_rbheap_chunk_of_node(
2009144: 40 00 07 9b call 200afb0 <_RBTree_Next_unprotected>
2009148: 90 10 00 1b mov %i3, %o0
200914c: 92 10 20 01 mov 1, %o1
2009150: b2 10 00 08 mov %o0, %i1
2009154: 40 00 07 97 call 200afb0 <_RBTree_Next_unprotected>
2009158: 90 10 00 1b mov %i3, %o0
if (chunk != NULL_PAGE) {
if (!rtems_rbheap_is_chunk_free(chunk)) {
rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT);
rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT);
check_and_merge(free_chain, chunk_tree, chunk, succ);
200915c: 92 10 00 1c mov %i4, %o1
static rtems_rbheap_chunk *get_next(
const rtems_rbheap_chunk *chunk,
RBTree_Direction dir
)
{
return rtems_rbheap_chunk_of_node(
2009160: 96 02 3f f8 add %o0, -8, %o3
if (chunk != NULL_PAGE) {
if (!rtems_rbheap_is_chunk_free(chunk)) {
rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT);
rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT);
check_and_merge(free_chain, chunk_tree, chunk, succ);
2009164: 94 10 00 1d mov %i5, %o2
2009168: 7f ff ff 10 call 2008da8 <check_and_merge>
200916c: 90 10 00 1a mov %i2, %o0
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2009170: c2 06 80 00 ld [ %i2 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2009174: f4 26 ff fc st %i2, [ %i3 + -4 ]
before_node = after_node->next;
after_node->next = the_node;
2009178: fa 26 80 00 st %i5, [ %i2 ]
the_node->next = before_node;
200917c: c2 26 ff f8 st %g1, [ %i3 + -8 ]
before_node->previous = the_node;
2009180: fa 20 60 04 st %i5, [ %g1 + 4 ]
add_to_chain(free_chain, chunk);
check_and_merge(free_chain, chunk_tree, chunk, pred);
2009184: 90 10 00 1a mov %i2, %o0
2009188: 92 10 00 1c mov %i4, %o1
200918c: 94 10 00 1d mov %i5, %o2
2009190: 96 06 7f f8 add %i1, -8, %o3
2009194: 7f ff ff 05 call 2008da8 <check_and_merge>
2009198: b0 10 20 00 clr %i0
200919c: 81 c7 e0 08 ret
20091a0: 81 e8 00 00 restore
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
20091a4: 81 c7 e0 08 ret <== NOT EXECUTED
20091a8: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED
02008e40 <rtems_rbheap_initialize>:
uintptr_t area_size,
uintptr_t alignment,
rtems_rbheap_extend_descriptors extend_descriptors,
void *handler_arg
)
{
2008e40: 9d e3 bf a0 save %sp, -96, %sp
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (alignment > 0) {
2008e44: 80 a6 e0 00 cmp %i3, 0
2008e48: 12 80 00 04 bne 2008e58 <rtems_rbheap_initialize+0x18>
2008e4c: 82 10 20 0a mov 0xa, %g1
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
2008e50: 81 c7 e0 08 ret
2008e54: 91 e8 00 01 restore %g0, %g1, %o0
#include <stdlib.h>
static uintptr_t align_up(uintptr_t alignment, uintptr_t value)
{
uintptr_t excess = value % alignment;
2008e58: 90 10 00 19 mov %i1, %o0
2008e5c: 92 10 00 1b mov %i3, %o1
2008e60: 40 00 43 f0 call 2019e20 <.urem>
2008e64: b4 06 40 1a add %i1, %i2, %i2
if (excess > 0) {
2008e68: 80 a2 20 00 cmp %o0, 0
2008e6c: 32 80 00 09 bne,a 2008e90 <rtems_rbheap_initialize+0x50>
2008e70: a0 06 40 1b add %i1, %i3, %l0
2008e74: 82 10 20 01 mov 1, %g1
uintptr_t begin = (uintptr_t) area_begin;
uintptr_t end = begin + area_size;
uintptr_t aligned_begin = align_up(alignment, begin);
uintptr_t aligned_end = align_down(alignment, end);
if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) {
2008e78: 80 88 60 ff btst 0xff, %g1
2008e7c: 12 80 00 0b bne 2008ea8 <rtems_rbheap_initialize+0x68> <== ALWAYS TAKEN
2008e80: a0 10 00 19 mov %i1, %l0
insert_into_tree(chunk_tree, first);
} else {
sc = RTEMS_NO_MEMORY;
}
} else {
sc = RTEMS_INVALID_ADDRESS;
2008e84: 82 10 20 09 mov 9, %g1 <== NOT EXECUTED
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
2008e88: 81 c7 e0 08 ret
2008e8c: 91 e8 00 01 restore %g0, %g1, %o0
static uintptr_t align_up(uintptr_t alignment, uintptr_t value)
{
uintptr_t excess = value % alignment;
if (excess > 0) {
value += alignment - excess;
2008e90: a0 24 00 08 sub %l0, %o0, %l0
2008e94: 80 a4 00 19 cmp %l0, %i1
2008e98: 82 60 3f ff subx %g0, -1, %g1
uintptr_t begin = (uintptr_t) area_begin;
uintptr_t end = begin + area_size;
uintptr_t aligned_begin = align_up(alignment, begin);
uintptr_t aligned_end = align_down(alignment, end);
if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) {
2008e9c: 80 88 60 ff btst 0xff, %g1
2008ea0: 02 bf ff fa be 2008e88 <rtems_rbheap_initialize+0x48>
2008ea4: 82 10 20 09 mov 9, %g1
2008ea8: 80 a6 40 1a cmp %i1, %i2
2008eac: 1a bf ff f7 bcc 2008e88 <rtems_rbheap_initialize+0x48>
2008eb0: 82 10 20 09 mov 9, %g1
return value;
}
static uintptr_t align_down(uintptr_t alignment, uintptr_t value)
{
uintptr_t excess = value % alignment;
2008eb4: 90 10 00 1a mov %i2, %o0
2008eb8: 40 00 43 da call 2019e20 <.urem>
2008ebc: 92 10 00 1b mov %i3, %o1
return value - excess;
2008ec0: b4 26 80 08 sub %i2, %o0, %i2
uintptr_t begin = (uintptr_t) area_begin;
uintptr_t end = begin + area_size;
uintptr_t aligned_begin = align_up(alignment, begin);
uintptr_t aligned_end = align_down(alignment, end);
if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) {
2008ec4: 80 a4 00 1a cmp %l0, %i2
2008ec8: 1a bf ff e2 bcc 2008e50 <rtems_rbheap_initialize+0x10>
2008ecc: 82 10 20 09 mov 9, %g1
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
2008ed0: 82 06 20 04 add %i0, 4, %g1
head->next = tail;
2008ed4: c2 26 00 00 st %g1, [ %i0 ]
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 );
2008ed8: 82 06 20 0c add %i0, 0xc, %g1
head->next = tail;
head->previous = NULL;
tail->previous = head;
2008edc: c2 26 20 14 st %g1, [ %i0 + 0x14 ]
the_rbtree->permanent_null = NULL;
the_rbtree->root = NULL;
the_rbtree->first[0] = NULL;
the_rbtree->first[1] = NULL;
the_rbtree->compare_function = compare_function;
the_rbtree->is_unique = is_unique;
2008ee0: 82 10 20 01 mov 1, %g1
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
2008ee4: 84 06 20 10 add %i0, 0x10, %g2
2008ee8: c2 2e 20 2c stb %g1, [ %i0 + 0x2c ]
{
the_rbtree->permanent_null = NULL;
the_rbtree->root = NULL;
the_rbtree->first[0] = NULL;
the_rbtree->first[1] = NULL;
the_rbtree->compare_function = compare_function;
2008eec: 03 00 80 23 sethi %hi(0x2008c00), %g1
2008ef0: 82 10 61 30 or %g1, 0x130, %g1 ! 2008d30 <chunk_compare>
head->next = tail;
head->previous = NULL;
2008ef4: c0 26 20 04 clr [ %i0 + 4 ]
2008ef8: c2 26 20 28 st %g1, [ %i0 + 0x28 ]
tail->previous = head;
2008efc: f0 26 20 08 st %i0, [ %i0 + 8 ]
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
head->previous = NULL;
2008f00: c0 26 20 10 clr [ %i0 + 0x10 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2008f04: c4 26 20 0c st %g2, [ %i0 + 0xc ]
RBTree_Control *the_rbtree,
RBTree_Compare_function compare_function,
bool is_unique
)
{
the_rbtree->permanent_null = NULL;
2008f08: c0 26 20 18 clr [ %i0 + 0x18 ]
the_rbtree->root = NULL;
2008f0c: c0 26 20 1c clr [ %i0 + 0x1c ]
the_rbtree->first[0] = NULL;
2008f10: c0 26 20 20 clr [ %i0 + 0x20 ]
the_rbtree->first[1] = NULL;
2008f14: c0 26 20 24 clr [ %i0 + 0x24 ]
rtems_rbheap_chunk *first = NULL;
rtems_chain_initialize_empty(free_chain);
rtems_chain_initialize_empty(&control->spare_descriptor_chain);
rtems_rbtree_initialize_empty(chunk_tree, chunk_compare, true);
control->alignment = alignment;
2008f18: f6 26 20 30 st %i3, [ %i0 + 0x30 ]
control->handler_arg = handler_arg;
2008f1c: fa 26 20 38 st %i5, [ %i0 + 0x38 ]
control->extend_descriptors = extend_descriptors;
2008f20: f8 26 20 34 st %i4, [ %i0 + 0x34 ]
first = get_chunk(control);
2008f24: 7f ff ff 87 call 2008d40 <get_chunk>
2008f28: 90 10 00 18 mov %i0, %o0
first->begin = aligned_begin;
first->size = aligned_end - aligned_begin;
add_to_chain(free_chain, first);
insert_into_tree(chunk_tree, first);
} else {
sc = RTEMS_NO_MEMORY;
2008f2c: 82 10 20 1a mov 0x1a, %g1
control->alignment = alignment;
control->handler_arg = handler_arg;
control->extend_descriptors = extend_descriptors;
first = get_chunk(control);
if (first != NULL) {
2008f30: 80 a2 20 00 cmp %o0, 0
2008f34: 02 bf ff c7 be 2008e50 <rtems_rbheap_initialize+0x10>
2008f38: 92 10 00 08 mov %o0, %o1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2008f3c: c2 06 00 00 ld [ %i0 ], %g1
first->begin = aligned_begin;
first->size = aligned_end - aligned_begin;
2008f40: b4 26 80 10 sub %i2, %l0, %i2
control->handler_arg = handler_arg;
control->extend_descriptors = extend_descriptors;
first = get_chunk(control);
if (first != NULL) {
first->begin = aligned_begin;
2008f44: e0 22 20 18 st %l0, [ %o0 + 0x18 ]
first->size = aligned_end - aligned_begin;
2008f48: f4 22 20 1c st %i2, [ %o0 + 0x1c ]
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2008f4c: f0 22 20 04 st %i0, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
2008f50: d0 26 00 00 st %o0, [ %i0 ]
the_node->next = before_node;
2008f54: c2 22 00 00 st %g1, [ %o0 ]
before_node->previous = the_node;
2008f58: d0 20 60 04 st %o0, [ %g1 + 4 ]
static void insert_into_tree(
rtems_rbtree_control *tree,
rtems_rbheap_chunk *chunk
)
{
_RBTree_Insert_unprotected(tree, &chunk->tree_node);
2008f5c: 92 02 60 08 add %o1, 8, %o1
2008f60: 40 00 07 45 call 200ac74 <_RBTree_Insert_unprotected>
2008f64: 90 06 20 18 add %i0, 0x18, %o0
uintptr_t alignment,
rtems_rbheap_extend_descriptors extend_descriptors,
void *handler_arg
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
2008f68: 10 bf ff ba b 2008e50 <rtems_rbheap_initialize+0x10>
2008f6c: 82 10 20 00 clr %g1
02016ef4 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
2016ef4: 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 )
2016ef8: 80 a6 60 00 cmp %i1, 0
2016efc: 12 80 00 04 bne 2016f0c <rtems_signal_send+0x18>
2016f00: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2016f04: 81 c7 e0 08 ret
2016f08: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2016f0c: 90 10 00 18 mov %i0, %o0
2016f10: 40 00 13 65 call 201bca4 <_Thread_Get>
2016f14: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2016f18: c2 07 bf fc ld [ %fp + -4 ], %g1
2016f1c: 80 a0 60 00 cmp %g1, 0
2016f20: 12 80 00 20 bne 2016fa0 <rtems_signal_send+0xac>
2016f24: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
2016f28: fa 02 21 50 ld [ %o0 + 0x150 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
2016f2c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2016f30: 80 a0 60 00 cmp %g1, 0
2016f34: 02 80 00 1e be 2016fac <rtems_signal_send+0xb8>
2016f38: 01 00 00 00 nop
if ( asr->is_enabled ) {
2016f3c: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2016f40: 80 a0 60 00 cmp %g1, 0
2016f44: 02 80 00 1e be 2016fbc <rtems_signal_send+0xc8>
2016f48: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2016f4c: 7f ff e2 31 call 200f810 <sparc_disable_interrupts>
2016f50: 01 00 00 00 nop
*signal_set |= signals;
2016f54: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2016f58: b2 10 40 19 or %g1, %i1, %i1
2016f5c: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2016f60: 7f ff e2 30 call 200f820 <sparc_enable_interrupts>
2016f64: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
2016f68: 03 00 80 ed sethi %hi(0x203b400), %g1
2016f6c: 82 10 63 20 or %g1, 0x320, %g1 ! 203b720 <_Per_CPU_Information>
2016f70: c4 00 60 08 ld [ %g1 + 8 ], %g2
2016f74: 80 a0 a0 00 cmp %g2, 0
2016f78: 02 80 00 06 be 2016f90 <rtems_signal_send+0x9c>
2016f7c: 01 00 00 00 nop
2016f80: c4 00 60 0c ld [ %g1 + 0xc ], %g2
2016f84: 80 a7 00 02 cmp %i4, %g2
2016f88: 02 80 00 15 be 2016fdc <rtems_signal_send+0xe8> <== ALWAYS TAKEN
2016f8c: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
2016f90: 40 00 13 38 call 201bc70 <_Thread_Enable_dispatch>
2016f94: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2016f98: 10 bf ff db b 2016f04 <rtems_signal_send+0x10>
2016f9c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2016fa0: 82 10 20 04 mov 4, %g1
}
2016fa4: 81 c7 e0 08 ret
2016fa8: 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();
2016fac: 40 00 13 31 call 201bc70 <_Thread_Enable_dispatch>
2016fb0: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
2016fb4: 10 bf ff d4 b 2016f04 <rtems_signal_send+0x10>
2016fb8: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2016fbc: 7f ff e2 15 call 200f810 <sparc_disable_interrupts>
2016fc0: 01 00 00 00 nop
*signal_set |= signals;
2016fc4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2016fc8: b2 10 40 19 or %g1, %i1, %i1
2016fcc: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
2016fd0: 7f ff e2 14 call 200f820 <sparc_enable_interrupts>
2016fd4: 01 00 00 00 nop
2016fd8: 30 bf ff ee b,a 2016f90 <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;
2016fdc: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
2016fe0: 30 bf ff ec b,a 2016f90 <rtems_signal_send+0x9c>
0200f3dc <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
200f3dc: 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 )
200f3e0: 80 a6 a0 00 cmp %i2, 0
200f3e4: 02 80 00 3b be 200f4d0 <rtems_task_mode+0xf4>
200f3e8: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
200f3ec: 21 00 80 75 sethi %hi(0x201d400), %l0
200f3f0: a0 14 20 30 or %l0, 0x30, %l0 ! 201d430 <_Per_CPU_Information>
200f3f4: 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;
200f3f8: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f3fc: c2 07 60 78 ld [ %i5 + 0x78 ], %g1
executing = _Thread_Executing;
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f400: 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 ];
200f404: f8 07 61 50 ld [ %i5 + 0x150 ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f408: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f40c: 80 a0 60 00 cmp %g1, 0
200f410: 12 80 00 40 bne 200f510 <rtems_task_mode+0x134>
200f414: 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;
200f418: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
200f41c: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f420: 7f ff f2 11 call 200bc64 <_CPU_ISR_Get_level>
200f424: 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;
200f428: a3 2c 60 0a sll %l1, 0xa, %l1
200f42c: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
200f430: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f434: 80 8e 61 00 btst 0x100, %i1
200f438: 02 80 00 06 be 200f450 <rtems_task_mode+0x74>
200f43c: 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;
200f440: 83 36 20 08 srl %i0, 8, %g1
200f444: 82 18 60 01 xor %g1, 1, %g1
200f448: 82 08 60 01 and %g1, 1, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
200f44c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
200f450: 80 8e 62 00 btst 0x200, %i1
200f454: 12 80 00 21 bne 200f4d8 <rtems_task_mode+0xfc>
200f458: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f45c: 80 8e 60 0f btst 0xf, %i1
200f460: 12 80 00 27 bne 200f4fc <rtems_task_mode+0x120>
200f464: 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 ) {
200f468: 80 8e 64 00 btst 0x400, %i1
200f46c: 02 80 00 14 be 200f4bc <rtems_task_mode+0xe0>
200f470: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200f474: c2 0f 20 08 ldub [ %i4 + 8 ], %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;
200f478: b1 36 20 0a srl %i0, 0xa, %i0
200f47c: b0 1e 20 01 xor %i0, 1, %i0
200f480: b0 0e 20 01 and %i0, 1, %i0
if ( is_asr_enabled != asr->is_enabled ) {
200f484: 80 a6 00 01 cmp %i0, %g1
200f488: 22 80 00 0e be,a 200f4c0 <rtems_task_mode+0xe4>
200f48c: 03 00 80 74 sethi %hi(0x201d000), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
200f490: 7f ff cc b5 call 2002764 <sparc_disable_interrupts>
200f494: f0 2f 20 08 stb %i0, [ %i4 + 8 ]
_signals = information->signals_pending;
200f498: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
200f49c: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
200f4a0: 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;
200f4a4: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
200f4a8: 7f ff cc b3 call 2002774 <sparc_enable_interrupts>
200f4ac: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
200f4b0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
200f4b4: 80 a0 00 01 cmp %g0, %g1
200f4b8: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
200f4bc: 03 00 80 74 sethi %hi(0x201d000), %g1
200f4c0: c4 00 63 50 ld [ %g1 + 0x350 ], %g2 ! 201d350 <_System_state_Current>
200f4c4: 80 a0 a0 03 cmp %g2, 3
200f4c8: 02 80 00 1f be 200f544 <rtems_task_mode+0x168>
200f4cc: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
200f4d0: 81 c7 e0 08 ret
200f4d4: 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) ) {
200f4d8: 22 bf ff e1 be,a 200f45c <rtems_task_mode+0x80>
200f4dc: c0 27 60 78 clr [ %i5 + 0x78 ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200f4e0: 03 00 80 74 sethi %hi(0x201d000), %g1
200f4e4: c2 00 61 70 ld [ %g1 + 0x170 ], %g1 ! 201d170 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f4e8: 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;
200f4ec: c2 27 60 74 st %g1, [ %i5 + 0x74 ]
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;
200f4f0: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f4f4: 02 bf ff dd be 200f468 <rtems_task_mode+0x8c>
200f4f8: c2 27 60 78 st %g1, [ %i5 + 0x78 ]
*/
RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level (
Modes_Control mode_set
)
{
return ( mode_set & RTEMS_INTERRUPT_MASK );
200f4fc: 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 ) );
200f500: 7f ff cc 9d call 2002774 <sparc_enable_interrupts>
200f504: 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 ) {
200f508: 10 bf ff d9 b 200f46c <rtems_task_mode+0x90>
200f50c: 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;
200f510: 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;
200f514: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200f518: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f51c: 7f ff f1 d2 call 200bc64 <_CPU_ISR_Get_level>
200f520: 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;
200f524: a3 2c 60 0a sll %l1, 0xa, %l1
200f528: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
200f52c: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f530: 80 8e 61 00 btst 0x100, %i1
200f534: 02 bf ff c7 be 200f450 <rtems_task_mode+0x74>
200f538: 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;
200f53c: 10 bf ff c2 b 200f444 <rtems_task_mode+0x68>
200f540: 83 36 20 08 srl %i0, 8, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
200f544: 80 88 e0 ff btst 0xff, %g3
200f548: 12 80 00 0a bne 200f570 <rtems_task_mode+0x194>
200f54c: c4 04 20 0c ld [ %l0 + 0xc ], %g2
200f550: c6 04 20 10 ld [ %l0 + 0x10 ], %g3
200f554: 80 a0 80 03 cmp %g2, %g3
200f558: 02 bf ff de be 200f4d0 <rtems_task_mode+0xf4>
200f55c: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
200f560: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
200f564: 80 a0 a0 00 cmp %g2, 0
200f568: 02 bf ff da be 200f4d0 <rtems_task_mode+0xf4> <== NEVER TAKEN
200f56c: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
200f570: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
200f574: 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();
200f578: 7f ff ec 58 call 200a6d8 <_Thread_Dispatch>
200f57c: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
200f580: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
200f584: 81 c7 e0 08 ret
200f588: 91 e8 00 01 restore %g0, %g1, %o0
0200c84c <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200c84c: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200c850: 80 a6 60 00 cmp %i1, 0
200c854: 02 80 00 08 be 200c874 <rtems_task_set_priority+0x28>
200c858: 80 a6 a0 00 cmp %i2, 0
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 ) );
200c85c: 03 00 80 83 sethi %hi(0x2020c00), %g1
200c860: c4 08 61 78 ldub [ %g1 + 0x178 ], %g2 ! 2020d78 <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
200c864: 80 a6 40 02 cmp %i1, %g2
200c868: 18 80 00 1e bgu 200c8e0 <rtems_task_set_priority+0x94>
200c86c: 82 10 20 13 mov 0x13, %g1
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200c870: 80 a6 a0 00 cmp %i2, 0
200c874: 02 80 00 1b be 200c8e0 <rtems_task_set_priority+0x94>
200c878: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200c87c: 90 10 00 18 mov %i0, %o0
200c880: 40 00 0a 05 call 200f094 <_Thread_Get>
200c884: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200c888: c2 07 bf fc ld [ %fp + -4 ], %g1
200c88c: 80 a0 60 00 cmp %g1, 0
200c890: 12 80 00 16 bne 200c8e8 <rtems_task_set_priority+0x9c>
200c894: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200c898: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200c89c: 80 a6 60 00 cmp %i1, 0
200c8a0: 02 80 00 0d be 200c8d4 <rtems_task_set_priority+0x88>
200c8a4: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200c8a8: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200c8ac: 80 a0 60 00 cmp %g1, 0
200c8b0: 02 80 00 06 be 200c8c8 <rtems_task_set_priority+0x7c>
200c8b4: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200c8b8: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200c8bc: 80 a6 40 01 cmp %i1, %g1
200c8c0: 1a 80 00 05 bcc 200c8d4 <rtems_task_set_priority+0x88> <== ALWAYS TAKEN
200c8c4: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200c8c8: 92 10 00 19 mov %i1, %o1
200c8cc: 40 00 08 a4 call 200eb5c <_Thread_Change_priority>
200c8d0: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200c8d4: 40 00 09 e3 call 200f060 <_Thread_Enable_dispatch>
200c8d8: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
200c8dc: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
200c8e0: 81 c7 e0 08 ret
200c8e4: 91 e8 00 01 restore %g0, %g1, %o0
200c8e8: 81 c7 e0 08 ret
200c8ec: 91 e8 00 01 restore %g0, %g1, %o0
0202e4d8 <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
202e4d8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
202e4dc: 80 a6 60 00 cmp %i1, 0
202e4e0: 02 80 00 1e be 202e558 <rtems_task_variable_delete+0x80>
202e4e4: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
202e4e8: 90 10 00 18 mov %i0, %o0
202e4ec: 7f ff 8a 74 call 2010ebc <_Thread_Get>
202e4f0: 92 07 bf fc add %fp, -4, %o1
switch (location) {
202e4f4: c2 07 bf fc ld [ %fp + -4 ], %g1
202e4f8: 80 a0 60 00 cmp %g1, 0
202e4fc: 12 80 00 19 bne 202e560 <rtems_task_variable_delete+0x88>
202e500: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
202e504: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
while (tvp) {
202e508: 80 a0 60 00 cmp %g1, 0
202e50c: 02 80 00 10 be 202e54c <rtems_task_variable_delete+0x74>
202e510: 01 00 00 00 nop
if (tvp->ptr == ptr) {
202e514: c4 00 60 04 ld [ %g1 + 4 ], %g2
202e518: 80 a0 80 19 cmp %g2, %i1
202e51c: 32 80 00 09 bne,a 202e540 <rtems_task_variable_delete+0x68>
202e520: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
202e524: 10 80 00 18 b 202e584 <rtems_task_variable_delete+0xac>
202e528: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
202e52c: 80 a0 80 19 cmp %g2, %i1
202e530: 22 80 00 0e be,a 202e568 <rtems_task_variable_delete+0x90>
202e534: c4 02 40 00 ld [ %o1 ], %g2
202e538: 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;
202e53c: 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) {
202e540: 80 a2 60 00 cmp %o1, 0
202e544: 32 bf ff fa bne,a 202e52c <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
202e548: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
202e54c: 7f ff 8a 4f call 2010e88 <_Thread_Enable_dispatch>
202e550: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
202e554: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
202e558: 81 c7 e0 08 ret
202e55c: 91 e8 00 01 restore %g0, %g1, %o0
202e560: 81 c7 e0 08 ret
202e564: 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;
202e568: 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 );
202e56c: 40 00 00 2e call 202e624 <_RTEMS_Tasks_Invoke_task_variable_dtor>
202e570: 01 00 00 00 nop
_Thread_Enable_dispatch();
202e574: 7f ff 8a 45 call 2010e88 <_Thread_Enable_dispatch>
202e578: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
202e57c: 10 bf ff f7 b 202e558 <rtems_task_variable_delete+0x80>
202e580: 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;
202e584: 92 10 00 01 mov %g1, %o1
202e588: 10 bf ff f9 b 202e56c <rtems_task_variable_delete+0x94>
202e58c: c4 22 21 5c st %g2, [ %o0 + 0x15c ]
0202e590 <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
202e590: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
202e594: 80 a6 60 00 cmp %i1, 0
202e598: 02 80 00 1b be 202e604 <rtems_task_variable_get+0x74>
202e59c: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !result )
202e5a0: 80 a6 a0 00 cmp %i2, 0
202e5a4: 02 80 00 18 be 202e604 <rtems_task_variable_get+0x74>
202e5a8: 90 10 00 18 mov %i0, %o0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
202e5ac: 7f ff 8a 44 call 2010ebc <_Thread_Get>
202e5b0: 92 07 bf fc add %fp, -4, %o1
switch (location) {
202e5b4: c2 07 bf fc ld [ %fp + -4 ], %g1
202e5b8: 80 a0 60 00 cmp %g1, 0
202e5bc: 12 80 00 14 bne 202e60c <rtems_task_variable_get+0x7c>
202e5c0: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
/*
* Figure out if the variable is in this task's list.
*/
tvp = the_thread->task_variables;
202e5c4: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
while (tvp) {
202e5c8: 80 a0 60 00 cmp %g1, 0
202e5cc: 32 80 00 07 bne,a 202e5e8 <rtems_task_variable_get+0x58>
202e5d0: c4 00 60 04 ld [ %g1 + 4 ], %g2
202e5d4: 30 80 00 10 b,a 202e614 <rtems_task_variable_get+0x84>
202e5d8: 80 a0 60 00 cmp %g1, 0
202e5dc: 02 80 00 0e be 202e614 <rtems_task_variable_get+0x84> <== NEVER TAKEN
202e5e0: 01 00 00 00 nop
if (tvp->ptr == ptr) {
202e5e4: c4 00 60 04 ld [ %g1 + 4 ], %g2
202e5e8: 80 a0 80 19 cmp %g2, %i1
202e5ec: 32 bf ff fb bne,a 202e5d8 <rtems_task_variable_get+0x48>
202e5f0: 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;
202e5f4: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
202e5f8: 7f ff 8a 24 call 2010e88 <_Thread_Enable_dispatch>
202e5fc: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
202e600: 82 10 20 00 clr %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
202e604: 81 c7 e0 08 ret
202e608: 91 e8 00 01 restore %g0, %g1, %o0
202e60c: 81 c7 e0 08 ret
202e610: 91 e8 00 01 restore %g0, %g1, %o0
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
202e614: 7f ff 8a 1d call 2010e88 <_Thread_Enable_dispatch>
202e618: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
202e61c: 10 bf ff fa b 202e604 <rtems_task_variable_get+0x74>
202e620: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
02017994 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2017994: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2017998: 11 00 80 ed sethi %hi(0x203b400), %o0
201799c: 92 10 00 18 mov %i0, %o1
20179a0: 90 12 23 c4 or %o0, 0x3c4, %o0
20179a4: 40 00 0c b4 call 201ac74 <_Objects_Get>
20179a8: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
20179ac: c2 07 bf fc ld [ %fp + -4 ], %g1
20179b0: 80 a0 60 00 cmp %g1, 0
20179b4: 12 80 00 0c bne 20179e4 <rtems_timer_cancel+0x50>
20179b8: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
20179bc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
20179c0: 80 a0 60 04 cmp %g1, 4
20179c4: 02 80 00 04 be 20179d4 <rtems_timer_cancel+0x40> <== NEVER TAKEN
20179c8: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
20179cc: 40 00 15 17 call 201ce28 <_Watchdog_Remove>
20179d0: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
20179d4: 40 00 10 a7 call 201bc70 <_Thread_Enable_dispatch>
20179d8: b0 10 20 00 clr %i0
20179dc: 81 c7 e0 08 ret
20179e0: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20179e4: 81 c7 e0 08 ret
20179e8: 91 e8 20 04 restore %g0, 4, %o0
02017ef0 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2017ef0: 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;
2017ef4: 03 00 80 ee sethi %hi(0x203b800), %g1
2017ef8: fa 00 60 04 ld [ %g1 + 4 ], %i5 ! 203b804 <_Timer_server>
if ( !timer_server )
2017efc: 80 a7 60 00 cmp %i5, 0
2017f00: 02 80 00 08 be 2017f20 <rtems_timer_server_fire_when+0x30>
2017f04: 82 10 20 0e mov 0xe, %g1
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
2017f08: 39 00 80 ed sethi %hi(0x203b400), %i4
2017f0c: 82 17 20 38 or %i4, 0x38, %g1 ! 203b438 <_TOD>
2017f10: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2
2017f14: 80 a0 a0 00 cmp %g2, 0
2017f18: 12 80 00 04 bne 2017f28 <rtems_timer_server_fire_when+0x38><== ALWAYS TAKEN
2017f1c: 82 10 20 0b mov 0xb, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2017f20: 81 c7 e0 08 ret
2017f24: 91 e8 00 01 restore %g0, %g1, %o0
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
return RTEMS_NOT_DEFINED;
if ( !routine )
2017f28: 80 a6 a0 00 cmp %i2, 0
2017f2c: 02 bf ff fd be 2017f20 <rtems_timer_server_fire_when+0x30>
2017f30: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
2017f34: 7f ff f3 24 call 2014bc4 <_TOD_Validate>
2017f38: 90 10 00 19 mov %i1, %o0
2017f3c: 80 8a 20 ff btst 0xff, %o0
2017f40: 12 80 00 04 bne 2017f50 <rtems_timer_server_fire_when+0x60>
2017f44: 82 10 20 14 mov 0x14, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2017f48: 81 c7 e0 08 ret
2017f4c: 91 e8 00 01 restore %g0, %g1, %o0
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
return RTEMS_INVALID_CLOCK;
seconds = _TOD_To_seconds( wall_time );
2017f50: 7f ff f2 e3 call 2014adc <_TOD_To_seconds>
2017f54: 90 10 00 19 mov %i1, %o0
2017f58: b2 10 00 08 mov %o0, %i1
2017f5c: d0 1f 20 38 ldd [ %i4 + 0x38 ], %o0
2017f60: 94 10 20 00 clr %o2
2017f64: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2017f68: 40 00 4e 65 call 202b8fc <__divdi3>
2017f6c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
if ( seconds <= _TOD_Seconds_since_epoch() )
2017f70: 80 a6 40 09 cmp %i1, %o1
2017f74: 08 bf ff f5 bleu 2017f48 <rtems_timer_server_fire_when+0x58>
2017f78: 82 10 20 14 mov 0x14, %g1
2017f7c: 92 10 00 18 mov %i0, %o1
2017f80: 11 00 80 ed sethi %hi(0x203b400), %o0
2017f84: 94 07 bf fc add %fp, -4, %o2
2017f88: 40 00 0b 3b call 201ac74 <_Objects_Get>
2017f8c: 90 12 23 c4 or %o0, 0x3c4, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2017f90: c2 07 bf fc ld [ %fp + -4 ], %g1
2017f94: 80 a0 60 00 cmp %g1, 0
2017f98: 12 80 00 19 bne 2017ffc <rtems_timer_server_fire_when+0x10c>
2017f9c: a0 10 00 08 mov %o0, %l0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
2017fa0: 40 00 13 a2 call 201ce28 <_Watchdog_Remove>
2017fa4: 90 02 20 10 add %o0, 0x10, %o0
2017fa8: d0 1f 20 38 ldd [ %i4 + 0x38 ], %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
2017fac: 82 10 20 03 mov 3, %g1
2017fb0: 94 10 20 00 clr %o2
2017fb4: c2 24 20 38 st %g1, [ %l0 + 0x38 ]
2017fb8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2017fbc: c0 24 20 18 clr [ %l0 + 0x18 ]
2017fc0: 96 12 e2 00 or %o3, 0x200, %o3
the_watchdog->routine = routine;
2017fc4: f4 24 20 2c st %i2, [ %l0 + 0x2c ]
the_watchdog->id = id;
2017fc8: f0 24 20 30 st %i0, [ %l0 + 0x30 ]
2017fcc: 40 00 4e 4c call 202b8fc <__divdi3>
2017fd0: f6 24 20 34 st %i3, [ %l0 + 0x34 ]
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
(*timer_server->schedule_operation)( timer_server, the_timer );
2017fd4: c2 07 60 04 ld [ %i5 + 4 ], %g1
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2017fd8: b2 26 40 09 sub %i1, %o1, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
2017fdc: 90 10 00 1d mov %i5, %o0
2017fe0: 92 10 00 10 mov %l0, %o1
2017fe4: 9f c0 40 00 call %g1
2017fe8: f2 24 20 1c st %i1, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
2017fec: 40 00 0f 21 call 201bc70 <_Thread_Enable_dispatch>
2017ff0: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2017ff4: 10 bf ff cb b 2017f20 <rtems_timer_server_fire_when+0x30>
2017ff8: 82 10 20 00 clr %g1 ! 0 <PROM_START>
#endif
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2017ffc: 10 bf ff c9 b 2017f20 <rtems_timer_server_fire_when+0x30>
2018000: 82 10 20 04 mov 4, %g1