RTEMS 4.11Annotated Report
Thu Dec 20 17:40:43 2012
40007d08 <_API_extensions_Add_post_switch>:
*/
RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain(
const Chain_Node *node
)
{
return (node->next == NULL) && (node->previous == NULL);
40007d08: c2 02 00 00 ld [ %o0 ], %g1
40007d0c: 80 a0 60 00 cmp %g1, 0
40007d10: 22 80 00 04 be,a 40007d20 <_API_extensions_Add_post_switch+0x18>
40007d14: c2 02 20 04 ld [ %o0 + 4 ], %g1
40007d18: 81 c3 e0 08 retl
40007d1c: 01 00 00 00 nop
40007d20: 80 a0 60 00 cmp %g1, 0
40007d24: 12 bf ff fd bne 40007d18 <_API_extensions_Add_post_switch+0x10><== NEVER TAKEN
40007d28: 03 10 00 76 sethi %hi(0x4001d800), %g1
Chain_Control *the_chain,
Chain_Node *the_node
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
40007d2c: 82 10 60 90 or %g1, 0x90, %g1 ! 4001d890 <_API_extensions_Post_switch_list>
40007d30: c4 00 60 08 ld [ %g1 + 8 ], %g2
the_node->next = tail;
40007d34: 86 00 60 04 add %g1, 4, %g3
tail->previous = the_node;
40007d38: d0 20 60 08 st %o0, [ %g1 + 8 ]
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
the_node->next = tail;
40007d3c: c6 22 00 00 st %g3, [ %o0 ]
tail->previous = the_node;
old_last->next = the_node;
40007d40: d0 20 80 00 st %o0, [ %g2 ]
the_node->previous = old_last;
40007d44: 81 c3 e0 08 retl
40007d48: c4 22 20 04 st %g2, [ %o0 + 4 ]
40007d4c <_API_extensions_Run_postdriver>:
}
}
#endif
void _API_extensions_Run_postdriver( void )
{
40007d4c: 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;
40007d50: 39 10 00 76 sethi %hi(0x4001d800), %i4
40007d54: fa 07 21 d8 ld [ %i4 + 0x1d8 ], %i5 ! 4001d9d8 <_API_extensions_List>
40007d58: b8 17 21 d8 or %i4, 0x1d8, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
40007d5c: b8 07 20 04 add %i4, 4, %i4
40007d60: 80 a7 40 1c cmp %i5, %i4
40007d64: 02 80 00 09 be 40007d88 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
40007d68: 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)();
40007d6c: c2 07 60 08 ld [ %i5 + 8 ], %g1
40007d70: 9f c0 40 00 call %g1
40007d74: 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 ) {
40007d78: 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 );
40007d7c: 80 a7 40 1c cmp %i5, %i4
40007d80: 32 bf ff fc bne,a 40007d70 <_API_extensions_Run_postdriver+0x24><== NEVER TAKEN
40007d84: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
40007d88: 81 c7 e0 08 ret
40007d8c: 81 e8 00 00 restore
400111c4 <_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
)
{
400111c4: 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;
400111c8: 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;
400111cc: f4 26 20 44 st %i2, [ %i0 + 0x44 ]
/*
* Check if allocated_message_size is aligned to uintptr-size boundary.
* If not, it will increase allocated_message_size to multiplicity of pointer
* size.
*/
if (allocated_message_size & (sizeof(uintptr_t) - 1)) {
400111d0: 80 8e e0 03 btst 3, %i3
400111d4: 02 80 00 0b be 40011200 <_CORE_message_queue_Initialize+0x3c>
400111d8: f6 26 20 4c st %i3, [ %i0 + 0x4c ]
allocated_message_size += sizeof(uintptr_t);
400111dc: 96 06 e0 04 add %i3, 4, %o3
allocated_message_size &= ~(sizeof(uintptr_t) - 1);
400111e0: 96 0a ff fc and %o3, -4, %o3
/*
* Check for an overflow. It can occur while increasing allocated_message_size
* to multiplicity of uintptr_t above.
*/
if (allocated_message_size < maximum_message_size)
400111e4: 80 a6 c0 0b cmp %i3, %o3
400111e8: 08 80 00 08 bleu 40011208 <_CORE_message_queue_Initialize+0x44>
400111ec: ba 02 e0 10 add %o3, 0x10, %i5
return false;
400111f0: b0 10 20 00 clr %i0
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
400111f4: b0 0e 20 01 and %i0, 1, %i0
400111f8: 81 c7 e0 08 ret
400111fc: 81 e8 00 00 restore
/*
* Check if allocated_message_size is aligned to uintptr-size boundary.
* If not, it will increase allocated_message_size to multiplicity of pointer
* size.
*/
if (allocated_message_size & (sizeof(uintptr_t) - 1)) {
40011200: 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(
40011204: ba 02 e0 10 add %o3, 0x10, %i5
size_t a,
size_t b,
size_t *c
)
{
long long x = (long long)a*b;
40011208: 90 10 20 00 clr %o0
4001120c: 92 10 00 1a mov %i2, %o1
40011210: 94 10 20 00 clr %o2
40011214: 40 00 3f 28 call 40020eb4 <__muldi3>
40011218: 96 10 00 1d mov %i5, %o3
if ( x > SIZE_MAX )
4001121c: 80 a2 20 00 cmp %o0, 0
40011220: 34 bf ff f5 bg,a 400111f4 <_CORE_message_queue_Initialize+0x30>
40011224: 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 );
40011228: 40 00 0c 92 call 40014470 <_Workspace_Allocate>
4001122c: 90 10 00 09 mov %o1, %o0
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
40011230: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
40011234: 80 a2 20 00 cmp %o0, 0
40011238: 02 bf ff ee be 400111f0 <_CORE_message_queue_Initialize+0x2c><== NEVER TAKEN
4001123c: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
40011240: 90 06 20 60 add %i0, 0x60, %o0
40011244: 94 10 00 1a mov %i2, %o2
40011248: 7f ff ff c6 call 40011160 <_Chain_Initialize>
4001124c: 96 10 00 1d mov %i5, %o3
*/
RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority(
CORE_message_queue_Attributes *the_attribute
)
{
return
40011250: 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 );
40011254: 82 06 20 50 add %i0, 0x50, %g1
40011258: 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(
4001125c: 80 a0 00 02 cmp %g0, %g2
40011260: 84 06 20 54 add %i0, 0x54, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
40011264: 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;
40011268: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
4001126c: 90 10 00 18 mov %i0, %o0
head->previous = NULL;
40011270: c0 26 20 54 clr [ %i0 + 0x54 ]
40011274: 92 60 3f ff subx %g0, -1, %o1
40011278: 94 10 20 80 mov 0x80, %o2
4001127c: 96 10 20 06 mov 6, %o3
40011280: 40 00 0a 2d call 40013b34 <_Thread_queue_Initialize>
40011284: b0 10 20 01 mov 1, %i0
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
40011288: b0 0e 20 01 and %i0, 1, %i0
4001128c: 81 c7 e0 08 ret
40011290: 81 e8 00 00 restore
400080ac <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
400080ac: 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 )
400080b0: 3b 10 00 76 sethi %hi(0x4001d800), %i5
400080b4: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 ! 4001d820 <_Thread_Dispatch_disable_level>
400080b8: 80 a0 60 00 cmp %g1, 0
400080bc: 02 80 00 1f be 40008138 <_CORE_mutex_Seize+0x8c>
400080c0: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
400080c4: 80 a6 a0 00 cmp %i2, 0
400080c8: 02 80 00 2c be 40008178 <_CORE_mutex_Seize+0xcc>
400080cc: 90 10 00 18 mov %i0, %o0
400080d0: 03 10 00 76 sethi %hi(0x4001d800), %g1
400080d4: c2 00 62 1c ld [ %g1 + 0x21c ], %g1 ! 4001da1c <_System_state_Current>
400080d8: 80 a0 60 01 cmp %g1, 1
400080dc: 38 80 00 2e bgu,a 40008194 <_CORE_mutex_Seize+0xe8>
400080e0: 90 10 20 00 clr %o0
400080e4: 40 00 12 3a call 4000c9cc <_CORE_mutex_Seize_interrupt_trylock>
400080e8: 92 07 a0 54 add %fp, 0x54, %o1
400080ec: 80 a2 20 00 cmp %o0, 0
400080f0: 02 80 00 27 be 4000818c <_CORE_mutex_Seize+0xe0> <== ALWAYS TAKEN
400080f4: 01 00 00 00 nop
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
400080f8: c4 07 60 20 ld [ %i5 + 0x20 ], %g2
400080fc: 03 10 00 76 sethi %hi(0x4001d800), %g1
40008100: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 ! 4001da30 <_Per_CPU_Information+0x10>
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;
40008104: 86 10 20 01 mov 1, %g3
40008108: c6 26 20 30 st %g3, [ %i0 + 0x30 ]
4000810c: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
40008110: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
++level;
40008114: 82 00 a0 01 add %g2, 1, %g1
_Thread_Dispatch_disable_level = level;
40008118: c2 27 60 20 st %g1, [ %i5 + 0x20 ]
4000811c: 7f ff e7 e6 call 400020b4 <sparc_enable_interrupts>
40008120: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
40008124: 90 10 00 18 mov %i0, %o0
40008128: 7f ff ff ba call 40008010 <_CORE_mutex_Seize_interrupt_blocking>
4000812c: 92 10 00 1b mov %i3, %o1
40008130: 81 c7 e0 08 ret
40008134: 81 e8 00 00 restore
40008138: 90 10 00 18 mov %i0, %o0
4000813c: 40 00 12 24 call 4000c9cc <_CORE_mutex_Seize_interrupt_trylock>
40008140: 92 07 a0 54 add %fp, 0x54, %o1
40008144: 80 a2 20 00 cmp %o0, 0
40008148: 02 bf ff fa be 40008130 <_CORE_mutex_Seize+0x84>
4000814c: 80 a6 a0 00 cmp %i2, 0
40008150: 12 bf ff ea bne 400080f8 <_CORE_mutex_Seize+0x4c>
40008154: 01 00 00 00 nop
40008158: 7f ff e7 d7 call 400020b4 <sparc_enable_interrupts>
4000815c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
40008160: 03 10 00 76 sethi %hi(0x4001d800), %g1
40008164: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 ! 4001da30 <_Per_CPU_Information+0x10>
40008168: 84 10 20 01 mov 1, %g2
4000816c: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
40008170: 81 c7 e0 08 ret
40008174: 81 e8 00 00 restore
40008178: 40 00 12 15 call 4000c9cc <_CORE_mutex_Seize_interrupt_trylock>
4000817c: 92 07 a0 54 add %fp, 0x54, %o1
40008180: 80 a2 20 00 cmp %o0, 0
40008184: 12 bf ff f5 bne 40008158 <_CORE_mutex_Seize+0xac> <== NEVER TAKEN
40008188: 01 00 00 00 nop
4000818c: 81 c7 e0 08 ret
40008190: 81 e8 00 00 restore
40008194: 92 10 20 00 clr %o1
40008198: 40 00 01 c1 call 4000889c <_Internal_error_Occurred>
4000819c: 94 10 20 12 mov 0x12, %o2
4000831c <_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
)
{
4000831c: 9d e3 bf a0 save %sp, -96, %sp
40008320: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
40008324: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
40008328: 40 00 07 90 call 4000a168 <_Thread_queue_Dequeue>
4000832c: 90 10 00 1d mov %i5, %o0
40008330: 80 a2 20 00 cmp %o0, 0
40008334: 02 80 00 04 be 40008344 <_CORE_semaphore_Surrender+0x28>
40008338: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
4000833c: 81 c7 e0 08 ret
40008340: 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 );
40008344: 7f ff e7 58 call 400020a4 <sparc_disable_interrupts>
40008348: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
4000834c: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
40008350: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
40008354: 80 a0 40 02 cmp %g1, %g2
40008358: 1a 80 00 05 bcc 4000836c <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
4000835c: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
40008360: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
40008364: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
40008368: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
4000836c: 7f ff e7 52 call 400020b4 <sparc_enable_interrupts>
40008370: 01 00 00 00 nop
}
return status;
}
40008374: 81 c7 e0 08 ret
40008378: 81 e8 00 00 restore
40007edc <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
40007edc: 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;
40007ee0: 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 );
40007ee4: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
40007ee8: 80 a6 a0 00 cmp %i2, 0
40007eec: 02 80 00 13 be 40007f38 <_Chain_Initialize+0x5c> <== NEVER TAKEN
40007ef0: 92 06 bf ff add %i2, -1, %o1
40007ef4: 86 10 00 09 mov %o1, %g3
40007ef8: 82 10 00 19 mov %i1, %g1
40007efc: 84 10 00 18 mov %i0, %g2
current->next = next;
40007f00: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
40007f04: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
40007f08: 86 00 ff ff add %g3, -1, %g3
40007f0c: 84 10 00 01 mov %g1, %g2
40007f10: 80 a0 ff ff cmp %g3, -1
40007f14: 12 bf ff fb bne 40007f00 <_Chain_Initialize+0x24>
40007f18: 82 00 40 1b add %g1, %i3, %g1
#include <rtems/system.h>
#include <rtems/score/address.h>
#include <rtems/score/chain.h>
#include <rtems/score/isr.h>
void _Chain_Initialize(
40007f1c: 40 00 3e 70 call 400178dc <.umul>
40007f20: 90 10 00 1b mov %i3, %o0
40007f24: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
40007f28: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
40007f2c: d0 26 20 08 st %o0, [ %i0 + 8 ]
40007f30: 81 c7 e0 08 ret
40007f34: 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;
40007f38: 10 bf ff fc b 40007f28 <_Chain_Initialize+0x4c> <== NOT EXECUTED
40007f3c: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED
40006ef8 <_Event_Surrender>:
rtems_event_set event_in,
Event_Control *event,
Thread_blocking_operation_States *sync_state,
States_Control wait_state
)
{
40006ef8: 9d e3 bf a0 save %sp, -96, %sp
rtems_event_set seized_events;
rtems_option option_set;
option_set = the_thread->Wait.option;
_ISR_Disable( level );
40006efc: 7f ff ec 6a call 400020a4 <sparc_disable_interrupts>
40006f00: fa 06 20 30 ld [ %i0 + 0x30 ], %i5
RTEMS_INLINE_ROUTINE void _Event_sets_Post(
rtems_event_set the_new_events,
rtems_event_set *the_event_set
)
{
*the_event_set |= the_new_events;
40006f04: c2 06 80 00 ld [ %i2 ], %g1
40006f08: b2 16 40 01 or %i1, %g1, %i1
40006f0c: f2 26 80 00 st %i1, [ %i2 ]
_Event_sets_Post( event_in, &event->pending_events );
pending_events = event->pending_events;
event_condition = the_thread->Wait.count;
40006f10: 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 ) ) {
40006f14: 84 8e 40 01 andcc %i1, %g1, %g2
40006f18: 02 80 00 35 be 40006fec <_Event_Surrender+0xf4>
40006f1c: 07 10 00 76 sethi %hi(0x4001d800), %g3
/*
* 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() &&
40006f20: 86 10 e2 20 or %g3, 0x220, %g3 ! 4001da20 <_Per_CPU_Information>
40006f24: c8 00 e0 08 ld [ %g3 + 8 ], %g4
40006f28: 80 a1 20 00 cmp %g4, 0
40006f2c: 32 80 00 1c bne,a 40006f9c <_Event_Surrender+0xa4>
40006f30: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
RTEMS_INLINE_ROUTINE bool _States_Are_set (
States_Control the_states,
States_Control mask
)
{
return ( (the_states & mask) != STATES_READY);
40006f34: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
}
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Are_set( the_thread->current_state, wait_state ) ) {
40006f38: 80 8f 00 03 btst %i4, %g3
40006f3c: 02 80 00 2c be 40006fec <_Event_Surrender+0xf4>
40006f40: 80 a0 40 02 cmp %g1, %g2
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
40006f44: 02 80 00 04 be 40006f54 <_Event_Surrender+0x5c>
40006f48: 80 8f 60 02 btst 2, %i5
40006f4c: 02 80 00 28 be 40006fec <_Event_Surrender+0xf4> <== NEVER TAKEN
40006f50: 01 00 00 00 nop
event->pending_events = _Event_sets_Clear(
pending_events,
seized_events
);
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
40006f54: 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) );
40006f58: b2 2e 40 02 andn %i1, %g2, %i1
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Are_set( the_thread->current_state, wait_state ) ) {
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
event->pending_events = _Event_sets_Clear(
40006f5c: f2 26 80 00 st %i1, [ %i2 ]
pending_events,
seized_events
);
the_thread->Wait.count = 0;
40006f60: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
40006f64: c4 20 40 00 st %g2, [ %g1 ]
_ISR_Flash( level );
40006f68: 7f ff ec 53 call 400020b4 <sparc_enable_interrupts>
40006f6c: 01 00 00 00 nop
40006f70: 7f ff ec 4d call 400020a4 <sparc_disable_interrupts>
40006f74: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
40006f78: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
40006f7c: 80 a0 60 02 cmp %g1, 2
40006f80: 02 80 00 1d be 40006ff4 <_Event_Surrender+0xfc>
40006f84: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
40006f88: 7f ff ec 4b call 400020b4 <sparc_enable_interrupts>
40006f8c: 33 04 01 ff sethi %hi(0x1007fc00), %i1
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
40006f90: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <RAM_SIZE+0xfc7fff8>
40006f94: 40 00 0a b9 call 40009a78 <_Thread_Clear_state>
40006f98: 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() &&
40006f9c: 80 a6 00 03 cmp %i0, %g3
40006fa0: 32 bf ff e6 bne,a 40006f38 <_Event_Surrender+0x40>
40006fa4: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
_Thread_Is_executing( the_thread ) &&
((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
40006fa8: c6 06 c0 00 ld [ %i3 ], %g3
40006fac: 86 00 ff ff add %g3, -1, %g3
/*
* 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 ) &&
40006fb0: 80 a0 e0 01 cmp %g3, 1
40006fb4: 38 bf ff e1 bgu,a 40006f38 <_Event_Surrender+0x40>
40006fb8: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
40006fbc: 80 a0 40 02 cmp %g1, %g2
40006fc0: 02 80 00 04 be 40006fd0 <_Event_Surrender+0xd8>
40006fc4: 80 8f 60 02 btst 2, %i5
40006fc8: 02 80 00 09 be 40006fec <_Event_Surrender+0xf4> <== NEVER TAKEN
40006fcc: 01 00 00 00 nop
event->pending_events = _Event_sets_Clear(
pending_events,
seized_events
);
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
40006fd0: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
40006fd4: b2 2e 40 02 andn %i1, %g2, %i1
if ( _ISR_Is_in_progress() &&
_Thread_Is_executing( the_thread ) &&
((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(*sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
event->pending_events = _Event_sets_Clear(
40006fd8: f2 26 80 00 st %i1, [ %i2 ]
pending_events,
seized_events
);
the_thread->Wait.count = 0;
40006fdc: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
40006fe0: c4 20 40 00 st %g2, [ %g1 ]
*sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
40006fe4: 82 10 20 03 mov 3, %g1
40006fe8: c2 26 c0 00 st %g1, [ %i3 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
40006fec: 7f ff ec 32 call 400020b4 <sparc_enable_interrupts>
40006ff0: 91 e8 00 08 restore %g0, %o0, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
40006ff4: 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 );
40006ff8: 7f ff ec 2f call 400020b4 <sparc_enable_interrupts>
40006ffc: 33 04 01 ff sethi %hi(0x1007fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
40007000: 40 00 0f 19 call 4000ac64 <_Watchdog_Remove>
40007004: 90 06 20 48 add %i0, 0x48, %o0
40007008: b2 16 63 f8 or %i1, 0x3f8, %i1
4000700c: 40 00 0a 9b call 40009a78 <_Thread_Clear_state>
40007010: 81 e8 00 00 restore
40007014 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *arg
)
{
40007014: 9d e3 bf 98 save %sp, -104, %sp
ISR_Level level;
Thread_blocking_operation_States *sync_state;
sync_state = arg;
the_thread = _Thread_Get( id, &location );
40007018: 90 10 00 18 mov %i0, %o0
4000701c: 40 00 0b 90 call 40009e5c <_Thread_Get>
40007020: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
40007024: c2 07 bf fc ld [ %fp + -4 ], %g1
40007028: 80 a0 60 00 cmp %g1, 0
4000702c: 12 80 00 15 bne 40007080 <_Event_Timeout+0x6c> <== NEVER TAKEN
40007030: 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 );
40007034: 7f ff ec 1c call 400020a4 <sparc_disable_interrupts>
40007038: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
4000703c: 03 10 00 76 sethi %hi(0x4001d800), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
40007040: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 ! 4001da30 <_Per_CPU_Information+0x10>
40007044: 80 a7 40 01 cmp %i5, %g1
40007048: 02 80 00 10 be 40007088 <_Event_Timeout+0x74>
4000704c: c0 27 60 24 clr [ %i5 + 0x24 ]
if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
*sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
40007050: 82 10 20 06 mov 6, %g1
40007054: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
40007058: 7f ff ec 17 call 400020b4 <sparc_enable_interrupts>
4000705c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
40007060: 90 10 00 1d mov %i5, %o0
40007064: 13 04 01 ff sethi %hi(0x1007fc00), %o1
40007068: 40 00 0a 84 call 40009a78 <_Thread_Clear_state>
4000706c: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1007fff8 <RAM_SIZE+0xfc7fff8>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
40007070: 03 10 00 76 sethi %hi(0x4001d800), %g1
40007074: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 4001d820 <_Thread_Dispatch_disable_level>
--level;
40007078: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
4000707c: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
40007080: 81 c7 e0 08 ret
40007084: 81 e8 00 00 restore
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
if ( *sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
40007088: c2 06 40 00 ld [ %i1 ], %g1
4000708c: 80 a0 60 01 cmp %g1, 1
40007090: 12 bf ff f1 bne 40007054 <_Event_Timeout+0x40>
40007094: 82 10 20 06 mov 6, %g1
*sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
40007098: 82 10 20 02 mov 2, %g1
4000709c: 10 bf ff ed b 40007050 <_Event_Timeout+0x3c>
400070a0: c2 26 40 00 st %g1, [ %i1 ]
4000cb0c <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
4000cb0c: 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
4000cb10: a2 06 60 04 add %i1, 4, %l1
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
4000cb14: 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 ) {
4000cb18: 80 a6 40 11 cmp %i1, %l1
4000cb1c: 18 80 00 85 bgu 4000cd30 <_Heap_Allocate_aligned_with_boundary+0x224>
4000cb20: ea 06 20 10 ld [ %i0 + 0x10 ], %l5
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
4000cb24: 80 a6 e0 00 cmp %i3, 0
4000cb28: 12 80 00 7c bne 4000cd18 <_Heap_Allocate_aligned_with_boundary+0x20c>
4000cb2c: 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;
4000cb30: 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 ) {
4000cb34: 80 a4 00 1d cmp %l0, %i5
4000cb38: 02 80 00 18 be 4000cb98 <_Heap_Allocate_aligned_with_boundary+0x8c>
4000cb3c: 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;
4000cb40: 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
4000cb44: ae 05 60 07 add %l5, 7, %l7
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
4000cb48: ac 25 80 19 sub %l6, %i1, %l6
4000cb4c: 10 80 00 0b b 4000cb78 <_Heap_Allocate_aligned_with_boundary+0x6c>
4000cb50: 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 ) {
4000cb54: 12 80 00 18 bne 4000cbb4 <_Heap_Allocate_aligned_with_boundary+0xa8>
4000cb58: b0 07 60 08 add %i5, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
4000cb5c: 80 a6 20 00 cmp %i0, 0
4000cb60: 12 80 00 4d bne 4000cc94 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN
4000cb64: b8 07 20 01 inc %i4
break;
}
block = block->next;
4000cb68: 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 ) {
4000cb6c: 80 a4 00 1d cmp %l0, %i5
4000cb70: 22 80 00 0b be,a 4000cb9c <_Heap_Allocate_aligned_with_boundary+0x90>
4000cb74: 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 ) {
4000cb78: c2 07 60 04 ld [ %i5 + 4 ], %g1
4000cb7c: 80 a4 40 01 cmp %l1, %g1
4000cb80: 0a bf ff f5 bcs 4000cb54 <_Heap_Allocate_aligned_with_boundary+0x48>
4000cb84: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
4000cb88: 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 ) {
4000cb8c: 80 a4 00 1d cmp %l0, %i5
4000cb90: 12 bf ff fa bne 4000cb78 <_Heap_Allocate_aligned_with_boundary+0x6c>
4000cb94: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
4000cb98: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
4000cb9c: 80 a0 40 1c cmp %g1, %i4
4000cba0: 1a 80 00 03 bcc 4000cbac <_Heap_Allocate_aligned_with_boundary+0xa0>
4000cba4: b0 10 20 00 clr %i0
stats->max_search = search_count;
4000cba8: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
}
return (void *) alloc_begin;
4000cbac: 81 c7 e0 08 ret
4000cbb0: 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;
4000cbb4: 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;
4000cbb8: 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;
4000cbbc: 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;
4000cbc0: 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;
4000cbc4: 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);
4000cbc8: 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;
4000cbcc: 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
4000cbd0: a4 00 80 12 add %g2, %l2, %l2
4000cbd4: 40 00 2c 28 call 40017c74 <.urem>
4000cbd8: 90 10 00 18 mov %i0, %o0
4000cbdc: 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 ) {
4000cbe0: 80 a4 80 18 cmp %l2, %i0
4000cbe4: 1a 80 00 06 bcc 4000cbfc <_Heap_Allocate_aligned_with_boundary+0xf0>
4000cbe8: a6 07 60 08 add %i5, 8, %l3
4000cbec: 90 10 00 12 mov %l2, %o0
4000cbf0: 40 00 2c 21 call 40017c74 <.urem>
4000cbf4: 92 10 00 1a mov %i2, %o1
4000cbf8: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
4000cbfc: 80 a6 e0 00 cmp %i3, 0
4000cc00: 02 80 00 37 be 4000ccdc <_Heap_Allocate_aligned_with_boundary+0x1d0>
4000cc04: 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;
4000cc08: 86 06 00 19 add %i0, %i1, %g3
4000cc0c: 92 10 00 1b mov %i3, %o1
4000cc10: 90 10 00 03 mov %g3, %o0
4000cc14: 40 00 2c 18 call 40017c74 <.urem>
4000cc18: c6 27 bf f8 st %g3, [ %fp + -8 ]
4000cc1c: c6 07 bf f8 ld [ %fp + -8 ], %g3
4000cc20: 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 ) {
4000cc24: 80 a6 00 08 cmp %i0, %o0
4000cc28: 1a 80 00 2c bcc 4000ccd8 <_Heap_Allocate_aligned_with_boundary+0x1cc>
4000cc2c: a4 04 c0 19 add %l3, %i1, %l2
4000cc30: 80 a2 00 03 cmp %o0, %g3
4000cc34: 2a 80 00 12 bcs,a 4000cc7c <_Heap_Allocate_aligned_with_boundary+0x170>
4000cc38: 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 ) {
4000cc3c: 10 80 00 28 b 4000ccdc <_Heap_Allocate_aligned_with_boundary+0x1d0>
4000cc40: 80 a4 c0 18 cmp %l3, %i0
4000cc44: 92 10 00 1a mov %i2, %o1
4000cc48: 40 00 2c 0b call 40017c74 <.urem>
4000cc4c: 90 10 00 18 mov %i0, %o0
4000cc50: 92 10 00 1b mov %i3, %o1
4000cc54: 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;
4000cc58: ac 06 00 19 add %i0, %i1, %l6
4000cc5c: 40 00 2c 06 call 40017c74 <.urem>
4000cc60: 90 10 00 16 mov %l6, %o0
4000cc64: 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 ) {
4000cc68: 80 a2 00 16 cmp %o0, %l6
4000cc6c: 1a 80 00 1b bcc 4000ccd8 <_Heap_Allocate_aligned_with_boundary+0x1cc>
4000cc70: 80 a6 00 08 cmp %i0, %o0
4000cc74: 1a 80 00 19 bcc 4000ccd8 <_Heap_Allocate_aligned_with_boundary+0x1cc>
4000cc78: 80 a4 80 08 cmp %l2, %o0
if ( boundary_line < boundary_floor ) {
4000cc7c: 08 bf ff f2 bleu 4000cc44 <_Heap_Allocate_aligned_with_boundary+0x138>
4000cc80: b0 22 00 19 sub %o0, %i1, %i0
return 0;
4000cc84: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
4000cc88: 80 a6 20 00 cmp %i0, 0
4000cc8c: 02 bf ff b7 be 4000cb68 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN
4000cc90: 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;
4000cc94: c6 04 20 48 ld [ %l0 + 0x48 ], %g3
stats->searches += search_count;
4000cc98: 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;
4000cc9c: 86 00 e0 01 inc %g3
stats->searches += search_count;
4000cca0: 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;
4000cca4: c6 24 20 48 st %g3, [ %l0 + 0x48 ]
stats->searches += search_count;
4000cca8: c4 24 20 4c st %g2, [ %l0 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
4000ccac: 90 10 00 10 mov %l0, %o0
4000ccb0: 92 10 00 1d mov %i5, %o1
4000ccb4: 94 10 00 18 mov %i0, %o2
4000ccb8: 7f ff ee ad call 4000876c <_Heap_Block_allocate>
4000ccbc: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
4000ccc0: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
4000ccc4: 80 a0 40 1c cmp %g1, %i4
4000ccc8: 2a bf ff b9 bcs,a 4000cbac <_Heap_Allocate_aligned_with_boundary+0xa0>
4000cccc: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
4000ccd0: 81 c7 e0 08 ret
4000ccd4: 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 ) {
4000ccd8: 80 a4 c0 18 cmp %l3, %i0
4000ccdc: 18 bf ff ea bgu 4000cc84 <_Heap_Allocate_aligned_with_boundary+0x178>
4000cce0: 82 10 3f f8 mov -8, %g1
4000cce4: 90 10 00 18 mov %i0, %o0
4000cce8: a4 20 40 1d sub %g1, %i5, %l2
4000ccec: 92 10 00 15 mov %l5, %o1
4000ccf0: 40 00 2b e1 call 40017c74 <.urem>
4000ccf4: 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 ) {
4000ccf8: 90 a4 80 08 subcc %l2, %o0, %o0
4000ccfc: 02 bf ff 99 be 4000cb60 <_Heap_Allocate_aligned_with_boundary+0x54>
4000cd00: 80 a6 20 00 cmp %i0, 0
4000cd04: 80 a2 00 14 cmp %o0, %l4
4000cd08: 1a bf ff 96 bcc 4000cb60 <_Heap_Allocate_aligned_with_boundary+0x54>
4000cd0c: 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;
4000cd10: 10 bf ff de b 4000cc88 <_Heap_Allocate_aligned_with_boundary+0x17c>
4000cd14: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
4000cd18: 18 80 00 06 bgu 4000cd30 <_Heap_Allocate_aligned_with_boundary+0x224>
4000cd1c: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
4000cd20: 22 bf ff 84 be,a 4000cb30 <_Heap_Allocate_aligned_with_boundary+0x24>
4000cd24: 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;
4000cd28: 10 bf ff 83 b 4000cb34 <_Heap_Allocate_aligned_with_boundary+0x28>
4000cd2c: 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;
4000cd30: 81 c7 e0 08 ret
4000cd34: 91 e8 20 00 restore %g0, 0, %o0
4000c94c <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t unused __attribute__((unused))
)
{
4000c94c: 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;
4000c950: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
4000c954: c0 27 bf fc clr [ %fp + -4 ]
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t unused __attribute__((unused))
)
{
4000c958: b8 10 00 18 mov %i0, %i4
Heap_Statistics *const stats = &heap->stats;
Heap_Block *const first_block = heap->first_block;
4000c95c: e2 06 20 20 ld [ %i0 + 0x20 ], %l1
Heap_Block *extend_first_block = NULL;
Heap_Block *extend_last_block = NULL;
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr;
uintptr_t const extend_area_end = extend_area_begin + extend_area_size;
4000c960: a0 06 40 1a add %i1, %i2, %l0
Heap_Block *merge_above_block = NULL;
Heap_Block *link_below_block = NULL;
Heap_Block *link_above_block = NULL;
Heap_Block *extend_first_block = NULL;
Heap_Block *extend_last_block = NULL;
uintptr_t const page_size = heap->page_size;
4000c964: e4 06 20 10 ld [ %i0 + 0x10 ], %l2
uintptr_t const min_block_size = heap->min_block_size;
4000c968: 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 ) {
4000c96c: 80 a6 40 10 cmp %i1, %l0
4000c970: 08 80 00 04 bleu 4000c980 <_Heap_Extend+0x34>
4000c974: f0 06 20 30 ld [ %i0 + 0x30 ], %i0
return 0;
4000c978: 81 c7 e0 08 ret
4000c97c: 91 e8 20 00 restore %g0, 0, %o0
}
extend_area_ok = _Heap_Get_first_and_last_block(
4000c980: 90 10 00 19 mov %i1, %o0
4000c984: 92 10 00 1a mov %i2, %o1
4000c988: 94 10 00 12 mov %l2, %o2
4000c98c: 98 07 bf f8 add %fp, -8, %o4
4000c990: 7f ff ee 3e call 40008288 <_Heap_Get_first_and_last_block>
4000c994: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
4000c998: 80 8a 20 ff btst 0xff, %o0
4000c99c: 02 bf ff f7 be 4000c978 <_Heap_Extend+0x2c>
4000c9a0: ba 10 00 11 mov %l1, %i5
4000c9a4: aa 10 20 00 clr %l5
4000c9a8: ac 10 20 00 clr %l6
4000c9ac: a6 10 20 00 clr %l3
4000c9b0: 10 80 00 10 b 4000c9f0 <_Heap_Extend+0xa4>
4000c9b4: a8 10 20 00 clr %l4
return 0;
}
if ( extend_area_end == sub_area_begin ) {
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
4000c9b8: 2a 80 00 02 bcs,a 4000c9c0 <_Heap_Extend+0x74>
4000c9bc: ac 10 00 1d mov %i5, %l6
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
4000c9c0: 80 a6 c0 19 cmp %i3, %i1
4000c9c4: 22 80 00 1e be,a 4000ca3c <_Heap_Extend+0xf0>
4000c9c8: 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 ) {
4000c9cc: 80 a6 40 1b cmp %i1, %i3
4000c9d0: 38 80 00 02 bgu,a 4000c9d8 <_Heap_Extend+0x8c>
4000c9d4: 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;
4000c9d8: fa 02 20 04 ld [ %o0 + 4 ], %i5
4000c9dc: 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);
4000c9e0: 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 );
4000c9e4: 80 a4 40 1d cmp %l1, %i5
4000c9e8: 22 80 00 1c be,a 4000ca58 <_Heap_Extend+0x10c>
4000c9ec: c2 07 20 18 ld [ %i4 + 0x18 ], %g1
return 0;
}
do {
uintptr_t const sub_area_begin = (start_block != first_block) ?
(uintptr_t) start_block : heap->area_begin;
4000c9f0: 80 a7 40 11 cmp %i5, %l1
4000c9f4: 22 80 00 03 be,a 4000ca00 <_Heap_Extend+0xb4>
4000c9f8: f4 07 20 18 ld [ %i4 + 0x18 ], %i2
4000c9fc: b4 10 00 1d mov %i5, %i2
uintptr_t const sub_area_end = start_block->prev_size;
4000ca00: f6 07 40 00 ld [ %i5 ], %i3
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
4000ca04: 92 10 00 12 mov %l2, %o1
4000ca08: 40 00 15 c3 call 40012114 <.urem>
4000ca0c: 90 10 00 1b mov %i3, %o0
4000ca10: 82 06 ff f8 add %i3, -8, %g1
Heap_Block *const end_block =
_Heap_Block_of_alloc_area( sub_area_end, page_size );
if (
4000ca14: 80 a6 80 10 cmp %i2, %l0
4000ca18: 0a 80 00 64 bcs 4000cba8 <_Heap_Extend+0x25c>
4000ca1c: 90 20 40 08 sub %g1, %o0, %o0
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return 0;
}
if ( extend_area_end == sub_area_begin ) {
4000ca20: 80 a6 80 10 cmp %i2, %l0
4000ca24: 12 bf ff e5 bne 4000c9b8 <_Heap_Extend+0x6c>
4000ca28: 80 a4 00 1b cmp %l0, %i3
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 ) {
4000ca2c: 80 a6 c0 19 cmp %i3, %i1
4000ca30: 12 bf ff e7 bne 4000c9cc <_Heap_Extend+0x80> <== ALWAYS TAKEN
4000ca34: a8 10 00 1d mov %i5, %l4
start_block->prev_size = extend_area_end;
4000ca38: 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;
4000ca3c: fa 02 20 04 ld [ %o0 + 4 ], %i5
4000ca40: 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);
4000ca44: 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 );
4000ca48: 80 a4 40 1d cmp %l1, %i5
4000ca4c: 12 bf ff e9 bne 4000c9f0 <_Heap_Extend+0xa4> <== NEVER TAKEN
4000ca50: a6 10 00 08 mov %o0, %l3
if ( extend_area_begin < heap->area_begin ) {
4000ca54: c2 07 20 18 ld [ %i4 + 0x18 ], %g1
4000ca58: 80 a6 40 01 cmp %i1, %g1
4000ca5c: 3a 80 00 4e bcc,a 4000cb94 <_Heap_Extend+0x248>
4000ca60: c2 07 20 1c ld [ %i4 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
4000ca64: f2 27 20 18 st %i1, [ %i4 + 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;
4000ca68: c2 07 bf f8 ld [ %fp + -8 ], %g1
4000ca6c: 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 ) {
4000ca70: c8 07 20 20 ld [ %i4 + 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 =
4000ca74: 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;
4000ca78: e0 20 40 00 st %l0, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
4000ca7c: 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 =
4000ca80: 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;
4000ca84: 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 ) {
4000ca88: 80 a1 00 01 cmp %g4, %g1
4000ca8c: 08 80 00 3c bleu 4000cb7c <_Heap_Extend+0x230>
4000ca90: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
4000ca94: c2 27 20 20 st %g1, [ %i4 + 0x20 ]
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
4000ca98: 80 a5 20 00 cmp %l4, 0
4000ca9c: 02 80 00 47 be 4000cbb8 <_Heap_Extend+0x26c>
4000caa0: 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;
4000caa4: fa 07 20 10 ld [ %i4 + 0x10 ], %i5
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up(
uintptr_t value,
uintptr_t alignment
)
{
uintptr_t remainder = value % alignment;
4000caa8: 92 10 00 1d mov %i5, %o1
4000caac: 40 00 15 9a call 40012114 <.urem>
4000cab0: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
4000cab4: 80 a2 20 00 cmp %o0, 0
4000cab8: 02 80 00 04 be 4000cac8 <_Heap_Extend+0x17c>
4000cabc: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
4000cac0: b2 06 40 1d add %i1, %i5, %i1
4000cac4: 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 =
4000cac8: 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;
4000cacc: 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 =
4000cad0: 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;
4000cad4: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
4000cad8: 90 10 00 1c mov %i4, %o0
4000cadc: 92 10 00 01 mov %g1, %o1
4000cae0: 7f ff ff 85 call 4000c8f4 <_Heap_Free_block>
4000cae4: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
4000cae8: 80 a4 e0 00 cmp %l3, 0
4000caec: 02 80 00 3a be 4000cbd4 <_Heap_Extend+0x288>
4000caf0: 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);
4000caf4: d2 07 20 10 ld [ %i4 + 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(
4000caf8: a0 24 00 13 sub %l0, %l3, %l0
4000cafc: 40 00 15 86 call 40012114 <.urem>
4000cb00: 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)
4000cb04: c2 04 e0 04 ld [ %l3 + 4 ], %g1
4000cb08: a0 24 00 08 sub %l0, %o0, %l0
4000cb0c: 82 20 40 10 sub %g1, %l0, %g1
| HEAP_PREV_BLOCK_USED;
4000cb10: 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 =
4000cb14: 84 04 00 13 add %l0, %l3, %g2
4000cb18: 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;
4000cb1c: c2 04 e0 04 ld [ %l3 + 4 ], %g1
(last_block->size_and_flag - last_block_new_size)
| HEAP_PREV_BLOCK_USED;
_Heap_Block_set_size( last_block, last_block_new_size );
_Heap_Free_block( heap, last_block );
4000cb20: 90 10 00 1c mov %i4, %o0
4000cb24: 82 08 60 01 and %g1, 1, %g1
4000cb28: 92 10 00 13 mov %l3, %o1
block->size_and_flag = size | flag;
4000cb2c: a0 14 00 01 or %l0, %g1, %l0
4000cb30: 7f ff ff 71 call 4000c8f4 <_Heap_Free_block>
4000cb34: e0 24 e0 04 st %l0, [ %l3 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
4000cb38: 80 a4 e0 00 cmp %l3, 0
4000cb3c: 02 80 00 33 be 4000cc08 <_Heap_Extend+0x2bc>
4000cb40: 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
4000cb44: c2 07 20 24 ld [ %i4 + 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(
4000cb48: fa 07 20 20 ld [ %i4 + 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;
4000cb4c: 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;
4000cb50: c4 07 20 2c ld [ %i4 + 0x2c ], %g2
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
4000cb54: c6 07 20 30 ld [ %i4 + 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(
4000cb58: 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;
4000cb5c: 88 09 20 01 and %g4, 1, %g4
block->size_and_flag = size | flag;
4000cb60: 88 17 40 04 or %i5, %g4, %g4
4000cb64: c8 20 60 04 st %g4, [ %g1 + 4 ]
4000cb68: b0 20 c0 18 sub %g3, %i0, %i0
/* Statistics */
stats->size += extended_size;
4000cb6c: 82 00 80 18 add %g2, %i0, %g1
4000cb70: c2 27 20 2c st %g1, [ %i4 + 0x2c ]
return extended_size;
}
4000cb74: 81 c7 e0 08 ret
4000cb78: 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 ) {
4000cb7c: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
4000cb80: 80 a0 40 02 cmp %g1, %g2
4000cb84: 2a bf ff c5 bcs,a 4000ca98 <_Heap_Extend+0x14c>
4000cb88: c4 27 20 24 st %g2, [ %i4 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
4000cb8c: 10 bf ff c4 b 4000ca9c <_Heap_Extend+0x150>
4000cb90: 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 ) {
4000cb94: 80 a4 00 01 cmp %l0, %g1
4000cb98: 38 bf ff b4 bgu,a 4000ca68 <_Heap_Extend+0x11c>
4000cb9c: e0 27 20 1c st %l0, [ %i4 + 0x1c ]
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
4000cba0: 10 bf ff b3 b 4000ca6c <_Heap_Extend+0x120>
4000cba4: 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 (
4000cba8: 80 a6 40 1b cmp %i1, %i3
4000cbac: 1a bf ff 9e bcc 4000ca24 <_Heap_Extend+0xd8>
4000cbb0: 80 a6 80 10 cmp %i2, %l0
4000cbb4: 30 bf ff 71 b,a 4000c978 <_Heap_Extend+0x2c>
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 ) {
4000cbb8: 80 a5 a0 00 cmp %l6, 0
4000cbbc: 02 bf ff cc be 4000caec <_Heap_Extend+0x1a0>
4000cbc0: 80 a4 e0 00 cmp %l3, 0
{
uintptr_t const last_block_begin = (uintptr_t) last_block;
uintptr_t const link_begin = (uintptr_t) link;
last_block->size_and_flag =
(link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED;
4000cbc4: ac 25 80 02 sub %l6, %g2, %l6
4000cbc8: 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 =
4000cbcc: 10 bf ff c8 b 4000caec <_Heap_Extend+0x1a0>
4000cbd0: 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 ) {
4000cbd4: 80 a5 60 00 cmp %l5, 0
4000cbd8: 02 bf ff d8 be 4000cb38 <_Heap_Extend+0x1ec>
4000cbdc: 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;
4000cbe0: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
4000cbe4: c2 07 bf fc ld [ %fp + -4 ], %g1
4000cbe8: 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 );
4000cbec: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
4000cbf0: 84 10 80 03 or %g2, %g3, %g2
4000cbf4: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
4000cbf8: c4 00 60 04 ld [ %g1 + 4 ], %g2
4000cbfc: 84 10 a0 01 or %g2, 1, %g2
4000cc00: 10 bf ff ce b 4000cb38 <_Heap_Extend+0x1ec>
4000cc04: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
4000cc08: 32 bf ff d0 bne,a 4000cb48 <_Heap_Extend+0x1fc>
4000cc0c: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
4000cc10: d2 07 bf f8 ld [ %fp + -8 ], %o1
4000cc14: 7f ff ff 38 call 4000c8f4 <_Heap_Free_block>
4000cc18: 90 10 00 1c mov %i4, %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
4000cc1c: 10 bf ff cb b 4000cb48 <_Heap_Extend+0x1fc>
4000cc20: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
4000cd38 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
4000cd38: 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 ) {
4000cd3c: 80 a6 60 00 cmp %i1, 0
4000cd40: 02 80 00 3c be 4000ce30 <_Heap_Free+0xf8>
4000cd44: 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);
4000cd48: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
4000cd4c: 40 00 2b ca call 40017c74 <.urem>
4000cd50: 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
4000cd54: 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);
4000cd58: 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);
4000cd5c: 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;
4000cd60: 80 a2 00 02 cmp %o0, %g2
4000cd64: 0a 80 00 30 bcs 4000ce24 <_Heap_Free+0xec>
4000cd68: 82 10 20 00 clr %g1
4000cd6c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
4000cd70: 80 a2 00 04 cmp %o0, %g4
4000cd74: 38 80 00 2d bgu,a 4000ce28 <_Heap_Free+0xf0> <== NEVER TAKEN
4000cd78: b0 08 60 ff and %g1, 0xff, %i0 <== 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;
4000cd7c: f6 02 20 04 ld [ %o0 + 4 ], %i3
4000cd80: 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);
4000cd84: 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;
4000cd88: 80 a0 80 03 cmp %g2, %g3
4000cd8c: 38 80 00 27 bgu,a 4000ce28 <_Heap_Free+0xf0> <== NEVER TAKEN
4000cd90: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED
4000cd94: 80 a1 00 03 cmp %g4, %g3
4000cd98: 2a 80 00 24 bcs,a 4000ce28 <_Heap_Free+0xf0> <== NEVER TAKEN
4000cd9c: 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;
4000cda0: f8 00 e0 04 ld [ %g3 + 4 ], %i4
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
4000cda4: 80 8f 20 01 btst 1, %i4
4000cda8: 02 80 00 1f be 4000ce24 <_Heap_Free+0xec> <== NEVER TAKEN
4000cdac: 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 ));
4000cdb0: 02 80 00 23 be 4000ce3c <_Heap_Free+0x104>
4000cdb4: b8 0f 3f fe and %i4, -2, %i4
4000cdb8: 82 00 c0 1c add %g3, %i4, %g1
4000cdbc: c2 00 60 04 ld [ %g1 + 4 ], %g1
4000cdc0: 80 88 60 01 btst 1, %g1
4000cdc4: 12 80 00 1f bne 4000ce40 <_Heap_Free+0x108>
4000cdc8: 80 8e e0 01 btst 1, %i3
if ( !_Heap_Is_prev_used( block ) ) {
4000cdcc: 02 80 00 20 be 4000ce4c <_Heap_Free+0x114>
4000cdd0: 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;
4000cdd4: c4 00 e0 08 ld [ %g3 + 8 ], %g2
Heap_Block *prev = old_block->prev;
4000cdd8: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
new_block->next = next;
4000cddc: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = prev;
4000cde0: 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;
4000cde4: b8 07 00 1d add %i4, %i5, %i4
next->prev = new_block;
4000cde8: d0 20 a0 0c st %o0, [ %g2 + 0xc ]
prev->next = new_block;
4000cdec: d0 20 60 08 st %o0, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
4000cdf0: 84 17 20 01 or %i4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
4000cdf4: 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;
4000cdf8: c4 22 20 04 st %g2, [ %o0 + 4 ]
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
4000cdfc: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
4000ce00: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
stats->free_size += block_size;
4000ce04: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
4000ce08: 82 00 60 01 inc %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
4000ce0c: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
stats->free_size += block_size;
4000ce10: ba 00 c0 1d add %g3, %i5, %i5
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
4000ce14: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
4000ce18: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
stats->free_size += block_size;
4000ce1c: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
return( true );
4000ce20: 82 10 20 01 mov 1, %g1
4000ce24: b0 08 60 ff and %g1, 0xff, %i0
4000ce28: 81 c7 e0 08 ret
4000ce2c: 81 e8 00 00 restore
4000ce30: b0 08 60 ff and %g1, 0xff, %i0
4000ce34: 81 c7 e0 08 ret
4000ce38: 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 ) ) {
4000ce3c: 80 8e e0 01 btst 1, %i3
4000ce40: 32 80 00 1e bne,a 4000ceb8 <_Heap_Free+0x180>
4000ce44: 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
4000ce48: 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;
4000ce4c: 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);
4000ce50: 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;
4000ce54: 80 a0 80 1b cmp %g2, %i3
4000ce58: 18 bf ff f3 bgu 4000ce24 <_Heap_Free+0xec> <== NEVER TAKEN
4000ce5c: 82 10 20 00 clr %g1
4000ce60: 80 a1 00 1b cmp %g4, %i3
4000ce64: 2a bf ff f1 bcs,a 4000ce28 <_Heap_Free+0xf0> <== NEVER TAKEN
4000ce68: 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;
4000ce6c: 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) ) {
4000ce70: 80 88 a0 01 btst 1, %g2
4000ce74: 02 bf ff ec be 4000ce24 <_Heap_Free+0xec> <== NEVER TAKEN
4000ce78: 80 8e 60 ff btst 0xff, %i1
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
4000ce7c: 22 80 00 21 be,a 4000cf00 <_Heap_Free+0x1c8>
4000ce80: 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;
4000ce84: c2 00 e0 08 ld [ %g3 + 8 ], %g1
Heap_Block *prev = block->prev;
4000ce88: 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;
4000ce8c: c6 06 20 38 ld [ %i0 + 0x38 ], %g3
prev->next = next;
4000ce90: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
4000ce94: c4 20 60 0c st %g2, [ %g1 + 0xc ]
4000ce98: 82 00 ff ff add %g3, -1, %g1
4000ce9c: 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;
4000cea0: b8 07 40 1c add %i5, %i4, %i4
4000cea4: 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;
4000cea8: 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;
4000ceac: 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;
4000ceb0: 10 bf ff d3 b 4000cdfc <_Heap_Free+0xc4>
4000ceb4: 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;
4000ceb8: 82 17 60 01 or %i5, 1, %g1
4000cebc: c2 22 20 04 st %g1, [ %o0 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
4000cec0: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
4000cec4: f0 22 20 0c st %i0, [ %o0 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
4000cec8: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
4000cecc: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
4000ced0: 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;
4000ced4: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
4000ced8: 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;
4000cedc: 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 ) {
4000cee0: 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;
4000cee4: 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;
4000cee8: d0 26 20 08 st %o0, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
4000ceec: 80 a0 40 02 cmp %g1, %g2
4000cef0: 08 bf ff c3 bleu 4000cdfc <_Heap_Free+0xc4>
4000cef4: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
4000cef8: 10 bf ff c1 b 4000cdfc <_Heap_Free+0xc4>
4000cefc: 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;
4000cf00: 82 16 a0 01 or %i2, 1, %g1
4000cf04: c2 26 e0 04 st %g1, [ %i3 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
4000cf08: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
4000cf0c: 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;
4000cf10: 82 08 7f fe and %g1, -2, %g1
4000cf14: 10 bf ff ba b 4000cdfc <_Heap_Free+0xc4>
4000cf18: c2 20 e0 04 st %g1, [ %g3 + 4 ]
40012a04 <_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;
40012a04: 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;
40012a08: c0 22 40 00 clr [ %o1 ]
info->largest = 0;
40012a0c: c0 22 60 04 clr [ %o1 + 4 ]
info->total = 0;
40012a10: c0 22 60 08 clr [ %o1 + 8 ]
for(the_block = _Heap_Free_list_first(the_heap);
40012a14: 88 10 20 01 mov 1, %g4
40012a18: 9a 10 20 00 clr %o5
40012a1c: 80 a2 00 01 cmp %o0, %g1
40012a20: 12 80 00 04 bne 40012a30 <_Heap_Get_free_information+0x2c><== ALWAYS TAKEN
40012a24: 86 10 20 00 clr %g3
40012a28: 30 80 00 10 b,a 40012a68 <_Heap_Get_free_information+0x64><== NOT EXECUTED
40012a2c: 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;
40012a30: c4 00 60 04 ld [ %g1 + 4 ], %g2
40012a34: 98 01 20 01 add %g4, 1, %o4
40012a38: 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 )
40012a3c: 80 a0 80 0d cmp %g2, %o5
40012a40: 08 80 00 03 bleu 40012a4c <_Heap_Get_free_information+0x48>
40012a44: 86 00 c0 02 add %g3, %g2, %g3
info->largest = the_size;
40012a48: 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)
40012a4c: 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);
40012a50: 80 a2 00 01 cmp %o0, %g1
40012a54: 32 bf ff f6 bne,a 40012a2c <_Heap_Get_free_information+0x28>
40012a58: da 02 60 04 ld [ %o1 + 4 ], %o5
40012a5c: c8 22 40 00 st %g4, [ %o1 ]
40012a60: 81 c3 e0 08 retl
40012a64: c6 22 60 08 st %g3, [ %o1 + 8 ]
40012a68: 81 c3 e0 08 retl <== NOT EXECUTED
4000a388 <_Heap_Greedy_allocate>:
Heap_Block *_Heap_Greedy_allocate(
Heap_Control *heap,
const uintptr_t *block_sizes,
size_t block_count
)
{
4000a388: 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) {
4000a38c: 80 a6 a0 00 cmp %i2, 0
4000a390: 02 80 00 35 be 4000a464 <_Heap_Greedy_allocate+0xdc>
4000a394: b8 10 00 18 mov %i0, %i4
4000a398: ba 10 20 00 clr %i5
4000a39c: b6 10 20 00 clr %i3
#include "config.h"
#endif
#include <rtems/score/heap.h>
Heap_Block *_Heap_Greedy_allocate(
4000a3a0: 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 );
4000a3a4: d2 06 40 01 ld [ %i1 + %g1 ], %o1
4000a3a8: 94 10 20 00 clr %o2
4000a3ac: 96 10 20 00 clr %o3
4000a3b0: 40 00 1d 06 call 400117c8 <_Heap_Allocate_aligned_with_boundary>
4000a3b4: 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 ) {
4000a3b8: 82 92 20 00 orcc %o0, 0, %g1
4000a3bc: 22 80 00 09 be,a 4000a3e0 <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN
4000a3c0: 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);
4000a3c4: d2 07 20 10 ld [ %i4 + 0x10 ], %o1
4000a3c8: 40 00 33 18 call 40017028 <.urem>
4000a3cc: 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);
4000a3d0: 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;
4000a3d4: f6 22 20 08 st %i3, [ %o0 + 8 ]
4000a3d8: 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) {
4000a3dc: ba 07 60 01 inc %i5
4000a3e0: 80 a7 40 1a cmp %i5, %i2
4000a3e4: 12 bf ff f0 bne 4000a3a4 <_Heap_Greedy_allocate+0x1c>
4000a3e8: 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;
4000a3ec: 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 ) {
4000a3f0: 80 a7 00 1d cmp %i4, %i5
4000a3f4: 02 80 00 17 be 4000a450 <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN
4000a3f8: b0 10 20 00 clr %i0
4000a3fc: 10 80 00 03 b 4000a408 <_Heap_Greedy_allocate+0x80>
4000a400: b4 10 20 00 clr %i2
4000a404: 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;
4000a408: d6 07 60 04 ld [ %i5 + 4 ], %o3
_Heap_Block_allocate(
4000a40c: 92 10 00 1d mov %i5, %o1
4000a410: 96 0a ff fe and %o3, -2, %o3
4000a414: 94 07 60 08 add %i5, 8, %o2
4000a418: 90 10 00 1c mov %i4, %o0
4000a41c: 40 00 00 e0 call 4000a79c <_Heap_Block_allocate>
4000a420: 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;
4000a424: 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;
4000a428: 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 ) {
4000a42c: 80 a7 00 01 cmp %i4, %g1
4000a430: 12 bf ff f5 bne 4000a404 <_Heap_Greedy_allocate+0x7c>
4000a434: b4 10 00 1d mov %i5, %i2
4000a438: 10 80 00 06 b 4000a450 <_Heap_Greedy_allocate+0xc8>
4000a43c: 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 ) );
4000a440: 92 06 e0 08 add %i3, 8, %o1
4000a444: 90 10 00 1c mov %i4, %o0
4000a448: 40 00 1d 6b call 400119f4 <_Heap_Free>
4000a44c: b6 10 00 1a mov %i2, %i3
current->next = blocks;
blocks = current;
}
while ( allocated_blocks != NULL ) {
4000a450: 80 a6 e0 00 cmp %i3, 0
4000a454: 32 bf ff fb bne,a 4000a440 <_Heap_Greedy_allocate+0xb8>
4000a458: 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;
}
4000a45c: 81 c7 e0 08 ret
4000a460: 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;
4000a464: 10 bf ff e2 b 4000a3ec <_Heap_Greedy_allocate+0x64>
4000a468: b6 10 20 00 clr %i3
4000a46c <_Heap_Greedy_free>:
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
4000a46c: 9d e3 bf a0 save %sp, -96, %sp
while ( blocks != NULL ) {
4000a470: 80 a6 60 00 cmp %i1, 0
4000a474: 02 80 00 09 be 4000a498 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN
4000a478: 01 00 00 00 nop
Heap_Block *current = blocks;
blocks = blocks->next;
4000a47c: fa 06 60 08 ld [ %i1 + 8 ], %i5
_Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) );
4000a480: 92 06 60 08 add %i1, 8, %o1
4000a484: 40 00 1d 5c call 400119f4 <_Heap_Free>
4000a488: 90 10 00 18 mov %i0, %o0
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
while ( blocks != NULL ) {
4000a48c: b2 97 60 00 orcc %i5, 0, %i1
4000a490: 32 bf ff fc bne,a 4000a480 <_Heap_Greedy_free+0x14>
4000a494: fa 06 60 08 ld [ %i1 + 8 ], %i5
4000a498: 81 c7 e0 08 ret
4000a49c: 81 e8 00 00 restore
40012ad0 <_Heap_Iterate>:
void _Heap_Iterate(
Heap_Control *heap,
Heap_Block_visitor visitor,
void *visitor_arg
)
{
40012ad0: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED
Heap_Block *current = heap->first_block;
40012ad4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 <== NOT EXECUTED
Heap_Block *end = heap->last_block;
40012ad8: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 <== NOT EXECUTED
bool stop = false;
while ( !stop && current != end ) {
40012adc: 80 a0 40 1c cmp %g1, %i4 <== NOT EXECUTED
40012ae0: 32 80 00 08 bne,a 40012b00 <_Heap_Iterate+0x30> <== NOT EXECUTED
40012ae4: d2 00 60 04 ld [ %g1 + 4 ], %o1 <== NOT EXECUTED
40012ae8: 30 80 00 10 b,a 40012b28 <_Heap_Iterate+0x58> <== NOT EXECUTED
40012aec: 90 1a 20 01 xor %o0, 1, %o0 <== NOT EXECUTED
40012af0: 80 8a 20 ff btst 0xff, %o0 <== NOT EXECUTED
40012af4: 02 80 00 0d be 40012b28 <_Heap_Iterate+0x58> <== NOT EXECUTED
40012af8: 01 00 00 00 nop <== NOT EXECUTED
40012afc: d2 00 60 04 ld [ %g1 + 4 ], %o1 <== NOT EXECUTED
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 );
40012b00: 90 10 00 01 mov %g1, %o0 <== NOT EXECUTED
40012b04: 92 0a 7f fe and %o1, -2, %o1 <== NOT EXECUTED
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
40012b08: ba 00 40 09 add %g1, %o1, %i5 <== 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;
40012b0c: d4 07 60 04 ld [ %i5 + 4 ], %o2 <== NOT EXECUTED
40012b10: 96 10 00 1a mov %i2, %o3 <== NOT EXECUTED
40012b14: 9f c6 40 00 call %i1 <== NOT EXECUTED
40012b18: 94 0a a0 01 and %o2, 1, %o2 <== NOT EXECUTED
{
Heap_Block *current = heap->first_block;
Heap_Block *end = heap->last_block;
bool stop = false;
while ( !stop && current != end ) {
40012b1c: 80 a7 00 1d cmp %i4, %i5 <== NOT EXECUTED
40012b20: 12 bf ff f3 bne 40012aec <_Heap_Iterate+0x1c> <== NOT EXECUTED
40012b24: 82 10 00 1d mov %i5, %g1 <== NOT EXECUTED
40012b28: 81 c7 e0 08 ret <== NOT EXECUTED
40012b2c: 81 e8 00 00 restore <== NOT EXECUTED
4001acac <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
4001acac: 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);
4001acb0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
4001acb4: 7f ff f3 f0 call 40017c74 <.urem>
4001acb8: 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
4001acbc: 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);
4001acc0: 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);
4001acc4: 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;
4001acc8: 80 a2 00 01 cmp %o0, %g1
4001accc: 0a 80 00 16 bcs 4001ad24 <_Heap_Size_of_alloc_area+0x78>
4001acd0: 84 10 20 00 clr %g2
4001acd4: c6 06 20 24 ld [ %i0 + 0x24 ], %g3
4001acd8: 80 a2 00 03 cmp %o0, %g3
4001acdc: 18 80 00 13 bgu 4001ad28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
4001ace0: 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;
4001ace4: c8 02 20 04 ld [ %o0 + 4 ], %g4
4001ace8: 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);
4001acec: 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;
4001acf0: 80 a0 40 08 cmp %g1, %o0
4001acf4: 18 80 00 0d bgu 4001ad28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
4001acf8: 01 00 00 00 nop
4001acfc: 80 a0 c0 08 cmp %g3, %o0
4001ad00: 0a 80 00 0a bcs 4001ad28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
4001ad04: 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;
4001ad08: 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 )
4001ad0c: 80 88 60 01 btst 1, %g1
4001ad10: 02 80 00 06 be 4001ad28 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
4001ad14: 90 22 00 19 sub %o0, %i1, %o0
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
4001ad18: 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;
4001ad1c: 90 02 20 04 add %o0, 4, %o0
4001ad20: d0 26 80 00 st %o0, [ %i2 ]
4001ad24: b0 08 a0 ff and %g2, 0xff, %i0
4001ad28: 81 c7 e0 08 ret
4001ad2c: 81 e8 00 00 restore
40009204 <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
40009204: 9d e3 bf 80 save %sp, -128, %sp
uintptr_t const page_size = heap->page_size;
40009208: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
uintptr_t const min_block_size = heap->min_block_size;
4000920c: e0 06 20 14 ld [ %i0 + 0x14 ], %l0
Heap_Block *const first_block = heap->first_block;
40009210: 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;
40009214: 80 a6 a0 00 cmp %i2, 0
40009218: 02 80 00 0c be 40009248 <_Heap_Walk+0x44>
4000921c: e2 06 20 24 ld [ %i0 + 0x24 ], %l1
if ( !_System_state_Is_up( _System_state_Get() ) ) {
40009220: 03 10 00 60 sethi %hi(0x40018000), %g1
40009224: c4 00 60 cc ld [ %g1 + 0xcc ], %g2 ! 400180cc <_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;
40009228: 07 10 00 24 sethi %hi(0x40009000), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
4000922c: 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() ) ) {
40009230: 80 a0 a0 03 cmp %g2, 3
40009234: 02 80 00 0c be 40009264 <_Heap_Walk+0x60> <== ALWAYS TAKEN
40009238: ae 10 e1 a0 or %g3, 0x1a0, %l7
4000923c: b0 08 60 ff and %g1, 0xff, %i0
40009240: 81 c7 e0 08 ret
40009244: 81 e8 00 00 restore
40009248: 03 10 00 60 sethi %hi(0x40018000), %g1
4000924c: c4 00 60 cc ld [ %g1 + 0xcc ], %g2 ! 400180cc <_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;
40009250: 07 10 00 24 sethi %hi(0x40009000), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
40009254: 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() ) ) {
40009258: 80 a0 a0 03 cmp %g2, 3
4000925c: 12 bf ff f8 bne 4000923c <_Heap_Walk+0x38>
40009260: ae 10 e1 98 or %g3, 0x198, %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)(
40009264: da 06 20 18 ld [ %i0 + 0x18 ], %o5
40009268: c8 06 20 1c ld [ %i0 + 0x1c ], %g4
4000926c: c4 06 20 08 ld [ %i0 + 8 ], %g2
40009270: c2 06 20 0c ld [ %i0 + 0xc ], %g1
40009274: 90 10 00 19 mov %i1, %o0
40009278: c8 23 a0 5c st %g4, [ %sp + 0x5c ]
4000927c: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
40009280: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
40009284: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
40009288: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
4000928c: 92 10 20 00 clr %o1
40009290: 96 10 00 1b mov %i3, %o3
40009294: 15 10 00 55 sethi %hi(0x40015400), %o2
40009298: 98 10 00 10 mov %l0, %o4
4000929c: 9f c5 c0 00 call %l7
400092a0: 94 12 a3 c0 or %o2, 0x3c0, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
400092a4: 80 a6 e0 00 cmp %i3, 0
400092a8: 02 80 00 2a be 40009350 <_Heap_Walk+0x14c>
400092ac: 80 8e e0 07 btst 7, %i3
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
400092b0: 12 80 00 2f bne 4000936c <_Heap_Walk+0x168>
400092b4: 90 10 00 10 mov %l0, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
400092b8: 7f ff e2 2e call 40001b70 <.urem>
400092bc: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
400092c0: 80 a2 20 00 cmp %o0, 0
400092c4: 12 80 00 32 bne 4000938c <_Heap_Walk+0x188>
400092c8: 90 07 20 08 add %i4, 8, %o0
400092cc: 7f ff e2 29 call 40001b70 <.urem>
400092d0: 92 10 00 1b mov %i3, %o1
);
return false;
}
if (
400092d4: 80 a2 20 00 cmp %o0, 0
400092d8: 32 80 00 35 bne,a 400093ac <_Heap_Walk+0x1a8>
400092dc: 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;
400092e0: ec 07 20 04 ld [ %i4 + 4 ], %l6
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
400092e4: b4 8d a0 01 andcc %l6, 1, %i2
400092e8: 22 80 00 38 be,a 400093c8 <_Heap_Walk+0x1c4>
400092ec: 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;
400092f0: c2 04 60 04 ld [ %l1 + 4 ], %g1
400092f4: 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);
400092f8: 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;
400092fc: fa 00 60 04 ld [ %g1 + 4 ], %i5
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
40009300: 80 8f 60 01 btst 1, %i5
40009304: 02 80 00 0c be 40009334 <_Heap_Walk+0x130>
40009308: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
4000930c: 02 80 00 35 be 400093e0 <_Heap_Walk+0x1dc>
40009310: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
40009314: 92 10 20 01 mov 1, %o1
40009318: 15 10 00 56 sethi %hi(0x40015800), %o2
4000931c: 9f c5 c0 00 call %l7
40009320: 94 12 a1 38 or %o2, 0x138, %o2 ! 40015938 <__log2table+0x2d8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009324: 82 10 20 00 clr %g1
40009328: b0 08 60 ff and %g1, 0xff, %i0
4000932c: 81 c7 e0 08 ret
40009330: 81 e8 00 00 restore
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
40009334: 90 10 00 19 mov %i1, %o0
40009338: 92 10 20 01 mov 1, %o1
4000933c: 15 10 00 56 sethi %hi(0x40015800), %o2
40009340: 9f c5 c0 00 call %l7
40009344: 94 12 a1 20 or %o2, 0x120, %o2 ! 40015920 <__log2table+0x2c0>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009348: 10 bf ff f8 b 40009328 <_Heap_Walk+0x124>
4000934c: 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" );
40009350: 90 10 00 19 mov %i1, %o0
40009354: 92 10 20 01 mov 1, %o1
40009358: 15 10 00 56 sethi %hi(0x40015800), %o2
4000935c: 9f c5 c0 00 call %l7
40009360: 94 12 a0 58 or %o2, 0x58, %o2 ! 40015858 <__log2table+0x1f8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009364: 10 bf ff f1 b 40009328 <_Heap_Walk+0x124>
40009368: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
4000936c: 90 10 00 19 mov %i1, %o0
40009370: 92 10 20 01 mov 1, %o1
40009374: 15 10 00 56 sethi %hi(0x40015800), %o2
40009378: 96 10 00 1b mov %i3, %o3
4000937c: 9f c5 c0 00 call %l7
40009380: 94 12 a0 70 or %o2, 0x70, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009384: 10 bf ff e9 b 40009328 <_Heap_Walk+0x124>
40009388: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
4000938c: 90 10 00 19 mov %i1, %o0
40009390: 92 10 20 01 mov 1, %o1
40009394: 15 10 00 56 sethi %hi(0x40015800), %o2
40009398: 96 10 00 10 mov %l0, %o3
4000939c: 9f c5 c0 00 call %l7
400093a0: 94 12 a0 90 or %o2, 0x90, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
400093a4: 10 bf ff e1 b 40009328 <_Heap_Walk+0x124>
400093a8: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
400093ac: 92 10 20 01 mov 1, %o1
400093b0: 15 10 00 56 sethi %hi(0x40015800), %o2
400093b4: 96 10 00 1c mov %i4, %o3
400093b8: 9f c5 c0 00 call %l7
400093bc: 94 12 a0 b8 or %o2, 0xb8, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
400093c0: 10 bf ff da b 40009328 <_Heap_Walk+0x124>
400093c4: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
400093c8: 92 10 20 01 mov 1, %o1
400093cc: 15 10 00 56 sethi %hi(0x40015800), %o2
400093d0: 9f c5 c0 00 call %l7
400093d4: 94 12 a0 f0 or %o2, 0xf0, %o2 ! 400158f0 <__log2table+0x290>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
400093d8: 10 bf ff d4 b 40009328 <_Heap_Walk+0x124>
400093dc: 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;
400093e0: 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;
400093e4: 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 ) {
400093e8: 80 a6 00 1d cmp %i0, %i5
400093ec: 02 80 00 0d be 40009420 <_Heap_Walk+0x21c>
400093f0: 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;
400093f4: 80 a3 40 1d cmp %o5, %i5
400093f8: 28 80 00 bf bleu,a 400096f4 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN
400093fc: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
40009400: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
40009404: 92 10 20 01 mov 1, %o1
40009408: 15 10 00 56 sethi %hi(0x40015800), %o2
4000940c: 96 10 00 1d mov %i5, %o3
40009410: 9f c5 c0 00 call %l7
40009414: 94 12 a1 68 or %o2, 0x168, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009418: 10 bf ff c4 b 40009328 <_Heap_Walk+0x124>
4000941c: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
40009420: 27 10 00 56 sethi %hi(0x40015800), %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)(
40009424: 25 10 00 56 sethi %hi(0x40015800), %l2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
40009428: aa 10 00 1c mov %i4, %l5
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
4000942c: a6 14 e3 98 or %l3, 0x398, %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)(
40009430: a4 14 a3 80 or %l2, 0x380, %l2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
40009434: 29 10 00 56 sethi %hi(0x40015800), %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;
40009438: 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);
4000943c: 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;
40009440: 80 a3 40 1d cmp %o5, %i5
40009444: 28 80 00 0b bleu,a 40009470 <_Heap_Walk+0x26c> <== ALWAYS TAKEN
40009448: 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)(
4000944c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
40009450: 92 10 20 01 mov 1, %o1
40009454: 96 10 00 15 mov %l5, %o3
40009458: 15 10 00 56 sethi %hi(0x40015800), %o2
4000945c: 98 10 00 1d mov %i5, %o4
40009460: 9f c5 c0 00 call %l7
40009464: 94 12 a2 10 or %o2, 0x210, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
40009468: 10 bf ff 75 b 4000923c <_Heap_Walk+0x38>
4000946c: 82 10 20 00 clr %g1
40009470: 80 a3 c0 1d cmp %o7, %i5
40009474: 0a bf ff f7 bcs 40009450 <_Heap_Walk+0x24c>
40009478: 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;
4000947c: 9e 1d 40 11 xor %l5, %l1, %o7
40009480: 80 a0 00 0f cmp %g0, %o7
40009484: 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;
40009488: 90 10 00 16 mov %l6, %o0
4000948c: da 27 bf fc st %o5, [ %fp + -4 ]
40009490: 7f ff e1 b8 call 40001b70 <.urem>
40009494: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
40009498: 80 a2 20 00 cmp %o0, 0
4000949c: 02 80 00 18 be 400094fc <_Heap_Walk+0x2f8>
400094a0: da 07 bf fc ld [ %fp + -4 ], %o5
400094a4: 80 8b 60 ff btst 0xff, %o5
400094a8: 12 80 00 8b bne 400096d4 <_Heap_Walk+0x4d0>
400094ac: 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;
400094b0: de 07 60 04 ld [ %i5 + 4 ], %o7
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
400094b4: 80 8b e0 01 btst 1, %o7
400094b8: 02 80 00 2b be 40009564 <_Heap_Walk+0x360>
400094bc: 80 a6 a0 00 cmp %i2, 0
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
400094c0: 22 80 00 21 be,a 40009544 <_Heap_Walk+0x340>
400094c4: da 05 40 00 ld [ %l5 ], %o5
(*printer)(
400094c8: 90 10 00 19 mov %i1, %o0
400094cc: 92 10 20 00 clr %o1
400094d0: 94 10 00 12 mov %l2, %o2
400094d4: 96 10 00 15 mov %l5, %o3
400094d8: 9f c5 c0 00 call %l7
400094dc: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
400094e0: 80 a7 00 1d cmp %i4, %i5
400094e4: 02 80 00 51 be 40009628 <_Heap_Walk+0x424>
400094e8: aa 10 00 1d mov %i5, %l5
400094ec: ec 07 60 04 ld [ %i5 + 4 ], %l6
400094f0: da 06 20 20 ld [ %i0 + 0x20 ], %o5
400094f4: 10 bf ff d1 b 40009438 <_Heap_Walk+0x234>
400094f8: b4 0d a0 01 and %l6, 1, %i2
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
400094fc: 80 a5 80 10 cmp %l6, %l0
40009500: 0a 80 00 69 bcs 400096a4 <_Heap_Walk+0x4a0>
40009504: 80 8b 60 ff btst 0xff, %o5
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
40009508: 80 a5 40 1d cmp %l5, %i5
4000950c: 2a bf ff ea bcs,a 400094b4 <_Heap_Walk+0x2b0>
40009510: de 07 60 04 ld [ %i5 + 4 ], %o7
40009514: 80 8b 60 ff btst 0xff, %o5
40009518: 22 bf ff e7 be,a 400094b4 <_Heap_Walk+0x2b0>
4000951c: de 07 60 04 ld [ %i5 + 4 ], %o7
(*printer)(
40009520: 90 10 00 19 mov %i1, %o0
40009524: 92 10 20 01 mov 1, %o1
40009528: 96 10 00 15 mov %l5, %o3
4000952c: 15 10 00 56 sethi %hi(0x40015800), %o2
40009530: 98 10 00 1d mov %i5, %o4
40009534: 9f c5 c0 00 call %l7
40009538: 94 12 a2 a0 or %o2, 0x2a0, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
4000953c: 10 bf ff 40 b 4000923c <_Heap_Walk+0x38>
40009540: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
40009544: 96 10 00 15 mov %l5, %o3
40009548: 90 10 00 19 mov %i1, %o0
4000954c: 92 10 20 00 clr %o1
40009550: 94 10 00 13 mov %l3, %o2
40009554: 9f c5 c0 00 call %l7
40009558: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
4000955c: 10 bf ff e2 b 400094e4 <_Heap_Walk+0x2e0>
40009560: 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 ?
40009564: 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)(
40009568: de 06 20 08 ld [ %i0 + 8 ], %o7
4000956c: 80 a3 c0 0d cmp %o7, %o5
40009570: 02 80 00 3d be 40009664 <_Heap_Walk+0x460>
40009574: 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)" : ""),
40009578: 80 a6 00 0d cmp %i0, %o5
4000957c: 02 80 00 40 be 4000967c <_Heap_Walk+0x478>
40009580: 96 15 23 48 or %l4, 0x348, %o3
block->next,
block->next == last_free_block ?
40009584: 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)(
40009588: 80 a3 00 0f cmp %o4, %o7
4000958c: 02 80 00 33 be 40009658 <_Heap_Walk+0x454>
40009590: 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)" : "")
40009594: 02 80 00 37 be 40009670 <_Heap_Walk+0x46c>
40009598: 98 15 23 48 or %l4, 0x348, %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)(
4000959c: d6 23 a0 5c st %o3, [ %sp + 0x5c ]
400095a0: d8 23 a0 64 st %o4, [ %sp + 0x64 ]
400095a4: de 23 a0 60 st %o7, [ %sp + 0x60 ]
400095a8: 90 10 00 19 mov %i1, %o0
400095ac: 92 10 20 00 clr %o1
400095b0: 15 10 00 56 sethi %hi(0x40015800), %o2
400095b4: 96 10 00 15 mov %l5, %o3
400095b8: 94 12 a2 d8 or %o2, 0x2d8, %o2
400095bc: 9f c5 c0 00 call %l7
400095c0: 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 ) {
400095c4: da 07 40 00 ld [ %i5 ], %o5
400095c8: 80 a5 80 0d cmp %l6, %o5
400095cc: 12 80 00 19 bne 40009630 <_Heap_Walk+0x42c>
400095d0: 80 a6 a0 00 cmp %i2, 0
);
return false;
}
if ( !prev_used ) {
400095d4: 02 80 00 2d be 40009688 <_Heap_Walk+0x484>
400095d8: 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;
400095dc: 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 ) {
400095e0: 80 a6 00 02 cmp %i0, %g2
400095e4: 02 80 00 0b be 40009610 <_Heap_Walk+0x40c> <== NEVER TAKEN
400095e8: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
400095ec: 80 a5 40 02 cmp %l5, %g2
400095f0: 02 bf ff bd be 400094e4 <_Heap_Walk+0x2e0>
400095f4: 80 a7 00 1d cmp %i4, %i5
return true;
}
free_block = free_block->next;
400095f8: 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 ) {
400095fc: 80 a6 00 02 cmp %i0, %g2
40009600: 12 bf ff fc bne 400095f0 <_Heap_Walk+0x3ec>
40009604: 80 a5 40 02 cmp %l5, %g2
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
40009608: 90 10 00 19 mov %i1, %o0
4000960c: 92 10 20 01 mov 1, %o1
40009610: 15 10 00 56 sethi %hi(0x40015800), %o2
40009614: 96 10 00 15 mov %l5, %o3
40009618: 9f c5 c0 00 call %l7
4000961c: 94 12 a3 c0 or %o2, 0x3c0, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009620: 10 bf ff 42 b 40009328 <_Heap_Walk+0x124>
40009624: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
40009628: 10 bf ff 05 b 4000923c <_Heap_Walk+0x38>
4000962c: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
40009630: fa 23 a0 5c st %i5, [ %sp + 0x5c ]
40009634: 90 10 00 19 mov %i1, %o0
40009638: 92 10 20 01 mov 1, %o1
4000963c: 15 10 00 56 sethi %hi(0x40015800), %o2
40009640: 96 10 00 15 mov %l5, %o3
40009644: 94 12 a3 10 or %o2, 0x310, %o2
40009648: 9f c5 c0 00 call %l7
4000964c: 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;
40009650: 10 bf ff 36 b 40009328 <_Heap_Walk+0x124>
40009654: 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)(
40009658: 03 10 00 55 sethi %hi(0x40015400), %g1
4000965c: 10 bf ff d0 b 4000959c <_Heap_Walk+0x398>
40009660: 98 10 63 a0 or %g1, 0x3a0, %o4 ! 400157a0 <__log2table+0x140>
40009664: 03 10 00 55 sethi %hi(0x40015400), %g1
40009668: 10 bf ff c7 b 40009584 <_Heap_Walk+0x380>
4000966c: 96 10 63 80 or %g1, 0x380, %o3 ! 40015780 <__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)" : "")
40009670: 03 10 00 55 sethi %hi(0x40015400), %g1
40009674: 10 bf ff ca b 4000959c <_Heap_Walk+0x398>
40009678: 98 10 63 b0 or %g1, 0x3b0, %o4 ! 400157b0 <__log2table+0x150>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
4000967c: 17 10 00 55 sethi %hi(0x40015400), %o3
40009680: 10 bf ff c1 b 40009584 <_Heap_Walk+0x380>
40009684: 96 12 e3 90 or %o3, 0x390, %o3 ! 40015790 <__log2table+0x130>
return false;
}
if ( !prev_used ) {
(*printer)(
40009688: 92 10 20 01 mov 1, %o1
4000968c: 15 10 00 56 sethi %hi(0x40015800), %o2
40009690: 96 10 00 15 mov %l5, %o3
40009694: 9f c5 c0 00 call %l7
40009698: 94 12 a3 50 or %o2, 0x350, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
4000969c: 10 bf ff 23 b 40009328 <_Heap_Walk+0x124>
400096a0: 82 10 20 00 clr %g1
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
400096a4: 02 bf ff 9a be 4000950c <_Heap_Walk+0x308> <== NEVER TAKEN
400096a8: 80 a5 40 1d cmp %l5, %i5
(*printer)(
400096ac: 90 10 00 19 mov %i1, %o0
400096b0: 92 10 20 01 mov 1, %o1
400096b4: 96 10 00 15 mov %l5, %o3
400096b8: 15 10 00 56 sethi %hi(0x40015800), %o2
400096bc: 98 10 00 16 mov %l6, %o4
400096c0: 94 12 a2 70 or %o2, 0x270, %o2
400096c4: 9f c5 c0 00 call %l7
400096c8: 9a 10 00 10 mov %l0, %o5
block,
block_size,
min_block_size
);
return false;
400096cc: 10 bf fe dc b 4000923c <_Heap_Walk+0x38>
400096d0: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
400096d4: 92 10 20 01 mov 1, %o1
400096d8: 96 10 00 15 mov %l5, %o3
400096dc: 15 10 00 56 sethi %hi(0x40015800), %o2
400096e0: 98 10 00 16 mov %l6, %o4
400096e4: 9f c5 c0 00 call %l7
400096e8: 94 12 a2 40 or %o2, 0x240, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
400096ec: 10 bf fe d4 b 4000923c <_Heap_Walk+0x38>
400096f0: 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;
400096f4: 80 a4 c0 1d cmp %l3, %i5
400096f8: 0a bf ff 43 bcs 40009404 <_Heap_Walk+0x200> <== NEVER TAKEN
400096fc: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
40009700: da 27 bf fc st %o5, [ %fp + -4 ]
40009704: 90 07 60 08 add %i5, 8, %o0
40009708: 7f ff e1 1a call 40001b70 <.urem>
4000970c: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
40009710: 80 a2 20 00 cmp %o0, 0
40009714: 12 80 00 36 bne 400097ec <_Heap_Walk+0x5e8> <== NEVER TAKEN
40009718: 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;
4000971c: c2 07 60 04 ld [ %i5 + 4 ], %g1
40009720: 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;
40009724: 82 07 40 01 add %i5, %g1, %g1
40009728: c2 00 60 04 ld [ %g1 + 4 ], %g1
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
4000972c: 80 88 60 01 btst 1, %g1
40009730: 12 80 00 27 bne 400097cc <_Heap_Walk+0x5c8> <== NEVER TAKEN
40009734: a4 10 00 1d mov %i5, %l2
40009738: 10 80 00 19 b 4000979c <_Heap_Walk+0x598>
4000973c: 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 ) {
40009740: 80 a6 00 1d cmp %i0, %i5
40009744: 02 bf ff 37 be 40009420 <_Heap_Walk+0x21c>
40009748: 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;
4000974c: 0a bf ff 2e bcs 40009404 <_Heap_Walk+0x200>
40009750: 90 10 00 19 mov %i1, %o0
40009754: 80 a7 40 13 cmp %i5, %l3
40009758: 18 bf ff 2c bgu 40009408 <_Heap_Walk+0x204> <== NEVER TAKEN
4000975c: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
40009760: da 27 bf fc st %o5, [ %fp + -4 ]
40009764: 90 07 60 08 add %i5, 8, %o0
40009768: 7f ff e1 02 call 40001b70 <.urem>
4000976c: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
40009770: 80 a2 20 00 cmp %o0, 0
40009774: 12 80 00 1e bne 400097ec <_Heap_Walk+0x5e8>
40009778: 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;
4000977c: de 07 60 04 ld [ %i5 + 4 ], %o7
40009780: 82 10 00 12 mov %l2, %g1
40009784: 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;
40009788: 9e 03 c0 1d add %o7, %i5, %o7
4000978c: de 03 e0 04 ld [ %o7 + 4 ], %o7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
40009790: 80 8b e0 01 btst 1, %o7
40009794: 12 80 00 0e bne 400097cc <_Heap_Walk+0x5c8>
40009798: a4 10 00 1d mov %i5, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
4000979c: d8 07 60 0c ld [ %i5 + 0xc ], %o4
400097a0: 80 a3 00 01 cmp %o4, %g1
400097a4: 22 bf ff e7 be,a 40009740 <_Heap_Walk+0x53c>
400097a8: fa 07 60 08 ld [ %i5 + 8 ], %i5
(*printer)(
400097ac: 90 10 00 19 mov %i1, %o0
400097b0: 92 10 20 01 mov 1, %o1
400097b4: 15 10 00 56 sethi %hi(0x40015800), %o2
400097b8: 96 10 00 1d mov %i5, %o3
400097bc: 9f c5 c0 00 call %l7
400097c0: 94 12 a1 d8 or %o2, 0x1d8, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
400097c4: 10 bf fe d9 b 40009328 <_Heap_Walk+0x124>
400097c8: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
400097cc: 90 10 00 19 mov %i1, %o0
400097d0: 92 10 20 01 mov 1, %o1
400097d4: 15 10 00 56 sethi %hi(0x40015800), %o2
400097d8: 96 10 00 1d mov %i5, %o3
400097dc: 9f c5 c0 00 call %l7
400097e0: 94 12 a1 b8 or %o2, 0x1b8, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
400097e4: 10 bf fe d1 b 40009328 <_Heap_Walk+0x124>
400097e8: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
400097ec: 90 10 00 19 mov %i1, %o0
400097f0: 92 10 20 01 mov 1, %o1
400097f4: 15 10 00 56 sethi %hi(0x40015800), %o2
400097f8: 96 10 00 1d mov %i5, %o3
400097fc: 9f c5 c0 00 call %l7
40009800: 94 12 a1 88 or %o2, 0x188, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
40009804: 10 bf fe c9 b 40009328 <_Heap_Walk+0x124>
40009808: 82 10 20 00 clr %g1
40007c0c <_IO_Initialize_all_drivers>:
_IO_Driver_address_table[index] = driver_table[index];
}
void _IO_Initialize_all_drivers( void )
{
40007c0c: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
40007c10: 39 10 00 76 sethi %hi(0x4001d800), %i4
40007c14: c2 07 22 c8 ld [ %i4 + 0x2c8 ], %g1 ! 4001dac8 <_IO_Number_of_drivers>
40007c18: ba 10 20 00 clr %i5
40007c1c: 80 a0 60 00 cmp %g1, 0
40007c20: 02 80 00 0b be 40007c4c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
40007c24: b8 17 22 c8 or %i4, 0x2c8, %i4
(void) rtems_io_initialize( major, 0, NULL );
40007c28: 90 10 00 1d mov %i5, %o0
40007c2c: 92 10 20 00 clr %o1
40007c30: 40 00 13 47 call 4000c94c <rtems_io_initialize>
40007c34: 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 ++ )
40007c38: c2 07 00 00 ld [ %i4 ], %g1
40007c3c: ba 07 60 01 inc %i5
40007c40: 80 a0 40 1d cmp %g1, %i5
40007c44: 18 bf ff fa bgu 40007c2c <_IO_Initialize_all_drivers+0x20>
40007c48: 90 10 00 1d mov %i5, %o0
40007c4c: 81 c7 e0 08 ret
40007c50: 81 e8 00 00 restore
40007b3c <_IO_Manager_initialization>:
#include <rtems/score/wkspace.h>
#include <string.h>
void _IO_Manager_initialization(void)
{
40007b3c: 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 = rtems_configuration_get_device_driver_table();
40007b40: 03 10 00 6b sethi %hi(0x4001ac00), %g1
40007b44: 82 10 63 b8 or %g1, 0x3b8, %g1 ! 4001afb8 <Configuration>
drivers_in_table = rtems_configuration_get_number_of_device_drivers();
40007b48: f8 00 60 38 ld [ %g1 + 0x38 ], %i4
number_of_drivers = rtems_configuration_get_maximum_drivers();
40007b4c: f6 00 60 34 ld [ %g1 + 0x34 ], %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 )
40007b50: 80 a7 00 1b cmp %i4, %i3
40007b54: 0a 80 00 08 bcs 40007b74 <_IO_Manager_initialization+0x38>
40007b58: fa 00 60 3c ld [ %g1 + 0x3c ], %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;
40007b5c: 03 10 00 76 sethi %hi(0x4001d800), %g1
40007b60: fa 20 62 cc st %i5, [ %g1 + 0x2cc ] ! 4001dacc <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
40007b64: 03 10 00 76 sethi %hi(0x4001d800), %g1
40007b68: f8 20 62 c8 st %i4, [ %g1 + 0x2c8 ] ! 4001dac8 <_IO_Number_of_drivers>
return;
40007b6c: 81 c7 e0 08 ret
40007b70: 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 )
40007b74: 83 2e e0 03 sll %i3, 3, %g1
40007b78: b5 2e e0 05 sll %i3, 5, %i2
40007b7c: 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(
40007b80: 40 00 0c fd call 4000af74 <_Workspace_Allocate_or_fatal_error>
40007b84: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
40007b88: 03 10 00 76 sethi %hi(0x4001d800), %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 *)
40007b8c: 33 10 00 76 sethi %hi(0x4001d800), %i1
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
40007b90: f6 20 62 c8 st %i3, [ %g1 + 0x2c8 ]
/*
* 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 *)
40007b94: d0 26 62 cc st %o0, [ %i1 + 0x2cc ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
40007b98: 92 10 20 00 clr %o1
40007b9c: 40 00 1d cb call 4000f2c8 <memset>
40007ba0: 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++ )
40007ba4: 80 a7 20 00 cmp %i4, 0
40007ba8: 02 bf ff f1 be 40007b6c <_IO_Manager_initialization+0x30> <== NEVER TAKEN
40007bac: c8 06 62 cc ld [ %i1 + 0x2cc ], %g4
#include <rtems/score/thread.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _IO_Manager_initialization(void)
40007bb0: 85 2f 20 03 sll %i4, 3, %g2
40007bb4: b7 2f 20 05 sll %i4, 5, %i3
40007bb8: 82 10 20 00 clr %g1
40007bbc: 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];
40007bc0: c4 07 40 01 ld [ %i5 + %g1 ], %g2
40007bc4: 86 07 40 01 add %i5, %g1, %g3
40007bc8: c4 21 00 01 st %g2, [ %g4 + %g1 ]
40007bcc: f8 00 e0 04 ld [ %g3 + 4 ], %i4
40007bd0: 84 01 00 01 add %g4, %g1, %g2
40007bd4: f8 20 a0 04 st %i4, [ %g2 + 4 ]
40007bd8: f8 00 e0 08 ld [ %g3 + 8 ], %i4
40007bdc: 82 00 60 18 add %g1, 0x18, %g1
40007be0: f8 20 a0 08 st %i4, [ %g2 + 8 ]
40007be4: 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++ )
40007be8: 80 a0 40 1b cmp %g1, %i3
_IO_Driver_address_table[index] = driver_table[index];
40007bec: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
40007bf0: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4
40007bf4: f8 20 a0 10 st %i4, [ %g2 + 0x10 ]
40007bf8: 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++ )
40007bfc: 12 bf ff f1 bne 40007bc0 <_IO_Manager_initialization+0x84>
40007c00: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
40007c04: 81 c7 e0 08 ret
40007c08: 81 e8 00 00 restore
4000889c <_Internal_error_Occurred>:
void _Internal_error_Occurred(
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
4000889c: 9d e3 bf 90 save %sp, -112, %sp
Internal_errors_t error
)
{
User_extensions_Fatal_context ctx = { source, is_internal, error };
_User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor );
400088a0: 13 10 00 2a sethi %hi(0x4000a800), %o1
400088a4: 90 07 bf f4 add %fp, -12, %o0
400088a8: 92 12 61 ac or %o1, 0x1ac, %o1
Internal_errors_Source source,
bool is_internal,
Internal_errors_t error
)
{
User_extensions_Fatal_context ctx = { source, is_internal, error };
400088ac: f0 27 bf f4 st %i0, [ %fp + -12 ]
400088b0: f2 2f bf f8 stb %i1, [ %fp + -8 ]
_User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor );
400088b4: 40 00 08 49 call 4000a9d8 <_User_extensions_Iterate>
400088b8: f4 27 bf fc st %i2, [ %fp + -4 ]
_User_extensions_Fatal( the_source, is_internal, the_error );
_Internal_errors_What_happened.the_source = the_source;
400088bc: 05 10 00 76 sethi %hi(0x4001d800), %g2 <== NOT EXECUTED
400088c0: 82 10 a2 10 or %g2, 0x210, %g1 ! 4001da10 <_Internal_errors_What_happened><== NOT EXECUTED
400088c4: f0 20 a2 10 st %i0, [ %g2 + 0x210 ] <== NOT EXECUTED
_Internal_errors_What_happened.is_internal = is_internal;
400088c8: f2 28 60 04 stb %i1, [ %g1 + 4 ] <== NOT EXECUTED
_Internal_errors_What_happened.the_error = the_error;
400088cc: f4 20 60 08 st %i2, [ %g1 + 8 ] <== NOT EXECUTED
RTEMS_INLINE_ROUTINE void _System_state_Set (
System_state_Codes state
)
{
_System_state_Current = state;
400088d0: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED
400088d4: 03 10 00 76 sethi %hi(0x4001d800), %g1 <== NOT EXECUTED
_System_state_Set( SYSTEM_STATE_FAILED );
_CPU_Fatal_halt( the_error );
400088d8: 7f ff e5 f3 call 400020a4 <sparc_disable_interrupts> <== NOT EXECUTED
400088dc: c4 20 62 1c st %g2, [ %g1 + 0x21c ] ! 4001da1c <_System_state_Current><== NOT EXECUTED
400088e0: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED
400088e4: 30 80 00 00 b,a 400088e4 <_Internal_error_Occurred+0x48> <== NOT EXECUTED
40008954 <_Objects_Allocate>:
#endif
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
40008954: 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 )
40008958: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
4000895c: 80 a0 60 00 cmp %g1, 0
40008960: 02 80 00 26 be 400089f8 <_Objects_Allocate+0xa4> <== NEVER TAKEN
40008964: 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 );
40008968: b8 06 20 20 add %i0, 0x20, %i4
4000896c: 7f ff fd 4c call 40007e9c <_Chain_Get>
40008970: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
40008974: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
40008978: 80 a0 60 00 cmp %g1, 0
4000897c: 02 80 00 16 be 400089d4 <_Objects_Allocate+0x80>
40008980: 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 ) {
40008984: 80 a2 20 00 cmp %o0, 0
40008988: 02 80 00 15 be 400089dc <_Objects_Allocate+0x88>
4000898c: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
40008990: c4 07 60 08 ld [ %i5 + 8 ], %g2
40008994: d0 06 20 08 ld [ %i0 + 8 ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
40008998: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
4000899c: 03 00 00 3f sethi %hi(0xfc00), %g1
400089a0: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff <PROM_START+0xffff>
400089a4: 90 0a 00 01 and %o0, %g1, %o0
400089a8: 82 08 80 01 and %g2, %g1, %g1
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
400089ac: 40 00 3c 06 call 400179c4 <.udiv>
400089b0: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
400089b4: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
400089b8: 91 2a 20 02 sll %o0, 2, %o0
400089bc: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
400089c0: 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 ]--;
400089c4: 86 00 ff ff add %g3, -1, %g3
400089c8: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
400089cc: 82 00 bf ff add %g2, -1, %g1
400089d0: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
400089d4: 81 c7 e0 08 ret
400089d8: 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 );
400089dc: 40 00 00 10 call 40008a1c <_Objects_Extend_information>
400089e0: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
400089e4: 7f ff fd 2e call 40007e9c <_Chain_Get>
400089e8: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
400089ec: b0 92 20 00 orcc %o0, 0, %i0
400089f0: 32 bf ff e9 bne,a 40008994 <_Objects_Allocate+0x40>
400089f4: 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;
400089f8: 81 c7 e0 08 ret
400089fc: 91 e8 20 00 restore %g0, 0, %o0
40008a1c <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
40008a1c: 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 )
40008a20: f2 06 20 34 ld [ %i0 + 0x34 ], %i1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
40008a24: e0 16 20 0a lduh [ %i0 + 0xa ], %l0
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
40008a28: 80 a6 60 00 cmp %i1, 0
40008a2c: 02 80 00 a1 be 40008cb0 <_Objects_Extend_information+0x294>
40008a30: e2 16 20 10 lduh [ %i0 + 0x10 ], %l1
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
40008a34: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
40008a38: a3 2c 60 10 sll %l1, 0x10, %l1
40008a3c: 92 10 00 1b mov %i3, %o1
40008a40: 40 00 3b e1 call 400179c4 <.udiv>
40008a44: 91 34 60 10 srl %l1, 0x10, %o0
40008a48: 91 2a 20 10 sll %o0, 0x10, %o0
40008a4c: b5 32 20 10 srl %o0, 0x10, %i2
for ( ; block < block_count; block++ ) {
40008a50: 80 a6 a0 00 cmp %i2, 0
40008a54: 02 80 00 af be 40008d10 <_Objects_Extend_information+0x2f4><== NEVER TAKEN
40008a58: 90 10 00 1b mov %i3, %o0
if ( information->object_blocks[ block ] == NULL ) {
40008a5c: c2 06 40 00 ld [ %i1 ], %g1
40008a60: 80 a0 60 00 cmp %g1, 0
40008a64: 02 80 00 b1 be 40008d28 <_Objects_Extend_information+0x30c><== NEVER TAKEN
40008a68: b8 10 00 10 mov %l0, %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;
40008a6c: 10 80 00 06 b 40008a84 <_Objects_Extend_information+0x68>
40008a70: 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 ) {
40008a74: c2 06 40 01 ld [ %i1 + %g1 ], %g1
40008a78: 80 a0 60 00 cmp %g1, 0
40008a7c: 22 80 00 08 be,a 40008a9c <_Objects_Extend_information+0x80>
40008a80: 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++ ) {
40008a84: ba 07 60 01 inc %i5
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
40008a88: 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++ ) {
40008a8c: 80 a6 80 1d cmp %i2, %i5
40008a90: 18 bf ff f9 bgu 40008a74 <_Objects_Extend_information+0x58>
40008a94: 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;
40008a98: b6 10 20 01 mov 1, %i3
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
40008a9c: b3 34 60 10 srl %l1, 0x10, %i1
/*
* We need to limit the number of objects to the maximum number
* representable in the index portion of the object Id. In the
* case of 16-bit Ids, this is only 256 object instances.
*/
if ( maximum > OBJECTS_ID_FINAL_INDEX ) {
40008aa0: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
40008aa4: b2 06 40 08 add %i1, %o0, %i1
/*
* We need to limit the number of objects to the maximum number
* representable in the index portion of the object Id. In the
* case of 16-bit Ids, this is only 256 object instances.
*/
if ( maximum > OBJECTS_ID_FINAL_INDEX ) {
40008aa8: 82 10 63 ff or %g1, 0x3ff, %g1
40008aac: 80 a6 40 01 cmp %i1, %g1
40008ab0: 18 80 00 9c bgu 40008d20 <_Objects_Extend_information+0x304>
40008ab4: 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;
40008ab8: 40 00 3b 89 call 400178dc <.umul>
40008abc: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
40008ac0: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
40008ac4: 80 a0 60 00 cmp %g1, 0
40008ac8: 02 80 00 6d be 40008c7c <_Objects_Extend_information+0x260>
40008acc: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
40008ad0: 40 00 09 1b call 4000af3c <_Workspace_Allocate>
40008ad4: 01 00 00 00 nop
if ( !new_object_block )
40008ad8: a2 92 20 00 orcc %o0, 0, %l1
40008adc: 02 80 00 91 be 40008d20 <_Objects_Extend_information+0x304>
40008ae0: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
40008ae4: 80 8e e0 ff btst 0xff, %i3
40008ae8: 22 80 00 42 be,a 40008bf0 <_Objects_Extend_information+0x1d4>
40008aec: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
((maximum + minimum_index) * sizeof(Objects_Control *));
if ( information->auto_extend ) {
40008af0: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
40008af4: b6 06 a0 01 add %i2, 1, %i3
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
((maximum + minimum_index) * sizeof(Objects_Control *));
if ( information->auto_extend ) {
40008af8: 80 a0 60 00 cmp %g1, 0
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
40008afc: 91 2e e0 01 sll %i3, 1, %o0
40008b00: 90 02 00 1b add %o0, %i3, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
40008b04: 90 06 40 08 add %i1, %o0, %o0
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
40008b08: 90 02 00 10 add %o0, %l0, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
if ( information->auto_extend ) {
40008b0c: 12 80 00 60 bne 40008c8c <_Objects_Extend_information+0x270>
40008b10: 91 2a 20 02 sll %o0, 2, %o0
if ( !object_blocks ) {
_Workspace_Free( new_object_block );
return;
}
} else {
object_blocks = _Workspace_Allocate_or_fatal_error( block_size );
40008b14: 40 00 09 18 call 4000af74 <_Workspace_Allocate_or_fatal_error>
40008b18: 01 00 00 00 nop
40008b1c: a4 10 00 08 mov %o0, %l2
* Take the block count down. Saves all the (block_count - 1)
* in the copies.
*/
block_count--;
if ( information->maximum > minimum_index ) {
40008b20: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
/*
* Break the block into the various sections.
*/
inactive_per_block = (uint32_t *) _Addresses_Add_offset(
object_blocks, block_count * sizeof(void*) );
40008b24: 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 ) {
40008b28: 80 a4 00 01 cmp %l0, %g1
40008b2c: a6 04 80 1b add %l2, %i3, %l3
40008b30: 0a 80 00 67 bcs 40008ccc <_Objects_Extend_information+0x2b0>
40008b34: b6 04 c0 1b add %l3, %i3, %i3
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
40008b38: 85 2c 20 02 sll %l0, 2, %g2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
40008b3c: 80 a4 20 00 cmp %l0, 0
40008b40: 02 80 00 07 be 40008b5c <_Objects_Extend_information+0x140><== NEVER TAKEN
40008b44: 82 10 20 00 clr %g1
local_table[ index ] = NULL;
40008b48: c0 20 40 1b clr [ %g1 + %i3 ]
40008b4c: 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++ ) {
40008b50: 80 a0 40 02 cmp %g1, %g2
40008b54: 32 bf ff fe bne,a 40008b4c <_Objects_Extend_information+0x130><== NEVER TAKEN
40008b58: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED
40008b5c: b5 2e a0 02 sll %i2, 2, %i2
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
40008b60: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
40008b64: c0 24 80 1a clr [ %l2 + %i2 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
40008b68: 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 ;
40008b6c: 80 a7 00 01 cmp %i4, %g1
40008b70: 1a 80 00 0b bcc 40008b9c <_Objects_Extend_information+0x180><== NEVER TAKEN
40008b74: c0 24 c0 1a clr [ %l3 + %i2 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
40008b78: 85 2f 20 02 sll %i4, 2, %g2
40008b7c: 87 28 e0 02 sll %g3, 2, %g3
40008b80: 84 06 c0 02 add %i3, %g2, %g2
40008b84: 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;
40008b88: c0 20 80 01 clr [ %g2 + %g1 ]
40008b8c: 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 ;
40008b90: 80 a0 40 03 cmp %g1, %g3
40008b94: 32 bf ff fe bne,a 40008b8c <_Objects_Extend_information+0x170>
40008b98: c0 20 80 01 clr [ %g2 + %g1 ]
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
40008b9c: 7f ff e5 42 call 400020a4 <sparc_disable_interrupts>
40008ba0: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
40008ba4: 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(
40008ba8: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
40008bac: f4 06 20 34 ld [ %i0 + 0x34 ], %i2
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
information->maximum = (Objects_Maximum) maximum;
40008bb0: f2 36 20 10 sth %i1, [ %i0 + 0x10 ]
40008bb4: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
40008bb8: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
40008bbc: e4 26 20 34 st %l2, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
40008bc0: e6 26 20 30 st %l3, [ %i0 + 0x30 ]
information->local_table = local_table;
40008bc4: 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) |
40008bc8: 03 00 00 40 sethi %hi(0x10000), %g1
40008bcc: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
40008bd0: 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) |
40008bd4: b2 10 40 19 or %g1, %i1, %i1
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
40008bd8: f2 26 20 0c st %i1, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
40008bdc: 7f ff e5 36 call 400020b4 <sparc_enable_interrupts>
40008be0: 01 00 00 00 nop
_Workspace_Free( old_tables );
40008be4: 40 00 08 de call 4000af5c <_Workspace_Free>
40008be8: 90 10 00 1a mov %i2, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
40008bec: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
40008bf0: bb 2f 60 02 sll %i5, 2, %i5
40008bf4: e2 20 40 1d st %l1, [ %g1 + %i5 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
40008bf8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
40008bfc: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
40008c00: d2 00 40 1d ld [ %g1 + %i5 ], %o1
40008c04: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
40008c08: 90 07 bf f4 add %fp, -12, %o0
40008c0c: 7f ff fc b4 call 40007edc <_Chain_Initialize>
40008c10: 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 ) {
40008c14: 10 80 00 0d b 40008c48 <_Objects_Extend_information+0x22c>
40008c18: b6 06 20 20 add %i0, 0x20, %i3
the_object->id = _Objects_Build_id(
40008c1c: c6 16 20 04 lduh [ %i0 + 4 ], %g3
40008c20: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
40008c24: 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) |
40008c28: 84 10 80 1a or %g2, %i2, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
40008c2c: 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) |
40008c30: 84 10 80 1c or %g2, %i4, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
40008c34: 90 10 00 1b mov %i3, %o0
40008c38: 92 10 00 01 mov %g1, %o1
index++;
40008c3c: b8 07 20 01 inc %i4
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
40008c40: 7f ff fc 8c call 40007e70 <_Chain_Append>
40008c44: 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 ) {
40008c48: 7f ff fc 95 call 40007e9c <_Chain_Get>
40008c4c: 90 07 bf f4 add %fp, -12, %o0
40008c50: 82 92 20 00 orcc %o0, 0, %g1
40008c54: 32 bf ff f2 bne,a 40008c1c <_Objects_Extend_information+0x200>
40008c58: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
40008c5c: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
40008c60: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
40008c64: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
40008c68: c8 20 c0 1d st %g4, [ %g3 + %i5 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
40008c6c: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
40008c70: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
40008c74: 81 c7 e0 08 ret
40008c78: 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 );
40008c7c: 40 00 08 be call 4000af74 <_Workspace_Allocate_or_fatal_error>
40008c80: 01 00 00 00 nop
40008c84: 10 bf ff 98 b 40008ae4 <_Objects_Extend_information+0xc8>
40008c88: a2 10 00 08 mov %o0, %l1
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
((maximum + minimum_index) * sizeof(Objects_Control *));
if ( information->auto_extend ) {
object_blocks = _Workspace_Allocate( block_size );
40008c8c: 40 00 08 ac call 4000af3c <_Workspace_Allocate>
40008c90: 01 00 00 00 nop
if ( !object_blocks ) {
40008c94: a4 92 20 00 orcc %o0, 0, %l2
40008c98: 32 bf ff a3 bne,a 40008b24 <_Objects_Extend_information+0x108>
40008c9c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
_Workspace_Free( new_object_block );
40008ca0: 40 00 08 af call 4000af5c <_Workspace_Free>
40008ca4: 90 10 00 11 mov %l1, %o0
40008ca8: 81 c7 e0 08 ret
40008cac: 81 e8 00 00 restore
40008cb0: 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 );
40008cb4: b8 10 00 10 mov %l0, %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;
40008cb8: b6 10 20 01 mov 1, %i3
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
40008cbc: ba 10 20 00 clr %i5
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
40008cc0: b4 10 20 00 clr %i2
40008cc4: 10 bf ff 76 b 40008a9c <_Objects_Extend_information+0x80>
40008cc8: a3 2c 60 10 sll %l1, 0x10, %l1
/*
* 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,
40008ccc: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
40008cd0: b5 2e a0 02 sll %i2, 2, %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,
40008cd4: 90 10 00 12 mov %l2, %o0
40008cd8: 40 00 19 3f call 4000f1d4 <memcpy>
40008cdc: 94 10 00 1a mov %i2, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
40008ce0: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
40008ce4: 94 10 00 1a mov %i2, %o2
40008ce8: 40 00 19 3b call 4000f1d4 <memcpy>
40008cec: 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 *) );
40008cf0: 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,
40008cf4: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
40008cf8: 94 02 80 10 add %o2, %l0, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
40008cfc: 90 10 00 1b mov %i3, %o0
40008d00: 40 00 19 35 call 4000f1d4 <memcpy>
40008d04: 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 );
40008d08: 10 bf ff 97 b 40008b64 <_Objects_Extend_information+0x148>
40008d0c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
/*
* 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 );
40008d10: b8 10 00 10 mov %l0, %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;
40008d14: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
40008d18: 10 bf ff 61 b 40008a9c <_Objects_Extend_information+0x80> <== NOT EXECUTED
40008d1c: ba 10 20 00 clr %i5 <== NOT EXECUTED
40008d20: 81 c7 e0 08 ret
40008d24: 81 e8 00 00 restore
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
40008d28: 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;
40008d2c: 10 bf ff 5c b 40008a9c <_Objects_Extend_information+0x80> <== NOT EXECUTED
40008d30: ba 10 20 00 clr %i5 <== NOT EXECUTED
40008de4 <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
40008de4: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
40008de8: 80 a6 60 00 cmp %i1, 0
40008dec: 02 80 00 19 be 40008e50 <_Objects_Get_information+0x6c>
40008df0: 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 );
40008df4: 40 00 10 4a call 4000cf1c <_Objects_API_maximum_class>
40008df8: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
40008dfc: 80 a2 20 00 cmp %o0, 0
40008e00: 02 80 00 14 be 40008e50 <_Objects_Get_information+0x6c>
40008e04: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
40008e08: 0a 80 00 12 bcs 40008e50 <_Objects_Get_information+0x6c>
40008e0c: 03 10 00 75 sethi %hi(0x4001d400), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
40008e10: b1 2e 20 02 sll %i0, 2, %i0
40008e14: 82 10 63 84 or %g1, 0x384, %g1
40008e18: c2 00 40 18 ld [ %g1 + %i0 ], %g1
40008e1c: 80 a0 60 00 cmp %g1, 0
40008e20: 02 80 00 0c be 40008e50 <_Objects_Get_information+0x6c> <== NEVER TAKEN
40008e24: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
40008e28: f0 00 40 19 ld [ %g1 + %i1 ], %i0
if ( !info )
40008e2c: 80 a6 20 00 cmp %i0, 0
40008e30: 02 80 00 08 be 40008e50 <_Objects_Get_information+0x6c> <== NEVER TAKEN
40008e34: 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 )
40008e38: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
40008e3c: 80 a0 60 00 cmp %g1, 0
40008e40: 02 80 00 04 be 40008e50 <_Objects_Get_information+0x6c>
40008e44: 01 00 00 00 nop
return NULL;
#endif
return info;
}
40008e48: 81 c7 e0 08 ret
40008e4c: 81 e8 00 00 restore
{
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
return NULL;
40008e50: 81 c7 e0 08 ret
40008e54: 91 e8 20 00 restore %g0, 0, %o0
40016914 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
40016914: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
40016918: 80 a6 60 00 cmp %i1, 0
4001691c: 02 80 00 3d be 40016a10 <_Objects_Get_name_as_string+0xfc>
40016920: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
40016924: 02 80 00 3b be 40016a10 <_Objects_Get_name_as_string+0xfc>
40016928: ba 96 20 00 orcc %i0, 0, %i5
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
4001692c: 02 80 00 36 be 40016a04 <_Objects_Get_name_as_string+0xf0>
40016930: 03 10 00 c3 sethi %hi(0x40030c00), %g1
information = _Objects_Get_information_id( tmpId );
40016934: 7f ff e2 f5 call 4000f508 <_Objects_Get_information_id>
40016938: 90 10 00 1d mov %i5, %o0
if ( !information )
4001693c: 80 a2 20 00 cmp %o0, 0
40016940: 02 80 00 34 be 40016a10 <_Objects_Get_name_as_string+0xfc>
40016944: 92 10 00 1d mov %i5, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
40016948: 7f ff e3 30 call 4000f608 <_Objects_Get>
4001694c: 94 07 bf f4 add %fp, -12, %o2
switch ( location ) {
40016950: c2 07 bf f4 ld [ %fp + -12 ], %g1
40016954: 80 a0 60 00 cmp %g1, 0
40016958: 32 80 00 2f bne,a 40016a14 <_Objects_Get_name_as_string+0x100>
4001695c: 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;
40016960: 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';
40016964: 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;
40016968: 87 30 60 18 srl %g1, 0x18, %g3
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
4001696c: 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;
40016970: 89 30 60 10 srl %g1, 0x10, %g4
lname[ 2 ] = (u32_name >> 8) & 0xff;
40016974: 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;
40016978: c6 2f bf f8 stb %g3, [ %fp + -8 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
4001697c: c8 2f bf f9 stb %g4, [ %fp + -7 ]
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
40016980: c2 2f bf fb stb %g1, [ %fp + -5 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
40016984: b2 86 7f ff addcc %i1, -1, %i1
40016988: 02 80 00 25 be 40016a1c <_Objects_Get_name_as_string+0x108><== NEVER TAKEN
4001698c: 84 10 00 03 mov %g3, %g2
40016990: 80 a0 e0 00 cmp %g3, 0
40016994: 02 80 00 17 be 400169f0 <_Objects_Get_name_as_string+0xdc>
40016998: 86 10 00 1a mov %i2, %g3
4001699c: 39 10 00 be sethi %hi(0x4002f800), %i4
400169a0: 82 10 20 00 clr %g1
400169a4: 10 80 00 06 b 400169bc <_Objects_Get_name_as_string+0xa8>
400169a8: b8 17 21 a8 or %i4, 0x1a8, %i4
400169ac: fa 49 00 01 ldsb [ %g4 + %g1 ], %i5
400169b0: 80 a7 60 00 cmp %i5, 0
400169b4: 02 80 00 0f be 400169f0 <_Objects_Get_name_as_string+0xdc>
400169b8: c4 08 40 04 ldub [ %g1 + %g4 ], %g2
*d = (isprint((unsigned char)*s)) ? *s : '*';
400169bc: fa 07 00 00 ld [ %i4 ], %i5
400169c0: 88 08 a0 ff and %g2, 0xff, %g4
400169c4: 88 07 40 04 add %i5, %g4, %g4
400169c8: fa 49 20 01 ldsb [ %g4 + 1 ], %i5
400169cc: 80 8f 60 97 btst 0x97, %i5
400169d0: 12 80 00 03 bne 400169dc <_Objects_Get_name_as_string+0xc8>
400169d4: 88 07 bf f8 add %fp, -8, %g4
400169d8: 84 10 20 2a mov 0x2a, %g2
400169dc: c4 28 c0 00 stb %g2, [ %g3 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
400169e0: 82 00 60 01 inc %g1
400169e4: 80 a0 40 19 cmp %g1, %i1
400169e8: 12 bf ff f1 bne 400169ac <_Objects_Get_name_as_string+0x98>
400169ec: 86 00 e0 01 inc %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
400169f0: c0 28 c0 00 clrb [ %g3 ]
_Thread_Enable_dispatch();
400169f4: 7f ff e7 02 call 400105fc <_Thread_Enable_dispatch>
400169f8: b0 10 00 1a mov %i2, %i0
return name;
}
return NULL; /* unreachable path */
}
400169fc: 81 c7 e0 08 ret
40016a00: 81 e8 00 00 restore
return NULL;
if ( name == NULL )
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
40016a04: c2 00 60 20 ld [ %g1 + 0x20 ], %g1
40016a08: 10 bf ff cb b 40016934 <_Objects_Get_name_as_string+0x20>
40016a0c: fa 00 60 08 ld [ %g1 + 8 ], %i5
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
40016a10: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
40016a14: 81 c7 e0 08 ret
40016a18: 91 e8 00 1a restore %g0, %i2, %o0
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
40016a1c: 10 bf ff f5 b 400169f0 <_Objects_Get_name_as_string+0xdc> <== NOT EXECUTED
40016a20: 86 10 00 1a mov %i2, %g3 <== NOT EXECUTED
400191fc <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
400191fc: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
40019200: 80 a6 20 00 cmp %i0, 0
40019204: 02 80 00 29 be 400192a8 <_Objects_Get_next+0xac>
40019208: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( !location_p )
4001920c: 02 80 00 27 be 400192a8 <_Objects_Get_next+0xac>
40019210: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
40019214: 02 80 00 25 be 400192a8 <_Objects_Get_next+0xac>
40019218: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
4001921c: 80 a0 60 00 cmp %g1, 0
40019220: 22 80 00 13 be,a 4001926c <_Objects_Get_next+0x70>
40019224: 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)
40019228: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
4001922c: 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);
40019230: 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)
40019234: 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);
40019238: 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)
4001923c: 80 a0 80 01 cmp %g2, %g1
40019240: 0a 80 00 13 bcs 4001928c <_Objects_Get_next+0x90>
40019244: 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);
40019248: 7f ff d8 f0 call 4000f608 <_Objects_Get>
4001924c: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
40019250: c2 06 80 00 ld [ %i2 ], %g1
40019254: 80 a0 60 00 cmp %g1, 0
40019258: 32 bf ff f5 bne,a 4001922c <_Objects_Get_next+0x30>
4001925c: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
*next_id_p = next_id;
40019260: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
40019264: 81 c7 e0 08 ret
40019268: 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)
4001926c: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
40019270: 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);
40019274: 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)
40019278: 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);
4001927c: 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)
40019280: 80 a0 80 01 cmp %g2, %g1
40019284: 1a bf ff f1 bcc 40019248 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN
40019288: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
4001928c: 82 10 20 01 mov 1, %g1
40019290: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
40019294: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
40019298: 82 10 3f ff mov -1, %g1
4001929c: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
400192a0: 81 c7 e0 08 ret
400192a4: 91 e8 00 08 restore %g0, %o0, %o0
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
400192a8: 10 bf ff ef b 40019264 <_Objects_Get_next+0x68>
400192ac: 90 10 20 00 clr %o0
4001a318 <_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;
4001a318: c4 02 20 08 ld [ %o0 + 8 ], %g2
if ( information->maximum >= index ) {
4001a31c: 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;
4001a320: 92 22 40 02 sub %o1, %g2, %o1
4001a324: 92 02 60 01 inc %o1
if ( information->maximum >= index ) {
4001a328: 80 a2 40 01 cmp %o1, %g1
4001a32c: 18 80 00 09 bgu 4001a350 <_Objects_Get_no_protection+0x38>
4001a330: 93 2a 60 02 sll %o1, 2, %o1
if ( (the_object = information->local_table[ index ]) != NULL ) {
4001a334: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
4001a338: d0 00 40 09 ld [ %g1 + %o1 ], %o0
4001a33c: 80 a2 20 00 cmp %o0, 0
4001a340: 02 80 00 05 be 4001a354 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN
4001a344: 82 10 20 01 mov 1, %g1
*location = OBJECTS_LOCAL;
return the_object;
4001a348: 81 c3 e0 08 retl
4001a34c: 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;
4001a350: 82 10 20 01 mov 1, %g1
return NULL;
4001a354: 90 10 20 00 clr %o0
}
4001a358: 81 c3 e0 08 retl
4001a35c: c2 22 80 00 st %g1, [ %o2 ]
4000f67c <_Objects_Id_to_name>:
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
4000f67c: 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;
4000f680: 80 a6 20 00 cmp %i0, 0
4000f684: 12 80 00 06 bne 4000f69c <_Objects_Id_to_name+0x20>
4000f688: 83 36 20 18 srl %i0, 0x18, %g1
4000f68c: 03 10 00 c3 sethi %hi(0x40030c00), %g1
4000f690: c2 00 60 20 ld [ %g1 + 0x20 ], %g1 ! 40030c20 <_Per_CPU_Information+0x10>
4000f694: f0 00 60 08 ld [ %g1 + 8 ], %i0
4000f698: 83 36 20 18 srl %i0, 0x18, %g1
4000f69c: 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 )
4000f6a0: 84 00 7f ff add %g1, -1, %g2
4000f6a4: 80 a0 a0 02 cmp %g2, 2
4000f6a8: 18 80 00 18 bgu 4000f708 <_Objects_Id_to_name+0x8c>
4000f6ac: 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 ] )
4000f6b0: 05 10 00 c2 sethi %hi(0x40030800), %g2
4000f6b4: 84 10 a1 34 or %g2, 0x134, %g2 ! 40030934 <_Objects_Information_table>
4000f6b8: c2 00 80 01 ld [ %g2 + %g1 ], %g1
4000f6bc: 80 a0 60 00 cmp %g1, 0
4000f6c0: 02 80 00 12 be 4000f708 <_Objects_Id_to_name+0x8c>
4000f6c4: 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 ];
4000f6c8: 85 28 a0 02 sll %g2, 2, %g2
4000f6cc: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
4000f6d0: 80 a2 20 00 cmp %o0, 0
4000f6d4: 02 80 00 0d be 4000f708 <_Objects_Id_to_name+0x8c> <== NEVER TAKEN
4000f6d8: 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 );
4000f6dc: 7f ff ff cb call 4000f608 <_Objects_Get>
4000f6e0: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
4000f6e4: 80 a2 20 00 cmp %o0, 0
4000f6e8: 02 80 00 08 be 4000f708 <_Objects_Id_to_name+0x8c>
4000f6ec: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
4000f6f0: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
4000f6f4: 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();
4000f6f8: 40 00 03 c1 call 400105fc <_Thread_Enable_dispatch>
4000f6fc: c2 26 40 00 st %g1, [ %i1 ]
4000f700: 81 c7 e0 08 ret
4000f704: 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;
4000f708: 81 c7 e0 08 ret
4000f70c: 91 e8 20 03 restore %g0, 3, %o0
400090d0 <_Objects_Shrink_information>:
#include <rtems/score/isr.h>
void _Objects_Shrink_information(
Objects_Information *information
)
{
400090d0: 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 );
400090d4: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
block_count = (information->maximum - index_base) /
400090d8: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
400090dc: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
400090e0: 92 10 00 1b mov %i3, %o1
400090e4: 40 00 3a 38 call 400179c4 <.udiv>
400090e8: 90 22 00 1c sub %o0, %i4, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
400090ec: 80 a2 20 00 cmp %o0, 0
400090f0: 02 80 00 36 be 400091c8 <_Objects_Shrink_information+0xf8><== NEVER TAKEN
400090f4: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
400090f8: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
400090fc: c2 01 00 00 ld [ %g4 ], %g1
40009100: 80 a6 c0 01 cmp %i3, %g1
40009104: 02 80 00 0f be 40009140 <_Objects_Shrink_information+0x70><== NEVER TAKEN
40009108: 82 10 20 00 clr %g1
4000910c: 10 80 00 07 b 40009128 <_Objects_Shrink_information+0x58>
40009110: ba 10 20 04 mov 4, %i5
40009114: c4 01 00 1d ld [ %g4 + %i5 ], %g2
40009118: 80 a6 c0 02 cmp %i3, %g2
4000911c: 02 80 00 0a be 40009144 <_Objects_Shrink_information+0x74>
40009120: 86 07 60 04 add %i5, 4, %g3
40009124: 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++ ) {
40009128: 82 00 60 01 inc %g1
4000912c: 80 a0 40 08 cmp %g1, %o0
40009130: 12 bf ff f9 bne 40009114 <_Objects_Shrink_information+0x44>
40009134: b8 07 00 1b add %i4, %i3, %i4
40009138: 81 c7 e0 08 ret
4000913c: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
40009140: 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 );
40009144: 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;
40009148: d0 06 20 20 ld [ %i0 + 0x20 ], %o0
4000914c: 10 80 00 05 b 40009160 <_Objects_Shrink_information+0x90>
40009150: 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 );
40009154: 90 96 e0 00 orcc %i3, 0, %o0
40009158: 22 80 00 12 be,a 400091a0 <_Objects_Shrink_information+0xd0>
4000915c: 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 );
40009160: c2 02 20 08 ld [ %o0 + 8 ], %g1
40009164: 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) &&
40009168: 80 a0 40 1c cmp %g1, %i4
4000916c: 0a bf ff fa bcs 40009154 <_Objects_Shrink_information+0x84>
40009170: f6 02 00 00 ld [ %o0 ], %i3
(index < (index_base + information->allocation_size))) {
40009174: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
40009178: 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) &&
4000917c: 80 a0 40 02 cmp %g1, %g2
40009180: 3a bf ff f6 bcc,a 40009158 <_Objects_Shrink_information+0x88>
40009184: 90 96 e0 00 orcc %i3, 0, %o0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
40009188: 40 00 0e 08 call 4000c9a8 <_Chain_Extract>
4000918c: 01 00 00 00 nop
}
}
while ( the_object );
40009190: 90 96 e0 00 orcc %i3, 0, %o0
40009194: 32 bf ff f4 bne,a 40009164 <_Objects_Shrink_information+0x94><== ALWAYS TAKEN
40009198: 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 ] );
4000919c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
400091a0: 40 00 07 6f call 4000af5c <_Workspace_Free>
400091a4: d0 00 40 1d ld [ %g1 + %i5 ], %o0
information->object_blocks[ block ] = NULL;
400091a8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
400091ac: 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;
400091b0: c0 20 40 1d clr [ %g1 + %i5 ]
information->inactive_per_block[ block ] = 0;
400091b4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
400091b8: 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;
400091bc: c0 20 c0 1d clr [ %g3 + %i5 ]
information->inactive -= information->allocation_size;
400091c0: 82 20 80 01 sub %g2, %g1, %g1
400091c4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
400091c8: 81 c7 e0 08 ret
400091cc: 81 e8 00 00 restore
40009d60 <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
40009d60: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if (!the_node) return;
40009d64: 80 a6 60 00 cmp %i1, 0
40009d68: 02 80 00 4c be 40009e98 <_RBTree_Extract_unprotected+0x138>
40009d6c: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
40009d70: c2 06 20 08 ld [ %i0 + 8 ], %g1
40009d74: 80 a0 40 19 cmp %g1, %i1
40009d78: 02 80 00 56 be 40009ed0 <_RBTree_Extract_unprotected+0x170>
40009d7c: 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]) {
40009d80: c2 06 20 0c ld [ %i0 + 0xc ], %g1
40009d84: 80 a0 40 19 cmp %g1, %i1
40009d88: 02 80 00 56 be 40009ee0 <_RBTree_Extract_unprotected+0x180>
40009d8c: 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]) {
40009d90: fa 06 60 04 ld [ %i1 + 4 ], %i5
40009d94: 80 a7 60 00 cmp %i5, 0
40009d98: 22 80 00 5a be,a 40009f00 <_RBTree_Extract_unprotected+0x1a0>
40009d9c: f8 06 60 08 ld [ %i1 + 8 ], %i4
40009da0: c2 06 60 08 ld [ %i1 + 8 ], %g1
40009da4: 80 a0 60 00 cmp %g1, 0
40009da8: 32 80 00 05 bne,a 40009dbc <_RBTree_Extract_unprotected+0x5c>
40009dac: c2 07 60 08 ld [ %i5 + 8 ], %g1
40009db0: 10 80 00 3c b 40009ea0 <_RBTree_Extract_unprotected+0x140>
40009db4: 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];
40009db8: c2 07 60 08 ld [ %i5 + 8 ], %g1
40009dbc: 80 a0 60 00 cmp %g1, 0
40009dc0: 32 bf ff fe bne,a 40009db8 <_RBTree_Extract_unprotected+0x58>
40009dc4: 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];
40009dc8: f8 07 60 04 ld [ %i5 + 4 ], %i4
if(leaf) {
40009dcc: 80 a7 20 00 cmp %i4, 0
40009dd0: 02 80 00 48 be 40009ef0 <_RBTree_Extract_unprotected+0x190>
40009dd4: 01 00 00 00 nop
leaf->parent = target->parent;
40009dd8: c2 07 40 00 ld [ %i5 ], %g1
40009ddc: 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];
40009de0: 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];
40009de4: 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];
40009de8: 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;
40009dec: c6 07 60 0c ld [ %i5 + 0xc ], %g3
dir = target != target->parent->child[0];
40009df0: 88 1f 40 04 xor %i5, %g4, %g4
40009df4: 80 a0 00 04 cmp %g0, %g4
40009df8: 88 40 20 00 addx %g0, 0, %g4
target->parent->child[dir] = leaf;
40009dfc: 89 29 20 02 sll %g4, 2, %g4
40009e00: 84 00 80 04 add %g2, %g4, %g2
40009e04: f8 20 a0 04 st %i4, [ %g2 + 4 ]
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
40009e08: c4 00 60 04 ld [ %g1 + 4 ], %g2
40009e0c: 84 18 80 19 xor %g2, %i1, %g2
40009e10: 80 a0 00 02 cmp %g0, %g2
40009e14: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = target;
40009e18: 85 28 a0 02 sll %g2, 2, %g2
40009e1c: 82 00 40 02 add %g1, %g2, %g1
40009e20: 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];
40009e24: c2 06 60 08 ld [ %i1 + 8 ], %g1
40009e28: c2 27 60 08 st %g1, [ %i5 + 8 ]
if (the_node->child[RBT_RIGHT])
40009e2c: c2 06 60 08 ld [ %i1 + 8 ], %g1
40009e30: 80 a0 60 00 cmp %g1, 0
40009e34: 32 80 00 02 bne,a 40009e3c <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN
40009e38: fa 20 40 00 st %i5, [ %g1 ]
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
40009e3c: c2 06 60 04 ld [ %i1 + 4 ], %g1
40009e40: c2 27 60 04 st %g1, [ %i5 + 4 ]
if (the_node->child[RBT_LEFT])
40009e44: c2 06 60 04 ld [ %i1 + 4 ], %g1
40009e48: 80 a0 60 00 cmp %g1, 0
40009e4c: 32 80 00 02 bne,a 40009e54 <_RBTree_Extract_unprotected+0xf4>
40009e50: 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;
40009e54: c4 06 40 00 ld [ %i1 ], %g2
target->color = the_node->color;
40009e58: 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;
40009e5c: c4 27 40 00 st %g2, [ %i5 ]
target->color = the_node->color;
40009e60: 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 */
40009e64: 80 a0 e0 00 cmp %g3, 0
40009e68: 32 80 00 06 bne,a 40009e80 <_RBTree_Extract_unprotected+0x120>
40009e6c: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (leaf) {
40009e70: 80 a7 20 00 cmp %i4, 0
40009e74: 32 80 00 02 bne,a 40009e7c <_RBTree_Extract_unprotected+0x11c>
40009e78: 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;
40009e7c: 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;
40009e80: c0 26 60 08 clr [ %i1 + 8 ]
40009e84: c0 26 60 04 clr [ %i1 + 4 ]
40009e88: 80 a0 60 00 cmp %g1, 0
40009e8c: 02 80 00 03 be 40009e98 <_RBTree_Extract_unprotected+0x138>
40009e90: c0 26 40 00 clr [ %i1 ]
40009e94: c0 20 60 0c clr [ %g1 + 0xc ]
40009e98: 81 c7 e0 08 ret
40009e9c: 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;
40009ea0: c2 06 40 00 ld [ %i1 ], %g1
40009ea4: 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];
40009ea8: 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;
40009eac: c6 06 60 0c ld [ %i1 + 0xc ], %g3
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
40009eb0: c4 00 60 04 ld [ %g1 + 4 ], %g2
40009eb4: 84 18 80 19 xor %g2, %i1, %g2
40009eb8: 80 a0 00 02 cmp %g0, %g2
40009ebc: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = leaf;
40009ec0: 85 28 a0 02 sll %g2, 2, %g2
40009ec4: 82 00 40 02 add %g1, %g2, %g1
40009ec8: 10 bf ff e7 b 40009e64 <_RBTree_Extract_unprotected+0x104>
40009ecc: 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 );
40009ed0: 40 00 00 eb call 4000a27c <_RBTree_Next_unprotected>
40009ed4: 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;
40009ed8: 10 bf ff aa b 40009d80 <_RBTree_Extract_unprotected+0x20>
40009edc: 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 );
40009ee0: 40 00 00 e7 call 4000a27c <_RBTree_Next_unprotected>
40009ee4: 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;
40009ee8: 10 bf ff aa b 40009d90 <_RBTree_Extract_unprotected+0x30>
40009eec: 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);
40009ef0: 7f ff fe d3 call 40009a3c <_RBTree_Extract_validate_unprotected>
40009ef4: 90 10 00 1d mov %i5, %o0
}
victim_color = target->color;
dir = target != target->parent->child[0];
40009ef8: 10 bf ff bb b 40009de4 <_RBTree_Extract_unprotected+0x84>
40009efc: 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 ) {
40009f00: 80 a7 20 00 cmp %i4, 0
40009f04: 32 bf ff e8 bne,a 40009ea4 <_RBTree_Extract_unprotected+0x144>
40009f08: 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);
40009f0c: 7f ff fe cc call 40009a3c <_RBTree_Extract_validate_unprotected>
40009f10: 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];
40009f14: 10 bf ff e6 b 40009eac <_RBTree_Extract_unprotected+0x14c>
40009f18: c2 06 40 00 ld [ %i1 ], %g1
40009a3c <_RBTree_Extract_validate_unprotected>:
)
{
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
40009a3c: c2 02 00 00 ld [ %o0 ], %g1
if(!parent->parent) return;
40009a40: c4 00 40 00 ld [ %g1 ], %g2
40009a44: 80 a0 a0 00 cmp %g2, 0
40009a48: 02 80 00 3f be 40009b44 <_RBTree_Extract_validate_unprotected+0x108>
40009a4c: 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])
40009a50: c4 00 60 04 ld [ %g1 + 4 ], %g2
40009a54: 80 a2 00 02 cmp %o0, %g2
40009a58: 22 80 00 02 be,a 40009a60 <_RBTree_Extract_validate_unprotected+0x24>
40009a5c: 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);
40009a60: c6 02 20 0c ld [ %o0 + 0xc ], %g3
40009a64: 80 a0 e0 01 cmp %g3, 1
40009a68: 02 80 00 32 be 40009b30 <_RBTree_Extract_validate_unprotected+0xf4>
40009a6c: 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) {
40009a70: c6 00 40 00 ld [ %g1 ], %g3
40009a74: 80 a0 e0 00 cmp %g3, 0
40009a78: 02 80 00 2e be 40009b30 <_RBTree_Extract_validate_unprotected+0xf4>
40009a7c: 80 a0 a0 00 cmp %g2, 0
40009a80: 22 80 00 07 be,a 40009a9c <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN
40009a84: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED
40009a88: c8 00 a0 0c ld [ %g2 + 0xc ], %g4
40009a8c: 80 a1 20 01 cmp %g4, 1
40009a90: 22 80 00 63 be,a 40009c1c <_RBTree_Extract_validate_unprotected+0x1e0>
40009a94: 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]) &&
40009a98: c6 00 a0 08 ld [ %g2 + 8 ], %g3
40009a9c: 80 a0 e0 00 cmp %g3, 0
40009aa0: 22 80 00 07 be,a 40009abc <_RBTree_Extract_validate_unprotected+0x80>
40009aa4: c6 00 a0 04 ld [ %g2 + 4 ], %g3
40009aa8: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
40009aac: 80 a0 e0 01 cmp %g3, 1
40009ab0: 22 80 00 29 be,a 40009b54 <_RBTree_Extract_validate_unprotected+0x118>
40009ab4: c6 00 60 04 ld [ %g1 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
40009ab8: c6 00 a0 04 ld [ %g2 + 4 ], %g3
40009abc: 80 a0 e0 00 cmp %g3, 0
40009ac0: 22 80 00 07 be,a 40009adc <_RBTree_Extract_validate_unprotected+0xa0>
40009ac4: da 20 a0 0c st %o5, [ %g2 + 0xc ]
40009ac8: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
40009acc: 80 a0 e0 01 cmp %g3, 1
40009ad0: 22 80 00 21 be,a 40009b54 <_RBTree_Extract_validate_unprotected+0x118>
40009ad4: c6 00 60 04 ld [ %g1 + 4 ], %g3
sibling->color = RBT_RED;
40009ad8: da 20 a0 0c st %o5, [ %g2 + 0xc ]
40009adc: c4 00 60 0c ld [ %g1 + 0xc ], %g2
40009ae0: 80 a0 a0 01 cmp %g2, 1
40009ae4: 22 80 00 99 be,a 40009d48 <_RBTree_Extract_validate_unprotected+0x30c>
40009ae8: 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;
40009aec: 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;
40009af0: 80 a0 e0 00 cmp %g3, 0
40009af4: 02 80 00 6c be 40009ca4 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN
40009af8: 90 10 00 01 mov %g1, %o0
if(!(the_node->parent->parent)) return NULL;
40009afc: c4 00 c0 00 ld [ %g3 ], %g2
40009b00: 80 a0 a0 00 cmp %g2, 0
40009b04: 02 80 00 69 be 40009ca8 <_RBTree_Extract_validate_unprotected+0x26c>
40009b08: 84 10 20 00 clr %g2
if(the_node == the_node->parent->child[RBT_LEFT])
40009b0c: c4 00 e0 04 ld [ %g3 + 4 ], %g2
40009b10: 80 a0 40 02 cmp %g1, %g2
40009b14: 22 80 00 0e be,a 40009b4c <_RBTree_Extract_validate_unprotected+0x110>
40009b18: 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;
40009b1c: 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);
40009b20: c6 02 20 0c ld [ %o0 + 0xc ], %g3
40009b24: 80 a0 e0 01 cmp %g3, 1
40009b28: 32 bf ff d3 bne,a 40009a74 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN
40009b2c: 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;
40009b30: c2 02 00 00 ld [ %o0 ], %g1
40009b34: c2 00 40 00 ld [ %g1 ], %g1
40009b38: 80 a0 60 00 cmp %g1, 0
40009b3c: 02 80 00 5f be 40009cb8 <_RBTree_Extract_validate_unprotected+0x27c>
40009b40: 01 00 00 00 nop
40009b44: 81 c3 e0 08 retl
40009b48: 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;
40009b4c: 10 bf ff f5 b 40009b20 <_RBTree_Extract_validate_unprotected+0xe4>
40009b50: 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];
40009b54: 86 1a 00 03 xor %o0, %g3, %g3
40009b58: 80 a0 00 03 cmp %g0, %g3
40009b5c: 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);
40009b60: 86 1b 60 01 xor %o5, 1, %g3
if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) {
40009b64: 87 28 e0 02 sll %g3, 2, %g3
40009b68: 88 00 80 03 add %g2, %g3, %g4
40009b6c: 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);
40009b70: 80 a1 20 00 cmp %g4, 0
40009b74: 22 80 00 07 be,a 40009b90 <_RBTree_Extract_validate_unprotected+0x154>
40009b78: 9b 2b 60 02 sll %o5, 2, %o5
40009b7c: d8 01 20 0c ld [ %g4 + 0xc ], %o4
40009b80: 80 a3 20 01 cmp %o4, 1
40009b84: 22 80 00 4f be,a 40009cc0 <_RBTree_Extract_validate_unprotected+0x284>
40009b88: d6 00 60 0c ld [ %g1 + 0xc ], %o3
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
40009b8c: 9b 2b 60 02 sll %o5, 2, %o5
40009b90: 98 00 80 0d add %g2, %o5, %o4
40009b94: 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;
40009b98: 96 10 20 01 mov 1, %o3
40009b9c: 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;
40009ba0: 80 a1 20 00 cmp %g4, 0
40009ba4: 02 80 00 15 be 40009bf8 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN
40009ba8: 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];
40009bac: 96 01 00 03 add %g4, %g3, %o3
40009bb0: d4 02 e0 04 ld [ %o3 + 4 ], %o2
40009bb4: d4 23 20 04 st %o2, [ %o4 + 4 ]
if (c->child[dir])
40009bb8: d8 02 e0 04 ld [ %o3 + 4 ], %o4
40009bbc: 80 a3 20 00 cmp %o4, 0
40009bc0: 32 80 00 02 bne,a 40009bc8 <_RBTree_Extract_validate_unprotected+0x18c>
40009bc4: 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;
40009bc8: 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;
40009bcc: 96 01 00 03 add %g4, %g3, %o3
40009bd0: c4 22 e0 04 st %g2, [ %o3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
40009bd4: d6 03 20 04 ld [ %o4 + 4 ], %o3
c->parent = the_node->parent;
40009bd8: 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;
40009bdc: 96 18 80 0b xor %g2, %o3, %o3
c->parent = the_node->parent;
the_node->parent = c;
40009be0: 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;
40009be4: 80 a0 00 0b cmp %g0, %o3
40009be8: 84 40 20 00 addx %g0, 0, %g2
40009bec: 85 28 a0 02 sll %g2, 2, %g2
40009bf0: 98 03 00 02 add %o4, %g2, %o4
40009bf4: 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;
40009bf8: 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)];
40009bfc: 84 00 40 03 add %g1, %g3, %g2
40009c00: c4 00 a0 04 ld [ %g2 + 4 ], %g2
}
sibling->color = parent->color;
40009c04: c8 20 a0 0c st %g4, [ %g2 + 0xc ]
40009c08: 88 00 80 03 add %g2, %g3, %g4
40009c0c: c8 01 20 04 ld [ %g4 + 4 ], %g4
parent->color = RBT_BLACK;
40009c10: c0 20 60 0c clr [ %g1 + 0xc ]
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
40009c14: 10 80 00 33 b 40009ce0 <_RBTree_Extract_validate_unprotected+0x2a4>
40009c18: 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;
40009c1c: c8 20 60 0c st %g4, [ %g1 + 0xc ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
40009c20: 88 1b 00 08 xor %o4, %o0, %g4
40009c24: 80 a0 00 04 cmp %g0, %g4
40009c28: 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);
40009c2c: 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;
40009c30: 97 2a e0 02 sll %o3, 2, %o3
40009c34: 98 00 40 0b add %g1, %o3, %o4
40009c38: c8 03 20 04 ld [ %o4 + 4 ], %g4
40009c3c: 80 a1 20 00 cmp %g4, 0
40009c40: 02 80 00 1c be 40009cb0 <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN
40009c44: 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];
40009c48: 95 2a a0 02 sll %o2, 2, %o2
40009c4c: 84 01 00 0a add %g4, %o2, %g2
40009c50: d2 00 a0 04 ld [ %g2 + 4 ], %o1
40009c54: d2 23 20 04 st %o1, [ %o4 + 4 ]
if (c->child[dir])
40009c58: c4 00 a0 04 ld [ %g2 + 4 ], %g2
40009c5c: 80 a0 a0 00 cmp %g2, 0
40009c60: 02 80 00 04 be 40009c70 <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN
40009c64: 94 01 00 0a add %g4, %o2, %o2
c->child[dir]->parent = the_node;
40009c68: c2 20 80 00 st %g1, [ %g2 ]
40009c6c: c6 00 40 00 ld [ %g1 ], %g3
c->child[dir] = the_node;
40009c70: c2 22 a0 04 st %g1, [ %o2 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
40009c74: c4 00 e0 04 ld [ %g3 + 4 ], %g2
c->parent = the_node->parent;
40009c78: 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;
40009c7c: 84 18 40 02 xor %g1, %g2, %g2
40009c80: 80 a0 00 02 cmp %g0, %g2
40009c84: 84 40 20 00 addx %g0, 0, %g2
40009c88: 85 28 a0 02 sll %g2, 2, %g2
40009c8c: 96 00 40 0b add %g1, %o3, %o3
40009c90: 86 00 c0 02 add %g3, %g2, %g3
c->parent = the_node->parent;
the_node->parent = c;
40009c94: 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;
40009c98: c8 20 e0 04 st %g4, [ %g3 + 4 ]
40009c9c: 10 bf ff 7f b 40009a98 <_RBTree_Extract_validate_unprotected+0x5c>
40009ca0: 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;
40009ca4: 84 10 20 00 clr %g2 <== NOT EXECUTED
40009ca8: 10 bf ff 9e b 40009b20 <_RBTree_Extract_validate_unprotected+0xe4>
40009cac: 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;
40009cb0: 10 bf ff 7a b 40009a98 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED
40009cb4: 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;
40009cb8: 81 c3 e0 08 retl
40009cbc: c0 22 20 0c clr [ %o0 + 0xc ]
40009cc0: 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;
40009cc4: d6 20 a0 0c st %o3, [ %g2 + 0xc ]
parent->color = RBT_BLACK;
40009cc8: c0 20 60 0c clr [ %g1 + 0xc ]
40009ccc: c4 03 20 04 ld [ %o4 + 4 ], %g2
40009cd0: 80 a0 a0 00 cmp %g2, 0
40009cd4: 02 bf ff 97 be 40009b30 <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN
40009cd8: c0 21 20 0c clr [ %g4 + 0xc ]
40009cdc: 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];
40009ce0: 88 00 80 0d add %g2, %o5, %g4
40009ce4: d8 01 20 04 ld [ %g4 + 4 ], %o4
40009ce8: 86 00 40 03 add %g1, %g3, %g3
40009cec: d8 20 e0 04 st %o4, [ %g3 + 4 ]
if (c->child[dir])
40009cf0: c6 01 20 04 ld [ %g4 + 4 ], %g3
40009cf4: 80 a0 e0 00 cmp %g3, 0
40009cf8: 32 80 00 02 bne,a 40009d00 <_RBTree_Extract_validate_unprotected+0x2c4>
40009cfc: 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;
40009d00: 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;
40009d04: 9a 00 80 0d add %g2, %o5, %o5
40009d08: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
40009d0c: c8 00 e0 04 ld [ %g3 + 4 ], %g4
c->parent = the_node->parent;
40009d10: c6 20 80 00 st %g3, [ %g2 ]
the_node->parent = c;
40009d14: 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;
40009d18: 88 18 40 04 xor %g1, %g4, %g4
40009d1c: 80 a0 00 04 cmp %g0, %g4
40009d20: 82 40 20 00 addx %g0, 0, %g1
40009d24: 83 28 60 02 sll %g1, 2, %g1
40009d28: 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;
40009d2c: c2 02 00 00 ld [ %o0 ], %g1
40009d30: c4 20 e0 04 st %g2, [ %g3 + 4 ]
40009d34: c2 00 40 00 ld [ %g1 ], %g1
40009d38: 80 a0 60 00 cmp %g1, 0
40009d3c: 12 bf ff 82 bne 40009b44 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
40009d40: 01 00 00 00 nop
40009d44: 30 bf ff dd b,a 40009cb8 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
40009d48: c2 02 00 00 ld [ %o0 ], %g1
40009d4c: c2 00 40 00 ld [ %g1 ], %g1
40009d50: 80 a0 60 00 cmp %g1, 0
40009d54: 12 bf ff 7c bne 40009b44 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
40009d58: 01 00 00 00 nop
40009d5c: 30 bf ff d7 b,a 40009cb8 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
4000a9d8 <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
RBTree_Node *search_node
)
{
4000a9d8: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
4000a9dc: 7f ff e3 75 call 400037b0 <sparc_disable_interrupts>
4000a9e0: b8 10 00 18 mov %i0, %i4
4000a9e4: 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;
4000a9e8: fa 06 20 04 ld [ %i0 + 4 ], %i5
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
4000a9ec: 80 a7 60 00 cmp %i5, 0
4000a9f0: 02 80 00 15 be 4000aa44 <_RBTree_Find+0x6c> <== NEVER TAKEN
4000a9f4: b0 10 20 00 clr %i0
compare_result = the_rbtree->compare_function(the_node, iter_node);
4000a9f8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
4000a9fc: 92 10 00 1d mov %i5, %o1
4000aa00: 9f c0 40 00 call %g1
4000aa04: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
4000aa08: 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 ) ) {
4000aa0c: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
4000aa10: 82 20 40 08 sub %g1, %o0, %g1
4000aa14: 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];
4000aa18: 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 ) ) {
4000aa1c: 12 80 00 06 bne 4000aa34 <_RBTree_Find+0x5c>
4000aa20: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
4000aa24: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
4000aa28: 80 a0 a0 00 cmp %g2, 0
4000aa2c: 12 80 00 0a bne 4000aa54 <_RBTree_Find+0x7c>
4000aa30: b0 10 00 1d mov %i5, %i0
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
4000aa34: 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) {
4000aa38: 80 a7 60 00 cmp %i5, 0
4000aa3c: 32 bf ff f0 bne,a 4000a9fc <_RBTree_Find+0x24>
4000aa40: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return_node = _RBTree_Find_unprotected( the_rbtree, search_node );
_ISR_Enable( level );
4000aa44: 7f ff e3 5f call 400037c0 <sparc_enable_interrupts>
4000aa48: 90 10 00 1b mov %i3, %o0
return return_node;
}
4000aa4c: 81 c7 e0 08 ret
4000aa50: 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 );
4000aa54: 7f ff e3 5b call 400037c0 <sparc_enable_interrupts>
4000aa58: 90 10 00 1b mov %i3, %o0
return return_node;
}
4000aa5c: 81 c7 e0 08 ret
4000aa60: 81 e8 00 00 restore
4000ae44 <_RBTree_Initialize>:
void *starting_address,
size_t number_nodes,
size_t node_size,
bool is_unique
)
{
4000ae44: 9d e3 bf a0 save %sp, -96, %sp
size_t count;
RBTree_Node *next;
/* TODO: Error message? */
if (!the_rbtree) return;
4000ae48: 80 a6 20 00 cmp %i0, 0
4000ae4c: 02 80 00 0f be 4000ae88 <_RBTree_Initialize+0x44> <== NEVER TAKEN
4000ae50: 80 a6 e0 00 cmp %i3, 0
RBTree_Control *the_rbtree,
RBTree_Compare_function compare_function,
bool is_unique
)
{
the_rbtree->permanent_null = NULL;
4000ae54: c0 26 00 00 clr [ %i0 ]
the_rbtree->root = NULL;
4000ae58: c0 26 20 04 clr [ %i0 + 4 ]
the_rbtree->first[0] = NULL;
4000ae5c: c0 26 20 08 clr [ %i0 + 8 ]
the_rbtree->first[1] = NULL;
4000ae60: c0 26 20 0c clr [ %i0 + 0xc ]
the_rbtree->compare_function = compare_function;
4000ae64: 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-- ) {
4000ae68: 02 80 00 08 be 4000ae88 <_RBTree_Initialize+0x44> <== NEVER TAKEN
4000ae6c: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ]
_RBTree_Insert_unprotected(the_rbtree, next);
4000ae70: 92 10 00 1a mov %i2, %o1
4000ae74: 7f ff ff 0b call 4000aaa0 <_RBTree_Insert_unprotected>
4000ae78: 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-- ) {
4000ae7c: b6 86 ff ff addcc %i3, -1, %i3
4000ae80: 12 bf ff fc bne 4000ae70 <_RBTree_Initialize+0x2c>
4000ae84: b4 06 80 1c add %i2, %i4, %i2
4000ae88: 81 c7 e0 08 ret
4000ae8c: 81 e8 00 00 restore
40009f40 <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
40009f40: 9d e3 bf a0 save %sp, -96, %sp
if(!the_node) return (RBTree_Node*)-1;
40009f44: 80 a6 60 00 cmp %i1, 0
40009f48: 02 80 00 9c be 4000a1b8 <_RBTree_Insert_unprotected+0x278>
40009f4c: b8 10 00 18 mov %i0, %i4
RBTree_Node *iter_node = the_rbtree->root;
40009f50: fa 06 20 04 ld [ %i0 + 4 ], %i5
int compare_result;
if (!iter_node) { /* special case: first node inserted */
40009f54: 80 a7 60 00 cmp %i5, 0
40009f58: 32 80 00 05 bne,a 40009f6c <_RBTree_Insert_unprotected+0x2c>
40009f5c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
the_node->color = RBT_BLACK;
40009f60: 10 80 00 9a b 4000a1c8 <_RBTree_Insert_unprotected+0x288>
40009f64: 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);
40009f68: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
40009f6c: 92 10 00 1d mov %i5, %o1
40009f70: 9f c0 40 00 call %g1
40009f74: 90 10 00 19 mov %i1, %o0
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
40009f78: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
40009f7c: 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 ) )
40009f80: 80 a0 a0 00 cmp %g2, 0
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
40009f84: b7 36 e0 1f srl %i3, 0x1f, %i3
if (!iter_node->child[dir]) {
40009f88: 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 ) )
40009f8c: 02 80 00 05 be 40009fa0 <_RBTree_Insert_unprotected+0x60>
40009f90: 82 07 40 01 add %i5, %g1, %g1
40009f94: 80 a2 20 00 cmp %o0, 0
40009f98: 02 80 00 8a be 4000a1c0 <_RBTree_Insert_unprotected+0x280>
40009f9c: 01 00 00 00 nop
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
40009fa0: f0 00 60 04 ld [ %g1 + 4 ], %i0
40009fa4: 80 a6 20 00 cmp %i0, 0
40009fa8: 32 bf ff f0 bne,a 40009f68 <_RBTree_Insert_unprotected+0x28>
40009fac: 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(
40009fb0: 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];
40009fb4: b4 06 e0 02 add %i3, 2, %i2
40009fb8: 87 2e a0 02 sll %i2, 2, %g3
40009fbc: 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;
40009fc0: c0 26 60 08 clr [ %i1 + 8 ]
40009fc4: c0 26 60 04 clr [ %i1 + 4 ]
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
40009fc8: 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;
40009fcc: 82 10 20 01 mov 1, %g1
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
40009fd0: 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;
40009fd4: 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(
40009fd8: 9f c0 80 00 call %g2
40009fdc: 90 10 00 19 mov %i1, %o0
the_node,
_RBTree_First(the_rbtree, dir)
);
if ( (!dir && _RBTree_Is_lesser(compare_result)) ||
40009fe0: 80 a6 e0 00 cmp %i3, 0
40009fe4: 12 80 00 10 bne 4000a024 <_RBTree_Insert_unprotected+0xe4>
40009fe8: 80 a2 20 00 cmp %o0, 0
40009fec: 06 80 00 10 bl 4000a02c <_RBTree_Insert_unprotected+0xec>
40009ff0: b5 2e a0 02 sll %i2, 2, %i2
40009ff4: 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;
40009ff8: 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;
40009ffc: c4 00 40 00 ld [ %g1 ], %g2
4000a000: 86 90 a0 00 orcc %g2, 0, %g3
4000a004: 22 80 00 06 be,a 4000a01c <_RBTree_Insert_unprotected+0xdc>
4000a008: 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);
4000a00c: c8 00 60 0c ld [ %g1 + 0xc ], %g4
4000a010: 80 a1 20 01 cmp %g4, 1
4000a014: 22 80 00 08 be,a 4000a034 <_RBTree_Insert_unprotected+0xf4>
4000a018: f6 00 80 00 ld [ %g2 ], %i3
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
4000a01c: 81 c7 e0 08 ret
4000a020: 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)) ) {
4000a024: 04 bf ff f4 ble 40009ff4 <_RBTree_Insert_unprotected+0xb4>
4000a028: b5 2e a0 02 sll %i2, 2, %i2
the_rbtree->first[dir] = the_node;
4000a02c: 10 bf ff f2 b 40009ff4 <_RBTree_Insert_unprotected+0xb4>
4000a030: 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;
4000a034: 80 a6 e0 00 cmp %i3, 0
4000a038: 02 80 00 0c be 4000a068 <_RBTree_Insert_unprotected+0x128><== NEVER TAKEN
4000a03c: 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])
4000a040: 80 a1 00 01 cmp %g4, %g1
4000a044: 02 80 00 5b be 4000a1b0 <_RBTree_Insert_unprotected+0x270>
4000a048: 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);
4000a04c: 80 a7 60 00 cmp %i5, 0
4000a050: 22 80 00 07 be,a 4000a06c <_RBTree_Insert_unprotected+0x12c>
4000a054: fa 00 60 04 ld [ %g1 + 4 ], %i5
4000a058: f8 07 60 0c ld [ %i5 + 0xc ], %i4
4000a05c: 80 a7 20 01 cmp %i4, 1
4000a060: 22 80 00 4f be,a 4000a19c <_RBTree_Insert_unprotected+0x25c>
4000a064: 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];
4000a068: fa 00 60 04 ld [ %g1 + 4 ], %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
4000a06c: 88 18 40 04 xor %g1, %g4, %g4
4000a070: 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];
4000a074: ba 1e 40 1d xor %i1, %i5, %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
4000a078: 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];
4000a07c: 80 a0 00 1d cmp %g0, %i5
4000a080: 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) {
4000a084: 80 a7 40 04 cmp %i5, %g4
4000a088: 02 80 00 20 be 4000a108 <_RBTree_Insert_unprotected+0x1c8>
4000a08c: 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);
4000a090: 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;
4000a094: b7 2e e0 02 sll %i3, 2, %i3
4000a098: b6 00 40 1b add %g1, %i3, %i3
4000a09c: fa 06 e0 04 ld [ %i3 + 4 ], %i5
4000a0a0: 80 a7 60 00 cmp %i5, 0
4000a0a4: 02 80 00 16 be 4000a0fc <_RBTree_Insert_unprotected+0x1bc><== NEVER TAKEN
4000a0a8: 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];
4000a0ac: 9e 07 40 1c add %i5, %i4, %o7
4000a0b0: da 03 e0 04 ld [ %o7 + 4 ], %o5
4000a0b4: da 26 e0 04 st %o5, [ %i3 + 4 ]
if (c->child[dir])
4000a0b8: f6 03 e0 04 ld [ %o7 + 4 ], %i3
4000a0bc: 80 a6 e0 00 cmp %i3, 0
4000a0c0: 22 80 00 05 be,a 4000a0d4 <_RBTree_Insert_unprotected+0x194>
4000a0c4: b6 07 40 1c add %i5, %i4, %i3
c->child[dir]->parent = the_node;
4000a0c8: c2 26 c0 00 st %g1, [ %i3 ]
4000a0cc: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
4000a0d0: b6 07 40 1c add %i5, %i4, %i3
4000a0d4: c2 26 e0 04 st %g1, [ %i3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
4000a0d8: f6 00 a0 04 ld [ %g2 + 4 ], %i3
c->parent = the_node->parent;
4000a0dc: 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;
4000a0e0: b6 1e c0 01 xor %i3, %g1, %i3
c->parent = the_node->parent;
the_node->parent = c;
4000a0e4: 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;
4000a0e8: 80 a0 00 1b cmp %g0, %i3
4000a0ec: 82 40 20 00 addx %g0, 0, %g1
4000a0f0: 83 28 60 02 sll %g1, 2, %g1
4000a0f4: 84 00 80 01 add %g2, %g1, %g2
4000a0f8: fa 20 a0 04 st %i5, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
4000a0fc: b2 06 40 1c add %i1, %i4, %i1
4000a100: f2 06 60 04 ld [ %i1 + 4 ], %i1
4000a104: c2 06 40 00 ld [ %i1 ], %g1
}
the_node->parent->color = RBT_BLACK;
4000a108: 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));
4000a10c: 88 26 80 04 sub %i2, %g4, %g4
4000a110: 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;
4000a114: bb 2f 60 02 sll %i5, 2, %i5
4000a118: ba 00 c0 1d add %g3, %i5, %i5
4000a11c: c4 07 60 04 ld [ %i5 + 4 ], %g2
4000a120: 80 a0 a0 00 cmp %g2, 0
4000a124: 02 bf ff b6 be 40009ffc <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN
4000a128: 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];
4000a12c: 89 29 20 02 sll %g4, 2, %g4
4000a130: 82 00 80 04 add %g2, %g4, %g1
4000a134: f8 00 60 04 ld [ %g1 + 4 ], %i4
4000a138: f8 27 60 04 st %i4, [ %i5 + 4 ]
if (c->child[dir])
4000a13c: c2 00 60 04 ld [ %g1 + 4 ], %g1
4000a140: 80 a0 60 00 cmp %g1, 0
4000a144: 32 80 00 02 bne,a 4000a14c <_RBTree_Insert_unprotected+0x20c>
4000a148: 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;
4000a14c: 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;
4000a150: 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;
4000a154: 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;
4000a158: c6 21 20 04 st %g3, [ %g4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
4000a15c: c8 07 60 04 ld [ %i5 + 4 ], %g4
c->parent = the_node->parent;
the_node->parent = c;
4000a160: c4 20 c0 00 st %g2, [ %g3 ]
4000a164: 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;
4000a168: 86 18 c0 04 xor %g3, %g4, %g3
4000a16c: 80 a0 00 03 cmp %g0, %g3
4000a170: 86 40 20 00 addx %g0, 0, %g3
4000a174: 87 28 e0 02 sll %g3, 2, %g3
4000a178: ba 07 40 03 add %i5, %g3, %i5
4000a17c: 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;
4000a180: c4 00 40 00 ld [ %g1 ], %g2
4000a184: 86 90 a0 00 orcc %g2, 0, %g3
4000a188: 32 bf ff a2 bne,a 4000a010 <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN
4000a18c: c8 00 60 0c ld [ %g1 + 0xc ], %g4
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
4000a190: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
4000a194: 81 c7 e0 08 ret <== NOT EXECUTED
4000a198: 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;
4000a19c: c0 27 60 0c clr [ %i5 + 0xc ]
g->color = RBT_RED;
4000a1a0: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
4000a1a4: 82 10 00 1b mov %i3, %g1
4000a1a8: 10 bf ff 95 b 40009ffc <_RBTree_Insert_unprotected+0xbc>
4000a1ac: 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];
4000a1b0: 10 bf ff a7 b 4000a04c <_RBTree_Insert_unprotected+0x10c>
4000a1b4: 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;
4000a1b8: 81 c7 e0 08 ret
4000a1bc: 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 ) )
4000a1c0: 81 c7 e0 08 ret
4000a1c4: 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;
4000a1c8: f2 26 20 04 st %i1, [ %i0 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
4000a1cc: f2 26 20 0c st %i1, [ %i0 + 0xc ]
4000a1d0: f2 26 20 08 st %i1, [ %i0 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
4000a1d4: f0 26 40 00 st %i0, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
4000a1d8: c0 26 60 08 clr [ %i1 + 8 ]
4000a1dc: c0 26 60 04 clr [ %i1 + 4 ]
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
4000a1e0: 81 c7 e0 08 ret
4000a1e4: 91 e8 20 00 restore %g0, 0, %o0
4000a218 <_RBTree_Iterate_unprotected>:
const RBTree_Control *rbtree,
RBTree_Direction dir,
RBTree_Visitor visitor,
void *visitor_arg
)
{
4000a218: 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);
4000a21c: 80 a0 00 19 cmp %g0, %i1
4000a220: 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];
4000a224: 82 00 60 02 add %g1, 2, %g1
4000a228: 83 28 60 02 sll %g1, 2, %g1
4000a22c: 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 ) {
4000a230: 80 a7 60 00 cmp %i5, 0
4000a234: 12 80 00 06 bne 4000a24c <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN
4000a238: 94 10 00 1b mov %i3, %o2
4000a23c: 30 80 00 0e b,a 4000a274 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED
4000a240: 80 8f 20 ff btst 0xff, %i4
4000a244: 02 80 00 0c be 4000a274 <_RBTree_Iterate_unprotected+0x5c><== NEVER TAKEN
4000a248: 94 10 00 1b mov %i3, %o2
stop = (*visitor)( current, dir, visitor_arg );
4000a24c: 90 10 00 1d mov %i5, %o0
4000a250: 9f c6 80 00 call %i2
4000a254: 92 10 00 19 mov %i1, %o1
current = _RBTree_Next_unprotected( current, dir );
4000a258: 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 );
4000a25c: b8 10 00 08 mov %o0, %i4
current = _RBTree_Next_unprotected( current, dir );
4000a260: 40 00 00 07 call 4000a27c <_RBTree_Next_unprotected>
4000a264: 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 ) {
4000a268: ba 92 20 00 orcc %o0, 0, %i5
4000a26c: 12 bf ff f5 bne 4000a240 <_RBTree_Iterate_unprotected+0x28>
4000a270: b8 1f 20 01 xor %i4, 1, %i4
4000a274: 81 c7 e0 08 ret
4000a278: 81 e8 00 00 restore
40008418 <_RTEMS_signal_Post_switch_hook>:
#include <rtems/score/thread.h>
#include <rtems/score/apiext.h>
#include <rtems/rtems/tasks.h>
static void _RTEMS_signal_Post_switch_hook( Thread_Control *executing )
{
40008418: 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 ];
4000841c: fa 06 21 4c ld [ %i0 + 0x14c ], %i5
if ( !api )
40008420: 80 a7 60 00 cmp %i5, 0
40008424: 02 80 00 1e be 4000849c <_RTEMS_signal_Post_switch_hook+0x84><== NEVER TAKEN
40008428: 01 00 00 00 nop
* Signal Processing
*/
asr = &api->Signal;
_ISR_Disable( level );
4000842c: 7f ff ea c7 call 40002f48 <sparc_disable_interrupts>
40008430: 01 00 00 00 nop
signal_set = asr->signals_posted;
40008434: f8 07 60 14 ld [ %i5 + 0x14 ], %i4
asr->signals_posted = 0;
40008438: c0 27 60 14 clr [ %i5 + 0x14 ]
_ISR_Enable( level );
4000843c: 7f ff ea c7 call 40002f58 <sparc_enable_interrupts>
40008440: 01 00 00 00 nop
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
40008444: 80 a7 20 00 cmp %i4, 0
40008448: 32 80 00 04 bne,a 40008458 <_RTEMS_signal_Post_switch_hook+0x40>
4000844c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
40008450: 81 c7 e0 08 ret
40008454: 81 e8 00 00 restore
return;
asr->nest_level += 1;
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
40008458: d0 07 60 10 ld [ %i5 + 0x10 ], %o0
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
4000845c: 82 00 60 01 inc %g1
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
40008460: 94 07 bf fc add %fp, -4, %o2
40008464: 37 00 00 3f sethi %hi(0xfc00), %i3
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
40008468: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
4000846c: 40 00 01 07 call 40008888 <rtems_task_mode>
40008470: 92 16 e3 ff or %i3, 0x3ff, %o1
(*asr->handler)( signal_set );
40008474: c2 07 60 0c ld [ %i5 + 0xc ], %g1
40008478: 9f c0 40 00 call %g1
4000847c: 90 10 00 1c mov %i4, %o0
asr->nest_level -= 1;
40008480: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
40008484: 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;
40008488: 82 00 7f ff add %g1, -1, %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
4000848c: 92 16 e3 ff or %i3, 0x3ff, %o1
40008490: 94 07 bf fc add %fp, -4, %o2
40008494: 40 00 00 fd call 40008888 <rtems_task_mode>
40008498: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
4000849c: 81 c7 e0 08 ret
400084a0: 81 e8 00 00 restore
400077cc <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
400077cc: 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;
400077d0: 03 10 00 73 sethi %hi(0x4001cc00), %g1
400077d4: 82 10 60 c4 or %g1, 0xc4, %g1 ! 4001ccc4 <Configuration_RTEMS_API>
400077d8: 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 )
400077dc: 80 a7 60 00 cmp %i5, 0
400077e0: 02 80 00 18 be 40007840 <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
400077e4: 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++ ) {
400077e8: 80 a6 e0 00 cmp %i3, 0
400077ec: 02 80 00 15 be 40007840 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
400077f0: b8 10 20 00 clr %i4
return_value = rtems_task_create(
400077f4: d4 07 60 04 ld [ %i5 + 4 ], %o2
400077f8: d0 07 40 00 ld [ %i5 ], %o0
400077fc: d2 07 60 08 ld [ %i5 + 8 ], %o1
40007800: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
40007804: d8 07 60 0c ld [ %i5 + 0xc ], %o4
40007808: 7f ff ff 70 call 400075c8 <rtems_task_create>
4000780c: 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 ) )
40007810: 94 92 20 00 orcc %o0, 0, %o2
40007814: 12 80 00 0d bne 40007848 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
40007818: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
4000781c: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
40007820: 40 00 00 0e call 40007858 <rtems_task_start>
40007824: 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 ) )
40007828: 94 92 20 00 orcc %o0, 0, %o2
4000782c: 12 80 00 07 bne 40007848 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
40007830: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
40007834: 80 a7 00 1b cmp %i4, %i3
40007838: 12 bf ff ef bne 400077f4 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
4000783c: ba 07 60 1c add %i5, 0x1c, %i5
40007840: 81 c7 e0 08 ret
40007844: 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 );
40007848: 90 10 20 01 mov 1, %o0
4000784c: 40 00 04 14 call 4000889c <_Internal_error_Occurred>
40007850: 92 10 20 01 mov 1, %o1
4000c6f0 <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
4000c6f0: c2 02 21 58 ld [ %o0 + 0x158 ], %g1
while (tvp) {
4000c6f4: 80 a0 60 00 cmp %g1, 0
4000c6f8: 22 80 00 0c be,a 4000c728 <_RTEMS_tasks_Switch_extension+0x38>
4000c6fc: c2 02 61 58 ld [ %o1 + 0x158 ], %g1
tvp->tval = *tvp->ptr;
4000c700: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
4000c704: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
4000c708: c8 00 80 00 ld [ %g2 ], %g4
4000c70c: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
4000c710: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
4000c714: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
4000c718: 80 a0 60 00 cmp %g1, 0
4000c71c: 32 bf ff fa bne,a 4000c704 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
4000c720: 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;
4000c724: c2 02 61 58 ld [ %o1 + 0x158 ], %g1
while (tvp) {
4000c728: 80 a0 60 00 cmp %g1, 0
4000c72c: 02 80 00 0d be 4000c760 <_RTEMS_tasks_Switch_extension+0x70>
4000c730: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
4000c734: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
4000c738: 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;
4000c73c: c8 00 80 00 ld [ %g2 ], %g4
4000c740: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
4000c744: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
4000c748: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
4000c74c: 80 a0 60 00 cmp %g1, 0
4000c750: 32 bf ff fa bne,a 4000c738 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
4000c754: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
4000c758: 81 c3 e0 08 retl
4000c75c: 01 00 00 00 nop
4000c760: 81 c3 e0 08 retl
40036818 <_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
)
{
40036818: 9d e3 bf 98 save %sp, -104, %sp
*/
static inline void _TOD_Get_uptime(
Timestamp_Control *time
)
{
_TOD_Get_with_nanoseconds( time, &_TOD.uptime );
4003681c: 13 10 01 9b sethi %hi(0x40066c00), %o1
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
Timestamp_Control uptime;
#endif
Thread_Control *owning_thread = the_period->owner;
40036820: f6 06 20 40 ld [ %i0 + 0x40 ], %i3
40036824: 90 07 bf f8 add %fp, -8, %o0
40036828: 7f ff 45 62 call 40007db0 <_TOD_Get_with_nanoseconds>
4003682c: 92 12 60 c0 or %o1, 0xc0, %o1
/*
* Determine elapsed wall time since period initiated.
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
40036830: c4 1f bf f8 ldd [ %fp + -8 ], %g2
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
40036834: 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) {
40036838: 03 10 01 9b sethi %hi(0x40066c00), %g1
4003683c: 82 10 63 70 or %g1, 0x370, %g1 ! 40066f70 <_Per_CPU_Information>
40036840: de 00 60 10 ld [ %g1 + 0x10 ], %o7
40036844: ba a0 c0 1d subcc %g3, %i5, %i5
40036848: b8 60 80 1c subx %g2, %i4, %i4
4003684c: 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;
40036850: 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) {
40036854: 80 a3 c0 1b cmp %o7, %i3
40036858: 02 80 00 05 be 4003686c <_Rate_monotonic_Get_status+0x54>
4003685c: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
}
40036860: b0 09 20 01 and %g4, 1, %i0
40036864: 81 c7 e0 08 ret
40036868: 81 e8 00 00 restore
4003686c: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
40036870: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0
40036874: 86 a0 c0 0d subcc %g3, %o5, %g3
40036878: 84 60 80 0c subx %g2, %o4, %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
4003687c: 9a 87 40 03 addcc %i5, %g3, %o5
40036880: 98 47 00 02 addx %i4, %g2, %o4
/*
* The cpu usage info was reset while executing. Can't
* determine a status.
*/
if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated))
40036884: 80 a6 00 0c cmp %i0, %o4
40036888: 14 bf ff f6 bg 40036860 <_Rate_monotonic_Get_status+0x48> <== NEVER TAKEN
4003688c: 88 10 20 00 clr %g4
40036890: 02 80 00 09 be 400368b4 <_Rate_monotonic_Get_status+0x9c>
40036894: 80 a6 40 0d cmp %i1, %o5
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
40036898: 9a a3 40 19 subcc %o5, %i1, %o5
if (used < the_period->cpu_usage_period_initiated)
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
4003689c: 88 10 20 01 mov 1, %g4
400368a0: 98 63 00 18 subx %o4, %i0, %o4
}
400368a4: b0 09 20 01 and %g4, 1, %i0
400368a8: d8 3e 80 00 std %o4, [ %i2 ]
400368ac: 81 c7 e0 08 ret
400368b0: 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))
400368b4: 28 bf ff fa bleu,a 4003689c <_Rate_monotonic_Get_status+0x84>
400368b8: 9a a3 40 19 subcc %o5, %i1, %o5
return false;
400368bc: 10 bf ff e9 b 40036860 <_Rate_monotonic_Get_status+0x48>
400368c0: 88 10 20 00 clr %g4
40036c68 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
40036c68: 9d e3 bf 98 save %sp, -104, %sp
40036c6c: 11 10 01 9c sethi %hi(0x40067000), %o0
40036c70: 92 10 00 18 mov %i0, %o1
40036c74: 90 12 21 98 or %o0, 0x198, %o0
40036c78: 7f ff 47 22 call 40008900 <_Objects_Get>
40036c7c: 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 ) {
40036c80: c2 07 bf fc ld [ %fp + -4 ], %g1
40036c84: 80 a0 60 00 cmp %g1, 0
40036c88: 12 80 00 16 bne 40036ce0 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN
40036c8c: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
40036c90: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
40036c94: 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);
40036c98: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
40036c9c: 80 88 80 01 btst %g2, %g1
40036ca0: 22 80 00 08 be,a 40036cc0 <_Rate_monotonic_Timeout+0x58>
40036ca4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
40036ca8: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
40036cac: c2 07 60 08 ld [ %i5 + 8 ], %g1
40036cb0: 80 a0 80 01 cmp %g2, %g1
40036cb4: 02 80 00 19 be 40036d18 <_Rate_monotonic_Timeout+0xb0>
40036cb8: 13 04 01 ff sethi %hi(0x1007fc00), %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 ) {
40036cbc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
40036cc0: 80 a0 60 01 cmp %g1, 1
40036cc4: 02 80 00 09 be 40036ce8 <_Rate_monotonic_Timeout+0x80>
40036cc8: 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;
40036ccc: 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)
{
uint32_t level = _Thread_Dispatch_disable_level;
40036cd0: 03 10 01 9b sethi %hi(0x40066c00), %g1
40036cd4: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 40066d70 <_Thread_Dispatch_disable_level>
--level;
40036cd8: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
40036cdc: c4 20 61 70 st %g2, [ %g1 + 0x170 ]
40036ce0: 81 c7 e0 08 ret
40036ce4: 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;
40036ce8: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
40036cec: 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;
40036cf0: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
40036cf4: 7f ff ff 43 call 40036a00 <_Rate_monotonic_Initiate_statistics>
40036cf8: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
40036cfc: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036d00: 11 10 01 9b sethi %hi(0x40066c00), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
40036d04: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036d08: 90 12 22 08 or %o0, 0x208, %o0
40036d0c: 7f ff 4d d8 call 4000a46c <_Watchdog_Insert>
40036d10: 92 07 60 10 add %i5, 0x10, %o1
40036d14: 30 bf ff ef b,a 40036cd0 <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
40036d18: 7f ff 49 b9 call 400093fc <_Thread_Clear_state>
40036d1c: 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 );
40036d20: 10 bf ff f5 b 40036cf4 <_Rate_monotonic_Timeout+0x8c>
40036d24: 90 10 00 1d mov %i5, %o0
400368c4 <_Rate_monotonic_Update_statistics>:
}
static void _Rate_monotonic_Update_statistics(
Rate_monotonic_Control *the_period
)
{
400368c4: 9d e3 bf 90 save %sp, -112, %sp
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
400368c8: c4 06 20 58 ld [ %i0 + 0x58 ], %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
400368cc: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
400368d0: 84 00 a0 01 inc %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
400368d4: 80 a0 60 04 cmp %g1, 4
400368d8: 02 80 00 32 be 400369a0 <_Rate_monotonic_Update_statistics+0xdc>
400368dc: c4 26 20 58 st %g2, [ %i0 + 0x58 ]
stats->missed_count++;
/*
* Grab status for time statistics.
*/
valid_status =
400368e0: 90 10 00 18 mov %i0, %o0
400368e4: 92 07 bf f8 add %fp, -8, %o1
400368e8: 7f ff ff cc call 40036818 <_Rate_monotonic_Get_status>
400368ec: 94 07 bf f0 add %fp, -16, %o2
_Rate_monotonic_Get_status( the_period, &since_last_period, &executed );
if (!valid_status)
400368f0: 80 8a 20 ff btst 0xff, %o0
400368f4: 02 80 00 21 be 40036978 <_Rate_monotonic_Update_statistics+0xb4>
400368f8: c4 1f bf f0 ldd [ %fp + -16 ], %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
400368fc: 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 ) )
40036900: c2 06 20 60 ld [ %i0 + 0x60 ], %g1
40036904: b6 87 40 03 addcc %i5, %g3, %i3
40036908: b4 47 00 02 addx %i4, %g2, %i2
4003690c: 80 a0 40 02 cmp %g1, %g2
40036910: 04 80 00 1c ble 40036980 <_Rate_monotonic_Update_statistics+0xbc>
40036914: f4 3e 20 70 std %i2, [ %i0 + 0x70 ]
stats->min_cpu_time = executed;
40036918: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) )
4003691c: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
40036920: 80 a0 40 02 cmp %g1, %g2
40036924: 26 80 00 05 bl,a 40036938 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN
40036928: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED
4003692c: 80 a0 40 02 cmp %g1, %g2
40036930: 22 80 00 28 be,a 400369d0 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN
40036934: 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 );
40036938: c4 1f bf f8 ldd [ %fp + -8 ], %g2
4003693c: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4
if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) )
40036940: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
40036944: b6 87 40 03 addcc %i5, %g3, %i3
40036948: b4 47 00 02 addx %i4, %g2, %i2
4003694c: 80 a0 40 02 cmp %g1, %g2
40036950: 14 80 00 1b bg 400369bc <_Rate_monotonic_Update_statistics+0xf8>
40036954: f4 3e 20 88 std %i2, [ %i0 + 0x88 ]
40036958: 80 a0 40 02 cmp %g1, %g2
4003695c: 22 80 00 15 be,a 400369b0 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN
40036960: 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 ) )
40036964: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED
40036968: 80 a0 40 02 cmp %g1, %g2
4003696c: 16 80 00 1e bge 400369e4 <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN
40036970: 01 00 00 00 nop
stats->max_wall_time = since_last_period;
40036974: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED
40036978: 81 c7 e0 08 ret
4003697c: 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 ) )
40036980: 32 bf ff e8 bne,a 40036920 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN
40036984: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED
40036988: c2 06 20 64 ld [ %i0 + 0x64 ], %g1
4003698c: 80 a0 40 03 cmp %g1, %g3
40036990: 28 bf ff e4 bleu,a 40036920 <_Rate_monotonic_Update_statistics+0x5c>
40036994: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
stats->min_cpu_time = executed;
40036998: 10 bf ff e1 b 4003691c <_Rate_monotonic_Update_statistics+0x58>
4003699c: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
*/
stats = &the_period->Statistics;
stats->count++;
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
stats->missed_count++;
400369a0: c2 06 20 5c ld [ %i0 + 0x5c ], %g1
400369a4: 82 00 60 01 inc %g1
400369a8: 10 bf ff ce b 400368e0 <_Rate_monotonic_Update_statistics+0x1c>
400369ac: 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 ) )
400369b0: 80 a0 40 03 cmp %g1, %g3
400369b4: 28 bf ff ed bleu,a 40036968 <_Rate_monotonic_Update_statistics+0xa4>
400369b8: 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 ) )
400369bc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1
400369c0: 80 a0 40 02 cmp %g1, %g2
400369c4: 06 bf ff ec bl 40036974 <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN
400369c8: c4 3e 20 78 std %g2, [ %i0 + 0x78 ]
400369cc: 30 80 00 06 b,a 400369e4 <_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 ) )
400369d0: 80 a0 40 03 cmp %g1, %g3
400369d4: 3a bf ff da bcc,a 4003693c <_Rate_monotonic_Update_statistics+0x78>
400369d8: c4 1f bf f8 ldd [ %fp + -8 ], %g2
stats->max_cpu_time = executed;
400369dc: 10 bf ff d7 b 40036938 <_Rate_monotonic_Update_statistics+0x74>
400369e0: 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 ) )
400369e4: 12 bf ff e5 bne 40036978 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN
400369e8: 01 00 00 00 nop
400369ec: c2 06 20 84 ld [ %i0 + 0x84 ], %g1
400369f0: 80 a0 40 03 cmp %g1, %g3
400369f4: 2a bf ff e1 bcs,a 40036978 <_Rate_monotonic_Update_statistics+0xb4>
400369f8: c4 3e 20 80 std %g2, [ %i0 + 0x80 ]
400369fc: 30 bf ff df b,a 40036978 <_Rate_monotonic_Update_statistics+0xb4>
40009d28 <_Scheduler_CBS_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_CBS_Allocate(
Thread_Control *the_thread
)
{
40009d28: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_CBS_Per_thread *schinfo;
sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread));
40009d2c: 40 00 07 02 call 4000b934 <_Workspace_Allocate>
40009d30: 90 10 20 1c mov 0x1c, %o0
if ( sched ) {
40009d34: 80 a2 20 00 cmp %o0, 0
40009d38: 02 80 00 06 be 40009d50 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN
40009d3c: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
40009d40: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info);
schinfo->edf_per_thread.thread = the_thread;
40009d44: f0 22 00 00 st %i0, [ %o0 ]
schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
40009d48: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
schinfo->cbs_server = NULL;
40009d4c: c0 22 20 18 clr [ %o0 + 0x18 ]
}
return sched;
}
40009d50: 81 c7 e0 08 ret
40009d54: 91 e8 00 08 restore %g0, %o0, %o0
4000b0fc <_Scheduler_CBS_Budget_callout>:
Scheduler_CBS_Server **_Scheduler_CBS_Server_list;
void _Scheduler_CBS_Budget_callout(
Thread_Control *the_thread
)
{
4000b0fc: 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;
4000b100: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
4000b104: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
4000b108: 80 a0 40 09 cmp %g1, %o1
4000b10c: 32 80 00 02 bne,a 4000b114 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN
4000b110: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
4000b114: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
4000b118: 80 a0 40 09 cmp %g1, %o1
4000b11c: 02 80 00 04 be 4000b12c <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN
4000b120: 90 10 00 18 mov %i0, %o0
_Thread_Change_priority(the_thread, new_priority, true);
4000b124: 40 00 01 90 call 4000b764 <_Thread_Change_priority>
4000b128: 94 10 20 01 mov 1, %o2
/* Invoke callback function if any. */
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
4000b12c: fa 06 20 88 ld [ %i0 + 0x88 ], %i5
if ( sched_info->cbs_server->cbs_budget_overrun ) {
4000b130: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
4000b134: c4 00 60 0c ld [ %g1 + 0xc ], %g2
4000b138: 80 a0 a0 00 cmp %g2, 0
4000b13c: 02 80 00 09 be 4000b160 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN
4000b140: 01 00 00 00 nop
_Scheduler_CBS_Get_server_id(
4000b144: d0 00 40 00 ld [ %g1 ], %o0
4000b148: 7f ff ff d5 call 4000b09c <_Scheduler_CBS_Get_server_id>
4000b14c: 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 );
4000b150: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
4000b154: c2 00 60 0c ld [ %g1 + 0xc ], %g1
4000b158: 9f c0 40 00 call %g1
4000b15c: d0 07 bf fc ld [ %fp + -4 ], %o0
4000b160: 81 c7 e0 08 ret
4000b164: 81 e8 00 00 restore
4000ac54 <_Scheduler_CBS_Cleanup>:
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Cleanup (void)
{
4000ac54: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
4000ac58: 39 10 00 81 sethi %hi(0x40020400), %i4
4000ac5c: c2 07 21 00 ld [ %i4 + 0x100 ], %g1 ! 40020500 <_Scheduler_CBS_Maximum_servers>
4000ac60: 80 a0 60 00 cmp %g1, 0
4000ac64: 02 80 00 18 be 4000acc4 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN
4000ac68: 03 10 00 84 sethi %hi(0x40021000), %g1
4000ac6c: 37 10 00 84 sethi %hi(0x40021000), %i3
4000ac70: c4 06 e2 78 ld [ %i3 + 0x278 ], %g2 ! 40021278 <_Scheduler_CBS_Server_list>
4000ac74: ba 10 20 00 clr %i5
4000ac78: b8 17 21 00 or %i4, 0x100, %i4
if ( _Scheduler_CBS_Server_list[ i ] )
4000ac7c: 83 2f 60 02 sll %i5, 2, %g1
4000ac80: c2 00 80 01 ld [ %g2 + %g1 ], %g1
4000ac84: 80 a0 60 00 cmp %g1, 0
4000ac88: 02 80 00 05 be 4000ac9c <_Scheduler_CBS_Cleanup+0x48>
4000ac8c: 90 10 00 1d mov %i5, %o0
_Scheduler_CBS_Destroy_server( i );
4000ac90: 40 00 00 46 call 4000ada8 <_Scheduler_CBS_Destroy_server>
4000ac94: 01 00 00 00 nop
4000ac98: c4 06 e2 78 ld [ %i3 + 0x278 ], %g2
int _Scheduler_CBS_Cleanup (void)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
4000ac9c: c2 07 00 00 ld [ %i4 ], %g1
4000aca0: ba 07 60 01 inc %i5
4000aca4: 80 a0 40 1d cmp %g1, %i5
4000aca8: 18 bf ff f6 bgu 4000ac80 <_Scheduler_CBS_Cleanup+0x2c>
4000acac: 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;
}
4000acb0: 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 );
4000acb4: 40 00 08 32 call 4000cd7c <_Workspace_Free>
4000acb8: 90 10 00 02 mov %g2, %o0
return SCHEDULER_CBS_OK;
}
4000acbc: 81 c7 e0 08 ret
4000acc0: 81 e8 00 00 restore
4000acc4: 10 bf ff fb b 4000acb0 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED
4000acc8: c4 00 62 78 ld [ %g1 + 0x278 ], %g2 <== NOT EXECUTED
4000accc <_Scheduler_CBS_Create_server>:
int _Scheduler_CBS_Create_server (
Scheduler_CBS_Parameters *params,
Scheduler_CBS_Budget_overrun budget_overrun_callback,
rtems_id *server_id
)
{
4000accc: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
Scheduler_CBS_Server *the_server;
if ( params->budget <= 0 ||
4000acd0: c2 06 20 04 ld [ %i0 + 4 ], %g1
4000acd4: 80 a0 60 00 cmp %g1, 0
4000acd8: 04 80 00 30 ble 4000ad98 <_Scheduler_CBS_Create_server+0xcc>
4000acdc: b8 10 00 18 mov %i0, %i4
4000ace0: c2 06 00 00 ld [ %i0 ], %g1
4000ace4: 80 a0 60 00 cmp %g1, 0
4000ace8: 04 80 00 2c ble 4000ad98 <_Scheduler_CBS_Create_server+0xcc>
4000acec: 03 10 00 81 sethi %hi(0x40020400), %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++ ) {
4000acf0: c8 00 61 00 ld [ %g1 + 0x100 ], %g4 ! 40020500 <_Scheduler_CBS_Maximum_servers>
4000acf4: 80 a1 20 00 cmp %g4, 0
4000acf8: 02 80 00 11 be 4000ad3c <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN
4000acfc: 37 10 00 84 sethi %hi(0x40021000), %i3
if ( !_Scheduler_CBS_Server_list[i] )
4000ad00: fa 06 e2 78 ld [ %i3 + 0x278 ], %i5 ! 40021278 <_Scheduler_CBS_Server_list>
4000ad04: c2 07 40 00 ld [ %i5 ], %g1
4000ad08: 80 a0 60 00 cmp %g1, 0
4000ad0c: 02 80 00 21 be 4000ad90 <_Scheduler_CBS_Create_server+0xc4>
4000ad10: b0 10 20 00 clr %i0
4000ad14: 10 80 00 06 b 4000ad2c <_Scheduler_CBS_Create_server+0x60>
4000ad18: 82 10 20 00 clr %g1
4000ad1c: c6 07 40 02 ld [ %i5 + %g2 ], %g3
4000ad20: 80 a0 e0 00 cmp %g3, 0
4000ad24: 02 80 00 08 be 4000ad44 <_Scheduler_CBS_Create_server+0x78>
4000ad28: 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++ ) {
4000ad2c: 82 00 60 01 inc %g1
4000ad30: 80 a0 40 04 cmp %g1, %g4
4000ad34: 12 bf ff fa bne 4000ad1c <_Scheduler_CBS_Create_server+0x50>
4000ad38: 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;
4000ad3c: 81 c7 e0 08 ret
4000ad40: 91 e8 3f e6 restore %g0, -26, %o0
*server_id = i;
4000ad44: c2 26 80 00 st %g1, [ %i2 ]
_Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *)
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
4000ad48: 40 00 08 05 call 4000cd5c <_Workspace_Allocate>
4000ad4c: 90 10 20 10 mov 0x10, %o0
the_server = _Scheduler_CBS_Server_list[*server_id];
4000ad50: 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 *)
4000ad54: d0 27 40 18 st %o0, [ %i5 + %i0 ]
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
the_server = _Scheduler_CBS_Server_list[*server_id];
4000ad58: c4 06 e2 78 ld [ %i3 + 0x278 ], %g2
4000ad5c: 83 28 60 02 sll %g1, 2, %g1
4000ad60: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_server )
4000ad64: 80 a0 60 00 cmp %g1, 0
4000ad68: 02 80 00 0e be 4000ada0 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN
4000ad6c: 86 10 3f ff mov -1, %g3
return SCHEDULER_CBS_ERROR_NO_MEMORY;
the_server->parameters = *params;
4000ad70: c4 07 00 00 ld [ %i4 ], %g2
4000ad74: c4 20 60 04 st %g2, [ %g1 + 4 ]
4000ad78: c4 07 20 04 ld [ %i4 + 4 ], %g2
the_server->task_id = -1;
4000ad7c: 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;
4000ad80: c4 20 60 08 st %g2, [ %g1 + 8 ]
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
4000ad84: f2 20 60 0c st %i1, [ %g1 + 0xc ]
return SCHEDULER_CBS_OK;
4000ad88: 81 c7 e0 08 ret
4000ad8c: 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] )
4000ad90: 10 bf ff ed b 4000ad44 <_Scheduler_CBS_Create_server+0x78>
4000ad94: 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;
4000ad98: 81 c7 e0 08 ret
4000ad9c: 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;
}
4000ada0: 81 c7 e0 08 ret <== NOT EXECUTED
4000ada4: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED
4000ae28 <_Scheduler_CBS_Detach_thread>:
int _Scheduler_CBS_Detach_thread (
Scheduler_CBS_Server_id server_id,
rtems_id task_id
)
{
4000ae28: 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);
4000ae2c: 92 07 bf fc add %fp, -4, %o1
4000ae30: 40 00 03 93 call 4000bc7c <_Thread_Get>
4000ae34: 90 10 00 19 mov %i1, %o0
/* The routine _Thread_Get may disable dispatch and not enable again. */
if ( the_thread ) {
4000ae38: ba 92 20 00 orcc %o0, 0, %i5
4000ae3c: 02 80 00 1e be 4000aeb4 <_Scheduler_CBS_Detach_thread+0x8c>
4000ae40: 01 00 00 00 nop
_Thread_Enable_dispatch();
4000ae44: 40 00 03 82 call 4000bc4c <_Thread_Enable_dispatch>
4000ae48: 01 00 00 00 nop
}
if ( server_id >= _Scheduler_CBS_Maximum_servers )
4000ae4c: 03 10 00 81 sethi %hi(0x40020400), %g1
4000ae50: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 ! 40020500 <_Scheduler_CBS_Maximum_servers>
4000ae54: 80 a6 00 01 cmp %i0, %g1
4000ae58: 1a 80 00 17 bcc 4000aeb4 <_Scheduler_CBS_Detach_thread+0x8c>
4000ae5c: 03 10 00 84 sethi %hi(0x40021000), %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] )
4000ae60: c2 00 62 78 ld [ %g1 + 0x278 ], %g1 ! 40021278 <_Scheduler_CBS_Server_list>
4000ae64: b1 2e 20 02 sll %i0, 2, %i0
4000ae68: c2 00 40 18 ld [ %g1 + %i0 ], %g1
4000ae6c: 80 a0 60 00 cmp %g1, 0
4000ae70: 02 80 00 13 be 4000aebc <_Scheduler_CBS_Detach_thread+0x94>
4000ae74: 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 )
4000ae78: c4 00 40 00 ld [ %g1 ], %g2
4000ae7c: 80 a0 80 19 cmp %g2, %i1
4000ae80: 12 80 00 0d bne 4000aeb4 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN
4000ae84: 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;
4000ae88: c8 07 60 88 ld [ %i5 + 0x88 ], %g4
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
4000ae8c: 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;
4000ae90: 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;
4000ae94: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2
the_thread->is_preemptible = the_thread->Start.is_preemptible;
4000ae98: 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;
4000ae9c: c0 21 20 18 clr [ %g4 + 0x18 ]
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
4000aea0: c6 27 60 78 st %g3, [ %i5 + 0x78 ]
the_thread->budget_callout = the_thread->Start.budget_callout;
4000aea4: c4 27 60 7c st %g2, [ %i5 + 0x7c ]
the_thread->is_preemptible = the_thread->Start.is_preemptible;
4000aea8: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
return SCHEDULER_CBS_OK;
4000aeac: 81 c7 e0 08 ret
4000aeb0: 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;
4000aeb4: 81 c7 e0 08 ret
4000aeb8: 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;
}
4000aebc: 81 c7 e0 08 ret
4000aec0: 91 e8 3f e7 restore %g0, -25, %o0
4000b09c <_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++ ) {
4000b09c: 03 10 00 81 sethi %hi(0x40020400), %g1
4000b0a0: c6 00 61 00 ld [ %g1 + 0x100 ], %g3 ! 40020500 <_Scheduler_CBS_Maximum_servers>
4000b0a4: 80 a0 e0 00 cmp %g3, 0
4000b0a8: 02 80 00 11 be 4000b0ec <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN
4000b0ac: 03 10 00 84 sethi %hi(0x40021000), %g1
4000b0b0: c8 00 62 78 ld [ %g1 + 0x278 ], %g4 ! 40021278 <_Scheduler_CBS_Server_list>
4000b0b4: 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 (
4000b0b8: 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] &&
4000b0bc: c4 01 00 02 ld [ %g4 + %g2 ], %g2
4000b0c0: 80 a0 a0 00 cmp %g2, 0
4000b0c4: 22 80 00 07 be,a 4000b0e0 <_Scheduler_CBS_Get_server_id+0x44>
4000b0c8: 82 00 60 01 inc %g1
4000b0cc: c4 00 80 00 ld [ %g2 ], %g2
4000b0d0: 80 a0 80 08 cmp %g2, %o0
4000b0d4: 22 80 00 08 be,a 4000b0f4 <_Scheduler_CBS_Get_server_id+0x58>
4000b0d8: 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++ ) {
4000b0dc: 82 00 60 01 inc %g1
4000b0e0: 80 a0 40 03 cmp %g1, %g3
4000b0e4: 12 bf ff f6 bne 4000b0bc <_Scheduler_CBS_Get_server_id+0x20>
4000b0e8: 85 28 60 02 sll %g1, 2, %g2
*server_id = i;
return SCHEDULER_CBS_OK;
}
}
return SCHEDULER_CBS_ERROR_NOSERVER;
}
4000b0ec: 81 c3 e0 08 retl
4000b0f0: 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;
4000b0f4: 81 c3 e0 08 retl
4000b0f8: 90 10 20 00 clr %o0
4000b168 <_Scheduler_CBS_Initialize>:
}
}
int _Scheduler_CBS_Initialize(void)
{
4000b168: 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*) );
4000b16c: 3b 10 00 81 sethi %hi(0x40020400), %i5
4000b170: d0 07 61 00 ld [ %i5 + 0x100 ], %o0 ! 40020500 <_Scheduler_CBS_Maximum_servers>
}
int _Scheduler_CBS_Initialize(void)
{
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
4000b174: 40 00 06 fa call 4000cd5c <_Workspace_Allocate>
4000b178: 91 2a 20 02 sll %o0, 2, %o0
4000b17c: 09 10 00 84 sethi %hi(0x40021000), %g4
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
4000b180: 80 a2 20 00 cmp %o0, 0
4000b184: 02 80 00 10 be 4000b1c4 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN
4000b188: d0 21 22 78 st %o0, [ %g4 + 0x278 ]
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
4000b18c: c6 07 61 00 ld [ %i5 + 0x100 ], %g3
4000b190: 80 a0 e0 00 cmp %g3, 0
4000b194: 12 80 00 05 bne 4000b1a8 <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN
4000b198: 82 10 20 00 clr %g1
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
4000b19c: 81 c7 e0 08 ret <== NOT EXECUTED
4000b1a0: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED
4000b1a4: d0 01 22 78 ld [ %g4 + 0x278 ], %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;
4000b1a8: 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++) {
4000b1ac: 82 00 60 01 inc %g1
4000b1b0: 80 a0 40 03 cmp %g1, %g3
4000b1b4: 12 bf ff fc bne 4000b1a4 <_Scheduler_CBS_Initialize+0x3c>
4000b1b8: c0 22 00 02 clr [ %o0 + %g2 ]
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
4000b1bc: 81 c7 e0 08 ret
4000b1c0: 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;
4000b1c4: 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;
}
4000b1c8: 81 c7 e0 08 ret <== NOT EXECUTED
4000b1cc: 81 e8 00 00 restore <== NOT EXECUTED
40009d58 <_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;
40009d58: c2 02 20 88 ld [ %o0 + 0x88 ], %g1
if (deadline) {
40009d5c: 80 a2 60 00 cmp %o1, 0
40009d60: 02 80 00 11 be 40009da4 <_Scheduler_CBS_Release_job+0x4c>
40009d64: c2 00 60 18 ld [ %g1 + 0x18 ], %g1
/* Initializing or shifting deadline. */
if (serv_info)
40009d68: 80 a0 60 00 cmp %g1, 0
40009d6c: 02 80 00 13 be 40009db8 <_Scheduler_CBS_Release_job+0x60>
40009d70: 07 10 00 7d sethi %hi(0x4001f400), %g3
new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline)
40009d74: c4 00 60 04 ld [ %g1 + 4 ], %g2
40009d78: d2 00 e1 58 ld [ %g3 + 0x158 ], %o1
40009d7c: 92 02 40 02 add %o1, %g2, %o1
40009d80: 05 20 00 00 sethi %hi(0x80000000), %g2
40009d84: 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;
40009d88: c2 00 60 08 ld [ %g1 + 8 ], %g1
40009d8c: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
the_thread->real_priority = new_priority;
40009d90: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
_Thread_Change_priority(the_thread, new_priority, true);
40009d94: 94 10 20 01 mov 1, %o2
40009d98: 82 13 c0 00 mov %o7, %g1
40009d9c: 40 00 01 38 call 4000a27c <_Thread_Change_priority>
40009da0: 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)
40009da4: 80 a0 60 00 cmp %g1, 0
40009da8: 12 bf ff f8 bne 40009d88 <_Scheduler_CBS_Release_job+0x30><== ALWAYS TAKEN
40009dac: d2 02 20 ac ld [ %o0 + 0xac ], %o1
the_thread->cpu_time_budget = serv_info->parameters.budget;
the_thread->real_priority = new_priority;
40009db0: 10 bf ff f9 b 40009d94 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED
40009db4: 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)
40009db8: 03 10 00 7d sethi %hi(0x4001f400), %g1
40009dbc: c2 00 61 58 ld [ %g1 + 0x158 ], %g1 ! 4001f558 <_Watchdog_Ticks_since_boot>
40009dc0: 92 02 40 01 add %o1, %g1, %o1
40009dc4: 03 20 00 00 sethi %hi(0x80000000), %g1
40009dc8: 10 bf ff f2 b 40009d90 <_Scheduler_CBS_Release_job+0x38>
40009dcc: 92 2a 40 01 andn %o1, %g1, %o1
40009dd0 <_Scheduler_CBS_Unblock>:
#include <rtems/score/schedulercbs.h>
void _Scheduler_CBS_Unblock(
Thread_Control *the_thread
)
{
40009dd0: 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);
40009dd4: 40 00 00 50 call 40009f14 <_Scheduler_EDF_Enqueue>
40009dd8: 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;
40009ddc: c2 06 20 88 ld [ %i0 + 0x88 ], %g1
40009de0: 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) {
40009de4: 80 a7 60 00 cmp %i5, 0
40009de8: 02 80 00 19 be 40009e4c <_Scheduler_CBS_Unblock+0x7c>
40009dec: 03 10 00 7d sethi %hi(0x4001f400), %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 ) {
40009df0: 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 -
40009df4: d0 00 61 58 ld [ %g1 + 0x158 ], %o0
40009df8: f8 06 20 18 ld [ %i0 + 0x18 ], %i4
_Watchdog_Ticks_since_boot;
if ( deadline*budget_left > budget*deadline_left ) {
40009dfc: 40 00 3d 3a call 400192e4 <.umul>
40009e00: 90 27 00 08 sub %i4, %o0, %o0
40009e04: d2 06 20 74 ld [ %i0 + 0x74 ], %o1
40009e08: b6 10 00 08 mov %o0, %i3
40009e0c: 40 00 3d 36 call 400192e4 <.umul>
40009e10: d0 07 60 08 ld [ %i5 + 8 ], %o0
40009e14: 80 a6 c0 08 cmp %i3, %o0
40009e18: 24 80 00 0e ble,a 40009e50 <_Scheduler_CBS_Unblock+0x80>
40009e1c: 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;
40009e20: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
40009e24: 80 a7 00 09 cmp %i4, %o1
40009e28: 32 80 00 02 bne,a 40009e30 <_Scheduler_CBS_Unblock+0x60>
40009e2c: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
40009e30: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
40009e34: 80 a2 00 09 cmp %o0, %o1
40009e38: 02 80 00 07 be 40009e54 <_Scheduler_CBS_Unblock+0x84>
40009e3c: 3b 10 00 7d sethi %hi(0x4001f400), %i5
_Thread_Change_priority(the_thread, new_priority, true);
40009e40: 90 10 00 18 mov %i0, %o0
40009e44: 40 00 01 0e call 4000a27c <_Thread_Change_priority>
40009e48: 94 10 20 01 mov 1, %o2
40009e4c: 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,
40009e50: 3b 10 00 7d sethi %hi(0x4001f400), %i5
40009e54: ba 17 62 70 or %i5, 0x270, %i5 ! 4001f670 <_Per_CPU_Information>
40009e58: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
40009e5c: d2 00 60 14 ld [ %g1 + 0x14 ], %o1
40009e60: 03 10 00 7a sethi %hi(0x4001e800), %g1
40009e64: c2 00 61 54 ld [ %g1 + 0x154 ], %g1 ! 4001e954 <_Scheduler+0x30>
40009e68: 9f c0 40 00 call %g1
40009e6c: 01 00 00 00 nop
40009e70: 80 a2 20 00 cmp %o0, 0
40009e74: 04 80 00 0a ble 40009e9c <_Scheduler_CBS_Unblock+0xcc>
40009e78: 01 00 00 00 nop
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
40009e7c: c2 07 60 10 ld [ %i5 + 0x10 ], %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;
40009e80: f0 27 60 14 st %i0, [ %i5 + 0x14 ]
if ( _Thread_Executing->is_preemptible ||
40009e84: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
40009e88: 80 a0 60 00 cmp %g1, 0
40009e8c: 22 80 00 06 be,a 40009ea4 <_Scheduler_CBS_Unblock+0xd4>
40009e90: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
40009e94: 82 10 20 01 mov 1, %g1
40009e98: c2 2f 60 0c stb %g1, [ %i5 + 0xc ]
40009e9c: 81 c7 e0 08 ret
40009ea0: 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 ||
40009ea4: 80 a0 60 00 cmp %g1, 0
40009ea8: 12 bf ff fd bne 40009e9c <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN
40009eac: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
40009eb0: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED
40009eb4: 30 bf ff fa b,a 40009e9c <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED
40009d28 <_Scheduler_EDF_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_EDF_Allocate(
Thread_Control *the_thread
)
{
40009d28: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_EDF_Per_thread *schinfo;
sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) );
40009d2c: 40 00 06 d9 call 4000b890 <_Workspace_Allocate>
40009d30: 90 10 20 18 mov 0x18, %o0
if ( sched ) {
40009d34: 80 a2 20 00 cmp %o0, 0
40009d38: 02 80 00 05 be 40009d4c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN
40009d3c: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
40009d40: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info);
schinfo->thread = the_thread;
40009d44: f0 22 00 00 st %i0, [ %o0 ]
schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
40009d48: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
}
return sched;
}
40009d4c: 81 c7 e0 08 ret
40009d50: 91 e8 00 08 restore %g0, %o0, %o0
40009f0c <_Scheduler_EDF_Unblock>:
#include <rtems/score/scheduleredf.h>
void _Scheduler_EDF_Unblock(
Thread_Control *the_thread
)
{
40009f0c: 9d e3 bf a0 save %sp, -96, %sp
_Scheduler_EDF_Enqueue(the_thread);
40009f10: 7f ff ff a8 call 40009db0 <_Scheduler_EDF_Enqueue>
40009f14: 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(
40009f18: 3b 10 00 7d sethi %hi(0x4001f400), %i5
40009f1c: ba 17 61 d0 or %i5, 0x1d0, %i5 ! 4001f5d0 <_Per_CPU_Information>
40009f20: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
40009f24: d0 00 60 14 ld [ %g1 + 0x14 ], %o0
40009f28: 03 10 00 7a sethi %hi(0x4001e800), %g1
40009f2c: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 4001e8b4 <_Scheduler+0x30>
40009f30: 9f c0 40 00 call %g1
40009f34: d2 06 20 14 ld [ %i0 + 0x14 ], %o1
40009f38: 80 a2 20 00 cmp %o0, 0
40009f3c: 26 80 00 04 bl,a 40009f4c <_Scheduler_EDF_Unblock+0x40>
40009f40: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
40009f44: 81 c7 e0 08 ret
40009f48: 81 e8 00 00 restore
_Thread_Heir->current_priority,
the_thread->current_priority )) {
_Thread_Heir = the_thread;
40009f4c: f0 27 60 14 st %i0, [ %i5 + 0x14 ]
if ( _Thread_Executing->is_preemptible ||
40009f50: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
40009f54: 80 a0 60 00 cmp %g1, 0
40009f58: 22 80 00 06 be,a 40009f70 <_Scheduler_EDF_Unblock+0x64>
40009f5c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
40009f60: 82 10 20 01 mov 1, %g1
40009f64: c2 2f 60 0c stb %g1, [ %i5 + 0xc ]
40009f68: 81 c7 e0 08 ret
40009f6c: 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 ||
40009f70: 80 a0 60 00 cmp %g1, 0
40009f74: 12 bf ff f4 bne 40009f44 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN
40009f78: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
40009f7c: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED
40009f80: 30 bf ff fa b,a 40009f68 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED
40009f1c <_Scheduler_simple_Ready_queue_enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
40009f1c: 03 10 00 77 sethi %hi(0x4001dc00), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
40009f20: c2 00 61 44 ld [ %g1 + 0x144 ], %g1 ! 4001dd44 <_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 ) {
40009f24: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
40009f28: c2 00 40 00 ld [ %g1 ], %g1
40009f2c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
40009f30: 80 a0 80 03 cmp %g2, %g3
40009f34: 3a 80 00 08 bcc,a 40009f54 <_Scheduler_simple_Ready_queue_enqueue_first+0x38>
40009f38: 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 ) {
40009f3c: 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 ) {
40009f40: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
40009f44: 80 a0 80 03 cmp %g2, %g3
40009f48: 2a bf ff fe bcs,a 40009f40 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN
40009f4c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
current = (Thread_Control *)current->Object.Node.previous;
40009f50: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
40009f54: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
40009f58: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
40009f5c: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
40009f60: c4 22 00 00 st %g2, [ %o0 ]
before_node->previous = the_node;
40009f64: 81 c3 e0 08 retl
40009f68: d0 20 a0 04 st %o0, [ %g2 + 4 ]
40008040 <_TOD_Validate>:
};
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
40008040: 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();
40008044: 03 10 00 74 sethi %hi(0x4001d000), %g1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
40008048: d2 00 62 0c ld [ %g1 + 0x20c ], %o1 ! 4001d20c <Configuration+0xc>
4000804c: 11 00 03 d0 sethi %hi(0xf4000), %o0
40008050: 40 00 46 c5 call 40019b64 <.udiv>
40008054: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
40008058: 80 a6 20 00 cmp %i0, 0
4000805c: 02 80 00 2c be 4000810c <_TOD_Validate+0xcc> <== NEVER TAKEN
40008060: 82 10 20 00 clr %g1
40008064: c4 06 20 18 ld [ %i0 + 0x18 ], %g2
40008068: 80 a2 00 02 cmp %o0, %g2
4000806c: 28 80 00 26 bleu,a 40008104 <_TOD_Validate+0xc4>
40008070: b0 08 60 01 and %g1, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
40008074: c4 06 20 14 ld [ %i0 + 0x14 ], %g2
40008078: 80 a0 a0 3b cmp %g2, 0x3b
4000807c: 38 80 00 22 bgu,a 40008104 <_TOD_Validate+0xc4>
40008080: b0 08 60 01 and %g1, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
40008084: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
40008088: 80 a0 a0 3b cmp %g2, 0x3b
4000808c: 38 80 00 1e bgu,a 40008104 <_TOD_Validate+0xc4>
40008090: b0 08 60 01 and %g1, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
40008094: c4 06 20 0c ld [ %i0 + 0xc ], %g2
40008098: 80 a0 a0 17 cmp %g2, 0x17
4000809c: 38 80 00 1a bgu,a 40008104 <_TOD_Validate+0xc4>
400080a0: b0 08 60 01 and %g1, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
400080a4: 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) ||
400080a8: 80 a0 a0 00 cmp %g2, 0
400080ac: 02 80 00 15 be 40008100 <_TOD_Validate+0xc0> <== NEVER TAKEN
400080b0: 80 a0 a0 0c cmp %g2, 0xc
(the_tod->month == 0) ||
400080b4: 38 80 00 14 bgu,a 40008104 <_TOD_Validate+0xc4>
400080b8: b0 08 60 01 and %g1, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
400080bc: 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) ||
400080c0: 80 a0 e7 c3 cmp %g3, 0x7c3
400080c4: 28 80 00 10 bleu,a 40008104 <_TOD_Validate+0xc4>
400080c8: b0 08 60 01 and %g1, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
400080cc: 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) ||
400080d0: 80 a1 20 00 cmp %g4, 0
400080d4: 02 80 00 0b be 40008100 <_TOD_Validate+0xc0> <== NEVER TAKEN
400080d8: 80 88 e0 03 btst 3, %g3
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
400080dc: 32 80 00 0f bne,a 40008118 <_TOD_Validate+0xd8>
400080e0: 85 28 a0 02 sll %g2, 2, %g2
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
400080e4: 82 00 a0 0d add %g2, 0xd, %g1
400080e8: 05 10 00 78 sethi %hi(0x4001e000), %g2
400080ec: 83 28 60 02 sll %g1, 2, %g1
400080f0: 84 10 a3 00 or %g2, 0x300, %g2
400080f4: 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 )
400080f8: 80 a0 40 04 cmp %g1, %g4
400080fc: 82 60 3f ff subx %g0, -1, %g1
return false;
return true;
}
40008100: b0 08 60 01 and %g1, 1, %i0
40008104: 81 c7 e0 08 ret
40008108: 81 e8 00 00 restore
4000810c: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED
40008110: 81 c7 e0 08 ret <== NOT EXECUTED
40008114: 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 ];
40008118: 03 10 00 78 sethi %hi(0x4001e000), %g1
4000811c: 82 10 63 00 or %g1, 0x300, %g1 ! 4001e300 <_TOD_Days_per_month>
40008120: c2 00 40 02 ld [ %g1 + %g2 ], %g1
if ( the_tod->day > days_in_month )
40008124: 80 a0 40 04 cmp %g1, %g4
40008128: 10 bf ff f6 b 40008100 <_TOD_Validate+0xc0>
4000812c: 82 60 3f ff subx %g0, -1, %g1
40009944 <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
40009944: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
40009948: 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 );
4000994c: 40 00 03 90 call 4000a78c <_Thread_Set_transient>
40009950: 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 )
40009954: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
40009958: 80 a0 40 19 cmp %g1, %i1
4000995c: 02 80 00 05 be 40009970 <_Thread_Change_priority+0x2c>
40009960: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
40009964: 90 10 00 18 mov %i0, %o0
40009968: 40 00 03 6f call 4000a724 <_Thread_Set_priority>
4000996c: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
40009970: 7f ff e1 cd call 400020a4 <sparc_disable_interrupts>
40009974: 01 00 00 00 nop
40009978: 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;
4000997c: f8 07 60 10 ld [ %i5 + 0x10 ], %i4
if ( state != STATES_TRANSIENT ) {
40009980: 80 a7 20 04 cmp %i4, 4
40009984: 02 80 00 18 be 400099e4 <_Thread_Change_priority+0xa0>
40009988: 80 8e e0 04 btst 4, %i3
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
4000998c: 02 80 00 0b be 400099b8 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
40009990: 82 0f 3f fb and %i4, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
40009994: 7f ff e1 c8 call 400020b4 <sparc_enable_interrupts> <== NOT EXECUTED
40009998: 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);
4000999c: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
400099a0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
400099a4: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED
400099a8: 32 80 00 0d bne,a 400099dc <_Thread_Change_priority+0x98><== NOT EXECUTED
400099ac: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
400099b0: 81 c7 e0 08 ret
400099b4: 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 );
400099b8: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
400099bc: 7f ff e1 be call 400020b4 <sparc_enable_interrupts>
400099c0: 90 10 00 19 mov %i1, %o0
400099c4: 03 00 00 ef sethi %hi(0x3bc00), %g1
400099c8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
400099cc: 80 8f 00 01 btst %i4, %g1
400099d0: 02 bf ff f8 be 400099b0 <_Thread_Change_priority+0x6c>
400099d4: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
400099d8: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
400099dc: 40 00 03 22 call 4000a664 <_Thread_queue_Requeue>
400099e0: 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 ) ) {
400099e4: 22 80 00 19 be,a 40009a48 <_Thread_Change_priority+0x104><== ALWAYS TAKEN
400099e8: c0 27 60 10 clr [ %i5 + 0x10 ]
400099ec: 39 10 00 73 sethi %hi(0x4001cc00), %i4 <== NOT EXECUTED
400099f0: b8 17 21 44 or %i4, 0x144, %i4 ! 4001cd44 <_Scheduler> <== NOT EXECUTED
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
400099f4: 7f ff e1 b0 call 400020b4 <sparc_enable_interrupts>
400099f8: 90 10 00 19 mov %i1, %o0
400099fc: 7f ff e1 aa call 400020a4 <sparc_disable_interrupts>
40009a00: 01 00 00 00 nop
40009a04: 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();
40009a08: c2 07 20 08 ld [ %i4 + 8 ], %g1
40009a0c: 9f c0 40 00 call %g1
40009a10: 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 );
40009a14: 03 10 00 76 sethi %hi(0x4001d800), %g1
40009a18: 82 10 62 20 or %g1, 0x220, %g1 ! 4001da20 <_Per_CPU_Information>
* 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() &&
40009a1c: c4 18 60 10 ldd [ %g1 + 0x10 ], %g2
40009a20: 80 a0 80 03 cmp %g2, %g3
40009a24: 02 80 00 07 be 40009a40 <_Thread_Change_priority+0xfc>
40009a28: 01 00 00 00 nop
40009a2c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
40009a30: 80 a0 a0 00 cmp %g2, 0
40009a34: 02 80 00 03 be 40009a40 <_Thread_Change_priority+0xfc>
40009a38: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
40009a3c: c4 28 60 0c stb %g2, [ %g1 + 0xc ]
_ISR_Enable( level );
40009a40: 7f ff e1 9d call 400020b4 <sparc_enable_interrupts>
40009a44: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
40009a48: 39 10 00 73 sethi %hi(0x4001cc00), %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 )
40009a4c: 80 a6 a0 00 cmp %i2, 0
40009a50: 02 80 00 06 be 40009a68 <_Thread_Change_priority+0x124>
40009a54: b8 17 21 44 or %i4, 0x144, %i4
40009a58: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
40009a5c: 9f c0 40 00 call %g1
40009a60: 90 10 00 1d mov %i5, %o0
40009a64: 30 bf ff e4 b,a 400099f4 <_Thread_Change_priority+0xb0>
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
40009a68: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
40009a6c: 9f c0 40 00 call %g1
40009a70: 90 10 00 1d mov %i5, %o0
40009a74: 30 bf ff e0 b,a 400099f4 <_Thread_Change_priority+0xb0>
40009c64 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
40009c64: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
40009c68: 90 10 00 18 mov %i0, %o0
40009c6c: 40 00 00 7c call 40009e5c <_Thread_Get>
40009c70: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
40009c74: c2 07 bf fc ld [ %fp + -4 ], %g1
40009c78: 80 a0 60 00 cmp %g1, 0
40009c7c: 12 80 00 08 bne 40009c9c <_Thread_Delay_ended+0x38> <== NEVER TAKEN
40009c80: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
40009c84: 7f ff ff 7d call 40009a78 <_Thread_Clear_state>
40009c88: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_SIZE+0xfc00018>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
40009c8c: 03 10 00 76 sethi %hi(0x4001d800), %g1
40009c90: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 4001d820 <_Thread_Dispatch_disable_level>
--level;
40009c94: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
40009c98: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
40009c9c: 81 c7 e0 08 ret
40009ca0: 81 e8 00 00 restore
40009ca4 <_Thread_Dispatch>:
#if defined(RTEMS_SMP)
#include <rtems/score/smp.h>
#endif
void _Thread_Dispatch( void )
{
40009ca4: 9d e3 bf 98 save %sp, -104, %sp
#endif
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
40009ca8: 31 10 00 76 sethi %hi(0x4001d800), %i0
40009cac: b0 16 22 20 or %i0, 0x220, %i0 ! 4001da20 <_Per_CPU_Information>
_ISR_Disable( level );
40009cb0: 7f ff e0 fd call 400020a4 <sparc_disable_interrupts>
40009cb4: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
while ( _Thread_Dispatch_necessary == true ) {
40009cb8: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1
40009cbc: 80 a0 60 00 cmp %g1, 0
40009cc0: 02 80 00 46 be 40009dd8 <_Thread_Dispatch+0x134>
40009cc4: 21 10 00 76 sethi %hi(0x4001d800), %l0
heir = _Thread_Heir;
40009cc8: f4 06 20 14 ld [ %i0 + 0x14 ], %i2
* This routine sets thread dispatch level to the
* value passed in.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value)
{
_Thread_Dispatch_disable_level = value;
40009ccc: 82 10 20 01 mov 1, %g1
40009cd0: c2 24 20 20 st %g1, [ %l0 + 0x20 ]
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 1 );
#endif
_Thread_Dispatch_necessary = false;
40009cd4: c0 2e 20 0c clrb [ %i0 + 0xc ]
/*
* 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 )
40009cd8: 80 a6 c0 1a cmp %i3, %i2
40009cdc: 02 80 00 3f be 40009dd8 <_Thread_Dispatch+0x134>
40009ce0: f4 26 20 10 st %i2, [ %i0 + 0x10 ]
40009ce4: 23 10 00 73 sethi %hi(0x4001cc00), %l1
40009ce8: 27 10 00 76 sethi %hi(0x4001d800), %l3
40009cec: a2 14 62 6c or %l1, 0x26c, %l1
*/
static inline void _TOD_Get_uptime(
Timestamp_Control *time
)
{
_TOD_Get_with_nanoseconds( time, &_TOD.uptime );
40009cf0: 25 10 00 75 sethi %hi(0x4001d400), %l2
40009cf4: a6 14 e0 8c or %l3, 0x8c, %l3
40009cf8: b2 04 60 04 add %l1, 4, %i1
#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;
40009cfc: 2b 10 00 75 sethi %hi(0x4001d400), %l5
40009d00: a4 14 a3 70 or %l2, 0x370, %l2
40009d04: a8 10 20 01 mov 1, %l4
*/
#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 )
40009d08: c2 06 a0 78 ld [ %i2 + 0x78 ], %g1
40009d0c: 80 a0 60 01 cmp %g1, 1
40009d10: 02 80 00 45 be 40009e24 <_Thread_Dispatch+0x180>
40009d14: c2 05 63 80 ld [ %l5 + 0x380 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
_ISR_Enable( level );
40009d18: 7f ff e0 e7 call 400020b4 <sparc_enable_interrupts>
40009d1c: 01 00 00 00 nop
40009d20: 90 07 bf f8 add %fp, -8, %o0
40009d24: 7f ff f9 96 call 4000837c <_TOD_Get_with_nanoseconds>
40009d28: 92 10 00 12 mov %l2, %o1
40009d2c: c4 1e e0 80 ldd [ %i3 + 0x80 ], %g2
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
40009d30: f8 1e 20 20 ldd [ %i0 + 0x20 ], %i4
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
40009d34: d8 1f bf f8 ldd [ %fp + -8 ], %o4
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
40009d38: c2 04 c0 00 ld [ %l3 ], %g1
40009d3c: ba a3 40 1d subcc %o5, %i5, %i5
40009d40: b8 63 00 1c subx %o4, %i4, %i4
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
40009d44: 96 80 c0 1d addcc %g3, %i5, %o3
40009d48: 94 40 80 1c addx %g2, %i4, %o2
40009d4c: d4 3e e0 80 std %o2, [ %i3 + 0x80 ]
40009d50: 80 a0 60 00 cmp %g1, 0
40009d54: 02 80 00 06 be 40009d6c <_Thread_Dispatch+0xc8> <== NEVER TAKEN
40009d58: d8 3e 20 20 std %o4, [ %i0 + 0x20 ]
executing->libc_reent = *_Thread_libc_reent;
40009d5c: c4 00 40 00 ld [ %g1 ], %g2
40009d60: c4 26 e1 48 st %g2, [ %i3 + 0x148 ]
*_Thread_libc_reent = heir->libc_reent;
40009d64: c4 06 a1 48 ld [ %i2 + 0x148 ], %g2
40009d68: c4 20 40 00 st %g2, [ %g1 ]
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
40009d6c: fa 04 40 00 ld [ %l1 ], %i5
{
const Chain_Control *chain = &_User_extensions_Switches_list;
const Chain_Node *tail = _Chain_Immutable_tail( chain );
const Chain_Node *node = _Chain_Immutable_first( chain );
while ( node != tail ) {
40009d70: 80 a7 40 19 cmp %i5, %i1
40009d74: 02 80 00 0b be 40009da0 <_Thread_Dispatch+0xfc> <== NEVER TAKEN
40009d78: 90 06 e0 c0 add %i3, 0xc0, %o0
const User_extensions_Switch_control *extension =
(const User_extensions_Switch_control *) node;
(*extension->thread_switch)( executing, heir );
40009d7c: c2 07 60 08 ld [ %i5 + 8 ], %g1
40009d80: 90 10 00 1b mov %i3, %o0
40009d84: 9f c0 40 00 call %g1
40009d88: 92 10 00 1a mov %i2, %o1
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next(
const Chain_Node *the_node
)
{
return the_node->next;
40009d8c: fa 07 40 00 ld [ %i5 ], %i5
{
const Chain_Control *chain = &_User_extensions_Switches_list;
const Chain_Node *tail = _Chain_Immutable_tail( chain );
const Chain_Node *node = _Chain_Immutable_first( chain );
while ( node != tail ) {
40009d90: 80 a7 40 19 cmp %i5, %i1
40009d94: 32 bf ff fb bne,a 40009d80 <_Thread_Dispatch+0xdc>
40009d98: c2 07 60 08 ld [ %i5 + 8 ], %g1
if ( executing->fp_context != NULL )
_Context_Save_fp( &executing->fp_context );
#endif
#endif
_Context_Switch( &executing->Registers, &heir->Registers );
40009d9c: 90 06 e0 c0 add %i3, 0xc0, %o0
40009da0: 40 00 04 84 call 4000afb0 <_CPU_Context_switch>
40009da4: 92 06 a0 c0 add %i2, 0xc0, %o1
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
40009da8: 7f ff e0 bf call 400020a4 <sparc_disable_interrupts>
40009dac: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
40009db0: c2 0e 20 0c ldub [ %i0 + 0xc ], %g1
40009db4: 80 a0 60 00 cmp %g1, 0
40009db8: 02 80 00 08 be 40009dd8 <_Thread_Dispatch+0x134>
40009dbc: 01 00 00 00 nop
heir = _Thread_Heir;
40009dc0: f4 06 20 14 ld [ %i0 + 0x14 ], %i2
40009dc4: e8 24 20 20 st %l4, [ %l0 + 0x20 ]
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 1 );
#endif
_Thread_Dispatch_necessary = false;
40009dc8: c0 2e 20 0c clrb [ %i0 + 0xc ]
/*
* 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 )
40009dcc: 80 a6 80 1b cmp %i2, %i3
40009dd0: 12 bf ff ce bne 40009d08 <_Thread_Dispatch+0x64> <== ALWAYS TAKEN
40009dd4: f4 26 20 10 st %i2, [ %i0 + 0x10 ]
40009dd8: c0 24 20 20 clr [ %l0 + 0x20 ]
post_switch:
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 0 );
#endif
_ISR_Enable( level );
40009ddc: 7f ff e0 b6 call 400020b4 <sparc_enable_interrupts>
40009de0: 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;
40009de4: 03 10 00 76 sethi %hi(0x4001d800), %g1
40009de8: fa 00 60 90 ld [ %g1 + 0x90 ], %i5 ! 4001d890 <_API_extensions_Post_switch_list>
40009dec: 82 10 60 90 or %g1, 0x90, %g1
{
const Chain_Control *chain = &_API_extensions_Post_switch_list;
const Chain_Node *tail = _Chain_Immutable_tail( chain );
const Chain_Node *node = _Chain_Immutable_first( chain );
while ( node != tail ) {
40009df0: b8 00 60 04 add %g1, 4, %i4
40009df4: 80 a7 40 1c cmp %i5, %i4
40009df8: 02 80 00 09 be 40009e1c <_Thread_Dispatch+0x178>
40009dfc: 01 00 00 00 nop
const API_extensions_Post_switch_control *post_switch =
(const API_extensions_Post_switch_control *) node;
(*post_switch->hook)( executing );
40009e00: c2 07 60 08 ld [ %i5 + 8 ], %g1
40009e04: 9f c0 40 00 call %g1
40009e08: 90 10 00 1b mov %i3, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next(
const Chain_Node *the_node
)
{
return the_node->next;
40009e0c: fa 07 40 00 ld [ %i5 ], %i5
{
const Chain_Control *chain = &_API_extensions_Post_switch_list;
const Chain_Node *tail = _Chain_Immutable_tail( chain );
const Chain_Node *node = _Chain_Immutable_first( chain );
while ( node != tail ) {
40009e10: 80 a7 40 1c cmp %i5, %i4
40009e14: 32 bf ff fc bne,a 40009e04 <_Thread_Dispatch+0x160> <== NEVER TAKEN
40009e18: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
40009e1c: 81 c7 e0 08 ret
40009e20: 81 e8 00 00 restore
#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;
40009e24: 10 bf ff bd b 40009d18 <_Thread_Dispatch+0x74>
40009e28: c2 26 a0 74 st %g1, [ %i2 + 0x74 ]
4000e6e4 <_Thread_Handler>:
#define INIT_NAME __main
#define EXECUTE_GLOBAL_CONSTRUCTORS
#endif
void _Thread_Handler( void )
{
4000e6e4: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static bool doneConstructors;
bool doCons;
#endif
executing = _Thread_Executing;
4000e6e8: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000e6ec: fa 00 62 30 ld [ %g1 + 0x230 ], %i5 ! 4001da30 <_Per_CPU_Information+0x10>
/*
* 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();
4000e6f0: 3f 10 00 39 sethi %hi(0x4000e400), %i7
4000e6f4: be 17 e2 e4 or %i7, 0x2e4, %i7 ! 4000e6e4 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
4000e6f8: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0
_ISR_Set_level(level);
4000e6fc: 7f ff ce 6e call 400020b4 <sparc_enable_interrupts>
4000e700: 91 2a 20 08 sll %o0, 8, %o0
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
4000e704: 03 10 00 75 sethi %hi(0x4001d400), %g1
doneConstructors = true;
4000e708: 84 10 20 01 mov 1, %g2
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
4000e70c: f8 08 61 10 ldub [ %g1 + 0x110 ], %i4
);
}
static inline void _User_extensions_Thread_begin( Thread_Control *executing )
{
_User_extensions_Iterate(
4000e710: 90 10 00 1d mov %i5, %o0
4000e714: 13 10 00 2a sethi %hi(0x4000a800), %o1
4000e718: 92 12 61 64 or %o1, 0x164, %o1 ! 4000a964 <_User_extensions_Thread_begin_visitor>
4000e71c: 7f ff f0 af call 4000a9d8 <_User_extensions_Iterate>
4000e720: c4 28 61 10 stb %g2, [ %g1 + 0x110 ]
_User_extensions_Thread_begin( executing );
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
4000e724: 7f ff ed c2 call 40009e2c <_Thread_Enable_dispatch>
4000e728: 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) */ {
4000e72c: 80 8f 20 ff btst 0xff, %i4
4000e730: 02 80 00 0e be 4000e768 <_Thread_Handler+0x84>
4000e734: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
4000e738: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
4000e73c: 80 a0 60 00 cmp %g1, 0
4000e740: 22 80 00 0e be,a 4000e778 <_Thread_Handler+0x94> <== ALWAYS TAKEN
4000e744: c2 07 60 8c ld [ %i5 + 0x8c ], %g1
}
}
static inline void _User_extensions_Thread_exitted( Thread_Control *executing )
{
_User_extensions_Iterate(
4000e748: 90 10 00 1d mov %i5, %o0
4000e74c: 13 10 00 2a sethi %hi(0x4000a800), %o1
4000e750: 7f ff f0 a2 call 4000a9d8 <_User_extensions_Iterate>
4000e754: 92 12 61 88 or %o1, 0x188, %o1 ! 4000a988 <_User_extensions_Thread_exitted_visitor>
* able to fit in a (void *).
*/
_User_extensions_Thread_exitted( executing );
_Internal_error_Occurred(
4000e758: 90 10 20 00 clr %o0
4000e75c: 92 10 20 01 mov 1, %o1
4000e760: 7f ff e8 4f call 4000889c <_Internal_error_Occurred>
4000e764: 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 ();
4000e768: 40 00 39 42 call 4001cc70 <_init>
4000e76c: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
4000e770: 10 bf ff f3 b 4000e73c <_Thread_Handler+0x58>
4000e774: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
4000e778: 9f c0 40 00 call %g1
4000e77c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
4000e780: 10 bf ff f2 b 4000e748 <_Thread_Handler+0x64>
4000e784: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
4000a0bc <_Thread_Handler_initialization>:
#if defined(RTEMS_SMP)
#include <rtems/bspsmp.h>
#endif
void _Thread_Handler_initialization(void)
{
4000a0bc: 9d e3 bf 98 save %sp, -104, %sp
uint32_t ticks_per_timeslice =
4000a0c0: 03 10 00 6b sethi %hi(0x4001ac00), %g1
4000a0c4: 82 10 63 b8 or %g1, 0x3b8, %g1 ! 4001afb8 <Configuration>
#if defined(RTEMS_MULTIPROCESSING)
uint32_t maximum_proxies =
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
4000a0c8: c6 00 60 28 ld [ %g1 + 0x28 ], %g3
#include <rtems/bspsmp.h>
#endif
void _Thread_Handler_initialization(void)
{
uint32_t ticks_per_timeslice =
4000a0cc: fa 00 60 14 ld [ %g1 + 0x14 ], %i5
rtems_configuration_get_ticks_per_timeslice();
uint32_t maximum_extensions =
4000a0d0: f8 00 60 08 ld [ %g1 + 8 ], %i4
#if defined(RTEMS_MULTIPROCESSING)
uint32_t maximum_proxies =
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
4000a0d4: 80 a0 e0 00 cmp %g3, 0
4000a0d8: 02 80 00 1f be 4000a154 <_Thread_Handler_initialization+0x98><== NEVER TAKEN
4000a0dc: c4 00 60 24 ld [ %g1 + 0x24 ], %g2
4000a0e0: c6 00 60 2c ld [ %g1 + 0x2c ], %g3
4000a0e4: 80 a0 e0 00 cmp %g3, 0
4000a0e8: 02 80 00 1b be 4000a154 <_Thread_Handler_initialization+0x98>
4000a0ec: 80 a0 a0 00 cmp %g2, 0
INTERNAL_ERROR_CORE,
true,
INTERNAL_ERROR_BAD_STACK_HOOK
);
if ( stack_allocate_init_hook != NULL )
4000a0f0: 22 80 00 05 be,a 4000a104 <_Thread_Handler_initialization+0x48>
4000a0f4: 03 10 00 76 sethi %hi(0x4001d800), %g1
(*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() );
4000a0f8: 9f c0 80 00 call %g2
4000a0fc: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 4001d804 <_Thread_BSP_context+0x6c>
_Thread_Dispatch_necessary = false;
4000a100: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000a104: 82 10 62 20 or %g1, 0x220, %g1 ! 4001da20 <_Per_CPU_Information>
4000a108: c0 28 60 0c clrb [ %g1 + 0xc ]
_Thread_Executing = NULL;
4000a10c: c0 20 60 10 clr [ %g1 + 0x10 ]
_Thread_Heir = NULL;
4000a110: c0 20 60 14 clr [ %g1 + 0x14 ]
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Thread_Allocated_fp = NULL;
#endif
_Thread_Maximum_extensions = maximum_extensions;
4000a114: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000a118: f8 20 60 9c st %i4, [ %g1 + 0x9c ] ! 4001d89c <_Thread_Maximum_extensions>
_Thread_Ticks_per_timeslice = ticks_per_timeslice;
4000a11c: 03 10 00 75 sethi %hi(0x4001d400), %g1
4000a120: fa 20 63 80 st %i5, [ %g1 + 0x380 ] ! 4001d780 <_Thread_Ticks_per_timeslice>
#if defined(RTEMS_MULTIPROCESSING)
if ( _System_state_Is_multiprocessing )
maximum_internal_threads += 1;
#endif
_Objects_Initialize_information(
4000a124: 82 10 20 08 mov 8, %g1
4000a128: 11 10 00 76 sethi %hi(0x4001d800), %o0
4000a12c: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
4000a130: 90 12 21 10 or %o0, 0x110, %o0
4000a134: 92 10 20 01 mov 1, %o1
4000a138: 94 10 20 01 mov 1, %o2
4000a13c: 96 10 20 01 mov 1, %o3
4000a140: 98 10 21 60 mov 0x160, %o4
4000a144: 7f ff fb 7f call 40008f40 <_Objects_Initialize_information>
4000a148: 9a 10 20 00 clr %o5
4000a14c: 81 c7 e0 08 ret
4000a150: 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(
4000a154: 90 10 20 00 clr %o0
4000a158: 92 10 20 01 mov 1, %o1
4000a15c: 7f ff f9 d0 call 4000889c <_Internal_error_Occurred>
4000a160: 94 10 20 0e mov 0xe, %o2
40009f08 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
40009f08: 9d e3 bf 98 save %sp, -104, %sp
40009f0c: c2 07 a0 6c ld [ %fp + 0x6c ], %g1
40009f10: f8 0f a0 5f ldub [ %fp + 0x5f ], %i4
40009f14: f4 00 40 00 ld [ %g1 ], %i2
/*
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
40009f18: c0 26 61 4c clr [ %i1 + 0x14c ]
40009f1c: c0 26 61 50 clr [ %i1 + 0x150 ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
40009f20: c0 26 61 48 clr [ %i1 + 0x148 ]
/*
* 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 );
40009f24: 90 10 00 19 mov %i1, %o0
40009f28: 40 00 02 28 call 4000a7c8 <_Thread_Stack_Allocate>
40009f2c: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
40009f30: 80 a2 00 1b cmp %o0, %i3
40009f34: 0a 80 00 48 bcs 4000a054 <_Thread_Initialize+0x14c>
40009f38: 80 a2 20 00 cmp %o0, 0
40009f3c: 02 80 00 46 be 4000a054 <_Thread_Initialize+0x14c> <== NEVER TAKEN
40009f40: 37 10 00 76 sethi %hi(0x4001d800), %i3
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
40009f44: c4 06 60 b8 ld [ %i1 + 0xb8 ], %g2
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
40009f48: c2 06 e0 9c ld [ %i3 + 0x9c ], %g1
40009f4c: c4 26 60 b4 st %g2, [ %i1 + 0xb4 ]
the_stack->size = size;
40009f50: d0 26 60 b0 st %o0, [ %i1 + 0xb0 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
40009f54: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
40009f58: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
40009f5c: c0 26 60 68 clr [ %i1 + 0x68 ]
40009f60: 80 a0 60 00 cmp %g1, 0
40009f64: 12 80 00 40 bne 4000a064 <_Thread_Initialize+0x15c>
40009f68: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
40009f6c: c0 26 61 54 clr [ %i1 + 0x154 ]
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
40009f70: a0 10 20 00 clr %l0
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
40009f74: c4 07 a0 60 ld [ %fp + 0x60 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
40009f78: 03 10 00 73 sethi %hi(0x4001cc00), %g1
40009f7c: c4 26 60 a0 st %g2, [ %i1 + 0xa0 ]
the_thread->Start.budget_callout = budget_callout;
40009f80: c4 07 a0 64 ld [ %fp + 0x64 ], %g2
40009f84: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
40009f88: c4 26 60 a4 st %g2, [ %i1 + 0xa4 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
40009f8c: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
40009f90: f8 2e 60 9c stb %i4, [ %i1 + 0x9c ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
40009f94: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ]
the_thread->current_state = STATES_DORMANT;
40009f98: b6 10 20 01 mov 1, %i3
the_thread->Wait.queue = NULL;
40009f9c: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
40009fa0: f6 26 60 10 st %i3, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
40009fa4: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
40009fa8: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
40009fac: fa 26 60 ac st %i5, [ %i1 + 0xac ]
40009fb0: 9f c0 40 00 call %g1
40009fb4: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
40009fb8: b8 92 20 00 orcc %o0, 0, %i4
40009fbc: 22 80 00 17 be,a 4000a018 <_Thread_Initialize+0x110>
40009fc0: d0 06 61 48 ld [ %i1 + 0x148 ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
40009fc4: 90 10 00 19 mov %i1, %o0
40009fc8: 40 00 01 d7 call 4000a724 <_Thread_Set_priority>
40009fcc: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
40009fd0: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
40009fd4: c2 16 60 0a lduh [ %i1 + 0xa ], %g1
static inline void _Timestamp64_implementation_Set_to_zero(
Timestamp64_Control *_time
)
{
*_time = 0;
40009fd8: c0 26 60 80 clr [ %i1 + 0x80 ]
40009fdc: c0 26 60 84 clr [ %i1 + 0x84 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
40009fe0: 83 28 60 02 sll %g1, 2, %g1
40009fe4: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
40009fe8: f4 26 60 0c st %i2, [ %i1 + 0xc ]
* @{
*/
static inline bool _User_extensions_Thread_create( Thread_Control *created )
{
User_extensions_Thread_create_context ctx = { created, true };
40009fec: f2 27 bf f8 st %i1, [ %fp + -8 ]
40009ff0: f6 2f bf fc stb %i3, [ %fp + -4 ]
_User_extensions_Iterate( &ctx, _User_extensions_Thread_create_visitor );
40009ff4: 90 07 bf f8 add %fp, -8, %o0
40009ff8: 13 10 00 2a sethi %hi(0x4000a800), %o1
40009ffc: 40 00 02 77 call 4000a9d8 <_User_extensions_Iterate>
4000a000: 92 12 60 b0 or %o1, 0xb0, %o1 ! 4000a8b0 <_User_extensions_Thread_create_visitor>
* 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 );
if ( extension_status )
4000a004: c2 0f bf fc ldub [ %fp + -4 ], %g1
4000a008: 80 a0 60 00 cmp %g1, 0
4000a00c: 12 80 00 0f bne 4000a048 <_Thread_Initialize+0x140>
4000a010: b0 10 20 01 mov 1, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
4000a014: d0 06 61 48 ld [ %i1 + 0x148 ], %o0
4000a018: 40 00 03 d1 call 4000af5c <_Workspace_Free>
4000a01c: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
4000a020: 40 00 03 cf call 4000af5c <_Workspace_Free>
4000a024: d0 06 61 4c ld [ %i1 + 0x14c ], %o0
4000a028: 40 00 03 cd call 4000af5c <_Workspace_Free>
4000a02c: d0 06 61 50 ld [ %i1 + 0x150 ], %o0
_Workspace_Free( extensions_area );
4000a030: 40 00 03 cb call 4000af5c <_Workspace_Free>
4000a034: 90 10 00 10 mov %l0, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
#endif
_Workspace_Free( sched );
4000a038: 40 00 03 c9 call 4000af5c <_Workspace_Free>
4000a03c: 90 10 00 1c mov %i4, %o0
_Thread_Stack_Free( the_thread );
4000a040: 40 00 01 f2 call 4000a808 <_Thread_Stack_Free>
4000a044: 90 10 00 19 mov %i1, %o0
4000a048: b0 0e 20 ff and %i0, 0xff, %i0
4000a04c: 81 c7 e0 08 ret
4000a050: 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 */
4000a054: b0 10 20 00 clr %i0
4000a058: b0 0e 20 ff and %i0, 0xff, %i0
4000a05c: 81 c7 e0 08 ret
4000a060: 81 e8 00 00 restore
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
4000a064: 90 00 60 01 add %g1, 1, %o0
4000a068: 40 00 03 b5 call 4000af3c <_Workspace_Allocate>
4000a06c: 91 2a 20 02 sll %o0, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
4000a070: a0 92 20 00 orcc %o0, 0, %l0
4000a074: 02 80 00 10 be 4000a0b4 <_Thread_Initialize+0x1ac>
4000a078: 86 10 00 10 mov %l0, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
4000a07c: e0 26 61 54 st %l0, [ %i1 + 0x154 ]
4000a080: c8 06 e0 9c ld [ %i3 + 0x9c ], %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++ )
4000a084: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
4000a088: 10 80 00 03 b 4000a094 <_Thread_Initialize+0x18c>
4000a08c: 82 10 20 00 clr %g1
4000a090: c6 06 61 54 ld [ %i1 + 0x154 ], %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;
4000a094: 85 28 a0 02 sll %g2, 2, %g2
4000a098: 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++ )
4000a09c: 82 00 60 01 inc %g1
4000a0a0: 80 a0 40 04 cmp %g1, %g4
4000a0a4: 08 bf ff fb bleu 4000a090 <_Thread_Initialize+0x188>
4000a0a8: 84 10 00 01 mov %g1, %g2
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
4000a0ac: 10 bf ff b3 b 40009f78 <_Thread_Initialize+0x70>
4000a0b0: 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;
4000a0b4: 10 bf ff d8 b 4000a014 <_Thread_Initialize+0x10c>
4000a0b8: b8 10 20 00 clr %i4
4000e788 <_Thread_queue_Extract_fifo>:
void _Thread_queue_Extract_fifo(
Thread_queue_Control *the_thread_queue __attribute__((unused)),
Thread_Control *the_thread
)
{
4000e788: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED
ISR_Level level;
_ISR_Disable( level );
4000e78c: 7f ff ce 46 call 400020a4 <sparc_disable_interrupts> <== NOT EXECUTED
4000e790: 01 00 00 00 nop <== NOT EXECUTED
4000e794: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED
4000e798: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 <== NOT EXECUTED
4000e79c: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
4000e7a0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
4000e7a4: 80 88 80 01 btst %g2, %g1 <== NOT EXECUTED
4000e7a8: 02 80 00 1a be 4000e810 <_Thread_queue_Extract_fifo+0x88> <== NOT EXECUTED
4000e7ac: 01 00 00 00 nop <== NOT EXECUTED
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
4000e7b0: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED
previous = the_node->previous;
4000e7b4: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED
_Chain_Extract_unprotected( &the_thread->Object.Node );
the_thread->Wait.queue = NULL;
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
4000e7b8: c6 06 60 50 ld [ %i1 + 0x50 ], %g3 <== NOT EXECUTED
next->previous = previous;
4000e7bc: c2 20 a0 04 st %g1, [ %g2 + 4 ] <== NOT EXECUTED
previous->next = next;
4000e7c0: c4 20 40 00 st %g2, [ %g1 ] <== NOT EXECUTED
4000e7c4: 80 a0 e0 02 cmp %g3, 2 <== NOT EXECUTED
4000e7c8: 02 80 00 08 be 4000e7e8 <_Thread_queue_Extract_fifo+0x60> <== NOT EXECUTED
4000e7cc: c0 26 60 44 clr [ %i1 + 0x44 ] <== NOT EXECUTED
_ISR_Enable( level );
4000e7d0: 7f ff ce 39 call 400020b4 <sparc_enable_interrupts> <== NOT EXECUTED
4000e7d4: b0 10 00 19 mov %i1, %i0 <== NOT EXECUTED
4000e7d8: 33 04 01 ff sethi %hi(0x1007fc00), %i1 <== NOT EXECUTED
4000e7dc: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <RAM_SIZE+0xfc7fff8><== NOT EXECUTED
4000e7e0: 7f ff ec a6 call 40009a78 <_Thread_Clear_state> <== NOT EXECUTED
4000e7e4: 81 e8 00 00 restore <== NOT EXECUTED
4000e7e8: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED
4000e7ec: c2 26 60 50 st %g1, [ %i1 + 0x50 ] <== NOT EXECUTED
} else {
_Watchdog_Deactivate( &the_thread->Timer );
_ISR_Enable( level );
4000e7f0: 7f ff ce 31 call 400020b4 <sparc_enable_interrupts> <== NOT EXECUTED
4000e7f4: b0 10 00 19 mov %i1, %i0 <== NOT EXECUTED
(void) _Watchdog_Remove( &the_thread->Timer );
4000e7f8: 7f ff f1 1b call 4000ac64 <_Watchdog_Remove> <== NOT EXECUTED
4000e7fc: 90 06 60 48 add %i1, 0x48, %o0 <== NOT EXECUTED
4000e800: 33 04 01 ff sethi %hi(0x1007fc00), %i1 <== NOT EXECUTED
4000e804: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <RAM_SIZE+0xfc7fff8><== NOT EXECUTED
4000e808: 7f ff ec 9c call 40009a78 <_Thread_Clear_state> <== NOT EXECUTED
4000e80c: 81 e8 00 00 restore <== NOT EXECUTED
ISR_Level level;
_ISR_Disable( level );
if ( !_States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
_ISR_Enable( level );
4000e810: 7f ff ce 29 call 400020b4 <sparc_enable_interrupts> <== NOT EXECUTED
4000e814: 81 e8 00 00 restore <== NOT EXECUTED
4000a664 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
4000a664: 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 )
4000a668: 80 a6 20 00 cmp %i0, 0
4000a66c: 02 80 00 13 be 4000a6b8 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
4000a670: 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 ) {
4000a674: fa 06 20 34 ld [ %i0 + 0x34 ], %i5
4000a678: 80 a7 60 01 cmp %i5, 1
4000a67c: 02 80 00 04 be 4000a68c <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
4000a680: 01 00 00 00 nop
4000a684: 81 c7 e0 08 ret <== NOT EXECUTED
4000a688: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
4000a68c: 7f ff de 86 call 400020a4 <sparc_disable_interrupts>
4000a690: 01 00 00 00 nop
4000a694: b8 10 00 08 mov %o0, %i4
4000a698: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
4000a69c: 03 00 00 ef sethi %hi(0x3bc00), %g1
4000a6a0: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
4000a6a4: 80 88 80 01 btst %g2, %g1
4000a6a8: 12 80 00 06 bne 4000a6c0 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
4000a6ac: 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 );
4000a6b0: 7f ff de 81 call 400020b4 <sparc_enable_interrupts>
4000a6b4: 90 10 00 1c mov %i4, %o0
4000a6b8: 81 c7 e0 08 ret
4000a6bc: 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 );
4000a6c0: 92 10 00 19 mov %i1, %o1
4000a6c4: 94 10 20 01 mov 1, %o2
4000a6c8: 40 00 0a 75 call 4000d09c <_Thread_queue_Extract_priority_helper>
4000a6cc: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
4000a6d0: 90 10 00 18 mov %i0, %o0
4000a6d4: 92 10 00 19 mov %i1, %o1
4000a6d8: 7f ff ff 35 call 4000a3ac <_Thread_queue_Enqueue_priority>
4000a6dc: 94 07 bf fc add %fp, -4, %o2
4000a6e0: 30 bf ff f4 b,a 4000a6b0 <_Thread_queue_Requeue+0x4c>
4000a6e4 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
4000a6e4: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
4000a6e8: 90 10 00 18 mov %i0, %o0
4000a6ec: 7f ff fd dc call 40009e5c <_Thread_Get>
4000a6f0: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
4000a6f4: c2 07 bf fc ld [ %fp + -4 ], %g1
4000a6f8: 80 a0 60 00 cmp %g1, 0
4000a6fc: 12 80 00 08 bne 4000a71c <_Thread_queue_Timeout+0x38> <== NEVER TAKEN
4000a700: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
4000a704: 40 00 0a 9f call 4000d180 <_Thread_queue_Process_timeout>
4000a708: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
4000a70c: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000a710: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 4001d820 <_Thread_Dispatch_disable_level>
--level;
4000a714: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
4000a718: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
4000a71c: 81 c7 e0 08 ret
4000a720: 81 e8 00 00 restore
400178f0 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
400178f0: 9d e3 bf 88 save %sp, -120, %sp
400178f4: 21 10 00 ef sethi %hi(0x4003bc00), %l0
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
400178f8: a4 07 bf e8 add %fp, -24, %l2
400178fc: b4 07 bf ec add %fp, -20, %i2
40017900: b8 07 bf f4 add %fp, -12, %i4
40017904: a2 07 bf f8 add %fp, -8, %l1
40017908: 33 10 00 ee sethi %hi(0x4003b800), %i1
4001790c: 27 10 00 ef sethi %hi(0x4003bc00), %l3
40017910: f4 27 bf e8 st %i2, [ %fp + -24 ]
head->previous = NULL;
40017914: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
40017918: 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;
4001791c: e2 27 bf f4 st %l1, [ %fp + -12 ]
head->previous = NULL;
40017920: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
40017924: f8 27 bf fc st %i4, [ %fp + -4 ]
40017928: a0 14 21 08 or %l0, 0x108, %l0
4001792c: b6 06 20 30 add %i0, 0x30, %i3
40017930: b2 16 63 68 or %i1, 0x368, %i1
40017934: ba 06 20 68 add %i0, 0x68, %i5
40017938: a6 14 e0 20 or %l3, 0x20, %l3
4001793c: ac 06 20 08 add %i0, 8, %l6
40017940: 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;
40017944: 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;
40017948: 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;
4001794c: c2 04 00 00 ld [ %l0 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
40017950: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
40017954: 90 10 00 1b mov %i3, %o0
40017958: 92 20 40 09 sub %g1, %o1, %o1
4001795c: 94 10 00 1c mov %i4, %o2
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
40017960: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
40017964: 40 00 11 d4 call 4001c0b4 <_Watchdog_Adjust_to_chain>
40017968: 01 00 00 00 nop
4001796c: d0 1e 40 00 ldd [ %i1 ], %o0
40017970: 94 10 20 00 clr %o2
40017974: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
40017978: 40 00 4d 55 call 4002aecc <__divdi3>
4001797c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_SIZE+0x3b5aca00>
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
40017980: 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 ) {
40017984: 80 a2 40 0a cmp %o1, %o2
40017988: 18 80 00 2b bgu 40017a34 <_Timer_server_Body+0x144>
4001798c: 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 ) {
40017990: 80 a2 40 0a cmp %o1, %o2
40017994: 0a 80 00 20 bcs 40017a14 <_Timer_server_Body+0x124>
40017998: 90 10 00 1d mov %i5, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
4001799c: 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 );
400179a0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
400179a4: 40 00 02 a6 call 4001843c <_Chain_Get>
400179a8: 01 00 00 00 nop
if ( timer == NULL ) {
400179ac: 92 92 20 00 orcc %o0, 0, %o1
400179b0: 02 80 00 10 be 400179f0 <_Timer_server_Body+0x100>
400179b4: 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 ) {
400179b8: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
400179bc: 80 a0 60 01 cmp %g1, 1
400179c0: 02 80 00 19 be 40017a24 <_Timer_server_Body+0x134>
400179c4: 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 ) {
400179c8: 12 bf ff f6 bne 400179a0 <_Timer_server_Body+0xb0> <== NEVER TAKEN
400179cc: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
400179d0: 40 00 11 e5 call 4001c164 <_Watchdog_Insert>
400179d4: 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 );
400179d8: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
400179dc: 40 00 02 98 call 4001843c <_Chain_Get>
400179e0: 01 00 00 00 nop
if ( timer == NULL ) {
400179e4: 92 92 20 00 orcc %o0, 0, %o1
400179e8: 32 bf ff f5 bne,a 400179bc <_Timer_server_Body+0xcc> <== NEVER TAKEN
400179ec: 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 );
400179f0: 7f ff dd e8 call 4000f190 <sparc_disable_interrupts>
400179f4: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
400179f8: c2 07 bf e8 ld [ %fp + -24 ], %g1
400179fc: 80 a0 40 1a cmp %g1, %i2
40017a00: 02 80 00 12 be 40017a48 <_Timer_server_Body+0x158> <== ALWAYS TAKEN
40017a04: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
40017a08: 7f ff dd e6 call 4000f1a0 <sparc_enable_interrupts> <== NOT EXECUTED
40017a0c: 01 00 00 00 nop <== NOT EXECUTED
40017a10: 30 bf ff cf b,a 4001794c <_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 );
40017a14: 92 10 20 01 mov 1, %o1 ! 1 <PROM_START+0x1>
40017a18: 40 00 11 77 call 4001bff4 <_Watchdog_Adjust>
40017a1c: 94 22 80 17 sub %o2, %l7, %o2
40017a20: 30 bf ff df b,a 4001799c <_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 );
40017a24: 90 10 00 1b mov %i3, %o0
40017a28: 40 00 11 cf call 4001c164 <_Watchdog_Insert>
40017a2c: 92 02 60 10 add %o1, 0x10, %o1
40017a30: 30 bf ff dc b,a 400179a0 <_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 );
40017a34: 92 22 40 0a sub %o1, %o2, %o1
40017a38: 90 10 00 1d mov %i5, %o0
40017a3c: 40 00 11 9e call 4001c0b4 <_Watchdog_Adjust_to_chain>
40017a40: 94 10 00 1c mov %i4, %o2
40017a44: 30 bf ff d6 b,a 4001799c <_Timer_server_Body+0xac>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
40017a48: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
40017a4c: 7f ff dd d5 call 4000f1a0 <sparc_enable_interrupts>
40017a50: 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 ) ) {
40017a54: c2 07 bf f4 ld [ %fp + -12 ], %g1
40017a58: 80 a0 40 11 cmp %g1, %l1
40017a5c: 12 80 00 0c bne 40017a8c <_Timer_server_Body+0x19c>
40017a60: 01 00 00 00 nop
40017a64: 30 80 00 13 b,a 40017ab0 <_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;
40017a68: 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;
40017a6c: 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;
40017a70: c0 25 e0 08 clr [ %l7 + 8 ]
_ISR_Enable( level );
40017a74: 7f ff dd cb call 4000f1a0 <sparc_enable_interrupts>
40017a78: 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 );
40017a7c: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0
40017a80: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1
40017a84: 9f c0 40 00 call %g1
40017a88: 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 );
40017a8c: 7f ff dd c1 call 4000f190 <sparc_disable_interrupts>
40017a90: 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;
40017a94: 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))
40017a98: 80 a5 c0 11 cmp %l7, %l1
40017a9c: 32 bf ff f3 bne,a 40017a68 <_Timer_server_Body+0x178>
40017aa0: 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 );
40017aa4: 7f ff dd bf call 4000f1a0 <sparc_enable_interrupts>
40017aa8: 01 00 00 00 nop
40017aac: 30 bf ff a7 b,a 40017948 <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
40017ab0: 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)
{
uint32_t level = _Thread_Dispatch_disable_level;
40017ab4: c2 04 c0 00 ld [ %l3 ], %g1
++level;
40017ab8: 82 00 60 01 inc %g1
_Thread_Dispatch_disable_level = level;
40017abc: c2 24 c0 00 st %g1, [ %l3 ]
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
40017ac0: d0 06 00 00 ld [ %i0 ], %o0
40017ac4: 40 00 10 63 call 4001bc50 <_Thread_Set_state>
40017ac8: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
40017acc: 7f ff ff 07 call 400176e8 <_Timer_server_Reset_interval_system_watchdog>
40017ad0: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
40017ad4: 7f ff ff 19 call 40017738 <_Timer_server_Reset_tod_system_watchdog>
40017ad8: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
40017adc: 40 00 0d f9 call 4001b2c0 <_Thread_Enable_dispatch>
40017ae0: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
40017ae4: 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;
40017ae8: 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 );
40017aec: 40 00 11 fd call 4001c2e0 <_Watchdog_Remove>
40017af0: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
40017af4: 40 00 11 fb call 4001c2e0 <_Watchdog_Remove>
40017af8: 90 10 00 15 mov %l5, %o0
40017afc: 30 bf ff 93 b,a 40017948 <_Timer_server_Body+0x58>
40017788 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
40017788: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
4001778c: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
40017790: 80 a0 60 00 cmp %g1, 0
40017794: 02 80 00 05 be 400177a8 <_Timer_server_Schedule_operation_method+0x20>
40017798: 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 );
4001779c: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
400177a0: 40 00 03 1c call 40018410 <_Chain_Append>
400177a4: 81 e8 00 00 restore
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
400177a8: 03 10 00 ef sethi %hi(0x4003bc00), %g1
400177ac: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 4003bc20 <_Thread_Dispatch_disable_level>
++level;
400177b0: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
400177b4: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
400177b8: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
400177bc: 80 a0 60 01 cmp %g1, 1
400177c0: 02 80 00 2b be 4001786c <_Timer_server_Schedule_operation_method+0xe4>
400177c4: 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 ) {
400177c8: 02 80 00 04 be 400177d8 <_Timer_server_Schedule_operation_method+0x50>
400177cc: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
400177d0: 40 00 0e bc call 4001b2c0 <_Thread_Enable_dispatch>
400177d4: 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 );
400177d8: 7f ff de 6e call 4000f190 <sparc_disable_interrupts>
400177dc: 01 00 00 00 nop
400177e0: b8 10 00 08 mov %o0, %i4
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
400177e4: 03 10 00 ee sethi %hi(0x4003b800), %g1
400177e8: d0 18 63 68 ldd [ %g1 + 0x368 ], %o0 ! 4003bb68 <_TOD>
400177ec: 94 10 20 00 clr %o2
400177f0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
400177f4: 40 00 4d b6 call 4002aecc <__divdi3>
400177f8: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_SIZE+0x3b5aca00>
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
400177fc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
40017800: 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 );
40017804: 86 06 20 6c add %i0, 0x6c, %g3
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
40017808: 80 a0 40 03 cmp %g1, %g3
4001780c: 02 80 00 0a be 40017834 <_Timer_server_Schedule_operation_method+0xac>
40017810: 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 ) {
40017814: 08 80 00 34 bleu 400178e4 <_Timer_server_Schedule_operation_method+0x15c>
40017818: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
4001781c: 84 22 40 02 sub %o1, %g2, %g2
if (delta_interval > delta) {
40017820: 80 a1 00 02 cmp %g4, %g2
40017824: 08 80 00 03 bleu 40017830 <_Timer_server_Schedule_operation_method+0xa8><== NEVER TAKEN
40017828: 86 10 20 00 clr %g3
delta_interval -= delta;
4001782c: 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;
40017830: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
40017834: d2 26 20 74 st %o1, [ %i0 + 0x74 ]
_ISR_Enable( level );
40017838: 7f ff de 5a call 4000f1a0 <sparc_enable_interrupts>
4001783c: 90 10 00 1c mov %i4, %o0
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
40017840: 90 06 20 68 add %i0, 0x68, %o0
40017844: 40 00 12 48 call 4001c164 <_Watchdog_Insert>
40017848: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
4001784c: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
40017850: 80 a0 60 00 cmp %g1, 0
40017854: 12 bf ff df bne 400177d0 <_Timer_server_Schedule_operation_method+0x48>
40017858: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
4001785c: 7f ff ff b7 call 40017738 <_Timer_server_Reset_tod_system_watchdog>
40017860: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
40017864: 40 00 0e 97 call 4001b2c0 <_Thread_Enable_dispatch>
40017868: 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 );
4001786c: 7f ff de 49 call 4000f190 <sparc_disable_interrupts>
40017870: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
40017874: 05 10 00 ef sethi %hi(0x4003bc00), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
40017878: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
4001787c: c4 00 a1 08 ld [ %g2 + 0x108 ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
40017880: 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 );
40017884: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
40017888: 80 a0 40 03 cmp %g1, %g3
4001788c: 02 80 00 08 be 400178ac <_Timer_server_Schedule_operation_method+0x124>
40017890: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
40017894: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
if (delta_interval > delta) {
40017898: 80 a1 00 1c cmp %g4, %i4
4001789c: 1a 80 00 03 bcc 400178a8 <_Timer_server_Schedule_operation_method+0x120>
400178a0: 86 10 20 00 clr %g3
delta_interval -= delta;
400178a4: 86 27 00 04 sub %i4, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
400178a8: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
400178ac: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
400178b0: 7f ff de 3c call 4000f1a0 <sparc_enable_interrupts>
400178b4: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
400178b8: 90 06 20 30 add %i0, 0x30, %o0
400178bc: 40 00 12 2a call 4001c164 <_Watchdog_Insert>
400178c0: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
400178c4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
400178c8: 80 a0 60 00 cmp %g1, 0
400178cc: 12 bf ff c1 bne 400177d0 <_Timer_server_Schedule_operation_method+0x48>
400178d0: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
400178d4: 7f ff ff 85 call 400176e8 <_Timer_server_Reset_interval_system_watchdog>
400178d8: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
400178dc: 40 00 0e 79 call 4001b2c0 <_Thread_Enable_dispatch>
400178e0: 81 e8 00 00 restore
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
400178e4: 84 01 00 02 add %g4, %g2, %g2
delta_interval += delta;
400178e8: 10 bf ff d2 b 40017830 <_Timer_server_Schedule_operation_method+0xa8>
400178ec: 86 20 80 09 sub %g2, %o1, %g3
4000add0 <_Timespec_Add_to>:
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
4000add0: 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;
4000add4: c4 02 40 00 ld [ %o1 ], %g2
/* Add the basics */
time->tv_sec += add->tv_sec;
time->tv_nsec += add->tv_nsec;
4000add8: c6 02 20 04 ld [ %o0 + 4 ], %g3
4000addc: c2 02 60 04 ld [ %o1 + 4 ], %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
4000ade0: 98 03 00 02 add %o4, %g2, %o4
time->tv_nsec += add->tv_nsec;
4000ade4: 82 00 c0 01 add %g3, %g1, %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
4000ade8: 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 ) {
4000adec: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4
4000adf0: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff <RAM_SIZE+0x3b5ac9ff>
4000adf4: 80 a0 40 04 cmp %g1, %g4
4000adf8: 08 80 00 0d bleu 4000ae2c <_Timespec_Add_to+0x5c>
4000adfc: c2 22 20 04 st %g1, [ %o0 + 4 ]
4000ae00: 98 03 20 01 inc %o4
time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
4000ae04: 1b 31 19 4d sethi %hi(0xc4653400), %o5
#include <sys/types.h>
#include <rtems/score/timespec.h>
#include <rtems/score/tod.h>
#include <rtems/score/watchdog.h>
uint32_t _Timespec_Add_to(
4000ae08: 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;
4000ae0c: 9a 13 62 00 or %o5, 0x200, %o5
4000ae10: 82 00 40 0d add %g1, %o5, %g1
#include <sys/types.h>
#include <rtems/score/timespec.h>
#include <rtems/score/tod.h>
#include <rtems/score/watchdog.h>
uint32_t _Timespec_Add_to(
4000ae14: 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 ) {
4000ae18: 80 a0 40 04 cmp %g1, %g4
4000ae1c: 18 bf ff fd bgu 4000ae10 <_Timespec_Add_to+0x40> <== NEVER TAKEN
4000ae20: 84 00 a0 01 inc %g2
4000ae24: c2 22 20 04 st %g1, [ %o0 + 4 ]
4000ae28: c6 22 00 00 st %g3, [ %o0 ]
time->tv_sec++;
seconds++;
}
return seconds;
}
4000ae2c: 81 c3 e0 08 retl
4000ae30: 90 10 00 02 mov %g2, %o0
4000c154 <_Timestamp64_Divide>:
const Timestamp64_Control *_lhs,
const Timestamp64_Control *_rhs,
uint32_t *_ival_percentage,
uint32_t *_fval_percentage
)
{
4000c154: 9d e3 bf a0 save %sp, -96, %sp
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
4000c158: d4 1e 40 00 ldd [ %i1 ], %o2
4000c15c: 80 92 80 0b orcc %o2, %o3, %g0
4000c160: 22 80 00 2f be,a 4000c21c <_Timestamp64_Divide+0xc8> <== NEVER TAKEN
4000c164: 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;
4000c168: e0 1e 00 00 ldd [ %i0 ], %l0
4000c16c: 83 2c 20 02 sll %l0, 2, %g1
4000c170: 89 34 60 1e srl %l1, 0x1e, %g4
4000c174: 87 2c 60 02 sll %l1, 2, %g3
4000c178: 84 11 00 01 or %g4, %g1, %g2
4000c17c: 83 30 e0 1b srl %g3, 0x1b, %g1
4000c180: 9b 28 e0 05 sll %g3, 5, %o5
4000c184: 99 28 a0 05 sll %g2, 5, %o4
4000c188: 86 a3 40 03 subcc %o5, %g3, %g3
4000c18c: 98 10 40 0c or %g1, %o4, %o4
4000c190: 84 63 00 02 subx %o4, %g2, %g2
4000c194: 92 80 c0 11 addcc %g3, %l1, %o1
4000c198: 83 32 60 1e srl %o1, 0x1e, %g1
4000c19c: 90 40 80 10 addx %g2, %l0, %o0
4000c1a0: b3 2a 60 02 sll %o1, 2, %i1
4000c1a4: b1 2a 20 02 sll %o0, 2, %i0
4000c1a8: 86 82 40 19 addcc %o1, %i1, %g3
4000c1ac: b0 10 40 18 or %g1, %i0, %i0
4000c1b0: 83 30 e0 1e srl %g3, 0x1e, %g1
4000c1b4: 84 42 00 18 addx %o0, %i0, %g2
4000c1b8: bb 28 e0 02 sll %g3, 2, %i5
4000c1bc: b9 28 a0 02 sll %g2, 2, %i4
4000c1c0: 92 80 c0 1d addcc %g3, %i5, %o1
4000c1c4: b8 10 40 1c or %g1, %i4, %i4
4000c1c8: 87 32 60 1b srl %o1, 0x1b, %g3
4000c1cc: 90 40 80 1c addx %g2, %i4, %o0
4000c1d0: 83 2a 60 05 sll %o1, 5, %g1
4000c1d4: 85 2a 20 05 sll %o0, 5, %g2
4000c1d8: 92 10 00 01 mov %g1, %o1
4000c1dc: 40 00 37 ba call 4001a0c4 <__divdi3>
4000c1e0: 90 10 c0 02 or %g3, %g2, %o0
*_ival_percentage = answer / 1000;
4000c1e4: 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;
4000c1e8: b8 10 00 08 mov %o0, %i4
4000c1ec: ba 10 00 09 mov %o1, %i5
*_ival_percentage = answer / 1000;
4000c1f0: 40 00 37 b5 call 4001a0c4 <__divdi3>
4000c1f4: 96 10 23 e8 mov 0x3e8, %o3
*_fval_percentage = answer % 1000;
4000c1f8: 90 10 00 1c mov %i4, %o0
* TODO: Rounding on the last digit of the fval.
*/
answer = (*_lhs * 100000) / *_rhs;
*_ival_percentage = answer / 1000;
4000c1fc: d2 26 80 00 st %o1, [ %i2 ]
*_fval_percentage = answer % 1000;
4000c200: 94 10 20 00 clr %o2
4000c204: 96 10 23 e8 mov 0x3e8, %o3
4000c208: 40 00 38 9a call 4001a470 <__moddi3>
4000c20c: 92 10 00 1d mov %i5, %o1
4000c210: d2 26 c0 00 st %o1, [ %i3 ]
4000c214: 81 c7 e0 08 ret
4000c218: 81 e8 00 00 restore
{
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
*_ival_percentage = 0;
*_fval_percentage = 0;
4000c21c: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED
return;
4000c220: 81 c7 e0 08 ret <== NOT EXECUTED
4000c224: 81 e8 00 00 restore <== NOT EXECUTED
4000aaa8 <_User_extensions_Handler_initialization>:
}
}
void _User_extensions_Handler_initialization(void)
{
4000aaa8: 9d e3 bf 98 save %sp, -104, %sp
uint32_t number_of_initial_extensions =
4000aaac: 03 10 00 6b sethi %hi(0x4001ac00), %g1
4000aab0: c2 00 63 f8 ld [ %g1 + 0x3f8 ], %g1 ! 4001aff8 <Configuration+0x40>
rtems_configuration_get_number_of_initial_extensions();
if ( number_of_initial_extensions > 0 ) {
4000aab4: 80 a0 60 00 cmp %g1, 0
4000aab8: 02 80 00 0a be 4000aae0 <_User_extensions_Handler_initialization+0x38><== NEVER TAKEN
4000aabc: 91 28 60 02 sll %g1, 2, %o0
User_extensions_Switch_control *initial_extension_switch_controls =
_Workspace_Allocate_or_fatal_error(
number_of_initial_extensions
* sizeof( *initial_extension_switch_controls )
4000aac0: 83 28 60 04 sll %g1, 4, %g1
{
uint32_t number_of_initial_extensions =
rtems_configuration_get_number_of_initial_extensions();
if ( number_of_initial_extensions > 0 ) {
User_extensions_Switch_control *initial_extension_switch_controls =
4000aac4: 40 00 01 2c call 4000af74 <_Workspace_Allocate_or_fatal_error>
4000aac8: 90 20 40 08 sub %g1, %o0, %o0
number_of_initial_extensions
* sizeof( *initial_extension_switch_controls )
);
User_extensions_Switch_context ctx = { initial_extension_switch_controls };
_User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor );
4000aacc: 13 10 00 2a sethi %hi(0x4000a800), %o1
User_extensions_Switch_control *initial_extension_switch_controls =
_Workspace_Allocate_or_fatal_error(
number_of_initial_extensions
* sizeof( *initial_extension_switch_controls )
);
User_extensions_Switch_context ctx = { initial_extension_switch_controls };
4000aad0: d0 27 bf fc st %o0, [ %fp + -4 ]
_User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor );
4000aad4: 92 12 62 64 or %o1, 0x264, %o1
4000aad8: 7f ff ff c0 call 4000a9d8 <_User_extensions_Iterate>
4000aadc: 90 07 bf fc add %fp, -4, %o0
4000aae0: 81 c7 e0 08 ret
4000aae4: 81 e8 00 00 restore
4000a9d8 <_User_extensions_Iterate>:
void _User_extensions_Iterate(
void *arg,
User_extensions_Visitor visitor
)
{
4000a9d8: 9d e3 bf a0 save %sp, -96, %sp
Thread_Control *executing = _Thread_Executing;
const User_extensions_Table *callouts_current =
4000a9dc: 03 10 00 6b sethi %hi(0x4001ac00), %g1
4000a9e0: 82 10 63 b8 or %g1, 0x3b8, %g1 ! 4001afb8 <Configuration>
4000a9e4: fa 00 60 44 ld [ %g1 + 0x44 ], %i5
rtems_configuration_get_user_extension_table();
const User_extensions_Table *callouts_end =
callouts_current + rtems_configuration_get_number_of_initial_extensions();
4000a9e8: f6 00 60 40 ld [ %g1 + 0x40 ], %i3
void _User_extensions_Iterate(
void *arg,
User_extensions_Visitor visitor
)
{
Thread_Control *executing = _Thread_Executing;
4000a9ec: 03 10 00 76 sethi %hi(0x4001d800), %g1
const User_extensions_Table *callouts_current =
rtems_configuration_get_user_extension_table();
const User_extensions_Table *callouts_end =
callouts_current + rtems_configuration_get_number_of_initial_extensions();
4000a9f0: b7 2e e0 05 sll %i3, 5, %i3
)
{
Thread_Control *executing = _Thread_Executing;
const User_extensions_Table *callouts_current =
rtems_configuration_get_user_extension_table();
const User_extensions_Table *callouts_end =
4000a9f4: b6 07 40 1b add %i5, %i3, %i3
callouts_current + rtems_configuration_get_number_of_initial_extensions();
const Chain_Node *node;
const Chain_Node *tail;
while ( callouts_current != callouts_end ) {
4000a9f8: 80 a7 40 1b cmp %i5, %i3
4000a9fc: 02 80 00 0a be 4000aa24 <_User_extensions_Iterate+0x4c> <== NEVER TAKEN
4000aa00: f8 00 62 30 ld [ %g1 + 0x230 ], %i4
(*visitor)( executing, arg, callouts_current );
4000aa04: 94 10 00 1d mov %i5, %o2
4000aa08: 90 10 00 1c mov %i4, %o0
4000aa0c: 9f c6 40 00 call %i1
4000aa10: 92 10 00 18 mov %i0, %o1
++callouts_current;
4000aa14: ba 07 60 20 add %i5, 0x20, %i5
const User_extensions_Table *callouts_end =
callouts_current + rtems_configuration_get_number_of_initial_extensions();
const Chain_Node *node;
const Chain_Node *tail;
while ( callouts_current != callouts_end ) {
4000aa18: 80 a6 c0 1d cmp %i3, %i5
4000aa1c: 12 bf ff fb bne 4000aa08 <_User_extensions_Iterate+0x30>
4000aa20: 94 10 00 1d mov %i5, %o2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
4000aa24: 37 10 00 73 sethi %hi(0x4001cc00), %i3
4000aa28: fa 06 e2 60 ld [ %i3 + 0x260 ], %i5 ! 4001ce60 <_User_extensions_List>
4000aa2c: b6 16 e2 60 or %i3, 0x260, %i3
++callouts_current;
}
node = _Chain_Immutable_first( &_User_extensions_List );
tail = _Chain_Immutable_tail( &_User_extensions_List );
while ( node != tail ) {
4000aa30: b6 06 e0 04 add %i3, 4, %i3
4000aa34: 80 a7 40 1b cmp %i5, %i3
4000aa38: 02 80 00 09 be 4000aa5c <_User_extensions_Iterate+0x84>
4000aa3c: 94 07 60 14 add %i5, 0x14, %o2
const User_extensions_Control *extension =
(const User_extensions_Control *) node;
(*visitor)( executing, arg, &extension->Callouts );
4000aa40: 90 10 00 1c mov %i4, %o0
4000aa44: 9f c6 40 00 call %i1
4000aa48: 92 10 00 18 mov %i0, %o1
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next(
const Chain_Node *the_node
)
{
return the_node->next;
4000aa4c: fa 07 40 00 ld [ %i5 ], %i5
++callouts_current;
}
node = _Chain_Immutable_first( &_User_extensions_List );
tail = _Chain_Immutable_tail( &_User_extensions_List );
while ( node != tail ) {
4000aa50: 80 a7 40 1b cmp %i5, %i3
4000aa54: 12 bf ff fb bne 4000aa40 <_User_extensions_Iterate+0x68>
4000aa58: 94 07 60 14 add %i5, 0x14, %o2
4000aa5c: 81 c7 e0 08 ret
4000aa60: 81 e8 00 00 restore
4000c4a0 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
4000c4a0: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
4000c4a4: 7f ff da 4e call 40002ddc <sparc_disable_interrupts>
4000c4a8: 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;
4000c4ac: 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 );
4000c4b0: 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 ) ) {
4000c4b4: 80 a0 40 1c cmp %g1, %i4
4000c4b8: 02 80 00 1f be 4000c534 <_Watchdog_Adjust+0x94>
4000c4bc: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
4000c4c0: 12 80 00 1f bne 4000c53c <_Watchdog_Adjust+0x9c>
4000c4c4: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
4000c4c8: 80 a6 a0 00 cmp %i2, 0
4000c4cc: 02 80 00 1a be 4000c534 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
4000c4d0: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
4000c4d4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
4000c4d8: 80 a6 80 02 cmp %i2, %g2
4000c4dc: 1a 80 00 0a bcc 4000c504 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
4000c4e0: b6 10 20 01 mov 1, %i3
_Watchdog_First( header )->delta_interval -= units;
4000c4e4: 10 80 00 1d b 4000c558 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED
4000c4e8: 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 ) {
4000c4ec: 02 80 00 12 be 4000c534 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
4000c4f0: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
4000c4f4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
4000c4f8: 80 a0 80 1a cmp %g2, %i2
4000c4fc: 38 80 00 17 bgu,a 4000c558 <_Watchdog_Adjust+0xb8>
4000c500: 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;
4000c504: 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;
4000c508: b4 26 80 02 sub %i2, %g2, %i2
_Watchdog_First( header )->delta_interval = 1;
_ISR_Enable( level );
4000c50c: 7f ff da 38 call 40002dec <sparc_enable_interrupts>
4000c510: 01 00 00 00 nop
_Watchdog_Tickle( header );
4000c514: 40 00 00 a8 call 4000c7b4 <_Watchdog_Tickle>
4000c518: 90 10 00 18 mov %i0, %o0
_ISR_Disable( level );
4000c51c: 7f ff da 30 call 40002ddc <sparc_disable_interrupts>
4000c520: 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;
4000c524: c2 06 00 00 ld [ %i0 ], %g1
if ( _Chain_Is_empty( header ) )
4000c528: 80 a7 00 01 cmp %i4, %g1
4000c52c: 12 bf ff f0 bne 4000c4ec <_Watchdog_Adjust+0x4c>
4000c530: 80 a6 a0 00 cmp %i2, 0
}
break;
}
}
_ISR_Enable( level );
4000c534: 7f ff da 2e call 40002dec <sparc_enable_interrupts>
4000c538: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
4000c53c: 12 bf ff fe bne 4000c534 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
4000c540: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
4000c544: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
4000c548: b4 00 80 1a add %g2, %i2, %i2
4000c54c: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
4000c550: 7f ff da 27 call 40002dec <sparc_enable_interrupts>
4000c554: 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;
4000c558: 10 bf ff f7 b 4000c534 <_Watchdog_Adjust+0x94>
4000c55c: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
4001c0b4 <_Watchdog_Adjust_to_chain>:
Chain_Control *header,
Watchdog_Interval units_arg,
Chain_Control *to_fire
)
{
4001c0b4: 9d e3 bf a0 save %sp, -96, %sp
Watchdog_Interval units = units_arg;
ISR_Level level;
Watchdog_Control *first;
_ISR_Disable( level );
4001c0b8: 7f ff cc 36 call 4000f190 <sparc_disable_interrupts>
4001c0bc: 01 00 00 00 nop
4001c0c0: c2 06 00 00 ld [ %i0 ], %g1
4001c0c4: ba 06 20 04 add %i0, 4, %i5
4001c0c8: b8 06 a0 04 add %i2, 4, %i4
while ( 1 ) {
if ( _Chain_Is_empty( header ) ) {
4001c0cc: 80 a7 40 01 cmp %i5, %g1
4001c0d0: 02 80 00 20 be 4001c150 <_Watchdog_Adjust_to_chain+0x9c>
4001c0d4: 01 00 00 00 nop
/*
* If it is longer than "units" until the first element on the chain
* fires, then bump it and quit.
*/
if ( units < first->delta_interval ) {
4001c0d8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
4001c0dc: 80 a6 40 02 cmp %i1, %g2
4001c0e0: 2a 80 00 1e bcs,a 4001c158 <_Watchdog_Adjust_to_chain+0xa4>
4001c0e4: 84 20 80 19 sub %g2, %i1, %g2
/*
* The first set happens in less than units, so take all of them
* off the chain and adjust units to reflect this.
*/
units -= first->delta_interval;
4001c0e8: b2 26 40 02 sub %i1, %g2, %i1
first->delta_interval = 0;
4001c0ec: c0 20 60 10 clr [ %g1 + 0x10 ]
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
4001c0f0: c4 00 60 04 ld [ %g1 + 4 ], %g2
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
4001c0f4: c6 00 40 00 ld [ %g1 ], %g3
previous = the_node->previous;
next->previous = previous;
4001c0f8: c4 20 e0 04 st %g2, [ %g3 + 4 ]
previous->next = next;
4001c0fc: c6 20 80 00 st %g3, [ %g2 ]
Chain_Control *the_chain,
Chain_Node *the_node
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
4001c100: c4 06 a0 08 ld [ %i2 + 8 ], %g2
the_node->next = tail;
4001c104: f8 20 40 00 st %i4, [ %g1 ]
tail->previous = the_node;
4001c108: c2 26 a0 08 st %g1, [ %i2 + 8 ]
old_last->next = the_node;
4001c10c: c2 20 80 00 st %g1, [ %g2 ]
the_node->previous = old_last;
4001c110: c4 20 60 04 st %g2, [ %g1 + 4 ]
while ( 1 ) {
_Chain_Extract_unprotected( &first->Node );
_Chain_Append_unprotected( to_fire, &first->Node );
_ISR_Flash( level );
4001c114: 7f ff cc 23 call 4000f1a0 <sparc_enable_interrupts>
4001c118: 01 00 00 00 nop
4001c11c: 7f ff cc 1d call 4000f190 <sparc_disable_interrupts>
4001c120: 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;
4001c124: c2 06 00 00 ld [ %i0 ], %g1
if ( _Chain_Is_empty( header ) )
4001c128: 80 a7 40 01 cmp %i5, %g1
4001c12c: 02 bf ff e9 be 4001c0d0 <_Watchdog_Adjust_to_chain+0x1c>
4001c130: 01 00 00 00 nop
break;
first = _Watchdog_First( header );
if ( first->delta_interval != 0 )
4001c134: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
4001c138: 80 a0 a0 00 cmp %g2, 0
4001c13c: 22 bf ff ee be,a 4001c0f4 <_Watchdog_Adjust_to_chain+0x40>
4001c140: c4 00 60 04 ld [ %g1 + 4 ], %g2
Watchdog_Control *first;
_ISR_Disable( level );
while ( 1 ) {
if ( _Chain_Is_empty( header ) ) {
4001c144: 80 a7 40 01 cmp %i5, %g1
4001c148: 12 bf ff e6 bne 4001c0e0 <_Watchdog_Adjust_to_chain+0x2c> <== ALWAYS TAKEN
4001c14c: 80 a6 40 02 cmp %i1, %g2
if ( first->delta_interval != 0 )
break;
}
}
_ISR_Enable( level );
4001c150: 7f ff cc 14 call 4000f1a0 <sparc_enable_interrupts>
4001c154: 91 e8 00 08 restore %g0, %o0, %o0
/*
* If it is longer than "units" until the first element on the chain
* fires, then bump it and quit.
*/
if ( units < first->delta_interval ) {
first->delta_interval -= units;
4001c158: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( first->delta_interval != 0 )
break;
}
}
_ISR_Enable( level );
4001c15c: 7f ff cc 11 call 4000f1a0 <sparc_enable_interrupts>
4001c160: 91 e8 00 08 restore %g0, %o0, %o0
4000ac64 <_Watchdog_Remove>:
#include <rtems/score/watchdog.h>
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
4000ac64: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
4000ac68: 7f ff dd 0f call 400020a4 <sparc_disable_interrupts>
4000ac6c: 01 00 00 00 nop
previous_state = the_watchdog->state;
4000ac70: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
4000ac74: 80 a7 60 01 cmp %i5, 1
4000ac78: 02 80 00 2a be 4000ad20 <_Watchdog_Remove+0xbc>
4000ac7c: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000ac80: 1a 80 00 09 bcc 4000aca4 <_Watchdog_Remove+0x40>
4000ac84: 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;
4000ac88: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000ac8c: c2 00 61 08 ld [ %g1 + 0x108 ], %g1 ! 4001d908 <_Watchdog_Ticks_since_boot>
4000ac90: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
4000ac94: 7f ff dd 08 call 400020b4 <sparc_enable_interrupts>
4000ac98: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
4000ac9c: 81 c7 e0 08 ret
4000aca0: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
4000aca4: 18 bf ff fa bgu 4000ac8c <_Watchdog_Remove+0x28> <== NEVER TAKEN
4000aca8: 03 10 00 76 sethi %hi(0x4001d800), %g1
RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next(
Watchdog_Control *the_watchdog
)
{
return ( (Watchdog_Control *) the_watchdog->Node.next );
4000acac: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
4000acb0: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
4000acb4: c4 00 40 00 ld [ %g1 ], %g2
4000acb8: 80 a0 a0 00 cmp %g2, 0
4000acbc: 02 80 00 07 be 4000acd8 <_Watchdog_Remove+0x74>
4000acc0: 05 10 00 76 sethi %hi(0x4001d800), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
4000acc4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
4000acc8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
4000accc: 84 00 c0 02 add %g3, %g2, %g2
4000acd0: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
4000acd4: 05 10 00 76 sethi %hi(0x4001d800), %g2
4000acd8: c4 00 a1 04 ld [ %g2 + 0x104 ], %g2 ! 4001d904 <_Watchdog_Sync_count>
4000acdc: 80 a0 a0 00 cmp %g2, 0
4000ace0: 22 80 00 07 be,a 4000acfc <_Watchdog_Remove+0x98>
4000ace4: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
4000ace8: 05 10 00 76 sethi %hi(0x4001d800), %g2
4000acec: c6 00 a2 28 ld [ %g2 + 0x228 ], %g3 ! 4001da28 <_Per_CPU_Information+0x8>
4000acf0: 05 10 00 76 sethi %hi(0x4001d800), %g2
4000acf4: c6 20 a0 a4 st %g3, [ %g2 + 0xa4 ] ! 4001d8a4 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
4000acf8: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
4000acfc: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
4000ad00: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
4000ad04: 03 10 00 76 sethi %hi(0x4001d800), %g1
4000ad08: c2 00 61 08 ld [ %g1 + 0x108 ], %g1 ! 4001d908 <_Watchdog_Ticks_since_boot>
4000ad0c: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
4000ad10: 7f ff dc e9 call 400020b4 <sparc_enable_interrupts>
4000ad14: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
4000ad18: 81 c7 e0 08 ret
4000ad1c: 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;
4000ad20: c2 00 61 08 ld [ %g1 + 0x108 ], %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;
4000ad24: 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;
4000ad28: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
4000ad2c: 7f ff dc e2 call 400020b4 <sparc_enable_interrupts>
4000ad30: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
4000ad34: 81 c7 e0 08 ret
4000ad38: 81 e8 00 00 restore
4000beec <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
4000beec: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
4000bef0: 7f ff da b9 call 400029d4 <sparc_disable_interrupts>
4000bef4: 01 00 00 00 nop
4000bef8: b6 10 00 08 mov %o0, %i3
printk( "Watchdog Chain: %s %p\n", name, header );
4000befc: 11 10 00 76 sethi %hi(0x4001d800), %o0
4000bf00: 94 10 00 19 mov %i1, %o2
4000bf04: 92 10 00 18 mov %i0, %o1
4000bf08: 7f ff e2 36 call 400047e0 <printk>
4000bf0c: 90 12 23 e0 or %o0, 0x3e0, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
4000bf10: 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 );
4000bf14: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
4000bf18: 80 a7 40 19 cmp %i5, %i1
4000bf1c: 02 80 00 0f be 4000bf58 <_Watchdog_Report_chain+0x6c>
4000bf20: 11 10 00 77 sethi %hi(0x4001dc00), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
4000bf24: 92 10 00 1d mov %i5, %o1
4000bf28: 40 00 00 0f call 4000bf64 <_Watchdog_Report>
4000bf2c: 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 )
4000bf30: 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 ) ;
4000bf34: 80 a7 40 19 cmp %i5, %i1
4000bf38: 12 bf ff fc bne 4000bf28 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
4000bf3c: 92 10 00 1d mov %i5, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
4000bf40: 11 10 00 76 sethi %hi(0x4001d800), %o0
4000bf44: 92 10 00 18 mov %i0, %o1
4000bf48: 7f ff e2 26 call 400047e0 <printk>
4000bf4c: 90 12 23 f8 or %o0, 0x3f8, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
4000bf50: 7f ff da a5 call 400029e4 <sparc_enable_interrupts>
4000bf54: 91 e8 00 1b restore %g0, %i3, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
4000bf58: 7f ff e2 22 call 400047e0 <printk>
4000bf5c: 90 12 20 08 or %o0, 8, %o0
4000bf60: 30 bf ff fc b,a 4000bf50 <_Watchdog_Report_chain+0x64>
4000ad3c <_Watchdog_Tickle>:
#include <rtems/score/watchdog.h>
void _Watchdog_Tickle(
Chain_Control *header
)
{
4000ad3c: 9d e3 bf a0 save %sp, -96, %sp
* See the comment in watchdoginsert.c and watchdogadjust.c
* about why it's safe not to declare header a pointer to
* volatile data - till, 2003/7
*/
_ISR_Disable( level );
4000ad40: 7f ff dc d9 call 400020a4 <sparc_disable_interrupts>
4000ad44: 01 00 00 00 nop
4000ad48: b8 10 00 08 mov %o0, %i4
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
4000ad4c: fa 06 00 00 ld [ %i0 ], %i5
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
4000ad50: b4 06 20 04 add %i0, 4, %i2
if ( _Chain_Is_empty( header ) )
4000ad54: 80 a7 40 1a cmp %i5, %i2
4000ad58: 02 80 00 09 be 4000ad7c <_Watchdog_Tickle+0x40>
4000ad5c: 01 00 00 00 nop
* to be inserted has already had its delta_interval adjusted to 0, and
* so is added to the head of the chain with a delta_interval of 0.
*
* Steven Johnson - 12/2005 (gcc-3.2.3 -O3 on powerpc)
*/
if (the_watchdog->delta_interval != 0) {
4000ad60: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
4000ad64: 80 a0 60 00 cmp %g1, 0
4000ad68: 02 80 00 15 be 4000adbc <_Watchdog_Tickle+0x80> <== NEVER TAKEN
4000ad6c: 82 00 7f ff add %g1, -1, %g1
the_watchdog->delta_interval--;
if ( the_watchdog->delta_interval != 0 )
4000ad70: 80 a0 60 00 cmp %g1, 0
4000ad74: 02 80 00 12 be 4000adbc <_Watchdog_Tickle+0x80>
4000ad78: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
the_watchdog = _Watchdog_First( header );
} while ( !_Chain_Is_empty( header ) &&
(the_watchdog->delta_interval == 0) );
leave:
_ISR_Enable(level);
4000ad7c: 7f ff dc ce call 400020b4 <sparc_enable_interrupts>
4000ad80: 91 e8 00 1c restore %g0, %i4, %o0
_ISR_Enable( level );
switch( watchdog_state ) {
case WATCHDOG_ACTIVE:
(*the_watchdog->routine)(
4000ad84: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
4000ad88: 9f c0 40 00 call %g1
4000ad8c: d2 07 60 24 ld [ %i5 + 0x24 ], %o1
case WATCHDOG_REMOVE_IT:
break;
}
_ISR_Disable( level );
4000ad90: 7f ff dc c5 call 400020a4 <sparc_disable_interrupts>
4000ad94: 01 00 00 00 nop
4000ad98: b8 10 00 08 mov %o0, %i4
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
4000ad9c: fa 06 00 00 ld [ %i0 ], %i5
the_watchdog = _Watchdog_First( header );
} while ( !_Chain_Is_empty( header ) &&
(the_watchdog->delta_interval == 0) );
4000ada0: 80 a6 80 1d cmp %i2, %i5
4000ada4: 02 bf ff f6 be 4000ad7c <_Watchdog_Tickle+0x40>
4000ada8: 01 00 00 00 nop
}
_ISR_Disable( level );
the_watchdog = _Watchdog_First( header );
} while ( !_Chain_Is_empty( header ) &&
4000adac: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
4000adb0: 80 a0 60 00 cmp %g1, 0
4000adb4: 12 bf ff f2 bne 4000ad7c <_Watchdog_Tickle+0x40>
4000adb8: 01 00 00 00 nop
if ( the_watchdog->delta_interval != 0 )
goto leave;
}
do {
watchdog_state = _Watchdog_Remove( the_watchdog );
4000adbc: 7f ff ff aa call 4000ac64 <_Watchdog_Remove>
4000adc0: 90 10 00 1d mov %i5, %o0
4000adc4: b6 10 00 08 mov %o0, %i3
_ISR_Enable( level );
4000adc8: 7f ff dc bb call 400020b4 <sparc_enable_interrupts>
4000adcc: 90 10 00 1c mov %i4, %o0
switch( watchdog_state ) {
4000add0: 80 a6 e0 02 cmp %i3, 2
4000add4: 12 bf ff ef bne 4000ad90 <_Watchdog_Tickle+0x54>
4000add8: 01 00 00 00 nop
case WATCHDOG_ACTIVE:
(*the_watchdog->routine)(
4000addc: 10 bf ff ea b 4000ad84 <_Watchdog_Tickle+0x48>
4000ade0: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
4000ade4 <_Workspace_Handler_initialization>:
void _Workspace_Handler_initialization(
Heap_Area *areas,
size_t area_count,
Heap_Initialization_or_extend_handler extend
)
{
4000ade4: 9d e3 bf 98 save %sp, -104, %sp
Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize;
uintptr_t remaining = rtems_configuration_get_work_space_size();
4000ade8: 05 10 00 6b sethi %hi(0x4001ac00), %g2
4000adec: 82 10 a3 b8 or %g2, 0x3b8, %g1 ! 4001afb8 <Configuration>
4000adf0: c6 08 60 32 ldub [ %g1 + 0x32 ], %g3
4000adf4: f6 00 a3 b8 ld [ %g2 + 0x3b8 ], %i3
4000adf8: 80 a0 e0 00 cmp %g3, 0
4000adfc: 12 80 00 03 bne 4000ae08 <_Workspace_Handler_initialization+0x24>
4000ae00: 84 10 20 00 clr %g2
4000ae04: c4 00 60 04 ld [ %g1 + 4 ], %g2
4000ae08: b6 00 80 1b add %g2, %i3, %i3
bool do_zero = rtems_configuration_get_do_zero_of_workspace();
4000ae0c: c4 08 60 30 ldub [ %g1 + 0x30 ], %g2
bool unified = rtems_configuration_get_unified_work_area();
4000ae10: c2 08 60 31 ldub [ %g1 + 0x31 ], %g1
Heap_Initialization_or_extend_handler extend
)
{
Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize;
uintptr_t remaining = rtems_configuration_get_work_space_size();
bool do_zero = rtems_configuration_get_do_zero_of_workspace();
4000ae14: c4 2f bf ff stb %g2, [ %fp + -1 ]
bool unified = rtems_configuration_get_unified_work_area();
uintptr_t page_size = CPU_HEAP_ALIGNMENT;
uintptr_t overhead = _Heap_Area_overhead( page_size );
size_t i;
for (i = 0; i < area_count; ++i) {
4000ae18: 80 a6 60 00 cmp %i1, 0
4000ae1c: 02 80 00 3c be 4000af0c <_Workspace_Handler_initialization+0x128><== NEVER TAKEN
4000ae20: c2 2f bf fe stb %g1, [ %fp + -2 ]
Heap_Area *areas,
size_t area_count,
Heap_Initialization_or_extend_handler extend
)
{
Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize;
4000ae24: 23 10 00 21 sethi %hi(0x40008400), %l1
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
4000ae28: 27 10 00 76 sethi %hi(0x4001d800), %l3
bool unified = rtems_configuration_get_unified_work_area();
uintptr_t page_size = CPU_HEAP_ALIGNMENT;
uintptr_t overhead = _Heap_Area_overhead( page_size );
size_t i;
for (i = 0; i < area_count; ++i) {
4000ae2c: b8 10 20 00 clr %i4
Heap_Area *areas,
size_t area_count,
Heap_Initialization_or_extend_handler extend
)
{
Heap_Initialization_or_extend_handler init_or_extend = _Heap_Initialize;
4000ae30: a2 14 62 28 or %l1, 0x228, %l1
4000ae34: a0 08 a0 ff and %g2, 0xff, %l0
if ( area->size > overhead ) {
uintptr_t space_available;
uintptr_t size;
if ( unified ) {
4000ae38: a4 08 60 ff and %g1, 0xff, %l2
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
4000ae3c: 10 80 00 22 b 4000aec4 <_Workspace_Handler_initialization+0xe0>
4000ae40: a6 14 e0 30 or %l3, 0x30, %l3
if ( do_zero ) {
memset( area->begin, 0, area->size );
}
if ( area->size > overhead ) {
4000ae44: 80 a7 60 16 cmp %i5, 0x16
4000ae48: 28 80 00 1c bleu,a 4000aeb8 <_Workspace_Handler_initialization+0xd4>
4000ae4c: b8 07 20 01 inc %i4
uintptr_t space_available;
uintptr_t size;
if ( unified ) {
4000ae50: 80 a4 a0 00 cmp %l2, 0
4000ae54: 32 80 00 0a bne,a 4000ae7c <_Workspace_Handler_initialization+0x98>
4000ae58: d2 06 00 00 ld [ %i0 ], %o1
size = area->size;
} else {
if ( remaining > 0 ) {
4000ae5c: 80 a6 e0 00 cmp %i3, 0
4000ae60: 22 80 00 22 be,a 4000aee8 <_Workspace_Handler_initialization+0x104><== NEVER TAKEN
4000ae64: d2 06 00 00 ld [ %i0 ], %o1 <== NOT EXECUTED
size = remaining < area->size - overhead ?
4000ae68: 82 07 7f ea add %i5, -22, %g1
remaining + overhead : area->size;
4000ae6c: 80 a0 40 1b cmp %g1, %i3
4000ae70: 38 80 00 02 bgu,a 4000ae78 <_Workspace_Handler_initialization+0x94><== ALWAYS TAKEN
4000ae74: ba 06 e0 16 add %i3, 0x16, %i5
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
4000ae78: d2 06 00 00 ld [ %i0 ], %o1
4000ae7c: 94 10 00 1d mov %i5, %o2
4000ae80: 90 10 00 13 mov %l3, %o0
4000ae84: 9f c4 40 00 call %l1
4000ae88: 96 10 20 08 mov 8, %o3
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
4000ae8c: c2 06 00 00 ld [ %i0 ], %g1
area->size -= size;
4000ae90: c4 06 20 04 ld [ %i0 + 4 ], %g2
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
4000ae94: 82 00 40 1d add %g1, %i5, %g1
area->size -= size;
4000ae98: ba 20 80 1d sub %g2, %i5, %i5
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
4000ae9c: c2 26 00 00 st %g1, [ %i0 ]
area->size -= size;
if ( space_available < remaining ) {
4000aea0: 80 a2 00 1b cmp %o0, %i3
4000aea4: 1a 80 00 1f bcc 4000af20 <_Workspace_Handler_initialization+0x13c><== ALWAYS TAKEN
4000aea8: fa 26 20 04 st %i5, [ %i0 + 4 ]
remaining -= space_available;
4000aeac: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED
} else {
remaining = 0;
}
init_or_extend = extend;
4000aeb0: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED
bool unified = rtems_configuration_get_unified_work_area();
uintptr_t page_size = CPU_HEAP_ALIGNMENT;
uintptr_t overhead = _Heap_Area_overhead( page_size );
size_t i;
for (i = 0; i < area_count; ++i) {
4000aeb4: b8 07 20 01 inc %i4
4000aeb8: 80 a7 00 19 cmp %i4, %i1
4000aebc: 02 80 00 14 be 4000af0c <_Workspace_Handler_initialization+0x128><== ALWAYS TAKEN
4000aec0: b0 06 20 08 add %i0, 8, %i0
Heap_Area *area = &areas [i];
if ( do_zero ) {
4000aec4: 80 a4 20 00 cmp %l0, 0
4000aec8: 22 bf ff df be,a 4000ae44 <_Workspace_Handler_initialization+0x60>
4000aecc: fa 06 20 04 ld [ %i0 + 4 ], %i5
memset( area->begin, 0, area->size );
4000aed0: d0 06 00 00 ld [ %i0 ], %o0
4000aed4: d4 06 20 04 ld [ %i0 + 4 ], %o2
4000aed8: 40 00 10 fc call 4000f2c8 <memset>
4000aedc: 92 10 20 00 clr %o1
}
if ( area->size > overhead ) {
4000aee0: 10 bf ff d9 b 4000ae44 <_Workspace_Handler_initialization+0x60>
4000aee4: fa 06 20 04 ld [ %i0 + 4 ], %i5
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
4000aee8: 90 10 00 13 mov %l3, %o0 <== NOT EXECUTED
4000aeec: 94 10 20 00 clr %o2 <== NOT EXECUTED
4000aef0: 9f c4 40 00 call %l1 <== NOT EXECUTED
4000aef4: 96 10 20 08 mov 8, %o3 <== NOT EXECUTED
bool unified = rtems_configuration_get_unified_work_area();
uintptr_t page_size = CPU_HEAP_ALIGNMENT;
uintptr_t overhead = _Heap_Area_overhead( page_size );
size_t i;
for (i = 0; i < area_count; ++i) {
4000aef8: b8 07 20 01 inc %i4 <== NOT EXECUTED
remaining -= space_available;
} else {
remaining = 0;
}
init_or_extend = extend;
4000aefc: a2 10 00 1a mov %i2, %l1 <== NOT EXECUTED
bool unified = rtems_configuration_get_unified_work_area();
uintptr_t page_size = CPU_HEAP_ALIGNMENT;
uintptr_t overhead = _Heap_Area_overhead( page_size );
size_t i;
for (i = 0; i < area_count; ++i) {
4000af00: 80 a7 00 19 cmp %i4, %i1 <== NOT EXECUTED
4000af04: 12 bf ff f0 bne 4000aec4 <_Workspace_Handler_initialization+0xe0><== NOT EXECUTED
4000af08: b0 06 20 08 add %i0, 8, %i0 <== NOT EXECUTED
init_or_extend = extend;
}
}
if ( remaining > 0 ) {
4000af0c: 80 a6 e0 00 cmp %i3, 0
4000af10: 12 80 00 07 bne 4000af2c <_Workspace_Handler_initialization+0x148>
4000af14: 90 10 20 00 clr %o0
4000af18: 81 c7 e0 08 ret
4000af1c: 81 e8 00 00 restore
remaining -= space_available;
} else {
remaining = 0;
}
init_or_extend = extend;
4000af20: a2 10 00 1a mov %i2, %l1
area->size -= size;
if ( space_available < remaining ) {
remaining -= space_available;
} else {
remaining = 0;
4000af24: 10 bf ff e4 b 4000aeb4 <_Workspace_Handler_initialization+0xd0>
4000af28: b6 10 20 00 clr %i3
init_or_extend = extend;
}
}
if ( remaining > 0 ) {
_Internal_error_Occurred(
4000af2c: 92 10 20 01 mov 1, %o1
4000af30: 7f ff f6 5b call 4000889c <_Internal_error_Occurred>
4000af34: 94 10 20 02 mov 2, %o2
4000aad0 <_Workspace_String_duplicate>:
char *_Workspace_String_duplicate(
const char *string,
size_t len
)
{
4000aad0: 9d e3 bf a0 save %sp, -96, %sp
char *dup = _Workspace_Allocate(len + 1);
4000aad4: 7f ff ff e2 call 4000aa5c <_Workspace_Allocate>
4000aad8: 90 06 60 01 add %i1, 1, %o0
if (dup != NULL) {
4000aadc: ba 92 20 00 orcc %o0, 0, %i5
4000aae0: 02 80 00 05 be 4000aaf4 <_Workspace_String_duplicate+0x24><== NEVER TAKEN
4000aae4: 92 10 00 18 mov %i0, %o1
dup [len] = '\0';
4000aae8: c0 2f 40 19 clrb [ %i5 + %i1 ]
memcpy(dup, string, len);
4000aaec: 40 00 10 c5 call 4000ee00 <memcpy>
4000aaf0: 94 10 00 19 mov %i1, %o2
}
return dup;
}
4000aaf4: 81 c7 e0 08 ret
4000aaf8: 91 e8 00 1d restore %g0, %i5, %o0
400080bc <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)) {
400080bc: 80 a2 ff f8 cmp %o3, -8
400080c0: 02 80 00 23 be 4000814c <check_and_merge+0x90>
400080c4: 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);
400080c8: c2 02 c0 00 ld [ %o3 ], %g1
400080cc: 80 a0 60 00 cmp %g1, 0
400080d0: 22 80 00 1c be,a 40008140 <check_and_merge+0x84>
400080d4: c4 02 e0 04 ld [ %o3 + 4 ], %g2
if (b->begin < a->begin) {
400080d8: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3
400080dc: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2
400080e0: 80 a0 c0 02 cmp %g3, %g2
400080e4: 3a 80 00 07 bcc,a 40008100 <check_and_merge+0x44>
400080e8: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
400080ec: 84 10 00 0a mov %o2, %g2
400080f0: c2 02 80 00 ld [ %o2 ], %g1
400080f4: 94 10 00 0b mov %o3, %o2
400080f8: 96 10 00 02 mov %g2, %o3
a = b;
b = t;
}
a->size += b->size;
400080fc: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
40008100: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
40008104: c4 02 e0 04 ld [ %o3 + 4 ], %g2
40008108: 86 01 00 03 add %g4, %g3, %g3
4000810c: c6 22 a0 1c st %g3, [ %o2 + 0x1c ]
next->previous = previous;
previous->next = next;
40008110: c2 20 80 00 st %g1, [ %g2 ]
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
next->previous = previous;
40008114: c4 20 60 04 st %g2, [ %g1 + 4 ]
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
40008118: c2 02 00 00 ld [ %o0 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
4000811c: d0 22 e0 04 st %o0, [ %o3 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
40008120: d6 22 00 00 st %o3, [ %o0 ]
the_node->next = before_node;
40008124: 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);
40008128: 90 10 00 09 mov %o1, %o0
before_node->previous = the_node;
4000812c: d6 20 60 04 st %o3, [ %g1 + 4 ]
40008130: 92 02 e0 08 add %o3, 8, %o1
40008134: 82 13 c0 00 mov %o7, %g1
40008138: 40 00 07 0a call 40009d60 <_RBTree_Extract_unprotected>
4000813c: 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);
40008140: 80 a0 a0 00 cmp %g2, 0
40008144: 32 bf ff e6 bne,a 400080dc <check_and_merge+0x20> <== NEVER TAKEN
40008148: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED
4000814c: 81 c3 e0 08 retl
40007d10 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
40007d10: 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 );
40007d14: 40 00 01 85 call 40008328 <_Chain_Get>
40007d18: 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(
40007d1c: 92 10 20 00 clr %o1
40007d20: ba 10 00 08 mov %o0, %i5
40007d24: 94 10 00 1a mov %i2, %o2
40007d28: 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
40007d2c: 80 a7 60 00 cmp %i5, 0
40007d30: 12 80 00 0a bne 40007d58 <rtems_chain_get_with_wait+0x48>
40007d34: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
40007d38: 7f ff fc df call 400070b4 <rtems_event_receive>
40007d3c: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
40007d40: 80 a2 20 00 cmp %o0, 0
40007d44: 02 bf ff f4 be 40007d14 <rtems_chain_get_with_wait+0x4> <== NEVER TAKEN
40007d48: 01 00 00 00 nop
timeout,
&out
);
}
*node_ptr = node;
40007d4c: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
40007d50: 81 c7 e0 08 ret
40007d54: 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
40007d58: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
40007d5c: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
40007d60: 81 c7 e0 08 ret
40007d64: 91 e8 00 08 restore %g0, %o0, %o0
40010980 <rtems_event_system_receive>:
rtems_event_set event_in,
rtems_option option_set,
rtems_interval ticks,
rtems_event_set *event_out
)
{
40010980: 9d e3 bf 98 save %sp, -104, %sp
rtems_status_code sc;
if ( event_out != NULL ) {
40010984: 80 a6 e0 00 cmp %i3, 0
40010988: 02 80 00 0a be 400109b0 <rtems_event_system_receive+0x30> <== NEVER TAKEN
4001098c: 82 10 20 09 mov 9, %g1
Thread_Control *executing = _Thread_Executing;
40010990: 03 10 00 68 sethi %hi(0x4001a000), %g1
40010994: fa 00 63 f0 ld [ %g1 + 0x3f0 ], %i5 ! 4001a3f0 <_Per_CPU_Information+0x10>
RTEMS_API_Control *api = executing->API_Extensions[ THREAD_API_RTEMS ];
Event_Control *event = &api->System_event;
if ( !_Event_sets_Is_empty( event_in ) ) {
40010998: 80 a6 20 00 cmp %i0, 0
4001099c: 12 80 00 07 bne 400109b8 <rtems_event_system_receive+0x38><== ALWAYS TAKEN
400109a0: da 07 61 4c ld [ %i5 + 0x14c ], %o5
);
_Thread_Enable_dispatch();
sc = executing->Wait.return_code;
} else {
*event_out = event->pending_events;
400109a4: c4 03 60 04 ld [ %o5 + 4 ], %g2 <== NOT EXECUTED
sc = RTEMS_SUCCESSFUL;
400109a8: 82 10 20 00 clr %g1 <== NOT EXECUTED
);
_Thread_Enable_dispatch();
sc = executing->Wait.return_code;
} else {
*event_out = event->pending_events;
400109ac: c4 26 c0 00 st %g2, [ %i3 ] <== NOT EXECUTED
} else {
sc = RTEMS_INVALID_ADDRESS;
}
return sc;
}
400109b0: 81 c7 e0 08 ret <== NOT EXECUTED
400109b4: 91 e8 00 01 restore %g0, %g1, %o0 <== NOT EXECUTED
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
400109b8: 03 10 00 68 sethi %hi(0x4001a000), %g1
400109bc: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 4001a1e0 <_Thread_Dispatch_disable_level>
++level;
400109c0: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
400109c4: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ]
RTEMS_API_Control *api = executing->API_Extensions[ THREAD_API_RTEMS ];
Event_Control *event = &api->System_event;
if ( !_Event_sets_Is_empty( event_in ) ) {
_Thread_Disable_dispatch();
_Event_Seize(
400109c8: 03 00 01 00 sethi %hi(0x40000), %g1
400109cc: 90 10 00 18 mov %i0, %o0
400109d0: 92 10 00 19 mov %i1, %o1
400109d4: 94 10 00 1a mov %i2, %o2
400109d8: 96 10 00 1b mov %i3, %o3
400109dc: 98 10 00 1d mov %i5, %o4
400109e0: 9a 03 60 04 add %o5, 4, %o5
400109e4: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
400109e8: 03 10 00 69 sethi %hi(0x4001a400), %g1
400109ec: 82 10 60 40 or %g1, 0x40, %g1 ! 4001a440 <_System_event_Sync_state>
400109f0: 7f ff dd 9b call 4000805c <_Event_Seize>
400109f4: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
executing,
event,
&_System_event_Sync_state,
STATES_WAITING_FOR_SYSTEM_EVENT
);
_Thread_Enable_dispatch();
400109f8: 7f ff e9 83 call 4000b004 <_Thread_Enable_dispatch>
400109fc: 01 00 00 00 nop
sc = executing->Wait.return_code;
40010a00: c2 07 60 34 ld [ %i5 + 0x34 ], %g1
} else {
sc = RTEMS_INVALID_ADDRESS;
}
return sc;
}
40010a04: 81 c7 e0 08 ret
40010a08: 91 e8 00 01 restore %g0, %g1, %o0
40007574 <rtems_event_system_send>:
rtems_status_code rtems_event_system_send(
rtems_id id,
rtems_event_set event_in
)
{
40007574: 9d e3 bf 98 save %sp, -104, %sp
rtems_status_code sc;
Thread_Control *thread;
Objects_Locations location;
RTEMS_API_Control *api;
thread = _Thread_Get( id, &location );
40007578: 90 10 00 18 mov %i0, %o0
4000757c: 40 00 0a 38 call 40009e5c <_Thread_Get>
40007580: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
40007584: c2 07 bf fc ld [ %fp + -4 ], %g1
40007588: 80 a0 60 00 cmp %g1, 0
4000758c: 12 80 00 0d bne 400075c0 <rtems_event_system_send+0x4c> <== NEVER TAKEN
40007590: 92 10 00 19 mov %i1, %o1
case OBJECTS_LOCAL:
api = thread->API_Extensions[ THREAD_API_RTEMS ];
_Event_Surrender(
40007594: d4 02 21 4c ld [ %o0 + 0x14c ], %o2
40007598: 94 02 a0 04 add %o2, 4, %o2
4000759c: 19 00 01 00 sethi %hi(0x40000), %o4
400075a0: 17 10 00 76 sethi %hi(0x4001d800), %o3
400075a4: 96 12 e2 80 or %o3, 0x280, %o3 ! 4001da80 <_System_event_Sync_state>
400075a8: 7f ff fe 54 call 40006ef8 <_Event_Surrender>
400075ac: b0 10 20 00 clr %i0
event_in,
&api->System_event,
&_System_event_Sync_state,
STATES_WAITING_FOR_SYSTEM_EVENT
);
_Thread_Enable_dispatch();
400075b0: 40 00 0a 1f call 40009e2c <_Thread_Enable_dispatch>
400075b4: 01 00 00 00 nop
sc = RTEMS_SUCCESSFUL;
break;
400075b8: 81 c7 e0 08 ret
400075bc: 81 e8 00 00 restore
sc = RTEMS_INVALID_ID;
break;
}
return sc;
}
400075c0: 81 c7 e0 08 ret <== NOT EXECUTED
400075c4: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED
40008e64 <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
)
{
40008e64: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
40008e68: 03 10 00 68 sethi %hi(0x4001a000), %g1
40008e6c: c4 00 63 e8 ld [ %g1 + 0x3e8 ], %g2 ! 4001a3e8 <_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
)
{
40008e70: ba 10 00 18 mov %i0, %i5
rtems_device_major_number major_limit = _IO_Number_of_drivers;
40008e74: 03 10 00 69 sethi %hi(0x4001a400), %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
)
{
40008e78: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
40008e7c: c8 00 60 88 ld [ %g1 + 0x88 ], %g4
if ( rtems_interrupt_is_in_progress() )
40008e80: 80 a0 a0 00 cmp %g2, 0
40008e84: 12 80 00 1f bne 40008f00 <rtems_io_register_driver+0x9c>
40008e88: b0 10 20 12 mov 0x12, %i0
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
40008e8c: 80 a6 a0 00 cmp %i2, 0
40008e90: 02 80 00 21 be 40008f14 <rtems_io_register_driver+0xb0>
40008e94: 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 )
40008e98: 02 80 00 1f be 40008f14 <rtems_io_register_driver+0xb0>
40008e9c: 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;
40008ea0: c4 06 40 00 ld [ %i1 ], %g2
40008ea4: 80 a0 a0 00 cmp %g2, 0
40008ea8: 22 80 00 18 be,a 40008f08 <rtems_io_register_driver+0xa4>
40008eac: 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 )
40008eb0: 80 a1 00 1d cmp %g4, %i5
40008eb4: 08 80 00 13 bleu 40008f00 <rtems_io_register_driver+0x9c>
40008eb8: 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)
{
uint32_t level = _Thread_Dispatch_disable_level;
40008ebc: 05 10 00 68 sethi %hi(0x4001a000), %g2
40008ec0: c8 00 a1 e0 ld [ %g2 + 0x1e0 ], %g4 ! 4001a1e0 <_Thread_Dispatch_disable_level>
++level;
40008ec4: 88 01 20 01 inc %g4
_Thread_Dispatch_disable_level = level;
40008ec8: c8 20 a1 e0 st %g4, [ %g2 + 0x1e0 ]
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
40008ecc: 80 a7 60 00 cmp %i5, 0
40008ed0: 02 80 00 13 be 40008f1c <rtems_io_register_driver+0xb8>
40008ed4: 39 10 00 69 sethi %hi(0x4001a400), %i4
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
40008ed8: c8 07 20 8c ld [ %i4 + 0x8c ], %g4 ! 4001a48c <_IO_Driver_address_table>
40008edc: 85 2f 60 03 sll %i5, 3, %g2
40008ee0: b7 2f 60 05 sll %i5, 5, %i3
40008ee4: 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;
40008ee8: f2 01 00 01 ld [ %g4 + %g1 ], %i1
40008eec: 80 a6 60 00 cmp %i1, 0
40008ef0: 02 80 00 3a be 40008fd8 <rtems_io_register_driver+0x174>
40008ef4: 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();
40008ef8: 40 00 08 43 call 4000b004 <_Thread_Enable_dispatch>
40008efc: b0 10 20 0c mov 0xc, %i0
return RTEMS_RESOURCE_IN_USE;
40008f00: 81 c7 e0 08 ret
40008f04: 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;
40008f08: 80 a0 a0 00 cmp %g2, 0
40008f0c: 12 bf ff ea bne 40008eb4 <rtems_io_register_driver+0x50>
40008f10: 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;
40008f14: 81 c7 e0 08 ret
40008f18: 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;
40008f1c: c8 00 60 88 ld [ %g1 + 0x88 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
40008f20: 80 a1 20 00 cmp %g4, 0
40008f24: 02 80 00 33 be 40008ff0 <rtems_io_register_driver+0x18c> <== NEVER TAKEN
40008f28: c2 07 20 8c ld [ %i4 + 0x8c ], %g1
40008f2c: 30 80 00 04 b,a 40008f3c <rtems_io_register_driver+0xd8>
40008f30: 80 a7 40 04 cmp %i5, %g4
40008f34: 02 80 00 24 be 40008fc4 <rtems_io_register_driver+0x160>
40008f38: 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;
40008f3c: c4 00 40 00 ld [ %g1 ], %g2
40008f40: 80 a0 a0 00 cmp %g2, 0
40008f44: 32 bf ff fb bne,a 40008f30 <rtems_io_register_driver+0xcc>
40008f48: ba 07 60 01 inc %i5
40008f4c: c4 00 60 04 ld [ %g1 + 4 ], %g2
40008f50: 80 a0 a0 00 cmp %g2, 0
40008f54: 32 bf ff f7 bne,a 40008f30 <rtems_io_register_driver+0xcc>
40008f58: ba 07 60 01 inc %i5
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
40008f5c: fa 26 80 00 st %i5, [ %i2 ]
40008f60: 85 2f 60 03 sll %i5, 3, %g2
if ( m != n )
40008f64: 80 a1 00 1d cmp %g4, %i5
40008f68: 02 80 00 18 be 40008fc8 <rtems_io_register_driver+0x164> <== NEVER TAKEN
40008f6c: b7 2f 60 05 sll %i5, 5, %i3
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
40008f70: c8 00 c0 00 ld [ %g3 ], %g4
40008f74: c2 07 20 8c ld [ %i4 + 0x8c ], %g1
40008f78: 84 26 c0 02 sub %i3, %g2, %g2
40008f7c: c8 20 40 02 st %g4, [ %g1 + %g2 ]
40008f80: c8 00 e0 04 ld [ %g3 + 4 ], %g4
40008f84: 82 00 40 02 add %g1, %g2, %g1
40008f88: c8 20 60 04 st %g4, [ %g1 + 4 ]
40008f8c: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
40008f90: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
40008f94: c4 20 60 08 st %g2, [ %g1 + 8 ]
40008f98: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
40008f9c: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
40008fa0: c4 20 60 0c st %g2, [ %g1 + 0xc ]
40008fa4: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
40008fa8: b0 10 00 1d mov %i5, %i0
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
40008fac: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
40008fb0: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
40008fb4: 40 00 08 14 call 4000b004 <_Thread_Enable_dispatch>
40008fb8: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
40008fbc: 40 00 1f 9f call 40010e38 <rtems_io_initialize>
40008fc0: 81 e8 00 00 restore
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
40008fc4: 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();
40008fc8: 40 00 08 0f call 4000b004 <_Thread_Enable_dispatch>
40008fcc: b0 10 20 05 mov 5, %i0
return sc;
40008fd0: 81 c7 e0 08 ret
40008fd4: 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;
40008fd8: c2 00 60 04 ld [ %g1 + 4 ], %g1
40008fdc: 80 a0 60 00 cmp %g1, 0
40008fe0: 12 bf ff c6 bne 40008ef8 <rtems_io_register_driver+0x94>
40008fe4: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
40008fe8: 10 bf ff e2 b 40008f70 <rtems_io_register_driver+0x10c>
40008fec: fa 26 80 00 st %i5, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
40008ff0: 10 bf ff f6 b 40008fc8 <rtems_io_register_driver+0x164> <== NOT EXECUTED
40008ff4: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
4000a0fc <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)
{
4000a0fc: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
4000a100: 80 a6 20 00 cmp %i0, 0
4000a104: 02 80 00 23 be 4000a190 <rtems_iterate_over_all_threads+0x94><== NEVER TAKEN
4000a108: 37 10 00 80 sethi %hi(0x40020000), %i3
4000a10c: b6 16 e3 a8 or %i3, 0x3a8, %i3 ! 400203a8 <_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)
4000a110: 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 ] )
4000a114: c2 06 c0 00 ld [ %i3 ], %g1
4000a118: 80 a0 60 00 cmp %g1, 0
4000a11c: 22 80 00 1a be,a 4000a184 <rtems_iterate_over_all_threads+0x88>
4000a120: b6 06 e0 04 add %i3, 4, %i3
continue;
#endif
information = _Objects_Information_table[ api_index ][ 1 ];
4000a124: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
4000a128: 80 a7 20 00 cmp %i4, 0
4000a12c: 22 80 00 16 be,a 4000a184 <rtems_iterate_over_all_threads+0x88>
4000a130: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
4000a134: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
4000a138: 86 90 60 00 orcc %g1, 0, %g3
4000a13c: 22 80 00 12 be,a 4000a184 <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
4000a140: b6 06 e0 04 add %i3, 4, %i3 <== NOT EXECUTED
4000a144: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
4000a148: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
4000a14c: 83 2f 60 02 sll %i5, 2, %g1
4000a150: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_thread )
4000a154: 90 90 60 00 orcc %g1, 0, %o0
4000a158: 02 80 00 05 be 4000a16c <rtems_iterate_over_all_threads+0x70><== NEVER TAKEN
4000a15c: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
4000a160: 9f c6 00 00 call %i0
4000a164: 01 00 00 00 nop
4000a168: 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++ ) {
4000a16c: 83 28 e0 10 sll %g3, 0x10, %g1
4000a170: 83 30 60 10 srl %g1, 0x10, %g1
4000a174: 80 a0 40 1d cmp %g1, %i5
4000a178: 3a bf ff f5 bcc,a 4000a14c <rtems_iterate_over_all_threads+0x50>
4000a17c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
4000a180: 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++ ) {
4000a184: 80 a6 c0 1a cmp %i3, %i2
4000a188: 32 bf ff e4 bne,a 4000a118 <rtems_iterate_over_all_threads+0x1c>
4000a18c: c2 06 c0 00 ld [ %i3 ], %g1
4000a190: 81 c7 e0 08 ret
4000a194: 81 e8 00 00 restore
40008d54 <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
)
{
40008d54: 9d e3 bf a0 save %sp, -96, %sp
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
40008d58: 80 a6 a0 00 cmp %i2, 0
40008d5c: 02 80 00 21 be 40008de0 <rtems_object_get_class_information+0x8c>
40008d60: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
40008d64: 93 2e 60 10 sll %i1, 0x10, %o1
40008d68: 90 10 00 18 mov %i0, %o0
40008d6c: 40 00 07 b0 call 4000ac2c <_Objects_Get_information>
40008d70: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
40008d74: 80 a2 20 00 cmp %o0, 0
40008d78: 02 80 00 1a be 40008de0 <rtems_object_get_class_information+0x8c>
40008d7c: 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;
40008d80: 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;
40008d84: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
40008d88: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
40008d8c: 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;
40008d90: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
40008d94: c4 26 a0 04 st %g2, [ %i2 + 4 ]
info->auto_extend = obj_info->auto_extend;
40008d98: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
40008d9c: 80 a1 20 00 cmp %g4, 0
40008da0: 02 80 00 12 be 40008de8 <rtems_object_get_class_information+0x94><== NEVER TAKEN
40008da4: c8 26 a0 08 st %g4, [ %i2 + 8 ]
40008da8: fa 02 20 1c ld [ %o0 + 0x1c ], %i5
40008dac: 86 10 20 01 mov 1, %g3
40008db0: 82 10 20 01 mov 1, %g1
40008db4: 84 10 20 00 clr %g2
if ( !obj_info->local_table[i] )
40008db8: 87 28 e0 02 sll %g3, 2, %g3
40008dbc: 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++ )
40008dc0: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
40008dc4: 80 a0 00 03 cmp %g0, %g3
40008dc8: 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++ )
40008dcc: 80 a1 00 01 cmp %g4, %g1
40008dd0: 1a bf ff fa bcc 40008db8 <rtems_object_get_class_information+0x64>
40008dd4: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
40008dd8: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
40008ddc: 82 10 20 00 clr %g1
}
40008de0: 81 c7 e0 08 ret
40008de4: 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++ )
40008de8: 84 10 20 00 clr %g2 <== NOT EXECUTED
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
return RTEMS_SUCCESSFUL;
40008dec: 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;
40008df0: 10 bf ff fc b 40008de0 <rtems_object_get_class_information+0x8c><== NOT EXECUTED
40008df4: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] <== NOT EXECUTED
40014db8 <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
40014db8: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
40014dbc: 80 a6 20 00 cmp %i0, 0
40014dc0: 12 80 00 04 bne 40014dd0 <rtems_partition_create+0x18>
40014dc4: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
40014dc8: 81 c7 e0 08 ret
40014dcc: 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 )
40014dd0: 80 a6 60 00 cmp %i1, 0
40014dd4: 02 bf ff fd be 40014dc8 <rtems_partition_create+0x10>
40014dd8: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
40014ddc: 80 a7 60 00 cmp %i5, 0
40014de0: 02 bf ff fa be 40014dc8 <rtems_partition_create+0x10> <== NEVER TAKEN
40014de4: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
40014de8: 02 bf ff f8 be 40014dc8 <rtems_partition_create+0x10>
40014dec: 82 10 20 08 mov 8, %g1
40014df0: 80 a6 a0 00 cmp %i2, 0
40014df4: 02 bf ff f5 be 40014dc8 <rtems_partition_create+0x10>
40014df8: 80 a6 80 1b cmp %i2, %i3
40014dfc: 0a bf ff f3 bcs 40014dc8 <rtems_partition_create+0x10>
40014e00: 80 8e e0 07 btst 7, %i3
40014e04: 12 bf ff f1 bne 40014dc8 <rtems_partition_create+0x10>
40014e08: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
40014e0c: 12 bf ff ef bne 40014dc8 <rtems_partition_create+0x10>
40014e10: 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)
{
uint32_t level = _Thread_Dispatch_disable_level;
40014e14: 03 10 00 ef sethi %hi(0x4003bc00), %g1
40014e18: c4 00 60 20 ld [ %g1 + 0x20 ], %g2 ! 4003bc20 <_Thread_Dispatch_disable_level>
++level;
40014e1c: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
40014e20: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
* 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 );
40014e24: 23 10 00 ee sethi %hi(0x4003b800), %l1
40014e28: 40 00 13 de call 40019da0 <_Objects_Allocate>
40014e2c: 90 14 62 14 or %l1, 0x214, %o0 ! 4003ba14 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
40014e30: a0 92 20 00 orcc %o0, 0, %l0
40014e34: 02 80 00 1a be 40014e9c <rtems_partition_create+0xe4>
40014e38: 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;
40014e3c: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
40014e40: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
40014e44: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
40014e48: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
40014e4c: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
40014e50: 40 00 56 95 call 4002a8a4 <.udiv>
40014e54: 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,
40014e58: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
40014e5c: 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,
40014e60: 96 10 00 1b mov %i3, %o3
40014e64: b8 04 20 24 add %l0, 0x24, %i4
40014e68: 40 00 0d 85 call 4001847c <_Chain_Initialize>
40014e6c: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
40014e70: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
40014e74: a2 14 62 14 or %l1, 0x214, %l1
40014e78: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
40014e7c: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
40014e80: 85 28 a0 02 sll %g2, 2, %g2
40014e84: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
40014e88: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
40014e8c: 40 00 19 0d call 4001b2c0 <_Thread_Enable_dispatch>
40014e90: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
40014e94: 10 bf ff cd b 40014dc8 <rtems_partition_create+0x10>
40014e98: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
40014e9c: 40 00 19 09 call 4001b2c0 <_Thread_Enable_dispatch>
40014ea0: 01 00 00 00 nop
return RTEMS_TOO_MANY;
40014ea4: 10 bf ff c9 b 40014dc8 <rtems_partition_create+0x10>
40014ea8: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
40014fdc <rtems_partition_return_buffer>:
rtems_status_code rtems_partition_return_buffer(
rtems_id id,
void *buffer
)
{
40014fdc: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Partition_Control *)
40014fe0: 11 10 00 ee sethi %hi(0x4003b800), %o0
40014fe4: 92 10 00 18 mov %i0, %o1
40014fe8: 90 12 22 14 or %o0, 0x214, %o0
40014fec: 40 00 14 dd call 4001a360 <_Objects_Get>
40014ff0: 94 07 bf fc add %fp, -4, %o2
register Partition_Control *the_partition;
Objects_Locations location;
the_partition = _Partition_Get( id, &location );
switch ( location ) {
40014ff4: c2 07 bf fc ld [ %fp + -4 ], %g1
40014ff8: 80 a0 60 00 cmp %g1, 0
40014ffc: 12 80 00 19 bne 40015060 <rtems_partition_return_buffer+0x84>
40015000: ba 10 00 08 mov %o0, %i5
)
{
void *starting;
void *ending;
starting = the_partition->starting_address;
40015004: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
40015008: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
4001500c: 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 ) &&
40015010: 80 a6 40 01 cmp %i1, %g1
40015014: 18 80 00 15 bgu 40015068 <rtems_partition_return_buffer+0x8c><== NEVER TAKEN
40015018: 80 a6 40 08 cmp %i1, %o0
4001501c: 0a 80 00 13 bcs 40015068 <rtems_partition_return_buffer+0x8c>
40015020: 01 00 00 00 nop
offset = (uint32_t) _Addresses_Subtract(
the_buffer,
the_partition->starting_address
);
return ((offset % the_partition->buffer_size) == 0);
40015024: d2 07 60 18 ld [ %i5 + 0x18 ], %o1
40015028: 40 00 56 cb call 4002ab54 <.urem>
4001502c: 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 ) &&
40015030: 80 a2 20 00 cmp %o0, 0
40015034: 12 80 00 0d bne 40015068 <rtems_partition_return_buffer+0x8c>
40015038: 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 );
4001503c: 40 00 0c f5 call 40018410 <_Chain_Append>
40015040: 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;
40015044: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
40015048: 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;
4001504c: 82 00 7f ff add %g1, -1, %g1
_Thread_Enable_dispatch();
40015050: 40 00 18 9c call 4001b2c0 <_Thread_Enable_dispatch>
40015054: c2 27 60 20 st %g1, [ %i5 + 0x20 ]
40015058: 81 c7 e0 08 ret
4001505c: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
40015060: 81 c7 e0 08 ret
40015064: 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();
40015068: 40 00 18 96 call 4001b2c0 <_Thread_Enable_dispatch>
4001506c: b0 10 20 09 mov 9, %i0
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
40015070: 81 c7 e0 08 ret
40015074: 81 e8 00 00 restore
40036a8c <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
40036a8c: 9d e3 bf 98 save %sp, -104, %sp
40036a90: 11 10 01 9c sethi %hi(0x40067000), %o0
40036a94: 92 10 00 18 mov %i0, %o1
40036a98: 90 12 21 98 or %o0, 0x198, %o0
40036a9c: 7f ff 47 99 call 40008900 <_Objects_Get>
40036aa0: 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 ) {
40036aa4: c2 07 bf fc ld [ %fp + -4 ], %g1
40036aa8: 80 a0 60 00 cmp %g1, 0
40036aac: 12 80 00 0d bne 40036ae0 <rtems_rate_monotonic_period+0x54>
40036ab0: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
40036ab4: c4 02 20 40 ld [ %o0 + 0x40 ], %g2
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
40036ab8: 39 10 01 9b sethi %hi(0x40066c00), %i4
40036abc: b8 17 23 70 or %i4, 0x370, %i4 ! 40066f70 <_Per_CPU_Information>
40036ac0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
40036ac4: 80 a0 80 01 cmp %g2, %g1
40036ac8: 02 80 00 08 be 40036ae8 <rtems_rate_monotonic_period+0x5c>
40036acc: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
40036ad0: 7f ff 4b 38 call 400097b0 <_Thread_Enable_dispatch>
40036ad4: b0 10 20 17 mov 0x17, %i0
40036ad8: 81 c7 e0 08 ret
40036adc: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
40036ae0: 81 c7 e0 08 ret
40036ae4: 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 ) {
40036ae8: 12 80 00 0e bne 40036b20 <rtems_rate_monotonic_period+0x94>
40036aec: 01 00 00 00 nop
switch ( the_period->state ) {
40036af0: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
40036af4: 80 a0 60 04 cmp %g1, 4
40036af8: 18 80 00 06 bgu 40036b10 <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
40036afc: b0 10 20 00 clr %i0
40036b00: 83 28 60 02 sll %g1, 2, %g1
40036b04: 05 10 01 83 sethi %hi(0x40060c00), %g2
40036b08: 84 10 a0 a8 or %g2, 0xa8, %g2 ! 40060ca8 <CSWTCH.24>
40036b0c: f0 00 80 01 ld [ %g2 + %g1 ], %i0
id,
NULL
);
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
40036b10: 7f ff 4b 28 call 400097b0 <_Thread_Enable_dispatch>
40036b14: 01 00 00 00 nop
40036b18: 81 c7 e0 08 ret
40036b1c: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
40036b20: 7f ff 2c d5 call 40001e74 <sparc_disable_interrupts>
40036b24: 01 00 00 00 nop
40036b28: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
40036b2c: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
40036b30: 80 a6 e0 00 cmp %i3, 0
40036b34: 02 80 00 1c be 40036ba4 <rtems_rate_monotonic_period+0x118>
40036b38: 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 ) {
40036b3c: 02 80 00 2e be 40036bf4 <rtems_rate_monotonic_period+0x168>
40036b40: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
40036b44: 12 bf ff e5 bne 40036ad8 <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
40036b48: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
40036b4c: 7f ff ff 5e call 400368c4 <_Rate_monotonic_Update_statistics>
40036b50: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
40036b54: 7f ff 2c cc call 40001e84 <sparc_enable_interrupts>
40036b58: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
40036b5c: 82 10 20 02 mov 2, %g1
40036b60: 92 07 60 10 add %i5, 0x10, %o1
40036b64: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
40036b68: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
40036b6c: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036b70: 11 10 01 9b sethi %hi(0x40066c00), %o0
40036b74: 7f ff 4e 3e call 4000a46c <_Watchdog_Insert>
40036b78: 90 12 22 08 or %o0, 0x208, %o0 ! 40066e08 <_Watchdog_Ticks_chain>
40036b7c: d0 07 60 40 ld [ %i5 + 0x40 ], %o0
40036b80: d2 07 60 3c ld [ %i5 + 0x3c ], %o1
40036b84: 03 10 01 8a sethi %hi(0x40062800), %g1
40036b88: c2 00 63 74 ld [ %g1 + 0x374 ], %g1 ! 40062b74 <_Scheduler+0x34>
40036b8c: 9f c0 40 00 call %g1
40036b90: 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();
40036b94: 7f ff 4b 07 call 400097b0 <_Thread_Enable_dispatch>
40036b98: 01 00 00 00 nop
40036b9c: 81 c7 e0 08 ret
40036ba0: 81 e8 00 00 restore
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
40036ba4: 7f ff 2c b8 call 40001e84 <sparc_enable_interrupts>
40036ba8: 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 );
40036bac: 90 10 00 1d mov %i5, %o0
40036bb0: 7f ff ff 94 call 40036a00 <_Rate_monotonic_Initiate_statistics>
40036bb4: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
the_period->state = RATE_MONOTONIC_ACTIVE;
40036bb8: 82 10 20 02 mov 2, %g1
40036bbc: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
40036bc0: 03 10 00 db sethi %hi(0x40036c00), %g1
40036bc4: 82 10 60 68 or %g1, 0x68, %g1 ! 40036c68 <_Rate_monotonic_Timeout>
the_watchdog->id = id;
40036bc8: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036bcc: 92 07 60 10 add %i5, 0x10, %o1
40036bd0: 11 10 01 9b sethi %hi(0x40066c00), %o0
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
40036bd4: c0 27 60 18 clr [ %i5 + 0x18 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036bd8: 90 12 22 08 or %o0, 0x208, %o0
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
40036bdc: c0 27 60 34 clr [ %i5 + 0x34 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
40036be0: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
40036be4: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
40036be8: 7f ff 4e 21 call 4000a46c <_Watchdog_Insert>
40036bec: b0 10 20 00 clr %i0
40036bf0: 30 bf ff c8 b,a 40036b10 <rtems_rate_monotonic_period+0x84>
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
40036bf4: 7f ff ff 34 call 400368c4 <_Rate_monotonic_Update_statistics>
40036bf8: 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;
40036bfc: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
40036c00: 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;
40036c04: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
40036c08: 7f ff 2c 9f call 40001e84 <sparc_enable_interrupts>
40036c0c: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
40036c10: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
40036c14: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
40036c18: 90 10 00 01 mov %g1, %o0
40036c1c: 13 00 00 10 sethi %hi(0x4000), %o1
40036c20: 7f ff 4d 2a call 4000a0c8 <_Thread_Set_state>
40036c24: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
40036c28: 7f ff 2c 93 call 40001e74 <sparc_disable_interrupts>
40036c2c: 01 00 00 00 nop
local_state = the_period->state;
40036c30: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
40036c34: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
40036c38: 7f ff 2c 93 call 40001e84 <sparc_enable_interrupts>
40036c3c: 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 )
40036c40: 80 a6 a0 03 cmp %i2, 3
40036c44: 22 80 00 06 be,a 40036c5c <rtems_rate_monotonic_period+0x1d0>
40036c48: d0 07 20 10 ld [ %i4 + 0x10 ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
40036c4c: 7f ff 4a d9 call 400097b0 <_Thread_Enable_dispatch>
40036c50: b0 10 20 00 clr %i0
40036c54: 81 c7 e0 08 ret
40036c58: 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 );
40036c5c: 7f ff 49 e8 call 400093fc <_Thread_Clear_state>
40036c60: 13 00 00 10 sethi %hi(0x4000), %o1
40036c64: 30 bf ff fa b,a 40036c4c <rtems_rate_monotonic_period+0x1c0>
40028540 <rtems_rate_monotonic_report_statistics_with_plugin>:
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
40028540: 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 )
40028544: 80 a6 60 00 cmp %i1, 0
40028548: 02 80 00 48 be 40028668 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
4002854c: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
40028550: 13 10 01 77 sethi %hi(0x4005dc00), %o1
40028554: 9f c6 40 00 call %i1
40028558: 92 12 63 88 or %o1, 0x388, %o1 ! 4005df88 <_TOD_Days_per_month+0x68>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
4002855c: 90 10 00 18 mov %i0, %o0
40028560: 13 10 01 77 sethi %hi(0x4005dc00), %o1
40028564: 9f c6 40 00 call %i1
40028568: 92 12 63 a8 or %o1, 0x3a8, %o1 ! 4005dfa8 <_TOD_Days_per_month+0x88>
(*print)( context, "--- Wall times are in seconds ---\n" );
4002856c: 90 10 00 18 mov %i0, %o0
40028570: 13 10 01 77 sethi %hi(0x4005dc00), %o1
40028574: 9f c6 40 00 call %i1
40028578: 92 12 63 d0 or %o1, 0x3d0, %o1 ! 4005dfd0 <_TOD_Days_per_month+0xb0>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
4002857c: 90 10 00 18 mov %i0, %o0
40028580: 13 10 01 77 sethi %hi(0x4005dc00), %o1
40028584: 9f c6 40 00 call %i1
40028588: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 4005dff8 <_TOD_Days_per_month+0xd8>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
4002858c: 90 10 00 18 mov %i0, %o0
40028590: 13 10 01 78 sethi %hi(0x4005e000), %o1
40028594: 9f c6 40 00 call %i1
40028598: 92 12 60 48 or %o1, 0x48, %o1 ! 4005e048 <_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 ;
4002859c: 39 10 01 9c sethi %hi(0x40067000), %i4
400285a0: b8 17 21 98 or %i4, 0x198, %i4 ! 40067198 <_Rate_monotonic_Information>
400285a4: fa 07 20 08 ld [ %i4 + 8 ], %i5
400285a8: c2 07 20 0c ld [ %i4 + 0xc ], %g1
400285ac: 80 a7 40 01 cmp %i5, %g1
400285b0: 18 80 00 2e bgu 40028668 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
400285b4: 35 10 01 78 sethi %hi(0x4005e000), %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,
400285b8: 27 10 01 78 sethi %hi(0x4005e000), %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,
400285bc: 25 10 01 78 sethi %hi(0x4005e000), %l2
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
400285c0: 37 10 01 7d sethi %hi(0x4005f400), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
400285c4: b4 16 a0 98 or %i2, 0x98, %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,
400285c8: a6 14 e0 b0 or %l3, 0xb0, %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,
400285cc: a4 14 a0 d0 or %l2, 0xd0, %l2
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
400285d0: 10 80 00 06 b 400285e8 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
400285d4: b6 16 e1 58 or %i3, 0x158, %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++ ) {
400285d8: 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 ;
400285dc: 80 a0 40 1d cmp %g1, %i5
400285e0: 0a 80 00 22 bcs 40028668 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
400285e4: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
400285e8: 90 10 00 1d mov %i5, %o0
400285ec: 40 00 37 d2 call 40036534 <rtems_rate_monotonic_get_statistics>
400285f0: 92 07 bf c8 add %fp, -56, %o1
if ( status != RTEMS_SUCCESSFUL )
400285f4: 80 a2 20 00 cmp %o0, 0
400285f8: 32 bf ff f8 bne,a 400285d8 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
400285fc: 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 );
40028600: 92 07 bf b0 add %fp, -80, %o1
40028604: 40 00 38 3e call 400366fc <rtems_rate_monotonic_get_status>
40028608: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
4002860c: d0 07 bf b0 ld [ %fp + -80 ], %o0
40028610: 94 07 bf a0 add %fp, -96, %o2
40028614: 7f ff 98 b2 call 4000e8dc <rtems_object_get_name>
40028618: 92 10 20 05 mov 5, %o1
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
4002861c: d8 1f bf c8 ldd [ %fp + -56 ], %o4
40028620: 92 10 00 1a mov %i2, %o1
40028624: 94 10 00 1d mov %i5, %o2
40028628: 90 10 00 18 mov %i0, %o0
4002862c: 9f c6 40 00 call %i1
40028630: 96 07 bf a0 add %fp, -96, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
40028634: 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 );
40028638: 94 07 bf a8 add %fp, -88, %o2
4002863c: 90 07 bf e0 add %fp, -32, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
40028640: 80 a0 60 00 cmp %g1, 0
40028644: 12 80 00 0b bne 40028670 <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
40028648: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
4002864c: 9f c6 40 00 call %i1
40028650: 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 ;
40028654: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
40028658: 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 ;
4002865c: 80 a0 40 1d cmp %g1, %i5
40028660: 1a bf ff e3 bcc 400285ec <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
40028664: 90 10 00 1d mov %i5, %o0
40028668: 81 c7 e0 08 ret
4002866c: 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 );
40028670: 40 00 03 52 call 400293b8 <_Timespec_Divide_by_integer>
40028674: 92 10 00 01 mov %g1, %o1
(*print)( context,
40028678: d0 07 bf d4 ld [ %fp + -44 ], %o0
4002867c: 40 00 ae dd call 400541f0 <.div>
40028680: 92 10 23 e8 mov 0x3e8, %o1
40028684: aa 10 00 08 mov %o0, %l5
40028688: d0 07 bf dc ld [ %fp + -36 ], %o0
4002868c: 40 00 ae d9 call 400541f0 <.div>
40028690: 92 10 23 e8 mov 0x3e8, %o1
40028694: c2 07 bf a8 ld [ %fp + -88 ], %g1
40028698: a2 10 00 08 mov %o0, %l1
4002869c: d0 07 bf ac ld [ %fp + -84 ], %o0
400286a0: e0 07 bf d0 ld [ %fp + -48 ], %l0
400286a4: e8 07 bf d8 ld [ %fp + -40 ], %l4
400286a8: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
400286ac: 40 00 ae d1 call 400541f0 <.div>
400286b0: 92 10 23 e8 mov 0x3e8, %o1
400286b4: 96 10 00 15 mov %l5, %o3
400286b8: 98 10 00 14 mov %l4, %o4
400286bc: 9a 10 00 11 mov %l1, %o5
400286c0: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
400286c4: 92 10 00 13 mov %l3, %o1
400286c8: 94 10 00 10 mov %l0, %o2
400286cc: 9f c6 40 00 call %i1
400286d0: 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);
400286d4: d2 07 bf c8 ld [ %fp + -56 ], %o1
400286d8: 94 07 bf a8 add %fp, -88, %o2
400286dc: 40 00 03 37 call 400293b8 <_Timespec_Divide_by_integer>
400286e0: 90 07 bf f8 add %fp, -8, %o0
(*print)( context,
400286e4: d0 07 bf ec ld [ %fp + -20 ], %o0
400286e8: 40 00 ae c2 call 400541f0 <.div>
400286ec: 92 10 23 e8 mov 0x3e8, %o1
400286f0: a8 10 00 08 mov %o0, %l4
400286f4: d0 07 bf f4 ld [ %fp + -12 ], %o0
400286f8: 40 00 ae be call 400541f0 <.div>
400286fc: 92 10 23 e8 mov 0x3e8, %o1
40028700: c2 07 bf a8 ld [ %fp + -88 ], %g1
40028704: a0 10 00 08 mov %o0, %l0
40028708: d0 07 bf ac ld [ %fp + -84 ], %o0
4002870c: ea 07 bf e8 ld [ %fp + -24 ], %l5
40028710: e2 07 bf f0 ld [ %fp + -16 ], %l1
40028714: 92 10 23 e8 mov 0x3e8, %o1
40028718: 40 00 ae b6 call 400541f0 <.div>
4002871c: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
40028720: 92 10 00 12 mov %l2, %o1
40028724: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
40028728: 94 10 00 15 mov %l5, %o2
4002872c: 90 10 00 18 mov %i0, %o0
40028730: 96 10 00 14 mov %l4, %o3
40028734: 98 10 00 11 mov %l1, %o4
40028738: 9f c6 40 00 call %i1
4002873c: 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 ;
40028740: 10 bf ff a6 b 400285d8 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
40028744: c2 07 20 0c ld [ %i4 + 0xc ], %g1
40028760 <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
40028760: 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)
{
uint32_t level = _Thread_Dispatch_disable_level;
40028764: 03 10 01 9b sethi %hi(0x40066c00), %g1
40028768: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 40066d70 <_Thread_Dispatch_disable_level>
++level;
4002876c: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
40028770: c4 20 61 70 st %g2, [ %g1 + 0x170 ]
/*
* 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 ;
40028774: 39 10 01 9c sethi %hi(0x40067000), %i4
40028778: b8 17 21 98 or %i4, 0x198, %i4 ! 40067198 <_Rate_monotonic_Information>
4002877c: fa 07 20 08 ld [ %i4 + 8 ], %i5
40028780: c2 07 20 0c ld [ %i4 + 0xc ], %g1
40028784: 80 a7 40 01 cmp %i5, %g1
40028788: 18 80 00 09 bgu 400287ac <rtems_rate_monotonic_reset_all_statistics+0x4c><== NEVER TAKEN
4002878c: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
40028790: 40 00 00 09 call 400287b4 <rtems_rate_monotonic_reset_statistics>
40028794: 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 ;
40028798: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
4002879c: 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 ;
400287a0: 80 a0 40 1d cmp %g1, %i5
400287a4: 1a bf ff fb bcc 40028790 <rtems_rate_monotonic_reset_all_statistics+0x30>
400287a8: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
400287ac: 7f ff 84 01 call 400097b0 <_Thread_Enable_dispatch>
400287b0: 81 e8 00 00 restore
40008284 <rtems_rbheap_allocate>:
return big_enough;
}
void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size)
{
40008284: 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;
40008288: 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;
4000828c: 90 10 00 19 mov %i1, %o0
40008290: 40 00 2b f7 call 4001326c <.urem>
40008294: 92 10 00 1d mov %i5, %o1
if (excess > 0) {
40008298: 80 a2 20 00 cmp %o0, 0
4000829c: 02 80 00 26 be 40008334 <rtems_rbheap_allocate+0xb0> <== ALWAYS TAKEN
400082a0: b6 10 00 19 mov %i1, %i3
value += alignment - excess;
400082a4: ba 06 40 1d add %i1, %i5, %i5 <== NOT EXECUTED
400082a8: b6 27 40 08 sub %i5, %o0, %i3 <== NOT EXECUTED
400082ac: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED
400082b0: 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) {
400082b4: 80 88 60 ff btst 0xff, %g1
400082b8: 02 80 00 1d be 4000832c <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
400082bc: 80 a6 60 00 cmp %i1, 0
400082c0: 02 80 00 1b be 4000832c <rtems_rbheap_allocate+0xa8>
400082c4: 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;
400082c8: 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) {
400082cc: 80 a7 40 01 cmp %i5, %g1
400082d0: 02 80 00 17 be 4000832c <rtems_rbheap_allocate+0xa8>
400082d4: 01 00 00 00 nop
rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current;
if (free_chunk->size >= size) {
400082d8: f8 07 60 1c ld [ %i5 + 0x1c ], %i4
400082dc: 80 a6 c0 1c cmp %i3, %i4
400082e0: 38 80 00 10 bgu,a 40008320 <rtems_rbheap_allocate+0x9c>
400082e4: 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) {
400082e8: 80 a7 60 00 cmp %i5, 0
400082ec: 02 80 00 10 be 4000832c <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
400082f0: 80 a7 00 1b cmp %i4, %i3
uintptr_t free_size = free_chunk->size;
if (free_size > aligned_size) {
400082f4: 18 80 00 12 bgu 4000833c <rtems_rbheap_allocate+0xb8>
400082f8: 01 00 00 00 nop
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
400082fc: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
40008300: 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;
40008304: f0 07 60 18 ld [ %i5 + 0x18 ], %i0
next->previous = previous;
40008308: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
4000830c: c4 20 40 00 st %g2, [ %g1 ]
*/
RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain(
Chain_Node *node
)
{
node->next = node->previous = NULL;
40008310: c0 27 60 04 clr [ %i5 + 4 ]
40008314: c0 27 40 00 clr [ %i5 ]
}
}
}
return ptr;
}
40008318: 81 c7 e0 08 ret
4000831c: 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) {
40008320: 80 a0 40 1d cmp %g1, %i5
40008324: 32 bf ff ee bne,a 400082dc <rtems_rbheap_allocate+0x58> <== NEVER TAKEN
40008328: 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;
4000832c: 81 c7 e0 08 ret
40008330: 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) {
40008334: 10 bf ff e0 b 400082b4 <rtems_rbheap_allocate+0x30>
40008338: 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);
4000833c: 7f ff ff 46 call 40008054 <get_chunk>
40008340: 90 10 00 18 mov %i0, %o0
if (new_chunk != NULL) {
40008344: b4 92 20 00 orcc %o0, 0, %i2
40008348: 02 bf ff f9 be 4000832c <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
4000834c: 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;
40008350: 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;
40008354: f8 27 60 1c st %i4, [ %i5 + 0x1c ]
new_chunk->begin = free_chunk->begin + new_free_size;
new_chunk->size = aligned_size;
40008358: 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;
4000835c: b8 07 00 01 add %i4, %g1, %i4
40008360: c0 26 a0 04 clr [ %i2 + 4 ]
40008364: f8 26 a0 18 st %i4, [ %i2 + 0x18 ]
40008368: 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);
4000836c: 90 06 20 18 add %i0, 0x18, %o0
40008370: 40 00 06 f4 call 40009f40 <_RBTree_Insert_unprotected>
40008374: 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;
40008378: f0 06 a0 18 ld [ %i2 + 0x18 ], %i0
4000837c: 81 c7 e0 08 ret
40008380: 81 e8 00 00 restore
400084c8 <rtems_rbheap_extend_descriptors_with_malloc>:
/* Do nothing */
}
void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control)
{
400084c8: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED
rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk));
400084cc: 7f ff ec fa call 400038b4 <malloc> <== NOT EXECUTED
400084d0: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED
if (chunk != NULL) {
400084d4: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
400084d8: 02 80 00 07 be 400084f4 <rtems_rbheap_extend_descriptors_with_malloc+0x2c><== NOT EXECUTED
400084dc: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
400084e0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED
after_node->next = the_node;
400084e4: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
400084e8: 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;
400084ec: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
before_node->previous = the_node;
400084f0: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED
400084f4: 81 c7 e0 08 ret <== NOT EXECUTED
400084f8: 81 e8 00 00 restore <== NOT EXECUTED
40008384 <rtems_rbheap_free>:
_RBTree_Extract_unprotected(chunk_tree, &b->tree_node);
}
}
rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr)
{
40008384: 9d e3 bf 80 save %sp, -128, %sp
40008388: b4 10 00 18 mov %i0, %i2
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (ptr != NULL) {
4000838c: 80 a6 60 00 cmp %i1, 0
40008390: 02 80 00 2a be 40008438 <rtems_rbheap_free+0xb4>
40008394: 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;
40008398: 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 };
4000839c: c0 27 bf fc clr [ %fp + -4 ]
400083a0: c0 27 bf e0 clr [ %fp + -32 ]
400083a4: c0 27 bf e4 clr [ %fp + -28 ]
400083a8: c0 27 bf e8 clr [ %fp + -24 ]
400083ac: c0 27 bf ec clr [ %fp + -20 ]
400083b0: c0 27 bf f0 clr [ %fp + -16 ]
400083b4: c0 27 bf f4 clr [ %fp + -12 ]
400083b8: f2 27 bf f8 st %i1, [ %fp + -8 ]
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
400083bc: 80 a7 60 00 cmp %i5, 0
400083c0: 02 80 00 3e be 400084b8 <rtems_rbheap_free+0x134> <== NEVER TAKEN
400083c4: b8 06 a0 18 add %i2, 0x18, %i4
400083c8: b6 10 20 00 clr %i3
compare_result = the_rbtree->compare_function(the_node, iter_node);
400083cc: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
400083d0: 92 10 00 1d mov %i5, %o1
400083d4: 9f c0 40 00 call %g1
400083d8: 90 07 bf e8 add %fp, -24, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
400083dc: 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 ) ) {
400083e0: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
400083e4: 82 20 40 08 sub %g1, %o0, %g1
400083e8: 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];
400083ec: 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 ) ) {
400083f0: 12 80 00 06 bne 40008408 <rtems_rbheap_free+0x84>
400083f4: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
400083f8: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
400083fc: 80 a0 a0 00 cmp %g2, 0
40008400: 12 80 00 10 bne 40008440 <rtems_rbheap_free+0xbc> <== ALWAYS TAKEN
40008404: b6 10 00 1d mov %i5, %i3
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
40008408: 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) {
4000840c: 80 a7 60 00 cmp %i5, 0
40008410: 32 bf ff f0 bne,a 400083d0 <rtems_rbheap_free+0x4c>
40008414: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return rtems_rbheap_chunk_of_node(
40008418: 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) {
4000841c: 80 a7 7f f8 cmp %i5, -8
40008420: 02 80 00 06 be 40008438 <rtems_rbheap_free+0xb4>
40008424: 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);
40008428: c2 06 ff f8 ld [ %i3 + -8 ], %g1
4000842c: 80 a0 60 00 cmp %g1, 0
40008430: 02 80 00 06 be 40008448 <rtems_rbheap_free+0xc4>
40008434: b0 10 20 0e mov 0xe, %i0
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
40008438: 81 c7 e0 08 ret
4000843c: 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(
40008440: 10 bf ff f7 b 4000841c <rtems_rbheap_free+0x98>
40008444: ba 06 ff f8 add %i3, -8, %i5
40008448: c2 06 ff fc ld [ %i3 + -4 ], %g1
4000844c: 80 a0 60 00 cmp %g1, 0
40008450: 12 bf ff fa bne 40008438 <rtems_rbheap_free+0xb4> <== NEVER TAKEN
40008454: 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(
40008458: 40 00 07 89 call 4000a27c <_RBTree_Next_unprotected>
4000845c: 90 10 00 1b mov %i3, %o0
40008460: 92 10 20 01 mov 1, %o1
40008464: b2 10 00 08 mov %o0, %i1
40008468: 40 00 07 85 call 4000a27c <_RBTree_Next_unprotected>
4000846c: 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);
40008470: 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(
40008474: 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);
40008478: 94 10 00 1d mov %i5, %o2
4000847c: 7f ff ff 10 call 400080bc <check_and_merge>
40008480: 90 10 00 1a mov %i2, %o0
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
40008484: c2 06 80 00 ld [ %i2 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
40008488: f4 26 ff fc st %i2, [ %i3 + -4 ]
before_node = after_node->next;
after_node->next = the_node;
4000848c: fa 26 80 00 st %i5, [ %i2 ]
the_node->next = before_node;
40008490: c2 26 ff f8 st %g1, [ %i3 + -8 ]
before_node->previous = the_node;
40008494: fa 20 60 04 st %i5, [ %g1 + 4 ]
add_to_chain(free_chain, chunk);
check_and_merge(free_chain, chunk_tree, chunk, pred);
40008498: 90 10 00 1a mov %i2, %o0
4000849c: 92 10 00 1c mov %i4, %o1
400084a0: 94 10 00 1d mov %i5, %o2
400084a4: 96 06 7f f8 add %i1, -8, %o3
400084a8: 7f ff ff 05 call 400080bc <check_and_merge>
400084ac: b0 10 20 00 clr %i0
400084b0: 81 c7 e0 08 ret
400084b4: 81 e8 00 00 restore
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
400084b8: 81 c7 e0 08 ret <== NOT EXECUTED
400084bc: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED
40008154 <rtems_rbheap_initialize>:
uintptr_t area_size,
uintptr_t alignment,
rtems_rbheap_extend_descriptors extend_descriptors,
void *handler_arg
)
{
40008154: 9d e3 bf a0 save %sp, -96, %sp
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (alignment > 0) {
40008158: 80 a6 e0 00 cmp %i3, 0
4000815c: 12 80 00 04 bne 4000816c <rtems_rbheap_initialize+0x18>
40008160: 82 10 20 0a mov 0xa, %g1
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
40008164: 81 c7 e0 08 ret
40008168: 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;
4000816c: 90 10 00 19 mov %i1, %o0
40008170: 92 10 00 1b mov %i3, %o1
40008174: 40 00 2c 3e call 4001326c <.urem>
40008178: b4 06 40 1a add %i1, %i2, %i2
if (excess > 0) {
4000817c: 80 a2 20 00 cmp %o0, 0
40008180: 32 80 00 09 bne,a 400081a4 <rtems_rbheap_initialize+0x50>
40008184: a0 06 40 1b add %i1, %i3, %l0
40008188: 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) {
4000818c: 80 88 60 ff btst 0xff, %g1
40008190: 12 80 00 0b bne 400081bc <rtems_rbheap_initialize+0x68> <== ALWAYS TAKEN
40008194: a0 10 00 19 mov %i1, %l0
insert_into_tree(chunk_tree, first);
} else {
sc = RTEMS_NO_MEMORY;
}
} else {
sc = RTEMS_INVALID_ADDRESS;
40008198: 82 10 20 09 mov 9, %g1 <== NOT EXECUTED
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
4000819c: 81 c7 e0 08 ret
400081a0: 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;
400081a4: a0 24 00 08 sub %l0, %o0, %l0
400081a8: 80 a4 00 19 cmp %l0, %i1
400081ac: 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) {
400081b0: 80 88 60 ff btst 0xff, %g1
400081b4: 02 bf ff fa be 4000819c <rtems_rbheap_initialize+0x48>
400081b8: 82 10 20 09 mov 9, %g1
400081bc: 80 a6 40 1a cmp %i1, %i2
400081c0: 1a bf ff f7 bcc 4000819c <rtems_rbheap_initialize+0x48>
400081c4: 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;
400081c8: 90 10 00 1a mov %i2, %o0
400081cc: 40 00 2c 28 call 4001326c <.urem>
400081d0: 92 10 00 1b mov %i3, %o1
return value - excess;
400081d4: 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) {
400081d8: 80 a4 00 1a cmp %l0, %i2
400081dc: 1a bf ff e2 bcc 40008164 <rtems_rbheap_initialize+0x10>
400081e0: 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 );
400081e4: 82 06 20 04 add %i0, 4, %g1
head->next = tail;
400081e8: 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 );
400081ec: 82 06 20 0c add %i0, 0xc, %g1
head->next = tail;
head->previous = NULL;
tail->previous = head;
400081f0: 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;
400081f4: 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 );
400081f8: 84 06 20 10 add %i0, 0x10, %g2
400081fc: 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;
40008200: 03 10 00 20 sethi %hi(0x40008000), %g1
40008204: 82 10 60 44 or %g1, 0x44, %g1 ! 40008044 <chunk_compare>
head->next = tail;
head->previous = NULL;
40008208: c0 26 20 04 clr [ %i0 + 4 ]
4000820c: c2 26 20 28 st %g1, [ %i0 + 0x28 ]
tail->previous = head;
40008210: 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;
40008214: c0 26 20 10 clr [ %i0 + 0x10 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
40008218: 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;
4000821c: c0 26 20 18 clr [ %i0 + 0x18 ]
the_rbtree->root = NULL;
40008220: c0 26 20 1c clr [ %i0 + 0x1c ]
the_rbtree->first[0] = NULL;
40008224: c0 26 20 20 clr [ %i0 + 0x20 ]
the_rbtree->first[1] = NULL;
40008228: 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;
4000822c: f6 26 20 30 st %i3, [ %i0 + 0x30 ]
control->handler_arg = handler_arg;
40008230: fa 26 20 38 st %i5, [ %i0 + 0x38 ]
control->extend_descriptors = extend_descriptors;
40008234: f8 26 20 34 st %i4, [ %i0 + 0x34 ]
first = get_chunk(control);
40008238: 7f ff ff 87 call 40008054 <get_chunk>
4000823c: 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;
40008240: 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) {
40008244: 80 a2 20 00 cmp %o0, 0
40008248: 02 bf ff c7 be 40008164 <rtems_rbheap_initialize+0x10>
4000824c: 92 10 00 08 mov %o0, %o1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
40008250: c2 06 00 00 ld [ %i0 ], %g1
first->begin = aligned_begin;
first->size = aligned_end - aligned_begin;
40008254: 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;
40008258: e0 22 20 18 st %l0, [ %o0 + 0x18 ]
first->size = aligned_end - aligned_begin;
4000825c: f4 22 20 1c st %i2, [ %o0 + 0x1c ]
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
40008260: f0 22 20 04 st %i0, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
40008264: d0 26 00 00 st %o0, [ %i0 ]
the_node->next = before_node;
40008268: c2 22 00 00 st %g1, [ %o0 ]
before_node->previous = the_node;
4000826c: 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);
40008270: 92 02 60 08 add %o1, 8, %o1
40008274: 40 00 07 33 call 40009f40 <_RBTree_Insert_unprotected>
40008278: 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;
4000827c: 10 bf ff ba b 40008164 <rtems_rbheap_initialize+0x10>
40008280: 82 10 20 00 clr %g1
40016590 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
40016590: 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 )
40016594: 80 a6 60 00 cmp %i1, 0
40016598: 12 80 00 04 bne 400165a8 <rtems_signal_send+0x18>
4001659c: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
400165a0: 81 c7 e0 08 ret
400165a4: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
400165a8: 90 10 00 18 mov %i0, %o0
400165ac: 40 00 13 51 call 4001b2f0 <_Thread_Get>
400165b0: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
400165b4: c2 07 bf fc ld [ %fp + -4 ], %g1
400165b8: 80 a0 60 00 cmp %g1, 0
400165bc: 12 80 00 20 bne 4001663c <rtems_signal_send+0xac>
400165c0: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
400165c4: fa 02 21 4c ld [ %o0 + 0x14c ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
400165c8: c2 07 60 0c ld [ %i5 + 0xc ], %g1
400165cc: 80 a0 60 00 cmp %g1, 0
400165d0: 02 80 00 1e be 40016648 <rtems_signal_send+0xb8>
400165d4: 01 00 00 00 nop
if ( asr->is_enabled ) {
400165d8: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
400165dc: 80 a0 60 00 cmp %g1, 0
400165e0: 02 80 00 1e be 40016658 <rtems_signal_send+0xc8>
400165e4: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
400165e8: 7f ff e2 ea call 4000f190 <sparc_disable_interrupts>
400165ec: 01 00 00 00 nop
*signal_set |= signals;
400165f0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
400165f4: b2 10 40 19 or %g1, %i1, %i1
400165f8: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
400165fc: 7f ff e2 e9 call 4000f1a0 <sparc_enable_interrupts>
40016600: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
40016604: 03 10 00 ef sethi %hi(0x4003bc00), %g1
40016608: 82 10 62 30 or %g1, 0x230, %g1 ! 4003be30 <_Per_CPU_Information>
4001660c: c4 00 60 08 ld [ %g1 + 8 ], %g2
40016610: 80 a0 a0 00 cmp %g2, 0
40016614: 02 80 00 06 be 4001662c <rtems_signal_send+0x9c>
40016618: 01 00 00 00 nop
4001661c: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
40016620: 80 a7 00 02 cmp %i4, %g2
40016624: 02 80 00 15 be 40016678 <rtems_signal_send+0xe8> <== ALWAYS TAKEN
40016628: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
4001662c: 40 00 13 25 call 4001b2c0 <_Thread_Enable_dispatch>
40016630: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
40016634: 10 bf ff db b 400165a0 <rtems_signal_send+0x10>
40016638: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
4001663c: 82 10 20 04 mov 4, %g1
}
40016640: 81 c7 e0 08 ret
40016644: 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();
40016648: 40 00 13 1e call 4001b2c0 <_Thread_Enable_dispatch>
4001664c: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
40016650: 10 bf ff d4 b 400165a0 <rtems_signal_send+0x10>
40016654: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
40016658: 7f ff e2 ce call 4000f190 <sparc_disable_interrupts>
4001665c: 01 00 00 00 nop
*signal_set |= signals;
40016660: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
40016664: b2 10 40 19 or %g1, %i1, %i1
40016668: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
4001666c: 7f ff e2 cd call 4000f1a0 <sparc_enable_interrupts>
40016670: 01 00 00 00 nop
40016674: 30 bf ff ee b,a 4001662c <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;
40016678: c4 28 60 0c stb %g2, [ %g1 + 0xc ]
4001667c: 30 bf ff ec b,a 4001662c <rtems_signal_send+0x9c>
40010a0c <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
40010a0c: 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 )
40010a10: 80 a6 a0 00 cmp %i2, 0
40010a14: 02 80 00 3b be 40010b00 <rtems_task_mode+0xf4>
40010a18: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
40010a1c: 21 10 00 68 sethi %hi(0x4001a000), %l0
40010a20: a0 14 23 e0 or %l0, 0x3e0, %l0 ! 4001a3e0 <_Per_CPU_Information>
40010a24: fa 04 20 10 ld [ %l0 + 0x10 ], %i5
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
40010a28: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
40010a2c: 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;
40010a30: 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 ];
40010a34: f8 07 61 4c ld [ %i5 + 0x14c ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
40010a38: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
40010a3c: 80 a0 60 00 cmp %g1, 0
40010a40: 12 80 00 40 bne 40010b40 <rtems_task_mode+0x134>
40010a44: 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;
40010a48: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
40010a4c: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
40010a50: 7f ff ed f9 call 4000c234 <_CPU_ISR_Get_level>
40010a54: 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;
40010a58: a3 2c 60 0a sll %l1, 0xa, %l1
40010a5c: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
40010a60: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
40010a64: 80 8e 61 00 btst 0x100, %i1
40010a68: 02 80 00 06 be 40010a80 <rtems_task_mode+0x74>
40010a6c: 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;
40010a70: 83 36 20 08 srl %i0, 8, %g1
40010a74: 82 18 60 01 xor %g1, 1, %g1
40010a78: 82 08 60 01 and %g1, 1, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
40010a7c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
40010a80: 80 8e 62 00 btst 0x200, %i1
40010a84: 12 80 00 21 bne 40010b08 <rtems_task_mode+0xfc>
40010a88: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
40010a8c: 80 8e 60 0f btst 0xf, %i1
40010a90: 12 80 00 27 bne 40010b2c <rtems_task_mode+0x120>
40010a94: 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 ) {
40010a98: 80 8e 64 00 btst 0x400, %i1
40010a9c: 02 80 00 14 be 40010aec <rtems_task_mode+0xe0>
40010aa0: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
40010aa4: 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;
40010aa8: b1 36 20 0a srl %i0, 0xa, %i0
40010aac: b0 1e 20 01 xor %i0, 1, %i0
40010ab0: b0 0e 20 01 and %i0, 1, %i0
if ( is_asr_enabled != asr->is_enabled ) {
40010ab4: 80 a6 00 01 cmp %i0, %g1
40010ab8: 22 80 00 0e be,a 40010af0 <rtems_task_mode+0xe4>
40010abc: 03 10 00 68 sethi %hi(0x4001a000), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
40010ac0: 7f ff c7 63 call 4000284c <sparc_disable_interrupts>
40010ac4: f0 2f 20 08 stb %i0, [ %i4 + 8 ]
_signals = information->signals_pending;
40010ac8: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
40010acc: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
40010ad0: 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;
40010ad4: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
40010ad8: 7f ff c7 61 call 4000285c <sparc_enable_interrupts>
40010adc: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
40010ae0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
40010ae4: 80 a0 00 01 cmp %g0, %g1
40010ae8: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
40010aec: 03 10 00 68 sethi %hi(0x4001a000), %g1
40010af0: c4 00 63 dc ld [ %g1 + 0x3dc ], %g2 ! 4001a3dc <_System_state_Current>
40010af4: 80 a0 a0 03 cmp %g2, 3
40010af8: 02 80 00 1f be 40010b74 <rtems_task_mode+0x168>
40010afc: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
40010b00: 81 c7 e0 08 ret
40010b04: 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) ) {
40010b08: 22 bf ff e1 be,a 40010a8c <rtems_task_mode+0x80>
40010b0c: c0 27 60 78 clr [ %i5 + 0x78 ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
40010b10: 03 10 00 68 sethi %hi(0x4001a000), %g1
40010b14: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 ! 4001a140 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
40010b18: 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;
40010b1c: 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;
40010b20: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
40010b24: 02 bf ff dd be 40010a98 <rtems_task_mode+0x8c>
40010b28: 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 );
40010b2c: 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 ) );
40010b30: 7f ff c7 4b call 4000285c <sparc_enable_interrupts>
40010b34: 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 ) {
40010b38: 10 bf ff d9 b 40010a9c <rtems_task_mode+0x90>
40010b3c: 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;
40010b40: 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;
40010b44: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
40010b48: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
40010b4c: 7f ff ed ba call 4000c234 <_CPU_ISR_Get_level>
40010b50: 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;
40010b54: a3 2c 60 0a sll %l1, 0xa, %l1
40010b58: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
40010b5c: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
40010b60: 80 8e 61 00 btst 0x100, %i1
40010b64: 02 bf ff c7 be 40010a80 <rtems_task_mode+0x74>
40010b68: 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;
40010b6c: 10 bf ff c2 b 40010a74 <rtems_task_mode+0x68>
40010b70: 83 36 20 08 srl %i0, 8, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
40010b74: 80 88 e0 ff btst 0xff, %g3
40010b78: 12 80 00 0a bne 40010ba0 <rtems_task_mode+0x194>
40010b7c: c4 04 20 10 ld [ %l0 + 0x10 ], %g2
40010b80: c6 04 20 14 ld [ %l0 + 0x14 ], %g3
40010b84: 80 a0 80 03 cmp %g2, %g3
40010b88: 02 bf ff de be 40010b00 <rtems_task_mode+0xf4>
40010b8c: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
40010b90: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
40010b94: 80 a0 a0 00 cmp %g2, 0
40010b98: 02 bf ff da be 40010b00 <rtems_task_mode+0xf4> <== NEVER TAKEN
40010b9c: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
40010ba0: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
40010ba4: c2 2c 20 0c stb %g1, [ %l0 + 0xc ]
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
40010ba8: 40 00 02 8d call 400115dc <_Thread_Dispatch>
40010bac: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
40010bb0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
40010bb4: 81 c7 e0 08 ret
40010bb8: 91 e8 00 01 restore %g0, %g1, %o0
4000bd44 <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
4000bd44: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
4000bd48: 80 a6 60 00 cmp %i1, 0
4000bd4c: 02 80 00 08 be 4000bd6c <rtems_task_set_priority+0x28>
4000bd50: 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 ) );
4000bd54: 03 10 00 66 sethi %hi(0x40019800), %g1
4000bd58: c4 08 61 1c ldub [ %g1 + 0x11c ], %g2 ! 4001991c <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
4000bd5c: 80 a6 40 02 cmp %i1, %g2
4000bd60: 18 80 00 1e bgu 4000bdd8 <rtems_task_set_priority+0x94>
4000bd64: 82 10 20 13 mov 0x13, %g1
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
4000bd68: 80 a6 a0 00 cmp %i2, 0
4000bd6c: 02 80 00 1b be 4000bdd8 <rtems_task_set_priority+0x94>
4000bd70: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
4000bd74: 90 10 00 18 mov %i0, %o0
4000bd78: 40 00 09 fb call 4000e564 <_Thread_Get>
4000bd7c: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
4000bd80: c2 07 bf fc ld [ %fp + -4 ], %g1
4000bd84: 80 a0 60 00 cmp %g1, 0
4000bd88: 12 80 00 16 bne 4000bde0 <rtems_task_set_priority+0x9c>
4000bd8c: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
4000bd90: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
4000bd94: 80 a6 60 00 cmp %i1, 0
4000bd98: 02 80 00 0d be 4000bdcc <rtems_task_set_priority+0x88>
4000bd9c: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
4000bda0: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
4000bda4: 80 a0 60 00 cmp %g1, 0
4000bda8: 02 80 00 06 be 4000bdc0 <rtems_task_set_priority+0x7c>
4000bdac: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
4000bdb0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
4000bdb4: 80 a6 40 01 cmp %i1, %g1
4000bdb8: 1a 80 00 05 bcc 4000bdcc <rtems_task_set_priority+0x88> <== ALWAYS TAKEN
4000bdbc: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
4000bdc0: 92 10 00 19 mov %i1, %o1
4000bdc4: 40 00 08 a2 call 4000e04c <_Thread_Change_priority>
4000bdc8: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
4000bdcc: 40 00 09 da call 4000e534 <_Thread_Enable_dispatch>
4000bdd0: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
4000bdd4: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
4000bdd8: 81 c7 e0 08 ret
4000bddc: 91 e8 00 01 restore %g0, %g1, %o0
4000bde0: 81 c7 e0 08 ret
4000bde4: 91 e8 00 01 restore %g0, %g1, %o0
40006148 <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
40006148: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
4000614c: 80 a6 60 00 cmp %i1, 0
40006150: 02 80 00 1e be 400061c8 <rtems_task_variable_delete+0x80>
40006154: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
40006158: 90 10 00 18 mov %i0, %o0
4000615c: 40 00 08 92 call 400083a4 <_Thread_Get>
40006160: 92 07 bf fc add %fp, -4, %o1
switch (location) {
40006164: c2 07 bf fc ld [ %fp + -4 ], %g1
40006168: 80 a0 60 00 cmp %g1, 0
4000616c: 12 80 00 19 bne 400061d0 <rtems_task_variable_delete+0x88>
40006170: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
40006174: c2 02 21 58 ld [ %o0 + 0x158 ], %g1
while (tvp) {
40006178: 80 a0 60 00 cmp %g1, 0
4000617c: 02 80 00 10 be 400061bc <rtems_task_variable_delete+0x74>
40006180: 01 00 00 00 nop
if (tvp->ptr == ptr) {
40006184: c4 00 60 04 ld [ %g1 + 4 ], %g2
40006188: 80 a0 80 19 cmp %g2, %i1
4000618c: 32 80 00 09 bne,a 400061b0 <rtems_task_variable_delete+0x68>
40006190: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
40006194: 10 80 00 18 b 400061f4 <rtems_task_variable_delete+0xac>
40006198: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
4000619c: 80 a0 80 19 cmp %g2, %i1
400061a0: 22 80 00 0e be,a 400061d8 <rtems_task_variable_delete+0x90>
400061a4: c4 02 40 00 ld [ %o1 ], %g2
400061a8: 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;
400061ac: 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) {
400061b0: 80 a2 60 00 cmp %o1, 0
400061b4: 32 bf ff fa bne,a 4000619c <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
400061b8: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
400061bc: 40 00 08 6e call 40008374 <_Thread_Enable_dispatch>
400061c0: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
400061c4: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
400061c8: 81 c7 e0 08 ret
400061cc: 91 e8 00 01 restore %g0, %g1, %o0
400061d0: 81 c7 e0 08 ret
400061d4: 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;
400061d8: 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 );
400061dc: 40 00 00 2e call 40006294 <_RTEMS_Tasks_Invoke_task_variable_dtor>
400061e0: 01 00 00 00 nop
_Thread_Enable_dispatch();
400061e4: 40 00 08 64 call 40008374 <_Thread_Enable_dispatch>
400061e8: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
400061ec: 10 bf ff f7 b 400061c8 <rtems_task_variable_delete+0x80>
400061f0: 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;
400061f4: 92 10 00 01 mov %g1, %o1
400061f8: 10 bf ff f9 b 400061dc <rtems_task_variable_delete+0x94>
400061fc: c4 22 21 58 st %g2, [ %o0 + 0x158 ]
40006200 <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
40006200: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
40006204: 80 a6 60 00 cmp %i1, 0
40006208: 02 80 00 1b be 40006274 <rtems_task_variable_get+0x74>
4000620c: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !result )
40006210: 80 a6 a0 00 cmp %i2, 0
40006214: 02 80 00 18 be 40006274 <rtems_task_variable_get+0x74>
40006218: 90 10 00 18 mov %i0, %o0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
4000621c: 40 00 08 62 call 400083a4 <_Thread_Get>
40006220: 92 07 bf fc add %fp, -4, %o1
switch (location) {
40006224: c2 07 bf fc ld [ %fp + -4 ], %g1
40006228: 80 a0 60 00 cmp %g1, 0
4000622c: 12 80 00 14 bne 4000627c <rtems_task_variable_get+0x7c>
40006230: 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;
40006234: c2 02 21 58 ld [ %o0 + 0x158 ], %g1
while (tvp) {
40006238: 80 a0 60 00 cmp %g1, 0
4000623c: 32 80 00 07 bne,a 40006258 <rtems_task_variable_get+0x58>
40006240: c4 00 60 04 ld [ %g1 + 4 ], %g2
40006244: 30 80 00 10 b,a 40006284 <rtems_task_variable_get+0x84>
40006248: 80 a0 60 00 cmp %g1, 0
4000624c: 02 80 00 0e be 40006284 <rtems_task_variable_get+0x84> <== NEVER TAKEN
40006250: 01 00 00 00 nop
if (tvp->ptr == ptr) {
40006254: c4 00 60 04 ld [ %g1 + 4 ], %g2
40006258: 80 a0 80 19 cmp %g2, %i1
4000625c: 32 bf ff fb bne,a 40006248 <rtems_task_variable_get+0x48>
40006260: 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;
40006264: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
40006268: 40 00 08 43 call 40008374 <_Thread_Enable_dispatch>
4000626c: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
40006270: 82 10 20 00 clr %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
40006274: 81 c7 e0 08 ret
40006278: 91 e8 00 01 restore %g0, %g1, %o0
4000627c: 81 c7 e0 08 ret
40006280: 91 e8 00 01 restore %g0, %g1, %o0
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
40006284: 40 00 08 3c call 40008374 <_Thread_Enable_dispatch>
40006288: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
4000628c: 10 bf ff fa b 40006274 <rtems_task_variable_get+0x74>
40006290: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
4001707c <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
4001707c: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
40017080: 11 10 00 ef sethi %hi(0x4003bc00), %o0
40017084: 92 10 00 18 mov %i0, %o1
40017088: 90 12 22 d8 or %o0, 0x2d8, %o0
4001708c: 40 00 0c b5 call 4001a360 <_Objects_Get>
40017090: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
40017094: c2 07 bf fc ld [ %fp + -4 ], %g1
40017098: 80 a0 60 00 cmp %g1, 0
4001709c: 12 80 00 0c bne 400170cc <rtems_timer_cancel+0x50>
400170a0: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
400170a4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
400170a8: 80 a0 60 04 cmp %g1, 4
400170ac: 02 80 00 04 be 400170bc <rtems_timer_cancel+0x40> <== NEVER TAKEN
400170b0: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
400170b4: 40 00 14 8b call 4001c2e0 <_Watchdog_Remove>
400170b8: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
400170bc: 40 00 10 81 call 4001b2c0 <_Thread_Enable_dispatch>
400170c0: b0 10 20 00 clr %i0
400170c4: 81 c7 e0 08 ret
400170c8: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
400170cc: 81 c7 e0 08 ret
400170d0: 91 e8 20 04 restore %g0, 4, %o0
400175d4 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
400175d4: 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;
400175d8: 03 10 00 ef sethi %hi(0x4003bc00), %g1
400175dc: fa 00 63 18 ld [ %g1 + 0x318 ], %i5 ! 4003bf18 <_Timer_server>
if ( !timer_server )
400175e0: 80 a7 60 00 cmp %i5, 0
400175e4: 02 80 00 08 be 40017604 <rtems_timer_server_fire_when+0x30>
400175e8: 82 10 20 0e mov 0xe, %g1
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
400175ec: 39 10 00 ee sethi %hi(0x4003b800), %i4
400175f0: 82 17 23 68 or %i4, 0x368, %g1 ! 4003bb68 <_TOD>
400175f4: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2
400175f8: 80 a0 a0 00 cmp %g2, 0
400175fc: 12 80 00 04 bne 4001760c <rtems_timer_server_fire_when+0x38><== ALWAYS TAKEN
40017600: 82 10 20 0b mov 0xb, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
40017604: 81 c7 e0 08 ret
40017608: 91 e8 00 01 restore %g0, %g1, %o0
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
return RTEMS_NOT_DEFINED;
if ( !routine )
4001760c: 80 a6 a0 00 cmp %i2, 0
40017610: 02 bf ff fd be 40017604 <rtems_timer_server_fire_when+0x30>
40017614: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
40017618: 7f ff f3 1e call 40014290 <_TOD_Validate>
4001761c: 90 10 00 19 mov %i1, %o0
40017620: 80 8a 20 ff btst 0xff, %o0
40017624: 12 80 00 04 bne 40017634 <rtems_timer_server_fire_when+0x60>
40017628: 82 10 20 14 mov 0x14, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
4001762c: 81 c7 e0 08 ret
40017630: 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 );
40017634: 7f ff f2 dd call 400141a8 <_TOD_To_seconds>
40017638: 90 10 00 19 mov %i1, %o0
4001763c: b2 10 00 08 mov %o0, %i1
40017640: d0 1f 23 68 ldd [ %i4 + 0x368 ], %o0
40017644: 94 10 20 00 clr %o2
40017648: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
4001764c: 40 00 4e 20 call 4002aecc <__divdi3>
40017650: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_SIZE+0x3b5aca00>
if ( seconds <= _TOD_Seconds_since_epoch() )
40017654: 80 a6 40 09 cmp %i1, %o1
40017658: 08 bf ff f5 bleu 4001762c <rtems_timer_server_fire_when+0x58>
4001765c: 82 10 20 14 mov 0x14, %g1
40017660: 92 10 00 18 mov %i0, %o1
40017664: 11 10 00 ef sethi %hi(0x4003bc00), %o0
40017668: 94 07 bf fc add %fp, -4, %o2
4001766c: 40 00 0b 3d call 4001a360 <_Objects_Get>
40017670: 90 12 22 d8 or %o0, 0x2d8, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
40017674: c2 07 bf fc ld [ %fp + -4 ], %g1
40017678: 80 a0 60 00 cmp %g1, 0
4001767c: 12 80 00 19 bne 400176e0 <rtems_timer_server_fire_when+0x10c>
40017680: a0 10 00 08 mov %o0, %l0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
40017684: 40 00 13 17 call 4001c2e0 <_Watchdog_Remove>
40017688: 90 02 20 10 add %o0, 0x10, %o0
4001768c: d0 1f 23 68 ldd [ %i4 + 0x368 ], %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
40017690: 82 10 20 03 mov 3, %g1
40017694: 94 10 20 00 clr %o2
40017698: c2 24 20 38 st %g1, [ %l0 + 0x38 ]
4001769c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
400176a0: c0 24 20 18 clr [ %l0 + 0x18 ]
400176a4: 96 12 e2 00 or %o3, 0x200, %o3
the_watchdog->routine = routine;
400176a8: f4 24 20 2c st %i2, [ %l0 + 0x2c ]
the_watchdog->id = id;
400176ac: f0 24 20 30 st %i0, [ %l0 + 0x30 ]
400176b0: 40 00 4e 07 call 4002aecc <__divdi3>
400176b4: 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 );
400176b8: 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();
400176bc: b2 26 40 09 sub %i1, %o1, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
400176c0: 90 10 00 1d mov %i5, %o0
400176c4: 92 10 00 10 mov %l0, %o1
400176c8: 9f c0 40 00 call %g1
400176cc: f2 24 20 1c st %i1, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
400176d0: 40 00 0e fc call 4001b2c0 <_Thread_Enable_dispatch>
400176d4: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
400176d8: 10 bf ff cb b 40017604 <rtems_timer_server_fire_when+0x30>
400176dc: 82 10 20 00 clr %g1 ! 0 <PROM_START>
#endif
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
400176e0: 10 bf ff c9 b 40017604 <rtems_timer_server_fire_when+0x30>
400176e4: 82 10 20 04 mov 4, %g1