RTEMS 4.11Annotated Report
Thu Dec 20 15:03:42 2012
0200854c <_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);
200854c: c2 02 00 00 ld [ %o0 ], %g1
2008550: 80 a0 60 00 cmp %g1, 0
2008554: 22 80 00 04 be,a 2008564 <_API_extensions_Add_post_switch+0x18>
2008558: c2 02 20 04 ld [ %o0 + 4 ], %g1
200855c: 81 c3 e0 08 retl
2008560: 01 00 00 00 nop
2008564: 80 a0 60 00 cmp %g1, 0
2008568: 12 bf ff fd bne 200855c <_API_extensions_Add_post_switch+0x10><== NEVER TAKEN
200856c: 03 00 80 78 sethi %hi(0x201e000), %g1
Chain_Control *the_chain,
Chain_Node *the_node
)
{
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *old_last = tail->previous;
2008570: 82 10 63 94 or %g1, 0x394, %g1 ! 201e394 <_API_extensions_Post_switch_list>
2008574: c4 00 60 08 ld [ %g1 + 8 ], %g2
the_node->next = tail;
2008578: 86 00 60 04 add %g1, 4, %g3
tail->previous = the_node;
200857c: 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;
2008580: c6 22 00 00 st %g3, [ %o0 ]
tail->previous = the_node;
old_last->next = the_node;
2008584: d0 20 80 00 st %o0, [ %g2 ]
the_node->previous = old_last;
2008588: 81 c3 e0 08 retl
200858c: c4 22 20 04 st %g2, [ %o0 + 4 ]
02008590 <_API_extensions_Run_postdriver>:
}
}
#endif
void _API_extensions_Run_postdriver( void )
{
2008590: 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;
2008594: 39 00 80 79 sethi %hi(0x201e400), %i4
2008598: fa 07 20 e8 ld [ %i4 + 0xe8 ], %i5 ! 201e4e8 <_API_extensions_List>
200859c: b8 17 20 e8 or %i4, 0xe8, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20085a0: b8 07 20 04 add %i4, 4, %i4
20085a4: 80 a7 40 1c cmp %i5, %i4
20085a8: 02 80 00 09 be 20085cc <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
20085ac: 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)();
20085b0: c2 07 60 08 ld [ %i5 + 8 ], %g1
20085b4: 9f c0 40 00 call %g1
20085b8: 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 ) {
20085bc: 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 );
20085c0: 80 a7 40 1c cmp %i5, %i4
20085c4: 32 bf ff fc bne,a 20085b4 <_API_extensions_Run_postdriver+0x24>
20085c8: c2 07 60 08 ld [ %i5 + 8 ], %g1
20085cc: 81 c7 e0 08 ret
20085d0: 81 e8 00 00 restore
0200ac38 <_CORE_RWLock_Release>:
#include <rtems/score/watchdog.h>
CORE_RWLock_Status _CORE_RWLock_Release(
CORE_RWLock_Control *the_rwlock
)
{
200ac38: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Thread_Control *executing = _Thread_Executing;
200ac3c: 03 00 80 86 sethi %hi(0x2021800), %g1
* Otherwise, we have to block.
* If locked for reading and no waiters, then OK to read.
* If any thread is waiting, then we wait.
*/
_ISR_Disable( level );
200ac40: 7f ff e3 5d call 20039b4 <sparc_disable_interrupts>
200ac44: fa 00 60 70 ld [ %g1 + 0x70 ], %i5 ! 2021870 <_Per_CPU_Information+0x10>
200ac48: 84 10 00 08 mov %o0, %g2
if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){
200ac4c: c2 06 20 44 ld [ %i0 + 0x44 ], %g1
200ac50: 80 a0 60 00 cmp %g1, 0
200ac54: 02 80 00 2b be 200ad00 <_CORE_RWLock_Release+0xc8>
200ac58: 80 a0 60 01 cmp %g1, 1
_ISR_Enable( level );
executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE;
return CORE_RWLOCK_SUCCESSFUL;
}
if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) {
200ac5c: 22 80 00 22 be,a 200ace4 <_CORE_RWLock_Release+0xac>
200ac60: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
return CORE_RWLOCK_SUCCESSFUL;
}
}
/* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */
executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL;
200ac64: c0 27 60 34 clr [ %i5 + 0x34 ]
/*
* Implicitly transition to "unlocked" and find another thread interested
* in obtaining this rwlock.
*/
the_rwlock->current_state = CORE_RWLOCK_UNLOCKED;
200ac68: c0 26 20 44 clr [ %i0 + 0x44 ]
_ISR_Enable( level );
200ac6c: 7f ff e3 56 call 20039c4 <sparc_enable_interrupts>
200ac70: 90 10 00 02 mov %g2, %o0
next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue );
200ac74: 40 00 08 28 call 200cd14 <_Thread_queue_Dequeue>
200ac78: 90 10 00 18 mov %i0, %o0
if ( next ) {
200ac7c: 80 a2 20 00 cmp %o0, 0
200ac80: 22 80 00 24 be,a 200ad10 <_CORE_RWLock_Release+0xd8>
200ac84: b0 10 20 00 clr %i0
if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) {
200ac88: c2 02 20 30 ld [ %o0 + 0x30 ], %g1
200ac8c: 80 a0 60 01 cmp %g1, 1
200ac90: 02 80 00 22 be 200ad18 <_CORE_RWLock_Release+0xe0>
200ac94: 84 10 20 01 mov 1, %g2
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
200ac98: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
200ac9c: 82 00 60 01 inc %g1
the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING;
200aca0: c4 26 20 44 st %g2, [ %i0 + 0x44 ]
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
200aca4: 10 80 00 09 b 200acc8 <_CORE_RWLock_Release+0x90>
200aca8: c2 26 20 48 st %g1, [ %i0 + 0x48 ]
/*
* Now see if more readers can be let go.
*/
while ( 1 ) {
next = _Thread_queue_First( &the_rwlock->Wait_queue );
if ( !next ||
200acac: 80 a0 60 01 cmp %g1, 1
200acb0: 02 80 00 0b be 200acdc <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN
200acb4: 90 10 00 18 mov %i0, %o0
next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE )
return CORE_RWLOCK_SUCCESSFUL;
the_rwlock->number_of_readers += 1;
200acb8: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
200acbc: 82 00 60 01 inc %g1
_Thread_queue_Extract( &the_rwlock->Wait_queue, next );
200acc0: 40 00 09 25 call 200d154 <_Thread_queue_Extract>
200acc4: c2 26 20 48 st %g1, [ %i0 + 0x48 ]
/*
* Now see if more readers can be let go.
*/
while ( 1 ) {
next = _Thread_queue_First( &the_rwlock->Wait_queue );
200acc8: 40 00 09 74 call 200d298 <_Thread_queue_First>
200accc: 90 10 00 18 mov %i0, %o0
if ( !next ||
200acd0: 92 92 20 00 orcc %o0, 0, %o1
200acd4: 32 bf ff f6 bne,a 200acac <_CORE_RWLock_Release+0x74>
200acd8: c2 02 60 30 ld [ %o1 + 0x30 ], %g1
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
200acdc: 81 c7 e0 08 ret
200ace0: 91 e8 20 00 restore %g0, 0, %o0
_ISR_Enable( level );
executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE;
return CORE_RWLOCK_SUCCESSFUL;
}
if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) {
the_rwlock->number_of_readers -= 1;
200ace4: 82 00 7f ff add %g1, -1, %g1
if ( the_rwlock->number_of_readers != 0 ) {
200ace8: 80 a0 60 00 cmp %g1, 0
200acec: 02 bf ff de be 200ac64 <_CORE_RWLock_Release+0x2c>
200acf0: c2 26 20 48 st %g1, [ %i0 + 0x48 ]
/* must be unlocked again */
_ISR_Enable( level );
200acf4: 7f ff e3 34 call 20039c4 <sparc_enable_interrupts>
200acf8: b0 10 20 00 clr %i0
return CORE_RWLOCK_SUCCESSFUL;
200acfc: 30 80 00 05 b,a 200ad10 <_CORE_RWLock_Release+0xd8>
* If any thread is waiting, then we wait.
*/
_ISR_Disable( level );
if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){
_ISR_Enable( level );
200ad00: 7f ff e3 31 call 20039c4 <sparc_enable_interrupts>
200ad04: b0 10 20 00 clr %i0
executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE;
200ad08: 82 10 20 02 mov 2, %g1
200ad0c: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
200ad10: 81 c7 e0 08 ret
200ad14: 81 e8 00 00 restore
next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue );
if ( next ) {
if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) {
the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING;
200ad18: 82 10 20 02 mov 2, %g1
200ad1c: c2 26 20 44 st %g1, [ %i0 + 0x44 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
200ad20: 81 c7 e0 08 ret
200ad24: 91 e8 20 00 restore %g0, 0, %o0
0200ad28 <_CORE_RWLock_Timeout>:
void _CORE_RWLock_Timeout(
Objects_Id id,
void *ignored
)
{
200ad28: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
200ad2c: 90 10 00 18 mov %i0, %o0
200ad30: 40 00 07 1b call 200c99c <_Thread_Get>
200ad34: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200ad38: c2 07 bf fc ld [ %fp + -4 ], %g1
200ad3c: 80 a0 60 00 cmp %g1, 0
200ad40: 12 80 00 08 bne 200ad60 <_CORE_RWLock_Timeout+0x38> <== NEVER TAKEN
200ad44: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
200ad48: 40 00 09 95 call 200d39c <_Thread_queue_Process_timeout>
200ad4c: 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;
200ad50: 03 00 80 84 sethi %hi(0x2021000), %g1
200ad54: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 ! 2021340 <_Thread_Dispatch_disable_level>
--level;
200ad58: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
200ad5c: c4 20 63 40 st %g2, [ %g1 + 0x340 ]
200ad60: 81 c7 e0 08 ret
200ad64: 81 e8 00 00 restore
020088f0 <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
20088f0: 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 )
20088f4: 3b 00 80 78 sethi %hi(0x201e000), %i5
20088f8: c2 07 63 20 ld [ %i5 + 0x320 ], %g1 ! 201e320 <_Thread_Dispatch_disable_level>
20088fc: 80 a0 60 00 cmp %g1, 0
2008900: 02 80 00 1f be 200897c <_CORE_mutex_Seize+0x8c>
2008904: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
2008908: 80 a6 a0 00 cmp %i2, 0
200890c: 02 80 00 2c be 20089bc <_CORE_mutex_Seize+0xcc>
2008910: 90 10 00 18 mov %i0, %o0
2008914: 03 00 80 7a sethi %hi(0x201e800), %g1
2008918: c2 00 60 38 ld [ %g1 + 0x38 ], %g1 ! 201e838 <_System_state_Current>
200891c: 80 a0 60 01 cmp %g1, 1
2008920: 38 80 00 2e bgu,a 20089d8 <_CORE_mutex_Seize+0xe8>
2008924: 90 10 20 00 clr %o0
2008928: 40 00 15 00 call 200dd28 <_CORE_mutex_Seize_interrupt_trylock>
200892c: 92 07 a0 54 add %fp, 0x54, %o1
2008930: 80 a2 20 00 cmp %o0, 0
2008934: 02 80 00 27 be 20089d0 <_CORE_mutex_Seize+0xe0> <== ALWAYS TAKEN
2008938: 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;
200893c: c4 07 63 20 ld [ %i5 + 0x320 ], %g2
2008940: 03 00 80 7a sethi %hi(0x201e800), %g1
2008944: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_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;
2008948: 86 10 20 01 mov 1, %g3
200894c: c6 26 20 30 st %g3, [ %i0 + 0x30 ]
2008950: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
2008954: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
++level;
2008958: 82 00 a0 01 add %g2, 1, %g1
_Thread_Dispatch_disable_level = level;
200895c: c2 27 63 20 st %g1, [ %i5 + 0x320 ]
2008960: 7f ff e7 2f call 200261c <sparc_enable_interrupts>
2008964: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2008968: 90 10 00 18 mov %i0, %o0
200896c: 7f ff ff ba call 2008854 <_CORE_mutex_Seize_interrupt_blocking>
2008970: 92 10 00 1b mov %i3, %o1
2008974: 81 c7 e0 08 ret
2008978: 81 e8 00 00 restore
200897c: 90 10 00 18 mov %i0, %o0
2008980: 40 00 14 ea call 200dd28 <_CORE_mutex_Seize_interrupt_trylock>
2008984: 92 07 a0 54 add %fp, 0x54, %o1
2008988: 80 a2 20 00 cmp %o0, 0
200898c: 02 bf ff fa be 2008974 <_CORE_mutex_Seize+0x84>
2008990: 80 a6 a0 00 cmp %i2, 0
2008994: 12 bf ff ea bne 200893c <_CORE_mutex_Seize+0x4c>
2008998: 01 00 00 00 nop
200899c: 7f ff e7 20 call 200261c <sparc_enable_interrupts>
20089a0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
20089a4: 03 00 80 7a sethi %hi(0x201e800), %g1
20089a8: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_Per_CPU_Information+0x10>
20089ac: 84 10 20 01 mov 1, %g2
20089b0: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
20089b4: 81 c7 e0 08 ret
20089b8: 81 e8 00 00 restore
20089bc: 40 00 14 db call 200dd28 <_CORE_mutex_Seize_interrupt_trylock>
20089c0: 92 07 a0 54 add %fp, 0x54, %o1
20089c4: 80 a2 20 00 cmp %o0, 0
20089c8: 12 bf ff f5 bne 200899c <_CORE_mutex_Seize+0xac> <== NEVER TAKEN
20089cc: 01 00 00 00 nop
20089d0: 81 c7 e0 08 ret
20089d4: 81 e8 00 00 restore
20089d8: 92 10 20 00 clr %o1
20089dc: 40 00 01 c1 call 20090e0 <_Internal_error_Occurred>
20089e0: 94 10 20 12 mov 0x12, %o2
02008b60 <_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
)
{
2008b60: 9d e3 bf a0 save %sp, -96, %sp
2008b64: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2008b68: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
2008b6c: 40 00 07 ed call 200ab20 <_Thread_queue_Dequeue>
2008b70: 90 10 00 1d mov %i5, %o0
2008b74: 80 a2 20 00 cmp %o0, 0
2008b78: 02 80 00 04 be 2008b88 <_CORE_semaphore_Surrender+0x28>
2008b7c: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
2008b80: 81 c7 e0 08 ret
2008b84: 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 );
2008b88: 7f ff e6 a1 call 200260c <sparc_disable_interrupts>
2008b8c: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
2008b90: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
2008b94: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
2008b98: 80 a0 40 02 cmp %g1, %g2
2008b9c: 1a 80 00 05 bcc 2008bb0 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
2008ba0: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
2008ba4: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2008ba8: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
2008bac: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
2008bb0: 7f ff e6 9b call 200261c <sparc_enable_interrupts>
2008bb4: 01 00 00 00 nop
}
return status;
}
2008bb8: 81 c7 e0 08 ret
2008bbc: 81 e8 00 00 restore
02008720 <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
2008720: 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;
2008724: 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 );
2008728: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200872c: 80 a6 a0 00 cmp %i2, 0
2008730: 02 80 00 13 be 200877c <_Chain_Initialize+0x5c> <== NEVER TAKEN
2008734: 92 06 bf ff add %i2, -1, %o1
2008738: 86 10 00 09 mov %o1, %g3
200873c: 82 10 00 19 mov %i1, %g1
2008740: 84 10 00 18 mov %i0, %g2
current->next = next;
2008744: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
2008748: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200874c: 86 00 ff ff add %g3, -1, %g3
2008750: 84 10 00 01 mov %g1, %g2
2008754: 80 a0 ff ff cmp %g3, -1
2008758: 12 bf ff fb bne 2008744 <_Chain_Initialize+0x24>
200875c: 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(
2008760: 40 00 42 61 call 20190e4 <.umul>
2008764: 90 10 00 1b mov %i3, %o0
2008768: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
200876c: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
2008770: d0 26 20 08 st %o0, [ %i0 + 8 ]
2008774: 81 c7 e0 08 ret
2008778: 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;
200877c: 10 bf ff fc b 200876c <_Chain_Initialize+0x4c> <== NOT EXECUTED
2008780: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED
020076cc <_Event_Surrender>:
rtems_event_set event_in,
Event_Control *event,
Thread_blocking_operation_States *sync_state,
States_Control wait_state
)
{
20076cc: 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 );
20076d0: 7f ff eb cf call 200260c <sparc_disable_interrupts>
20076d4: 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;
20076d8: c2 06 80 00 ld [ %i2 ], %g1
20076dc: b2 16 40 01 or %i1, %g1, %i1
20076e0: 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;
20076e4: 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 ) ) {
20076e8: 84 8e 40 01 andcc %i1, %g1, %g2
20076ec: 02 80 00 35 be 20077c0 <_Event_Surrender+0xf4>
20076f0: 07 00 80 7a sethi %hi(0x201e800), %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() &&
20076f4: 86 10 e0 40 or %g3, 0x40, %g3 ! 201e840 <_Per_CPU_Information>
20076f8: c8 00 e0 08 ld [ %g3 + 8 ], %g4
20076fc: 80 a1 20 00 cmp %g4, 0
2007700: 32 80 00 1c bne,a 2007770 <_Event_Surrender+0xa4>
2007704: 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);
2007708: 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 ) ) {
200770c: 80 8f 00 03 btst %i4, %g3
2007710: 02 80 00 2c be 20077c0 <_Event_Surrender+0xf4>
2007714: 80 a0 40 02 cmp %g1, %g2
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
2007718: 02 80 00 04 be 2007728 <_Event_Surrender+0x5c>
200771c: 80 8f 60 02 btst 2, %i5
2007720: 02 80 00 28 be 20077c0 <_Event_Surrender+0xf4> <== NEVER TAKEN
2007724: 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;
2007728: 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) );
200772c: 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(
2007730: f2 26 80 00 st %i1, [ %i2 ]
pending_events,
seized_events
);
the_thread->Wait.count = 0;
2007734: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2007738: c4 20 40 00 st %g2, [ %g1 ]
_ISR_Flash( level );
200773c: 7f ff eb b8 call 200261c <sparc_enable_interrupts>
2007740: 01 00 00 00 nop
2007744: 7f ff eb b2 call 200260c <sparc_disable_interrupts>
2007748: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
200774c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
2007750: 80 a0 60 02 cmp %g1, 2
2007754: 02 80 00 1d be 20077c8 <_Event_Surrender+0xfc>
2007758: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
200775c: 7f ff eb b0 call 200261c <sparc_enable_interrupts>
2007760: 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 );
2007764: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1007fff8 <RAM_END+0xdc7fff8>
2007768: 40 00 0a ff call 200a364 <_Thread_Clear_state>
200776c: 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() &&
2007770: 80 a6 00 03 cmp %i0, %g3
2007774: 32 bf ff e6 bne,a 200770c <_Event_Surrender+0x40>
2007778: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
_Thread_Is_executing( the_thread ) &&
((*sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
200777c: c6 06 c0 00 ld [ %i3 ], %g3
2007780: 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 ) &&
2007784: 80 a0 e0 01 cmp %g3, 1
2007788: 38 bf ff e1 bgu,a 200770c <_Event_Surrender+0x40>
200778c: 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) ) {
2007790: 80 a0 40 02 cmp %g1, %g2
2007794: 02 80 00 04 be 20077a4 <_Event_Surrender+0xd8>
2007798: 80 8f 60 02 btst 2, %i5
200779c: 02 80 00 09 be 20077c0 <_Event_Surrender+0xf4> <== NEVER TAKEN
20077a0: 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;
20077a4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
20077a8: 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(
20077ac: f2 26 80 00 st %i1, [ %i2 ]
pending_events,
seized_events
);
the_thread->Wait.count = 0;
20077b0: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
20077b4: c4 20 40 00 st %g2, [ %g1 ]
*sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
20077b8: 82 10 20 03 mov 3, %g1
20077bc: c2 26 c0 00 st %g1, [ %i3 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
20077c0: 7f ff eb 97 call 200261c <sparc_enable_interrupts>
20077c4: 91 e8 00 08 restore %g0, %o0, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
20077c8: 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 );
20077cc: 7f ff eb 94 call 200261c <sparc_enable_interrupts>
20077d0: 33 04 01 ff sethi %hi(0x1007fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
20077d4: 40 00 0f 9a call 200b63c <_Watchdog_Remove>
20077d8: 90 06 20 48 add %i0, 0x48, %o0
20077dc: b2 16 63 f8 or %i1, 0x3f8, %i1
20077e0: 40 00 0a e1 call 200a364 <_Thread_Clear_state>
20077e4: 81 e8 00 00 restore
020077e8 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *arg
)
{
20077e8: 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 );
20077ec: 90 10 00 18 mov %i0, %o0
20077f0: 40 00 0b ee call 200a7a8 <_Thread_Get>
20077f4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20077f8: c2 07 bf fc ld [ %fp + -4 ], %g1
20077fc: 80 a0 60 00 cmp %g1, 0
2007800: 12 80 00 15 bne 2007854 <_Event_Timeout+0x6c> <== NEVER TAKEN
2007804: 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 );
2007808: 7f ff eb 81 call 200260c <sparc_disable_interrupts>
200780c: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
2007810: 03 00 80 7a sethi %hi(0x201e800), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
2007814: c2 00 60 50 ld [ %g1 + 0x50 ], %g1 ! 201e850 <_Per_CPU_Information+0x10>
2007818: 80 a7 40 01 cmp %i5, %g1
200781c: 02 80 00 10 be 200785c <_Event_Timeout+0x74>
2007820: 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;
2007824: 82 10 20 06 mov 6, %g1
2007828: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
200782c: 7f ff eb 7c call 200261c <sparc_enable_interrupts>
2007830: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007834: 90 10 00 1d mov %i5, %o0
2007838: 13 04 01 ff sethi %hi(0x1007fc00), %o1
200783c: 40 00 0a ca call 200a364 <_Thread_Clear_state>
2007840: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1007fff8 <RAM_END+0xdc7fff8>
*
* 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;
2007844: 03 00 80 78 sethi %hi(0x201e000), %g1
2007848: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level>
--level;
200784c: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
2007850: c4 20 63 20 st %g2, [ %g1 + 0x320 ]
2007854: 81 c7 e0 08 ret
2007858: 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 )
200785c: c2 06 40 00 ld [ %i1 ], %g1
2007860: 80 a0 60 01 cmp %g1, 1
2007864: 12 bf ff f1 bne 2007828 <_Event_Timeout+0x40>
2007868: 82 10 20 06 mov 6, %g1
*sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
200786c: 82 10 20 02 mov 2, %g1
2007870: 10 bf ff ed b 2007824 <_Event_Timeout+0x3c>
2007874: c2 26 40 00 st %g1, [ %i1 ]
0200de88 <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200de88: 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
200de8c: a2 06 60 04 add %i1, 4, %l1
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200de90: 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 ) {
200de94: 80 a6 40 11 cmp %i1, %l1
200de98: 18 80 00 85 bgu 200e0ac <_Heap_Allocate_aligned_with_boundary+0x224>
200de9c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
200dea0: 80 a6 e0 00 cmp %i3, 0
200dea4: 12 80 00 7c bne 200e094 <_Heap_Allocate_aligned_with_boundary+0x20c>
200dea8: 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;
200deac: 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 ) {
200deb0: 80 a4 00 1d cmp %l0, %i5
200deb4: 02 80 00 18 be 200df14 <_Heap_Allocate_aligned_with_boundary+0x8c>
200deb8: 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;
200debc: 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
200dec0: ae 05 60 07 add %l5, 7, %l7
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200dec4: ac 25 80 19 sub %l6, %i1, %l6
200dec8: 10 80 00 0b b 200def4 <_Heap_Allocate_aligned_with_boundary+0x6c>
200decc: 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 ) {
200ded0: 12 80 00 18 bne 200df30 <_Heap_Allocate_aligned_with_boundary+0xa8>
200ded4: b0 07 60 08 add %i5, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200ded8: 80 a6 20 00 cmp %i0, 0
200dedc: 12 80 00 4d bne 200e010 <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN
200dee0: b8 07 20 01 inc %i4
break;
}
block = block->next;
200dee4: 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 ) {
200dee8: 80 a4 00 1d cmp %l0, %i5
200deec: 22 80 00 0b be,a 200df18 <_Heap_Allocate_aligned_with_boundary+0x90>
200def0: 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 ) {
200def4: c2 07 60 04 ld [ %i5 + 4 ], %g1
200def8: 80 a4 40 01 cmp %l1, %g1
200defc: 0a bf ff f5 bcs 200ded0 <_Heap_Allocate_aligned_with_boundary+0x48>
200df00: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
200df04: 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 ) {
200df08: 80 a4 00 1d cmp %l0, %i5
200df0c: 12 bf ff fa bne 200def4 <_Heap_Allocate_aligned_with_boundary+0x6c>
200df10: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200df14: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
200df18: 80 a0 40 1c cmp %g1, %i4
200df1c: 1a 80 00 03 bcc 200df28 <_Heap_Allocate_aligned_with_boundary+0xa0>
200df20: b0 10 20 00 clr %i0
stats->max_search = search_count;
200df24: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
}
return (void *) alloc_begin;
200df28: 81 c7 e0 08 ret
200df2c: 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;
200df30: 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;
200df34: 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;
200df38: 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;
200df3c: 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;
200df40: 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);
200df44: 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;
200df48: 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
200df4c: a4 00 80 12 add %g2, %l2, %l2
200df50: 40 00 2d 4b call 201947c <.urem>
200df54: 90 10 00 18 mov %i0, %o0
200df58: 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 ) {
200df5c: 80 a4 80 18 cmp %l2, %i0
200df60: 1a 80 00 06 bcc 200df78 <_Heap_Allocate_aligned_with_boundary+0xf0>
200df64: a6 07 60 08 add %i5, 8, %l3
200df68: 90 10 00 12 mov %l2, %o0
200df6c: 40 00 2d 44 call 201947c <.urem>
200df70: 92 10 00 1a mov %i2, %o1
200df74: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
200df78: 80 a6 e0 00 cmp %i3, 0
200df7c: 02 80 00 37 be 200e058 <_Heap_Allocate_aligned_with_boundary+0x1d0>
200df80: 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;
200df84: 86 06 00 19 add %i0, %i1, %g3
200df88: 92 10 00 1b mov %i3, %o1
200df8c: 90 10 00 03 mov %g3, %o0
200df90: 40 00 2d 3b call 201947c <.urem>
200df94: c6 27 bf f8 st %g3, [ %fp + -8 ]
200df98: c6 07 bf f8 ld [ %fp + -8 ], %g3
200df9c: 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 ) {
200dfa0: 80 a6 00 08 cmp %i0, %o0
200dfa4: 1a 80 00 2c bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200dfa8: a4 04 c0 19 add %l3, %i1, %l2
200dfac: 80 a2 00 03 cmp %o0, %g3
200dfb0: 2a 80 00 12 bcs,a 200dff8 <_Heap_Allocate_aligned_with_boundary+0x170>
200dfb4: 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 ) {
200dfb8: 10 80 00 28 b 200e058 <_Heap_Allocate_aligned_with_boundary+0x1d0>
200dfbc: 80 a4 c0 18 cmp %l3, %i0
200dfc0: 92 10 00 1a mov %i2, %o1
200dfc4: 40 00 2d 2e call 201947c <.urem>
200dfc8: 90 10 00 18 mov %i0, %o0
200dfcc: 92 10 00 1b mov %i3, %o1
200dfd0: 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;
200dfd4: ac 06 00 19 add %i0, %i1, %l6
200dfd8: 40 00 2d 29 call 201947c <.urem>
200dfdc: 90 10 00 16 mov %l6, %o0
200dfe0: 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 ) {
200dfe4: 80 a2 00 16 cmp %o0, %l6
200dfe8: 1a 80 00 1b bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200dfec: 80 a6 00 08 cmp %i0, %o0
200dff0: 1a 80 00 19 bcc 200e054 <_Heap_Allocate_aligned_with_boundary+0x1cc>
200dff4: 80 a4 80 08 cmp %l2, %o0
if ( boundary_line < boundary_floor ) {
200dff8: 08 bf ff f2 bleu 200dfc0 <_Heap_Allocate_aligned_with_boundary+0x138>
200dffc: b0 22 00 19 sub %o0, %i1, %i0
return 0;
200e000: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200e004: 80 a6 20 00 cmp %i0, 0
200e008: 02 bf ff b7 be 200dee4 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN
200e00c: 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;
200e010: c6 04 20 48 ld [ %l0 + 0x48 ], %g3
stats->searches += search_count;
200e014: 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;
200e018: 86 00 e0 01 inc %g3
stats->searches += search_count;
200e01c: 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;
200e020: c6 24 20 48 st %g3, [ %l0 + 0x48 ]
stats->searches += search_count;
200e024: c4 24 20 4c st %g2, [ %l0 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
200e028: 90 10 00 10 mov %l0, %o0
200e02c: 92 10 00 1d mov %i5, %o1
200e030: 94 10 00 18 mov %i0, %o2
200e034: 7f ff eb df call 2008fb0 <_Heap_Block_allocate>
200e038: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200e03c: c2 04 20 44 ld [ %l0 + 0x44 ], %g1
200e040: 80 a0 40 1c cmp %g1, %i4
200e044: 2a bf ff b9 bcs,a 200df28 <_Heap_Allocate_aligned_with_boundary+0xa0>
200e048: f8 24 20 44 st %i4, [ %l0 + 0x44 ]
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200e04c: 81 c7 e0 08 ret
200e050: 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 ) {
200e054: 80 a4 c0 18 cmp %l3, %i0
200e058: 18 bf ff ea bgu 200e000 <_Heap_Allocate_aligned_with_boundary+0x178>
200e05c: 82 10 3f f8 mov -8, %g1
200e060: 90 10 00 18 mov %i0, %o0
200e064: a4 20 40 1d sub %g1, %i5, %l2
200e068: 92 10 00 15 mov %l5, %o1
200e06c: 40 00 2d 04 call 201947c <.urem>
200e070: 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 ) {
200e074: 90 a4 80 08 subcc %l2, %o0, %o0
200e078: 02 bf ff 99 be 200dedc <_Heap_Allocate_aligned_with_boundary+0x54>
200e07c: 80 a6 20 00 cmp %i0, 0
200e080: 80 a2 00 14 cmp %o0, %l4
200e084: 1a bf ff 96 bcc 200dedc <_Heap_Allocate_aligned_with_boundary+0x54>
200e088: 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;
200e08c: 10 bf ff de b 200e004 <_Heap_Allocate_aligned_with_boundary+0x17c>
200e090: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
200e094: 18 80 00 06 bgu 200e0ac <_Heap_Allocate_aligned_with_boundary+0x224>
200e098: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
200e09c: 22 bf ff 84 be,a 200deac <_Heap_Allocate_aligned_with_boundary+0x24>
200e0a0: 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;
200e0a4: 10 bf ff 83 b 200deb0 <_Heap_Allocate_aligned_with_boundary+0x28>
200e0a8: 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;
200e0ac: 81 c7 e0 08 ret
200e0b0: 91 e8 20 00 restore %g0, 0, %o0
0200e0c0 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t unused __attribute__((unused))
)
{
200e0c0: 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;
200e0c4: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200e0c8: 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))
)
{
200e0cc: b8 10 00 18 mov %i0, %i4
Heap_Statistics *const stats = &heap->stats;
Heap_Block *const first_block = heap->first_block;
200e0d0: 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;
200e0d4: 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;
200e0d8: e4 06 20 10 ld [ %i0 + 0x10 ], %l2
uintptr_t const min_block_size = heap->min_block_size;
200e0dc: 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 ) {
200e0e0: 80 a6 40 10 cmp %i1, %l0
200e0e4: 08 80 00 04 bleu 200e0f4 <_Heap_Extend+0x34>
200e0e8: f0 06 20 30 ld [ %i0 + 0x30 ], %i0
return 0;
200e0ec: 81 c7 e0 08 ret
200e0f0: 91 e8 20 00 restore %g0, 0, %o0
}
extend_area_ok = _Heap_Get_first_and_last_block(
200e0f4: 90 10 00 19 mov %i1, %o0
200e0f8: 92 10 00 1a mov %i2, %o1
200e0fc: 94 10 00 12 mov %l2, %o2
200e100: 98 07 bf f8 add %fp, -8, %o4
200e104: 7f ff eb 40 call 2008e04 <_Heap_Get_first_and_last_block>
200e108: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200e10c: 80 8a 20 ff btst 0xff, %o0
200e110: 02 bf ff f7 be 200e0ec <_Heap_Extend+0x2c>
200e114: ba 10 00 11 mov %l1, %i5
200e118: aa 10 20 00 clr %l5
200e11c: ac 10 20 00 clr %l6
200e120: a6 10 20 00 clr %l3
200e124: 10 80 00 10 b 200e164 <_Heap_Extend+0xa4>
200e128: 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 ) {
200e12c: 2a 80 00 02 bcs,a 200e134 <_Heap_Extend+0x74>
200e130: ac 10 00 1d mov %i5, %l6
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200e134: 80 a6 c0 19 cmp %i3, %i1
200e138: 22 80 00 1e be,a 200e1b0 <_Heap_Extend+0xf0>
200e13c: 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 ) {
200e140: 80 a6 40 1b cmp %i1, %i3
200e144: 38 80 00 02 bgu,a 200e14c <_Heap_Extend+0x8c>
200e148: 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;
200e14c: fa 02 20 04 ld [ %o0 + 4 ], %i5
200e150: 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);
200e154: 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 );
200e158: 80 a4 40 1d cmp %l1, %i5
200e15c: 22 80 00 1c be,a 200e1cc <_Heap_Extend+0x10c>
200e160: 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;
200e164: 80 a7 40 11 cmp %i5, %l1
200e168: 22 80 00 03 be,a 200e174 <_Heap_Extend+0xb4>
200e16c: f4 07 20 18 ld [ %i4 + 0x18 ], %i2
200e170: b4 10 00 1d mov %i5, %i2
uintptr_t const sub_area_end = start_block->prev_size;
200e174: 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);
200e178: 92 10 00 12 mov %l2, %o1
200e17c: 40 00 2d 79 call 2019760 <.urem>
200e180: 90 10 00 1b mov %i3, %o0
200e184: 82 06 ff f8 add %i3, -8, %g1
Heap_Block *const end_block =
_Heap_Block_of_alloc_area( sub_area_end, page_size );
if (
200e188: 80 a6 80 10 cmp %i2, %l0
200e18c: 0a 80 00 64 bcs 200e31c <_Heap_Extend+0x25c>
200e190: 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 ) {
200e194: 80 a6 80 10 cmp %i2, %l0
200e198: 12 bf ff e5 bne 200e12c <_Heap_Extend+0x6c>
200e19c: 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 ) {
200e1a0: 80 a6 c0 19 cmp %i3, %i1
200e1a4: 12 bf ff e7 bne 200e140 <_Heap_Extend+0x80> <== ALWAYS TAKEN
200e1a8: a8 10 00 1d mov %i5, %l4
start_block->prev_size = extend_area_end;
200e1ac: 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;
200e1b0: fa 02 20 04 ld [ %o0 + 4 ], %i5
200e1b4: 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);
200e1b8: 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 );
200e1bc: 80 a4 40 1d cmp %l1, %i5
200e1c0: 12 bf ff e9 bne 200e164 <_Heap_Extend+0xa4> <== NEVER TAKEN
200e1c4: a6 10 00 08 mov %o0, %l3
if ( extend_area_begin < heap->area_begin ) {
200e1c8: c2 07 20 18 ld [ %i4 + 0x18 ], %g1
200e1cc: 80 a6 40 01 cmp %i1, %g1
200e1d0: 3a 80 00 4e bcc,a 200e308 <_Heap_Extend+0x248>
200e1d4: c2 07 20 1c ld [ %i4 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200e1d8: 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;
200e1dc: c2 07 bf f8 ld [ %fp + -8 ], %g1
200e1e0: 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 ) {
200e1e4: 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 =
200e1e8: 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;
200e1ec: e0 20 40 00 st %l0, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200e1f0: 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 =
200e1f4: 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;
200e1f8: 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 ) {
200e1fc: 80 a1 00 01 cmp %g4, %g1
200e200: 08 80 00 3c bleu 200e2f0 <_Heap_Extend+0x230>
200e204: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
200e208: 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 ) {
200e20c: 80 a5 20 00 cmp %l4, 0
200e210: 02 80 00 47 be 200e32c <_Heap_Extend+0x26c>
200e214: 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;
200e218: 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;
200e21c: 92 10 00 1d mov %i5, %o1
200e220: 40 00 2d 50 call 2019760 <.urem>
200e224: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200e228: 80 a2 20 00 cmp %o0, 0
200e22c: 02 80 00 04 be 200e23c <_Heap_Extend+0x17c>
200e230: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
200e234: b2 06 40 1d add %i1, %i5, %i1
200e238: 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 =
200e23c: 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;
200e240: 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 =
200e244: 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;
200e248: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
200e24c: 90 10 00 1c mov %i4, %o0
200e250: 92 10 00 01 mov %g1, %o1
200e254: 7f ff ff 85 call 200e068 <_Heap_Free_block>
200e258: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200e25c: 80 a4 e0 00 cmp %l3, 0
200e260: 02 80 00 3a be 200e348 <_Heap_Extend+0x288>
200e264: 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);
200e268: 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(
200e26c: a0 24 00 13 sub %l0, %l3, %l0
200e270: 40 00 2d 3c call 2019760 <.urem>
200e274: 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)
200e278: c2 04 e0 04 ld [ %l3 + 4 ], %g1
200e27c: a0 24 00 08 sub %l0, %o0, %l0
200e280: 82 20 40 10 sub %g1, %l0, %g1
| HEAP_PREV_BLOCK_USED;
200e284: 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 =
200e288: 84 04 00 13 add %l0, %l3, %g2
200e28c: 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;
200e290: 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 );
200e294: 90 10 00 1c mov %i4, %o0
200e298: 82 08 60 01 and %g1, 1, %g1
200e29c: 92 10 00 13 mov %l3, %o1
block->size_and_flag = size | flag;
200e2a0: a0 14 00 01 or %l0, %g1, %l0
200e2a4: 7f ff ff 71 call 200e068 <_Heap_Free_block>
200e2a8: e0 24 e0 04 st %l0, [ %l3 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200e2ac: 80 a4 e0 00 cmp %l3, 0
200e2b0: 02 80 00 33 be 200e37c <_Heap_Extend+0x2bc>
200e2b4: 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
200e2b8: 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(
200e2bc: 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;
200e2c0: 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;
200e2c4: 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;
200e2c8: 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(
200e2cc: 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;
200e2d0: 88 09 20 01 and %g4, 1, %g4
block->size_and_flag = size | flag;
200e2d4: 88 17 40 04 or %i5, %g4, %g4
200e2d8: c8 20 60 04 st %g4, [ %g1 + 4 ]
200e2dc: b0 20 c0 18 sub %g3, %i0, %i0
/* Statistics */
stats->size += extended_size;
200e2e0: 82 00 80 18 add %g2, %i0, %g1
200e2e4: c2 27 20 2c st %g1, [ %i4 + 0x2c ]
return extended_size;
}
200e2e8: 81 c7 e0 08 ret
200e2ec: 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 ) {
200e2f0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
200e2f4: 80 a0 40 02 cmp %g1, %g2
200e2f8: 2a bf ff c5 bcs,a 200e20c <_Heap_Extend+0x14c>
200e2fc: c4 27 20 24 st %g2, [ %i4 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200e300: 10 bf ff c4 b 200e210 <_Heap_Extend+0x150>
200e304: 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 ) {
200e308: 80 a4 00 01 cmp %l0, %g1
200e30c: 38 bf ff b4 bgu,a 200e1dc <_Heap_Extend+0x11c>
200e310: 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;
200e314: 10 bf ff b3 b 200e1e0 <_Heap_Extend+0x120>
200e318: 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 (
200e31c: 80 a6 40 1b cmp %i1, %i3
200e320: 1a bf ff 9e bcc 200e198 <_Heap_Extend+0xd8>
200e324: 80 a6 80 10 cmp %i2, %l0
200e328: 30 bf ff 71 b,a 200e0ec <_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 ) {
200e32c: 80 a5 a0 00 cmp %l6, 0
200e330: 02 bf ff cc be 200e260 <_Heap_Extend+0x1a0>
200e334: 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;
200e338: ac 25 80 02 sub %l6, %g2, %l6
200e33c: 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 =
200e340: 10 bf ff c8 b 200e260 <_Heap_Extend+0x1a0>
200e344: 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 ) {
200e348: 80 a5 60 00 cmp %l5, 0
200e34c: 02 bf ff d8 be 200e2ac <_Heap_Extend+0x1ec>
200e350: 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;
200e354: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200e358: c2 07 bf fc ld [ %fp + -4 ], %g1
200e35c: 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 );
200e360: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200e364: 84 10 80 03 or %g2, %g3, %g2
200e368: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200e36c: c4 00 60 04 ld [ %g1 + 4 ], %g2
200e370: 84 10 a0 01 or %g2, 1, %g2
200e374: 10 bf ff ce b 200e2ac <_Heap_Extend+0x1ec>
200e378: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200e37c: 32 bf ff d0 bne,a 200e2bc <_Heap_Extend+0x1fc>
200e380: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200e384: d2 07 bf f8 ld [ %fp + -8 ], %o1
200e388: 7f ff ff 38 call 200e068 <_Heap_Free_block>
200e38c: 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
200e390: 10 bf ff cb b 200e2bc <_Heap_Extend+0x1fc>
200e394: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
0200e0b4 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200e0b4: 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 ) {
200e0b8: 80 a6 60 00 cmp %i1, 0
200e0bc: 02 80 00 3c be 200e1ac <_Heap_Free+0xf8>
200e0c0: 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);
200e0c4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200e0c8: 40 00 2c ed call 201947c <.urem>
200e0cc: 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
200e0d0: 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);
200e0d4: 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);
200e0d8: 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;
200e0dc: 80 a2 00 02 cmp %o0, %g2
200e0e0: 0a 80 00 30 bcs 200e1a0 <_Heap_Free+0xec>
200e0e4: 82 10 20 00 clr %g1
200e0e8: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
200e0ec: 80 a2 00 04 cmp %o0, %g4
200e0f0: 38 80 00 2d bgu,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN
200e0f4: 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;
200e0f8: f6 02 20 04 ld [ %o0 + 4 ], %i3
200e0fc: 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);
200e100: 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;
200e104: 80 a0 80 03 cmp %g2, %g3
200e108: 38 80 00 27 bgu,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN
200e10c: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED
200e110: 80 a1 00 03 cmp %g4, %g3
200e114: 2a 80 00 24 bcs,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN
200e118: 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;
200e11c: f8 00 e0 04 ld [ %g3 + 4 ], %i4
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200e120: 80 8f 20 01 btst 1, %i4
200e124: 02 80 00 1f be 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN
200e128: 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 ));
200e12c: 02 80 00 23 be 200e1b8 <_Heap_Free+0x104>
200e130: b8 0f 3f fe and %i4, -2, %i4
200e134: 82 00 c0 1c add %g3, %i4, %g1
200e138: c2 00 60 04 ld [ %g1 + 4 ], %g1
200e13c: 80 88 60 01 btst 1, %g1
200e140: 12 80 00 1f bne 200e1bc <_Heap_Free+0x108>
200e144: 80 8e e0 01 btst 1, %i3
if ( !_Heap_Is_prev_used( block ) ) {
200e148: 02 80 00 20 be 200e1c8 <_Heap_Free+0x114>
200e14c: 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;
200e150: c4 00 e0 08 ld [ %g3 + 8 ], %g2
Heap_Block *prev = old_block->prev;
200e154: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
new_block->next = next;
200e158: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = prev;
200e15c: 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;
200e160: b8 07 00 1d add %i4, %i5, %i4
next->prev = new_block;
200e164: d0 20 a0 0c st %o0, [ %g2 + 0xc ]
prev->next = new_block;
200e168: d0 20 60 08 st %o0, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200e16c: 84 17 20 01 or %i4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200e170: 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;
200e174: c4 22 20 04 st %g2, [ %o0 + 4 ]
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200e178: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200e17c: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
stats->free_size += block_size;
200e180: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200e184: 82 00 60 01 inc %g1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200e188: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
stats->free_size += block_size;
200e18c: ba 00 c0 1d add %g3, %i5, %i5
}
}
/* Statistics */
--stats->used_blocks;
++stats->frees;
200e190: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200e194: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
stats->free_size += block_size;
200e198: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
return( true );
200e19c: 82 10 20 01 mov 1, %g1
200e1a0: b0 08 60 ff and %g1, 0xff, %i0
200e1a4: 81 c7 e0 08 ret
200e1a8: 81 e8 00 00 restore
200e1ac: b0 08 60 ff and %g1, 0xff, %i0
200e1b0: 81 c7 e0 08 ret
200e1b4: 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 ) ) {
200e1b8: 80 8e e0 01 btst 1, %i3
200e1bc: 32 80 00 1e bne,a 200e234 <_Heap_Free+0x180>
200e1c0: 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
200e1c4: 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;
200e1c8: 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);
200e1cc: 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;
200e1d0: 80 a0 80 1b cmp %g2, %i3
200e1d4: 18 bf ff f3 bgu 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN
200e1d8: 82 10 20 00 clr %g1
200e1dc: 80 a1 00 1b cmp %g4, %i3
200e1e0: 2a bf ff f1 bcs,a 200e1a4 <_Heap_Free+0xf0> <== NEVER TAKEN
200e1e4: 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;
200e1e8: 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) ) {
200e1ec: 80 88 a0 01 btst 1, %g2
200e1f0: 02 bf ff ec be 200e1a0 <_Heap_Free+0xec> <== NEVER TAKEN
200e1f4: 80 8e 60 ff btst 0xff, %i1
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200e1f8: 22 80 00 21 be,a 200e27c <_Heap_Free+0x1c8>
200e1fc: 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;
200e200: c2 00 e0 08 ld [ %g3 + 8 ], %g1
Heap_Block *prev = block->prev;
200e204: 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;
200e208: c6 06 20 38 ld [ %i0 + 0x38 ], %g3
prev->next = next;
200e20c: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
200e210: c4 20 60 0c st %g2, [ %g1 + 0xc ]
200e214: 82 00 ff ff add %g3, -1, %g1
200e218: 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;
200e21c: b8 07 40 1c add %i5, %i4, %i4
200e220: 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;
200e224: 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;
200e228: 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;
200e22c: 10 bf ff d3 b 200e178 <_Heap_Free+0xc4>
200e230: 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;
200e234: 82 17 60 01 or %i5, 1, %g1
200e238: c2 22 20 04 st %g1, [ %o0 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200e23c: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200e240: f0 22 20 0c st %i0, [ %o0 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200e244: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200e248: c4 22 20 08 st %g2, [ %o0 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200e24c: 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;
200e250: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
200e254: 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;
200e258: 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 ) {
200e25c: 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;
200e260: 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;
200e264: d0 26 20 08 st %o0, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200e268: 80 a0 40 02 cmp %g1, %g2
200e26c: 08 bf ff c3 bleu 200e178 <_Heap_Free+0xc4>
200e270: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200e274: 10 bf ff c1 b 200e178 <_Heap_Free+0xc4>
200e278: 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;
200e27c: 82 16 a0 01 or %i2, 1, %g1
200e280: c2 26 e0 04 st %g1, [ %i3 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200e284: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
200e288: 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;
200e28c: 82 08 7f fe and %g1, -2, %g1
200e290: 10 bf ff ba b 200e178 <_Heap_Free+0xc4>
200e294: c2 20 e0 04 st %g1, [ %g3 + 4 ]
02012ee4 <_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;
2012ee4: 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;
2012ee8: c0 22 40 00 clr [ %o1 ]
info->largest = 0;
2012eec: c0 22 60 04 clr [ %o1 + 4 ]
info->total = 0;
2012ef0: c0 22 60 08 clr [ %o1 + 8 ]
for(the_block = _Heap_Free_list_first(the_heap);
2012ef4: 88 10 20 01 mov 1, %g4
2012ef8: 9a 10 20 00 clr %o5
2012efc: 80 a2 00 01 cmp %o0, %g1
2012f00: 12 80 00 04 bne 2012f10 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN
2012f04: 86 10 20 00 clr %g3
2012f08: 30 80 00 10 b,a 2012f48 <_Heap_Get_free_information+0x64><== NOT EXECUTED
2012f0c: 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;
2012f10: c4 00 60 04 ld [ %g1 + 4 ], %g2
2012f14: 98 01 20 01 add %g4, 1, %o4
2012f18: 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 )
2012f1c: 80 a0 80 0d cmp %g2, %o5
2012f20: 08 80 00 03 bleu 2012f2c <_Heap_Get_free_information+0x48>
2012f24: 86 00 c0 02 add %g3, %g2, %g3
info->largest = the_size;
2012f28: 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)
2012f2c: 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);
2012f30: 80 a2 00 01 cmp %o0, %g1
2012f34: 32 bf ff f6 bne,a 2012f0c <_Heap_Get_free_information+0x28>
2012f38: da 02 60 04 ld [ %o1 + 4 ], %o5
2012f3c: c8 22 40 00 st %g4, [ %o1 ]
2012f40: 81 c3 e0 08 retl
2012f44: c6 22 60 08 st %g3, [ %o1 + 8 ]
2012f48: 81 c3 e0 08 retl <== NOT EXECUTED
0200ad34 <_Heap_Greedy_allocate>:
Heap_Block *_Heap_Greedy_allocate(
Heap_Control *heap,
const uintptr_t *block_sizes,
size_t block_count
)
{
200ad34: 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) {
200ad38: 80 a6 a0 00 cmp %i2, 0
200ad3c: 02 80 00 35 be 200ae10 <_Heap_Greedy_allocate+0xdc>
200ad40: b8 10 00 18 mov %i0, %i4
200ad44: ba 10 20 00 clr %i5
200ad48: b6 10 20 00 clr %i3
#include "config.h"
#endif
#include <rtems/score/heap.h>
Heap_Block *_Heap_Greedy_allocate(
200ad4c: 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 );
200ad50: d2 06 40 01 ld [ %i1 + %g1 ], %o1
200ad54: 94 10 20 00 clr %o2
200ad58: 96 10 20 00 clr %o3
200ad5c: 40 00 1f d6 call 2012cb4 <_Heap_Allocate_aligned_with_boundary>
200ad60: 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 ) {
200ad64: 82 92 20 00 orcc %o0, 0, %g1
200ad68: 22 80 00 09 be,a 200ad8c <_Heap_Greedy_allocate+0x58> <== NEVER TAKEN
200ad6c: 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);
200ad70: d2 07 20 10 ld [ %i4 + 0x10 ], %o1
200ad74: 40 00 4d 42 call 201e27c <.urem>
200ad78: 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);
200ad7c: 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;
200ad80: f6 22 20 08 st %i3, [ %o0 + 8 ]
200ad84: 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) {
200ad88: ba 07 60 01 inc %i5
200ad8c: 80 a7 40 1a cmp %i5, %i2
200ad90: 12 bf ff f0 bne 200ad50 <_Heap_Greedy_allocate+0x1c>
200ad94: 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;
200ad98: 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 ) {
200ad9c: 80 a7 00 1d cmp %i4, %i5
200ada0: 02 80 00 17 be 200adfc <_Heap_Greedy_allocate+0xc8> <== NEVER TAKEN
200ada4: b0 10 20 00 clr %i0
200ada8: 10 80 00 03 b 200adb4 <_Heap_Greedy_allocate+0x80>
200adac: b4 10 20 00 clr %i2
200adb0: 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;
200adb4: d6 07 60 04 ld [ %i5 + 4 ], %o3
_Heap_Block_allocate(
200adb8: 92 10 00 1d mov %i5, %o1
200adbc: 96 0a ff fe and %o3, -2, %o3
200adc0: 94 07 60 08 add %i5, 8, %o2
200adc4: 90 10 00 1c mov %i4, %o0
200adc8: 40 00 00 e0 call 200b148 <_Heap_Block_allocate>
200adcc: 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;
200add0: 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;
200add4: 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 ) {
200add8: 80 a7 00 01 cmp %i4, %g1
200addc: 12 bf ff f5 bne 200adb0 <_Heap_Greedy_allocate+0x7c>
200ade0: b4 10 00 1d mov %i5, %i2
200ade4: 10 80 00 06 b 200adfc <_Heap_Greedy_allocate+0xc8>
200ade8: 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 ) );
200adec: 92 06 e0 08 add %i3, 8, %o1
200adf0: 90 10 00 1c mov %i4, %o0
200adf4: 40 00 20 3b call 2012ee0 <_Heap_Free>
200adf8: b6 10 00 1a mov %i2, %i3
current->next = blocks;
blocks = current;
}
while ( allocated_blocks != NULL ) {
200adfc: 80 a6 e0 00 cmp %i3, 0
200ae00: 32 bf ff fb bne,a 200adec <_Heap_Greedy_allocate+0xb8>
200ae04: 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;
}
200ae08: 81 c7 e0 08 ret
200ae0c: 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;
200ae10: 10 bf ff e2 b 200ad98 <_Heap_Greedy_allocate+0x64>
200ae14: b6 10 20 00 clr %i3
0200ae18 <_Heap_Greedy_free>:
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
200ae18: 9d e3 bf a0 save %sp, -96, %sp
while ( blocks != NULL ) {
200ae1c: 80 a6 60 00 cmp %i1, 0
200ae20: 02 80 00 09 be 200ae44 <_Heap_Greedy_free+0x2c> <== NEVER TAKEN
200ae24: 01 00 00 00 nop
Heap_Block *current = blocks;
blocks = blocks->next;
200ae28: fa 06 60 08 ld [ %i1 + 8 ], %i5
_Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) );
200ae2c: 92 06 60 08 add %i1, 8, %o1
200ae30: 40 00 20 2c call 2012ee0 <_Heap_Free>
200ae34: 90 10 00 18 mov %i0, %o0
void _Heap_Greedy_free(
Heap_Control *heap,
Heap_Block *blocks
)
{
while ( blocks != NULL ) {
200ae38: b2 97 60 00 orcc %i5, 0, %i1
200ae3c: 32 bf ff fc bne,a 200ae2c <_Heap_Greedy_free+0x14>
200ae40: fa 06 60 08 ld [ %i1 + 8 ], %i5
200ae44: 81 c7 e0 08 ret
200ae48: 81 e8 00 00 restore
02012fb0 <_Heap_Iterate>:
void _Heap_Iterate(
Heap_Control *heap,
Heap_Block_visitor visitor,
void *visitor_arg
)
{
2012fb0: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *current = heap->first_block;
2012fb4: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
Heap_Block *end = heap->last_block;
2012fb8: f8 06 20 24 ld [ %i0 + 0x24 ], %i4
bool stop = false;
while ( !stop && current != end ) {
2012fbc: 80 a0 40 1c cmp %g1, %i4
2012fc0: 32 80 00 08 bne,a 2012fe0 <_Heap_Iterate+0x30> <== ALWAYS TAKEN
2012fc4: d2 00 60 04 ld [ %g1 + 4 ], %o1
2012fc8: 30 80 00 10 b,a 2013008 <_Heap_Iterate+0x58> <== NOT EXECUTED
2012fcc: 90 1a 20 01 xor %o0, 1, %o0
2012fd0: 80 8a 20 ff btst 0xff, %o0
2012fd4: 02 80 00 0d be 2013008 <_Heap_Iterate+0x58> <== NEVER TAKEN
2012fd8: 01 00 00 00 nop
2012fdc: d2 00 60 04 ld [ %g1 + 4 ], %o1
uintptr_t size = _Heap_Block_size( current );
Heap_Block *next = _Heap_Block_at( current, size );
bool used = _Heap_Is_prev_used( next );
stop = (*visitor)( current, size, used, visitor_arg );
2012fe0: 90 10 00 01 mov %g1, %o0
2012fe4: 92 0a 7f fe and %o1, -2, %o1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
2012fe8: ba 00 40 09 add %g1, %o1, %i5
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
2012fec: d4 07 60 04 ld [ %i5 + 4 ], %o2
2012ff0: 96 10 00 1a mov %i2, %o3
2012ff4: 9f c6 40 00 call %i1
2012ff8: 94 0a a0 01 and %o2, 1, %o2
{
Heap_Block *current = heap->first_block;
Heap_Block *end = heap->last_block;
bool stop = false;
while ( !stop && current != end ) {
2012ffc: 80 a7 00 1d cmp %i4, %i5
2013000: 12 bf ff f3 bne 2012fcc <_Heap_Iterate+0x1c>
2013004: 82 10 00 1d mov %i5, %g1
2013008: 81 c7 e0 08 ret
201300c: 81 e8 00 00 restore
0200e3c0 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
200e3c0: 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);
200e3c4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200e3c8: 40 00 2c 2d call 201947c <.urem>
200e3cc: 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
200e3d0: 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);
200e3d4: 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);
200e3d8: 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;
200e3dc: 80 a2 00 01 cmp %o0, %g1
200e3e0: 0a 80 00 16 bcs 200e438 <_Heap_Size_of_alloc_area+0x78>
200e3e4: 84 10 20 00 clr %g2
200e3e8: c6 06 20 24 ld [ %i0 + 0x24 ], %g3
200e3ec: 80 a2 00 03 cmp %o0, %g3
200e3f0: 18 80 00 13 bgu 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200e3f4: 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;
200e3f8: c8 02 20 04 ld [ %o0 + 4 ], %g4
200e3fc: 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);
200e400: 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;
200e404: 80 a0 40 08 cmp %g1, %o0
200e408: 18 80 00 0d bgu 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200e40c: 01 00 00 00 nop
200e410: 80 a0 c0 08 cmp %g3, %o0
200e414: 0a 80 00 0a bcs 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200e418: 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;
200e41c: 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 )
200e420: 80 88 60 01 btst 1, %g1
200e424: 02 80 00 06 be 200e43c <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
200e428: 90 22 00 19 sub %o0, %i1, %o0
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
200e42c: 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;
200e430: 90 02 20 04 add %o0, 4, %o0
200e434: d0 26 80 00 st %o0, [ %i2 ]
200e438: b0 08 a0 ff and %g2, 0xff, %i0
200e43c: 81 c7 e0 08 ret
200e440: 81 e8 00 00 restore
02009d80 <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
2009d80: 9d e3 bf 80 save %sp, -128, %sp
uintptr_t const page_size = heap->page_size;
2009d84: f6 06 20 10 ld [ %i0 + 0x10 ], %i3
uintptr_t const min_block_size = heap->min_block_size;
2009d88: e0 06 20 14 ld [ %i0 + 0x14 ], %l0
Heap_Block *const first_block = heap->first_block;
2009d8c: 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;
2009d90: 80 a6 a0 00 cmp %i2, 0
2009d94: 02 80 00 0c be 2009dc4 <_Heap_Walk+0x44>
2009d98: e2 06 20 24 ld [ %i0 + 0x24 ], %l1
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2009d9c: 03 00 80 83 sethi %hi(0x2020c00), %g1
2009da0: c4 00 61 58 ld [ %g1 + 0x158 ], %g2 ! 2020d58 <_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;
2009da4: 07 00 80 27 sethi %hi(0x2009c00), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
2009da8: 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() ) ) {
2009dac: 80 a0 a0 03 cmp %g2, 3
2009db0: 02 80 00 0c be 2009de0 <_Heap_Walk+0x60> <== ALWAYS TAKEN
2009db4: ae 10 e1 1c or %g3, 0x11c, %l7
2009db8: b0 08 60 ff and %g1, 0xff, %i0
2009dbc: 81 c7 e0 08 ret
2009dc0: 81 e8 00 00 restore
2009dc4: 03 00 80 83 sethi %hi(0x2020c00), %g1
2009dc8: c4 00 61 58 ld [ %g1 + 0x158 ], %g2 ! 2020d58 <_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;
2009dcc: 07 00 80 27 sethi %hi(0x2009c00), %g3
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
2009dd0: 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() ) ) {
2009dd4: 80 a0 a0 03 cmp %g2, 3
2009dd8: 12 bf ff f8 bne 2009db8 <_Heap_Walk+0x38>
2009ddc: ae 10 e1 14 or %g3, 0x114, %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)(
2009de0: da 06 20 18 ld [ %i0 + 0x18 ], %o5
2009de4: c8 06 20 1c ld [ %i0 + 0x1c ], %g4
2009de8: c4 06 20 08 ld [ %i0 + 8 ], %g2
2009dec: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2009df0: 90 10 00 19 mov %i1, %o0
2009df4: c8 23 a0 5c st %g4, [ %sp + 0x5c ]
2009df8: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
2009dfc: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
2009e00: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
2009e04: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2009e08: 92 10 20 00 clr %o1
2009e0c: 96 10 00 1b mov %i3, %o3
2009e10: 15 00 80 74 sethi %hi(0x201d000), %o2
2009e14: 98 10 00 10 mov %l0, %o4
2009e18: 9f c5 c0 00 call %l7
2009e1c: 94 12 a3 a0 or %o2, 0x3a0, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
2009e20: 80 a6 e0 00 cmp %i3, 0
2009e24: 02 80 00 2a be 2009ecc <_Heap_Walk+0x14c>
2009e28: 80 8e e0 07 btst 7, %i3
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
2009e2c: 12 80 00 2f bne 2009ee8 <_Heap_Walk+0x168>
2009e30: 90 10 00 10 mov %l0, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2009e34: 7f ff df 4f call 2001b70 <.urem>
2009e38: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
2009e3c: 80 a2 20 00 cmp %o0, 0
2009e40: 12 80 00 32 bne 2009f08 <_Heap_Walk+0x188>
2009e44: 90 07 20 08 add %i4, 8, %o0
2009e48: 7f ff df 4a call 2001b70 <.urem>
2009e4c: 92 10 00 1b mov %i3, %o1
);
return false;
}
if (
2009e50: 80 a2 20 00 cmp %o0, 0
2009e54: 32 80 00 35 bne,a 2009f28 <_Heap_Walk+0x1a8>
2009e58: 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;
2009e5c: ec 07 20 04 ld [ %i4 + 4 ], %l6
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2009e60: b4 8d a0 01 andcc %l6, 1, %i2
2009e64: 22 80 00 38 be,a 2009f44 <_Heap_Walk+0x1c4>
2009e68: 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;
2009e6c: c2 04 60 04 ld [ %l1 + 4 ], %g1
2009e70: 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);
2009e74: 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;
2009e78: fa 00 60 04 ld [ %g1 + 4 ], %i5
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
2009e7c: 80 8f 60 01 btst 1, %i5
2009e80: 02 80 00 0c be 2009eb0 <_Heap_Walk+0x130>
2009e84: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
2009e88: 02 80 00 35 be 2009f5c <_Heap_Walk+0x1dc>
2009e8c: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
2009e90: 92 10 20 01 mov 1, %o1
2009e94: 15 00 80 75 sethi %hi(0x201d400), %o2
2009e98: 9f c5 c0 00 call %l7
2009e9c: 94 12 a1 18 or %o2, 0x118, %o2 ! 201d518 <__log2table+0x2d8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009ea0: 82 10 20 00 clr %g1
2009ea4: b0 08 60 ff and %g1, 0xff, %i0
2009ea8: 81 c7 e0 08 ret
2009eac: 81 e8 00 00 restore
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
2009eb0: 90 10 00 19 mov %i1, %o0
2009eb4: 92 10 20 01 mov 1, %o1
2009eb8: 15 00 80 75 sethi %hi(0x201d400), %o2
2009ebc: 9f c5 c0 00 call %l7
2009ec0: 94 12 a1 00 or %o2, 0x100, %o2 ! 201d500 <__log2table+0x2c0>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009ec4: 10 bf ff f8 b 2009ea4 <_Heap_Walk+0x124>
2009ec8: 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" );
2009ecc: 90 10 00 19 mov %i1, %o0
2009ed0: 92 10 20 01 mov 1, %o1
2009ed4: 15 00 80 75 sethi %hi(0x201d400), %o2
2009ed8: 9f c5 c0 00 call %l7
2009edc: 94 12 a0 38 or %o2, 0x38, %o2 ! 201d438 <__log2table+0x1f8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009ee0: 10 bf ff f1 b 2009ea4 <_Heap_Walk+0x124>
2009ee4: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
2009ee8: 90 10 00 19 mov %i1, %o0
2009eec: 92 10 20 01 mov 1, %o1
2009ef0: 15 00 80 75 sethi %hi(0x201d400), %o2
2009ef4: 96 10 00 1b mov %i3, %o3
2009ef8: 9f c5 c0 00 call %l7
2009efc: 94 12 a0 50 or %o2, 0x50, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009f00: 10 bf ff e9 b 2009ea4 <_Heap_Walk+0x124>
2009f04: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
2009f08: 90 10 00 19 mov %i1, %o0
2009f0c: 92 10 20 01 mov 1, %o1
2009f10: 15 00 80 75 sethi %hi(0x201d400), %o2
2009f14: 96 10 00 10 mov %l0, %o3
2009f18: 9f c5 c0 00 call %l7
2009f1c: 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;
2009f20: 10 bf ff e1 b 2009ea4 <_Heap_Walk+0x124>
2009f24: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
2009f28: 92 10 20 01 mov 1, %o1
2009f2c: 15 00 80 75 sethi %hi(0x201d400), %o2
2009f30: 96 10 00 1c mov %i4, %o3
2009f34: 9f c5 c0 00 call %l7
2009f38: 94 12 a0 98 or %o2, 0x98, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009f3c: 10 bf ff da b 2009ea4 <_Heap_Walk+0x124>
2009f40: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
2009f44: 92 10 20 01 mov 1, %o1
2009f48: 15 00 80 75 sethi %hi(0x201d400), %o2
2009f4c: 9f c5 c0 00 call %l7
2009f50: 94 12 a0 d0 or %o2, 0xd0, %o2 ! 201d4d0 <__log2table+0x290>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009f54: 10 bf ff d4 b 2009ea4 <_Heap_Walk+0x124>
2009f58: 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;
2009f5c: 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;
2009f60: 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 ) {
2009f64: 80 a6 00 1d cmp %i0, %i5
2009f68: 02 80 00 0d be 2009f9c <_Heap_Walk+0x21c>
2009f6c: 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;
2009f70: 80 a3 40 1d cmp %o5, %i5
2009f74: 28 80 00 bf bleu,a 200a270 <_Heap_Walk+0x4f0> <== ALWAYS TAKEN
2009f78: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
2009f7c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
2009f80: 92 10 20 01 mov 1, %o1
2009f84: 15 00 80 75 sethi %hi(0x201d400), %o2
2009f88: 96 10 00 1d mov %i5, %o3
2009f8c: 9f c5 c0 00 call %l7
2009f90: 94 12 a1 48 or %o2, 0x148, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2009f94: 10 bf ff c4 b 2009ea4 <_Heap_Walk+0x124>
2009f98: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2009f9c: 27 00 80 75 sethi %hi(0x201d400), %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)(
2009fa0: 25 00 80 75 sethi %hi(0x201d400), %l2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2009fa4: aa 10 00 1c mov %i4, %l5
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2009fa8: a6 14 e3 78 or %l3, 0x378, %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)(
2009fac: a4 14 a3 60 or %l2, 0x360, %l2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2009fb0: 29 00 80 75 sethi %hi(0x201d400), %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;
2009fb4: 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);
2009fb8: 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;
2009fbc: 80 a3 40 1d cmp %o5, %i5
2009fc0: 28 80 00 0b bleu,a 2009fec <_Heap_Walk+0x26c> <== ALWAYS TAKEN
2009fc4: 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)(
2009fc8: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
2009fcc: 92 10 20 01 mov 1, %o1
2009fd0: 96 10 00 15 mov %l5, %o3
2009fd4: 15 00 80 75 sethi %hi(0x201d400), %o2
2009fd8: 98 10 00 1d mov %i5, %o4
2009fdc: 9f c5 c0 00 call %l7
2009fe0: 94 12 a1 f0 or %o2, 0x1f0, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
2009fe4: 10 bf ff 75 b 2009db8 <_Heap_Walk+0x38>
2009fe8: 82 10 20 00 clr %g1
2009fec: 80 a3 c0 1d cmp %o7, %i5
2009ff0: 0a bf ff f7 bcs 2009fcc <_Heap_Walk+0x24c>
2009ff4: 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;
2009ff8: 9e 1d 40 11 xor %l5, %l1, %o7
2009ffc: 80 a0 00 0f cmp %g0, %o7
200a000: 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;
200a004: 90 10 00 16 mov %l6, %o0
200a008: da 27 bf fc st %o5, [ %fp + -4 ]
200a00c: 7f ff de d9 call 2001b70 <.urem>
200a010: 92 10 00 1b mov %i3, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
200a014: 80 a2 20 00 cmp %o0, 0
200a018: 02 80 00 18 be 200a078 <_Heap_Walk+0x2f8>
200a01c: da 07 bf fc ld [ %fp + -4 ], %o5
200a020: 80 8b 60 ff btst 0xff, %o5
200a024: 12 80 00 8b bne 200a250 <_Heap_Walk+0x4d0>
200a028: 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;
200a02c: de 07 60 04 ld [ %i5 + 4 ], %o7
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
200a030: 80 8b e0 01 btst 1, %o7
200a034: 02 80 00 2b be 200a0e0 <_Heap_Walk+0x360>
200a038: 80 a6 a0 00 cmp %i2, 0
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
200a03c: 22 80 00 21 be,a 200a0c0 <_Heap_Walk+0x340>
200a040: da 05 40 00 ld [ %l5 ], %o5
(*printer)(
200a044: 90 10 00 19 mov %i1, %o0
200a048: 92 10 20 00 clr %o1
200a04c: 94 10 00 12 mov %l2, %o2
200a050: 96 10 00 15 mov %l5, %o3
200a054: 9f c5 c0 00 call %l7
200a058: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
200a05c: 80 a7 00 1d cmp %i4, %i5
200a060: 02 80 00 51 be 200a1a4 <_Heap_Walk+0x424>
200a064: aa 10 00 1d mov %i5, %l5
200a068: ec 07 60 04 ld [ %i5 + 4 ], %l6
200a06c: da 06 20 20 ld [ %i0 + 0x20 ], %o5
200a070: 10 bf ff d1 b 2009fb4 <_Heap_Walk+0x234>
200a074: b4 0d a0 01 and %l6, 1, %i2
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200a078: 80 a5 80 10 cmp %l6, %l0
200a07c: 0a 80 00 69 bcs 200a220 <_Heap_Walk+0x4a0>
200a080: 80 8b 60 ff btst 0xff, %o5
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
200a084: 80 a5 40 1d cmp %l5, %i5
200a088: 2a bf ff ea bcs,a 200a030 <_Heap_Walk+0x2b0>
200a08c: de 07 60 04 ld [ %i5 + 4 ], %o7
200a090: 80 8b 60 ff btst 0xff, %o5
200a094: 22 bf ff e7 be,a 200a030 <_Heap_Walk+0x2b0>
200a098: de 07 60 04 ld [ %i5 + 4 ], %o7
(*printer)(
200a09c: 90 10 00 19 mov %i1, %o0
200a0a0: 92 10 20 01 mov 1, %o1
200a0a4: 96 10 00 15 mov %l5, %o3
200a0a8: 15 00 80 75 sethi %hi(0x201d400), %o2
200a0ac: 98 10 00 1d mov %i5, %o4
200a0b0: 9f c5 c0 00 call %l7
200a0b4: 94 12 a2 80 or %o2, 0x280, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
200a0b8: 10 bf ff 40 b 2009db8 <_Heap_Walk+0x38>
200a0bc: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200a0c0: 96 10 00 15 mov %l5, %o3
200a0c4: 90 10 00 19 mov %i1, %o0
200a0c8: 92 10 20 00 clr %o1
200a0cc: 94 10 00 13 mov %l3, %o2
200a0d0: 9f c5 c0 00 call %l7
200a0d4: 98 10 00 16 mov %l6, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
200a0d8: 10 bf ff e2 b 200a060 <_Heap_Walk+0x2e0>
200a0dc: 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 ?
200a0e0: 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)(
200a0e4: de 06 20 08 ld [ %i0 + 8 ], %o7
200a0e8: 80 a3 c0 0d cmp %o7, %o5
200a0ec: 02 80 00 3d be 200a1e0 <_Heap_Walk+0x460>
200a0f0: 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)" : ""),
200a0f4: 80 a6 00 0d cmp %i0, %o5
200a0f8: 02 80 00 40 be 200a1f8 <_Heap_Walk+0x478>
200a0fc: 96 15 23 28 or %l4, 0x328, %o3
block->next,
block->next == last_free_block ?
200a100: 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)(
200a104: 80 a3 00 0f cmp %o4, %o7
200a108: 02 80 00 33 be 200a1d4 <_Heap_Walk+0x454>
200a10c: 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)" : "")
200a110: 02 80 00 37 be 200a1ec <_Heap_Walk+0x46c>
200a114: 98 15 23 28 or %l4, 0x328, %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)(
200a118: d6 23 a0 5c st %o3, [ %sp + 0x5c ]
200a11c: d8 23 a0 64 st %o4, [ %sp + 0x64 ]
200a120: de 23 a0 60 st %o7, [ %sp + 0x60 ]
200a124: 90 10 00 19 mov %i1, %o0
200a128: 92 10 20 00 clr %o1
200a12c: 15 00 80 75 sethi %hi(0x201d400), %o2
200a130: 96 10 00 15 mov %l5, %o3
200a134: 94 12 a2 b8 or %o2, 0x2b8, %o2
200a138: 9f c5 c0 00 call %l7
200a13c: 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 ) {
200a140: da 07 40 00 ld [ %i5 ], %o5
200a144: 80 a5 80 0d cmp %l6, %o5
200a148: 12 80 00 19 bne 200a1ac <_Heap_Walk+0x42c>
200a14c: 80 a6 a0 00 cmp %i2, 0
);
return false;
}
if ( !prev_used ) {
200a150: 02 80 00 2d be 200a204 <_Heap_Walk+0x484>
200a154: 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;
200a158: 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 ) {
200a15c: 80 a6 00 02 cmp %i0, %g2
200a160: 02 80 00 0b be 200a18c <_Heap_Walk+0x40c> <== NEVER TAKEN
200a164: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
200a168: 80 a5 40 02 cmp %l5, %g2
200a16c: 02 bf ff bd be 200a060 <_Heap_Walk+0x2e0>
200a170: 80 a7 00 1d cmp %i4, %i5
return true;
}
free_block = free_block->next;
200a174: 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 ) {
200a178: 80 a6 00 02 cmp %i0, %g2
200a17c: 12 bf ff fc bne 200a16c <_Heap_Walk+0x3ec>
200a180: 80 a5 40 02 cmp %l5, %g2
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
200a184: 90 10 00 19 mov %i1, %o0
200a188: 92 10 20 01 mov 1, %o1
200a18c: 15 00 80 75 sethi %hi(0x201d400), %o2
200a190: 96 10 00 15 mov %l5, %o3
200a194: 9f c5 c0 00 call %l7
200a198: 94 12 a3 a0 or %o2, 0x3a0, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a19c: 10 bf ff 42 b 2009ea4 <_Heap_Walk+0x124>
200a1a0: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
200a1a4: 10 bf ff 05 b 2009db8 <_Heap_Walk+0x38>
200a1a8: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
200a1ac: fa 23 a0 5c st %i5, [ %sp + 0x5c ]
200a1b0: 90 10 00 19 mov %i1, %o0
200a1b4: 92 10 20 01 mov 1, %o1
200a1b8: 15 00 80 75 sethi %hi(0x201d400), %o2
200a1bc: 96 10 00 15 mov %l5, %o3
200a1c0: 94 12 a2 f0 or %o2, 0x2f0, %o2
200a1c4: 9f c5 c0 00 call %l7
200a1c8: 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;
200a1cc: 10 bf ff 36 b 2009ea4 <_Heap_Walk+0x124>
200a1d0: 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)(
200a1d4: 03 00 80 74 sethi %hi(0x201d000), %g1
200a1d8: 10 bf ff d0 b 200a118 <_Heap_Walk+0x398>
200a1dc: 98 10 63 80 or %g1, 0x380, %o4 ! 201d380 <__log2table+0x140>
200a1e0: 03 00 80 74 sethi %hi(0x201d000), %g1
200a1e4: 10 bf ff c7 b 200a100 <_Heap_Walk+0x380>
200a1e8: 96 10 63 60 or %g1, 0x360, %o3 ! 201d360 <__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)" : "")
200a1ec: 03 00 80 74 sethi %hi(0x201d000), %g1
200a1f0: 10 bf ff ca b 200a118 <_Heap_Walk+0x398>
200a1f4: 98 10 63 90 or %g1, 0x390, %o4 ! 201d390 <__log2table+0x150>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
200a1f8: 17 00 80 74 sethi %hi(0x201d000), %o3
200a1fc: 10 bf ff c1 b 200a100 <_Heap_Walk+0x380>
200a200: 96 12 e3 70 or %o3, 0x370, %o3 ! 201d370 <__log2table+0x130>
return false;
}
if ( !prev_used ) {
(*printer)(
200a204: 92 10 20 01 mov 1, %o1
200a208: 15 00 80 75 sethi %hi(0x201d400), %o2
200a20c: 96 10 00 15 mov %l5, %o3
200a210: 9f c5 c0 00 call %l7
200a214: 94 12 a3 30 or %o2, 0x330, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a218: 10 bf ff 23 b 2009ea4 <_Heap_Walk+0x124>
200a21c: 82 10 20 00 clr %g1
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
200a220: 02 bf ff 9a be 200a088 <_Heap_Walk+0x308> <== NEVER TAKEN
200a224: 80 a5 40 1d cmp %l5, %i5
(*printer)(
200a228: 90 10 00 19 mov %i1, %o0
200a22c: 92 10 20 01 mov 1, %o1
200a230: 96 10 00 15 mov %l5, %o3
200a234: 15 00 80 75 sethi %hi(0x201d400), %o2
200a238: 98 10 00 16 mov %l6, %o4
200a23c: 94 12 a2 50 or %o2, 0x250, %o2
200a240: 9f c5 c0 00 call %l7
200a244: 9a 10 00 10 mov %l0, %o5
block,
block_size,
min_block_size
);
return false;
200a248: 10 bf fe dc b 2009db8 <_Heap_Walk+0x38>
200a24c: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
200a250: 92 10 20 01 mov 1, %o1
200a254: 96 10 00 15 mov %l5, %o3
200a258: 15 00 80 75 sethi %hi(0x201d400), %o2
200a25c: 98 10 00 16 mov %l6, %o4
200a260: 9f c5 c0 00 call %l7
200a264: 94 12 a2 20 or %o2, 0x220, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
200a268: 10 bf fe d4 b 2009db8 <_Heap_Walk+0x38>
200a26c: 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;
200a270: 80 a4 c0 1d cmp %l3, %i5
200a274: 0a bf ff 43 bcs 2009f80 <_Heap_Walk+0x200> <== NEVER TAKEN
200a278: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200a27c: da 27 bf fc st %o5, [ %fp + -4 ]
200a280: 90 07 60 08 add %i5, 8, %o0
200a284: 7f ff de 3b call 2001b70 <.urem>
200a288: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
200a28c: 80 a2 20 00 cmp %o0, 0
200a290: 12 80 00 36 bne 200a368 <_Heap_Walk+0x5e8> <== NEVER TAKEN
200a294: 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;
200a298: c2 07 60 04 ld [ %i5 + 4 ], %g1
200a29c: 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;
200a2a0: 82 07 40 01 add %i5, %g1, %g1
200a2a4: c2 00 60 04 ld [ %g1 + 4 ], %g1
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
200a2a8: 80 88 60 01 btst 1, %g1
200a2ac: 12 80 00 27 bne 200a348 <_Heap_Walk+0x5c8> <== NEVER TAKEN
200a2b0: a4 10 00 1d mov %i5, %l2
200a2b4: 10 80 00 19 b 200a318 <_Heap_Walk+0x598>
200a2b8: 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 ) {
200a2bc: 80 a6 00 1d cmp %i0, %i5
200a2c0: 02 bf ff 37 be 2009f9c <_Heap_Walk+0x21c>
200a2c4: 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;
200a2c8: 0a bf ff 2e bcs 2009f80 <_Heap_Walk+0x200>
200a2cc: 90 10 00 19 mov %i1, %o0
200a2d0: 80 a7 40 13 cmp %i5, %l3
200a2d4: 18 bf ff 2c bgu 2009f84 <_Heap_Walk+0x204> <== NEVER TAKEN
200a2d8: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
200a2dc: da 27 bf fc st %o5, [ %fp + -4 ]
200a2e0: 90 07 60 08 add %i5, 8, %o0
200a2e4: 7f ff de 23 call 2001b70 <.urem>
200a2e8: 92 10 00 14 mov %l4, %o1
);
return false;
}
if (
200a2ec: 80 a2 20 00 cmp %o0, 0
200a2f0: 12 80 00 1e bne 200a368 <_Heap_Walk+0x5e8>
200a2f4: 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;
200a2f8: de 07 60 04 ld [ %i5 + 4 ], %o7
200a2fc: 82 10 00 12 mov %l2, %g1
200a300: 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;
200a304: 9e 03 c0 1d add %o7, %i5, %o7
200a308: de 03 e0 04 ld [ %o7 + 4 ], %o7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
200a30c: 80 8b e0 01 btst 1, %o7
200a310: 12 80 00 0e bne 200a348 <_Heap_Walk+0x5c8>
200a314: a4 10 00 1d mov %i5, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
200a318: d8 07 60 0c ld [ %i5 + 0xc ], %o4
200a31c: 80 a3 00 01 cmp %o4, %g1
200a320: 22 bf ff e7 be,a 200a2bc <_Heap_Walk+0x53c>
200a324: fa 07 60 08 ld [ %i5 + 8 ], %i5
(*printer)(
200a328: 90 10 00 19 mov %i1, %o0
200a32c: 92 10 20 01 mov 1, %o1
200a330: 15 00 80 75 sethi %hi(0x201d400), %o2
200a334: 96 10 00 1d mov %i5, %o3
200a338: 9f c5 c0 00 call %l7
200a33c: 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;
200a340: 10 bf fe d9 b 2009ea4 <_Heap_Walk+0x124>
200a344: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
200a348: 90 10 00 19 mov %i1, %o0
200a34c: 92 10 20 01 mov 1, %o1
200a350: 15 00 80 75 sethi %hi(0x201d400), %o2
200a354: 96 10 00 1d mov %i5, %o3
200a358: 9f c5 c0 00 call %l7
200a35c: 94 12 a1 98 or %o2, 0x198, %o2
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
200a360: 10 bf fe d1 b 2009ea4 <_Heap_Walk+0x124>
200a364: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
200a368: 90 10 00 19 mov %i1, %o0
200a36c: 92 10 20 01 mov 1, %o1
200a370: 15 00 80 75 sethi %hi(0x201d400), %o2
200a374: 96 10 00 1d mov %i5, %o3
200a378: 9f c5 c0 00 call %l7
200a37c: 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;
200a380: 10 bf fe c9 b 2009ea4 <_Heap_Walk+0x124>
200a384: 82 10 20 00 clr %g1
020083e8 <_IO_Initialize_all_drivers>:
_IO_Driver_address_table[index] = driver_table[index];
}
void _IO_Initialize_all_drivers( void )
{
20083e8: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
20083ec: 39 00 80 7b sethi %hi(0x201ec00), %i4
20083f0: c2 07 20 88 ld [ %i4 + 0x88 ], %g1 ! 201ec88 <_IO_Number_of_drivers>
20083f4: ba 10 20 00 clr %i5
20083f8: 80 a0 60 00 cmp %g1, 0
20083fc: 02 80 00 0b be 2008428 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
2008400: b8 17 20 88 or %i4, 0x88, %i4
(void) rtems_io_initialize( major, 0, NULL );
2008404: 90 10 00 1d mov %i5, %o0
2008408: 92 10 20 00 clr %o1
200840c: 40 00 16 27 call 200dca8 <rtems_io_initialize>
2008410: 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 ++ )
2008414: c2 07 00 00 ld [ %i4 ], %g1
2008418: ba 07 60 01 inc %i5
200841c: 80 a0 40 1d cmp %g1, %i5
2008420: 18 bf ff fa bgu 2008408 <_IO_Initialize_all_drivers+0x20>
2008424: 90 10 00 1d mov %i5, %o0
2008428: 81 c7 e0 08 ret
200842c: 81 e8 00 00 restore
02008318 <_IO_Manager_initialization>:
#include <rtems/score/wkspace.h>
#include <string.h>
void _IO_Manager_initialization(void)
{
2008318: 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();
200831c: 03 00 80 6d sethi %hi(0x201b400), %g1
2008320: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 <Configuration>
drivers_in_table = rtems_configuration_get_number_of_device_drivers();
2008324: f8 00 60 38 ld [ %g1 + 0x38 ], %i4
number_of_drivers = rtems_configuration_get_maximum_drivers();
2008328: 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 )
200832c: 80 a7 00 1b cmp %i4, %i3
2008330: 0a 80 00 08 bcs 2008350 <_IO_Manager_initialization+0x38>
2008334: 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;
2008338: 03 00 80 7b sethi %hi(0x201ec00), %g1
200833c: fa 20 60 8c st %i5, [ %g1 + 0x8c ] ! 201ec8c <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
2008340: 03 00 80 7b sethi %hi(0x201ec00), %g1
2008344: f8 20 60 88 st %i4, [ %g1 + 0x88 ] ! 201ec88 <_IO_Number_of_drivers>
return;
2008348: 81 c7 e0 08 ret
200834c: 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 )
2008350: 83 2e e0 03 sll %i3, 3, %g1
2008354: b5 2e e0 05 sll %i3, 5, %i2
2008358: 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(
200835c: 40 00 0d 7c call 200b94c <_Workspace_Allocate_or_fatal_error>
2008360: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
2008364: 03 00 80 7b sethi %hi(0x201ec00), %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 *)
2008368: 33 00 80 7b sethi %hi(0x201ec00), %i1
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
200836c: f6 20 60 88 st %i3, [ %g1 + 0x88 ]
/*
* 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 *)
2008370: d0 26 60 8c st %o0, [ %i1 + 0x8c ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
2008374: 92 10 20 00 clr %o1
2008378: 40 00 22 a6 call 2010e10 <memset>
200837c: 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++ )
2008380: 80 a7 20 00 cmp %i4, 0
2008384: 02 bf ff f1 be 2008348 <_IO_Manager_initialization+0x30> <== NEVER TAKEN
2008388: c8 06 60 8c ld [ %i1 + 0x8c ], %g4
#include <rtems/score/thread.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _IO_Manager_initialization(void)
200838c: 85 2f 20 03 sll %i4, 3, %g2
2008390: b7 2f 20 05 sll %i4, 5, %i3
2008394: 82 10 20 00 clr %g1
2008398: 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];
200839c: c4 07 40 01 ld [ %i5 + %g1 ], %g2
20083a0: 86 07 40 01 add %i5, %g1, %g3
20083a4: c4 21 00 01 st %g2, [ %g4 + %g1 ]
20083a8: f8 00 e0 04 ld [ %g3 + 4 ], %i4
20083ac: 84 01 00 01 add %g4, %g1, %g2
20083b0: f8 20 a0 04 st %i4, [ %g2 + 4 ]
20083b4: f8 00 e0 08 ld [ %g3 + 8 ], %i4
20083b8: 82 00 60 18 add %g1, 0x18, %g1
20083bc: f8 20 a0 08 st %i4, [ %g2 + 8 ]
20083c0: 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++ )
20083c4: 80 a0 40 1b cmp %g1, %i3
_IO_Driver_address_table[index] = driver_table[index];
20083c8: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
20083cc: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4
20083d0: f8 20 a0 10 st %i4, [ %g2 + 0x10 ]
20083d4: 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++ )
20083d8: 12 bf ff f1 bne 200839c <_IO_Manager_initialization+0x84>
20083dc: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
20083e0: 81 c7 e0 08 ret
20083e4: 81 e8 00 00 restore
020090e0 <_Internal_error_Occurred>:
void _Internal_error_Occurred(
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
20090e0: 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 );
20090e4: 13 00 80 2c sethi %hi(0x200b000), %o1
20090e8: 90 07 bf f4 add %fp, -12, %o0
20090ec: 92 12 63 84 or %o1, 0x384, %o1
Internal_errors_Source source,
bool is_internal,
Internal_errors_t error
)
{
User_extensions_Fatal_context ctx = { source, is_internal, error };
20090f0: f0 27 bf f4 st %i0, [ %fp + -12 ]
20090f4: f2 2f bf f8 stb %i1, [ %fp + -8 ]
_User_extensions_Iterate( &ctx, _User_extensions_Fatal_visitor );
20090f8: 40 00 08 ae call 200b3b0 <_User_extensions_Iterate>
20090fc: 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;
2009100: 05 00 80 7a sethi %hi(0x201e800), %g2 <== NOT EXECUTED
2009104: 82 10 a0 2c or %g2, 0x2c, %g1 ! 201e82c <_Internal_errors_What_happened><== NOT EXECUTED
2009108: f0 20 a0 2c st %i0, [ %g2 + 0x2c ] <== NOT EXECUTED
_Internal_errors_What_happened.is_internal = is_internal;
200910c: f2 28 60 04 stb %i1, [ %g1 + 4 ] <== NOT EXECUTED
_Internal_errors_What_happened.the_error = the_error;
2009110: 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;
2009114: 84 10 20 05 mov 5, %g2 <== NOT EXECUTED
2009118: 03 00 80 7a sethi %hi(0x201e800), %g1 <== NOT EXECUTED
_System_state_Set( SYSTEM_STATE_FAILED );
_CPU_Fatal_halt( the_error );
200911c: 7f ff e5 3c call 200260c <sparc_disable_interrupts> <== NOT EXECUTED
2009120: c4 20 60 38 st %g2, [ %g1 + 0x38 ] ! 201e838 <_System_state_Current><== NOT EXECUTED
2009124: 82 10 00 08 mov %o0, %g1 <== NOT EXECUTED
2009128: 30 80 00 00 b,a 2009128 <_Internal_error_Occurred+0x48> <== NOT EXECUTED
02009198 <_Objects_Allocate>:
#endif
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2009198: 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 )
200919c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
20091a0: 80 a0 60 00 cmp %g1, 0
20091a4: 02 80 00 26 be 200923c <_Objects_Allocate+0xa4> <== NEVER TAKEN
20091a8: 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 );
20091ac: b8 06 20 20 add %i0, 0x20, %i4
20091b0: 7f ff fd 4c call 20086e0 <_Chain_Get>
20091b4: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
20091b8: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
20091bc: 80 a0 60 00 cmp %g1, 0
20091c0: 02 80 00 16 be 2009218 <_Objects_Allocate+0x80>
20091c4: 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 ) {
20091c8: 80 a2 20 00 cmp %o0, 0
20091cc: 02 80 00 15 be 2009220 <_Objects_Allocate+0x88>
20091d0: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
20091d4: c4 07 60 08 ld [ %i5 + 8 ], %g2
20091d8: d0 06 20 08 ld [ %i0 + 8 ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
20091dc: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
20091e0: 03 00 00 3f sethi %hi(0xfc00), %g1
20091e4: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff <PROM_START+0xffff>
20091e8: 90 0a 00 01 and %o0, %g1, %o0
20091ec: 82 08 80 01 and %g2, %g1, %g1
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
20091f0: 40 00 3f f7 call 20191cc <.udiv>
20091f4: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
20091f8: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
20091fc: 91 2a 20 02 sll %o0, 2, %o0
2009200: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
2009204: 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 ]--;
2009208: 86 00 ff ff add %g3, -1, %g3
200920c: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
2009210: 82 00 bf ff add %g2, -1, %g1
2009214: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
2009218: 81 c7 e0 08 ret
200921c: 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 );
2009220: 40 00 00 10 call 2009260 <_Objects_Extend_information>
2009224: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
2009228: 7f ff fd 2e call 20086e0 <_Chain_Get>
200922c: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
2009230: b0 92 20 00 orcc %o0, 0, %i0
2009234: 32 bf ff e9 bne,a 20091d8 <_Objects_Allocate+0x40>
2009238: 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;
200923c: 81 c7 e0 08 ret
2009240: 91 e8 20 00 restore %g0, 0, %o0
02009260 <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
2009260: 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 )
2009264: 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 );
2009268: e0 16 20 0a lduh [ %i0 + 0xa ], %l0
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
200926c: 80 a6 60 00 cmp %i1, 0
2009270: 02 80 00 a1 be 20094f4 <_Objects_Extend_information+0x294>
2009274: e2 16 20 10 lduh [ %i0 + 0x10 ], %l1
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
2009278: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
200927c: a3 2c 60 10 sll %l1, 0x10, %l1
2009280: 92 10 00 1b mov %i3, %o1
2009284: 40 00 3f d2 call 20191cc <.udiv>
2009288: 91 34 60 10 srl %l1, 0x10, %o0
200928c: 91 2a 20 10 sll %o0, 0x10, %o0
2009290: b5 32 20 10 srl %o0, 0x10, %i2
for ( ; block < block_count; block++ ) {
2009294: 80 a6 a0 00 cmp %i2, 0
2009298: 02 80 00 af be 2009554 <_Objects_Extend_information+0x2f4><== NEVER TAKEN
200929c: 90 10 00 1b mov %i3, %o0
if ( information->object_blocks[ block ] == NULL ) {
20092a0: c2 06 40 00 ld [ %i1 ], %g1
20092a4: 80 a0 60 00 cmp %g1, 0
20092a8: 02 80 00 b1 be 200956c <_Objects_Extend_information+0x30c><== NEVER TAKEN
20092ac: 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;
20092b0: 10 80 00 06 b 20092c8 <_Objects_Extend_information+0x68>
20092b4: 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 ) {
20092b8: c2 06 40 01 ld [ %i1 + %g1 ], %g1
20092bc: 80 a0 60 00 cmp %g1, 0
20092c0: 22 80 00 08 be,a 20092e0 <_Objects_Extend_information+0x80>
20092c4: 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++ ) {
20092c8: ba 07 60 01 inc %i5
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
20092cc: 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++ ) {
20092d0: 80 a6 80 1d cmp %i2, %i5
20092d4: 18 bf ff f9 bgu 20092b8 <_Objects_Extend_information+0x58>
20092d8: 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;
20092dc: b6 10 20 01 mov 1, %i3
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
20092e0: 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 ) {
20092e4: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
20092e8: 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 ) {
20092ec: 82 10 63 ff or %g1, 0x3ff, %g1
20092f0: 80 a6 40 01 cmp %i1, %g1
20092f4: 18 80 00 9c bgu 2009564 <_Objects_Extend_information+0x304>
20092f8: 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;
20092fc: 40 00 3f 7a call 20190e4 <.umul>
2009300: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
2009304: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
2009308: 80 a0 60 00 cmp %g1, 0
200930c: 02 80 00 6d be 20094c0 <_Objects_Extend_information+0x260>
2009310: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
2009314: 40 00 09 80 call 200b914 <_Workspace_Allocate>
2009318: 01 00 00 00 nop
if ( !new_object_block )
200931c: a2 92 20 00 orcc %o0, 0, %l1
2009320: 02 80 00 91 be 2009564 <_Objects_Extend_information+0x304>
2009324: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
2009328: 80 8e e0 ff btst 0xff, %i3
200932c: 22 80 00 42 be,a 2009434 <_Objects_Extend_information+0x1d4>
2009330: 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 ) {
2009334: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
2009338: 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 ) {
200933c: 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 *)) +
2009340: 91 2e e0 01 sll %i3, 1, %o0
2009344: 90 02 00 1b add %o0, %i3, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
2009348: 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 *)) +
200934c: 90 02 00 10 add %o0, %l0, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
if ( information->auto_extend ) {
2009350: 12 80 00 60 bne 20094d0 <_Objects_Extend_information+0x270>
2009354: 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 );
2009358: 40 00 09 7d call 200b94c <_Workspace_Allocate_or_fatal_error>
200935c: 01 00 00 00 nop
2009360: 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 ) {
2009364: 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*) );
2009368: 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 ) {
200936c: 80 a4 00 01 cmp %l0, %g1
2009370: a6 04 80 1b add %l2, %i3, %l3
2009374: 0a 80 00 67 bcs 2009510 <_Objects_Extend_information+0x2b0>
2009378: b6 04 c0 1b add %l3, %i3, %i3
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
200937c: 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++ ) {
2009380: 80 a4 20 00 cmp %l0, 0
2009384: 02 80 00 07 be 20093a0 <_Objects_Extend_information+0x140><== NEVER TAKEN
2009388: 82 10 20 00 clr %g1
local_table[ index ] = NULL;
200938c: c0 20 40 1b clr [ %g1 + %i3 ]
2009390: 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++ ) {
2009394: 80 a0 40 02 cmp %g1, %g2
2009398: 32 bf ff fe bne,a 2009390 <_Objects_Extend_information+0x130><== NEVER TAKEN
200939c: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED
20093a0: 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 );
20093a4: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
20093a8: c0 24 80 1a clr [ %l2 + %i2 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
20093ac: 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 ;
20093b0: 80 a7 00 01 cmp %i4, %g1
20093b4: 1a 80 00 0b bcc 20093e0 <_Objects_Extend_information+0x180><== NEVER TAKEN
20093b8: c0 24 c0 1a clr [ %l3 + %i2 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
20093bc: 85 2f 20 02 sll %i4, 2, %g2
20093c0: 87 28 e0 02 sll %g3, 2, %g3
20093c4: 84 06 c0 02 add %i3, %g2, %g2
20093c8: 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;
20093cc: c0 20 80 01 clr [ %g2 + %g1 ]
20093d0: 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 ;
20093d4: 80 a0 40 03 cmp %g1, %g3
20093d8: 32 bf ff fe bne,a 20093d0 <_Objects_Extend_information+0x170>
20093dc: c0 20 80 01 clr [ %g2 + %g1 ]
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
20093e0: 7f ff e4 8b call 200260c <sparc_disable_interrupts>
20093e4: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
20093e8: 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(
20093ec: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
20093f0: 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;
20093f4: f2 36 20 10 sth %i1, [ %i0 + 0x10 ]
20093f8: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
20093fc: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
2009400: e4 26 20 34 st %l2, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
2009404: e6 26 20 30 st %l3, [ %i0 + 0x30 ]
information->local_table = local_table;
2009408: 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) |
200940c: 03 00 00 40 sethi %hi(0x10000), %g1
2009410: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2009414: 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) |
2009418: b2 10 40 19 or %g1, %i1, %i1
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
200941c: f2 26 20 0c st %i1, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
2009420: 7f ff e4 7f call 200261c <sparc_enable_interrupts>
2009424: 01 00 00 00 nop
_Workspace_Free( old_tables );
2009428: 40 00 09 43 call 200b934 <_Workspace_Free>
200942c: 90 10 00 1a mov %i2, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
2009430: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2009434: bb 2f 60 02 sll %i5, 2, %i5
2009438: e2 20 40 1d st %l1, [ %g1 + %i5 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
200943c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2009440: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
2009444: d2 00 40 1d ld [ %g1 + %i5 ], %o1
2009448: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
200944c: 90 07 bf f4 add %fp, -12, %o0
2009450: 7f ff fc b4 call 2008720 <_Chain_Initialize>
2009454: 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 ) {
2009458: 10 80 00 0d b 200948c <_Objects_Extend_information+0x22c>
200945c: b6 06 20 20 add %i0, 0x20, %i3
the_object->id = _Objects_Build_id(
2009460: c6 16 20 04 lduh [ %i0 + 4 ], %g3
2009464: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2009468: 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) |
200946c: 84 10 80 1a or %g2, %i2, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2009470: 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) |
2009474: 84 10 80 1c or %g2, %i4, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2009478: 90 10 00 1b mov %i3, %o0
200947c: 92 10 00 01 mov %g1, %o1
index++;
2009480: b8 07 20 01 inc %i4
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2009484: 7f ff fc 8c call 20086b4 <_Chain_Append>
2009488: 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 ) {
200948c: 7f ff fc 95 call 20086e0 <_Chain_Get>
2009490: 90 07 bf f4 add %fp, -12, %o0
2009494: 82 92 20 00 orcc %o0, 0, %g1
2009498: 32 bf ff f2 bne,a 2009460 <_Objects_Extend_information+0x200>
200949c: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20094a0: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
20094a4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
20094a8: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20094ac: c8 20 c0 1d st %g4, [ %g3 + %i5 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
20094b0: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
20094b4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
20094b8: 81 c7 e0 08 ret
20094bc: 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 );
20094c0: 40 00 09 23 call 200b94c <_Workspace_Allocate_or_fatal_error>
20094c4: 01 00 00 00 nop
20094c8: 10 bf ff 98 b 2009328 <_Objects_Extend_information+0xc8>
20094cc: 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 );
20094d0: 40 00 09 11 call 200b914 <_Workspace_Allocate>
20094d4: 01 00 00 00 nop
if ( !object_blocks ) {
20094d8: a4 92 20 00 orcc %o0, 0, %l2
20094dc: 32 bf ff a3 bne,a 2009368 <_Objects_Extend_information+0x108>
20094e0: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
_Workspace_Free( new_object_block );
20094e4: 40 00 09 14 call 200b934 <_Workspace_Free>
20094e8: 90 10 00 11 mov %l1, %o0
20094ec: 81 c7 e0 08 ret
20094f0: 81 e8 00 00 restore
20094f4: 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 );
20094f8: 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;
20094fc: b6 10 20 01 mov 1, %i3
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2009500: ba 10 20 00 clr %i5
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
2009504: b4 10 20 00 clr %i2
2009508: 10 bf ff 76 b 20092e0 <_Objects_Extend_information+0x80>
200950c: 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,
2009510: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
2009514: 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,
2009518: 90 10 00 12 mov %l2, %o0
200951c: 40 00 1e 00 call 2010d1c <memcpy>
2009520: 94 10 00 1a mov %i2, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
2009524: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
2009528: 94 10 00 1a mov %i2, %o2
200952c: 40 00 1d fc call 2010d1c <memcpy>
2009530: 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 *) );
2009534: 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,
2009538: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
200953c: 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,
2009540: 90 10 00 1b mov %i3, %o0
2009544: 40 00 1d f6 call 2010d1c <memcpy>
2009548: 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 );
200954c: 10 bf ff 97 b 20093a8 <_Objects_Extend_information+0x148>
2009550: 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 );
2009554: 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;
2009558: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
200955c: 10 bf ff 61 b 20092e0 <_Objects_Extend_information+0x80> <== NOT EXECUTED
2009560: ba 10 20 00 clr %i5 <== NOT EXECUTED
2009564: 81 c7 e0 08 ret
2009568: 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;
200956c: 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;
2009570: 10 bf ff 5c b 20092e0 <_Objects_Extend_information+0x80> <== NOT EXECUTED
2009574: ba 10 20 00 clr %i5 <== NOT EXECUTED
02009628 <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
2009628: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
200962c: 80 a6 60 00 cmp %i1, 0
2009630: 02 80 00 19 be 2009694 <_Objects_Get_information+0x6c>
2009634: 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 );
2009638: 40 00 13 83 call 200e444 <_Objects_API_maximum_class>
200963c: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
2009640: 80 a2 20 00 cmp %o0, 0
2009644: 02 80 00 14 be 2009694 <_Objects_Get_information+0x6c>
2009648: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
200964c: 0a 80 00 12 bcs 2009694 <_Objects_Get_information+0x6c>
2009650: 03 00 80 78 sethi %hi(0x201e000), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
2009654: b1 2e 20 02 sll %i0, 2, %i0
2009658: 82 10 62 84 or %g1, 0x284, %g1
200965c: c2 00 40 18 ld [ %g1 + %i0 ], %g1
2009660: 80 a0 60 00 cmp %g1, 0
2009664: 02 80 00 0c be 2009694 <_Objects_Get_information+0x6c> <== NEVER TAKEN
2009668: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
200966c: f0 00 40 19 ld [ %g1 + %i1 ], %i0
if ( !info )
2009670: 80 a6 20 00 cmp %i0, 0
2009674: 02 80 00 08 be 2009694 <_Objects_Get_information+0x6c> <== NEVER TAKEN
2009678: 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 )
200967c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
2009680: 80 a0 60 00 cmp %g1, 0
2009684: 02 80 00 04 be 2009694 <_Objects_Get_information+0x6c>
2009688: 01 00 00 00 nop
return NULL;
#endif
return info;
}
200968c: 81 c7 e0 08 ret
2009690: 81 e8 00 00 restore
{
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
return NULL;
2009694: 81 c7 e0 08 ret
2009698: 91 e8 20 00 restore %g0, 0, %o0
02017d90 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
2017d90: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
2017d94: 80 a6 60 00 cmp %i1, 0
2017d98: 02 80 00 11 be 2017ddc <_Objects_Get_name_as_string+0x4c>
2017d9c: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
2017da0: 02 80 00 0f be 2017ddc <_Objects_Get_name_as_string+0x4c>
2017da4: ba 96 20 00 orcc %i0, 0, %i5
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2017da8: 02 80 00 3d be 2017e9c <_Objects_Get_name_as_string+0x10c>
2017dac: 03 00 80 c6 sethi %hi(0x2031800), %g1
information = _Objects_Get_information_id( tmpId );
2017db0: 7f ff df e4 call 200fd40 <_Objects_Get_information_id>
2017db4: 90 10 00 1d mov %i5, %o0
if ( !information )
2017db8: b8 92 20 00 orcc %o0, 0, %i4
2017dbc: 02 80 00 08 be 2017ddc <_Objects_Get_name_as_string+0x4c>
2017dc0: 92 10 00 1d mov %i5, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
2017dc4: 7f ff e0 1f call 200fe40 <_Objects_Get>
2017dc8: 94 07 bf f4 add %fp, -12, %o2
switch ( location ) {
2017dcc: c2 07 bf f4 ld [ %fp + -12 ], %g1
2017dd0: 80 a0 60 00 cmp %g1, 0
2017dd4: 22 80 00 05 be,a 2017de8 <_Objects_Get_name_as_string+0x58>
2017dd8: c2 0f 20 38 ldub [ %i4 + 0x38 ], %g1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
2017ddc: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
2017de0: 81 c7 e0 08 ret
2017de4: 91 e8 00 1a restore %g0, %i2, %o0
return NULL;
case OBJECTS_LOCAL:
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string ) {
2017de8: 80 a0 60 00 cmp %g1, 0
2017dec: 12 80 00 2f bne 2017ea8 <_Objects_Get_name_as_string+0x118>
2017df0: c2 02 20 0c ld [ %o0 + 0xc ], %g1
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2017df4: 89 30 60 18 srl %g1, 0x18, %g4
lname[ 1 ] = (u32_name >> 16) & 0xff;
2017df8: 87 30 60 10 srl %g1, 0x10, %g3
lname[ 2 ] = (u32_name >> 8) & 0xff;
2017dfc: 85 30 60 08 srl %g1, 8, %g2
lname[ 3 ] = (u32_name >> 0) & 0xff;
2017e00: c2 2f bf fb stb %g1, [ %fp + -5 ]
lname[ 4 ] = '\0';
2017e04: 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;
2017e08: c8 2f bf f8 stb %g4, [ %fp + -8 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
2017e0c: c6 2f bf f9 stb %g3, [ %fp + -7 ]
lname[ 2 ] = (u32_name >> 8) & 0xff;
2017e10: c4 2f bf fa stb %g2, [ %fp + -6 ]
lname[ 3 ] = (u32_name >> 0) & 0xff;
lname[ 4 ] = '\0';
s = lname;
2017e14: 82 07 bf f8 add %fp, -8, %g1
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2017e18: 80 a6 60 01 cmp %i1, 1
2017e1c: 02 80 00 27 be 2017eb8 <_Objects_Get_name_as_string+0x128><== NEVER TAKEN
2017e20: 86 10 00 1a mov %i2, %g3
2017e24: c6 48 40 00 ldsb [ %g1 ], %g3
2017e28: 80 a0 e0 00 cmp %g3, 0
2017e2c: 02 80 00 22 be 2017eb4 <_Objects_Get_name_as_string+0x124>
2017e30: c4 08 40 00 ldub [ %g1 ], %g2
* This method objects the name of an object and returns its name
* in the form of a C string. It attempts to be careful about
* overflowing the user's string and about returning unprintable characters.
*/
char *_Objects_Get_name_as_string(
2017e34: b6 06 7f ff add %i1, -1, %i3
2017e38: 39 00 80 c1 sethi %hi(0x2030400), %i4
2017e3c: b6 00 40 1b add %g1, %i3, %i3
2017e40: 86 10 00 1a mov %i2, %g3
2017e44: 10 80 00 06 b 2017e5c <_Objects_Get_name_as_string+0xcc>
2017e48: b8 17 21 c0 or %i4, 0x1c0, %i4
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2017e4c: c8 48 40 00 ldsb [ %g1 ], %g4
2017e50: 80 a1 20 00 cmp %g4, 0
2017e54: 02 80 00 0e be 2017e8c <_Objects_Get_name_as_string+0xfc>
2017e58: c4 08 40 00 ldub [ %g1 ], %g2
*d = (isprint((unsigned char)*s)) ? *s : '*';
2017e5c: fa 07 00 00 ld [ %i4 ], %i5
2017e60: 88 08 a0 ff and %g2, 0xff, %g4
2017e64: 88 07 40 04 add %i5, %g4, %g4
2017e68: c8 49 20 01 ldsb [ %g4 + 1 ], %g4
2017e6c: 80 89 20 97 btst 0x97, %g4
2017e70: 12 80 00 03 bne 2017e7c <_Objects_Get_name_as_string+0xec>
2017e74: 82 00 60 01 inc %g1
2017e78: 84 10 20 2a mov 0x2a, %g2
2017e7c: c4 28 c0 00 stb %g2, [ %g3 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2017e80: 80 a0 40 1b cmp %g1, %i3
2017e84: 12 bf ff f2 bne 2017e4c <_Objects_Get_name_as_string+0xbc>
2017e88: 86 00 e0 01 inc %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2017e8c: 7f ff e4 30 call 2010f4c <_Thread_Enable_dispatch>
2017e90: c0 28 c0 00 clrb [ %g3 ]
return name;
}
return NULL; /* unreachable path */
}
2017e94: 81 c7 e0 08 ret
2017e98: 91 e8 00 1a restore %g0, %i2, %o0
return NULL;
if ( name == NULL )
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2017e9c: c2 00 63 b0 ld [ %g1 + 0x3b0 ], %g1
2017ea0: 10 bf ff c4 b 2017db0 <_Objects_Get_name_as_string+0x20>
2017ea4: fa 00 60 08 ld [ %g1 + 8 ], %i5
lname[ 4 ] = '\0';
s = lname;
}
d = name;
if ( s ) {
2017ea8: 80 a0 60 00 cmp %g1, 0
2017eac: 12 bf ff dc bne 2017e1c <_Objects_Get_name_as_string+0x8c>
2017eb0: 80 a6 60 01 cmp %i1, 1
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
*d = (isprint((unsigned char)*s)) ? *s : '*';
2017eb4: 86 10 00 1a mov %i2, %g3
}
}
*d = '\0';
_Thread_Enable_dispatch();
2017eb8: 7f ff e4 25 call 2010f4c <_Thread_Enable_dispatch>
2017ebc: c0 28 c0 00 clrb [ %g3 ]
2017ec0: 30 bf ff f5 b,a 2017e94 <_Objects_Get_name_as_string+0x104>
0201aac4 <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
201aac4: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
201aac8: 80 a6 20 00 cmp %i0, 0
201aacc: 02 80 00 29 be 201ab70 <_Objects_Get_next+0xac>
201aad0: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( !location_p )
201aad4: 02 80 00 27 be 201ab70 <_Objects_Get_next+0xac>
201aad8: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
201aadc: 02 80 00 25 be 201ab70 <_Objects_Get_next+0xac>
201aae0: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
201aae4: 80 a0 60 00 cmp %g1, 0
201aae8: 22 80 00 13 be,a 201ab34 <_Objects_Get_next+0x70>
201aaec: 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)
201aaf0: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
201aaf4: 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);
201aaf8: 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)
201aafc: 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);
201ab00: 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)
201ab04: 80 a0 80 01 cmp %g2, %g1
201ab08: 0a 80 00 13 bcs 201ab54 <_Objects_Get_next+0x90>
201ab0c: 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);
201ab10: 7f ff d4 cc call 200fe40 <_Objects_Get>
201ab14: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
201ab18: c2 06 80 00 ld [ %i2 ], %g1
201ab1c: 80 a0 60 00 cmp %g1, 0
201ab20: 32 bf ff f5 bne,a 201aaf4 <_Objects_Get_next+0x30>
201ab24: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
*next_id_p = next_id;
201ab28: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
201ab2c: 81 c7 e0 08 ret
201ab30: 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)
201ab34: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2
201ab38: 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);
201ab3c: 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)
201ab40: 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);
201ab44: 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)
201ab48: 80 a0 80 01 cmp %g2, %g1
201ab4c: 1a bf ff f1 bcc 201ab10 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN
201ab50: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
201ab54: 82 10 20 01 mov 1, %g1
201ab58: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
201ab5c: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
201ab60: 82 10 3f ff mov -1, %g1
201ab64: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
201ab68: 81 c7 e0 08 ret
201ab6c: 91 e8 00 08 restore %g0, %o0, %o0
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
201ab70: 10 bf ff ef b 201ab2c <_Objects_Get_next+0x68>
201ab74: 90 10 20 00 clr %o0
0201ac10 <_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;
201ac10: c4 02 20 08 ld [ %o0 + 8 ], %g2
if ( information->maximum >= index ) {
201ac14: 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;
201ac18: 92 22 40 02 sub %o1, %g2, %o1
201ac1c: 92 02 60 01 inc %o1
if ( information->maximum >= index ) {
201ac20: 80 a2 40 01 cmp %o1, %g1
201ac24: 18 80 00 09 bgu 201ac48 <_Objects_Get_no_protection+0x38>
201ac28: 93 2a 60 02 sll %o1, 2, %o1
if ( (the_object = information->local_table[ index ]) != NULL ) {
201ac2c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
201ac30: d0 00 40 09 ld [ %g1 + %o1 ], %o0
201ac34: 80 a2 20 00 cmp %o0, 0
201ac38: 02 80 00 05 be 201ac4c <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN
201ac3c: 82 10 20 01 mov 1, %g1
*location = OBJECTS_LOCAL;
return the_object;
201ac40: 81 c3 e0 08 retl
201ac44: 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;
201ac48: 82 10 20 01 mov 1, %g1
return NULL;
201ac4c: 90 10 20 00 clr %o0
}
201ac50: 81 c3 e0 08 retl
201ac54: c2 22 80 00 st %g1, [ %o2 ]
0200feb4 <_Objects_Id_to_name>:
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
200feb4: 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;
200feb8: 80 a6 20 00 cmp %i0, 0
200febc: 12 80 00 06 bne 200fed4 <_Objects_Id_to_name+0x20>
200fec0: 83 36 20 18 srl %i0, 0x18, %g1
200fec4: 03 00 80 c6 sethi %hi(0x2031800), %g1
200fec8: c2 00 63 b0 ld [ %g1 + 0x3b0 ], %g1 ! 2031bb0 <_Per_CPU_Information+0x10>
200fecc: f0 00 60 08 ld [ %g1 + 8 ], %i0
200fed0: 83 36 20 18 srl %i0, 0x18, %g1
200fed4: 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 )
200fed8: 84 00 7f ff add %g1, -1, %g2
200fedc: 80 a0 a0 02 cmp %g2, 2
200fee0: 18 80 00 11 bgu 200ff24 <_Objects_Id_to_name+0x70>
200fee4: 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 ] )
200fee8: 05 00 80 c5 sethi %hi(0x2031400), %g2
200feec: 84 10 a1 a4 or %g2, 0x1a4, %g2 ! 20315a4 <_Objects_Information_table>
200fef0: c2 00 80 01 ld [ %g2 + %g1 ], %g1
200fef4: 80 a0 60 00 cmp %g1, 0
200fef8: 02 80 00 0b be 200ff24 <_Objects_Id_to_name+0x70>
200fefc: 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 ];
200ff00: 85 28 a0 02 sll %g2, 2, %g2
200ff04: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
200ff08: 80 a2 20 00 cmp %o0, 0
200ff0c: 02 80 00 06 be 200ff24 <_Objects_Id_to_name+0x70> <== NEVER TAKEN
200ff10: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string )
200ff14: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1
200ff18: 80 a0 60 00 cmp %g1, 0
200ff1c: 02 80 00 04 be 200ff2c <_Objects_Id_to_name+0x78> <== ALWAYS TAKEN
200ff20: 92 10 00 18 mov %i0, %o1
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;
200ff24: 81 c7 e0 08 ret
200ff28: 91 e8 20 03 restore %g0, 3, %o0
#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 );
200ff2c: 7f ff ff c5 call 200fe40 <_Objects_Get>
200ff30: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
200ff34: 80 a2 20 00 cmp %o0, 0
200ff38: 02 bf ff fb be 200ff24 <_Objects_Id_to_name+0x70>
200ff3c: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
200ff40: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
200ff44: 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();
200ff48: 40 00 04 01 call 2010f4c <_Thread_Enable_dispatch>
200ff4c: c2 26 40 00 st %g1, [ %i1 ]
200ff50: 81 c7 e0 08 ret
200ff54: 81 e8 00 00 restore
02009938 <_Objects_Shrink_information>:
#include <rtems/score/isr.h>
void _Objects_Shrink_information(
Objects_Information *information
)
{
2009938: 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 );
200993c: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
block_count = (information->maximum - index_base) /
2009940: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3
2009944: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
2009948: 92 10 00 1b mov %i3, %o1
200994c: 40 00 3e 20 call 20191cc <.udiv>
2009950: 90 22 00 1c sub %o0, %i4, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2009954: 80 a2 20 00 cmp %o0, 0
2009958: 02 80 00 36 be 2009a30 <_Objects_Shrink_information+0xf8> <== NEVER TAKEN
200995c: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
2009960: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
2009964: c2 01 00 00 ld [ %g4 ], %g1
2009968: 80 a6 c0 01 cmp %i3, %g1
200996c: 02 80 00 0f be 20099a8 <_Objects_Shrink_information+0x70> <== NEVER TAKEN
2009970: 82 10 20 00 clr %g1
2009974: 10 80 00 07 b 2009990 <_Objects_Shrink_information+0x58>
2009978: ba 10 20 04 mov 4, %i5
200997c: c4 01 00 1d ld [ %g4 + %i5 ], %g2
2009980: 80 a6 c0 02 cmp %i3, %g2
2009984: 02 80 00 0a be 20099ac <_Objects_Shrink_information+0x74>
2009988: 86 07 60 04 add %i5, 4, %g3
200998c: 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++ ) {
2009990: 82 00 60 01 inc %g1
2009994: 80 a0 40 08 cmp %g1, %o0
2009998: 12 bf ff f9 bne 200997c <_Objects_Shrink_information+0x44>
200999c: b8 07 00 1b add %i4, %i3, %i4
20099a0: 81 c7 e0 08 ret
20099a4: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
20099a8: 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 );
20099ac: 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;
20099b0: d0 06 20 20 ld [ %i0 + 0x20 ], %o0
20099b4: 10 80 00 05 b 20099c8 <_Objects_Shrink_information+0x90>
20099b8: 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 );
20099bc: 90 96 e0 00 orcc %i3, 0, %o0
20099c0: 22 80 00 12 be,a 2009a08 <_Objects_Shrink_information+0xd0>
20099c4: 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 );
20099c8: c2 02 20 08 ld [ %o0 + 8 ], %g1
20099cc: 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) &&
20099d0: 80 a0 40 1c cmp %g1, %i4
20099d4: 0a bf ff fa bcs 20099bc <_Objects_Shrink_information+0x84>
20099d8: f6 02 00 00 ld [ %o0 ], %i3
(index < (index_base + information->allocation_size))) {
20099dc: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
20099e0: 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) &&
20099e4: 80 a0 40 02 cmp %g1, %g2
20099e8: 3a bf ff f6 bcc,a 20099c0 <_Objects_Shrink_information+0x88>
20099ec: 90 96 e0 00 orcc %i3, 0, %o0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
20099f0: 40 00 10 c5 call 200dd04 <_Chain_Extract>
20099f4: 01 00 00 00 nop
}
}
while ( the_object );
20099f8: 90 96 e0 00 orcc %i3, 0, %o0
20099fc: 32 bf ff f4 bne,a 20099cc <_Objects_Shrink_information+0x94><== ALWAYS TAKEN
2009a00: 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 ] );
2009a04: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
2009a08: 40 00 07 cb call 200b934 <_Workspace_Free>
2009a0c: d0 00 40 1d ld [ %g1 + %i5 ], %o0
information->object_blocks[ block ] = NULL;
2009a10: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
2009a14: 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;
2009a18: c0 20 40 1d clr [ %g1 + %i5 ]
information->inactive_per_block[ block ] = 0;
2009a1c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
2009a20: 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;
2009a24: c0 20 c0 1d clr [ %g3 + %i5 ]
information->inactive -= information->allocation_size;
2009a28: 82 20 80 01 sub %g2, %g1, %g1
2009a2c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
2009a30: 81 c7 e0 08 ret
2009a34: 81 e8 00 00 restore
0200fb78 <_POSIX_Keys_Run_destructors>:
*/
void _POSIX_Keys_Run_destructors(
Thread_Control *thread
)
{
200fb78: 9d e3 bf a0 save %sp, -96, %sp
Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id );
200fb7c: c2 06 20 08 ld [ %i0 + 8 ], %g1
for ( index = 1 ; index <= max ; ++index ) {
POSIX_Keys_Control *key = (POSIX_Keys_Control *)
_POSIX_Keys_Information.local_table [ index ];
if ( key != NULL && key->destructor != NULL ) {
void *value = key->Values [ thread_api ][ thread_index ];
200fb80: 35 00 00 3f sethi %hi(0xfc00), %i2
200fb84: b3 30 60 18 srl %g1, 0x18, %i1
200fb88: b4 16 a3 ff or %i2, 0x3ff, %i2
200fb8c: b2 0e 60 07 and %i1, 7, %i1
200fb90: b4 08 40 1a and %g1, %i2, %i2
200fb94: b2 06 60 04 add %i1, 4, %i1
200fb98: 3b 00 80 79 sethi %hi(0x201e400), %i5
200fb9c: b5 2e a0 02 sll %i2, 2, %i2
200fba0: ba 17 63 0c or %i5, 0x30c, %i5
200fba4: b3 2e 60 02 sll %i1, 2, %i1
Objects_Maximum index = 0;
Objects_Maximum max = _POSIX_Keys_Information.maximum;
done = true;
for ( index = 1 ; index <= max ; ++index ) {
200fba8: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1
200fbac: 80 a0 60 00 cmp %g1, 0
200fbb0: 02 80 00 21 be 200fc34 <_POSIX_Keys_Run_destructors+0xbc>
200fbb4: b8 10 20 01 mov 1, %i4
200fbb8: 86 10 20 01 mov 1, %g3
200fbbc: b6 10 00 01 mov %g1, %i3
POSIX_Keys_Control *key = (POSIX_Keys_Control *)
200fbc0: c8 07 60 1c ld [ %i5 + 0x1c ], %g4
_POSIX_Keys_Information.local_table [ index ];
200fbc4: 85 2f 20 10 sll %i4, 0x10, %g2
Objects_Maximum max = _POSIX_Keys_Information.maximum;
done = true;
for ( index = 1 ; index <= max ; ++index ) {
POSIX_Keys_Control *key = (POSIX_Keys_Control *)
200fbc8: 85 30 a0 0e srl %g2, 0xe, %g2
200fbcc: c4 01 00 02 ld [ %g4 + %g2 ], %g2
_POSIX_Keys_Information.local_table [ index ];
if ( key != NULL && key->destructor != NULL ) {
200fbd0: 80 a0 a0 00 cmp %g2, 0
200fbd4: 02 80 00 10 be 200fc14 <_POSIX_Keys_Run_destructors+0x9c>
200fbd8: 82 00 80 19 add %g2, %i1, %g1
200fbdc: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4
200fbe0: 80 a1 20 00 cmp %g4, 0
200fbe4: 22 80 00 0d be,a 200fc18 <_POSIX_Keys_Run_destructors+0xa0>
200fbe8: b8 07 20 01 inc %i4
void *value = key->Values [ thread_api ][ thread_index ];
200fbec: c8 00 60 04 ld [ %g1 + 4 ], %g4
200fbf0: d0 01 00 1a ld [ %g4 + %i2 ], %o0
if ( value != NULL ) {
200fbf4: 80 a2 20 00 cmp %o0, 0
200fbf8: 22 80 00 08 be,a 200fc18 <_POSIX_Keys_Run_destructors+0xa0><== ALWAYS TAKEN
200fbfc: b8 07 20 01 inc %i4
key->Values [ thread_api ][ thread_index ] = NULL;
200fc00: c0 21 00 1a clr [ %g4 + %i2 ] <== NOT EXECUTED
(*key->destructor)( value );
200fc04: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 <== NOT EXECUTED
200fc08: 9f c0 40 00 call %g1 <== NOT EXECUTED
200fc0c: 01 00 00 00 nop <== NOT EXECUTED
done = false;
200fc10: 86 10 20 00 clr %g3 ! 0 <PROM_START> <== NOT EXECUTED
Objects_Maximum index = 0;
Objects_Maximum max = _POSIX_Keys_Information.maximum;
done = true;
for ( index = 1 ; index <= max ; ++index ) {
200fc14: b8 07 20 01 inc %i4
200fc18: 85 2f 20 10 sll %i4, 0x10, %g2
200fc1c: 85 30 a0 10 srl %g2, 0x10, %g2
200fc20: 80 a6 c0 02 cmp %i3, %g2
200fc24: 1a bf ff e7 bcc 200fbc0 <_POSIX_Keys_Run_destructors+0x48>
200fc28: 80 88 e0 ff btst 0xff, %g3
* number of iterations. An infinite loop may happen if destructors set
* thread specific data. This can be considered dubious.
*
* Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99.
*/
while ( !done ) {
200fc2c: 22 bf ff e0 be,a 200fbac <_POSIX_Keys_Run_destructors+0x34><== NEVER TAKEN
200fc30: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 <== NOT EXECUTED
200fc34: 81 c7 e0 08 ret
200fc38: 81 e8 00 00 restore
0200ccec <_POSIX_Message_queue_Receive_support>:
size_t msg_len,
unsigned int *msg_prio,
bool wait,
Watchdog_Interval timeout
)
{
200ccec: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *_POSIX_Message_queue_Get_fd (
mqd_t id,
Objects_Locations *location
)
{
return (POSIX_Message_queue_Control_fd *) _Objects_Get(
200ccf0: 11 00 80 ad sethi %hi(0x202b400), %o0
200ccf4: 92 10 00 18 mov %i0, %o1
200ccf8: 90 12 22 a0 or %o0, 0x2a0, %o0
200ccfc: 40 00 0d 9f call 2010378 <_Objects_Get>
200cd00: 94 07 bf f8 add %fp, -8, %o2
Objects_Locations location;
size_t length_out;
bool do_wait;
the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location );
switch ( location ) {
200cd04: c2 07 bf f8 ld [ %fp + -8 ], %g1
200cd08: 80 a0 60 00 cmp %g1, 0
200cd0c: 22 80 00 08 be,a 200cd2c <_POSIX_Message_queue_Receive_support+0x40>
200cd10: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EBADF );
200cd14: 40 00 2a d5 call 2017868 <__errno>
200cd18: b0 10 3f ff mov -1, %i0
200cd1c: 82 10 20 09 mov 9, %g1
200cd20: c2 22 00 00 st %g1, [ %o0 ]
}
200cd24: 81 c7 e0 08 ret
200cd28: 81 e8 00 00 restore
the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location );
switch ( location ) {
case OBJECTS_LOCAL:
if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) {
200cd2c: 84 08 60 03 and %g1, 3, %g2
200cd30: 80 a0 a0 01 cmp %g2, 1
200cd34: 02 80 00 39 be 200ce18 <_POSIX_Message_queue_Receive_support+0x12c>
200cd38: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EBADF );
}
the_mq = the_mq_fd->Queue;
200cd3c: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
if ( msg_len < the_mq->Message_queue.maximum_message_size ) {
200cd40: c4 02 20 68 ld [ %o0 + 0x68 ], %g2
200cd44: 80 a0 80 1a cmp %g2, %i2
200cd48: 18 80 00 23 bgu 200cdd4 <_POSIX_Message_queue_Receive_support+0xe8>
200cd4c: 84 10 3f ff mov -1, %g2
/*
* Now if something goes wrong, we return a "length" of -1
* to indicate an error.
*/
length_out = -1;
200cd50: c4 27 bf fc st %g2, [ %fp + -4 ]
/*
* A timed receive with a bad time will do a poll regardless.
*/
if ( wait )
200cd54: 80 a7 20 00 cmp %i4, 0
200cd58: 12 80 00 1b bne 200cdc4 <_POSIX_Message_queue_Receive_support+0xd8>
200cd5c: 98 10 20 00 clr %o4
do_wait = wait;
/*
* Now perform the actual message receive
*/
_CORE_message_queue_Seize(
200cd60: 9a 10 00 1d mov %i5, %o5
200cd64: 90 02 20 1c add %o0, 0x1c, %o0
200cd68: 92 10 00 18 mov %i0, %o1
200cd6c: 94 10 00 19 mov %i1, %o2
200cd70: 96 07 bf fc add %fp, -4, %o3
200cd74: 40 00 09 04 call 200f184 <_CORE_message_queue_Seize>
200cd78: 98 0b 20 01 and %o4, 1, %o4
&length_out,
do_wait,
timeout
);
_Thread_Enable_dispatch();
200cd7c: 40 00 11 91 call 20113c0 <_Thread_Enable_dispatch>
200cd80: 3b 00 80 ad sethi %hi(0x202b400), %i5
if (msg_prio) {
200cd84: 80 a6 e0 00 cmp %i3, 0
*msg_prio = _POSIX_Message_queue_Priority_from_core(
_Thread_Executing->Wait.count
200cd88: ba 17 63 20 or %i5, 0x320, %i5
do_wait,
timeout
);
_Thread_Enable_dispatch();
if (msg_prio) {
200cd8c: 02 80 00 07 be 200cda8 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN
200cd90: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core(
CORE_message_queue_Submit_types priority
)
{
/* absolute value without a library dependency */
return (unsigned int) ((priority >= 0) ? priority : -priority);
200cd94: c6 00 60 24 ld [ %g1 + 0x24 ], %g3
200cd98: 85 38 e0 1f sra %g3, 0x1f, %g2
200cd9c: 86 18 80 03 xor %g2, %g3, %g3
200cda0: 84 20 c0 02 sub %g3, %g2, %g2
*msg_prio = _POSIX_Message_queue_Priority_from_core(
200cda4: c4 26 c0 00 st %g2, [ %i3 ]
_Thread_Executing->Wait.count
);
}
if ( !_Thread_Executing->Wait.return_code )
200cda8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
200cdac: 80 a0 60 00 cmp %g1, 0
200cdb0: 12 80 00 11 bne 200cdf4 <_POSIX_Message_queue_Receive_support+0x108>
200cdb4: 01 00 00 00 nop
return length_out;
200cdb8: f0 07 bf fc ld [ %fp + -4 ], %i0
200cdbc: 81 c7 e0 08 ret
200cdc0: 81 e8 00 00 restore
/*
* A timed receive with a bad time will do a poll regardless.
*/
if ( wait )
do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true;
200cdc4: 99 30 60 0e srl %g1, 0xe, %o4
200cdc8: 98 1b 20 01 xor %o4, 1, %o4
200cdcc: 10 bf ff e5 b 200cd60 <_POSIX_Message_queue_Receive_support+0x74>
200cdd0: 98 0b 20 01 and %o4, 1, %o4
}
the_mq = the_mq_fd->Queue;
if ( msg_len < the_mq->Message_queue.maximum_message_size ) {
_Thread_Enable_dispatch();
200cdd4: 40 00 11 7b call 20113c0 <_Thread_Enable_dispatch>
200cdd8: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EMSGSIZE );
200cddc: 40 00 2a a3 call 2017868 <__errno>
200cde0: 01 00 00 00 nop
200cde4: 82 10 20 7a mov 0x7a, %g1 ! 7a <PROM_START+0x7a>
200cde8: c2 22 00 00 st %g1, [ %o0 ]
200cdec: 81 c7 e0 08 ret
200cdf0: 81 e8 00 00 restore
}
if ( !_Thread_Executing->Wait.return_code )
return length_out;
rtems_set_errno_and_return_minus_one(
200cdf4: 40 00 2a 9d call 2017868 <__errno>
200cdf8: b0 10 3f ff mov -1, %i0
200cdfc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200ce00: b8 10 00 08 mov %o0, %i4
200ce04: 40 00 00 a2 call 200d08c <_POSIX_Message_queue_Translate_core_message_queue_return_code>
200ce08: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
200ce0c: d0 27 00 00 st %o0, [ %i4 ]
200ce10: 81 c7 e0 08 ret
200ce14: 81 e8 00 00 restore
the_mq_fd = _POSIX_Message_queue_Get_fd( mqdes, &location );
switch ( location ) {
case OBJECTS_LOCAL:
if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) {
_Thread_Enable_dispatch();
200ce18: 40 00 11 6a call 20113c0 <_Thread_Enable_dispatch>
200ce1c: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EBADF );
200ce20: 40 00 2a 92 call 2017868 <__errno>
200ce24: 01 00 00 00 nop
200ce28: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
200ce2c: c2 22 00 00 st %g1, [ %o0 ]
200ce30: 81 c7 e0 08 ret
200ce34: 81 e8 00 00 restore
0200f71c <_POSIX_Semaphore_Create_support>:
size_t name_len,
int pshared,
unsigned int value,
POSIX_Semaphore_Control **the_sem
)
{
200f71c: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Semaphore_Control *the_semaphore;
CORE_semaphore_Attributes *the_sem_attr;
char *name;
/* Sharing semaphores among processes is not currently supported */
if (pshared != 0)
200f720: 80 a6 a0 00 cmp %i2, 0
200f724: 12 80 00 2f bne 200f7e0 <_POSIX_Semaphore_Create_support+0xc4>
200f728: 03 00 80 8b sethi %hi(0x2022c00), %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;
200f72c: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
++level;
200f730: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
200f734: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
* _POSIX_Semaphore_Allocate
*/
RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Allocate( void )
{
return (POSIX_Semaphore_Control *)
200f738: 35 00 80 8c sethi %hi(0x2023000), %i2
200f73c: 7f ff ed b2 call 200ae04 <_Objects_Allocate>
200f740: 90 16 a0 a4 or %i2, 0xa4, %o0 ! 20230a4 <_POSIX_Semaphore_Information>
rtems_set_errno_and_return_minus_one( ENOSYS );
_Thread_Disable_dispatch();
the_semaphore = _POSIX_Semaphore_Allocate();
if ( !the_semaphore ) {
200f744: ba 92 20 00 orcc %o0, 0, %i5
200f748: 02 80 00 2c be 200f7f8 <_POSIX_Semaphore_Create_support+0xdc>
200f74c: 80 a6 20 00 cmp %i0, 0
/*
* Make a copy of the user's string for name just in case it was
* dynamically constructed.
*/
if ( name_arg != NULL ) {
200f750: 02 80 00 1e be 200f7c8 <_POSIX_Semaphore_Create_support+0xac>
200f754: 92 10 00 19 mov %i1, %o1
name = _Workspace_String_duplicate( name_arg, name_len );
200f758: 40 00 04 92 call 20109a0 <_Workspace_String_duplicate>
200f75c: 90 10 00 18 mov %i0, %o0
if ( !name ) {
200f760: b2 92 20 00 orcc %o0, 0, %i1
200f764: 02 80 00 2d be 200f818 <_POSIX_Semaphore_Create_support+0xfc><== NEVER TAKEN
200f768: 82 10 20 01 mov 1, %g1
}
the_semaphore->process_shared = pshared;
if ( name ) {
the_semaphore->named = true;
200f76c: 84 10 20 01 mov 1, %g2
}
} else {
name = NULL;
}
the_semaphore->process_shared = pshared;
200f770: c0 27 60 10 clr [ %i5 + 0x10 ]
if ( name ) {
the_semaphore->named = true;
200f774: c4 2f 60 14 stb %g2, [ %i5 + 0x14 ]
the_semaphore->open_count = 1;
200f778: c2 27 60 18 st %g1, [ %i5 + 0x18 ]
the_semaphore->linked = true;
200f77c: c2 2f 60 15 stb %g1, [ %i5 + 0x15 ]
the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO;
/*
* This effectively disables limit checking.
*/
the_sem_attr->maximum_count = 0xFFFFFFFF;
200f780: 82 10 3f ff mov -1, %g1
_CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value );
200f784: 90 07 60 1c add %i5, 0x1c, %o0
200f788: 92 07 60 5c add %i5, 0x5c, %o1
200f78c: 94 10 00 1b mov %i3, %o2
the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO;
/*
* This effectively disables limit checking.
*/
the_sem_attr->maximum_count = 0xFFFFFFFF;
200f790: c2 27 60 5c st %g1, [ %i5 + 0x5c ]
_CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value );
200f794: 7f ff eb f9 call 200a778 <_CORE_semaphore_Initialize>
200f798: c0 27 60 60 clr [ %i5 + 0x60 ]
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
200f79c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200f7a0: b4 16 a0 a4 or %i2, 0xa4, %i2
200f7a4: c4 06 a0 1c ld [ %i2 + 0x1c ], %g2
200f7a8: 83 28 60 02 sll %g1, 2, %g1
200f7ac: fa 20 80 01 st %i5, [ %g2 + %g1 ]
the_object
);
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
/* ASSERT: information->is_string */
the_object->name.name_p = name;
200f7b0: f2 27 60 0c st %i1, [ %i5 + 0xc ]
&_POSIX_Semaphore_Information,
&the_semaphore->Object,
name
);
*the_sem = the_semaphore;
200f7b4: fa 27 00 00 st %i5, [ %i4 ]
_Thread_Enable_dispatch();
200f7b8: 7f ff f3 16 call 200c410 <_Thread_Enable_dispatch>
200f7bc: b0 10 20 00 clr %i0
return 0;
200f7c0: 81 c7 e0 08 ret
200f7c4: 81 e8 00 00 restore
}
} else {
name = NULL;
}
the_semaphore->process_shared = pshared;
200f7c8: c0 27 60 10 clr [ %i5 + 0x10 ]
if ( name ) {
the_semaphore->named = true;
the_semaphore->open_count = 1;
the_semaphore->linked = true;
} else {
the_semaphore->named = false;
200f7cc: c0 2f 60 14 clrb [ %i5 + 0x14 ]
the_semaphore->open_count = 0;
200f7d0: c0 27 60 18 clr [ %i5 + 0x18 ]
the_semaphore->linked = false;
200f7d4: c0 2f 60 15 clrb [ %i5 + 0x15 ]
_POSIX_Semaphore_Free( the_semaphore );
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( ENOMEM );
}
} else {
name = NULL;
200f7d8: 10 bf ff ea b 200f780 <_POSIX_Semaphore_Create_support+0x64>
200f7dc: b2 10 20 00 clr %i1
CORE_semaphore_Attributes *the_sem_attr;
char *name;
/* Sharing semaphores among processes is not currently supported */
if (pshared != 0)
rtems_set_errno_and_return_minus_one( ENOSYS );
200f7e0: 40 00 0a c5 call 20122f4 <__errno>
200f7e4: b0 10 3f ff mov -1, %i0
200f7e8: 82 10 20 58 mov 0x58, %g1
200f7ec: c2 22 00 00 st %g1, [ %o0 ]
200f7f0: 81 c7 e0 08 ret
200f7f4: 81 e8 00 00 restore
_Thread_Disable_dispatch();
the_semaphore = _POSIX_Semaphore_Allocate();
if ( !the_semaphore ) {
_Thread_Enable_dispatch();
200f7f8: 7f ff f3 06 call 200c410 <_Thread_Enable_dispatch>
200f7fc: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( ENOSPC );
200f800: 40 00 0a bd call 20122f4 <__errno>
200f804: 01 00 00 00 nop
200f808: 82 10 20 1c mov 0x1c, %g1 ! 1c <PROM_START+0x1c>
200f80c: c2 22 00 00 st %g1, [ %o0 ]
200f810: 81 c7 e0 08 ret
200f814: 81 e8 00 00 restore
RTEMS_INLINE_ROUTINE void _POSIX_Semaphore_Free (
POSIX_Semaphore_Control *the_semaphore
)
{
_Objects_Free( &_POSIX_Semaphore_Information, &the_semaphore->Object );
200f818: 90 16 a0 a4 or %i2, 0xa4, %o0 <== NOT EXECUTED
200f81c: 7f ff ee 72 call 200b1e4 <_Objects_Free> <== NOT EXECUTED
200f820: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED
*/
if ( name_arg != NULL ) {
name = _Workspace_String_duplicate( name_arg, name_len );
if ( !name ) {
_POSIX_Semaphore_Free( the_semaphore );
_Thread_Enable_dispatch();
200f824: 7f ff f2 fb call 200c410 <_Thread_Enable_dispatch> <== NOT EXECUTED
200f828: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED
rtems_set_errno_and_return_minus_one( ENOMEM );
200f82c: 40 00 0a b2 call 20122f4 <__errno> <== NOT EXECUTED
200f830: 01 00 00 00 nop <== NOT EXECUTED
200f834: 82 10 20 0c mov 0xc, %g1 ! c <PROM_START+0xc> <== NOT EXECUTED
200f838: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
200f83c: 81 c7 e0 08 ret <== NOT EXECUTED
200f840: 81 e8 00 00 restore <== NOT EXECUTED
0200d1c8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch>:
Thread_Control *the_thread
)
{
POSIX_API_Control *thread_support;
thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ];
200d1c8: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
200d1cc: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2
200d1d0: 80 a0 a0 00 cmp %g2, 0
200d1d4: 12 80 00 06 bne 200d1ec <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN
200d1d8: 01 00 00 00 nop
200d1dc: c4 00 60 dc ld [ %g1 + 0xdc ], %g2
200d1e0: 80 a0 a0 01 cmp %g2, 1
200d1e4: 22 80 00 05 be,a 200d1f8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30>
200d1e8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1
thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS &&
thread_support->cancelation_requested ) {
_Thread_Unnest_dispatch();
_POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED );
} else
_Thread_Enable_dispatch();
200d1ec: 82 13 c0 00 mov %o7, %g1
200d1f0: 7f ff f5 ad call 200a8a4 <_Thread_Enable_dispatch>
200d1f4: 9e 10 40 00 mov %g1, %o7
POSIX_API_Control *thread_support;
thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS &&
200d1f8: 80 a0 60 00 cmp %g1, 0
200d1fc: 02 bf ff fc be 200d1ec <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24>
200d200: 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;
200d204: 03 00 80 7a sethi %hi(0x201e800), %g1
200d208: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 ! 201e850 <_Thread_Dispatch_disable_level>
thread_support->cancelation_requested ) {
_Thread_Unnest_dispatch();
_POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED );
200d20c: 92 10 3f ff mov -1, %o1
--level;
200d210: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
200d214: c4 20 60 50 st %g2, [ %g1 + 0x50 ]
200d218: 82 13 c0 00 mov %o7, %g1
200d21c: 40 00 01 d9 call 200d980 <_POSIX_Thread_Exit>
200d220: 9e 10 40 00 mov %g1, %o7
0200e6c4 <_POSIX_Thread_Translate_sched_param>:
int policy,
struct sched_param *param,
Thread_CPU_budget_algorithms *budget_algorithm,
Thread_CPU_budget_algorithm_callout *budget_callout
)
{
200e6c4: 9d e3 bf a0 save %sp, -96, %sp
if ( !_POSIX_Priority_Is_valid( param->sched_priority ) )
200e6c8: 7f ff ff f2 call 200e690 <_POSIX_Priority_Is_valid>
200e6cc: d0 06 40 00 ld [ %i1 ], %o0
200e6d0: 80 8a 20 ff btst 0xff, %o0
200e6d4: 32 80 00 04 bne,a 200e6e4 <_POSIX_Thread_Translate_sched_param+0x20><== ALWAYS TAKEN
200e6d8: c0 26 80 00 clr [ %i2 ]
return EINVAL;
200e6dc: 81 c7 e0 08 ret
200e6e0: 91 e8 20 16 restore %g0, 0x16, %o0
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
*budget_callout = NULL;
if ( policy == SCHED_OTHER ) {
200e6e4: 80 a6 20 00 cmp %i0, 0
200e6e8: 02 80 00 2c be 200e798 <_POSIX_Thread_Translate_sched_param+0xd4>
200e6ec: c0 26 c0 00 clr [ %i3 ]
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
return 0;
}
if ( policy == SCHED_FIFO ) {
200e6f0: 80 a6 20 01 cmp %i0, 1
200e6f4: 02 80 00 2d be 200e7a8 <_POSIX_Thread_Translate_sched_param+0xe4>
200e6f8: 80 a6 20 02 cmp %i0, 2
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
return 0;
}
if ( policy == SCHED_RR ) {
200e6fc: 02 80 00 2d be 200e7b0 <_POSIX_Thread_Translate_sched_param+0xec>
200e700: 80 a6 20 04 cmp %i0, 4
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE;
return 0;
}
if ( policy == SCHED_SPORADIC ) {
200e704: 12 bf ff f6 bne 200e6dc <_POSIX_Thread_Translate_sched_param+0x18>
200e708: 01 00 00 00 nop
if ( (param->sched_ss_repl_period.tv_sec == 0) &&
200e70c: c2 06 60 08 ld [ %i1 + 8 ], %g1
200e710: 80 a0 60 00 cmp %g1, 0
200e714: 32 80 00 07 bne,a 200e730 <_POSIX_Thread_Translate_sched_param+0x6c>
200e718: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200e71c: c2 06 60 0c ld [ %i1 + 0xc ], %g1
200e720: 80 a0 60 00 cmp %g1, 0
200e724: 02 bf ff ee be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18>
200e728: 01 00 00 00 nop
(param->sched_ss_repl_period.tv_nsec == 0) )
return EINVAL;
if ( (param->sched_ss_init_budget.tv_sec == 0) &&
200e72c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200e730: 80 a0 60 00 cmp %g1, 0
200e734: 12 80 00 06 bne 200e74c <_POSIX_Thread_Translate_sched_param+0x88>
200e738: 01 00 00 00 nop
200e73c: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200e740: 80 a0 60 00 cmp %g1, 0
200e744: 02 bf ff e6 be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18>
200e748: 01 00 00 00 nop
(param->sched_ss_init_budget.tv_nsec == 0) )
return EINVAL;
if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) <
200e74c: 7f ff f6 cc call 200c27c <_Timespec_To_ticks>
200e750: 90 06 60 08 add %i1, 8, %o0
200e754: ba 10 00 08 mov %o0, %i5
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
200e758: 7f ff f6 c9 call 200c27c <_Timespec_To_ticks>
200e75c: 90 06 60 10 add %i1, 0x10, %o0
if ( (param->sched_ss_init_budget.tv_sec == 0) &&
(param->sched_ss_init_budget.tv_nsec == 0) )
return EINVAL;
if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) <
200e760: 80 a7 40 08 cmp %i5, %o0
200e764: 0a bf ff de bcs 200e6dc <_POSIX_Thread_Translate_sched_param+0x18>
200e768: 01 00 00 00 nop
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
return EINVAL;
if ( !_POSIX_Priority_Is_valid( param->sched_ss_low_priority ) )
200e76c: 7f ff ff c9 call 200e690 <_POSIX_Priority_Is_valid>
200e770: d0 06 60 04 ld [ %i1 + 4 ], %o0
200e774: 80 8a 20 ff btst 0xff, %o0
200e778: 02 bf ff d9 be 200e6dc <_POSIX_Thread_Translate_sched_param+0x18>
200e77c: 82 10 20 03 mov 3, %g1
return EINVAL;
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT;
200e780: c2 26 80 00 st %g1, [ %i2 ]
*budget_callout = _POSIX_Threads_Sporadic_budget_callout;
200e784: 03 00 80 20 sethi %hi(0x2008000), %g1
200e788: 82 10 61 70 or %g1, 0x170, %g1 ! 2008170 <_POSIX_Threads_Sporadic_budget_callout>
200e78c: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
200e790: 81 c7 e0 08 ret
200e794: 91 e8 20 00 restore %g0, 0, %o0
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
*budget_callout = NULL;
if ( policy == SCHED_OTHER ) {
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
200e798: 82 10 20 01 mov 1, %g1
200e79c: c2 26 80 00 st %g1, [ %i2 ]
return 0;
200e7a0: 81 c7 e0 08 ret
200e7a4: 81 e8 00 00 restore
*budget_callout = _POSIX_Threads_Sporadic_budget_callout;
return 0;
}
return EINVAL;
}
200e7a8: 81 c7 e0 08 ret
200e7ac: 91 e8 20 00 restore %g0, 0, %o0
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
return 0;
}
if ( policy == SCHED_RR ) {
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE;
200e7b0: f0 26 80 00 st %i0, [ %i2 ]
return 0;
200e7b4: 81 c7 e0 08 ret
200e7b8: 91 e8 20 00 restore %g0, 0, %o0
0200d508 <_POSIX_Threads_Delete_extension>:
*/
static void _POSIX_Threads_Delete_extension(
Thread_Control *executing __attribute__((unused)),
Thread_Control *deleted
)
{
200d508: 9d e3 bf a0 save %sp, -96, %sp
Thread_Control *the_thread;
POSIX_API_Control *api;
void **value_ptr;
api = deleted->API_Extensions[ THREAD_API_POSIX ];
200d50c: f0 06 61 5c ld [ %i1 + 0x15c ], %i0
/*
* Run the POSIX cancellation handlers
*/
_POSIX_Threads_cancel_run( deleted );
200d510: 40 00 09 7e call 200fb08 <_POSIX_Threads_cancel_run>
200d514: 90 10 00 19 mov %i1, %o0
/*
* Run all the key destructors
*/
_POSIX_Keys_Run_destructors( deleted );
200d518: 90 10 00 19 mov %i1, %o0
200d51c: 40 00 09 97 call 200fb78 <_POSIX_Keys_Run_destructors>
200d520: ba 06 20 44 add %i0, 0x44, %i5
/*
* Wakeup all the tasks which joined with this one
*/
value_ptr = (void **) deleted->Wait.return_argument;
while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) )
200d524: 10 80 00 03 b 200d530 <_POSIX_Threads_Delete_extension+0x28>
200d528: f8 06 60 28 ld [ %i1 + 0x28 ], %i4
*(void **)the_thread->Wait.return_argument = value_ptr;
200d52c: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED
/*
* Wakeup all the tasks which joined with this one
*/
value_ptr = (void **) deleted->Wait.return_argument;
while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) )
200d530: 7f ff f5 7c call 200ab20 <_Thread_queue_Dequeue>
200d534: 90 10 00 1d mov %i5, %o0
200d538: 80 a2 20 00 cmp %o0, 0
200d53c: 32 bf ff fc bne,a 200d52c <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN
200d540: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED
*(void **)the_thread->Wait.return_argument = value_ptr;
if ( api->schedpolicy == SCHED_SPORADIC )
200d544: c2 06 20 84 ld [ %i0 + 0x84 ], %g1
200d548: 80 a0 60 04 cmp %g1, 4
200d54c: 02 80 00 05 be 200d560 <_POSIX_Threads_Delete_extension+0x58>
200d550: 01 00 00 00 nop
(void) _Watchdog_Remove( &api->Sporadic_timer );
deleted->API_Extensions[ THREAD_API_POSIX ] = NULL;
200d554: c0 26 61 5c clr [ %i1 + 0x15c ]
_Workspace_Free( api );
200d558: 7f ff f8 f7 call 200b934 <_Workspace_Free>
200d55c: 81 e8 00 00 restore
while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) )
*(void **)the_thread->Wait.return_argument = value_ptr;
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
200d560: 7f ff f8 37 call 200b63c <_Watchdog_Remove>
200d564: 90 06 20 a8 add %i0, 0xa8, %o0
deleted->API_Extensions[ THREAD_API_POSIX ] = NULL;
200d568: c0 26 61 5c clr [ %i1 + 0x15c ]
_Workspace_Free( api );
200d56c: 7f ff f8 f2 call 200b934 <_Workspace_Free>
200d570: 81 e8 00 00 restore
02007e84 <_POSIX_Threads_Initialize_user_threads_body>:
#include <rtems/posix/config.h>
#include <rtems/posix/key.h>
#include <rtems/posix/time.h>
void _POSIX_Threads_Initialize_user_threads_body(void)
{
2007e84: 9d e3 bf 58 save %sp, -168, %sp
uint32_t maximum;
posix_initialization_threads_table *user_threads;
pthread_t thread_id;
pthread_attr_t attr;
user_threads = Configuration_POSIX_API.User_initialization_threads_table;
2007e88: 03 00 80 89 sethi %hi(0x2022400), %g1
2007e8c: 82 10 61 c4 or %g1, 0x1c4, %g1 ! 20225c4 <Configuration_POSIX_API>
maximum = Configuration_POSIX_API.number_of_initialization_threads;
2007e90: f6 00 60 30 ld [ %g1 + 0x30 ], %i3
if ( !user_threads || maximum == 0 )
2007e94: 80 a6 e0 00 cmp %i3, 0
2007e98: 02 80 00 18 be 2007ef8 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
2007e9c: fa 00 60 34 ld [ %g1 + 0x34 ], %i5
2007ea0: 80 a7 60 00 cmp %i5, 0
2007ea4: 02 80 00 15 be 2007ef8 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
2007ea8: b8 10 20 00 clr %i4
for ( index=0 ; index < maximum ; index++ ) {
/*
* There is no way for these calls to fail in this situation.
*/
(void) pthread_attr_init( &attr );
2007eac: 40 00 1a 44 call 200e7bc <pthread_attr_init>
2007eb0: 90 07 bf c0 add %fp, -64, %o0
(void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED );
2007eb4: 92 10 20 02 mov 2, %o1
2007eb8: 40 00 1a 4d call 200e7ec <pthread_attr_setinheritsched>
2007ebc: 90 07 bf c0 add %fp, -64, %o0
(void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size);
2007ec0: d2 07 60 04 ld [ %i5 + 4 ], %o1
2007ec4: 40 00 1a 5a call 200e82c <pthread_attr_setstacksize>
2007ec8: 90 07 bf c0 add %fp, -64, %o0
status = pthread_create(
2007ecc: d4 07 40 00 ld [ %i5 ], %o2
2007ed0: 90 07 bf bc add %fp, -68, %o0
2007ed4: 92 07 bf c0 add %fp, -64, %o1
2007ed8: 7f ff ff 00 call 2007ad8 <pthread_create>
2007edc: 96 10 20 00 clr %o3
&thread_id,
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
2007ee0: 94 92 20 00 orcc %o0, 0, %o2
2007ee4: 12 80 00 07 bne 2007f00 <_POSIX_Threads_Initialize_user_threads_body+0x7c>
2007ee8: b8 07 20 01 inc %i4
*
* Setting the attributes explicitly is critical, since we don't want
* to inherit the idle tasks attributes.
*/
for ( index=0 ; index < maximum ; index++ ) {
2007eec: 80 a7 00 1b cmp %i4, %i3
2007ef0: 12 bf ff ef bne 2007eac <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN
2007ef4: ba 07 60 08 add %i5, 8, %i5
2007ef8: 81 c7 e0 08 ret
2007efc: 81 e8 00 00 restore
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
_Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status );
2007f00: 90 10 20 02 mov 2, %o0
2007f04: 40 00 08 8b call 200a130 <_Internal_error_Occurred>
2007f08: 92 10 20 01 mov 1, %o1
0200d694 <_POSIX_Threads_Sporadic_budget_TSR>:
*/
void _POSIX_Threads_Sporadic_budget_TSR(
Objects_Id id __attribute__((unused)),
void *argument
)
{
200d694: 9d e3 bf a0 save %sp, -96, %sp
Thread_Control *the_thread;
POSIX_API_Control *api;
the_thread = argument;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200d698: fa 06 61 5c ld [ %i1 + 0x15c ], %i5
/* ticks is guaranteed to be at least one */
ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget );
200d69c: 40 00 04 3d call 200e790 <_Timespec_To_ticks>
200d6a0: 90 07 60 98 add %i5, 0x98, %o0
RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core(
int priority
)
{
return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1);
200d6a4: c4 07 60 88 ld [ %i5 + 0x88 ], %g2
200d6a8: 03 00 80 75 sethi %hi(0x201d400), %g1
200d6ac: d2 08 62 7c ldub [ %g1 + 0x27c ], %o1 ! 201d67c <rtems_maximum_priority>
*/
#if 0
printk( "TSR %d %d %d\n", the_thread->resource_count,
the_thread->current_priority, new_priority );
#endif
if ( the_thread->resource_count == 0 ) {
200d6b0: c2 06 60 1c ld [ %i1 + 0x1c ], %g1
200d6b4: 92 22 40 02 sub %o1, %g2, %o1
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
/* ticks is guaranteed to be at least one */
ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_init_budget );
the_thread->cpu_time_budget = ticks;
200d6b8: d0 26 60 74 st %o0, [ %i1 + 0x74 ]
*/
#if 0
printk( "TSR %d %d %d\n", the_thread->resource_count,
the_thread->current_priority, new_priority );
#endif
if ( the_thread->resource_count == 0 ) {
200d6bc: 80 a0 60 00 cmp %g1, 0
200d6c0: 12 80 00 06 bne 200d6d8 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN
200d6c4: d2 26 60 18 st %o1, [ %i1 + 0x18 ]
/*
* If this would make them less important, then do not change it.
*/
if ( the_thread->current_priority > new_priority ) {
200d6c8: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200d6cc: 80 a0 40 09 cmp %g1, %o1
200d6d0: 18 80 00 09 bgu 200d6f4 <_POSIX_Threads_Sporadic_budget_TSR+0x60>
200d6d4: 90 10 00 19 mov %i1, %o0
#endif
}
}
/* ticks is guaranteed to be at least one */
ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period );
200d6d8: 90 07 60 90 add %i5, 0x90, %o0
200d6dc: 40 00 04 2d call 200e790 <_Timespec_To_ticks>
200d6e0: 31 00 80 78 sethi %hi(0x201e000), %i0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200d6e4: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200d6e8: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200d6ec: 7f ff f7 75 call 200b4c0 <_Watchdog_Insert>
200d6f0: 91 ee 23 bc restore %i0, 0x3bc, %o0
if ( the_thread->resource_count == 0 ) {
/*
* If this would make them less important, then do not change it.
*/
if ( the_thread->current_priority > new_priority ) {
_Thread_Change_priority( the_thread, new_priority, true );
200d6f4: 7f ff f2 cf call 200a230 <_Thread_Change_priority>
200d6f8: 94 10 20 01 mov 1, %o2
#endif
}
}
/* ticks is guaranteed to be at least one */
ticks = _Timespec_To_ticks( &api->schedparam.sched_ss_repl_period );
200d6fc: 90 07 60 90 add %i5, 0x90, %o0
200d700: 40 00 04 24 call 200e790 <_Timespec_To_ticks>
200d704: 31 00 80 78 sethi %hi(0x201e000), %i0
200d708: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200d70c: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200d710: 7f ff f7 6c call 200b4c0 <_Watchdog_Insert>
200d714: 91 ee 23 bc restore %i0, 0x3bc, %o0
0200d718 <_POSIX_Threads_Sporadic_budget_callout>:
)
{
POSIX_API_Control *api;
uint32_t new_priority;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200d718: c4 02 21 5c ld [ %o0 + 0x15c ], %g2
200d71c: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3
200d720: 05 00 80 75 sethi %hi(0x201d400), %g2
200d724: d2 08 a2 7c ldub [ %g2 + 0x27c ], %o1 ! 201d67c <rtems_maximum_priority>
*/
#if 0
printk( "callout %d %d %d\n", the_thread->resource_count,
the_thread->current_priority, new_priority );
#endif
if ( the_thread->resource_count == 0 ) {
200d728: c4 02 20 1c ld [ %o0 + 0x1c ], %g2
200d72c: 92 22 40 03 sub %o1, %g3, %o1
/*
* This will prevent the thread from consuming its entire "budget"
* while at low priority.
*/
the_thread->cpu_time_budget = 0xFFFFFFFF; /* XXX should be based on MAX_U32 */
200d730: 86 10 3f ff mov -1, %g3
new_priority = _POSIX_Priority_To_core(api->schedparam.sched_ss_low_priority);
the_thread->real_priority = new_priority;
200d734: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
*/
#if 0
printk( "callout %d %d %d\n", the_thread->resource_count,
the_thread->current_priority, new_priority );
#endif
if ( the_thread->resource_count == 0 ) {
200d738: 80 a0 a0 00 cmp %g2, 0
200d73c: 12 80 00 06 bne 200d754 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN
200d740: c6 22 20 74 st %g3, [ %o0 + 0x74 ]
/*
* Make sure we are actually lowering it. If they have lowered it
* to logically lower than sched_ss_low_priority, then we do not want to
* change it.
*/
if ( the_thread->current_priority < new_priority ) {
200d744: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200d748: 80 a0 40 09 cmp %g1, %o1
200d74c: 0a 80 00 04 bcs 200d75c <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN
200d750: 94 10 20 01 mov 1, %o2
200d754: 81 c3 e0 08 retl <== NOT EXECUTED
200d758: 01 00 00 00 nop <== NOT EXECUTED
_Thread_Change_priority( the_thread, new_priority, true );
200d75c: 82 13 c0 00 mov %o7, %g1
200d760: 7f ff f2 b4 call 200a230 <_Thread_Change_priority>
200d764: 9e 10 40 00 mov %g1, %o7
0200fb08 <_POSIX_Threads_cancel_run>:
#include <rtems/posix/threadsup.h>
void _POSIX_Threads_cancel_run(
Thread_Control *the_thread
)
{
200fb08: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Cancel_Handler_control *handler;
Chain_Control *handler_stack;
POSIX_API_Control *thread_support;
ISR_Level level;
thread_support = the_thread->API_Extensions[ THREAD_API_POSIX ];
200fb0c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
handler_stack = &thread_support->Cancellation_Handlers;
thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE;
200fb10: 84 10 20 01 mov 1, %g2
while ( !_Chain_Is_empty( handler_stack ) ) {
200fb14: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200fb18: b6 07 20 e8 add %i4, 0xe8, %i3
200fb1c: 80 a0 40 1b cmp %g1, %i3
200fb20: 02 80 00 14 be 200fb70 <_POSIX_Threads_cancel_run+0x68>
200fb24: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ]
_ISR_Disable( level );
200fb28: 7f ff ca b9 call 200260c <sparc_disable_interrupts>
200fb2c: 01 00 00 00 nop
handler = (POSIX_Cancel_Handler_control *)
200fb30: fa 07 20 ec ld [ %i4 + 0xec ], %i5
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
200fb34: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
200fb38: c2 07 60 04 ld [ %i5 + 4 ], %g1
next->previous = previous;
200fb3c: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
200fb40: c4 20 40 00 st %g2, [ %g1 ]
_Chain_Tail( handler_stack )->previous;
_Chain_Extract_unprotected( &handler->Node );
_ISR_Enable( level );
200fb44: 7f ff ca b6 call 200261c <sparc_enable_interrupts>
200fb48: 01 00 00 00 nop
(*handler->routine)( handler->arg );
200fb4c: c2 07 60 08 ld [ %i5 + 8 ], %g1
200fb50: 9f c0 40 00 call %g1
200fb54: d0 07 60 0c ld [ %i5 + 0xc ], %o0
_Workspace_Free( handler );
200fb58: 7f ff ef 77 call 200b934 <_Workspace_Free>
200fb5c: 90 10 00 1d mov %i5, %o0
handler_stack = &thread_support->Cancellation_Handlers;
thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE;
while ( !_Chain_Is_empty( handler_stack ) ) {
200fb60: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1
200fb64: 80 a0 40 1b cmp %g1, %i3
200fb68: 12 bf ff f0 bne 200fb28 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN
200fb6c: 01 00 00 00 nop
200fb70: 81 c7 e0 08 ret
200fb74: 81 e8 00 00 restore
02007920 <_POSIX_Timer_TSR>:
* This is the operation that is run when a timer expires
*/
void _POSIX_Timer_TSR(
Objects_Id timer __attribute__((unused)),
void *data)
{
2007920: 9d e3 bf 98 save %sp, -104, %sp
bool activated;
ptimer = (POSIX_Timer_Control *)data;
/* Increment the number of expirations. */
ptimer->overrun = ptimer->overrun + 1;
2007924: c4 06 60 68 ld [ %i1 + 0x68 ], %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
2007928: c2 06 60 54 ld [ %i1 + 0x54 ], %g1
bool activated;
ptimer = (POSIX_Timer_Control *)data;
/* Increment the number of expirations. */
ptimer->overrun = ptimer->overrun + 1;
200792c: 84 00 a0 01 inc %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
2007930: 80 a0 60 00 cmp %g1, 0
2007934: 12 80 00 0e bne 200796c <_POSIX_Timer_TSR+0x4c>
2007938: c4 26 60 68 st %g2, [ %i1 + 0x68 ]
200793c: c2 06 60 58 ld [ %i1 + 0x58 ], %g1
2007940: 80 a0 60 00 cmp %g1, 0
2007944: 32 80 00 0b bne,a 2007970 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN
2007948: d2 06 60 64 ld [ %i1 + 0x64 ], %o1
/* The state really did not change but just to be safe */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
} else {
/* Indicates that the timer is stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
200794c: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED
2007950: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] <== NOT EXECUTED
/*
* The sending of the signal to the process running the handling function
* specified for that signal is simulated
*/
if ( pthread_kill ( ptimer->thread_id, ptimer->inf.sigev_signo ) ) {
2007954: d0 06 60 38 ld [ %i1 + 0x38 ], %o0
2007958: 40 00 18 b2 call 200dc20 <pthread_kill>
200795c: d2 06 60 44 ld [ %i1 + 0x44 ], %o1
}
/* After the signal handler returns, the count of expirations of the
* timer must be set to 0.
*/
ptimer->overrun = 0;
2007960: c0 26 60 68 clr [ %i1 + 0x68 ]
2007964: 81 c7 e0 08 ret
2007968: 81 e8 00 00 restore
ptimer->overrun = ptimer->overrun + 1;
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) {
activated = _POSIX_Timer_Insert_helper(
200796c: d2 06 60 64 ld [ %i1 + 0x64 ], %o1
2007970: d4 06 60 08 ld [ %i1 + 8 ], %o2
2007974: 90 06 60 10 add %i1, 0x10, %o0
2007978: 98 10 00 19 mov %i1, %o4
200797c: 17 00 80 1e sethi %hi(0x2007800), %o3
2007980: 40 00 19 cf call 200e0bc <_POSIX_Timer_Insert_helper>
2007984: 96 12 e1 20 or %o3, 0x120, %o3 ! 2007920 <_POSIX_Timer_TSR>
ptimer->ticks,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated )
2007988: 80 8a 20 ff btst 0xff, %o0
200798c: 02 bf ff f6 be 2007964 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN
2007990: 90 07 bf f8 add %fp, -8, %o0
2007994: 13 00 80 7b sethi %hi(0x201ec00), %o1
2007998: 40 00 06 3b call 2009284 <_TOD_Get_with_nanoseconds>
200799c: 92 12 61 98 or %o1, 0x198, %o1 ! 201ed98 <_TOD>
/* After the signal handler returns, the count of expirations of the
* timer must be set to 0.
*/
ptimer->overrun = 0;
}
20079a0: f8 1a 00 00 ldd [ %o0 ], %i4
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
20079a4: 94 10 20 00 clr %o2
20079a8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
20079ac: 90 10 00 1c mov %i4, %o0
20079b0: 96 12 e2 00 or %o3, 0x200, %o3
20079b4: 40 00 4a 95 call 201a408 <__divdi3>
20079b8: 92 10 00 1d mov %i5, %o1
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
20079bc: 94 10 20 00 clr %o2
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
20079c0: d2 26 60 6c st %o1, [ %i1 + 0x6c ]
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
20079c4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
20079c8: 90 10 00 1c mov %i4, %o0
20079cc: 96 12 e2 00 or %o3, 0x200, %o3
20079d0: 40 00 4b 79 call 201a7b4 <__moddi3>
20079d4: 92 10 00 1d mov %i5, %o1
/* Store the time when the timer was started again */
_TOD_Get( &ptimer->time );
/* The state really did not change but just to be safe */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
20079d8: 82 10 20 03 mov 3, %g1
20079dc: d2 26 60 70 st %o1, [ %i1 + 0x70 ]
20079e0: 10 bf ff dd b 2007954 <_POSIX_Timer_TSR+0x34>
20079e4: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ]
0200fc3c <_POSIX_signals_Check_signal>:
bool _POSIX_signals_Check_signal(
POSIX_API_Control *api,
int signo,
bool is_global
)
{
200fc3c: 9d e3 bf 68 save %sp, -152, %sp
siginfo_t siginfo_struct;
sigset_t saved_signals_blocked;
Thread_Wait_information stored_thread_wait_information;
if ( ! _POSIX_signals_Clear_signals( api, signo, &siginfo_struct,
200fc40: 98 10 20 01 mov 1, %o4
200fc44: 90 10 00 18 mov %i0, %o0
200fc48: 92 10 00 19 mov %i1, %o1
200fc4c: 94 07 bf cc add %fp, -52, %o2
200fc50: 40 00 00 2e call 200fd08 <_POSIX_signals_Clear_signals>
200fc54: 96 10 00 1a mov %i2, %o3
200fc58: 80 8a 20 ff btst 0xff, %o0
200fc5c: 02 80 00 23 be 200fce8 <_POSIX_signals_Check_signal+0xac>
200fc60: 82 10 20 00 clr %g1
#endif
/*
* Just to prevent sending a signal which is currently being ignored.
*/
if ( _POSIX_signals_Vectors[ signo ].sa_handler == SIG_IGN )
200fc64: 85 2e 60 02 sll %i1, 2, %g2
200fc68: 37 00 80 7a sethi %hi(0x201e800), %i3
200fc6c: b9 2e 60 04 sll %i1, 4, %i4
200fc70: b6 16 e0 a0 or %i3, 0xa0, %i3
200fc74: b8 27 00 02 sub %i4, %g2, %i4
200fc78: 84 06 c0 1c add %i3, %i4, %g2
200fc7c: fa 00 a0 08 ld [ %g2 + 8 ], %i5
200fc80: 80 a7 60 01 cmp %i5, 1
200fc84: 02 80 00 19 be 200fce8 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN
200fc88: 21 00 80 7a sethi %hi(0x201e800), %l0
return false;
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
200fc8c: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200fc90: c2 00 a0 04 ld [ %g2 + 4 ], %g1
/*
* We have to save the blocking information of the current wait queue
* because the signal handler may subsequently go on and put the thread
* on a wait queue, for its own purposes.
*/
memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait,
200fc94: a0 14 20 40 or %l0, 0x40, %l0
200fc98: d2 04 20 10 ld [ %l0 + 0x10 ], %o1
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200fc9c: 82 10 40 1a or %g1, %i2, %g1
/*
* We have to save the blocking information of the current wait queue
* because the signal handler may subsequently go on and put the thread
* on a wait queue, for its own purposes.
*/
memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait,
200fca0: 90 07 bf d8 add %fp, -40, %o0
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200fca4: c2 26 20 d0 st %g1, [ %i0 + 0xd0 ]
/*
* We have to save the blocking information of the current wait queue
* because the signal handler may subsequently go on and put the thread
* on a wait queue, for its own purposes.
*/
memcpy( &stored_thread_wait_information, &_Thread_Executing->Wait,
200fca8: 92 02 60 20 add %o1, 0x20, %o1
200fcac: 40 00 04 1c call 2010d1c <memcpy>
200fcb0: 94 10 20 28 mov 0x28, %o2
sizeof( Thread_Wait_information ));
/*
* Here, the signal handler function executes
*/
switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) {
200fcb4: c2 06 c0 1c ld [ %i3 + %i4 ], %g1
200fcb8: 80 a0 60 02 cmp %g1, 2
200fcbc: 02 80 00 0e be 200fcf4 <_POSIX_signals_Check_signal+0xb8>
200fcc0: 90 10 00 19 mov %i1, %o0
&siginfo_struct,
NULL /* context is undefined per 1003.1b-1993, p. 66 */
);
break;
default:
(*_POSIX_signals_Vectors[ signo ].sa_handler)( signo );
200fcc4: 9f c7 40 00 call %i5
200fcc8: 01 00 00 00 nop
}
/*
* Restore the blocking information
*/
memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information,
200fccc: d0 04 20 10 ld [ %l0 + 0x10 ], %o0
200fcd0: 92 07 bf d8 add %fp, -40, %o1
200fcd4: 90 02 20 20 add %o0, 0x20, %o0
200fcd8: 40 00 04 11 call 2010d1c <memcpy>
200fcdc: 94 10 20 28 mov 0x28, %o2
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
return true;
200fce0: 82 10 20 01 mov 1, %g1
sizeof( Thread_Wait_information ));
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
200fce4: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ]
return true;
}
200fce8: b0 08 60 01 and %g1, 1, %i0
200fcec: 81 c7 e0 08 ret
200fcf0: 81 e8 00 00 restore
/*
* Here, the signal handler function executes
*/
switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) {
case SA_SIGINFO:
(*_POSIX_signals_Vectors[ signo ].sa_sigaction)(
200fcf4: 92 07 bf cc add %fp, -52, %o1
200fcf8: 9f c7 40 00 call %i5
200fcfc: 94 10 20 00 clr %o2
signo,
&siginfo_struct,
NULL /* context is undefined per 1003.1b-1993, p. 66 */
);
break;
200fd00: 10 bf ff f4 b 200fcd0 <_POSIX_signals_Check_signal+0x94>
200fd04: d0 04 20 10 ld [ %l0 + 0x10 ], %o0
02010330 <_POSIX_signals_Clear_process_signals>:
*/
void _POSIX_signals_Clear_process_signals(
int signo
)
{
2010330: 9d e3 bf a0 save %sp, -96, %sp
2010334: 84 10 20 01 mov 1, %g2
2010338: 82 06 3f ff add %i0, -1, %g1
clear_signal = true;
mask = signo_to_mask( signo );
ISR_Level level;
_ISR_Disable( level );
201033c: 7f ff c8 b4 call 200260c <sparc_disable_interrupts>
2010340: bb 28 80 01 sll %g2, %g1, %i5
if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) {
2010344: 05 00 80 7a sethi %hi(0x201e800), %g2
2010348: 83 2e 20 02 sll %i0, 2, %g1
201034c: 84 10 a0 a0 or %g2, 0xa0, %g2
2010350: b1 2e 20 04 sll %i0, 4, %i0
2010354: 82 26 00 01 sub %i0, %g1, %g1
2010358: c4 00 80 01 ld [ %g2 + %g1 ], %g2
201035c: 80 a0 a0 02 cmp %g2, 2
2010360: 02 80 00 08 be 2010380 <_POSIX_signals_Clear_process_signals+0x50>
2010364: 31 00 80 7a sethi %hi(0x201e800), %i0
if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) )
clear_signal = false;
}
if ( clear_signal ) {
_POSIX_signals_Pending &= ~mask;
2010368: 03 00 80 7a sethi %hi(0x201e800), %g1
201036c: c4 00 62 94 ld [ %g1 + 0x294 ], %g2 ! 201ea94 <_POSIX_signals_Pending>
2010370: ba 28 80 1d andn %g2, %i5, %i5
2010374: fa 20 62 94 st %i5, [ %g1 + 0x294 ]
}
_ISR_Enable( level );
2010378: 7f ff c8 a9 call 200261c <sparc_enable_interrupts>
201037c: 91 e8 00 08 restore %g0, %o0, %o0
ISR_Level level;
_ISR_Disable( level );
if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) {
if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) )
2010380: b0 16 22 98 or %i0, 0x298, %i0
2010384: c4 00 40 18 ld [ %g1 + %i0 ], %g2
2010388: b0 00 40 18 add %g1, %i0, %i0
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
201038c: b0 06 20 04 add %i0, 4, %i0
2010390: 80 a0 80 18 cmp %g2, %i0
2010394: 02 bf ff f6 be 201036c <_POSIX_signals_Clear_process_signals+0x3c><== ALWAYS TAKEN
2010398: 03 00 80 7a sethi %hi(0x201e800), %g1
clear_signal = false;
}
if ( clear_signal ) {
_POSIX_signals_Pending &= ~mask;
}
_ISR_Enable( level );
201039c: 7f ff c8 a0 call 200261c <sparc_enable_interrupts> <== NOT EXECUTED
20103a0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
02008784 <_POSIX_signals_Get_lowest>:
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
2008784: 82 10 20 1b mov 0x1b, %g1
2008788: 86 10 20 01 mov 1, %g3
#include <rtems/posix/psignalimpl.h>
#include <rtems/seterr.h>
#include <rtems/posix/time.h>
#include <rtems/score/isr.h>
static int _POSIX_signals_Get_lowest(
200878c: 84 00 7f ff add %g1, -1, %g2
2008790: 85 28 c0 02 sll %g3, %g2, %g2
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
if ( set & signo_to_mask( signo ) ) {
2008794: 80 88 80 08 btst %g2, %o0
2008798: 12 80 00 11 bne 20087dc <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
200879c: 01 00 00 00 nop
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
20087a0: 82 00 60 01 inc %g1
20087a4: 80 a0 60 20 cmp %g1, 0x20
20087a8: 12 bf ff fa bne 2008790 <_POSIX_signals_Get_lowest+0xc>
20087ac: 84 00 7f ff add %g1, -1, %g2
20087b0: 82 10 20 01 mov 1, %g1
20087b4: 10 80 00 05 b 20087c8 <_POSIX_signals_Get_lowest+0x44>
20087b8: 86 10 20 01 mov 1, %g3
*/
#if (SIGHUP != 1)
#error "Assumption that SIGHUP==1 violated!!"
#endif
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
20087bc: 80 a0 60 1b cmp %g1, 0x1b
20087c0: 02 80 00 07 be 20087dc <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
20087c4: 01 00 00 00 nop
#include <rtems/posix/psignalimpl.h>
#include <rtems/seterr.h>
#include <rtems/posix/time.h>
#include <rtems/score/isr.h>
static int _POSIX_signals_Get_lowest(
20087c8: 84 00 7f ff add %g1, -1, %g2
20087cc: 85 28 c0 02 sll %g3, %g2, %g2
#if (SIGHUP != 1)
#error "Assumption that SIGHUP==1 violated!!"
#endif
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
if ( set & signo_to_mask( signo ) ) {
20087d0: 80 88 80 08 btst %g2, %o0
20087d4: 22 bf ff fa be,a 20087bc <_POSIX_signals_Get_lowest+0x38>
20087d8: 82 00 60 01 inc %g1
* a return 0. This routine will NOT be called unless a signal
* is pending in the set passed in.
*/
found_it:
return signo;
}
20087dc: 81 c3 e0 08 retl
20087e0: 90 10 00 01 mov %g1, %o0
0200d248 <_POSIX_signals_Post_switch_hook>:
*/
static void _POSIX_signals_Post_switch_hook(
Thread_Control *the_thread
)
{
200d248: 9d e3 bf a0 save %sp, -96, %sp
/*
* We need to ensure that if the signal handler executes a call
* which overwrites the unblocking status, we restore it.
*/
hold_errno = _Thread_Executing->Wait.return_code;
200d24c: 35 00 80 7a sethi %hi(0x201e800), %i2
POSIX_API_Control *api;
int signo;
ISR_Level level;
int hold_errno;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200d250: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
/*
* We need to ensure that if the signal handler executes a call
* which overwrites the unblocking status, we restore it.
*/
hold_errno = _Thread_Executing->Wait.return_code;
200d254: b4 16 a0 40 or %i2, 0x40, %i2
200d258: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1
/*
* api may be NULL in case of a thread close in progress
*/
if ( !api )
200d25c: 80 a7 20 00 cmp %i4, 0
200d260: 02 80 00 34 be 200d330 <_POSIX_signals_Post_switch_hook+0xe8><== NEVER TAKEN
200d264: f2 00 60 34 ld [ %g1 + 0x34 ], %i1
*
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
200d268: 7f ff d4 e9 call 200260c <sparc_disable_interrupts>
200d26c: 37 00 80 7a sethi %hi(0x201e800), %i3
200d270: b6 16 e2 94 or %i3, 0x294, %i3 ! 201ea94 <_POSIX_signals_Pending>
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200d274: c6 06 c0 00 ld [ %i3 ], %g3
200d278: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
if ( !(~api->signals_blocked &
200d27c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200d280: 82 10 c0 01 or %g3, %g1, %g1
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
if ( !(~api->signals_blocked &
200d284: 80 a8 40 02 andncc %g1, %g2, %g0
200d288: 02 80 00 26 be 200d320 <_POSIX_signals_Post_switch_hook+0xd8>
200d28c: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
200d290: 7f ff d4 e3 call 200261c <sparc_enable_interrupts>
200d294: ba 10 20 1b mov 0x1b, %i5 ! 1b <PROM_START+0x1b>
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
_POSIX_signals_Check_signal( api, signo, false );
200d298: 92 10 00 1d mov %i5, %o1
200d29c: 94 10 20 00 clr %o2
200d2a0: 40 00 0a 67 call 200fc3c <_POSIX_signals_Check_signal>
200d2a4: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200d2a8: 92 10 00 1d mov %i5, %o1
200d2ac: 90 10 00 1c mov %i4, %o0
200d2b0: 40 00 0a 63 call 200fc3c <_POSIX_signals_Check_signal>
200d2b4: 94 10 20 01 mov 1, %o2
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
200d2b8: ba 07 60 01 inc %i5
200d2bc: 80 a7 60 20 cmp %i5, 0x20
200d2c0: 12 bf ff f7 bne 200d29c <_POSIX_signals_Post_switch_hook+0x54>
200d2c4: 92 10 00 1d mov %i5, %o1
200d2c8: ba 10 20 01 mov 1, %i5
_POSIX_signals_Check_signal( api, signo, true );
}
/* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
_POSIX_signals_Check_signal( api, signo, false );
200d2cc: 92 10 00 1d mov %i5, %o1
200d2d0: 94 10 20 00 clr %o2
200d2d4: 40 00 0a 5a call 200fc3c <_POSIX_signals_Check_signal>
200d2d8: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200d2dc: 92 10 00 1d mov %i5, %o1
200d2e0: 90 10 00 1c mov %i4, %o0
200d2e4: 40 00 0a 56 call 200fc3c <_POSIX_signals_Check_signal>
200d2e8: 94 10 20 01 mov 1, %o2
_POSIX_signals_Check_signal( api, signo, false );
_POSIX_signals_Check_signal( api, signo, true );
}
/* Unfortunately - nothing like __SIGFIRSTNOTRT in newlib signal .h */
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
200d2ec: ba 07 60 01 inc %i5
200d2f0: 80 a7 60 1b cmp %i5, 0x1b
200d2f4: 12 bf ff f7 bne 200d2d0 <_POSIX_signals_Post_switch_hook+0x88>
200d2f8: 92 10 00 1d mov %i5, %o1
*
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
200d2fc: 7f ff d4 c4 call 200260c <sparc_disable_interrupts>
200d300: 01 00 00 00 nop
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200d304: c6 06 c0 00 ld [ %i3 ], %g3
200d308: c2 07 20 d4 ld [ %i4 + 0xd4 ], %g1
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
if ( !(~api->signals_blocked &
200d30c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200d310: 82 10 c0 01 or %g3, %g1, %g1
* The first thing done is to check there are any signals to be
* processed at all. No point in doing this loop otherwise.
*/
while (1) {
_ISR_Disable( level );
if ( !(~api->signals_blocked &
200d314: 80 a8 40 02 andncc %g1, %g2, %g0
200d318: 12 bf ff de bne 200d290 <_POSIX_signals_Post_switch_hook+0x48><== NEVER TAKEN
200d31c: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
200d320: 7f ff d4 bf call 200261c <sparc_enable_interrupts>
200d324: 01 00 00 00 nop
_POSIX_signals_Check_signal( api, signo, false );
_POSIX_signals_Check_signal( api, signo, true );
}
}
_Thread_Executing->Wait.return_code = hold_errno;
200d328: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1
200d32c: f2 20 60 34 st %i1, [ %g1 + 0x34 ]
200d330: 81 c7 e0 08 ret
200d334: 81 e8 00 00 restore
0201afd4 <_POSIX_signals_Unblock_thread>:
bool _POSIX_signals_Unblock_thread(
Thread_Control *the_thread,
int signo,
siginfo_t *info
)
{
201afd4: 9d e3 bf a0 save %sp, -96, %sp
/*
* Is the thread is specifically waiting for a signal?
*/
if ( _States_Is_interruptible_signal( the_thread->current_state ) ) {
201afd8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
201afdc: 05 04 00 20 sethi %hi(0x10008000), %g2
201afe0: 88 10 20 01 mov 1, %g4
201afe4: 86 06 7f ff add %i1, -1, %g3
201afe8: ba 08 40 02 and %g1, %g2, %i5
{
POSIX_API_Control *api;
sigset_t mask;
siginfo_t *the_info = NULL;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
201afec: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
/*
* Is the thread is specifically waiting for a signal?
*/
if ( _States_Is_interruptible_signal( the_thread->current_state ) ) {
201aff0: 80 a7 40 02 cmp %i5, %g2
201aff4: 02 80 00 2c be 201b0a4 <_POSIX_signals_Unblock_thread+0xd0>
201aff8: 87 29 00 03 sll %g4, %g3, %g3
}
/*
* Thread is not waiting due to a sigwait.
*/
if ( ~api->signals_blocked & mask ) {
201affc: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
201b000: 80 a8 c0 02 andncc %g3, %g2, %g0
201b004: 02 80 00 24 be 201b094 <_POSIX_signals_Unblock_thread+0xc0>
201b008: 05 04 00 00 sethi %hi(0x10000000), %g2
* it is not blocked, THEN
* we need to dispatch at the end of this ISR.
* + Any other combination, do nothing.
*/
if ( _States_Is_interruptible_by_signal( the_thread->current_state ) ) {
201b00c: 80 88 40 02 btst %g1, %g2
201b010: 02 80 00 15 be 201b064 <_POSIX_signals_Unblock_thread+0x90>
201b014: 80 a0 60 00 cmp %g1, 0
the_thread->Wait.return_code = EINTR;
201b018: 84 10 20 04 mov 4, %g2
201b01c: c4 26 20 34 st %g2, [ %i0 + 0x34 ]
*/
RTEMS_INLINE_ROUTINE bool _States_Is_waiting_on_thread_queue (
States_Control the_states
)
{
return (the_states & STATES_WAITING_ON_THREAD_QUEUE);
201b020: 05 00 00 ef sethi %hi(0x3bc00), %g2
201b024: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 <PROM_START+0x3bee0>
/*
* In pthread_cond_wait, a thread will be blocking on a thread
* queue, but is also interruptible by a POSIX signal.
*/
if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) )
201b028: 80 88 40 02 btst %g1, %g2
201b02c: 12 80 00 38 bne 201b10c <_POSIX_signals_Unblock_thread+0x138>
201b030: 80 88 60 08 btst 8, %g1
_Thread_queue_Extract_with_proxy( the_thread );
else if ( _States_Is_delaying(the_thread->current_state) ) {
201b034: 22 80 00 19 be,a 201b098 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN
201b038: b0 10 20 00 clr %i0 <== NOT EXECUTED
(void) _Watchdog_Remove( &the_thread->Timer );
201b03c: 7f ff c1 80 call 200b63c <_Watchdog_Remove>
201b040: 90 06 20 48 add %i0, 0x48, %o0
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
201b044: 90 10 00 18 mov %i0, %o0
201b048: 13 04 01 ff sethi %hi(0x1007fc00), %o1
} else if ( the_thread->current_state == STATES_READY ) {
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
201b04c: b0 10 20 00 clr %i0
201b050: 7f ff bc c5 call 200a364 <_Thread_Clear_state>
201b054: 92 12 63 f8 or %o1, 0x3f8, %o1
201b058: b0 0e 20 01 and %i0, 1, %i0
201b05c: 81 c7 e0 08 ret
201b060: 81 e8 00 00 restore
else if ( _States_Is_delaying(the_thread->current_state) ) {
(void) _Watchdog_Remove( &the_thread->Timer );
_Thread_Unblock( the_thread );
}
} else if ( the_thread->current_state == STATES_READY ) {
201b064: 32 80 00 0d bne,a 201b098 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN
201b068: b0 10 20 00 clr %i0 <== NOT EXECUTED
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201b06c: 03 00 80 7a sethi %hi(0x201e800), %g1
201b070: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_Per_CPU_Information>
201b074: c4 00 60 08 ld [ %g1 + 8 ], %g2
201b078: 80 a0 a0 00 cmp %g2, 0
201b07c: 22 80 00 07 be,a 201b098 <_POSIX_signals_Unblock_thread+0xc4>
201b080: b0 10 20 00 clr %i0
201b084: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
201b088: 80 a6 00 02 cmp %i0, %g2
201b08c: 22 80 00 02 be,a 201b094 <_POSIX_signals_Unblock_thread+0xc0><== ALWAYS TAKEN
201b090: c8 28 60 0c stb %g4, [ %g1 + 0xc ]
_Thread_Dispatch_necessary = true;
}
}
return false;
201b094: b0 10 20 00 clr %i0
}
201b098: b0 0e 20 01 and %i0, 1, %i0
201b09c: 81 c7 e0 08 ret
201b0a0: 81 e8 00 00 restore
* Is the thread is specifically waiting for a signal?
*/
if ( _States_Is_interruptible_signal( the_thread->current_state ) ) {
if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) {
201b0a4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
201b0a8: 80 88 c0 01 btst %g3, %g1
201b0ac: 22 80 00 13 be,a 201b0f8 <_POSIX_signals_Unblock_thread+0x124>
201b0b0: c2 07 20 d0 ld [ %i4 + 0xd0 ], %g1
the_thread->Wait.return_code = EINTR;
201b0b4: 82 10 20 04 mov 4, %g1
201b0b8: c2 26 20 34 st %g1, [ %i0 + 0x34 ]
the_info = (siginfo_t *) the_thread->Wait.return_argument;
if ( !info ) {
201b0bc: 80 a6 a0 00 cmp %i2, 0
201b0c0: 02 80 00 19 be 201b124 <_POSIX_signals_Unblock_thread+0x150>
201b0c4: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
the_info->si_signo = signo;
the_info->si_code = SI_USER;
the_info->si_value.sival_int = 0;
} else {
*the_info = *info;
201b0c8: c4 06 80 00 ld [ %i2 ], %g2
201b0cc: c4 20 40 00 st %g2, [ %g1 ]
201b0d0: c4 06 a0 04 ld [ %i2 + 4 ], %g2
201b0d4: c4 20 60 04 st %g2, [ %g1 + 4 ]
201b0d8: c4 06 a0 08 ld [ %i2 + 8 ], %g2
201b0dc: c4 20 60 08 st %g2, [ %g1 + 8 ]
}
_Thread_queue_Extract_with_proxy( the_thread );
201b0e0: 90 10 00 18 mov %i0, %o0
201b0e4: 7f ff bf 9f call 200af60 <_Thread_queue_Extract_with_proxy>
201b0e8: b0 10 20 01 mov 1, %i0
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
}
201b0ec: b0 0e 20 01 and %i0, 1, %i0
201b0f0: 81 c7 e0 08 ret
201b0f4: 81 e8 00 00 restore
* Is the thread is specifically waiting for a signal?
*/
if ( _States_Is_interruptible_signal( the_thread->current_state ) ) {
if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) {
201b0f8: 80 a8 c0 01 andncc %g3, %g1, %g0
201b0fc: 32 bf ff ef bne,a 201b0b8 <_POSIX_signals_Unblock_thread+0xe4>
201b100: 82 10 20 04 mov 4, %g1
} else if ( the_thread->current_state == STATES_READY ) {
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
201b104: 10 bf ff e5 b 201b098 <_POSIX_signals_Unblock_thread+0xc4>
201b108: b0 10 20 00 clr %i0
/*
* In pthread_cond_wait, a thread will be blocking on a thread
* queue, but is also interruptible by a POSIX signal.
*/
if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) )
_Thread_queue_Extract_with_proxy( the_thread );
201b10c: 90 10 00 18 mov %i0, %o0
201b110: 7f ff bf 94 call 200af60 <_Thread_queue_Extract_with_proxy>
201b114: b0 10 20 00 clr %i0
201b118: b0 0e 20 01 and %i0, 1, %i0
201b11c: 81 c7 e0 08 ret
201b120: 81 e8 00 00 restore
the_info = (siginfo_t *) the_thread->Wait.return_argument;
if ( !info ) {
the_info->si_signo = signo;
the_info->si_code = SI_USER;
201b124: 84 10 20 01 mov 1, %g2
the_thread->Wait.return_code = EINTR;
the_info = (siginfo_t *) the_thread->Wait.return_argument;
if ( !info ) {
the_info->si_signo = signo;
201b128: f2 20 40 00 st %i1, [ %g1 ]
the_info->si_code = SI_USER;
201b12c: c4 20 60 04 st %g2, [ %g1 + 4 ]
the_info->si_value.sival_int = 0;
201b130: 10 bf ff ec b 201b0e0 <_POSIX_signals_Unblock_thread+0x10c>
201b134: c0 20 60 08 clr [ %g1 + 8 ]
0200a97c <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
200a97c: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if (!the_node) return;
200a980: 80 a6 60 00 cmp %i1, 0
200a984: 02 80 00 4c be 200aab4 <_RBTree_Extract_unprotected+0x138>
200a988: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
200a98c: c2 06 20 08 ld [ %i0 + 8 ], %g1
200a990: 80 a0 40 19 cmp %g1, %i1
200a994: 02 80 00 56 be 200aaec <_RBTree_Extract_unprotected+0x170>
200a998: 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]) {
200a99c: c2 06 20 0c ld [ %i0 + 0xc ], %g1
200a9a0: 80 a0 40 19 cmp %g1, %i1
200a9a4: 02 80 00 56 be 200aafc <_RBTree_Extract_unprotected+0x180>
200a9a8: 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]) {
200a9ac: fa 06 60 04 ld [ %i1 + 4 ], %i5
200a9b0: 80 a7 60 00 cmp %i5, 0
200a9b4: 22 80 00 5a be,a 200ab1c <_RBTree_Extract_unprotected+0x1a0>
200a9b8: f8 06 60 08 ld [ %i1 + 8 ], %i4
200a9bc: c2 06 60 08 ld [ %i1 + 8 ], %g1
200a9c0: 80 a0 60 00 cmp %g1, 0
200a9c4: 32 80 00 05 bne,a 200a9d8 <_RBTree_Extract_unprotected+0x5c>
200a9c8: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a9cc: 10 80 00 3c b 200aabc <_RBTree_Extract_unprotected+0x140>
200a9d0: 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];
200a9d4: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a9d8: 80 a0 60 00 cmp %g1, 0
200a9dc: 32 bf ff fe bne,a 200a9d4 <_RBTree_Extract_unprotected+0x58>
200a9e0: 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];
200a9e4: f8 07 60 04 ld [ %i5 + 4 ], %i4
if(leaf) {
200a9e8: 80 a7 20 00 cmp %i4, 0
200a9ec: 02 80 00 48 be 200ab0c <_RBTree_Extract_unprotected+0x190>
200a9f0: 01 00 00 00 nop
leaf->parent = target->parent;
200a9f4: c2 07 40 00 ld [ %i5 ], %g1
200a9f8: 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];
200a9fc: 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];
200aa00: 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];
200aa04: 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;
200aa08: c6 07 60 0c ld [ %i5 + 0xc ], %g3
dir = target != target->parent->child[0];
200aa0c: 88 1f 40 04 xor %i5, %g4, %g4
200aa10: 80 a0 00 04 cmp %g0, %g4
200aa14: 88 40 20 00 addx %g0, 0, %g4
target->parent->child[dir] = leaf;
200aa18: 89 29 20 02 sll %g4, 2, %g4
200aa1c: 84 00 80 04 add %g2, %g4, %g2
200aa20: f8 20 a0 04 st %i4, [ %g2 + 4 ]
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
200aa24: c4 00 60 04 ld [ %g1 + 4 ], %g2
200aa28: 84 18 80 19 xor %g2, %i1, %g2
200aa2c: 80 a0 00 02 cmp %g0, %g2
200aa30: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = target;
200aa34: 85 28 a0 02 sll %g2, 2, %g2
200aa38: 82 00 40 02 add %g1, %g2, %g1
200aa3c: 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];
200aa40: c2 06 60 08 ld [ %i1 + 8 ], %g1
200aa44: c2 27 60 08 st %g1, [ %i5 + 8 ]
if (the_node->child[RBT_RIGHT])
200aa48: c2 06 60 08 ld [ %i1 + 8 ], %g1
200aa4c: 80 a0 60 00 cmp %g1, 0
200aa50: 32 80 00 02 bne,a 200aa58 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN
200aa54: fa 20 40 00 st %i5, [ %g1 ]
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
200aa58: c2 06 60 04 ld [ %i1 + 4 ], %g1
200aa5c: c2 27 60 04 st %g1, [ %i5 + 4 ]
if (the_node->child[RBT_LEFT])
200aa60: c2 06 60 04 ld [ %i1 + 4 ], %g1
200aa64: 80 a0 60 00 cmp %g1, 0
200aa68: 32 80 00 02 bne,a 200aa70 <_RBTree_Extract_unprotected+0xf4>
200aa6c: 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;
200aa70: c4 06 40 00 ld [ %i1 ], %g2
target->color = the_node->color;
200aa74: 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;
200aa78: c4 27 40 00 st %g2, [ %i5 ]
target->color = the_node->color;
200aa7c: 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 */
200aa80: 80 a0 e0 00 cmp %g3, 0
200aa84: 32 80 00 06 bne,a 200aa9c <_RBTree_Extract_unprotected+0x120>
200aa88: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (leaf) {
200aa8c: 80 a7 20 00 cmp %i4, 0
200aa90: 32 80 00 02 bne,a 200aa98 <_RBTree_Extract_unprotected+0x11c>
200aa94: 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;
200aa98: 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;
200aa9c: c0 26 60 08 clr [ %i1 + 8 ]
200aaa0: c0 26 60 04 clr [ %i1 + 4 ]
200aaa4: 80 a0 60 00 cmp %g1, 0
200aaa8: 02 80 00 03 be 200aab4 <_RBTree_Extract_unprotected+0x138>
200aaac: c0 26 40 00 clr [ %i1 ]
200aab0: c0 20 60 0c clr [ %g1 + 0xc ]
200aab4: 81 c7 e0 08 ret
200aab8: 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;
200aabc: c2 06 40 00 ld [ %i1 ], %g1
200aac0: 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];
200aac4: 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;
200aac8: c6 06 60 0c ld [ %i1 + 0xc ], %g3
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
200aacc: c4 00 60 04 ld [ %g1 + 4 ], %g2
200aad0: 84 18 80 19 xor %g2, %i1, %g2
200aad4: 80 a0 00 02 cmp %g0, %g2
200aad8: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = leaf;
200aadc: 85 28 a0 02 sll %g2, 2, %g2
200aae0: 82 00 40 02 add %g1, %g2, %g1
200aae4: 10 bf ff e7 b 200aa80 <_RBTree_Extract_unprotected+0x104>
200aae8: 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 );
200aaec: 40 00 00 eb call 200ae98 <_RBTree_Next_unprotected>
200aaf0: 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;
200aaf4: 10 bf ff aa b 200a99c <_RBTree_Extract_unprotected+0x20>
200aaf8: 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 );
200aafc: 40 00 00 e7 call 200ae98 <_RBTree_Next_unprotected>
200ab00: 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;
200ab04: 10 bf ff aa b 200a9ac <_RBTree_Extract_unprotected+0x30>
200ab08: 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);
200ab0c: 7f ff fe d3 call 200a658 <_RBTree_Extract_validate_unprotected>
200ab10: 90 10 00 1d mov %i5, %o0
}
victim_color = target->color;
dir = target != target->parent->child[0];
200ab14: 10 bf ff bb b 200aa00 <_RBTree_Extract_unprotected+0x84>
200ab18: 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 ) {
200ab1c: 80 a7 20 00 cmp %i4, 0
200ab20: 32 bf ff e8 bne,a 200aac0 <_RBTree_Extract_unprotected+0x144>
200ab24: 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);
200ab28: 7f ff fe cc call 200a658 <_RBTree_Extract_validate_unprotected>
200ab2c: 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];
200ab30: 10 bf ff e6 b 200aac8 <_RBTree_Extract_unprotected+0x14c>
200ab34: c2 06 40 00 ld [ %i1 ], %g1
0200a658 <_RBTree_Extract_validate_unprotected>:
)
{
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
200a658: c2 02 00 00 ld [ %o0 ], %g1
if(!parent->parent) return;
200a65c: c4 00 40 00 ld [ %g1 ], %g2
200a660: 80 a0 a0 00 cmp %g2, 0
200a664: 02 80 00 3f be 200a760 <_RBTree_Extract_validate_unprotected+0x108>
200a668: 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])
200a66c: c4 00 60 04 ld [ %g1 + 4 ], %g2
200a670: 80 a2 00 02 cmp %o0, %g2
200a674: 22 80 00 02 be,a 200a67c <_RBTree_Extract_validate_unprotected+0x24>
200a678: 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);
200a67c: c6 02 20 0c ld [ %o0 + 0xc ], %g3
200a680: 80 a0 e0 01 cmp %g3, 1
200a684: 02 80 00 32 be 200a74c <_RBTree_Extract_validate_unprotected+0xf4>
200a688: 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) {
200a68c: c6 00 40 00 ld [ %g1 ], %g3
200a690: 80 a0 e0 00 cmp %g3, 0
200a694: 02 80 00 2e be 200a74c <_RBTree_Extract_validate_unprotected+0xf4>
200a698: 80 a0 a0 00 cmp %g2, 0
200a69c: 22 80 00 07 be,a 200a6b8 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN
200a6a0: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED
200a6a4: c8 00 a0 0c ld [ %g2 + 0xc ], %g4
200a6a8: 80 a1 20 01 cmp %g4, 1
200a6ac: 22 80 00 63 be,a 200a838 <_RBTree_Extract_validate_unprotected+0x1e0>
200a6b0: 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]) &&
200a6b4: c6 00 a0 08 ld [ %g2 + 8 ], %g3
200a6b8: 80 a0 e0 00 cmp %g3, 0
200a6bc: 22 80 00 07 be,a 200a6d8 <_RBTree_Extract_validate_unprotected+0x80>
200a6c0: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200a6c4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200a6c8: 80 a0 e0 01 cmp %g3, 1
200a6cc: 22 80 00 29 be,a 200a770 <_RBTree_Extract_validate_unprotected+0x118>
200a6d0: c6 00 60 04 ld [ %g1 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
200a6d4: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200a6d8: 80 a0 e0 00 cmp %g3, 0
200a6dc: 22 80 00 07 be,a 200a6f8 <_RBTree_Extract_validate_unprotected+0xa0>
200a6e0: da 20 a0 0c st %o5, [ %g2 + 0xc ]
200a6e4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200a6e8: 80 a0 e0 01 cmp %g3, 1
200a6ec: 22 80 00 21 be,a 200a770 <_RBTree_Extract_validate_unprotected+0x118>
200a6f0: c6 00 60 04 ld [ %g1 + 4 ], %g3
sibling->color = RBT_RED;
200a6f4: da 20 a0 0c st %o5, [ %g2 + 0xc ]
200a6f8: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200a6fc: 80 a0 a0 01 cmp %g2, 1
200a700: 22 80 00 99 be,a 200a964 <_RBTree_Extract_validate_unprotected+0x30c>
200a704: 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;
200a708: 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;
200a70c: 80 a0 e0 00 cmp %g3, 0
200a710: 02 80 00 6c be 200a8c0 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN
200a714: 90 10 00 01 mov %g1, %o0
if(!(the_node->parent->parent)) return NULL;
200a718: c4 00 c0 00 ld [ %g3 ], %g2
200a71c: 80 a0 a0 00 cmp %g2, 0
200a720: 02 80 00 69 be 200a8c4 <_RBTree_Extract_validate_unprotected+0x26c>
200a724: 84 10 20 00 clr %g2
if(the_node == the_node->parent->child[RBT_LEFT])
200a728: c4 00 e0 04 ld [ %g3 + 4 ], %g2
200a72c: 80 a0 40 02 cmp %g1, %g2
200a730: 22 80 00 0e be,a 200a768 <_RBTree_Extract_validate_unprotected+0x110>
200a734: 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;
200a738: 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);
200a73c: c6 02 20 0c ld [ %o0 + 0xc ], %g3
200a740: 80 a0 e0 01 cmp %g3, 1
200a744: 32 bf ff d3 bne,a 200a690 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN
200a748: 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;
200a74c: c2 02 00 00 ld [ %o0 ], %g1
200a750: c2 00 40 00 ld [ %g1 ], %g1
200a754: 80 a0 60 00 cmp %g1, 0
200a758: 02 80 00 5f be 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c>
200a75c: 01 00 00 00 nop
200a760: 81 c3 e0 08 retl
200a764: 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;
200a768: 10 bf ff f5 b 200a73c <_RBTree_Extract_validate_unprotected+0xe4>
200a76c: 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];
200a770: 86 1a 00 03 xor %o0, %g3, %g3
200a774: 80 a0 00 03 cmp %g0, %g3
200a778: 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);
200a77c: 86 1b 60 01 xor %o5, 1, %g3
if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) {
200a780: 87 28 e0 02 sll %g3, 2, %g3
200a784: 88 00 80 03 add %g2, %g3, %g4
200a788: 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);
200a78c: 80 a1 20 00 cmp %g4, 0
200a790: 22 80 00 07 be,a 200a7ac <_RBTree_Extract_validate_unprotected+0x154>
200a794: 9b 2b 60 02 sll %o5, 2, %o5
200a798: d8 01 20 0c ld [ %g4 + 0xc ], %o4
200a79c: 80 a3 20 01 cmp %o4, 1
200a7a0: 22 80 00 4f be,a 200a8dc <_RBTree_Extract_validate_unprotected+0x284>
200a7a4: d6 00 60 0c ld [ %g1 + 0xc ], %o3
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
200a7a8: 9b 2b 60 02 sll %o5, 2, %o5
200a7ac: 98 00 80 0d add %g2, %o5, %o4
200a7b0: 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;
200a7b4: 96 10 20 01 mov 1, %o3
200a7b8: 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;
200a7bc: 80 a1 20 00 cmp %g4, 0
200a7c0: 02 80 00 15 be 200a814 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN
200a7c4: 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];
200a7c8: 96 01 00 03 add %g4, %g3, %o3
200a7cc: d4 02 e0 04 ld [ %o3 + 4 ], %o2
200a7d0: d4 23 20 04 st %o2, [ %o4 + 4 ]
if (c->child[dir])
200a7d4: d8 02 e0 04 ld [ %o3 + 4 ], %o4
200a7d8: 80 a3 20 00 cmp %o4, 0
200a7dc: 32 80 00 02 bne,a 200a7e4 <_RBTree_Extract_validate_unprotected+0x18c>
200a7e0: 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;
200a7e4: 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;
200a7e8: 96 01 00 03 add %g4, %g3, %o3
200a7ec: c4 22 e0 04 st %g2, [ %o3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a7f0: d6 03 20 04 ld [ %o4 + 4 ], %o3
c->parent = the_node->parent;
200a7f4: 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;
200a7f8: 96 18 80 0b xor %g2, %o3, %o3
c->parent = the_node->parent;
the_node->parent = c;
200a7fc: 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;
200a800: 80 a0 00 0b cmp %g0, %o3
200a804: 84 40 20 00 addx %g0, 0, %g2
200a808: 85 28 a0 02 sll %g2, 2, %g2
200a80c: 98 03 00 02 add %o4, %g2, %o4
200a810: 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;
200a814: 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)];
200a818: 84 00 40 03 add %g1, %g3, %g2
200a81c: c4 00 a0 04 ld [ %g2 + 4 ], %g2
}
sibling->color = parent->color;
200a820: c8 20 a0 0c st %g4, [ %g2 + 0xc ]
200a824: 88 00 80 03 add %g2, %g3, %g4
200a828: c8 01 20 04 ld [ %g4 + 4 ], %g4
parent->color = RBT_BLACK;
200a82c: c0 20 60 0c clr [ %g1 + 0xc ]
sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK;
200a830: 10 80 00 33 b 200a8fc <_RBTree_Extract_validate_unprotected+0x2a4>
200a834: 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;
200a838: c8 20 60 0c st %g4, [ %g1 + 0xc ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
200a83c: 88 1b 00 08 xor %o4, %o0, %g4
200a840: 80 a0 00 04 cmp %g0, %g4
200a844: 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);
200a848: 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;
200a84c: 97 2a e0 02 sll %o3, 2, %o3
200a850: 98 00 40 0b add %g1, %o3, %o4
200a854: c8 03 20 04 ld [ %o4 + 4 ], %g4
200a858: 80 a1 20 00 cmp %g4, 0
200a85c: 02 80 00 1c be 200a8cc <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN
200a860: 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];
200a864: 95 2a a0 02 sll %o2, 2, %o2
200a868: 84 01 00 0a add %g4, %o2, %g2
200a86c: d2 00 a0 04 ld [ %g2 + 4 ], %o1
200a870: d2 23 20 04 st %o1, [ %o4 + 4 ]
if (c->child[dir])
200a874: c4 00 a0 04 ld [ %g2 + 4 ], %g2
200a878: 80 a0 a0 00 cmp %g2, 0
200a87c: 02 80 00 04 be 200a88c <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN
200a880: 94 01 00 0a add %g4, %o2, %o2
c->child[dir]->parent = the_node;
200a884: c2 20 80 00 st %g1, [ %g2 ]
200a888: c6 00 40 00 ld [ %g1 ], %g3
c->child[dir] = the_node;
200a88c: c2 22 a0 04 st %g1, [ %o2 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a890: c4 00 e0 04 ld [ %g3 + 4 ], %g2
c->parent = the_node->parent;
200a894: 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;
200a898: 84 18 40 02 xor %g1, %g2, %g2
200a89c: 80 a0 00 02 cmp %g0, %g2
200a8a0: 84 40 20 00 addx %g0, 0, %g2
200a8a4: 85 28 a0 02 sll %g2, 2, %g2
200a8a8: 96 00 40 0b add %g1, %o3, %o3
200a8ac: 86 00 c0 02 add %g3, %g2, %g3
c->parent = the_node->parent;
the_node->parent = c;
200a8b0: 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;
200a8b4: c8 20 e0 04 st %g4, [ %g3 + 4 ]
200a8b8: 10 bf ff 7f b 200a6b4 <_RBTree_Extract_validate_unprotected+0x5c>
200a8bc: 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;
200a8c0: 84 10 20 00 clr %g2 <== NOT EXECUTED
200a8c4: 10 bf ff 9e b 200a73c <_RBTree_Extract_validate_unprotected+0xe4>
200a8c8: 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;
200a8cc: 10 bf ff 7a b 200a6b4 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED
200a8d0: 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;
200a8d4: 81 c3 e0 08 retl
200a8d8: c0 22 20 0c clr [ %o0 + 0xc ]
200a8dc: 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;
200a8e0: d6 20 a0 0c st %o3, [ %g2 + 0xc ]
parent->color = RBT_BLACK;
200a8e4: c0 20 60 0c clr [ %g1 + 0xc ]
200a8e8: c4 03 20 04 ld [ %o4 + 4 ], %g2
200a8ec: 80 a0 a0 00 cmp %g2, 0
200a8f0: 02 bf ff 97 be 200a74c <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN
200a8f4: c0 21 20 0c clr [ %g4 + 0xc ]
200a8f8: 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];
200a8fc: 88 00 80 0d add %g2, %o5, %g4
200a900: d8 01 20 04 ld [ %g4 + 4 ], %o4
200a904: 86 00 40 03 add %g1, %g3, %g3
200a908: d8 20 e0 04 st %o4, [ %g3 + 4 ]
if (c->child[dir])
200a90c: c6 01 20 04 ld [ %g4 + 4 ], %g3
200a910: 80 a0 e0 00 cmp %g3, 0
200a914: 32 80 00 02 bne,a 200a91c <_RBTree_Extract_validate_unprotected+0x2c4>
200a918: 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;
200a91c: 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;
200a920: 9a 00 80 0d add %g2, %o5, %o5
200a924: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200a928: c8 00 e0 04 ld [ %g3 + 4 ], %g4
c->parent = the_node->parent;
200a92c: c6 20 80 00 st %g3, [ %g2 ]
the_node->parent = c;
200a930: 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;
200a934: 88 18 40 04 xor %g1, %g4, %g4
200a938: 80 a0 00 04 cmp %g0, %g4
200a93c: 82 40 20 00 addx %g0, 0, %g1
200a940: 83 28 60 02 sll %g1, 2, %g1
200a944: 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;
200a948: c2 02 00 00 ld [ %o0 ], %g1
200a94c: c4 20 e0 04 st %g2, [ %g3 + 4 ]
200a950: c2 00 40 00 ld [ %g1 ], %g1
200a954: 80 a0 60 00 cmp %g1, 0
200a958: 12 bf ff 82 bne 200a760 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
200a95c: 01 00 00 00 nop
200a960: 30 bf ff dd b,a 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
200a964: c2 02 00 00 ld [ %o0 ], %g1
200a968: c2 00 40 00 ld [ %g1 ], %g1
200a96c: 80 a0 60 00 cmp %g1, 0
200a970: 12 bf ff 7c bne 200a760 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN
200a974: 01 00 00 00 nop
200a978: 30 bf ff d7 b,a 200a8d4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED
0200b570 <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
RBTree_Node *search_node
)
{
200b570: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
200b574: 7f ff e1 c8 call 2003c94 <sparc_disable_interrupts>
200b578: b8 10 00 18 mov %i0, %i4
200b57c: 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;
200b580: fa 06 20 04 ld [ %i0 + 4 ], %i5
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
200b584: 80 a7 60 00 cmp %i5, 0
200b588: 02 80 00 15 be 200b5dc <_RBTree_Find+0x6c> <== NEVER TAKEN
200b58c: b0 10 20 00 clr %i0
compare_result = the_rbtree->compare_function(the_node, iter_node);
200b590: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
200b594: 92 10 00 1d mov %i5, %o1
200b598: 9f c0 40 00 call %g1
200b59c: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
200b5a0: 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 ) ) {
200b5a4: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
200b5a8: 82 20 40 08 sub %g1, %o0, %g1
200b5ac: 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];
200b5b0: 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 ) ) {
200b5b4: 12 80 00 06 bne 200b5cc <_RBTree_Find+0x5c>
200b5b8: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
200b5bc: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
200b5c0: 80 a0 a0 00 cmp %g2, 0
200b5c4: 12 80 00 0a bne 200b5ec <_RBTree_Find+0x7c>
200b5c8: b0 10 00 1d mov %i5, %i0
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
200b5cc: 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) {
200b5d0: 80 a7 60 00 cmp %i5, 0
200b5d4: 32 bf ff f0 bne,a 200b594 <_RBTree_Find+0x24>
200b5d8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return_node = _RBTree_Find_unprotected( the_rbtree, search_node );
_ISR_Enable( level );
200b5dc: 7f ff e1 b2 call 2003ca4 <sparc_enable_interrupts>
200b5e0: 90 10 00 1b mov %i3, %o0
return return_node;
}
200b5e4: 81 c7 e0 08 ret
200b5e8: 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 );
200b5ec: 7f ff e1 ae call 2003ca4 <sparc_enable_interrupts>
200b5f0: 90 10 00 1b mov %i3, %o0
return return_node;
}
200b5f4: 81 c7 e0 08 ret
200b5f8: 81 e8 00 00 restore
0200b9dc <_RBTree_Initialize>:
void *starting_address,
size_t number_nodes,
size_t node_size,
bool is_unique
)
{
200b9dc: 9d e3 bf a0 save %sp, -96, %sp
size_t count;
RBTree_Node *next;
/* TODO: Error message? */
if (!the_rbtree) return;
200b9e0: 80 a6 20 00 cmp %i0, 0
200b9e4: 02 80 00 0f be 200ba20 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200b9e8: 80 a6 e0 00 cmp %i3, 0
RBTree_Control *the_rbtree,
RBTree_Compare_function compare_function,
bool is_unique
)
{
the_rbtree->permanent_null = NULL;
200b9ec: c0 26 00 00 clr [ %i0 ]
the_rbtree->root = NULL;
200b9f0: c0 26 20 04 clr [ %i0 + 4 ]
the_rbtree->first[0] = NULL;
200b9f4: c0 26 20 08 clr [ %i0 + 8 ]
the_rbtree->first[1] = NULL;
200b9f8: c0 26 20 0c clr [ %i0 + 0xc ]
the_rbtree->compare_function = compare_function;
200b9fc: 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-- ) {
200ba00: 02 80 00 08 be 200ba20 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200ba04: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ]
_RBTree_Insert_unprotected(the_rbtree, next);
200ba08: 92 10 00 1a mov %i2, %o1
200ba0c: 7f ff ff 0b call 200b638 <_RBTree_Insert_unprotected>
200ba10: 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-- ) {
200ba14: b6 86 ff ff addcc %i3, -1, %i3
200ba18: 12 bf ff fc bne 200ba08 <_RBTree_Initialize+0x2c>
200ba1c: b4 06 80 1c add %i2, %i4, %i2
200ba20: 81 c7 e0 08 ret
200ba24: 81 e8 00 00 restore
0200ab5c <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
200ab5c: 9d e3 bf a0 save %sp, -96, %sp
if(!the_node) return (RBTree_Node*)-1;
200ab60: 80 a6 60 00 cmp %i1, 0
200ab64: 02 80 00 9c be 200add4 <_RBTree_Insert_unprotected+0x278>
200ab68: b8 10 00 18 mov %i0, %i4
RBTree_Node *iter_node = the_rbtree->root;
200ab6c: fa 06 20 04 ld [ %i0 + 4 ], %i5
int compare_result;
if (!iter_node) { /* special case: first node inserted */
200ab70: 80 a7 60 00 cmp %i5, 0
200ab74: 32 80 00 05 bne,a 200ab88 <_RBTree_Insert_unprotected+0x2c>
200ab78: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
the_node->color = RBT_BLACK;
200ab7c: 10 80 00 9a b 200ade4 <_RBTree_Insert_unprotected+0x288>
200ab80: 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);
200ab84: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
200ab88: 92 10 00 1d mov %i5, %o1
200ab8c: 9f c0 40 00 call %g1
200ab90: 90 10 00 19 mov %i1, %o0
if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) )
200ab94: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
200ab98: 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 ) )
200ab9c: 80 a0 a0 00 cmp %g2, 0
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
200aba0: b7 36 e0 1f srl %i3, 0x1f, %i3
if (!iter_node->child[dir]) {
200aba4: 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 ) )
200aba8: 02 80 00 05 be 200abbc <_RBTree_Insert_unprotected+0x60>
200abac: 82 07 40 01 add %i5, %g1, %g1
200abb0: 80 a2 20 00 cmp %o0, 0
200abb4: 02 80 00 8a be 200addc <_RBTree_Insert_unprotected+0x280>
200abb8: 01 00 00 00 nop
return iter_node;
RBTree_Direction dir = !_RBTree_Is_lesser( compare_result );
if (!iter_node->child[dir]) {
200abbc: f0 00 60 04 ld [ %g1 + 4 ], %i0
200abc0: 80 a6 20 00 cmp %i0, 0
200abc4: 32 bf ff f0 bne,a 200ab84 <_RBTree_Insert_unprotected+0x28>
200abc8: 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(
200abcc: 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];
200abd0: b4 06 e0 02 add %i3, 2, %i2
200abd4: 87 2e a0 02 sll %i2, 2, %g3
200abd8: 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;
200abdc: c0 26 60 08 clr [ %i1 + 8 ]
200abe0: c0 26 60 04 clr [ %i1 + 4 ]
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
200abe4: 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;
200abe8: 82 10 20 01 mov 1, %g1
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
200abec: 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;
200abf0: 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(
200abf4: 9f c0 80 00 call %g2
200abf8: 90 10 00 19 mov %i1, %o0
the_node,
_RBTree_First(the_rbtree, dir)
);
if ( (!dir && _RBTree_Is_lesser(compare_result)) ||
200abfc: 80 a6 e0 00 cmp %i3, 0
200ac00: 12 80 00 10 bne 200ac40 <_RBTree_Insert_unprotected+0xe4>
200ac04: 80 a2 20 00 cmp %o0, 0
200ac08: 06 80 00 10 bl 200ac48 <_RBTree_Insert_unprotected+0xec>
200ac0c: b5 2e a0 02 sll %i2, 2, %i2
200ac10: 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;
200ac14: 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;
200ac18: c4 00 40 00 ld [ %g1 ], %g2
200ac1c: 86 90 a0 00 orcc %g2, 0, %g3
200ac20: 22 80 00 06 be,a 200ac38 <_RBTree_Insert_unprotected+0xdc>
200ac24: 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);
200ac28: c8 00 60 0c ld [ %g1 + 0xc ], %g4
200ac2c: 80 a1 20 01 cmp %g4, 1
200ac30: 22 80 00 08 be,a 200ac50 <_RBTree_Insert_unprotected+0xf4>
200ac34: f6 00 80 00 ld [ %g2 ], %i3
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
200ac38: 81 c7 e0 08 ret
200ac3c: 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)) ) {
200ac40: 04 bf ff f4 ble 200ac10 <_RBTree_Insert_unprotected+0xb4>
200ac44: b5 2e a0 02 sll %i2, 2, %i2
the_rbtree->first[dir] = the_node;
200ac48: 10 bf ff f2 b 200ac10 <_RBTree_Insert_unprotected+0xb4>
200ac4c: 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;
200ac50: 80 a6 e0 00 cmp %i3, 0
200ac54: 02 80 00 0c be 200ac84 <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN
200ac58: 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])
200ac5c: 80 a1 00 01 cmp %g4, %g1
200ac60: 02 80 00 5b be 200adcc <_RBTree_Insert_unprotected+0x270>
200ac64: 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);
200ac68: 80 a7 60 00 cmp %i5, 0
200ac6c: 22 80 00 07 be,a 200ac88 <_RBTree_Insert_unprotected+0x12c>
200ac70: fa 00 60 04 ld [ %g1 + 4 ], %i5
200ac74: f8 07 60 0c ld [ %i5 + 0xc ], %i4
200ac78: 80 a7 20 01 cmp %i4, 1
200ac7c: 22 80 00 4f be,a 200adb8 <_RBTree_Insert_unprotected+0x25c>
200ac80: 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];
200ac84: fa 00 60 04 ld [ %g1 + 4 ], %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
200ac88: 88 18 40 04 xor %g1, %g4, %g4
200ac8c: 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];
200ac90: ba 1e 40 1d xor %i1, %i5, %i5
RBTree_Direction pdir = the_node->parent != g->child[0];
200ac94: 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];
200ac98: 80 a0 00 1d cmp %g0, %i5
200ac9c: 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) {
200aca0: 80 a7 40 04 cmp %i5, %g4
200aca4: 02 80 00 20 be 200ad24 <_RBTree_Insert_unprotected+0x1c8>
200aca8: 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);
200acac: 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;
200acb0: b7 2e e0 02 sll %i3, 2, %i3
200acb4: b6 00 40 1b add %g1, %i3, %i3
200acb8: fa 06 e0 04 ld [ %i3 + 4 ], %i5
200acbc: 80 a7 60 00 cmp %i5, 0
200acc0: 02 80 00 16 be 200ad18 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN
200acc4: 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];
200acc8: 9e 07 40 1c add %i5, %i4, %o7
200accc: da 03 e0 04 ld [ %o7 + 4 ], %o5
200acd0: da 26 e0 04 st %o5, [ %i3 + 4 ]
if (c->child[dir])
200acd4: f6 03 e0 04 ld [ %o7 + 4 ], %i3
200acd8: 80 a6 e0 00 cmp %i3, 0
200acdc: 22 80 00 05 be,a 200acf0 <_RBTree_Insert_unprotected+0x194>
200ace0: b6 07 40 1c add %i5, %i4, %i3
c->child[dir]->parent = the_node;
200ace4: c2 26 c0 00 st %g1, [ %i3 ]
200ace8: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
200acec: b6 07 40 1c add %i5, %i4, %i3
200acf0: c2 26 e0 04 st %g1, [ %i3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200acf4: f6 00 a0 04 ld [ %g2 + 4 ], %i3
c->parent = the_node->parent;
200acf8: 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;
200acfc: b6 1e c0 01 xor %i3, %g1, %i3
c->parent = the_node->parent;
the_node->parent = c;
200ad00: 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;
200ad04: 80 a0 00 1b cmp %g0, %i3
200ad08: 82 40 20 00 addx %g0, 0, %g1
200ad0c: 83 28 60 02 sll %g1, 2, %g1
200ad10: 84 00 80 01 add %g2, %g1, %g2
200ad14: fa 20 a0 04 st %i5, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
200ad18: b2 06 40 1c add %i1, %i4, %i1
200ad1c: f2 06 60 04 ld [ %i1 + 4 ], %i1
200ad20: c2 06 40 00 ld [ %i1 ], %g1
}
the_node->parent->color = RBT_BLACK;
200ad24: 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));
200ad28: 88 26 80 04 sub %i2, %g4, %g4
200ad2c: 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;
200ad30: bb 2f 60 02 sll %i5, 2, %i5
200ad34: ba 00 c0 1d add %g3, %i5, %i5
200ad38: c4 07 60 04 ld [ %i5 + 4 ], %g2
200ad3c: 80 a0 a0 00 cmp %g2, 0
200ad40: 02 bf ff b6 be 200ac18 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN
200ad44: 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];
200ad48: 89 29 20 02 sll %g4, 2, %g4
200ad4c: 82 00 80 04 add %g2, %g4, %g1
200ad50: f8 00 60 04 ld [ %g1 + 4 ], %i4
200ad54: f8 27 60 04 st %i4, [ %i5 + 4 ]
if (c->child[dir])
200ad58: c2 00 60 04 ld [ %g1 + 4 ], %g1
200ad5c: 80 a0 60 00 cmp %g1, 0
200ad60: 32 80 00 02 bne,a 200ad68 <_RBTree_Insert_unprotected+0x20c>
200ad64: 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;
200ad68: 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;
200ad6c: 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;
200ad70: 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;
200ad74: c6 21 20 04 st %g3, [ %g4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200ad78: c8 07 60 04 ld [ %i5 + 4 ], %g4
c->parent = the_node->parent;
the_node->parent = c;
200ad7c: c4 20 c0 00 st %g2, [ %g3 ]
200ad80: 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;
200ad84: 86 18 c0 04 xor %g3, %g4, %g3
200ad88: 80 a0 00 03 cmp %g0, %g3
200ad8c: 86 40 20 00 addx %g0, 0, %g3
200ad90: 87 28 e0 02 sll %g3, 2, %g3
200ad94: ba 07 40 03 add %i5, %g3, %i5
200ad98: 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;
200ad9c: c4 00 40 00 ld [ %g1 ], %g2
200ada0: 86 90 a0 00 orcc %g2, 0, %g3
200ada4: 32 bf ff a2 bne,a 200ac2c <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN
200ada8: c8 00 60 0c ld [ %g1 + 0xc ], %g4
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200adac: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
200adb0: 81 c7 e0 08 ret <== NOT EXECUTED
200adb4: 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;
200adb8: c0 27 60 0c clr [ %i5 + 0xc ]
g->color = RBT_RED;
200adbc: f8 20 a0 0c st %i4, [ %g2 + 0xc ]
200adc0: 82 10 00 1b mov %i3, %g1
200adc4: 10 bf ff 95 b 200ac18 <_RBTree_Insert_unprotected+0xbc>
200adc8: 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];
200adcc: 10 bf ff a7 b 200ac68 <_RBTree_Insert_unprotected+0x10c>
200add0: 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;
200add4: 81 c7 e0 08 ret
200add8: 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 ) )
200addc: 81 c7 e0 08 ret
200ade0: 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;
200ade4: f2 26 20 04 st %i1, [ %i0 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
200ade8: f2 26 20 0c st %i1, [ %i0 + 0xc ]
200adec: f2 26 20 08 st %i1, [ %i0 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
200adf0: f0 26 40 00 st %i0, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
200adf4: c0 26 60 08 clr [ %i1 + 8 ]
200adf8: c0 26 60 04 clr [ %i1 + 4 ]
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
200adfc: 81 c7 e0 08 ret
200ae00: 91 e8 20 00 restore %g0, 0, %o0
0200ae34 <_RBTree_Iterate_unprotected>:
const RBTree_Control *rbtree,
RBTree_Direction dir,
RBTree_Visitor visitor,
void *visitor_arg
)
{
200ae34: 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);
200ae38: 80 a0 00 19 cmp %g0, %i1
200ae3c: 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];
200ae40: 82 00 60 02 add %g1, 2, %g1
200ae44: 83 28 60 02 sll %g1, 2, %g1
200ae48: 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 ) {
200ae4c: 80 a7 60 00 cmp %i5, 0
200ae50: 12 80 00 06 bne 200ae68 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN
200ae54: 94 10 00 1b mov %i3, %o2
200ae58: 30 80 00 0e b,a 200ae90 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED
200ae5c: 80 8f 20 ff btst 0xff, %i4
200ae60: 02 80 00 0c be 200ae90 <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN
200ae64: 94 10 00 1b mov %i3, %o2
stop = (*visitor)( current, dir, visitor_arg );
200ae68: 90 10 00 1d mov %i5, %o0
200ae6c: 9f c6 80 00 call %i2
200ae70: 92 10 00 19 mov %i1, %o1
current = _RBTree_Next_unprotected( current, dir );
200ae74: 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 );
200ae78: b8 10 00 08 mov %o0, %i4
current = _RBTree_Next_unprotected( current, dir );
200ae7c: 40 00 00 07 call 200ae98 <_RBTree_Next_unprotected>
200ae80: 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 ) {
200ae84: ba 92 20 00 orcc %o0, 0, %i5
200ae88: 12 bf ff f5 bne 200ae5c <_RBTree_Iterate_unprotected+0x28>
200ae8c: b8 1f 20 01 xor %i4, 1, %i4
200ae90: 81 c7 e0 08 ret
200ae94: 81 e8 00 00 restore
02008bec <_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 )
{
2008bec: 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 ];
2008bf0: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
if ( !api )
2008bf4: 80 a7 60 00 cmp %i5, 0
2008bf8: 02 80 00 1e be 2008c70 <_RTEMS_signal_Post_switch_hook+0x84><== NEVER TAKEN
2008bfc: 01 00 00 00 nop
* Signal Processing
*/
asr = &api->Signal;
_ISR_Disable( level );
2008c00: 7f ff ea 2c call 20034b0 <sparc_disable_interrupts>
2008c04: 01 00 00 00 nop
signal_set = asr->signals_posted;
2008c08: f8 07 60 14 ld [ %i5 + 0x14 ], %i4
asr->signals_posted = 0;
2008c0c: c0 27 60 14 clr [ %i5 + 0x14 ]
_ISR_Enable( level );
2008c10: 7f ff ea 2c call 20034c0 <sparc_enable_interrupts>
2008c14: 01 00 00 00 nop
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
2008c18: 80 a7 20 00 cmp %i4, 0
2008c1c: 32 80 00 04 bne,a 2008c2c <_RTEMS_signal_Post_switch_hook+0x40>
2008c20: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
2008c24: 81 c7 e0 08 ret
2008c28: 81 e8 00 00 restore
return;
asr->nest_level += 1;
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
2008c2c: d0 07 60 10 ld [ %i5 + 0x10 ], %o0
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
2008c30: 82 00 60 01 inc %g1
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
2008c34: 94 07 bf fc add %fp, -4, %o2
2008c38: 37 00 00 3f sethi %hi(0xfc00), %i3
if ( !signal_set ) /* similar to _ASR_Are_signals_pending( asr ) */
return;
asr->nest_level += 1;
2008c3c: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
rtems_task_mode( asr->mode_set, RTEMS_ALL_MODE_MASKS, &prev_mode );
2008c40: 40 00 01 07 call 200905c <rtems_task_mode>
2008c44: 92 16 e3 ff or %i3, 0x3ff, %o1
(*asr->handler)( signal_set );
2008c48: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2008c4c: 9f c0 40 00 call %g1
2008c50: 90 10 00 1c mov %i4, %o0
asr->nest_level -= 1;
2008c54: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
2008c58: 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;
2008c5c: 82 00 7f ff add %g1, -1, %g1
rtems_task_mode( prev_mode, RTEMS_ALL_MODE_MASKS, &prev_mode );
2008c60: 92 16 e3 ff or %i3, 0x3ff, %o1
2008c64: 94 07 bf fc add %fp, -4, %o2
2008c68: 40 00 00 fd call 200905c <rtems_task_mode>
2008c6c: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
2008c70: 81 c7 e0 08 ret
2008c74: 81 e8 00 00 restore
02007fa0 <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
2007fa0: 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;
2007fa4: 03 00 80 75 sethi %hi(0x201d400), %g1
2007fa8: 82 10 62 84 or %g1, 0x284, %g1 ! 201d684 <Configuration_RTEMS_API>
2007fac: 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 )
2007fb0: 80 a7 60 00 cmp %i5, 0
2007fb4: 02 80 00 18 be 2008014 <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
2007fb8: 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++ ) {
2007fbc: 80 a6 e0 00 cmp %i3, 0
2007fc0: 02 80 00 15 be 2008014 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
2007fc4: b8 10 20 00 clr %i4
return_value = rtems_task_create(
2007fc8: d4 07 60 04 ld [ %i5 + 4 ], %o2
2007fcc: d0 07 40 00 ld [ %i5 ], %o0
2007fd0: d2 07 60 08 ld [ %i5 + 8 ], %o1
2007fd4: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
2007fd8: d8 07 60 0c ld [ %i5 + 0xc ], %o4
2007fdc: 7f ff ff 70 call 2007d9c <rtems_task_create>
2007fe0: 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 ) )
2007fe4: 94 92 20 00 orcc %o0, 0, %o2
2007fe8: 12 80 00 0d bne 200801c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2007fec: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
2007ff0: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
2007ff4: 40 00 00 0e call 200802c <rtems_task_start>
2007ff8: 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 ) )
2007ffc: 94 92 20 00 orcc %o0, 0, %o2
2008000: 12 80 00 07 bne 200801c <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2008004: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
2008008: 80 a7 00 1b cmp %i4, %i3
200800c: 12 bf ff ef bne 2007fc8 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
2008010: ba 07 60 1c add %i5, 0x1c, %i5
2008014: 81 c7 e0 08 ret
2008018: 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 );
200801c: 90 10 20 01 mov 1, %o0
2008020: 40 00 04 30 call 20090e0 <_Internal_error_Occurred>
2008024: 92 10 20 01 mov 1, %o1
0200da4c <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
200da4c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200da50: 80 a0 60 00 cmp %g1, 0
200da54: 22 80 00 0c be,a 200da84 <_RTEMS_tasks_Switch_extension+0x38>
200da58: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
tvp->tval = *tvp->ptr;
200da5c: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
200da60: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
200da64: c8 00 80 00 ld [ %g2 ], %g4
200da68: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
200da6c: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200da70: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
200da74: 80 a0 60 00 cmp %g1, 0
200da78: 32 bf ff fa bne,a 200da60 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
200da7c: 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;
200da80: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
while (tvp) {
200da84: 80 a0 60 00 cmp %g1, 0
200da88: 02 80 00 0d be 200dabc <_RTEMS_tasks_Switch_extension+0x70>
200da8c: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
200da90: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
200da94: 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;
200da98: c8 00 80 00 ld [ %g2 ], %g4
200da9c: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
200daa0: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200daa4: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
200daa8: 80 a0 60 00 cmp %g1, 0
200daac: 32 bf ff fa bne,a 200da94 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
200dab0: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
200dab4: 81 c3 e0 08 retl
200dab8: 01 00 00 00 nop
200dabc: 81 c3 e0 08 retl
02037f40 <_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
)
{
2037f40: 9d e3 bf 98 save %sp, -104, %sp
*/
static inline void _TOD_Get_uptime(
Timestamp_Control *time
)
{
_TOD_Get_with_nanoseconds( time, &_TOD.uptime );
2037f44: 13 00 81 9c sethi %hi(0x2067000), %o1
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
Timestamp_Control uptime;
#endif
Thread_Control *owning_thread = the_period->owner;
2037f48: f6 06 20 40 ld [ %i0 + 0x40 ], %i3
2037f4c: 90 07 bf f8 add %fp, -8, %o0
2037f50: 7f ff 42 77 call 200892c <_TOD_Get_with_nanoseconds>
2037f54: 92 12 62 b0 or %o1, 0x2b0, %o1
/*
* Determine elapsed wall time since period initiated.
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
2037f58: c4 1f bf f8 ldd [ %fp + -8 ], %g2
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
2037f5c: 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) {
2037f60: 03 00 81 9e sethi %hi(0x2067800), %g1
2037f64: 82 10 60 80 or %g1, 0x80, %g1 ! 2067880 <_Per_CPU_Information>
2037f68: de 00 60 10 ld [ %g1 + 0x10 ], %o7
2037f6c: ba a0 c0 1d subcc %g3, %i5, %i5
2037f70: b8 60 80 1c subx %g2, %i4, %i4
2037f74: 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;
2037f78: 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) {
2037f7c: 80 a3 c0 1b cmp %o7, %i3
2037f80: 02 80 00 05 be 2037f94 <_Rate_monotonic_Get_status+0x54>
2037f84: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4
return false;
*cpu_since_last_period = used - the_period->cpu_usage_period_initiated;
#endif
return true;
}
2037f88: b0 09 20 01 and %g4, 1, %i0
2037f8c: 81 c7 e0 08 ret
2037f90: 81 e8 00 00 restore
2037f94: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2037f98: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0
2037f9c: 86 a0 c0 0d subcc %g3, %o5, %g3
2037fa0: 84 60 80 0c subx %g2, %o4, %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
2037fa4: 9a 87 40 03 addcc %i5, %g3, %o5
2037fa8: 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))
2037fac: 80 a6 00 0c cmp %i0, %o4
2037fb0: 14 bf ff f6 bg 2037f88 <_Rate_monotonic_Get_status+0x48> <== NEVER TAKEN
2037fb4: 88 10 20 00 clr %g4
2037fb8: 02 80 00 09 be 2037fdc <_Rate_monotonic_Get_status+0x9c>
2037fbc: 80 a6 40 0d cmp %i1, %o5
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
2037fc0: 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;
2037fc4: 88 10 20 01 mov 1, %g4
2037fc8: 98 63 00 18 subx %o4, %i0, %o4
}
2037fcc: b0 09 20 01 and %g4, 1, %i0
2037fd0: d8 3e 80 00 std %o4, [ %i2 ]
2037fd4: 81 c7 e0 08 ret
2037fd8: 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))
2037fdc: 28 bf ff fa bleu,a 2037fc4 <_Rate_monotonic_Get_status+0x84>
2037fe0: 9a a3 40 19 subcc %o5, %i1, %o5
return false;
2037fe4: 10 bf ff e9 b 2037f88 <_Rate_monotonic_Get_status+0x48>
2037fe8: 88 10 20 00 clr %g4
02038390 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2038390: 9d e3 bf 98 save %sp, -104, %sp
2038394: 11 00 81 9f sethi %hi(0x2067c00), %o0
2038398: 92 10 00 18 mov %i0, %o1
203839c: 90 12 22 44 or %o0, 0x244, %o0
20383a0: 7f ff 44 37 call 200947c <_Objects_Get>
20383a4: 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 ) {
20383a8: c2 07 bf fc ld [ %fp + -4 ], %g1
20383ac: 80 a0 60 00 cmp %g1, 0
20383b0: 12 80 00 16 bne 2038408 <_Rate_monotonic_Timeout+0x78> <== NEVER TAKEN
20383b4: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
20383b8: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
20383bc: 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);
20383c0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
20383c4: 80 88 80 01 btst %g2, %g1
20383c8: 22 80 00 08 be,a 20383e8 <_Rate_monotonic_Timeout+0x58>
20383cc: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
20383d0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
20383d4: c2 07 60 08 ld [ %i5 + 8 ], %g1
20383d8: 80 a0 80 01 cmp %g2, %g1
20383dc: 02 80 00 19 be 2038440 <_Rate_monotonic_Timeout+0xb0>
20383e0: 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 ) {
20383e4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
20383e8: 80 a0 60 01 cmp %g1, 1
20383ec: 02 80 00 09 be 2038410 <_Rate_monotonic_Timeout+0x80>
20383f0: 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;
20383f4: 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;
20383f8: 03 00 81 9c sethi %hi(0x2067000), %g1
20383fc: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2067360 <_Thread_Dispatch_disable_level>
--level;
2038400: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
2038404: c4 20 63 60 st %g2, [ %g1 + 0x360 ]
2038408: 81 c7 e0 08 ret
203840c: 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;
2038410: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
2038414: 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;
2038418: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
203841c: 7f ff ff 43 call 2038128 <_Rate_monotonic_Initiate_statistics>
2038420: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2038424: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2038428: 11 00 81 9c sethi %hi(0x2067000), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
203842c: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2038430: 90 12 23 fc or %o0, 0x3fc, %o0
2038434: 7f ff 4b 52 call 200b17c <_Watchdog_Insert>
2038438: 92 07 60 10 add %i5, 0x10, %o1
203843c: 30 bf ff ef b,a 20383f8 <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2038440: 7f ff 46 f8 call 200a020 <_Thread_Clear_state>
2038444: 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 );
2038448: 10 bf ff f5 b 203841c <_Rate_monotonic_Timeout+0x8c>
203844c: 90 10 00 1d mov %i5, %o0
02037fec <_Rate_monotonic_Update_statistics>:
}
static void _Rate_monotonic_Update_statistics(
Rate_monotonic_Control *the_period
)
{
2037fec: 9d e3 bf 90 save %sp, -112, %sp
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
2037ff0: c4 06 20 58 ld [ %i0 + 0x58 ], %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
2037ff4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
/*
* Update the counts.
*/
stats = &the_period->Statistics;
stats->count++;
2037ff8: 84 00 a0 01 inc %g2
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
2037ffc: 80 a0 60 04 cmp %g1, 4
2038000: 02 80 00 32 be 20380c8 <_Rate_monotonic_Update_statistics+0xdc>
2038004: c4 26 20 58 st %g2, [ %i0 + 0x58 ]
stats->missed_count++;
/*
* Grab status for time statistics.
*/
valid_status =
2038008: 90 10 00 18 mov %i0, %o0
203800c: 92 07 bf f8 add %fp, -8, %o1
2038010: 7f ff ff cc call 2037f40 <_Rate_monotonic_Get_status>
2038014: 94 07 bf f0 add %fp, -16, %o2
_Rate_monotonic_Get_status( the_period, &since_last_period, &executed );
if (!valid_status)
2038018: 80 8a 20 ff btst 0xff, %o0
203801c: 02 80 00 21 be 20380a0 <_Rate_monotonic_Update_statistics+0xb4>
2038020: c4 1f bf f0 ldd [ %fp + -16 ], %g2
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
2038024: 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 ) )
2038028: c2 06 20 60 ld [ %i0 + 0x60 ], %g1
203802c: b6 87 40 03 addcc %i5, %g3, %i3
2038030: b4 47 00 02 addx %i4, %g2, %i2
2038034: 80 a0 40 02 cmp %g1, %g2
2038038: 04 80 00 1c ble 20380a8 <_Rate_monotonic_Update_statistics+0xbc>
203803c: f4 3e 20 70 std %i2, [ %i0 + 0x70 ]
stats->min_cpu_time = executed;
2038040: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) )
2038044: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
2038048: 80 a0 40 02 cmp %g1, %g2
203804c: 26 80 00 05 bl,a 2038060 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN
2038050: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED
2038054: 80 a0 40 02 cmp %g1, %g2
2038058: 22 80 00 28 be,a 20380f8 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN
203805c: 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 );
2038060: c4 1f bf f8 ldd [ %fp + -8 ], %g2
2038064: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4
if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) )
2038068: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
203806c: b6 87 40 03 addcc %i5, %g3, %i3
2038070: b4 47 00 02 addx %i4, %g2, %i2
2038074: 80 a0 40 02 cmp %g1, %g2
2038078: 14 80 00 1b bg 20380e4 <_Rate_monotonic_Update_statistics+0xf8>
203807c: f4 3e 20 88 std %i2, [ %i0 + 0x88 ]
2038080: 80 a0 40 02 cmp %g1, %g2
2038084: 22 80 00 15 be,a 20380d8 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN
2038088: 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 ) )
203808c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED
2038090: 80 a0 40 02 cmp %g1, %g2
2038094: 16 80 00 1e bge 203810c <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN
2038098: 01 00 00 00 nop
stats->max_wall_time = since_last_period;
203809c: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED
20380a0: 81 c7 e0 08 ret
20380a4: 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 ) )
20380a8: 32 bf ff e8 bne,a 2038048 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN
20380ac: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED
20380b0: c2 06 20 64 ld [ %i0 + 0x64 ], %g1
20380b4: 80 a0 40 03 cmp %g1, %g3
20380b8: 28 bf ff e4 bleu,a 2038048 <_Rate_monotonic_Update_statistics+0x5c>
20380bc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
stats->min_cpu_time = executed;
20380c0: 10 bf ff e1 b 2038044 <_Rate_monotonic_Update_statistics+0x58>
20380c4: c4 3e 20 60 std %g2, [ %i0 + 0x60 ]
*/
stats = &the_period->Statistics;
stats->count++;
if ( the_period->state == RATE_MONOTONIC_EXPIRED )
stats->missed_count++;
20380c8: c2 06 20 5c ld [ %i0 + 0x5c ], %g1
20380cc: 82 00 60 01 inc %g1
20380d0: 10 bf ff ce b 2038008 <_Rate_monotonic_Update_statistics+0x1c>
20380d4: 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 ) )
20380d8: 80 a0 40 03 cmp %g1, %g3
20380dc: 28 bf ff ed bleu,a 2038090 <_Rate_monotonic_Update_statistics+0xa4>
20380e0: 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 ) )
20380e4: c2 06 20 80 ld [ %i0 + 0x80 ], %g1
20380e8: 80 a0 40 02 cmp %g1, %g2
20380ec: 06 bf ff ec bl 203809c <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN
20380f0: c4 3e 20 78 std %g2, [ %i0 + 0x78 ]
20380f4: 30 80 00 06 b,a 203810c <_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 ) )
20380f8: 80 a0 40 03 cmp %g1, %g3
20380fc: 3a bf ff da bcc,a 2038064 <_Rate_monotonic_Update_statistics+0x78>
2038100: c4 1f bf f8 ldd [ %fp + -8 ], %g2
stats->max_cpu_time = executed;
2038104: 10 bf ff d7 b 2038060 <_Rate_monotonic_Update_statistics+0x74>
2038108: 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 ) )
203810c: 12 bf ff e5 bne 20380a0 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN
2038110: 01 00 00 00 nop
2038114: c2 06 20 84 ld [ %i0 + 0x84 ], %g1
2038118: 80 a0 40 03 cmp %g1, %g3
203811c: 2a bf ff e1 bcs,a 20380a0 <_Rate_monotonic_Update_statistics+0xb4>
2038120: c4 3e 20 80 std %g2, [ %i0 + 0x80 ]
2038124: 30 bf ff df b,a 20380a0 <_Rate_monotonic_Update_statistics+0xb4>
0200a60c <_Scheduler_CBS_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_CBS_Allocate(
Thread_Control *the_thread
)
{
200a60c: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_CBS_Per_thread *schinfo;
sched = _Workspace_Allocate(sizeof(Scheduler_CBS_Per_thread));
200a610: 40 00 07 3f call 200c30c <_Workspace_Allocate>
200a614: 90 10 20 1c mov 0x1c, %o0
if ( sched ) {
200a618: 80 a2 20 00 cmp %o0, 0
200a61c: 02 80 00 06 be 200a634 <_Scheduler_CBS_Allocate+0x28> <== NEVER TAKEN
200a620: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
200a624: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_CBS_Per_thread *)(the_thread->scheduler_info);
schinfo->edf_per_thread.thread = the_thread;
200a628: f0 22 00 00 st %i0, [ %o0 ]
schinfo->edf_per_thread.queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
200a62c: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
schinfo->cbs_server = NULL;
200a630: c0 22 20 18 clr [ %o0 + 0x18 ]
}
return sched;
}
200a634: 81 c7 e0 08 ret
200a638: 91 e8 00 08 restore %g0, %o0, %o0
0200b9e0 <_Scheduler_CBS_Budget_callout>:
Scheduler_CBS_Server **_Scheduler_CBS_Server_list;
void _Scheduler_CBS_Budget_callout(
Thread_Control *the_thread
)
{
200b9e0: 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;
200b9e4: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
200b9e8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200b9ec: 80 a0 40 09 cmp %g1, %o1
200b9f0: 32 80 00 02 bne,a 200b9f8 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN
200b9f4: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
200b9f8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200b9fc: 80 a0 40 09 cmp %g1, %o1
200ba00: 02 80 00 04 be 200ba10 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN
200ba04: 90 10 00 18 mov %i0, %o0
_Thread_Change_priority(the_thread, new_priority, true);
200ba08: 40 00 01 92 call 200c050 <_Thread_Change_priority>
200ba0c: 94 10 20 01 mov 1, %o2
/* Invoke callback function if any. */
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
200ba10: fa 06 20 88 ld [ %i0 + 0x88 ], %i5
if ( sched_info->cbs_server->cbs_budget_overrun ) {
200ba14: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200ba18: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200ba1c: 80 a0 a0 00 cmp %g2, 0
200ba20: 02 80 00 09 be 200ba44 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN
200ba24: 01 00 00 00 nop
_Scheduler_CBS_Get_server_id(
200ba28: d0 00 40 00 ld [ %g1 ], %o0
200ba2c: 7f ff ff d5 call 200b980 <_Scheduler_CBS_Get_server_id>
200ba30: 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 );
200ba34: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200ba38: c2 00 60 0c ld [ %g1 + 0xc ], %g1
200ba3c: 9f c0 40 00 call %g1
200ba40: d0 07 bf fc ld [ %fp + -4 ], %o0
200ba44: 81 c7 e0 08 ret
200ba48: 81 e8 00 00 restore
0200b538 <_Scheduler_CBS_Cleanup>:
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Cleanup (void)
{
200b538: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b53c: 39 00 80 83 sethi %hi(0x2020c00), %i4
200b540: c2 07 22 c0 ld [ %i4 + 0x2c0 ], %g1 ! 2020ec0 <_Scheduler_CBS_Maximum_servers>
200b544: 80 a0 60 00 cmp %g1, 0
200b548: 02 80 00 18 be 200b5a8 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN
200b54c: 03 00 80 88 sethi %hi(0x2022000), %g1
200b550: 37 00 80 88 sethi %hi(0x2022000), %i3
200b554: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2 ! 20220a8 <_Scheduler_CBS_Server_list>
200b558: ba 10 20 00 clr %i5
200b55c: b8 17 22 c0 or %i4, 0x2c0, %i4
if ( _Scheduler_CBS_Server_list[ i ] )
200b560: 83 2f 60 02 sll %i5, 2, %g1
200b564: c2 00 80 01 ld [ %g2 + %g1 ], %g1
200b568: 80 a0 60 00 cmp %g1, 0
200b56c: 02 80 00 05 be 200b580 <_Scheduler_CBS_Cleanup+0x48>
200b570: 90 10 00 1d mov %i5, %o0
_Scheduler_CBS_Destroy_server( i );
200b574: 40 00 00 46 call 200b68c <_Scheduler_CBS_Destroy_server>
200b578: 01 00 00 00 nop
200b57c: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2
int _Scheduler_CBS_Cleanup (void)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200b580: c2 07 00 00 ld [ %i4 ], %g1
200b584: ba 07 60 01 inc %i5
200b588: 80 a0 40 1d cmp %g1, %i5
200b58c: 18 bf ff f6 bgu 200b564 <_Scheduler_CBS_Cleanup+0x2c>
200b590: 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;
}
200b594: 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 );
200b598: 40 00 08 6f call 200d754 <_Workspace_Free>
200b59c: 90 10 00 02 mov %g2, %o0
return SCHEDULER_CBS_OK;
}
200b5a0: 81 c7 e0 08 ret
200b5a4: 81 e8 00 00 restore
200b5a8: 10 bf ff fb b 200b594 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED
200b5ac: c4 00 60 a8 ld [ %g1 + 0xa8 ], %g2 <== NOT EXECUTED
0200b5b0 <_Scheduler_CBS_Create_server>:
int _Scheduler_CBS_Create_server (
Scheduler_CBS_Parameters *params,
Scheduler_CBS_Budget_overrun budget_overrun_callback,
rtems_id *server_id
)
{
200b5b0: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
Scheduler_CBS_Server *the_server;
if ( params->budget <= 0 ||
200b5b4: c2 06 20 04 ld [ %i0 + 4 ], %g1
200b5b8: 80 a0 60 00 cmp %g1, 0
200b5bc: 04 80 00 30 ble 200b67c <_Scheduler_CBS_Create_server+0xcc>
200b5c0: b8 10 00 18 mov %i0, %i4
200b5c4: c2 06 00 00 ld [ %i0 ], %g1
200b5c8: 80 a0 60 00 cmp %g1, 0
200b5cc: 04 80 00 2c ble 200b67c <_Scheduler_CBS_Create_server+0xcc>
200b5d0: 03 00 80 83 sethi %hi(0x2020c00), %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++ ) {
200b5d4: c8 00 62 c0 ld [ %g1 + 0x2c0 ], %g4 ! 2020ec0 <_Scheduler_CBS_Maximum_servers>
200b5d8: 80 a1 20 00 cmp %g4, 0
200b5dc: 02 80 00 11 be 200b620 <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN
200b5e0: 37 00 80 88 sethi %hi(0x2022000), %i3
if ( !_Scheduler_CBS_Server_list[i] )
200b5e4: fa 06 e0 a8 ld [ %i3 + 0xa8 ], %i5 ! 20220a8 <_Scheduler_CBS_Server_list>
200b5e8: c2 07 40 00 ld [ %i5 ], %g1
200b5ec: 80 a0 60 00 cmp %g1, 0
200b5f0: 02 80 00 21 be 200b674 <_Scheduler_CBS_Create_server+0xc4>
200b5f4: b0 10 20 00 clr %i0
200b5f8: 10 80 00 06 b 200b610 <_Scheduler_CBS_Create_server+0x60>
200b5fc: 82 10 20 00 clr %g1
200b600: c6 07 40 02 ld [ %i5 + %g2 ], %g3
200b604: 80 a0 e0 00 cmp %g3, 0
200b608: 02 80 00 08 be 200b628 <_Scheduler_CBS_Create_server+0x78>
200b60c: 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++ ) {
200b610: 82 00 60 01 inc %g1
200b614: 80 a0 40 04 cmp %g1, %g4
200b618: 12 bf ff fa bne 200b600 <_Scheduler_CBS_Create_server+0x50>
200b61c: 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;
200b620: 81 c7 e0 08 ret
200b624: 91 e8 3f e6 restore %g0, -26, %o0
*server_id = i;
200b628: c2 26 80 00 st %g1, [ %i2 ]
_Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *)
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
200b62c: 40 00 08 42 call 200d734 <_Workspace_Allocate>
200b630: 90 10 20 10 mov 0x10, %o0
the_server = _Scheduler_CBS_Server_list[*server_id];
200b634: 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 *)
200b638: d0 27 40 18 st %o0, [ %i5 + %i0 ]
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
the_server = _Scheduler_CBS_Server_list[*server_id];
200b63c: c4 06 e0 a8 ld [ %i3 + 0xa8 ], %g2
200b640: 83 28 60 02 sll %g1, 2, %g1
200b644: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_server )
200b648: 80 a0 60 00 cmp %g1, 0
200b64c: 02 80 00 0e be 200b684 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN
200b650: 86 10 3f ff mov -1, %g3
return SCHEDULER_CBS_ERROR_NO_MEMORY;
the_server->parameters = *params;
200b654: c4 07 00 00 ld [ %i4 ], %g2
200b658: c4 20 60 04 st %g2, [ %g1 + 4 ]
200b65c: c4 07 20 04 ld [ %i4 + 4 ], %g2
the_server->task_id = -1;
200b660: 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;
200b664: c4 20 60 08 st %g2, [ %g1 + 8 ]
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
200b668: f2 20 60 0c st %i1, [ %g1 + 0xc ]
return SCHEDULER_CBS_OK;
200b66c: 81 c7 e0 08 ret
200b670: 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] )
200b674: 10 bf ff ed b 200b628 <_Scheduler_CBS_Create_server+0x78>
200b678: 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;
200b67c: 81 c7 e0 08 ret
200b680: 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;
}
200b684: 81 c7 e0 08 ret <== NOT EXECUTED
200b688: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED
0200b70c <_Scheduler_CBS_Detach_thread>:
int _Scheduler_CBS_Detach_thread (
Scheduler_CBS_Server_id server_id,
rtems_id task_id
)
{
200b70c: 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);
200b710: 92 07 bf fc add %fp, -4, %o1
200b714: 40 00 03 ad call 200c5c8 <_Thread_Get>
200b718: 90 10 00 19 mov %i1, %o0
/* The routine _Thread_Get may disable dispatch and not enable again. */
if ( the_thread ) {
200b71c: ba 92 20 00 orcc %o0, 0, %i5
200b720: 02 80 00 1e be 200b798 <_Scheduler_CBS_Detach_thread+0x8c>
200b724: 01 00 00 00 nop
_Thread_Enable_dispatch();
200b728: 40 00 03 9c call 200c598 <_Thread_Enable_dispatch>
200b72c: 01 00 00 00 nop
}
if ( server_id >= _Scheduler_CBS_Maximum_servers )
200b730: 03 00 80 83 sethi %hi(0x2020c00), %g1
200b734: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 ! 2020ec0 <_Scheduler_CBS_Maximum_servers>
200b738: 80 a6 00 01 cmp %i0, %g1
200b73c: 1a 80 00 17 bcc 200b798 <_Scheduler_CBS_Detach_thread+0x8c>
200b740: 03 00 80 88 sethi %hi(0x2022000), %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] )
200b744: c2 00 60 a8 ld [ %g1 + 0xa8 ], %g1 ! 20220a8 <_Scheduler_CBS_Server_list>
200b748: b1 2e 20 02 sll %i0, 2, %i0
200b74c: c2 00 40 18 ld [ %g1 + %i0 ], %g1
200b750: 80 a0 60 00 cmp %g1, 0
200b754: 02 80 00 13 be 200b7a0 <_Scheduler_CBS_Detach_thread+0x94>
200b758: 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 )
200b75c: c4 00 40 00 ld [ %g1 ], %g2
200b760: 80 a0 80 19 cmp %g2, %i1
200b764: 12 80 00 0d bne 200b798 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN
200b768: 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;
200b76c: c8 07 60 88 ld [ %i5 + 0x88 ], %g4
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200b770: 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;
200b774: 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;
200b778: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2
the_thread->is_preemptible = the_thread->Start.is_preemptible;
200b77c: 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;
200b780: c0 21 20 18 clr [ %g4 + 0x18 ]
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200b784: c6 27 60 78 st %g3, [ %i5 + 0x78 ]
the_thread->budget_callout = the_thread->Start.budget_callout;
200b788: c4 27 60 7c st %g2, [ %i5 + 0x7c ]
the_thread->is_preemptible = the_thread->Start.is_preemptible;
200b78c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
return SCHEDULER_CBS_OK;
200b790: 81 c7 e0 08 ret
200b794: 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;
200b798: 81 c7 e0 08 ret
200b79c: 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;
}
200b7a0: 81 c7 e0 08 ret
200b7a4: 91 e8 3f e7 restore %g0, -25, %o0
0200b980 <_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++ ) {
200b980: 03 00 80 83 sethi %hi(0x2020c00), %g1
200b984: c6 00 62 c0 ld [ %g1 + 0x2c0 ], %g3 ! 2020ec0 <_Scheduler_CBS_Maximum_servers>
200b988: 80 a0 e0 00 cmp %g3, 0
200b98c: 02 80 00 11 be 200b9d0 <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN
200b990: 03 00 80 88 sethi %hi(0x2022000), %g1
200b994: c8 00 60 a8 ld [ %g1 + 0xa8 ], %g4 ! 20220a8 <_Scheduler_CBS_Server_list>
200b998: 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 (
200b99c: 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] &&
200b9a0: c4 01 00 02 ld [ %g4 + %g2 ], %g2
200b9a4: 80 a0 a0 00 cmp %g2, 0
200b9a8: 22 80 00 07 be,a 200b9c4 <_Scheduler_CBS_Get_server_id+0x44>
200b9ac: 82 00 60 01 inc %g1
200b9b0: c4 00 80 00 ld [ %g2 ], %g2
200b9b4: 80 a0 80 08 cmp %g2, %o0
200b9b8: 22 80 00 08 be,a 200b9d8 <_Scheduler_CBS_Get_server_id+0x58>
200b9bc: 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++ ) {
200b9c0: 82 00 60 01 inc %g1
200b9c4: 80 a0 40 03 cmp %g1, %g3
200b9c8: 12 bf ff f6 bne 200b9a0 <_Scheduler_CBS_Get_server_id+0x20>
200b9cc: 85 28 60 02 sll %g1, 2, %g2
*server_id = i;
return SCHEDULER_CBS_OK;
}
}
return SCHEDULER_CBS_ERROR_NOSERVER;
}
200b9d0: 81 c3 e0 08 retl
200b9d4: 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;
200b9d8: 81 c3 e0 08 retl
200b9dc: 90 10 20 00 clr %o0
0200ba4c <_Scheduler_CBS_Initialize>:
}
}
int _Scheduler_CBS_Initialize(void)
{
200ba4c: 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*) );
200ba50: 3b 00 80 83 sethi %hi(0x2020c00), %i5
200ba54: d0 07 62 c0 ld [ %i5 + 0x2c0 ], %o0 ! 2020ec0 <_Scheduler_CBS_Maximum_servers>
}
int _Scheduler_CBS_Initialize(void)
{
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
200ba58: 40 00 07 37 call 200d734 <_Workspace_Allocate>
200ba5c: 91 2a 20 02 sll %o0, 2, %o0
200ba60: 09 00 80 88 sethi %hi(0x2022000), %g4
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
200ba64: 80 a2 20 00 cmp %o0, 0
200ba68: 02 80 00 10 be 200baa8 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN
200ba6c: d0 21 20 a8 st %o0, [ %g4 + 0xa8 ]
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
200ba70: c6 07 62 c0 ld [ %i5 + 0x2c0 ], %g3
200ba74: 80 a0 e0 00 cmp %g3, 0
200ba78: 12 80 00 05 bne 200ba8c <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN
200ba7c: 82 10 20 00 clr %g1
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
200ba80: 81 c7 e0 08 ret <== NOT EXECUTED
200ba84: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED
200ba88: d0 01 20 a8 ld [ %g4 + 0xa8 ], %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;
200ba8c: 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++) {
200ba90: 82 00 60 01 inc %g1
200ba94: 80 a0 40 03 cmp %g1, %g3
200ba98: 12 bf ff fc bne 200ba88 <_Scheduler_CBS_Initialize+0x3c>
200ba9c: c0 22 00 02 clr [ %o0 + %g2 ]
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
200baa0: 81 c7 e0 08 ret
200baa4: 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;
200baa8: 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;
}
200baac: 81 c7 e0 08 ret <== NOT EXECUTED
200bab0: 81 e8 00 00 restore <== NOT EXECUTED
0200a63c <_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;
200a63c: c2 02 20 88 ld [ %o0 + 0x88 ], %g1
if (deadline) {
200a640: 80 a2 60 00 cmp %o1, 0
200a644: 02 80 00 11 be 200a688 <_Scheduler_CBS_Release_job+0x4c>
200a648: c2 00 60 18 ld [ %g1 + 0x18 ], %g1
/* Initializing or shifting deadline. */
if (serv_info)
200a64c: 80 a0 60 00 cmp %g1, 0
200a650: 02 80 00 13 be 200a69c <_Scheduler_CBS_Release_job+0x60>
200a654: 07 00 80 80 sethi %hi(0x2020000), %g3
new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline)
200a658: c4 00 60 04 ld [ %g1 + 4 ], %g2
200a65c: d2 00 e0 7c ld [ %g3 + 0x7c ], %o1
200a660: 92 02 40 02 add %o1, %g2, %o1
200a664: 05 20 00 00 sethi %hi(0x80000000), %g2
200a668: 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;
200a66c: c2 00 60 08 ld [ %g1 + 8 ], %g1
200a670: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
the_thread->real_priority = new_priority;
200a674: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
_Thread_Change_priority(the_thread, new_priority, true);
200a678: 94 10 20 01 mov 1, %o2
200a67c: 82 13 c0 00 mov %o7, %g1
200a680: 40 00 01 3a call 200ab68 <_Thread_Change_priority>
200a684: 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)
200a688: 80 a0 60 00 cmp %g1, 0
200a68c: 12 bf ff f8 bne 200a66c <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN
200a690: d2 02 20 ac ld [ %o0 + 0xac ], %o1
the_thread->cpu_time_budget = serv_info->parameters.budget;
the_thread->real_priority = new_priority;
200a694: 10 bf ff f9 b 200a678 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED
200a698: 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)
200a69c: 03 00 80 80 sethi %hi(0x2020000), %g1
200a6a0: c2 00 60 7c ld [ %g1 + 0x7c ], %g1 ! 202007c <_Watchdog_Ticks_since_boot>
200a6a4: 92 02 40 01 add %o1, %g1, %o1
200a6a8: 03 20 00 00 sethi %hi(0x80000000), %g1
200a6ac: 10 bf ff f2 b 200a674 <_Scheduler_CBS_Release_job+0x38>
200a6b0: 92 2a 40 01 andn %o1, %g1, %o1
0200a6b4 <_Scheduler_CBS_Unblock>:
#include <rtems/score/schedulercbs.h>
void _Scheduler_CBS_Unblock(
Thread_Control *the_thread
)
{
200a6b4: 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);
200a6b8: 40 00 00 50 call 200a7f8 <_Scheduler_EDF_Enqueue>
200a6bc: 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;
200a6c0: c2 06 20 88 ld [ %i0 + 0x88 ], %g1
200a6c4: 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) {
200a6c8: 80 a7 60 00 cmp %i5, 0
200a6cc: 02 80 00 19 be 200a730 <_Scheduler_CBS_Unblock+0x7c>
200a6d0: 03 00 80 80 sethi %hi(0x2020000), %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 ) {
200a6d4: 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 -
200a6d8: d0 00 60 7c ld [ %g1 + 0x7c ], %o0
200a6dc: f8 06 20 18 ld [ %i0 + 0x18 ], %i4
_Watchdog_Ticks_since_boot;
if ( deadline*budget_left > budget*deadline_left ) {
200a6e0: 40 00 41 03 call 201aaec <.umul>
200a6e4: 90 27 00 08 sub %i4, %o0, %o0
200a6e8: d2 06 20 74 ld [ %i0 + 0x74 ], %o1
200a6ec: b6 10 00 08 mov %o0, %i3
200a6f0: 40 00 40 ff call 201aaec <.umul>
200a6f4: d0 07 60 08 ld [ %i5 + 8 ], %o0
200a6f8: 80 a6 c0 08 cmp %i3, %o0
200a6fc: 24 80 00 0e ble,a 200a734 <_Scheduler_CBS_Unblock+0x80>
200a700: 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;
200a704: d2 06 20 ac ld [ %i0 + 0xac ], %o1
if ( the_thread->real_priority != new_priority )
200a708: 80 a7 00 09 cmp %i4, %o1
200a70c: 32 80 00 02 bne,a 200a714 <_Scheduler_CBS_Unblock+0x60>
200a710: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
200a714: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
200a718: 80 a2 00 09 cmp %o0, %o1
200a71c: 02 80 00 07 be 200a738 <_Scheduler_CBS_Unblock+0x84>
200a720: 3b 00 80 81 sethi %hi(0x2020400), %i5
_Thread_Change_priority(the_thread, new_priority, true);
200a724: 90 10 00 18 mov %i0, %o0
200a728: 40 00 01 10 call 200ab68 <_Thread_Change_priority>
200a72c: 94 10 20 01 mov 1, %o2
200a730: 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,
200a734: 3b 00 80 81 sethi %hi(0x2020400), %i5
200a738: ba 17 60 b0 or %i5, 0xb0, %i5 ! 20204b0 <_Per_CPU_Information>
200a73c: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200a740: d2 00 60 14 ld [ %g1 + 0x14 ], %o1
200a744: 03 00 80 7c sethi %hi(0x201f000), %g1
200a748: c2 00 63 24 ld [ %g1 + 0x324 ], %g1 ! 201f324 <_Scheduler+0x30>
200a74c: 9f c0 40 00 call %g1
200a750: 01 00 00 00 nop
200a754: 80 a2 20 00 cmp %o0, 0
200a758: 04 80 00 0a ble 200a780 <_Scheduler_CBS_Unblock+0xcc>
200a75c: 01 00 00 00 nop
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
200a760: 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;
200a764: f0 27 60 14 st %i0, [ %i5 + 0x14 ]
if ( _Thread_Executing->is_preemptible ||
200a768: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
200a76c: 80 a0 60 00 cmp %g1, 0
200a770: 22 80 00 06 be,a 200a788 <_Scheduler_CBS_Unblock+0xd4>
200a774: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a778: 82 10 20 01 mov 1, %g1
200a77c: c2 2f 60 0c stb %g1, [ %i5 + 0xc ]
200a780: 81 c7 e0 08 ret
200a784: 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 ||
200a788: 80 a0 60 00 cmp %g1, 0
200a78c: 12 bf ff fd bne 200a780 <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN
200a790: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a794: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED
200a798: 30 bf ff fa b,a 200a780 <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED
0200a60c <_Scheduler_EDF_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_EDF_Allocate(
Thread_Control *the_thread
)
{
200a60c: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_EDF_Per_thread *schinfo;
sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) );
200a610: 40 00 07 16 call 200c268 <_Workspace_Allocate>
200a614: 90 10 20 18 mov 0x18, %o0
if ( sched ) {
200a618: 80 a2 20 00 cmp %o0, 0
200a61c: 02 80 00 05 be 200a630 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN
200a620: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
200a624: d0 26 20 88 st %o0, [ %i0 + 0x88 ]
schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info);
schinfo->thread = the_thread;
200a628: f0 22 00 00 st %i0, [ %o0 ]
schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
200a62c: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
}
return sched;
}
200a630: 81 c7 e0 08 ret
200a634: 91 e8 00 08 restore %g0, %o0, %o0
0200a7f0 <_Scheduler_EDF_Unblock>:
#include <rtems/score/scheduleredf.h>
void _Scheduler_EDF_Unblock(
Thread_Control *the_thread
)
{
200a7f0: 9d e3 bf a0 save %sp, -96, %sp
_Scheduler_EDF_Enqueue(the_thread);
200a7f4: 7f ff ff a8 call 200a694 <_Scheduler_EDF_Enqueue>
200a7f8: 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(
200a7fc: 3b 00 80 80 sethi %hi(0x2020000), %i5
200a800: ba 17 63 f0 or %i5, 0x3f0, %i5 ! 20203f0 <_Per_CPU_Information>
200a804: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200a808: d0 00 60 14 ld [ %g1 + 0x14 ], %o0
200a80c: 03 00 80 7c sethi %hi(0x201f000), %g1
200a810: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 201f274 <_Scheduler+0x30>
200a814: 9f c0 40 00 call %g1
200a818: d2 06 20 14 ld [ %i0 + 0x14 ], %o1
200a81c: 80 a2 20 00 cmp %o0, 0
200a820: 26 80 00 04 bl,a 200a830 <_Scheduler_EDF_Unblock+0x40>
200a824: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200a828: 81 c7 e0 08 ret
200a82c: 81 e8 00 00 restore
_Thread_Heir->current_priority,
the_thread->current_priority )) {
_Thread_Heir = the_thread;
200a830: f0 27 60 14 st %i0, [ %i5 + 0x14 ]
if ( _Thread_Executing->is_preemptible ||
200a834: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1
200a838: 80 a0 60 00 cmp %g1, 0
200a83c: 22 80 00 06 be,a 200a854 <_Scheduler_EDF_Unblock+0x64>
200a840: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a844: 82 10 20 01 mov 1, %g1
200a848: c2 2f 60 0c stb %g1, [ %i5 + 0xc ]
200a84c: 81 c7 e0 08 ret
200a850: 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 ||
200a854: 80 a0 60 00 cmp %g1, 0
200a858: 12 bf ff f4 bne 200a828 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN
200a85c: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
200a860: c2 2f 60 0c stb %g1, [ %i5 + 0xc ] <== NOT EXECUTED
200a864: 30 bf ff fa b,a 200a84c <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED
02009f60 <_Scheduler_priority_Tick>:
#include <rtems/system.h>
#include <rtems/score/schedulerpriority.h>
void _Scheduler_priority_Tick( void )
{
2009f60: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *executing;
executing = _Thread_Executing;
2009f64: 03 00 80 7a sethi %hi(0x201e800), %g1
2009f68: d0 00 60 50 ld [ %g1 + 0x50 ], %o0 ! 201e850 <_Per_CPU_Information+0x10>
/*
* If the thread is not preemptible or is not ready, then
* just return.
*/
if ( !executing->is_preemptible )
2009f6c: c2 0a 20 70 ldub [ %o0 + 0x70 ], %g1
2009f70: 80 a0 60 00 cmp %g1, 0
2009f74: 02 80 00 26 be 200a00c <_Scheduler_priority_Tick+0xac>
2009f78: 01 00 00 00 nop
return;
if ( !_States_Is_ready( executing->current_state ) )
2009f7c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
2009f80: 80 a0 60 00 cmp %g1, 0
2009f84: 12 80 00 22 bne 200a00c <_Scheduler_priority_Tick+0xac>
2009f88: 01 00 00 00 nop
/*
* The cpu budget algorithm determines what happens next.
*/
switch ( executing->budget_algorithm ) {
2009f8c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1
2009f90: 80 a0 60 01 cmp %g1, 1
2009f94: 0a 80 00 07 bcs 2009fb0 <_Scheduler_priority_Tick+0x50>
2009f98: 80 a0 60 02 cmp %g1, 2
2009f9c: 28 80 00 10 bleu,a 2009fdc <_Scheduler_priority_Tick+0x7c>
2009fa0: c2 02 20 74 ld [ %o0 + 0x74 ], %g1
2009fa4: 80 a0 60 03 cmp %g1, 3
2009fa8: 22 80 00 04 be,a 2009fb8 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN
2009fac: c2 02 20 74 ld [ %o0 + 0x74 ], %g1
2009fb0: 81 c7 e0 08 ret
2009fb4: 81 e8 00 00 restore
}
break;
#if defined(RTEMS_SCORE_THREAD_ENABLE_SCHEDULER_CALLOUT)
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
if ( --executing->cpu_time_budget == 0 )
2009fb8: 82 00 7f ff add %g1, -1, %g1
2009fbc: 80 a0 60 00 cmp %g1, 0
2009fc0: 12 bf ff fc bne 2009fb0 <_Scheduler_priority_Tick+0x50>
2009fc4: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
(*executing->budget_callout)( executing );
2009fc8: c2 02 20 7c ld [ %o0 + 0x7c ], %g1
2009fcc: 9f c0 40 00 call %g1
2009fd0: 01 00 00 00 nop
2009fd4: 81 c7 e0 08 ret
2009fd8: 81 e8 00 00 restore
case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE:
#if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE)
case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE:
#endif
if ( (int)(--executing->cpu_time_budget) <= 0 ) {
2009fdc: 82 00 7f ff add %g1, -1, %g1
2009fe0: 80 a0 60 00 cmp %g1, 0
2009fe4: 14 bf ff f3 bg 2009fb0 <_Scheduler_priority_Tick+0x50>
2009fe8: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
* always operates on the scheduler that 'owns' the currently executing
* thread.
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void )
{
_Scheduler.Operations.yield();
2009fec: 03 00 80 75 sethi %hi(0x201d400), %g1
2009ff0: c2 00 63 10 ld [ %g1 + 0x310 ], %g1 ! 201d710 <_Scheduler+0xc>
2009ff4: 9f c0 40 00 call %g1
2009ff8: d0 27 bf fc st %o0, [ %fp + -4 ]
* executing thread's timeslice is reset. Otherwise, the
* currently executing thread is placed at the rear of the
* FIFO for this priority and a new heir is selected.
*/
_Scheduler_Yield();
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
2009ffc: 03 00 80 78 sethi %hi(0x201e000), %g1
200a000: d0 07 bf fc ld [ %fp + -4 ], %o0
200a004: c2 00 62 80 ld [ %g1 + 0x280 ], %g1
200a008: c2 22 20 74 st %g1, [ %o0 + 0x74 ]
200a00c: 81 c7 e0 08 ret
200a010: 81 e8 00 00 restore
0200a808 <_Scheduler_simple_Ready_queue_enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
200a808: 03 00 80 79 sethi %hi(0x201e400), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
200a80c: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201e704 <_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 ) {
200a810: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
200a814: c2 00 40 00 ld [ %g1 ], %g1
200a818: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
200a81c: 80 a0 80 03 cmp %g2, %g3
200a820: 3a 80 00 08 bcc,a 200a840 <_Scheduler_simple_Ready_queue_enqueue_first+0x38>
200a824: 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 ) {
200a828: 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 ) {
200a82c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
200a830: 80 a0 80 03 cmp %g2, %g3
200a834: 2a bf ff fe bcs,a 200a82c <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN
200a838: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
current = (Thread_Control *)current->Object.Node.previous;
200a83c: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
200a840: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
200a844: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
200a848: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
200a84c: c4 22 00 00 st %g2, [ %o0 ]
before_node->previous = the_node;
200a850: 81 c3 e0 08 retl
200a854: d0 20 a0 04 st %o0, [ %g2 + 4 ]
02008808 <_TOD_Validate>:
};
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
2008808: 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();
200880c: 03 00 80 75 sethi %hi(0x201d400), %g1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
2008810: d2 00 63 2c ld [ %g1 + 0x32c ], %o1 ! 201d72c <Configuration+0xc>
2008814: 11 00 03 d0 sethi %hi(0xf4000), %o0
2008818: 40 00 4a d8 call 201b378 <.udiv>
200881c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
2008820: 80 a6 20 00 cmp %i0, 0
2008824: 02 80 00 2c be 20088d4 <_TOD_Validate+0xcc> <== NEVER TAKEN
2008828: 82 10 20 00 clr %g1
200882c: c4 06 20 18 ld [ %i0 + 0x18 ], %g2
2008830: 80 a2 00 02 cmp %o0, %g2
2008834: 28 80 00 26 bleu,a 20088cc <_TOD_Validate+0xc4>
2008838: b0 08 60 01 and %g1, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
200883c: c4 06 20 14 ld [ %i0 + 0x14 ], %g2
2008840: 80 a0 a0 3b cmp %g2, 0x3b
2008844: 38 80 00 22 bgu,a 20088cc <_TOD_Validate+0xc4>
2008848: b0 08 60 01 and %g1, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
200884c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
2008850: 80 a0 a0 3b cmp %g2, 0x3b
2008854: 38 80 00 1e bgu,a 20088cc <_TOD_Validate+0xc4>
2008858: b0 08 60 01 and %g1, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
200885c: c4 06 20 0c ld [ %i0 + 0xc ], %g2
2008860: 80 a0 a0 17 cmp %g2, 0x17
2008864: 38 80 00 1a bgu,a 20088cc <_TOD_Validate+0xc4>
2008868: b0 08 60 01 and %g1, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
200886c: 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) ||
2008870: 80 a0 a0 00 cmp %g2, 0
2008874: 02 80 00 15 be 20088c8 <_TOD_Validate+0xc0> <== NEVER TAKEN
2008878: 80 a0 a0 0c cmp %g2, 0xc
(the_tod->month == 0) ||
200887c: 38 80 00 14 bgu,a 20088cc <_TOD_Validate+0xc4>
2008880: b0 08 60 01 and %g1, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2008884: 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) ||
2008888: 80 a0 e7 c3 cmp %g3, 0x7c3
200888c: 28 80 00 10 bleu,a 20088cc <_TOD_Validate+0xc4>
2008890: b0 08 60 01 and %g1, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2008894: 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) ||
2008898: 80 a1 20 00 cmp %g4, 0
200889c: 02 80 00 0b be 20088c8 <_TOD_Validate+0xc0> <== NEVER TAKEN
20088a0: 80 88 e0 03 btst 3, %g3
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
20088a4: 32 80 00 0f bne,a 20088e0 <_TOD_Validate+0xd8>
20088a8: 85 28 a0 02 sll %g2, 2, %g2
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
20088ac: 82 00 a0 0d add %g2, 0xd, %g1
20088b0: 05 00 80 7a sethi %hi(0x201e800), %g2
20088b4: 83 28 60 02 sll %g1, 2, %g1
20088b8: 84 10 a1 20 or %g2, 0x120, %g2
20088bc: 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 )
20088c0: 80 a0 40 04 cmp %g1, %g4
20088c4: 82 60 3f ff subx %g0, -1, %g1
return false;
return true;
}
20088c8: b0 08 60 01 and %g1, 1, %i0
20088cc: 81 c7 e0 08 ret
20088d0: 81 e8 00 00 restore
20088d4: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED
20088d8: 81 c7 e0 08 ret <== NOT EXECUTED
20088dc: 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 ];
20088e0: 03 00 80 7a sethi %hi(0x201e800), %g1
20088e4: 82 10 61 20 or %g1, 0x120, %g1 ! 201e920 <_TOD_Days_per_month>
20088e8: c2 00 40 02 ld [ %g1 + %g2 ], %g1
if ( the_tod->day > days_in_month )
20088ec: 80 a0 40 04 cmp %g1, %g4
20088f0: 10 bf ff f6 b 20088c8 <_TOD_Validate+0xc0>
20088f4: 82 60 3f ff subx %g0, -1, %g1
0200a230 <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
200a230: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
200a234: 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 );
200a238: 40 00 03 c3 call 200b144 <_Thread_Set_transient>
200a23c: 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 )
200a240: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200a244: 80 a0 40 19 cmp %g1, %i1
200a248: 02 80 00 05 be 200a25c <_Thread_Change_priority+0x2c>
200a24c: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
200a250: 90 10 00 18 mov %i0, %o0
200a254: 40 00 03 a2 call 200b0dc <_Thread_Set_priority>
200a258: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
200a25c: 7f ff e0 ec call 200260c <sparc_disable_interrupts>
200a260: 01 00 00 00 nop
200a264: 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;
200a268: f8 07 60 10 ld [ %i5 + 0x10 ], %i4
if ( state != STATES_TRANSIENT ) {
200a26c: 80 a7 20 04 cmp %i4, 4
200a270: 02 80 00 18 be 200a2d0 <_Thread_Change_priority+0xa0>
200a274: 80 8e e0 04 btst 4, %i3
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
200a278: 02 80 00 0b be 200a2a4 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
200a27c: 82 0f 3f fb and %i4, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
200a280: 7f ff e0 e7 call 200261c <sparc_enable_interrupts> <== NOT EXECUTED
200a284: 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);
200a288: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
200a28c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
200a290: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED
200a294: 32 80 00 0d bne,a 200a2c8 <_Thread_Change_priority+0x98> <== NOT EXECUTED
200a298: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
200a29c: 81 c7 e0 08 ret
200a2a0: 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 );
200a2a4: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
200a2a8: 7f ff e0 dd call 200261c <sparc_enable_interrupts>
200a2ac: 90 10 00 19 mov %i1, %o0
200a2b0: 03 00 00 ef sethi %hi(0x3bc00), %g1
200a2b4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
200a2b8: 80 8f 00 01 btst %i4, %g1
200a2bc: 02 bf ff f8 be 200a29c <_Thread_Change_priority+0x6c>
200a2c0: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
200a2c4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
200a2c8: 40 00 03 55 call 200b01c <_Thread_queue_Requeue>
200a2cc: 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 ) ) {
200a2d0: 22 80 00 19 be,a 200a334 <_Thread_Change_priority+0x104> <== ALWAYS TAKEN
200a2d4: c0 27 60 10 clr [ %i5 + 0x10 ]
200a2d8: 39 00 80 75 sethi %hi(0x201d400), %i4 <== NOT EXECUTED
200a2dc: b8 17 23 04 or %i4, 0x304, %i4 ! 201d704 <_Scheduler> <== NOT EXECUTED
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
200a2e0: 7f ff e0 cf call 200261c <sparc_enable_interrupts>
200a2e4: 90 10 00 19 mov %i1, %o0
200a2e8: 7f ff e0 c9 call 200260c <sparc_disable_interrupts>
200a2ec: 01 00 00 00 nop
200a2f0: 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();
200a2f4: c2 07 20 08 ld [ %i4 + 8 ], %g1
200a2f8: 9f c0 40 00 call %g1
200a2fc: 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 );
200a300: 03 00 80 7a sethi %hi(0x201e800), %g1
200a304: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_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() &&
200a308: c4 18 60 10 ldd [ %g1 + 0x10 ], %g2
200a30c: 80 a0 80 03 cmp %g2, %g3
200a310: 02 80 00 07 be 200a32c <_Thread_Change_priority+0xfc>
200a314: 01 00 00 00 nop
200a318: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
200a31c: 80 a0 a0 00 cmp %g2, 0
200a320: 02 80 00 03 be 200a32c <_Thread_Change_priority+0xfc>
200a324: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
200a328: c4 28 60 0c stb %g2, [ %g1 + 0xc ]
_ISR_Enable( level );
200a32c: 7f ff e0 bc call 200261c <sparc_enable_interrupts>
200a330: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
200a334: 39 00 80 75 sethi %hi(0x201d400), %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 )
200a338: 80 a6 a0 00 cmp %i2, 0
200a33c: 02 80 00 06 be 200a354 <_Thread_Change_priority+0x124>
200a340: b8 17 23 04 or %i4, 0x304, %i4
200a344: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
200a348: 9f c0 40 00 call %g1
200a34c: 90 10 00 1d mov %i5, %o0
200a350: 30 bf ff e4 b,a 200a2e0 <_Thread_Change_priority+0xb0>
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
200a354: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
200a358: 9f c0 40 00 call %g1
200a35c: 90 10 00 1d mov %i5, %o0
200a360: 30 bf ff e0 b,a 200a2e0 <_Thread_Change_priority+0xb0>
0200a574 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
200a574: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
200a578: 90 10 00 18 mov %i0, %o0
200a57c: 40 00 00 8b call 200a7a8 <_Thread_Get>
200a580: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200a584: c2 07 bf fc ld [ %fp + -4 ], %g1
200a588: 80 a0 60 00 cmp %g1, 0
200a58c: 12 80 00 08 bne 200a5ac <_Thread_Delay_ended+0x38> <== NEVER TAKEN
200a590: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
200a594: 7f ff ff 74 call 200a364 <_Thread_Clear_state>
200a598: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_END+0xdc00018>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
uint32_t level = _Thread_Dispatch_disable_level;
200a59c: 03 00 80 78 sethi %hi(0x201e000), %g1
200a5a0: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level>
--level;
200a5a4: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
200a5a8: c4 20 63 20 st %g2, [ %g1 + 0x320 ]
200a5ac: 81 c7 e0 08 ret
200a5b0: 81 e8 00 00 restore
0200a5b4 <_Thread_Dispatch>:
#if defined(RTEMS_SMP)
#include <rtems/score/smp.h>
#endif
void _Thread_Dispatch( void )
{
200a5b4: 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;
200a5b8: 35 00 80 7a sethi %hi(0x201e800), %i2
200a5bc: b4 16 a0 40 or %i2, 0x40, %i2 ! 201e840 <_Per_CPU_Information>
_ISR_Disable( level );
200a5c0: 7f ff e0 13 call 200260c <sparc_disable_interrupts>
200a5c4: fa 06 a0 10 ld [ %i2 + 0x10 ], %i5
while ( _Thread_Dispatch_necessary == true ) {
200a5c8: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1
200a5cc: 80 a0 60 00 cmp %g1, 0
200a5d0: 02 80 00 55 be 200a724 <_Thread_Dispatch+0x170>
200a5d4: 31 00 80 78 sethi %hi(0x201e000), %i0
heir = _Thread_Heir;
200a5d8: f8 06 a0 14 ld [ %i2 + 0x14 ], %i4
* 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;
200a5dc: 82 10 20 01 mov 1, %g1
200a5e0: c2 26 23 20 st %g1, [ %i0 + 0x320 ]
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 1 );
#endif
_Thread_Dispatch_necessary = false;
200a5e4: c0 2e a0 0c clrb [ %i2 + 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 )
200a5e8: 80 a7 40 1c cmp %i5, %i4
200a5ec: 02 80 00 4e be 200a724 <_Thread_Dispatch+0x170>
200a5f0: f8 26 a0 10 st %i4, [ %i2 + 0x10 ]
200a5f4: 21 00 80 76 sethi %hi(0x201d800), %l0
200a5f8: 25 00 80 78 sethi %hi(0x201e000), %l2
200a5fc: a0 14 20 d8 or %l0, 0xd8, %l0
*/
static inline void _TOD_Get_uptime(
Timestamp_Control *time
)
{
_TOD_Get_with_nanoseconds( time, &_TOD.uptime );
200a600: 23 00 80 78 sethi %hi(0x201e000), %l1
200a604: a4 14 a3 90 or %l2, 0x390, %l2
200a608: b6 04 20 04 add %l0, 4, %i3
#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;
200a60c: 29 00 80 78 sethi %hi(0x201e000), %l4
200a610: a2 14 62 70 or %l1, 0x270, %l1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Allocated_fp );
200a614: 33 00 80 78 sethi %hi(0x201e000), %i1
* 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;
200a618: a6 10 20 01 mov 1, %l3
*/
#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 )
200a61c: c2 07 20 78 ld [ %i4 + 0x78 ], %g1
200a620: 80 a0 60 01 cmp %g1, 1
200a624: 02 80 00 53 be 200a770 <_Thread_Dispatch+0x1bc>
200a628: c2 05 22 80 ld [ %l4 + 0x280 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
_ISR_Enable( level );
200a62c: 7f ff df fc call 200261c <sparc_enable_interrupts>
200a630: 01 00 00 00 nop
200a634: 92 10 00 11 mov %l1, %o1
200a638: 7f ff f9 62 call 2008bc0 <_TOD_Get_with_nanoseconds>
200a63c: 90 07 bf f8 add %fp, -8, %o0
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
200a640: d8 1e a0 20 ldd [ %i2 + 0x20 ], %o4
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
200a644: c4 1f 60 80 ldd [ %i5 + 0x80 ], %g2
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
200a648: d4 1f bf f8 ldd [ %fp + -8 ], %o2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
200a64c: c2 04 80 00 ld [ %l2 ], %g1
const Timestamp64_Control *_start,
const Timestamp64_Control *_end,
Timestamp64_Control *_result
)
{
*_result = *_end - *_start;
200a650: 9a a2 c0 0d subcc %o3, %o5, %o5
200a654: 98 62 80 0c subx %o2, %o4, %o4
static inline void _Timestamp64_implementation_Add_to(
Timestamp64_Control *_time,
const Timestamp64_Control *_add
)
{
*_time += *_add;
200a658: 92 80 c0 0d addcc %g3, %o5, %o1
200a65c: 90 40 80 0c addx %g2, %o4, %o0
200a660: d0 3f 60 80 std %o0, [ %i5 + 0x80 ]
200a664: 80 a0 60 00 cmp %g1, 0
200a668: 02 80 00 06 be 200a680 <_Thread_Dispatch+0xcc> <== NEVER TAKEN
200a66c: d4 3e a0 20 std %o2, [ %i2 + 0x20 ]
executing->libc_reent = *_Thread_libc_reent;
200a670: c4 00 40 00 ld [ %g1 ], %g2
200a674: c4 27 61 54 st %g2, [ %i5 + 0x154 ]
*_Thread_libc_reent = heir->libc_reent;
200a678: c4 07 21 54 ld [ %i4 + 0x154 ], %g2
200a67c: 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;
200a680: ea 04 00 00 ld [ %l0 ], %l5
{
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 ) {
200a684: 80 a5 40 1b cmp %l5, %i3
200a688: 02 80 00 0b be 200a6b4 <_Thread_Dispatch+0x100> <== NEVER TAKEN
200a68c: 90 07 60 c8 add %i5, 0xc8, %o0
const User_extensions_Switch_control *extension =
(const User_extensions_Switch_control *) node;
(*extension->thread_switch)( executing, heir );
200a690: c2 05 60 08 ld [ %l5 + 8 ], %g1
200a694: 90 10 00 1d mov %i5, %o0
200a698: 9f c0 40 00 call %g1
200a69c: 92 10 00 1c mov %i4, %o1
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next(
const Chain_Node *the_node
)
{
return the_node->next;
200a6a0: ea 05 40 00 ld [ %l5 ], %l5
{
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 ) {
200a6a4: 80 a5 40 1b cmp %l5, %i3
200a6a8: 32 bf ff fb bne,a 200a694 <_Thread_Dispatch+0xe0>
200a6ac: c2 05 60 08 ld [ %l5 + 8 ], %g1
if ( executing->fp_context != NULL )
_Context_Save_fp( &executing->fp_context );
#endif
#endif
_Context_Switch( &executing->Registers, &heir->Registers );
200a6b0: 90 07 60 c8 add %i5, 0xc8, %o0
200a6b4: 40 00 04 ef call 200ba70 <_CPU_Context_switch>
200a6b8: 92 07 20 c8 add %i4, 0xc8, %o1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200a6bc: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
200a6c0: 80 a0 60 00 cmp %g1, 0
200a6c4: 02 80 00 0c be 200a6f4 <_Thread_Dispatch+0x140>
200a6c8: d0 06 63 8c ld [ %i1 + 0x38c ], %o0
200a6cc: 80 a7 40 08 cmp %i5, %o0
200a6d0: 02 80 00 09 be 200a6f4 <_Thread_Dispatch+0x140>
200a6d4: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200a6d8: 02 80 00 04 be 200a6e8 <_Thread_Dispatch+0x134>
200a6dc: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200a6e0: 40 00 04 aa call 200b988 <_CPU_Context_save_fp>
200a6e4: 90 02 21 50 add %o0, 0x150, %o0
_Context_Restore_fp( &executing->fp_context );
200a6e8: 40 00 04 c5 call 200b9fc <_CPU_Context_restore_fp>
200a6ec: 90 07 61 50 add %i5, 0x150, %o0
_Thread_Allocated_fp = executing;
200a6f0: fa 26 63 8c st %i5, [ %i1 + 0x38c ]
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
200a6f4: 7f ff df c6 call 200260c <sparc_disable_interrupts>
200a6f8: fa 06 a0 10 ld [ %i2 + 0x10 ], %i5
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
_ISR_Disable( level );
while ( _Thread_Dispatch_necessary == true ) {
200a6fc: c2 0e a0 0c ldub [ %i2 + 0xc ], %g1
200a700: 80 a0 60 00 cmp %g1, 0
200a704: 02 80 00 08 be 200a724 <_Thread_Dispatch+0x170>
200a708: 01 00 00 00 nop
heir = _Thread_Heir;
200a70c: f8 06 a0 14 ld [ %i2 + 0x14 ], %i4
200a710: e6 26 23 20 st %l3, [ %i0 + 0x320 ]
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 1 );
#endif
_Thread_Dispatch_necessary = false;
200a714: c0 2e a0 0c clrb [ %i2 + 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 )
200a718: 80 a7 00 1d cmp %i4, %i5
200a71c: 12 bf ff c0 bne 200a61c <_Thread_Dispatch+0x68> <== ALWAYS TAKEN
200a720: f8 26 a0 10 st %i4, [ %i2 + 0x10 ]
200a724: c0 26 23 20 clr [ %i0 + 0x320 ]
post_switch:
#ifndef RTEMS_SMP
_Thread_Dispatch_set_disable_level( 0 );
#endif
_ISR_Enable( level );
200a728: 7f ff df bd call 200261c <sparc_enable_interrupts>
200a72c: 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;
200a730: 03 00 80 78 sethi %hi(0x201e000), %g1
200a734: f8 00 63 94 ld [ %g1 + 0x394 ], %i4 ! 201e394 <_API_extensions_Post_switch_list>
200a738: 82 10 63 94 or %g1, 0x394, %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 ) {
200a73c: b6 00 60 04 add %g1, 4, %i3
200a740: 80 a7 00 1b cmp %i4, %i3
200a744: 02 80 00 09 be 200a768 <_Thread_Dispatch+0x1b4>
200a748: 01 00 00 00 nop
const API_extensions_Post_switch_control *post_switch =
(const API_extensions_Post_switch_control *) node;
(*post_switch->hook)( executing );
200a74c: c2 07 20 08 ld [ %i4 + 8 ], %g1
200a750: 9f c0 40 00 call %g1
200a754: 90 10 00 1d mov %i5, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_next(
const Chain_Node *the_node
)
{
return the_node->next;
200a758: f8 07 00 00 ld [ %i4 ], %i4
{
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 ) {
200a75c: 80 a7 00 1b cmp %i4, %i3
200a760: 32 bf ff fc bne,a 200a750 <_Thread_Dispatch+0x19c> <== NEVER TAKEN
200a764: c2 07 20 08 ld [ %i4 + 8 ], %g1 <== NOT EXECUTED
200a768: 81 c7 e0 08 ret
200a76c: 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;
200a770: 10 bf ff af b 200a62c <_Thread_Dispatch+0x78>
200a774: c2 27 20 74 st %g1, [ %i4 + 0x74 ]
02010168 <_Thread_Handler>:
#define INIT_NAME __main
#define EXECUTE_GLOBAL_CONSTRUCTORS
#endif
void _Thread_Handler( void )
{
2010168: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static bool doneConstructors;
bool doCons;
#endif
executing = _Thread_Executing;
201016c: 03 00 80 7a sethi %hi(0x201e800), %g1
2010170: fa 00 60 50 ld [ %g1 + 0x50 ], %i5 ! 201e850 <_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();
2010174: 3f 00 80 40 sethi %hi(0x2010000), %i7
2010178: be 17 e1 68 or %i7, 0x168, %i7 ! 2010168 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
201017c: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0
_ISR_Set_level(level);
2010180: 7f ff c9 27 call 200261c <sparc_enable_interrupts>
2010184: 91 2a 20 08 sll %o0, 8, %o0
#endif
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
2010188: c4 07 61 50 ld [ %i5 + 0x150 ], %g2
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
201018c: 03 00 80 78 sethi %hi(0x201e000), %g1
doneConstructors = true;
2010190: 86 10 20 01 mov 1, %g3
doCons = !doneConstructors
&& _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API;
if (doCons)
doneConstructors = true;
#else
doCons = !doneConstructors;
2010194: f6 08 60 20 ldub [ %g1 + 0x20 ], %i3
#endif
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
2010198: 80 a0 a0 00 cmp %g2, 0
201019c: 02 80 00 0c be 20101cc <_Thread_Handler+0x64>
20101a0: c6 28 60 20 stb %g3, [ %g1 + 0x20 ]
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Allocated_fp );
20101a4: 39 00 80 78 sethi %hi(0x201e000), %i4
20101a8: d0 07 23 8c ld [ %i4 + 0x38c ], %o0 ! 201e38c <_Thread_Allocated_fp>
20101ac: 80 a7 40 08 cmp %i5, %o0
20101b0: 02 80 00 07 be 20101cc <_Thread_Handler+0x64>
20101b4: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
20101b8: 22 80 00 05 be,a 20101cc <_Thread_Handler+0x64>
20101bc: fa 27 23 8c st %i5, [ %i4 + 0x38c ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
20101c0: 7f ff ed f2 call 200b988 <_CPU_Context_save_fp>
20101c4: 90 02 21 50 add %o0, 0x150, %o0
_Thread_Allocated_fp = executing;
20101c8: fa 27 23 8c st %i5, [ %i4 + 0x38c ]
);
}
static inline void _User_extensions_Thread_begin( Thread_Control *executing )
{
_User_extensions_Iterate(
20101cc: 90 10 00 1d mov %i5, %o0
20101d0: 13 00 80 2c sethi %hi(0x200b000), %o1
20101d4: 7f ff ec 77 call 200b3b0 <_User_extensions_Iterate>
20101d8: 92 12 63 3c or %o1, 0x33c, %o1 ! 200b33c <_User_extensions_Thread_begin_visitor>
_User_extensions_Thread_begin( executing );
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
20101dc: 7f ff e9 67 call 200a778 <_Thread_Enable_dispatch>
20101e0: 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) */ {
20101e4: 80 8e e0 ff btst 0xff, %i3
20101e8: 02 80 00 10 be 2010228 <_Thread_Handler+0xc0>
20101ec: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
20101f0: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
20101f4: 80 a0 60 00 cmp %g1, 0
20101f8: 02 80 00 10 be 2010238 <_Thread_Handler+0xd0>
20101fc: 80 a0 60 01 cmp %g1, 1
(*(Thread_Entry_numeric) executing->Start.entry_point)(
executing->Start.numeric_argument
);
}
#if defined(RTEMS_POSIX_API)
else if ( executing->Start.prototype == THREAD_START_POINTER ) {
2010200: 22 80 00 13 be,a 201024c <_Thread_Handler+0xe4> <== ALWAYS TAKEN
2010204: c2 07 60 8c ld [ %i5 + 0x8c ], %g1
}
}
static inline void _User_extensions_Thread_exitted( Thread_Control *executing )
{
_User_extensions_Iterate(
2010208: 90 10 00 1d mov %i5, %o0
201020c: 13 00 80 2c sethi %hi(0x200b000), %o1
2010210: 7f ff ec 68 call 200b3b0 <_User_extensions_Iterate>
2010214: 92 12 63 60 or %o1, 0x360, %o1 ! 200b360 <_User_extensions_Thread_exitted_visitor>
* able to fit in a (void *).
*/
_User_extensions_Thread_exitted( executing );
_Internal_error_Occurred(
2010218: 90 10 20 00 clr %o0
201021c: 92 10 20 01 mov 1, %o1
2010220: 7f ff e3 b0 call 20090e0 <_Internal_error_Occurred>
2010224: 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 ();
2010228: 40 00 35 04 call 201d638 <_init>
201022c: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
2010230: 10 bf ff f1 b 20101f4 <_Thread_Handler+0x8c>
2010234: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
2010238: c2 07 60 8c ld [ %i5 + 0x8c ], %g1
201023c: 9f c0 40 00 call %g1
2010240: d0 07 60 98 ld [ %i5 + 0x98 ], %o0
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
2010244: 10 bf ff f1 b 2010208 <_Thread_Handler+0xa0>
2010248: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
);
}
#if defined(RTEMS_POSIX_API)
else if ( executing->Start.prototype == THREAD_START_POINTER ) {
executing->Wait.return_argument =
(*(Thread_Entry_pointer) executing->Start.entry_point)(
201024c: 9f c0 40 00 call %g1
2010250: d0 07 60 94 ld [ %i5 + 0x94 ], %o0
executing->Start.numeric_argument
);
}
#if defined(RTEMS_POSIX_API)
else if ( executing->Start.prototype == THREAD_START_POINTER ) {
executing->Wait.return_argument =
2010254: 10 bf ff ed b 2010208 <_Thread_Handler+0xa0>
2010258: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
0200aa6c <_Thread_Handler_initialization>:
#if defined(RTEMS_SMP)
#include <rtems/bspsmp.h>
#endif
void _Thread_Handler_initialization(void)
{
200aa6c: 9d e3 bf 98 save %sp, -104, %sp
uint32_t ticks_per_timeslice =
200aa70: 03 00 80 6d sethi %hi(0x201b400), %g1
200aa74: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 <Configuration>
#if defined(RTEMS_MULTIPROCESSING)
uint32_t maximum_proxies =
_Configuration_MP_table->maximum_proxies;
#endif
if ( rtems_configuration_get_stack_allocate_hook() == NULL ||
200aa78: c6 00 60 28 ld [ %g1 + 0x28 ], %g3
#include <rtems/bspsmp.h>
#endif
void _Thread_Handler_initialization(void)
{
uint32_t ticks_per_timeslice =
200aa7c: fa 00 60 14 ld [ %g1 + 0x14 ], %i5
rtems_configuration_get_ticks_per_timeslice();
uint32_t maximum_extensions =
200aa80: 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 ||
200aa84: 80 a0 e0 00 cmp %g3, 0
200aa88: 02 80 00 21 be 200ab0c <_Thread_Handler_initialization+0xa0><== NEVER TAKEN
200aa8c: c4 00 60 24 ld [ %g1 + 0x24 ], %g2
200aa90: c6 00 60 2c ld [ %g1 + 0x2c ], %g3
200aa94: 80 a0 e0 00 cmp %g3, 0
200aa98: 02 80 00 1d be 200ab0c <_Thread_Handler_initialization+0xa0>
200aa9c: 80 a0 a0 00 cmp %g2, 0
INTERNAL_ERROR_CORE,
true,
INTERNAL_ERROR_BAD_STACK_HOOK
);
if ( stack_allocate_init_hook != NULL )
200aaa0: 22 80 00 05 be,a 200aab4 <_Thread_Handler_initialization+0x48>
200aaa4: 03 00 80 7a sethi %hi(0x201e800), %g1
(*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() );
200aaa8: 9f c0 80 00 call %g2
200aaac: d0 00 60 04 ld [ %g1 + 4 ], %o0 ! 201e804 <_RTEMS_Objects+0x4>
_Thread_Dispatch_necessary = false;
200aab0: 03 00 80 7a sethi %hi(0x201e800), %g1
200aab4: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_Per_CPU_Information>
200aab8: c0 28 60 0c clrb [ %g1 + 0xc ]
_Thread_Executing = NULL;
200aabc: c0 20 60 10 clr [ %g1 + 0x10 ]
_Thread_Heir = NULL;
200aac0: c0 20 60 14 clr [ %g1 + 0x14 ]
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Thread_Allocated_fp = NULL;
200aac4: 03 00 80 78 sethi %hi(0x201e000), %g1
200aac8: c0 20 63 8c clr [ %g1 + 0x38c ] ! 201e38c <_Thread_Allocated_fp>
#endif
_Thread_Maximum_extensions = maximum_extensions;
200aacc: 03 00 80 78 sethi %hi(0x201e000), %g1
200aad0: f8 20 63 a0 st %i4, [ %g1 + 0x3a0 ] ! 201e3a0 <_Thread_Maximum_extensions>
_Thread_Ticks_per_timeslice = ticks_per_timeslice;
200aad4: 03 00 80 78 sethi %hi(0x201e000), %g1
200aad8: fa 20 62 80 st %i5, [ %g1 + 0x280 ] ! 201e280 <_Thread_Ticks_per_timeslice>
#if defined(RTEMS_MULTIPROCESSING)
if ( _System_state_Is_multiprocessing )
maximum_internal_threads += 1;
#endif
_Objects_Initialize_information(
200aadc: 82 10 20 08 mov 8, %g1
200aae0: 11 00 80 79 sethi %hi(0x201e400), %o0
200aae4: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
200aae8: 90 12 20 14 or %o0, 0x14, %o0
200aaec: 92 10 20 01 mov 1, %o1
200aaf0: 94 10 20 01 mov 1, %o2
200aaf4: 96 10 20 01 mov 1, %o3
200aaf8: 98 10 21 68 mov 0x168, %o4
200aafc: 7f ff fb 22 call 2009784 <_Objects_Initialize_information>
200ab00: 9a 10 20 00 clr %o5
200ab04: 81 c7 e0 08 ret
200ab08: 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(
200ab0c: 90 10 20 00 clr %o0
200ab10: 92 10 20 01 mov 1, %o1
200ab14: 7f ff f9 73 call 20090e0 <_Internal_error_Occurred>
200ab18: 94 10 20 0e mov 0xe, %o2
0200a854 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
200a854: 9d e3 bf 98 save %sp, -104, %sp
200a858: c2 07 a0 6c ld [ %fp + 0x6c ], %g1
/*
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
200a85c: c0 26 61 58 clr [ %i1 + 0x158 ]
200a860: c0 26 61 5c clr [ %i1 + 0x15c ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
200a864: c0 26 61 54 clr [ %i1 + 0x154 ]
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
200a868: e0 07 a0 60 ld [ %fp + 0x60 ], %l0
200a86c: e2 00 40 00 ld [ %g1 ], %l1
if ( !actual_stack_size || actual_stack_size < stack_size )
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
#else
if ( !stack_area ) {
200a870: 80 a6 a0 00 cmp %i2, 0
200a874: 02 80 00 6f be 200aa30 <_Thread_Initialize+0x1dc>
200a878: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2
stack = the_thread->Start.stack;
the_thread->Start.core_allocated_stack = true;
} else {
stack = stack_area;
actual_stack_size = stack_size;
the_thread->Start.core_allocated_stack = false;
200a87c: c0 2e 60 b0 clrb [ %i1 + 0xb0 ]
200a880: 90 10 00 1b mov %i3, %o0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
200a884: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ]
the_stack->size = size;
200a888: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ]
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
200a88c: 80 a7 20 00 cmp %i4, 0
200a890: 12 80 00 4c bne 200a9c0 <_Thread_Initialize+0x16c>
200a894: b6 10 20 00 clr %i3
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
200a898: 39 00 80 78 sethi %hi(0x201e000), %i4
200a89c: c2 07 23 a0 ld [ %i4 + 0x3a0 ], %g1 ! 201e3a0 <_Thread_Maximum_extensions>
fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE );
if ( !fp_area )
goto failed;
fp_area = _Context_Fp_start( fp_area, 0 );
}
the_thread->fp_context = fp_area;
200a8a0: f6 26 61 50 st %i3, [ %i1 + 0x150 ]
the_thread->Start.fp_context = fp_area;
200a8a4: f6 26 60 bc st %i3, [ %i1 + 0xbc ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
200a8a8: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
200a8ac: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
200a8b0: c0 26 60 68 clr [ %i1 + 0x68 ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
200a8b4: 80 a0 60 00 cmp %g1, 0
200a8b8: 12 80 00 4a bne 200a9e0 <_Thread_Initialize+0x18c>
200a8bc: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200a8c0: c0 26 61 60 clr [ %i1 + 0x160 ]
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
200a8c4: b4 10 20 00 clr %i2
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
the_thread->Start.budget_callout = budget_callout;
200a8c8: c2 07 a0 64 ld [ %fp + 0x64 ], %g1
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
200a8cc: e4 2e 60 9c stb %l2, [ %i1 + 0x9c ]
the_thread->Start.budget_algorithm = budget_algorithm;
200a8d0: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ]
the_thread->Start.budget_callout = budget_callout;
switch ( budget_algorithm ) {
200a8d4: 80 a4 20 02 cmp %l0, 2
200a8d8: 12 80 00 05 bne 200a8ec <_Thread_Initialize+0x98>
200a8dc: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ]
case THREAD_CPU_BUDGET_ALGORITHM_NONE:
case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE:
break;
#if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE)
case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE:
the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice;
200a8e0: 03 00 80 78 sethi %hi(0x201e000), %g1
200a8e4: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 ! 201e280 <_Thread_Ticks_per_timeslice>
200a8e8: c2 26 60 74 st %g1, [ %i1 + 0x74 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
200a8ec: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
200a8f0: 03 00 80 75 sethi %hi(0x201d400), %g1
200a8f4: c2 00 63 1c ld [ %g1 + 0x31c ], %g1 ! 201d71c <_Scheduler+0x18>
200a8f8: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ]
the_thread->current_state = STATES_DORMANT;
200a8fc: a0 10 20 01 mov 1, %l0
the_thread->Wait.queue = NULL;
200a900: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
200a904: e0 26 60 10 st %l0, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
200a908: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
200a90c: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
200a910: fa 26 60 ac st %i5, [ %i1 + 0xac ]
200a914: 9f c0 40 00 call %g1
200a918: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
200a91c: b8 92 20 00 orcc %o0, 0, %i4
200a920: 22 80 00 17 be,a 200a97c <_Thread_Initialize+0x128>
200a924: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
200a928: 90 10 00 19 mov %i1, %o0
200a92c: 40 00 01 ec call 200b0dc <_Thread_Set_priority>
200a930: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200a934: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
200a938: c2 16 60 0a lduh [ %i1 + 0xa ], %g1
static inline void _Timestamp64_implementation_Set_to_zero(
Timestamp64_Control *_time
)
{
*_time = 0;
200a93c: c0 26 60 80 clr [ %i1 + 0x80 ]
200a940: c0 26 60 84 clr [ %i1 + 0x84 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200a944: 83 28 60 02 sll %g1, 2, %g1
200a948: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
200a94c: e2 26 60 0c st %l1, [ %i1 + 0xc ]
* @{
*/
static inline bool _User_extensions_Thread_create( Thread_Control *created )
{
User_extensions_Thread_create_context ctx = { created, true };
200a950: f2 27 bf f8 st %i1, [ %fp + -8 ]
200a954: e0 2f bf fc stb %l0, [ %fp + -4 ]
_User_extensions_Iterate( &ctx, _User_extensions_Thread_create_visitor );
200a958: 90 07 bf f8 add %fp, -8, %o0
200a95c: 13 00 80 2c sethi %hi(0x200b000), %o1
200a960: 40 00 02 94 call 200b3b0 <_User_extensions_Iterate>
200a964: 92 12 62 88 or %o1, 0x288, %o1 ! 200b288 <_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 )
200a968: c2 0f bf fc ldub [ %fp + -4 ], %g1
200a96c: 80 a0 60 00 cmp %g1, 0
200a970: 12 80 00 11 bne 200a9b4 <_Thread_Initialize+0x160>
200a974: b0 10 20 01 mov 1, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
200a978: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
200a97c: 40 00 03 ee call 200b934 <_Workspace_Free>
200a980: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
200a984: 40 00 03 ec call 200b934 <_Workspace_Free>
200a988: d0 06 61 58 ld [ %i1 + 0x158 ], %o0
200a98c: 40 00 03 ea call 200b934 <_Workspace_Free>
200a990: d0 06 61 5c ld [ %i1 + 0x15c ], %o0
_Workspace_Free( extensions_area );
200a994: 40 00 03 e8 call 200b934 <_Workspace_Free>
200a998: 90 10 00 1a mov %i2, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
200a99c: 40 00 03 e6 call 200b934 <_Workspace_Free>
200a9a0: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
200a9a4: 40 00 03 e4 call 200b934 <_Workspace_Free>
200a9a8: 90 10 00 1c mov %i4, %o0
_Thread_Stack_Free( the_thread );
200a9ac: 40 00 02 05 call 200b1c0 <_Thread_Stack_Free>
200a9b0: 90 10 00 19 mov %i1, %o0
200a9b4: b0 0e 20 ff and %i0, 0xff, %i0
200a9b8: 81 c7 e0 08 ret
200a9bc: 81 e8 00 00 restore
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE );
200a9c0: 40 00 03 d5 call 200b914 <_Workspace_Allocate>
200a9c4: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
200a9c8: b6 92 20 00 orcc %o0, 0, %i3
200a9cc: 32 bf ff b4 bne,a 200a89c <_Thread_Initialize+0x48>
200a9d0: 39 00 80 78 sethi %hi(0x201e000), %i4
* Zero out all the allocated memory fields
*/
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
the_thread->API_Extensions[i] = NULL;
extensions_area = NULL;
200a9d4: b4 10 20 00 clr %i2
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;
200a9d8: 10 bf ff e8 b 200a978 <_Thread_Initialize+0x124>
200a9dc: b8 10 20 00 clr %i4
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
200a9e0: 90 00 60 01 add %g1, 1, %o0
200a9e4: 40 00 03 cc call 200b914 <_Workspace_Allocate>
200a9e8: 91 2a 20 02 sll %o0, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
200a9ec: b4 92 20 00 orcc %o0, 0, %i2
200a9f0: 02 80 00 1d be 200aa64 <_Thread_Initialize+0x210>
200a9f4: 86 10 00 1a mov %i2, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200a9f8: f4 26 61 60 st %i2, [ %i1 + 0x160 ]
200a9fc: c8 07 23 a0 ld [ %i4 + 0x3a0 ], %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++ )
200aa00: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200aa04: 10 80 00 03 b 200aa10 <_Thread_Initialize+0x1bc>
200aa08: 82 10 20 00 clr %g1
200aa0c: c6 06 61 60 ld [ %i1 + 0x160 ], %g3
* so they cannot rely on the thread create user extension
* call.
*/
if ( the_thread->extensions ) {
for ( i = 0; i <= _Thread_Maximum_extensions ; i++ )
the_thread->extensions[i] = NULL;
200aa10: 85 28 a0 02 sll %g2, 2, %g2
200aa14: 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++ )
200aa18: 82 00 60 01 inc %g1
200aa1c: 80 a0 40 04 cmp %g1, %g4
200aa20: 08 bf ff fb bleu 200aa0c <_Thread_Initialize+0x1b8>
200aa24: 84 10 00 01 mov %g1, %g2
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
the_thread->Start.budget_algorithm = budget_algorithm;
the_thread->Start.budget_callout = budget_callout;
200aa28: 10 bf ff a9 b 200a8cc <_Thread_Initialize+0x78>
200aa2c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
#else
if ( !stack_area ) {
actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size );
200aa30: 90 10 00 19 mov %i1, %o0
200aa34: 40 00 01 d3 call 200b180 <_Thread_Stack_Allocate>
200aa38: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
200aa3c: 80 a2 00 1b cmp %o0, %i3
200aa40: 0a 80 00 07 bcs 200aa5c <_Thread_Initialize+0x208>
200aa44: 80 a2 20 00 cmp %o0, 0
200aa48: 02 80 00 05 be 200aa5c <_Thread_Initialize+0x208> <== NEVER TAKEN
200aa4c: 82 10 20 01 mov 1, %g1
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
200aa50: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2
the_thread->Start.core_allocated_stack = true;
200aa54: 10 bf ff 8c b 200a884 <_Thread_Initialize+0x30>
200aa58: c2 2e 60 b0 stb %g1, [ %i1 + 0xb0 ]
stack = the_thread->Start.stack;
#else
if ( !stack_area ) {
actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size );
if ( !actual_stack_size || actual_stack_size < stack_size )
return false; /* stack allocation failed */
200aa5c: 10 bf ff d6 b 200a9b4 <_Thread_Initialize+0x160>
200aa60: b0 10 20 00 clr %i0
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;
200aa64: 10 bf ff c5 b 200a978 <_Thread_Initialize+0x124>
200aa68: b8 10 20 00 clr %i4
0200b1c0 <_Thread_Stack_Free>:
#include <rtems/config.h>
void _Thread_Stack_Free(
Thread_Control *the_thread
)
{
200b1c0: 9d e3 bf a0 save %sp, -96, %sp
#if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API)
/*
* If the API provided the stack space, then don't free it.
*/
if ( !the_thread->Start.core_allocated_stack )
200b1c4: c2 0e 20 b0 ldub [ %i0 + 0xb0 ], %g1
200b1c8: 80 a0 60 00 cmp %g1, 0
void _Thread_Stack_Free(
Thread_Control *the_thread
)
{
rtems_stack_free_hook stack_free_hook =
200b1cc: 03 00 80 6d sethi %hi(0x201b400), %g1
#if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API)
/*
* If the API provided the stack space, then don't free it.
*/
if ( !the_thread->Start.core_allocated_stack )
200b1d0: 02 80 00 04 be 200b1e0 <_Thread_Stack_Free+0x20> <== NEVER TAKEN
200b1d4: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201b4f4 <Configuration+0x2c>
* Call ONLY the CPU table stack free hook, or the
* the RTEMS workspace free. This is so the free
* routine properly matches the allocation of the stack.
*/
(*stack_free_hook)( the_thread->Start.Initial_stack.area );
200b1d8: 9f c0 40 00 call %g1
200b1dc: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0
200b1e0: 81 c7 e0 08 ret
200b1e4: 81 e8 00 00 restore
0200b01c <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
200b01c: 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 )
200b020: 80 a6 20 00 cmp %i0, 0
200b024: 02 80 00 13 be 200b070 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
200b028: 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 ) {
200b02c: fa 06 20 34 ld [ %i0 + 0x34 ], %i5
200b030: 80 a7 60 01 cmp %i5, 1
200b034: 02 80 00 04 be 200b044 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
200b038: 01 00 00 00 nop
200b03c: 81 c7 e0 08 ret <== NOT EXECUTED
200b040: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
200b044: 7f ff dd 72 call 200260c <sparc_disable_interrupts>
200b048: 01 00 00 00 nop
200b04c: b8 10 00 08 mov %o0, %i4
200b050: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
200b054: 03 00 00 ef sethi %hi(0x3bc00), %g1
200b058: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
200b05c: 80 88 80 01 btst %g2, %g1
200b060: 12 80 00 06 bne 200b078 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
200b064: 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 );
200b068: 7f ff dd 6d call 200261c <sparc_enable_interrupts>
200b06c: 90 10 00 1c mov %i4, %o0
200b070: 81 c7 e0 08 ret
200b074: 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 );
200b078: 92 10 00 19 mov %i1, %o1
200b07c: 94 10 20 01 mov 1, %o2
200b080: 40 00 0d 68 call 200e620 <_Thread_queue_Extract_priority_helper>
200b084: fa 26 20 30 st %i5, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
200b088: 90 10 00 18 mov %i0, %o0
200b08c: 92 10 00 19 mov %i1, %o1
200b090: 7f ff ff 35 call 200ad64 <_Thread_queue_Enqueue_priority>
200b094: 94 07 bf fc add %fp, -4, %o2
200b098: 30 bf ff f4 b,a 200b068 <_Thread_queue_Requeue+0x4c>
0200b09c <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
200b09c: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
200b0a0: 90 10 00 18 mov %i0, %o0
200b0a4: 7f ff fd c1 call 200a7a8 <_Thread_Get>
200b0a8: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200b0ac: c2 07 bf fc ld [ %fp + -4 ], %g1
200b0b0: 80 a0 60 00 cmp %g1, 0
200b0b4: 12 80 00 08 bne 200b0d4 <_Thread_queue_Timeout+0x38> <== NEVER TAKEN
200b0b8: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
200b0bc: 40 00 0d 92 call 200e704 <_Thread_queue_Process_timeout>
200b0c0: 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;
200b0c4: 03 00 80 78 sethi %hi(0x201e000), %g1
200b0c8: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level>
--level;
200b0cc: 84 00 bf ff add %g2, -1, %g2
_Thread_Dispatch_disable_level = level;
200b0d0: c4 20 63 20 st %g2, [ %g1 + 0x320 ]
200b0d4: 81 c7 e0 08 ret
200b0d8: 81 e8 00 00 restore
020180c4 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
20180c4: 9d e3 bf 88 save %sp, -120, %sp
20180c8: 21 00 80 f2 sethi %hi(0x203c800), %l0
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
20180cc: a4 07 bf e8 add %fp, -24, %l2
20180d0: b4 07 bf ec add %fp, -20, %i2
20180d4: b8 07 bf f4 add %fp, -12, %i4
20180d8: a2 07 bf f8 add %fp, -8, %l1
20180dc: 33 00 80 f2 sethi %hi(0x203c800), %i1
20180e0: 27 00 80 f2 sethi %hi(0x203c800), %l3
20180e4: f4 27 bf e8 st %i2, [ %fp + -24 ]
head->previous = NULL;
20180e8: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
20180ec: 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;
20180f0: e2 27 bf f4 st %l1, [ %fp + -12 ]
head->previous = NULL;
20180f4: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
20180f8: f8 27 bf fc st %i4, [ %fp + -4 ]
20180fc: a0 14 22 1c or %l0, 0x21c, %l0
2018100: b6 06 20 30 add %i0, 0x30, %i3
2018104: b2 16 60 78 or %i1, 0x78, %i1
2018108: ba 06 20 68 add %i0, 0x68, %i5
201810c: a6 14 e1 30 or %l3, 0x130, %l3
2018110: ac 06 20 08 add %i0, 8, %l6
2018114: 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;
2018118: 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;
201811c: 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;
2018120: c2 04 00 00 ld [ %l0 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2018124: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2018128: 90 10 00 1b mov %i3, %o0
201812c: 92 20 40 09 sub %g1, %o1, %o1
2018130: 94 10 00 1c mov %i4, %o2
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2018134: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2018138: 40 00 12 8a call 201cb60 <_Watchdog_Adjust_to_chain>
201813c: 01 00 00 00 nop
2018140: d0 1e 40 00 ldd [ %i1 ], %o0
2018144: 94 10 20 00 clr %o2
2018148: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
201814c: 40 00 51 4c call 202c67c <__divdi3>
2018150: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
2018154: 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 ) {
2018158: 80 a2 40 0a cmp %o1, %o2
201815c: 18 80 00 2b bgu 2018208 <_Timer_server_Body+0x144>
2018160: 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 ) {
2018164: 80 a2 40 0a cmp %o1, %o2
2018168: 0a 80 00 20 bcs 20181e8 <_Timer_server_Body+0x124>
201816c: 90 10 00 1d mov %i5, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
2018170: 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 );
2018174: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
2018178: 40 00 02 c2 call 2018c80 <_Chain_Get>
201817c: 01 00 00 00 nop
if ( timer == NULL ) {
2018180: 92 92 20 00 orcc %o0, 0, %o1
2018184: 02 80 00 10 be 20181c4 <_Timer_server_Body+0x100>
2018188: 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 ) {
201818c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
2018190: 80 a0 60 01 cmp %g1, 1
2018194: 02 80 00 19 be 20181f8 <_Timer_server_Body+0x134>
2018198: 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 ) {
201819c: 12 bf ff f6 bne 2018174 <_Timer_server_Body+0xb0> <== NEVER TAKEN
20181a0: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20181a4: 40 00 12 9b call 201cc10 <_Watchdog_Insert>
20181a8: 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 );
20181ac: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20181b0: 40 00 02 b4 call 2018c80 <_Chain_Get>
20181b4: 01 00 00 00 nop
if ( timer == NULL ) {
20181b8: 92 92 20 00 orcc %o0, 0, %o1
20181bc: 32 bf ff f5 bne,a 2018190 <_Timer_server_Body+0xcc> <== NEVER TAKEN
20181c0: 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 );
20181c4: 7f ff dd 4d call 200f6f8 <sparc_disable_interrupts>
20181c8: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
20181cc: c2 07 bf e8 ld [ %fp + -24 ], %g1
20181d0: 80 a0 40 1a cmp %g1, %i2
20181d4: 02 80 00 12 be 201821c <_Timer_server_Body+0x158> <== ALWAYS TAKEN
20181d8: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
20181dc: 7f ff dd 4b call 200f708 <sparc_enable_interrupts> <== NOT EXECUTED
20181e0: 01 00 00 00 nop <== NOT EXECUTED
20181e4: 30 bf ff cf b,a 2018120 <_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 );
20181e8: 92 10 20 01 mov 1, %o1 ! 1 <PROM_START+0x1>
20181ec: 40 00 12 2d call 201caa0 <_Watchdog_Adjust>
20181f0: 94 22 80 17 sub %o2, %l7, %o2
20181f4: 30 bf ff df b,a 2018170 <_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 );
20181f8: 90 10 00 1b mov %i3, %o0
20181fc: 40 00 12 85 call 201cc10 <_Watchdog_Insert>
2018200: 92 02 60 10 add %o1, 0x10, %o1
2018204: 30 bf ff dc b,a 2018174 <_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 );
2018208: 92 22 40 0a sub %o1, %o2, %o1
201820c: 90 10 00 1d mov %i5, %o0
2018210: 40 00 12 54 call 201cb60 <_Watchdog_Adjust_to_chain>
2018214: 94 10 00 1c mov %i4, %o2
2018218: 30 bf ff d6 b,a 2018170 <_Timer_server_Body+0xac>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
201821c: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
2018220: 7f ff dd 3a call 200f708 <sparc_enable_interrupts>
2018224: 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 ) ) {
2018228: c2 07 bf f4 ld [ %fp + -12 ], %g1
201822c: 80 a0 40 11 cmp %g1, %l1
2018230: 12 80 00 0c bne 2018260 <_Timer_server_Body+0x19c>
2018234: 01 00 00 00 nop
2018238: 30 80 00 13 b,a 2018284 <_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;
201823c: 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;
2018240: 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;
2018244: c0 25 e0 08 clr [ %l7 + 8 ]
_ISR_Enable( level );
2018248: 7f ff dd 30 call 200f708 <sparc_enable_interrupts>
201824c: 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 );
2018250: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0
2018254: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1
2018258: 9f c0 40 00 call %g1
201825c: 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 );
2018260: 7f ff dd 26 call 200f6f8 <sparc_disable_interrupts>
2018264: 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;
2018268: 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))
201826c: 80 a5 c0 11 cmp %l7, %l1
2018270: 32 bf ff f3 bne,a 201823c <_Timer_server_Body+0x178>
2018274: 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 );
2018278: 7f ff dd 24 call 200f708 <sparc_enable_interrupts>
201827c: 01 00 00 00 nop
2018280: 30 bf ff a7 b,a 201811c <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
2018284: 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;
2018288: c2 04 c0 00 ld [ %l3 ], %g1
++level;
201828c: 82 00 60 01 inc %g1
_Thread_Dispatch_disable_level = level;
2018290: c2 24 c0 00 st %g1, [ %l3 ]
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
2018294: d0 06 00 00 ld [ %i0 ], %o0
2018298: 40 00 11 11 call 201c6dc <_Thread_Set_state>
201829c: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
20182a0: 7f ff ff 07 call 2017ebc <_Timer_server_Reset_interval_system_watchdog>
20182a4: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
20182a8: 7f ff ff 19 call 2017f0c <_Timer_server_Reset_tod_system_watchdog>
20182ac: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
20182b0: 40 00 0e 84 call 201bcc0 <_Thread_Enable_dispatch>
20182b4: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
20182b8: 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;
20182bc: 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 );
20182c0: 40 00 12 b3 call 201cd8c <_Watchdog_Remove>
20182c4: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
20182c8: 40 00 12 b1 call 201cd8c <_Watchdog_Remove>
20182cc: 90 10 00 15 mov %l5, %o0
20182d0: 30 bf ff 93 b,a 201811c <_Timer_server_Body+0x58>
02017f5c <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
2017f5c: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
2017f60: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
2017f64: 80 a0 60 00 cmp %g1, 0
2017f68: 02 80 00 05 be 2017f7c <_Timer_server_Schedule_operation_method+0x20>
2017f6c: 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 );
2017f70: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
2017f74: 40 00 03 38 call 2018c54 <_Chain_Append>
2017f78: 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;
2017f7c: 03 00 80 f2 sethi %hi(0x203c800), %g1
2017f80: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 203c930 <_Thread_Dispatch_disable_level>
++level;
2017f84: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2017f88: c4 20 61 30 st %g2, [ %g1 + 0x130 ]
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
2017f8c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
2017f90: 80 a0 60 01 cmp %g1, 1
2017f94: 02 80 00 2b be 2018040 <_Timer_server_Schedule_operation_method+0xe4>
2017f98: 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 ) {
2017f9c: 02 80 00 04 be 2017fac <_Timer_server_Schedule_operation_method+0x50>
2017fa0: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
2017fa4: 40 00 0f 47 call 201bcc0 <_Thread_Enable_dispatch>
2017fa8: 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 );
2017fac: 7f ff dd d3 call 200f6f8 <sparc_disable_interrupts>
2017fb0: 01 00 00 00 nop
2017fb4: b8 10 00 08 mov %o0, %i4
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
2017fb8: 03 00 80 f2 sethi %hi(0x203c800), %g1
2017fbc: d0 18 60 78 ldd [ %g1 + 0x78 ], %o0 ! 203c878 <_TOD>
2017fc0: 94 10 20 00 clr %o2
2017fc4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2017fc8: 40 00 51 ad call 202c67c <__divdi3>
2017fcc: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2017fd0: c2 06 20 68 ld [ %i0 + 0x68 ], %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
2017fd4: 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 );
2017fd8: 86 06 20 6c add %i0, 0x6c, %g3
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
2017fdc: 80 a0 40 03 cmp %g1, %g3
2017fe0: 02 80 00 0a be 2018008 <_Timer_server_Schedule_operation_method+0xac>
2017fe4: 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 ) {
2017fe8: 08 80 00 34 bleu 20180b8 <_Timer_server_Schedule_operation_method+0x15c>
2017fec: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
2017ff0: 84 22 40 02 sub %o1, %g2, %g2
if (delta_interval > delta) {
2017ff4: 80 a1 00 02 cmp %g4, %g2
2017ff8: 08 80 00 03 bleu 2018004 <_Timer_server_Schedule_operation_method+0xa8><== NEVER TAKEN
2017ffc: 86 10 20 00 clr %g3
delta_interval -= delta;
2018000: 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;
2018004: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
2018008: d2 26 20 74 st %o1, [ %i0 + 0x74 ]
_ISR_Enable( level );
201800c: 7f ff dd bf call 200f708 <sparc_enable_interrupts>
2018010: 90 10 00 1c mov %i4, %o0
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
2018014: 90 06 20 68 add %i0, 0x68, %o0
2018018: 40 00 12 fe call 201cc10 <_Watchdog_Insert>
201801c: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2018020: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2018024: 80 a0 60 00 cmp %g1, 0
2018028: 12 bf ff df bne 2017fa4 <_Timer_server_Schedule_operation_method+0x48>
201802c: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
2018030: 7f ff ff b7 call 2017f0c <_Timer_server_Reset_tod_system_watchdog>
2018034: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
2018038: 40 00 0f 22 call 201bcc0 <_Thread_Enable_dispatch>
201803c: 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 );
2018040: 7f ff dd ae call 200f6f8 <sparc_disable_interrupts>
2018044: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
2018048: 05 00 80 f2 sethi %hi(0x203c800), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
201804c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
2018050: c4 00 a2 1c ld [ %g2 + 0x21c ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
2018054: 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 );
2018058: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
201805c: 80 a0 40 03 cmp %g1, %g3
2018060: 02 80 00 08 be 2018080 <_Timer_server_Schedule_operation_method+0x124>
2018064: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
2018068: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
if (delta_interval > delta) {
201806c: 80 a1 00 1c cmp %g4, %i4
2018070: 1a 80 00 03 bcc 201807c <_Timer_server_Schedule_operation_method+0x120>
2018074: 86 10 20 00 clr %g3
delta_interval -= delta;
2018078: 86 27 00 04 sub %i4, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
201807c: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
2018080: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
2018084: 7f ff dd a1 call 200f708 <sparc_enable_interrupts>
2018088: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
201808c: 90 06 20 30 add %i0, 0x30, %o0
2018090: 40 00 12 e0 call 201cc10 <_Watchdog_Insert>
2018094: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2018098: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
201809c: 80 a0 60 00 cmp %g1, 0
20180a0: 12 bf ff c1 bne 2017fa4 <_Timer_server_Schedule_operation_method+0x48>
20180a4: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
20180a8: 7f ff ff 85 call 2017ebc <_Timer_server_Reset_interval_system_watchdog>
20180ac: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
20180b0: 40 00 0f 04 call 201bcc0 <_Thread_Enable_dispatch>
20180b4: 81 e8 00 00 restore
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
20180b8: 84 01 00 02 add %g4, %g2, %g2
delta_interval += delta;
20180bc: 10 bf ff d2 b 2018004 <_Timer_server_Schedule_operation_method+0xa8>
20180c0: 86 20 80 09 sub %g2, %o1, %g3
0200d0d8 <_Timespec_Add_to>:
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200d0d8: 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;
200d0dc: c4 02 40 00 ld [ %o1 ], %g2
/* Add the basics */
time->tv_sec += add->tv_sec;
time->tv_nsec += add->tv_nsec;
200d0e0: c6 02 20 04 ld [ %o0 + 4 ], %g3
200d0e4: c2 02 60 04 ld [ %o1 + 4 ], %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200d0e8: 98 03 00 02 add %o4, %g2, %o4
time->tv_nsec += add->tv_nsec;
200d0ec: 82 00 c0 01 add %g3, %g1, %g1
)
{
uint32_t seconds = add->tv_sec;
/* Add the basics */
time->tv_sec += add->tv_sec;
200d0f0: 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 ) {
200d0f4: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4
200d0f8: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff <RAM_END+0x395ac9ff>
200d0fc: 80 a0 40 04 cmp %g1, %g4
200d100: 08 80 00 0d bleu 200d134 <_Timespec_Add_to+0x5c>
200d104: c2 22 20 04 st %g1, [ %o0 + 4 ]
200d108: 98 03 20 01 inc %o4
time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
200d10c: 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(
200d110: 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;
200d114: 9a 13 62 00 or %o5, 0x200, %o5
200d118: 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(
200d11c: 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 ) {
200d120: 80 a0 40 04 cmp %g1, %g4
200d124: 18 bf ff fd bgu 200d118 <_Timespec_Add_to+0x40> <== NEVER TAKEN
200d128: 84 00 a0 01 inc %g2
200d12c: c2 22 20 04 st %g1, [ %o0 + 4 ]
200d130: c6 22 00 00 st %g3, [ %o0 ]
time->tv_sec++;
seconds++;
}
return seconds;
}
200d134: 81 c3 e0 08 retl
200d138: 90 10 00 02 mov %g2, %o0
0200cb38 <_Timestamp64_Divide>:
const Timestamp64_Control *_lhs,
const Timestamp64_Control *_rhs,
uint32_t *_ival_percentage,
uint32_t *_fval_percentage
)
{
200cb38: 9d e3 bf a0 save %sp, -96, %sp
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
200cb3c: d4 1e 40 00 ldd [ %i1 ], %o2
200cb40: 80 92 80 0b orcc %o2, %o3, %g0
200cb44: 22 80 00 2f be,a 200cc00 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN
200cb48: 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;
200cb4c: e0 1e 00 00 ldd [ %i0 ], %l0
200cb50: 83 2c 20 02 sll %l0, 2, %g1
200cb54: 89 34 60 1e srl %l1, 0x1e, %g4
200cb58: 87 2c 60 02 sll %l1, 2, %g3
200cb5c: 84 11 00 01 or %g4, %g1, %g2
200cb60: 83 30 e0 1b srl %g3, 0x1b, %g1
200cb64: 9b 28 e0 05 sll %g3, 5, %o5
200cb68: 99 28 a0 05 sll %g2, 5, %o4
200cb6c: 86 a3 40 03 subcc %o5, %g3, %g3
200cb70: 98 10 40 0c or %g1, %o4, %o4
200cb74: 84 63 00 02 subx %o4, %g2, %g2
200cb78: 92 80 c0 11 addcc %g3, %l1, %o1
200cb7c: 83 32 60 1e srl %o1, 0x1e, %g1
200cb80: 90 40 80 10 addx %g2, %l0, %o0
200cb84: b3 2a 60 02 sll %o1, 2, %i1
200cb88: b1 2a 20 02 sll %o0, 2, %i0
200cb8c: 86 82 40 19 addcc %o1, %i1, %g3
200cb90: b0 10 40 18 or %g1, %i0, %i0
200cb94: 83 30 e0 1e srl %g3, 0x1e, %g1
200cb98: 84 42 00 18 addx %o0, %i0, %g2
200cb9c: bb 28 e0 02 sll %g3, 2, %i5
200cba0: b9 28 a0 02 sll %g2, 2, %i4
200cba4: 92 80 c0 1d addcc %g3, %i5, %o1
200cba8: b8 10 40 1c or %g1, %i4, %i4
200cbac: 87 32 60 1b srl %o1, 0x1b, %g3
200cbb0: 90 40 80 1c addx %g2, %i4, %o0
200cbb4: 83 2a 60 05 sll %o1, 5, %g1
200cbb8: 85 2a 20 05 sll %o0, 5, %g2
200cbbc: 92 10 00 01 mov %g1, %o1
200cbc0: 40 00 3b 46 call 201b8d8 <__divdi3>
200cbc4: 90 10 c0 02 or %g3, %g2, %o0
*_ival_percentage = answer / 1000;
200cbc8: 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;
200cbcc: b8 10 00 08 mov %o0, %i4
200cbd0: ba 10 00 09 mov %o1, %i5
*_ival_percentage = answer / 1000;
200cbd4: 40 00 3b 41 call 201b8d8 <__divdi3>
200cbd8: 96 10 23 e8 mov 0x3e8, %o3
*_fval_percentage = answer % 1000;
200cbdc: 90 10 00 1c mov %i4, %o0
* TODO: Rounding on the last digit of the fval.
*/
answer = (*_lhs * 100000) / *_rhs;
*_ival_percentage = answer / 1000;
200cbe0: d2 26 80 00 st %o1, [ %i2 ]
*_fval_percentage = answer % 1000;
200cbe4: 94 10 20 00 clr %o2
200cbe8: 96 10 23 e8 mov 0x3e8, %o3
200cbec: 40 00 3c 26 call 201bc84 <__moddi3>
200cbf0: 92 10 00 1d mov %i5, %o1
200cbf4: d2 26 c0 00 st %o1, [ %i3 ]
200cbf8: 81 c7 e0 08 ret
200cbfc: 81 e8 00 00 restore
{
Timestamp64_Control answer;
if ( *_rhs == 0 ) {
*_ival_percentage = 0;
*_fval_percentage = 0;
200cc00: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED
return;
200cc04: 81 c7 e0 08 ret <== NOT EXECUTED
200cc08: 81 e8 00 00 restore <== NOT EXECUTED
0200b480 <_User_extensions_Handler_initialization>:
}
}
void _User_extensions_Handler_initialization(void)
{
200b480: 9d e3 bf 98 save %sp, -104, %sp
uint32_t number_of_initial_extensions =
200b484: 03 00 80 6d sethi %hi(0x201b400), %g1
200b488: c2 00 61 08 ld [ %g1 + 0x108 ], %g1 ! 201b508 <Configuration+0x40>
rtems_configuration_get_number_of_initial_extensions();
if ( number_of_initial_extensions > 0 ) {
200b48c: 80 a0 60 00 cmp %g1, 0
200b490: 02 80 00 0a be 200b4b8 <_User_extensions_Handler_initialization+0x38><== NEVER TAKEN
200b494: 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 )
200b498: 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 =
200b49c: 40 00 01 2c call 200b94c <_Workspace_Allocate_or_fatal_error>
200b4a0: 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 );
200b4a4: 13 00 80 2d sethi %hi(0x200b400), %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 };
200b4a8: d0 27 bf fc st %o0, [ %fp + -4 ]
_User_extensions_Iterate( &ctx, _User_extensions_Switch_visitor );
200b4ac: 92 12 60 3c or %o1, 0x3c, %o1
200b4b0: 7f ff ff c0 call 200b3b0 <_User_extensions_Iterate>
200b4b4: 90 07 bf fc add %fp, -4, %o0
200b4b8: 81 c7 e0 08 ret
200b4bc: 81 e8 00 00 restore
0200b3b0 <_User_extensions_Iterate>:
void _User_extensions_Iterate(
void *arg,
User_extensions_Visitor visitor
)
{
200b3b0: 9d e3 bf a0 save %sp, -96, %sp
Thread_Control *executing = _Thread_Executing;
const User_extensions_Table *callouts_current =
200b3b4: 03 00 80 6d sethi %hi(0x201b400), %g1
200b3b8: 82 10 60 c8 or %g1, 0xc8, %g1 ! 201b4c8 <Configuration>
200b3bc: 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();
200b3c0: f6 00 60 40 ld [ %g1 + 0x40 ], %i3
void _User_extensions_Iterate(
void *arg,
User_extensions_Visitor visitor
)
{
Thread_Control *executing = _Thread_Executing;
200b3c4: 03 00 80 7a sethi %hi(0x201e800), %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();
200b3c8: 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 =
200b3cc: 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 ) {
200b3d0: 80 a7 40 1b cmp %i5, %i3
200b3d4: 02 80 00 0a be 200b3fc <_User_extensions_Iterate+0x4c> <== NEVER TAKEN
200b3d8: f8 00 60 50 ld [ %g1 + 0x50 ], %i4
(*visitor)( executing, arg, callouts_current );
200b3dc: 94 10 00 1d mov %i5, %o2
200b3e0: 90 10 00 1c mov %i4, %o0
200b3e4: 9f c6 40 00 call %i1
200b3e8: 92 10 00 18 mov %i0, %o1
++callouts_current;
200b3ec: 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 ) {
200b3f0: 80 a6 c0 1d cmp %i3, %i5
200b3f4: 12 bf ff fb bne 200b3e0 <_User_extensions_Iterate+0x30>
200b3f8: 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;
200b3fc: 37 00 80 76 sethi %hi(0x201d800), %i3
200b400: fa 06 e0 cc ld [ %i3 + 0xcc ], %i5 ! 201d8cc <_User_extensions_List>
200b404: b6 16 e0 cc or %i3, 0xcc, %i3
++callouts_current;
}
node = _Chain_Immutable_first( &_User_extensions_List );
tail = _Chain_Immutable_tail( &_User_extensions_List );
while ( node != tail ) {
200b408: b6 06 e0 04 add %i3, 4, %i3
200b40c: 80 a7 40 1b cmp %i5, %i3
200b410: 02 80 00 09 be 200b434 <_User_extensions_Iterate+0x84>
200b414: 94 07 60 14 add %i5, 0x14, %o2
const User_extensions_Control *extension =
(const User_extensions_Control *) node;
(*visitor)( executing, arg, &extension->Callouts );
200b418: 90 10 00 1c mov %i4, %o0
200b41c: 9f c6 40 00 call %i1
200b420: 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;
200b424: 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 ) {
200b428: 80 a7 40 1b cmp %i5, %i3
200b42c: 12 bf ff fb bne 200b418 <_User_extensions_Iterate+0x68>
200b430: 94 07 60 14 add %i5, 0x14, %o2
200b434: 81 c7 e0 08 ret
200b438: 81 e8 00 00 restore
0200ce84 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200ce84: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200ce88: 7f ff d9 2f call 2003344 <sparc_disable_interrupts>
200ce8c: 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;
200ce90: 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 );
200ce94: 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 ) ) {
200ce98: 80 a0 40 1c cmp %g1, %i4
200ce9c: 02 80 00 1f be 200cf18 <_Watchdog_Adjust+0x94>
200cea0: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200cea4: 12 80 00 1f bne 200cf20 <_Watchdog_Adjust+0x9c>
200cea8: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200ceac: 80 a6 a0 00 cmp %i2, 0
200ceb0: 02 80 00 1a be 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200ceb4: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200ceb8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200cebc: 80 a6 80 02 cmp %i2, %g2
200cec0: 1a 80 00 0a bcc 200cee8 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
200cec4: b6 10 20 01 mov 1, %i3
_Watchdog_First( header )->delta_interval -= units;
200cec8: 10 80 00 1d b 200cf3c <_Watchdog_Adjust+0xb8> <== NOT EXECUTED
200cecc: 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 ) {
200ced0: 02 80 00 12 be 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200ced4: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200ced8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200cedc: 80 a0 80 1a cmp %g2, %i2
200cee0: 38 80 00 17 bgu,a 200cf3c <_Watchdog_Adjust+0xb8>
200cee4: 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;
200cee8: 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;
200ceec: b4 26 80 02 sub %i2, %g2, %i2
_Watchdog_First( header )->delta_interval = 1;
_ISR_Enable( level );
200cef0: 7f ff d9 19 call 2003354 <sparc_enable_interrupts>
200cef4: 01 00 00 00 nop
_Watchdog_Tickle( header );
200cef8: 40 00 00 a8 call 200d198 <_Watchdog_Tickle>
200cefc: 90 10 00 18 mov %i0, %o0
_ISR_Disable( level );
200cf00: 7f ff d9 11 call 2003344 <sparc_disable_interrupts>
200cf04: 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;
200cf08: c2 06 00 00 ld [ %i0 ], %g1
if ( _Chain_Is_empty( header ) )
200cf0c: 80 a7 00 01 cmp %i4, %g1
200cf10: 12 bf ff f0 bne 200ced0 <_Watchdog_Adjust+0x4c>
200cf14: 80 a6 a0 00 cmp %i2, 0
}
break;
}
}
_ISR_Enable( level );
200cf18: 7f ff d9 0f call 2003354 <sparc_enable_interrupts>
200cf1c: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
200cf20: 12 bf ff fe bne 200cf18 <_Watchdog_Adjust+0x94> <== NEVER TAKEN
200cf24: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200cf28: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200cf2c: b4 00 80 1a add %g2, %i2, %i2
200cf30: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
200cf34: 7f ff d9 08 call 2003354 <sparc_enable_interrupts>
200cf38: 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;
200cf3c: 10 bf ff f7 b 200cf18 <_Watchdog_Adjust+0x94>
200cf40: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
0201cb60 <_Watchdog_Adjust_to_chain>:
Chain_Control *header,
Watchdog_Interval units_arg,
Chain_Control *to_fire
)
{
201cb60: 9d e3 bf a0 save %sp, -96, %sp
Watchdog_Interval units = units_arg;
ISR_Level level;
Watchdog_Control *first;
_ISR_Disable( level );
201cb64: 7f ff ca e5 call 200f6f8 <sparc_disable_interrupts>
201cb68: 01 00 00 00 nop
201cb6c: c2 06 00 00 ld [ %i0 ], %g1
201cb70: ba 06 20 04 add %i0, 4, %i5
201cb74: b8 06 a0 04 add %i2, 4, %i4
while ( 1 ) {
if ( _Chain_Is_empty( header ) ) {
201cb78: 80 a7 40 01 cmp %i5, %g1
201cb7c: 02 80 00 20 be 201cbfc <_Watchdog_Adjust_to_chain+0x9c>
201cb80: 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 ) {
201cb84: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
201cb88: 80 a6 40 02 cmp %i1, %g2
201cb8c: 2a 80 00 1e bcs,a 201cc04 <_Watchdog_Adjust_to_chain+0xa4>
201cb90: 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;
201cb94: b2 26 40 02 sub %i1, %g2, %i1
first->delta_interval = 0;
201cb98: c0 20 60 10 clr [ %g1 + 0x10 ]
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
201cb9c: c4 00 60 04 ld [ %g1 + 4 ], %g2
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
201cba0: c6 00 40 00 ld [ %g1 ], %g3
previous = the_node->previous;
next->previous = previous;
201cba4: c4 20 e0 04 st %g2, [ %g3 + 4 ]
previous->next = next;
201cba8: 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;
201cbac: c4 06 a0 08 ld [ %i2 + 8 ], %g2
the_node->next = tail;
201cbb0: f8 20 40 00 st %i4, [ %g1 ]
tail->previous = the_node;
201cbb4: c2 26 a0 08 st %g1, [ %i2 + 8 ]
old_last->next = the_node;
201cbb8: c2 20 80 00 st %g1, [ %g2 ]
the_node->previous = old_last;
201cbbc: 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 );
201cbc0: 7f ff ca d2 call 200f708 <sparc_enable_interrupts>
201cbc4: 01 00 00 00 nop
201cbc8: 7f ff ca cc call 200f6f8 <sparc_disable_interrupts>
201cbcc: 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;
201cbd0: c2 06 00 00 ld [ %i0 ], %g1
if ( _Chain_Is_empty( header ) )
201cbd4: 80 a7 40 01 cmp %i5, %g1
201cbd8: 02 bf ff e9 be 201cb7c <_Watchdog_Adjust_to_chain+0x1c>
201cbdc: 01 00 00 00 nop
break;
first = _Watchdog_First( header );
if ( first->delta_interval != 0 )
201cbe0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
201cbe4: 80 a0 a0 00 cmp %g2, 0
201cbe8: 22 bf ff ee be,a 201cba0 <_Watchdog_Adjust_to_chain+0x40>
201cbec: c4 00 60 04 ld [ %g1 + 4 ], %g2
Watchdog_Control *first;
_ISR_Disable( level );
while ( 1 ) {
if ( _Chain_Is_empty( header ) ) {
201cbf0: 80 a7 40 01 cmp %i5, %g1
201cbf4: 12 bf ff e6 bne 201cb8c <_Watchdog_Adjust_to_chain+0x2c> <== ALWAYS TAKEN
201cbf8: 80 a6 40 02 cmp %i1, %g2
if ( first->delta_interval != 0 )
break;
}
}
_ISR_Enable( level );
201cbfc: 7f ff ca c3 call 200f708 <sparc_enable_interrupts>
201cc00: 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;
201cc04: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( first->delta_interval != 0 )
break;
}
}
_ISR_Enable( level );
201cc08: 7f ff ca c0 call 200f708 <sparc_enable_interrupts>
201cc0c: 91 e8 00 08 restore %g0, %o0, %o0
0200b63c <_Watchdog_Remove>:
#include <rtems/score/watchdog.h>
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
200b63c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
200b640: 7f ff db f3 call 200260c <sparc_disable_interrupts>
200b644: 01 00 00 00 nop
previous_state = the_watchdog->state;
200b648: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
200b64c: 80 a7 60 01 cmp %i5, 1
200b650: 02 80 00 2a be 200b6f8 <_Watchdog_Remove+0xbc>
200b654: 03 00 80 79 sethi %hi(0x201e400), %g1
200b658: 1a 80 00 09 bcc 200b67c <_Watchdog_Remove+0x40>
200b65c: 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;
200b660: 03 00 80 79 sethi %hi(0x201e400), %g1
200b664: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201e40c <_Watchdog_Ticks_since_boot>
200b668: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b66c: 7f ff db ec call 200261c <sparc_enable_interrupts>
200b670: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b674: 81 c7 e0 08 ret
200b678: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
200b67c: 18 bf ff fa bgu 200b664 <_Watchdog_Remove+0x28> <== NEVER TAKEN
200b680: 03 00 80 79 sethi %hi(0x201e400), %g1
RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next(
Watchdog_Control *the_watchdog
)
{
return ( (Watchdog_Control *) the_watchdog->Node.next );
200b684: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
200b688: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
200b68c: c4 00 40 00 ld [ %g1 ], %g2
200b690: 80 a0 a0 00 cmp %g2, 0
200b694: 02 80 00 07 be 200b6b0 <_Watchdog_Remove+0x74>
200b698: 05 00 80 79 sethi %hi(0x201e400), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
200b69c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200b6a0: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
200b6a4: 84 00 c0 02 add %g3, %g2, %g2
200b6a8: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
200b6ac: 05 00 80 79 sethi %hi(0x201e400), %g2
200b6b0: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ! 201e408 <_Watchdog_Sync_count>
200b6b4: 80 a0 a0 00 cmp %g2, 0
200b6b8: 22 80 00 07 be,a 200b6d4 <_Watchdog_Remove+0x98>
200b6bc: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
200b6c0: 05 00 80 7a sethi %hi(0x201e800), %g2
200b6c4: c6 00 a0 48 ld [ %g2 + 0x48 ], %g3 ! 201e848 <_Per_CPU_Information+0x8>
200b6c8: 05 00 80 78 sethi %hi(0x201e000), %g2
200b6cc: c6 20 a3 a8 st %g3, [ %g2 + 0x3a8 ] ! 201e3a8 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
200b6d0: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
200b6d4: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
200b6d8: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
200b6dc: 03 00 80 79 sethi %hi(0x201e400), %g1
200b6e0: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201e40c <_Watchdog_Ticks_since_boot>
200b6e4: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b6e8: 7f ff db cd call 200261c <sparc_enable_interrupts>
200b6ec: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b6f0: 81 c7 e0 08 ret
200b6f4: 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;
200b6f8: c2 00 60 0c ld [ %g1 + 0xc ], %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;
200b6fc: 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;
200b700: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200b704: 7f ff db c6 call 200261c <sparc_enable_interrupts>
200b708: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200b70c: 81 c7 e0 08 ret
200b710: 81 e8 00 00 restore
0200c8c4 <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200c8c4: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200c8c8: 7f ff d9 9d call 2002f3c <sparc_disable_interrupts>
200c8cc: 01 00 00 00 nop
200c8d0: b6 10 00 08 mov %o0, %i3
printk( "Watchdog Chain: %s %p\n", name, header );
200c8d4: 11 00 80 78 sethi %hi(0x201e000), %o0
200c8d8: 94 10 00 19 mov %i1, %o2
200c8dc: 92 10 00 18 mov %i0, %o1
200c8e0: 7f ff e1 52 call 2004e28 <printk>
200c8e4: 90 12 21 f8 or %o0, 0x1f8, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200c8e8: 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 );
200c8ec: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200c8f0: 80 a7 40 19 cmp %i5, %i1
200c8f4: 02 80 00 0f be 200c930 <_Watchdog_Report_chain+0x6c>
200c8f8: 11 00 80 78 sethi %hi(0x201e000), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200c8fc: 92 10 00 1d mov %i5, %o1
200c900: 40 00 00 0f call 200c93c <_Watchdog_Report>
200c904: 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 )
200c908: 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 ) ;
200c90c: 80 a7 40 19 cmp %i5, %i1
200c910: 12 bf ff fc bne 200c900 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
200c914: 92 10 00 1d mov %i5, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200c918: 11 00 80 78 sethi %hi(0x201e000), %o0
200c91c: 92 10 00 18 mov %i0, %o1
200c920: 7f ff e1 42 call 2004e28 <printk>
200c924: 90 12 22 10 or %o0, 0x210, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
200c928: 7f ff d9 89 call 2002f4c <sparc_enable_interrupts>
200c92c: 91 e8 00 1b restore %g0, %i3, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200c930: 7f ff e1 3e call 2004e28 <printk>
200c934: 90 12 22 20 or %o0, 0x220, %o0
200c938: 30 bf ff fc b,a 200c928 <_Watchdog_Report_chain+0x64>
0200b714 <_Watchdog_Tickle>:
#include <rtems/score/watchdog.h>
void _Watchdog_Tickle(
Chain_Control *header
)
{
200b714: 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 );
200b718: 7f ff db bd call 200260c <sparc_disable_interrupts>
200b71c: 01 00 00 00 nop
200b720: 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;
200b724: 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 );
200b728: b4 06 20 04 add %i0, 4, %i2
if ( _Chain_Is_empty( header ) )
200b72c: 80 a7 40 1a cmp %i5, %i2
200b730: 02 80 00 09 be 200b754 <_Watchdog_Tickle+0x40>
200b734: 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) {
200b738: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200b73c: 80 a0 60 00 cmp %g1, 0
200b740: 02 80 00 15 be 200b794 <_Watchdog_Tickle+0x80> <== NEVER TAKEN
200b744: 82 00 7f ff add %g1, -1, %g1
the_watchdog->delta_interval--;
if ( the_watchdog->delta_interval != 0 )
200b748: 80 a0 60 00 cmp %g1, 0
200b74c: 02 80 00 12 be 200b794 <_Watchdog_Tickle+0x80>
200b750: 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);
200b754: 7f ff db b2 call 200261c <sparc_enable_interrupts>
200b758: 91 e8 00 1c restore %g0, %i4, %o0
_ISR_Enable( level );
switch( watchdog_state ) {
case WATCHDOG_ACTIVE:
(*the_watchdog->routine)(
200b75c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200b760: 9f c0 40 00 call %g1
200b764: d2 07 60 24 ld [ %i5 + 0x24 ], %o1
case WATCHDOG_REMOVE_IT:
break;
}
_ISR_Disable( level );
200b768: 7f ff db a9 call 200260c <sparc_disable_interrupts>
200b76c: 01 00 00 00 nop
200b770: b8 10 00 08 mov %o0, %i4
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
200b774: fa 06 00 00 ld [ %i0 ], %i5
the_watchdog = _Watchdog_First( header );
} while ( !_Chain_Is_empty( header ) &&
(the_watchdog->delta_interval == 0) );
200b778: 80 a6 80 1d cmp %i2, %i5
200b77c: 02 bf ff f6 be 200b754 <_Watchdog_Tickle+0x40>
200b780: 01 00 00 00 nop
}
_ISR_Disable( level );
the_watchdog = _Watchdog_First( header );
} while ( !_Chain_Is_empty( header ) &&
200b784: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200b788: 80 a0 60 00 cmp %g1, 0
200b78c: 12 bf ff f2 bne 200b754 <_Watchdog_Tickle+0x40>
200b790: 01 00 00 00 nop
if ( the_watchdog->delta_interval != 0 )
goto leave;
}
do {
watchdog_state = _Watchdog_Remove( the_watchdog );
200b794: 7f ff ff aa call 200b63c <_Watchdog_Remove>
200b798: 90 10 00 1d mov %i5, %o0
200b79c: b6 10 00 08 mov %o0, %i3
_ISR_Enable( level );
200b7a0: 7f ff db 9f call 200261c <sparc_enable_interrupts>
200b7a4: 90 10 00 1c mov %i4, %o0
switch( watchdog_state ) {
200b7a8: 80 a6 e0 02 cmp %i3, 2
200b7ac: 12 bf ff ef bne 200b768 <_Watchdog_Tickle+0x54>
200b7b0: 01 00 00 00 nop
case WATCHDOG_ACTIVE:
(*the_watchdog->routine)(
200b7b4: 10 bf ff ea b 200b75c <_Watchdog_Tickle+0x48>
200b7b8: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
0200b7bc <_Workspace_Handler_initialization>:
void _Workspace_Handler_initialization(
Heap_Area *areas,
size_t area_count,
Heap_Initialization_or_extend_handler extend
)
{
200b7bc: 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();
200b7c0: 05 00 80 6d sethi %hi(0x201b400), %g2
200b7c4: 82 10 a0 c8 or %g2, 0xc8, %g1 ! 201b4c8 <Configuration>
200b7c8: c6 08 60 32 ldub [ %g1 + 0x32 ], %g3
200b7cc: f6 00 a0 c8 ld [ %g2 + 0xc8 ], %i3
200b7d0: 80 a0 e0 00 cmp %g3, 0
200b7d4: 12 80 00 03 bne 200b7e0 <_Workspace_Handler_initialization+0x24>
200b7d8: 84 10 20 00 clr %g2
200b7dc: c4 00 60 04 ld [ %g1 + 4 ], %g2
200b7e0: b6 00 80 1b add %g2, %i3, %i3
bool do_zero = rtems_configuration_get_do_zero_of_workspace();
200b7e4: c4 08 60 30 ldub [ %g1 + 0x30 ], %g2
bool unified = rtems_configuration_get_unified_work_area();
200b7e8: 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();
200b7ec: 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) {
200b7f0: 80 a6 60 00 cmp %i1, 0
200b7f4: 02 80 00 3c be 200b8e4 <_Workspace_Handler_initialization+0x128><== NEVER TAKEN
200b7f8: 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;
200b7fc: 23 00 80 23 sethi %hi(0x2008c00), %l1
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
200b800: 27 00 80 78 sethi %hi(0x201e000), %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) {
200b804: 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;
200b808: a2 14 62 6c or %l1, 0x26c, %l1
200b80c: a0 08 a0 ff and %g2, 0xff, %l0
if ( area->size > overhead ) {
uintptr_t space_available;
uintptr_t size;
if ( unified ) {
200b810: a4 08 60 ff and %g1, 0xff, %l2
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
200b814: 10 80 00 22 b 200b89c <_Workspace_Handler_initialization+0xe0>
200b818: a6 14 e3 30 or %l3, 0x330, %l3
if ( do_zero ) {
memset( area->begin, 0, area->size );
}
if ( area->size > overhead ) {
200b81c: 80 a7 60 16 cmp %i5, 0x16
200b820: 28 80 00 1c bleu,a 200b890 <_Workspace_Handler_initialization+0xd4>
200b824: b8 07 20 01 inc %i4
uintptr_t space_available;
uintptr_t size;
if ( unified ) {
200b828: 80 a4 a0 00 cmp %l2, 0
200b82c: 32 80 00 0a bne,a 200b854 <_Workspace_Handler_initialization+0x98>
200b830: d2 06 00 00 ld [ %i0 ], %o1
size = area->size;
} else {
if ( remaining > 0 ) {
200b834: 80 a6 e0 00 cmp %i3, 0
200b838: 22 80 00 22 be,a 200b8c0 <_Workspace_Handler_initialization+0x104><== NEVER TAKEN
200b83c: d2 06 00 00 ld [ %i0 ], %o1 <== NOT EXECUTED
size = remaining < area->size - overhead ?
200b840: 82 07 7f ea add %i5, -22, %g1
remaining + overhead : area->size;
200b844: 80 a0 40 1b cmp %g1, %i3
200b848: 38 80 00 02 bgu,a 200b850 <_Workspace_Handler_initialization+0x94><== ALWAYS TAKEN
200b84c: ba 06 e0 16 add %i3, 0x16, %i5
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
200b850: d2 06 00 00 ld [ %i0 ], %o1
200b854: 94 10 00 1d mov %i5, %o2
200b858: 90 10 00 13 mov %l3, %o0
200b85c: 9f c4 40 00 call %l1
200b860: 96 10 20 08 mov 8, %o3
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
200b864: c2 06 00 00 ld [ %i0 ], %g1
area->size -= size;
200b868: c4 06 20 04 ld [ %i0 + 4 ], %g2
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
200b86c: 82 00 40 1d add %g1, %i5, %g1
area->size -= size;
200b870: ba 20 80 1d sub %g2, %i5, %i5
area->begin,
size,
page_size
);
area->begin = (char *) area->begin + size;
200b874: c2 26 00 00 st %g1, [ %i0 ]
area->size -= size;
if ( space_available < remaining ) {
200b878: 80 a2 00 1b cmp %o0, %i3
200b87c: 1a 80 00 1f bcc 200b8f8 <_Workspace_Handler_initialization+0x13c><== ALWAYS TAKEN
200b880: fa 26 20 04 st %i5, [ %i0 + 4 ]
remaining -= space_available;
200b884: b6 26 c0 08 sub %i3, %o0, %i3 <== NOT EXECUTED
} else {
remaining = 0;
}
init_or_extend = extend;
200b888: 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) {
200b88c: b8 07 20 01 inc %i4
200b890: 80 a7 00 19 cmp %i4, %i1
200b894: 02 80 00 14 be 200b8e4 <_Workspace_Handler_initialization+0x128><== ALWAYS TAKEN
200b898: b0 06 20 08 add %i0, 8, %i0
Heap_Area *area = &areas [i];
if ( do_zero ) {
200b89c: 80 a4 20 00 cmp %l0, 0
200b8a0: 22 bf ff df be,a 200b81c <_Workspace_Handler_initialization+0x60>
200b8a4: fa 06 20 04 ld [ %i0 + 4 ], %i5
memset( area->begin, 0, area->size );
200b8a8: d0 06 00 00 ld [ %i0 ], %o0
200b8ac: d4 06 20 04 ld [ %i0 + 4 ], %o2
200b8b0: 40 00 15 58 call 2010e10 <memset>
200b8b4: 92 10 20 00 clr %o1
}
if ( area->size > overhead ) {
200b8b8: 10 bf ff d9 b 200b81c <_Workspace_Handler_initialization+0x60>
200b8bc: fa 06 20 04 ld [ %i0 + 4 ], %i5
} else {
size = 0;
}
}
space_available = (*init_or_extend)(
200b8c0: 90 10 00 13 mov %l3, %o0 <== NOT EXECUTED
200b8c4: 94 10 20 00 clr %o2 <== NOT EXECUTED
200b8c8: 9f c4 40 00 call %l1 <== NOT EXECUTED
200b8cc: 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) {
200b8d0: b8 07 20 01 inc %i4 <== NOT EXECUTED
remaining -= space_available;
} else {
remaining = 0;
}
init_or_extend = extend;
200b8d4: 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) {
200b8d8: 80 a7 00 19 cmp %i4, %i1 <== NOT EXECUTED
200b8dc: 12 bf ff f0 bne 200b89c <_Workspace_Handler_initialization+0xe0><== NOT EXECUTED
200b8e0: b0 06 20 08 add %i0, 8, %i0 <== NOT EXECUTED
init_or_extend = extend;
}
}
if ( remaining > 0 ) {
200b8e4: 80 a6 e0 00 cmp %i3, 0
200b8e8: 12 80 00 07 bne 200b904 <_Workspace_Handler_initialization+0x148>
200b8ec: 90 10 20 00 clr %o0
200b8f0: 81 c7 e0 08 ret
200b8f4: 81 e8 00 00 restore
remaining -= space_available;
} else {
remaining = 0;
}
init_or_extend = extend;
200b8f8: a2 10 00 1a mov %i2, %l1
area->size -= size;
if ( space_available < remaining ) {
remaining -= space_available;
} else {
remaining = 0;
200b8fc: 10 bf ff e4 b 200b88c <_Workspace_Handler_initialization+0xd0>
200b900: b6 10 20 00 clr %i3
init_or_extend = extend;
}
}
if ( remaining > 0 ) {
_Internal_error_Occurred(
200b904: 92 10 20 01 mov 1, %o1
200b908: 7f ff f5 f6 call 20090e0 <_Internal_error_Occurred>
200b90c: 94 10 20 02 mov 2, %o2
02007984 <adjtime>:
*/
int adjtime(
const struct timeval *delta,
struct timeval *olddelta
)
{
2007984: 9d e3 bf 98 save %sp, -104, %sp
long adjustment;
/*
* Simple validations
*/
if ( !delta )
2007988: 80 a6 20 00 cmp %i0, 0
200798c: 02 80 00 8e be 2007bc4 <adjtime+0x240>
2007990: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
2007994: c4 06 20 04 ld [ %i0 + 4 ], %g2
2007998: 03 00 03 d0 sethi %hi(0xf4000), %g1
200799c: 82 10 62 3f or %g1, 0x23f, %g1 ! f423f <PROM_START+0xf423f>
20079a0: 80 a0 80 01 cmp %g2, %g1
20079a4: 18 80 00 88 bgu 2007bc4 <adjtime+0x240>
20079a8: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( olddelta ) {
20079ac: 22 80 00 06 be,a 20079c4 <adjtime+0x40>
20079b0: c2 06 00 00 ld [ %i0 ], %g1
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
20079b4: c0 26 60 04 clr [ %i1 + 4 ]
20079b8: c4 06 20 04 ld [ %i0 + 4 ], %g2
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( olddelta ) {
olddelta->tv_sec = 0;
20079bc: c0 26 40 00 clr [ %i1 ]
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20079c0: c2 06 00 00 ld [ %i0 ], %g1
adjustment += delta->tv_usec;
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20079c4: 07 00 80 77 sethi %hi(0x201dc00), %g3
20079c8: c8 00 e0 0c ld [ %g3 + 0xc ], %g4 ! 201dc0c <Configuration+0xc>
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20079cc: bb 28 60 08 sll %g1, 8, %i5
20079d0: 87 28 60 03 sll %g1, 3, %g3
20079d4: 86 27 40 03 sub %i5, %g3, %g3
20079d8: bb 28 e0 06 sll %g3, 6, %i5
20079dc: 86 27 40 03 sub %i5, %g3, %g3
20079e0: 82 00 c0 01 add %g3, %g1, %g1
20079e4: 83 28 60 06 sll %g1, 6, %g1
adjustment += delta->tv_usec;
20079e8: 84 00 40 02 add %g1, %g2, %g2
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20079ec: 80 a0 80 04 cmp %g2, %g4
20079f0: 1a 80 00 05 bcc 2007a04 <adjtime+0x80>
20079f4: 03 00 80 83 sethi %hi(0x2020c00), %g1
return 0;
20079f8: 82 10 20 00 clr %g1
/* set the user's output */
if ( olddelta )
*olddelta = *delta;
return 0;
}
20079fc: 81 c7 e0 08 ret
2007a00: 91 e8 00 01 restore %g0, %g1, %o0
*
* 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;
2007a04: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2
++level;
2007a08: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2007a0c: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ]
)
{
Timestamp_Control tod_as_timestamp;
Timestamp_Control *tod_as_timestamp_ptr;
tod_as_timestamp_ptr =
2007a10: 13 00 80 83 sethi %hi(0x2020c00), %o1
2007a14: 90 07 bf f8 add %fp, -8, %o0
2007a18: 40 00 07 2e call 20096d0 <_TOD_Get_with_nanoseconds>
2007a1c: 92 12 63 28 or %o1, 0x328, %o1
2007a20: f8 1a 00 00 ldd [ %o0 ], %i4
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
2007a24: 94 10 20 00 clr %o2
2007a28: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2007a2c: 90 10 00 1c mov %i4, %o0
2007a30: 96 12 e2 00 or %o3, 0x200, %o3
2007a34: 40 00 51 5b call 201bfa0 <__divdi3>
2007a38: 92 10 00 1d mov %i5, %o1
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2007a3c: f6 06 00 00 ld [ %i0 ], %i3
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
2007a40: 94 10 20 00 clr %o2
2007a44: b6 06 c0 09 add %i3, %o1, %i3
2007a48: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2007a4c: 90 10 00 1c mov %i4, %o0
2007a50: 96 12 e2 00 or %o3, 0x200, %o3
2007a54: 40 00 52 3e call 201c34c <__moddi3>
2007a58: 92 10 00 1d mov %i5, %o1
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2007a5c: c2 06 20 04 ld [ %i0 + 4 ], %g1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
2007a60: 09 31 19 4d sethi %hi(0xc4653400), %g4
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2007a64: 87 28 60 07 sll %g1, 7, %g3
2007a68: 85 28 60 02 sll %g1, 2, %g2
2007a6c: 84 20 c0 02 sub %g3, %g2, %g2
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
2007a70: 88 11 22 00 or %g4, 0x200, %g4
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2007a74: 82 00 80 01 add %g2, %g1, %g1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2007a78: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2007a7c: 83 28 60 03 sll %g1, 3, %g1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2007a80: 86 10 e1 ff or %g3, 0x1ff, %g3
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2007a84: 92 02 40 01 add %o1, %g1, %o1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2007a88: 80 a2 40 03 cmp %o1, %g3
2007a8c: 08 80 00 07 bleu 2007aa8 <adjtime+0x124>
2007a90: 84 06 e0 01 add %i3, 1, %g2
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
2007a94: 92 02 40 04 add %o1, %g4, %o1
ts.tv_sec++;
2007a98: b6 10 00 02 mov %g2, %i3
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2007a9c: 80 a2 40 03 cmp %o1, %g3
2007aa0: 18 bf ff fd bgu 2007a94 <adjtime+0x110> <== NEVER TAKEN
2007aa4: 84 00 a0 01 inc %g2
ts.tv_sec++;
}
/* if adjustment is too much negative */
while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) {
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
2007aa8: 3b 0e e6 b2 sethi %hi(0x3b9ac800), %i5
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
ts.tv_sec++;
}
/* if adjustment is too much negative */
while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) {
2007aac: 07 31 19 4d sethi %hi(0xc4653400), %g3
2007ab0: 82 10 00 09 mov %o1, %g1
int _EXFUN(setitimer, (int __which, const struct itimerval *__value,
struct itimerval *__ovalue));
#if defined(__rtems__)
/* BSD function used by RTEMS code */
int _EXFUN(adjtime,(const struct timeval *, struct timeval *));
2007ab4: 84 06 ff ff add %i3, -1, %g2
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
2007ab8: ba 17 62 00 or %i5, 0x200, %i5
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
ts.tv_sec++;
}
/* if adjustment is too much negative */
while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) {
2007abc: 86 10 e2 00 or %g3, 0x200, %g3
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
2007ac0: 82 00 40 1d add %g1, %i5, %g1
ts.tv_sec--;
2007ac4: 88 10 00 02 mov %g2, %g4
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
ts.tv_sec++;
}
/* if adjustment is too much negative */
while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) {
2007ac8: 80 a0 40 03 cmp %g1, %g3
2007acc: 08 bf ff fd bleu 2007ac0 <adjtime+0x13c>
2007ad0: 84 00 bf ff add %g2, -1, %g2
const struct timespec *tod_as_timespec
)
{
Timestamp_Control tod_as_timestamp;
_Timestamp_Set(
2007ad4: 85 39 20 1f sra %g4, 0x1f, %g2
2007ad8: a6 10 00 01 mov %g1, %l3
2007adc: a5 38 60 1f sra %g1, 0x1f, %l2
Timestamp64_Control *_time,
Timestamp64_Control _seconds,
Timestamp64_Control _nanoseconds
)
{
*_time = _seconds * 1000000000L + _nanoseconds;
2007ae0: 83 28 a0 03 sll %g2, 3, %g1
2007ae4: 86 10 00 04 mov %g4, %g3
2007ae8: 89 31 20 1d srl %g4, 0x1d, %g4
2007aec: bb 28 e0 03 sll %g3, 3, %i5
2007af0: b8 11 00 01 or %g4, %g1, %i4
2007af4: 83 37 60 1b srl %i5, 0x1b, %g1
2007af8: a9 2f 20 05 sll %i4, 5, %l4
2007afc: ab 2f 60 05 sll %i5, 5, %l5
2007b00: a8 10 40 14 or %g1, %l4, %l4
2007b04: ba a5 40 1d subcc %l5, %i5, %i5
2007b08: 83 37 60 1a srl %i5, 0x1a, %g1
2007b0c: b8 65 00 1c subx %l4, %i4, %i4
2007b10: a3 2f 60 06 sll %i5, 6, %l1
2007b14: a1 2f 20 06 sll %i4, 6, %l0
2007b18: ba a4 40 1d subcc %l1, %i5, %i5
2007b1c: a0 10 40 10 or %g1, %l0, %l0
2007b20: b8 64 00 1c subx %l0, %i4, %i4
2007b24: ae 87 40 03 addcc %i5, %g3, %l7
2007b28: 83 35 e0 1e srl %l7, 0x1e, %g1
2007b2c: ac 47 00 02 addx %i4, %g2, %l6
2007b30: 97 2d e0 02 sll %l7, 2, %o3
2007b34: 95 2d a0 02 sll %l6, 2, %o2
2007b38: 86 85 c0 0b addcc %l7, %o3, %g3
2007b3c: 94 10 40 0a or %g1, %o2, %o2
2007b40: 9b 28 e0 02 sll %g3, 2, %o5
2007b44: 84 45 80 0a addx %l6, %o2, %g2
2007b48: 83 30 e0 1e srl %g3, 0x1e, %g1
2007b4c: ba 80 c0 0d addcc %g3, %o5, %i5
2007b50: 99 28 a0 02 sll %g2, 2, %o4
2007b54: b7 2f 60 02 sll %i5, 2, %i3
2007b58: 98 10 40 0c or %g1, %o4, %o4
2007b5c: 83 37 60 1e srl %i5, 0x1e, %g1
2007b60: b8 40 80 0c addx %g2, %o4, %i4
2007b64: 86 87 40 1b addcc %i5, %i3, %g3
2007b68: b5 2f 20 02 sll %i4, 2, %i2
2007b6c: bb 30 e0 17 srl %g3, 0x17, %i5
2007b70: b4 10 40 1a or %g1, %i2, %i2
2007b74: 84 47 00 1a addx %i4, %i2, %g2
2007b78: 83 28 e0 09 sll %g3, 9, %g1
2007b7c: 89 28 a0 09 sll %g2, 9, %g4
&tod_as_timestamp,
tod_as_timespec->tv_sec,
tod_as_timespec->tv_nsec
);
_TOD_Set_with_timestamp( &tod_as_timestamp );
2007b80: 90 07 bf f8 add %fp, -8, %o0
2007b84: 84 17 40 04 or %i5, %g4, %g2
2007b88: ba 84 c0 01 addcc %l3, %g1, %i5
2007b8c: b8 44 80 02 addx %l2, %g2, %i4
2007b90: 40 00 06 eb call 200973c <_TOD_Set_with_timestamp>
2007b94: f8 3f bf f8 std %i4, [ %fp + -8 ]
ts.tv_sec--;
}
_TOD_Set( &ts );
_Thread_Enable_dispatch();
2007b98: 40 00 0d c7 call 200b2b4 <_Thread_Enable_dispatch>
2007b9c: 01 00 00 00 nop
/* set the user's output */
if ( olddelta )
2007ba0: 80 a6 60 00 cmp %i1, 0
2007ba4: 02 bf ff 95 be 20079f8 <adjtime+0x74>
2007ba8: 82 10 20 00 clr %g1
*olddelta = *delta;
2007bac: c4 06 00 00 ld [ %i0 ], %g2
2007bb0: c4 26 40 00 st %g2, [ %i1 ]
2007bb4: c4 06 20 04 ld [ %i0 + 4 ], %g2
2007bb8: c4 26 60 04 st %g2, [ %i1 + 4 ]
return 0;
}
2007bbc: 81 c7 e0 08 ret
2007bc0: 91 e8 00 01 restore %g0, %g1, %o0
*/
if ( !delta )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
rtems_set_errno_and_return_minus_one( EINVAL );
2007bc4: 40 00 25 2c call 2011074 <__errno>
2007bc8: 01 00 00 00 nop
2007bcc: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
2007bd0: 82 10 3f ff mov -1, %g1
2007bd4: 10 bf ff 8a b 20079fc <adjtime+0x78>
2007bd8: c4 22 00 00 st %g2, [ %o0 ]
02007b90 <aio_cancel>:
#include <stdlib.h>
#include <rtems/system.h>
#include <rtems/seterr.h>
int aio_cancel(int fildes, struct aiocb *aiocbp)
{
2007b90: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request_chain *r_chain;
int result;
pthread_mutex_lock (&aio_request_queue.mutex);
2007b94: 3b 00 80 82 sethi %hi(0x2020800), %i5
2007b98: 40 00 04 85 call 2008dac <pthread_mutex_lock>
2007b9c: 90 17 60 4c or %i5, 0x4c, %o0 ! 202084c <aio_request_queue>
if (fcntl (fildes, F_GETFD) < 0) {
2007ba0: 90 10 00 18 mov %i0, %o0
2007ba4: 40 00 1c 73 call 200ed70 <fcntl>
2007ba8: 92 10 20 01 mov 1, %o1
2007bac: 80 a2 20 00 cmp %o0, 0
2007bb0: 06 80 00 6c bl 2007d60 <aio_cancel+0x1d0>
2007bb4: 80 a6 60 00 cmp %i1, 0
pthread_mutex_unlock(&aio_request_queue.mutex);
rtems_set_errno_and_return_minus_one (EBADF);
}
/* if aiocbp is NULL remove all request for given file descriptor */
if (aiocbp == NULL) {
2007bb8: 02 80 00 3b be 2007ca4 <aio_cancel+0x114>
2007bbc: 92 10 00 18 mov %i0, %o1
pthread_mutex_unlock (&aio_request_queue.mutex);
return AIO_CANCELED;
} else {
AIO_printf ("Cancel request\n");
if (aiocbp->aio_fildes != fildes) {
2007bc0: f8 06 40 00 ld [ %i1 ], %i4
2007bc4: 80 a7 00 18 cmp %i4, %i0
2007bc8: 12 80 00 2f bne 2007c84 <aio_cancel+0xf4>
2007bcc: 90 17 60 4c or %i5, 0x4c, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
rtems_set_errno_and_return_minus_one (EINVAL);
}
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0);
2007bd0: 92 10 00 1c mov %i4, %o1
2007bd4: 11 00 80 82 sethi %hi(0x2020800), %o0
2007bd8: 94 10 20 00 clr %o2
2007bdc: 40 00 01 92 call 2008224 <rtems_aio_search_fd>
2007be0: 90 12 20 94 or %o0, 0x94, %o0
if (r_chain == NULL) {
2007be4: b6 92 20 00 orcc %o0, 0, %i3
2007be8: 22 80 00 0f be,a 2007c24 <aio_cancel+0x94>
2007bec: b6 17 60 4c or %i5, 0x4c, %i3
return AIO_ALLDONE;
}
}
AIO_printf ("Request on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2007bf0: b8 06 e0 1c add %i3, 0x1c, %i4
2007bf4: 40 00 04 6e call 2008dac <pthread_mutex_lock>
2007bf8: 90 10 00 1c mov %i4, %o0
result = rtems_aio_remove_req (&r_chain->perfd, aiocbp);
2007bfc: 92 10 00 19 mov %i1, %o1
2007c00: 40 00 01 d2 call 2008348 <rtems_aio_remove_req>
2007c04: 90 06 e0 08 add %i3, 8, %o0
2007c08: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&r_chain->mutex);
2007c0c: 40 00 04 88 call 2008e2c <pthread_mutex_unlock>
2007c10: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
2007c14: 40 00 04 86 call 2008e2c <pthread_mutex_unlock>
2007c18: 90 17 60 4c or %i5, 0x4c, %o0
return result;
}
return AIO_ALLDONE;
}
2007c1c: 81 c7 e0 08 ret
2007c20: 81 e8 00 00 restore
rtems_set_errno_and_return_minus_one (EINVAL);
}
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0);
if (r_chain == NULL) {
if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) {
2007c24: c4 06 e0 54 ld [ %i3 + 0x54 ], %g2
2007c28: 82 06 e0 58 add %i3, 0x58, %g1
2007c2c: 80 a0 80 01 cmp %g2, %g1
2007c30: 02 80 00 0f be 2007c6c <aio_cancel+0xdc> <== NEVER TAKEN
2007c34: 90 06 e0 54 add %i3, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2007c38: 92 10 00 1c mov %i4, %o1
2007c3c: 40 00 01 7a call 2008224 <rtems_aio_search_fd>
2007c40: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2007c44: 80 a2 20 00 cmp %o0, 0
2007c48: 02 80 00 0e be 2007c80 <aio_cancel+0xf0>
2007c4c: 92 10 00 19 mov %i1, %o1
rtems_set_errno_and_return_minus_one (EINVAL);
}
AIO_printf ("Request on [IQ]\n");
result = rtems_aio_remove_req (&r_chain->perfd, aiocbp);
2007c50: 40 00 01 be call 2008348 <rtems_aio_remove_req>
2007c54: 90 02 20 08 add %o0, 8, %o0
2007c58: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&aio_request_queue.mutex);
2007c5c: 40 00 04 74 call 2008e2c <pthread_mutex_unlock>
2007c60: 90 10 00 1b mov %i3, %o0
return result;
2007c64: 81 c7 e0 08 ret
2007c68: 81 e8 00 00 restore
if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) {
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
if (r_chain == NULL) {
pthread_mutex_unlock(&aio_request_queue.mutex);
return AIO_ALLDONE;
2007c6c: b0 10 20 02 mov 2, %i0 <== NOT EXECUTED
AIO_printf ("Request chain not on [WQ]\n");
if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) {
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
if (r_chain == NULL) {
pthread_mutex_unlock(&aio_request_queue.mutex);
2007c70: 40 00 04 6f call 2008e2c <pthread_mutex_unlock>
2007c74: 90 17 60 4c or %i5, 0x4c, %o0
return AIO_ALLDONE;
2007c78: 81 c7 e0 08 ret
2007c7c: 81 e8 00 00 restore
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0);
if (r_chain == NULL) {
if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) {
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
if (r_chain == NULL) {
pthread_mutex_unlock (&aio_request_queue.mutex);
2007c80: 90 10 00 1b mov %i3, %o0
2007c84: 40 00 04 6a call 2008e2c <pthread_mutex_unlock>
2007c88: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one (EINVAL);
2007c8c: 40 00 2a eb call 2012838 <__errno>
2007c90: 01 00 00 00 nop
2007c94: 82 10 20 16 mov 0x16, %g1 ! 16 <PROM_START+0x16>
2007c98: c2 22 00 00 st %g1, [ %o0 ]
2007c9c: 81 c7 e0 08 ret
2007ca0: 81 e8 00 00 restore
/* if aiocbp is NULL remove all request for given file descriptor */
if (aiocbp == NULL) {
AIO_printf ("Cancel all requests\n");
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0);
2007ca4: 11 00 80 82 sethi %hi(0x2020800), %o0
2007ca8: 94 10 20 00 clr %o2
2007cac: 40 00 01 5e call 2008224 <rtems_aio_search_fd>
2007cb0: 90 12 20 94 or %o0, 0x94, %o0
if (r_chain == NULL) {
2007cb4: b8 92 20 00 orcc %o0, 0, %i4
2007cb8: 02 80 00 0f be 2007cf4 <aio_cancel+0x164>
2007cbc: b6 07 20 1c add %i4, 0x1c, %i3
return AIO_ALLDONE;
}
AIO_printf ("Request chain on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2007cc0: 40 00 04 3b call 2008dac <pthread_mutex_lock>
2007cc4: 90 10 00 1b mov %i3, %o0
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2007cc8: 40 00 0b 3a call 200a9b0 <_Chain_Extract>
2007ccc: 90 10 00 1c mov %i4, %o0
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
2007cd0: 40 00 01 8a call 20082f8 <rtems_aio_remove_fd>
2007cd4: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&r_chain->mutex);
2007cd8: 40 00 04 55 call 2008e2c <pthread_mutex_unlock>
2007cdc: 90 10 00 1b mov %i3, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return AIO_CANCELED;
2007ce0: b0 10 20 00 clr %i0
pthread_mutex_lock (&r_chain->mutex);
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
pthread_mutex_unlock (&r_chain->mutex);
pthread_mutex_unlock (&aio_request_queue.mutex);
2007ce4: 40 00 04 52 call 2008e2c <pthread_mutex_unlock>
2007ce8: 90 17 60 4c or %i5, 0x4c, %o0
return AIO_CANCELED;
2007cec: 81 c7 e0 08 ret
2007cf0: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2007cf4: b8 17 60 4c or %i5, 0x4c, %i4
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0);
if (r_chain == NULL) {
AIO_printf ("Request chain not on [WQ]\n");
if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) {
2007cf8: c4 07 20 54 ld [ %i4 + 0x54 ], %g2
2007cfc: 82 07 20 58 add %i4, 0x58, %g1
2007d00: 80 a0 80 01 cmp %g2, %g1
2007d04: 02 bf ff da be 2007c6c <aio_cancel+0xdc> <== NEVER TAKEN
2007d08: 90 07 20 54 add %i4, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2007d0c: 92 10 00 18 mov %i0, %o1
2007d10: 40 00 01 45 call 2008224 <rtems_aio_search_fd>
2007d14: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2007d18: b6 92 20 00 orcc %o0, 0, %i3
2007d1c: 22 bf ff d5 be,a 2007c70 <aio_cancel+0xe0>
2007d20: b0 10 20 02 mov 2, %i0
2007d24: 40 00 0b 23 call 200a9b0 <_Chain_Extract>
2007d28: ba 06 e0 1c add %i3, 0x1c, %i5
}
AIO_printf ("Request chain on [IQ]\n");
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
2007d2c: 40 00 01 73 call 20082f8 <rtems_aio_remove_fd>
2007d30: 90 10 00 1b mov %i3, %o0
pthread_mutex_destroy (&r_chain->mutex);
2007d34: 40 00 03 72 call 2008afc <pthread_mutex_destroy>
2007d38: 90 10 00 1d mov %i5, %o0
pthread_cond_destroy (&r_chain->mutex);
2007d3c: 40 00 02 94 call 200878c <pthread_cond_destroy>
2007d40: 90 10 00 1d mov %i5, %o0
free (r_chain);
2007d44: 7f ff ef 9a call 2003bac <free>
2007d48: 90 10 00 1b mov %i3, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return AIO_CANCELED;
2007d4c: b0 10 20 00 clr %i0
rtems_aio_remove_fd (r_chain);
pthread_mutex_destroy (&r_chain->mutex);
pthread_cond_destroy (&r_chain->mutex);
free (r_chain);
pthread_mutex_unlock (&aio_request_queue.mutex);
2007d50: 40 00 04 37 call 2008e2c <pthread_mutex_unlock>
2007d54: 90 10 00 1c mov %i4, %o0
return AIO_CANCELED;
2007d58: 81 c7 e0 08 ret
2007d5c: 81 e8 00 00 restore
int result;
pthread_mutex_lock (&aio_request_queue.mutex);
if (fcntl (fildes, F_GETFD) < 0) {
pthread_mutex_unlock(&aio_request_queue.mutex);
2007d60: 40 00 04 33 call 2008e2c <pthread_mutex_unlock>
2007d64: 90 17 60 4c or %i5, 0x4c, %o0
rtems_set_errno_and_return_minus_one (EBADF);
2007d68: 40 00 2a b4 call 2012838 <__errno>
2007d6c: b0 10 3f ff mov -1, %i0
2007d70: 82 10 20 09 mov 9, %g1
2007d74: c2 22 00 00 st %g1, [ %o0 ]
2007d78: 81 c7 e0 08 ret
2007d7c: 81 e8 00 00 restore
02007d88 <aio_fsync>:
int aio_fsync(
int op,
struct aiocb *aiocbp
)
{
2007d88: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
if (op != O_SYNC)
2007d8c: 03 00 00 08 sethi %hi(0x2000), %g1
2007d90: 80 a6 00 01 cmp %i0, %g1
2007d94: 12 80 00 14 bne 2007de4 <aio_fsync+0x5c>
2007d98: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2007d9c: d0 06 40 00 ld [ %i1 ], %o0
2007da0: 40 00 1b f4 call 200ed70 <fcntl>
2007da4: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
2007da8: 90 0a 20 03 and %o0, 3, %o0
2007dac: 90 02 3f ff add %o0, -1, %o0
2007db0: 80 a2 20 01 cmp %o0, 1
2007db4: 18 80 00 0c bgu 2007de4 <aio_fsync+0x5c>
2007db8: ba 10 20 09 mov 9, %i5
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2007dbc: 7f ff f0 a3 call 2004048 <malloc>
2007dc0: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2007dc4: 80 a2 20 00 cmp %o0, 0
2007dc8: 02 80 00 06 be 2007de0 <aio_fsync+0x58> <== NEVER TAKEN
2007dcc: 82 10 20 03 mov 3, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2007dd0: f2 22 20 14 st %i1, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_SYNC;
2007dd4: c2 26 60 30 st %g1, [ %i1 + 0x30 ]
return rtems_aio_enqueue (req);
2007dd8: 40 00 01 78 call 20083b8 <rtems_aio_enqueue>
2007ddc: 91 e8 00 08 restore %g0, %o0, %o0
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
req = malloc (sizeof (rtems_aio_request));
if (req == NULL)
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
2007de0: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
2007de4: 82 10 3f ff mov -1, %g1
2007de8: fa 26 60 34 st %i5, [ %i1 + 0x34 ]
2007dec: c2 26 60 38 st %g1, [ %i1 + 0x38 ]
2007df0: 40 00 2a 92 call 2012838 <__errno>
2007df4: b0 10 3f ff mov -1, %i0
2007df8: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_SYNC;
return rtems_aio_enqueue (req);
}
2007dfc: 81 c7 e0 08 ret
2007e00: 81 e8 00 00 restore
0200859c <aio_read>:
* 0 - otherwise
*/
int
aio_read (struct aiocb *aiocbp)
{
200859c: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
20085a0: d0 06 00 00 ld [ %i0 ], %o0
20085a4: 92 10 20 03 mov 3, %o1
20085a8: 40 00 19 f2 call 200ed70 <fcntl>
20085ac: ba 10 20 09 mov 9, %i5
if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR)))
20085b0: 80 8a 20 01 btst 1, %o0
20085b4: 12 80 00 0b bne 20085e0 <aio_read+0x44>
20085b8: 82 10 3f ff mov -1, %g1
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX)
20085bc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
20085c0: 80 a0 60 00 cmp %g1, 0
20085c4: 12 80 00 06 bne 20085dc <aio_read+0x40>
20085c8: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
20085cc: c2 06 20 08 ld [ %i0 + 8 ], %g1
20085d0: 80 a0 60 00 cmp %g1, 0
20085d4: 16 80 00 0a bge 20085fc <aio_read+0x60>
20085d8: 01 00 00 00 nop
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
if (req == NULL)
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
20085dc: 82 10 3f ff mov -1, %g1 ! ffffffff <RAM_END+0xfdbfffff>
20085e0: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
20085e4: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
20085e8: 40 00 28 94 call 2012838 <__errno>
20085ec: b0 10 3f ff mov -1, %i0
20085f0: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_READ;
return rtems_aio_enqueue (req);
}
20085f4: 81 c7 e0 08 ret
20085f8: 81 e8 00 00 restore
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
20085fc: 7f ff ee 93 call 2004048 <malloc>
2008600: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2008604: 80 a2 20 00 cmp %o0, 0
2008608: 02 80 00 06 be 2008620 <aio_read+0x84> <== NEVER TAKEN
200860c: 82 10 20 01 mov 1, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2008610: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_READ;
2008614: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
2008618: 7f ff ff 68 call 20083b8 <rtems_aio_enqueue>
200861c: 91 e8 00 08 restore %g0, %o0, %o0
if (aiocbp->aio_offset < 0)
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
if (req == NULL)
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
2008620: 10 bf ff ef b 20085dc <aio_read+0x40> <== NOT EXECUTED
2008624: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
02008630 <aio_write>:
* 0 - otherwise
*/
int
aio_write (struct aiocb *aiocbp)
{
2008630: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2008634: d0 06 00 00 ld [ %i0 ], %o0
2008638: 40 00 19 ce call 200ed70 <fcntl>
200863c: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
2008640: 90 0a 20 03 and %o0, 3, %o0
2008644: 90 02 3f ff add %o0, -1, %o0
2008648: 80 a2 20 01 cmp %o0, 1
200864c: 18 80 00 0a bgu 2008674 <aio_write+0x44>
2008650: ba 10 20 09 mov 9, %i5
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX)
2008654: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2008658: 80 a0 60 00 cmp %g1, 0
200865c: 12 80 00 06 bne 2008674 <aio_write+0x44>
2008660: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
2008664: c2 06 20 08 ld [ %i0 + 8 ], %g1
2008668: 80 a0 60 00 cmp %g1, 0
200866c: 16 80 00 0a bge 2008694 <aio_write+0x64>
2008670: 01 00 00 00 nop
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
if (req == NULL)
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
2008674: 82 10 3f ff mov -1, %g1 ! ffffffff <RAM_END+0xfdbfffff>
2008678: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
200867c: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
2008680: 40 00 28 6e call 2012838 <__errno>
2008684: b0 10 3f ff mov -1, %i0
2008688: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_WRITE;
return rtems_aio_enqueue (req);
}
200868c: 81 c7 e0 08 ret
2008690: 81 e8 00 00 restore
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2008694: 7f ff ee 6d call 2004048 <malloc>
2008698: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
200869c: 80 a2 20 00 cmp %o0, 0
20086a0: 02 80 00 06 be 20086b8 <aio_write+0x88> <== NEVER TAKEN
20086a4: 82 10 20 02 mov 2, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
20086a8: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_WRITE;
20086ac: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
20086b0: 7f ff ff 42 call 20083b8 <rtems_aio_enqueue>
20086b4: 91 e8 00 08 restore %g0, %o0, %o0
if (aiocbp->aio_offset < 0)
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
if (req == NULL)
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
20086b8: 10 bf ff ef b 2008674 <aio_write+0x44> <== NOT EXECUTED
20086bc: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
02008c38 <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)) {
2008c38: 80 a2 ff f8 cmp %o3, -8
2008c3c: 02 80 00 23 be 2008cc8 <check_and_merge+0x90>
2008c40: 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);
2008c44: c2 02 c0 00 ld [ %o3 ], %g1
2008c48: 80 a0 60 00 cmp %g1, 0
2008c4c: 22 80 00 1c be,a 2008cbc <check_and_merge+0x84>
2008c50: c4 02 e0 04 ld [ %o3 + 4 ], %g2
if (b->begin < a->begin) {
2008c54: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3
2008c58: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2
2008c5c: 80 a0 c0 02 cmp %g3, %g2
2008c60: 3a 80 00 07 bcc,a 2008c7c <check_and_merge+0x44>
2008c64: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
2008c68: 84 10 00 0a mov %o2, %g2
2008c6c: c2 02 80 00 ld [ %o2 ], %g1
2008c70: 94 10 00 0b mov %o3, %o2
2008c74: 96 10 00 02 mov %g2, %o3
a = b;
b = t;
}
a->size += b->size;
2008c78: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4
2008c7c: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
2008c80: c4 02 e0 04 ld [ %o3 + 4 ], %g2
2008c84: 86 01 00 03 add %g4, %g3, %g3
2008c88: c6 22 a0 1c st %g3, [ %o2 + 0x1c ]
next->previous = previous;
previous->next = next;
2008c8c: c2 20 80 00 st %g1, [ %g2 ]
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
next->previous = previous;
2008c90: c4 20 60 04 st %g2, [ %g1 + 4 ]
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2008c94: c2 02 00 00 ld [ %o0 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2008c98: d0 22 e0 04 st %o0, [ %o3 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
2008c9c: d6 22 00 00 st %o3, [ %o0 ]
the_node->next = before_node;
2008ca0: 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);
2008ca4: 90 10 00 09 mov %o1, %o0
before_node->previous = the_node;
2008ca8: d6 20 60 04 st %o3, [ %g1 + 4 ]
2008cac: 92 02 e0 08 add %o3, 8, %o1
2008cb0: 82 13 c0 00 mov %o7, %g1
2008cb4: 40 00 07 32 call 200a97c <_RBTree_Extract_unprotected>
2008cb8: 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);
2008cbc: 80 a0 a0 00 cmp %g2, 0
2008cc0: 32 bf ff e6 bne,a 2008c58 <check_and_merge+0x20> <== NEVER TAKEN
2008cc4: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED
2008cc8: 81 c3 e0 08 retl
020077f0 <clock_gettime>:
int clock_gettime(
clockid_t clock_id,
struct timespec *tp
)
{
20077f0: 9d e3 bf 98 save %sp, -104, %sp
if ( !tp )
20077f4: 80 a6 60 00 cmp %i1, 0
20077f8: 02 80 00 0a be 2007820 <clock_gettime+0x30>
20077fc: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
2007800: 02 80 00 19 be 2007864 <clock_gettime+0x74>
2007804: 80 a6 20 04 cmp %i0, 4
_TOD_Get(tp);
return 0;
}
#ifdef CLOCK_MONOTONIC
if ( clock_id == CLOCK_MONOTONIC ) {
2007808: 02 80 00 12 be 2007850 <clock_gettime+0x60> <== NEVER TAKEN
200780c: 80 a6 20 02 cmp %i0, 2
return 0;
}
#endif
#ifdef _POSIX_CPUTIME
if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) {
2007810: 02 80 00 10 be 2007850 <clock_gettime+0x60>
2007814: 80 a6 20 03 cmp %i0, 3
return 0;
}
#endif
#ifdef _POSIX_THREAD_CPUTIME
if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
2007818: 02 80 00 08 be 2007838 <clock_gettime+0x48>
200781c: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
2007820: 40 00 27 76 call 20115f8 <__errno>
2007824: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
2007828: 82 10 20 16 mov 0x16, %g1
200782c: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
2007830: 81 c7 e0 08 ret
2007834: 81 e8 00 00 restore
}
#endif
#ifdef _POSIX_THREAD_CPUTIME
if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
rtems_set_errno_and_return_minus_one( ENOSYS );
2007838: 40 00 27 70 call 20115f8 <__errno>
200783c: b0 10 3f ff mov -1, %i0
2007840: 82 10 20 58 mov 0x58, %g1
2007844: c2 22 00 00 st %g1, [ %o0 ]
2007848: 81 c7 e0 08 ret
200784c: 81 e8 00 00 restore
_TOD_Get(tp);
return 0;
}
#ifdef CLOCK_MONOTONIC
if ( clock_id == CLOCK_MONOTONIC ) {
_TOD_Get_uptime_as_timespec( tp );
2007850: 90 10 00 19 mov %i1, %o0
2007854: 40 00 08 b6 call 2009b2c <_TOD_Get_uptime_as_timespec>
2007858: b0 10 20 00 clr %i0
return 0;
200785c: 81 c7 e0 08 ret
2007860: 81 e8 00 00 restore
)
{
Timestamp_Control tod_as_timestamp;
Timestamp_Control *tod_as_timestamp_ptr;
tod_as_timestamp_ptr =
2007864: 90 07 bf f8 add %fp, -8, %o0
2007868: 13 00 80 86 sethi %hi(0x2021800), %o1
200786c: 40 00 08 9f call 2009ae8 <_TOD_Get_with_nanoseconds>
2007870: 92 12 60 d8 or %o1, 0xd8, %o1 ! 20218d8 <_TOD>
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
return 0;
}
2007874: f8 1a 00 00 ldd [ %o0 ], %i4
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
2007878: 94 10 20 00 clr %o2
200787c: 90 10 00 1c mov %i4, %o0
2007880: 92 10 00 1d mov %i5, %o1
2007884: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2007888: 40 00 55 69 call 201ce2c <__divdi3>
200788c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
2007890: 94 10 20 00 clr %o2
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
2007894: d2 26 40 00 st %o1, [ %i1 ]
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
2007898: 90 10 00 1c mov %i4, %o0
200789c: 92 10 00 1d mov %i5, %o1
20078a0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
_TOD_Get(tp);
return 0;
20078a4: b0 10 20 00 clr %i0
20078a8: 40 00 56 4c call 201d1d8 <__moddi3>
20078ac: 96 12 e2 00 or %o3, 0x200, %o3
20078b0: d2 26 60 04 st %o1, [ %i1 + 4 ]
20078b4: 81 c7 e0 08 ret
20078b8: 81 e8 00 00 restore
02029350 <clock_settime>:
int clock_settime(
clockid_t clock_id,
const struct timespec *tp
)
{
2029350: 9d e3 bf 98 save %sp, -104, %sp
if ( !tp )
2029354: 80 a6 60 00 cmp %i1, 0
2029358: 02 80 00 08 be 2029378 <clock_settime+0x28> <== NEVER TAKEN
202935c: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
2029360: 02 80 00 0c be 2029390 <clock_settime+0x40>
2029364: 80 a6 20 02 cmp %i0, 2
_Thread_Disable_dispatch();
_TOD_Set( tp );
_Thread_Enable_dispatch();
}
#ifdef _POSIX_CPUTIME
else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID )
2029368: 02 80 00 49 be 202948c <clock_settime+0x13c>
202936c: 80 a6 20 03 cmp %i0, 3
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
#ifdef _POSIX_THREAD_CPUTIME
else if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
2029370: 02 80 00 47 be 202948c <clock_settime+0x13c>
2029374: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
else
rtems_set_errno_and_return_minus_one( EINVAL );
2029378: 40 00 4a bc call 203be68 <__errno>
202937c: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
2029380: 82 10 20 16 mov 0x16, %g1
2029384: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
2029388: 81 c7 e0 08 ret
202938c: 81 e8 00 00 restore
{
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 )
2029390: c4 06 40 00 ld [ %i1 ], %g2
2029394: 03 08 76 b9 sethi %hi(0x21dae400), %g1
2029398: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff <RAM_END+0x1f9ae4ff>
202939c: 80 a0 80 01 cmp %g2, %g1
20293a0: 08 bf ff f6 bleu 2029378 <clock_settime+0x28>
20293a4: 03 00 81 9c sethi %hi(0x2067000), %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;
20293a8: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2067360 <_Thread_Dispatch_disable_level>
++level;
20293ac: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
20293b0: c4 20 63 60 st %g2, [ %g1 + 0x360 ]
const struct timespec *tod_as_timespec
)
{
Timestamp_Control tod_as_timestamp;
_Timestamp_Set(
20293b4: c6 06 40 00 ld [ %i1 ], %g3
20293b8: e2 06 60 04 ld [ %i1 + 4 ], %l1
20293bc: 85 38 e0 1f sra %g3, 0x1f, %g2
Timestamp64_Control *_time,
Timestamp64_Control _seconds,
Timestamp64_Control _nanoseconds
)
{
*_time = _seconds * 1000000000L + _nanoseconds;
20293c0: 83 28 a0 03 sll %g2, 3, %g1
20293c4: bb 28 e0 03 sll %g3, 3, %i5
20293c8: 89 30 e0 1d srl %g3, 0x1d, %g4
20293cc: b8 11 00 01 or %g4, %g1, %i4
20293d0: 83 37 60 1b srl %i5, 0x1b, %g1
20293d4: a5 2f 20 05 sll %i4, 5, %l2
20293d8: a7 2f 60 05 sll %i5, 5, %l3
20293dc: a4 10 40 12 or %g1, %l2, %l2
20293e0: ba a4 c0 1d subcc %l3, %i5, %i5
20293e4: 83 37 60 1a srl %i5, 0x1a, %g1
20293e8: b8 64 80 1c subx %l2, %i4, %i4
20293ec: 97 2f 60 06 sll %i5, 6, %o3
20293f0: 95 2f 20 06 sll %i4, 6, %o2
20293f4: ba a2 c0 1d subcc %o3, %i5, %i5
20293f8: 94 10 40 0a or %g1, %o2, %o2
20293fc: b8 62 80 1c subx %o2, %i4, %i4
2029400: aa 87 40 03 addcc %i5, %g3, %l5
2029404: 83 35 60 1e srl %l5, 0x1e, %g1
2029408: a8 47 00 02 addx %i4, %g2, %l4
202940c: 9b 2d 60 02 sll %l5, 2, %o5
2029410: 99 2d 20 02 sll %l4, 2, %o4
2029414: 86 85 40 0d addcc %l5, %o5, %g3
2029418: 98 10 40 0c or %g1, %o4, %o4
202941c: b3 28 e0 02 sll %g3, 2, %i1
2029420: 84 45 00 0c addx %l4, %o4, %g2
2029424: 83 30 e0 1e srl %g3, 0x1e, %g1
2029428: ba 80 c0 19 addcc %g3, %i1, %i5
202942c: b1 28 a0 02 sll %g2, 2, %i0
2029430: b7 2f 60 02 sll %i5, 2, %i3
2029434: b0 10 40 18 or %g1, %i0, %i0
2029438: 83 37 60 1e srl %i5, 0x1e, %g1
202943c: b8 40 80 18 addx %g2, %i0, %i4
2029440: 86 87 40 1b addcc %i5, %i3, %g3
2029444: b5 2f 20 02 sll %i4, 2, %i2
2029448: bb 30 e0 17 srl %g3, 0x17, %i5
202944c: b4 10 40 1a or %g1, %i2, %i2
2029450: 84 47 00 1a addx %i4, %i2, %g2
2029454: 83 28 e0 09 sll %g3, 9, %g1
2029458: 89 28 a0 09 sll %g2, 9, %g4
&tod_as_timestamp,
tod_as_timespec->tv_sec,
tod_as_timespec->tv_nsec
);
_TOD_Set_with_timestamp( &tod_as_timestamp );
202945c: 90 07 bf f8 add %fp, -8, %o0
2029460: 84 17 40 04 or %i5, %g4, %g2
2029464: ba 84 40 01 addcc %l1, %g1, %i5
const struct timespec *tod_as_timespec
)
{
Timestamp_Control tod_as_timestamp;
_Timestamp_Set(
2029468: a1 3c 60 1f sra %l1, 0x1f, %l0
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
else
rtems_set_errno_and_return_minus_one( EINVAL );
return 0;
202946c: b0 10 20 00 clr %i0
2029470: b8 44 00 02 addx %l0, %g2, %i4
&tod_as_timestamp,
tod_as_timespec->tv_sec,
tod_as_timespec->tv_nsec
);
_TOD_Set_with_timestamp( &tod_as_timestamp );
2029474: 40 00 04 80 call 202a674 <_TOD_Set_with_timestamp>
2029478: f8 3f bf f8 std %i4, [ %fp + -8 ]
if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 )
rtems_set_errno_and_return_minus_one( EINVAL );
_Thread_Disable_dispatch();
_TOD_Set( tp );
_Thread_Enable_dispatch();
202947c: 7f ff 83 ee call 200a434 <_Thread_Enable_dispatch>
2029480: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
else
rtems_set_errno_and_return_minus_one( EINVAL );
return 0;
2029484: 81 c7 e0 08 ret
2029488: 81 e8 00 00 restore
else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID )
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
#ifdef _POSIX_THREAD_CPUTIME
else if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
rtems_set_errno_and_return_minus_one( ENOSYS );
202948c: 40 00 4a 77 call 203be68 <__errno>
2029490: b0 10 3f ff mov -1, %i0
2029494: 82 10 20 58 mov 0x58, %g1
2029498: c2 22 00 00 st %g1, [ %o0 ]
202949c: 81 c7 e0 08 ret
20294a0: 81 e8 00 00 restore
0201ac94 <killinfo>:
int killinfo(
pid_t pid,
int sig,
const union sigval *value
)
{
201ac94: 9d e3 bf 90 save %sp, -112, %sp
POSIX_signals_Siginfo_node *psiginfo;
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid != getpid() )
201ac98: 7f ff ff 63 call 201aa24 <getpid>
201ac9c: 01 00 00 00 nop
201aca0: 80 a2 00 18 cmp %o0, %i0
201aca4: 12 80 00 af bne 201af60 <killinfo+0x2cc>
201aca8: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
/*
* Validate the signal passed.
*/
if ( !sig )
201acac: 02 80 00 b3 be 201af78 <killinfo+0x2e4>
201acb0: 82 06 7f ff add %i1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201acb4: 80 a0 60 1f cmp %g1, 0x1f
201acb8: 18 80 00 b0 bgu 201af78 <killinfo+0x2e4>
201acbc: a1 2e 60 02 sll %i1, 2, %l0
rtems_set_errno_and_return_minus_one( EINVAL );
/*
* If the signal is being ignored, then we are out of here.
*/
if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN )
201acc0: 31 00 80 7a sethi %hi(0x201e800), %i0
201acc4: a3 2e 60 04 sll %i1, 4, %l1
201acc8: b0 16 20 a0 or %i0, 0xa0, %i0
201accc: 84 24 40 10 sub %l1, %l0, %g2
201acd0: 84 06 00 02 add %i0, %g2, %g2
201acd4: c4 00 a0 08 ld [ %g2 + 8 ], %g2
201acd8: 80 a0 a0 01 cmp %g2, 1
201acdc: 02 80 00 9f be 201af58 <killinfo+0x2c4>
201ace0: 80 a6 60 04 cmp %i1, 4
/*
* P1003.1c/Draft 10, p. 33 says that certain signals should always
* be directed to the executing thread such as those caused by hardware
* faults.
*/
if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) )
201ace4: 02 80 00 41 be 201ade8 <killinfo+0x154>
201ace8: 80 a6 60 08 cmp %i1, 8
201acec: 02 80 00 3f be 201ade8 <killinfo+0x154>
201acf0: 80 a6 60 0b cmp %i1, 0xb
201acf4: 02 80 00 3d be 201ade8 <killinfo+0x154>
201acf8: ba 10 20 01 mov 1, %i5
/*
* Build up a siginfo structure
*/
siginfo = &siginfo_struct;
siginfo->si_signo = sig;
201acfc: f2 27 bf f4 st %i1, [ %fp + -12 ]
siginfo->si_code = SI_USER;
201ad00: fa 27 bf f8 st %i5, [ %fp + -8 ]
if ( !value ) {
201ad04: 80 a6 a0 00 cmp %i2, 0
201ad08: 02 80 00 3e be 201ae00 <killinfo+0x16c>
201ad0c: bb 2f 40 01 sll %i5, %g1, %i5
siginfo->si_value.sival_int = 0;
} else {
siginfo->si_value = *value;
201ad10: c2 06 80 00 ld [ %i2 ], %g1
201ad14: c2 27 bf fc st %g1, [ %fp + -4 ]
*
* 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;
201ad18: 03 00 80 78 sethi %hi(0x201e000), %g1
201ad1c: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201e320 <_Thread_Dispatch_disable_level>
++level;
201ad20: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
201ad24: c4 20 63 20 st %g2, [ %g1 + 0x320 ]
*/
void _POSIX_signals_Manager_Initialization(void);
static inline void _POSIX_signals_Add_post_switch_extension(void)
{
_API_extensions_Add_post_switch( &_POSIX_signals_Post_switch );
201ad28: 11 00 80 76 sethi %hi(0x201d800), %o0
201ad2c: 7f ff b6 08 call 200854c <_API_extensions_Add_post_switch>
201ad30: 90 12 20 f4 or %o0, 0xf4, %o0 ! 201d8f4 <_POSIX_signals_Post_switch>
/*
* Is the currently executing thread interested? If so then it will
* get it an execute it as soon as the dispatcher executes.
*/
the_thread = _Thread_Executing;
201ad34: 03 00 80 7a sethi %hi(0x201e800), %g1
201ad38: d0 00 60 50 ld [ %g1 + 0x50 ], %o0 ! 201e850 <_Per_CPU_Information+0x10>
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( _POSIX_signals_Is_interested( api, mask ) ) {
201ad3c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
201ad40: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1
201ad44: 80 af 40 01 andncc %i5, %g1, %g0
201ad48: 12 80 00 17 bne 201ada4 <killinfo+0x110>
201ad4c: 09 00 80 7a sethi %hi(0x201e800), %g4
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
201ad50: c2 01 22 2c ld [ %g4 + 0x22c ], %g1 ! 201ea2c <_POSIX_signals_Wait_queue>
201ad54: 88 11 22 2c or %g4, 0x22c, %g4
/* XXX violation of visibility -- need to define thread queue support */
the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo;
for ( the_node = _Chain_First( the_chain );
201ad58: 88 01 20 04 add %g4, 4, %g4
201ad5c: 80 a0 40 04 cmp %g1, %g4
201ad60: 32 80 00 0d bne,a 201ad94 <killinfo+0x100>
201ad64: c4 00 60 30 ld [ %g1 + 0x30 ], %g2
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201ad68: 10 80 00 28 b 201ae08 <killinfo+0x174>
201ad6c: 03 00 80 75 sethi %hi(0x201d400), %g1
/*
* Is this thread is blocked waiting for another signal but has
* not blocked this one?
*/
if (~api->signals_blocked & mask)
201ad70: c4 00 e0 d0 ld [ %g3 + 0xd0 ], %g2
201ad74: 80 af 40 02 andncc %i5, %g2, %g0
201ad78: 12 80 00 0b bne 201ada4 <killinfo+0x110>
201ad7c: 90 10 00 01 mov %g1, %o0
the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo;
for ( the_node = _Chain_First( the_chain );
!_Chain_Is_tail( the_chain, the_node ) ;
the_node = the_node->next ) {
201ad80: c2 00 40 00 ld [ %g1 ], %g1
/* XXX violation of visibility -- need to define thread queue support */
the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo;
for ( the_node = _Chain_First( the_chain );
201ad84: 80 a0 40 04 cmp %g1, %g4
201ad88: 22 80 00 20 be,a 201ae08 <killinfo+0x174> <== ALWAYS TAKEN
201ad8c: 03 00 80 75 sethi %hi(0x201d400), %g1
#endif
/*
* Is this thread is actually blocked waiting for the signal?
*/
if (the_thread->Wait.option & mask)
201ad90: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 ! 201d430 <__mprec_tens><== NOT EXECUTED
201ad94: 80 8f 40 02 btst %i5, %g2
201ad98: 02 bf ff f6 be 201ad70 <killinfo+0xdc>
201ad9c: c6 00 61 5c ld [ %g1 + 0x15c ], %g3
the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo;
for ( the_node = _Chain_First( the_chain );
!_Chain_Is_tail( the_chain, the_node ) ;
the_node = the_node->next ) {
201ada0: 90 10 00 01 mov %g1, %o0
/*
* Returns true if the signal was synchronously given to a thread
* blocked waiting for the signal.
*/
if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) {
201ada4: 92 10 00 19 mov %i1, %o1
201ada8: 40 00 00 8b call 201afd4 <_POSIX_signals_Unblock_thread>
201adac: 94 07 bf f4 add %fp, -12, %o2
201adb0: 80 8a 20 ff btst 0xff, %o0
201adb4: 12 80 00 09 bne 201add8 <killinfo+0x144>
201adb8: 01 00 00 00 nop
/*
* We may have woken up a thread but we definitely need to post the
* signal to the process wide information set.
*/
_POSIX_signals_Set_process_signals( mask );
201adbc: 40 00 00 7d call 201afb0 <_POSIX_signals_Set_process_signals>
201adc0: 90 10 00 1d mov %i5, %o0
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
201adc4: a0 24 40 10 sub %l1, %l0, %l0
201adc8: c2 06 00 10 ld [ %i0 + %l0 ], %g1
201adcc: 80 a0 60 02 cmp %g1, 2
201add0: 02 80 00 4f be 201af0c <killinfo+0x278>
201add4: 11 00 80 7a sethi %hi(0x201e800), %o0
/*
* Returns true if the signal was synchronously given to a thread
* blocked waiting for the signal.
*/
if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) {
_Thread_Enable_dispatch();
201add8: 7f ff be 68 call 200a778 <_Thread_Enable_dispatch>
201addc: b0 10 20 00 clr %i0
201ade0: 81 c7 e0 08 ret
201ade4: 81 e8 00 00 restore
* P1003.1c/Draft 10, p. 33 says that certain signals should always
* be directed to the executing thread such as those caused by hardware
* faults.
*/
if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) )
return pthread_kill( pthread_self(), sig );
201ade8: 40 00 01 13 call 201b234 <pthread_self>
201adec: 01 00 00 00 nop
201adf0: 40 00 00 d2 call 201b138 <pthread_kill>
201adf4: 92 10 00 19 mov %i1, %o1
201adf8: 81 c7 e0 08 ret
201adfc: 91 e8 00 08 restore %g0, %o0, %o0
*/
siginfo = &siginfo_struct;
siginfo->si_signo = sig;
siginfo->si_code = SI_USER;
if ( !value ) {
siginfo->si_value.sival_int = 0;
201ae00: 10 bf ff c6 b 201ad18 <killinfo+0x84>
201ae04: c0 27 bf fc clr [ %fp + -4 ]
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201ae08: f8 08 62 7c ldub [ %g1 + 0x27c ], %i4
201ae0c: 1b 00 80 78 sethi %hi(0x201e000), %o5
201ae10: b8 07 20 01 inc %i4
201ae14: 9a 13 62 8c or %o5, 0x28c, %o5
*
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
201ae18: 90 10 20 00 clr %o0
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201ae1c: 98 03 60 08 add %o5, 8, %o4
*/
RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal (
States_Control the_states
)
{
return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL);
201ae20: 17 04 00 00 sethi %hi(0x10000000), %o3
for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) {
/*
* This can occur when no one is interested and an API is not configured.
*/
if ( !_Objects_Information_table[ the_api ] )
201ae24: c2 03 40 00 ld [ %o5 ], %g1
201ae28: 80 a0 60 00 cmp %g1, 0
201ae2c: 22 80 00 31 be,a 201aef0 <killinfo+0x25c> <== NEVER TAKEN
201ae30: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED
continue;
the_info = _Objects_Information_table[ the_api ][ 1 ];
201ae34: c2 00 60 04 ld [ %g1 + 4 ], %g1
*/
if ( !the_info )
continue;
#endif
maximum = the_info->maximum;
201ae38: f6 10 60 10 lduh [ %g1 + 0x10 ], %i3
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201ae3c: 80 a6 e0 00 cmp %i3, 0
201ae40: 02 80 00 2b be 201aeec <killinfo+0x258>
201ae44: f4 00 60 1c ld [ %g1 + 0x1c ], %i2
201ae48: 84 10 20 01 mov 1, %g2
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201ae4c: 87 28 a0 02 sll %g2, 2, %g3
maximum = the_info->maximum;
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
the_thread = (Thread_Control *) object_table[ index ];
201ae50: c6 06 80 03 ld [ %i2 + %g3 ], %g3
if ( !the_thread )
201ae54: 80 a0 e0 00 cmp %g3, 0
201ae58: 22 80 00 22 be,a 201aee0 <killinfo+0x24c>
201ae5c: 84 00 a0 01 inc %g2
/*
* If this thread is of lower priority than the interested thread,
* go on to the next thread.
*/
if ( the_thread->current_priority > interested_priority )
201ae60: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4
201ae64: 80 a1 00 1c cmp %g4, %i4
201ae68: 38 80 00 1e bgu,a 201aee0 <killinfo+0x24c>
201ae6c: 84 00 a0 01 inc %g2
#if defined(RTEMS_DEBUG)
if ( !api )
continue;
#endif
if ( !_POSIX_signals_Is_interested( api, mask ) )
201ae70: de 00 e1 5c ld [ %g3 + 0x15c ], %o7
201ae74: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7
201ae78: 80 af 40 0f andncc %i5, %o7, %g0
201ae7c: 22 80 00 19 be,a 201aee0 <killinfo+0x24c>
201ae80: 84 00 a0 01 inc %g2
*
* NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1
* so we never have to worry about deferencing a NULL
* interested thread.
*/
if ( the_thread->current_priority < interested_priority ) {
201ae84: 80 a1 00 1c cmp %g4, %i4
201ae88: 2a 80 00 14 bcs,a 201aed8 <killinfo+0x244>
201ae8c: b8 10 00 04 mov %g4, %i4
* and blocking interruptibutable by signal.
*
* If the interested thread is ready, don't think about changing.
*/
if ( interested && !_States_Is_ready( interested->current_state ) ) {
201ae90: 80 a2 20 00 cmp %o0, 0
201ae94: 22 80 00 13 be,a 201aee0 <killinfo+0x24c> <== NEVER TAKEN
201ae98: 84 00 a0 01 inc %g2 <== NOT EXECUTED
201ae9c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
201aea0: 80 a0 60 00 cmp %g1, 0
201aea4: 22 80 00 0f be,a 201aee0 <killinfo+0x24c> <== NEVER TAKEN
201aea8: 84 00 a0 01 inc %g2 <== NOT EXECUTED
/* preferred ready over blocked */
DEBUG_STEP("5");
if ( _States_Is_ready( the_thread->current_state ) ) {
201aeac: de 00 e0 10 ld [ %g3 + 0x10 ], %o7
201aeb0: 80 a3 e0 00 cmp %o7, 0
201aeb4: 22 80 00 09 be,a 201aed8 <killinfo+0x244>
201aeb8: b8 10 00 04 mov %g4, %i4
continue;
}
DEBUG_STEP("6");
/* prefer blocked/interruptible over blocked/not interruptible */
if ( !_States_Is_interruptible_by_signal(interested->current_state) ) {
201aebc: 80 88 40 0b btst %g1, %o3
201aec0: 32 80 00 08 bne,a 201aee0 <killinfo+0x24c>
201aec4: 84 00 a0 01 inc %g2
DEBUG_STEP("7");
if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) {
201aec8: 80 8b c0 0b btst %o7, %o3
201aecc: 22 80 00 05 be,a 201aee0 <killinfo+0x24c>
201aed0: 84 00 a0 01 inc %g2
*/
if ( interested && !_States_Is_ready( interested->current_state ) ) {
/* preferred ready over blocked */
DEBUG_STEP("5");
if ( _States_Is_ready( the_thread->current_state ) ) {
201aed4: b8 10 00 04 mov %g4, %i4
201aed8: 90 10 00 03 mov %g3, %o0
#endif
maximum = the_info->maximum;
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201aedc: 84 00 a0 01 inc %g2
201aee0: 80 a6 c0 02 cmp %i3, %g2
201aee4: 1a bf ff db bcc 201ae50 <killinfo+0x1bc>
201aee8: 87 28 a0 02 sll %g2, 2, %g3
201aeec: 9a 03 60 04 add %o5, 4, %o5
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) {
201aef0: 80 a3 40 0c cmp %o5, %o4
201aef4: 32 bf ff cd bne,a 201ae28 <killinfo+0x194>
201aef8: c2 03 40 00 ld [ %o5 ], %g1
}
}
}
}
if ( interested ) {
201aefc: 80 a2 20 00 cmp %o0, 0
201af00: 12 bf ff aa bne 201ada8 <killinfo+0x114>
201af04: 92 10 00 19 mov %i1, %o1
201af08: 30 bf ff ad b,a 201adbc <killinfo+0x128>
*/
_POSIX_signals_Set_process_signals( mask );
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
psiginfo = (POSIX_signals_Siginfo_node *)
201af0c: 7f ff b5 f5 call 20086e0 <_Chain_Get>
201af10: 90 12 22 20 or %o0, 0x220, %o0
_Chain_Get( &_POSIX_signals_Inactive_siginfo );
if ( !psiginfo ) {
201af14: 92 92 20 00 orcc %o0, 0, %o1
201af18: 02 80 00 1e be 201af90 <killinfo+0x2fc>
201af1c: c2 07 bf f4 ld [ %fp + -12 ], %g1
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201af20: 11 00 80 7a sethi %hi(0x201e800), %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201af24: c2 22 60 08 st %g1, [ %o1 + 8 ]
201af28: c2 07 bf f8 ld [ %fp + -8 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201af2c: 90 12 22 98 or %o0, 0x298, %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201af30: c2 22 60 0c st %g1, [ %o1 + 0xc ]
201af34: c2 07 bf fc ld [ %fp + -4 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201af38: 90 02 00 10 add %o0, %l0, %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201af3c: c2 22 60 10 st %g1, [ %o1 + 0x10 ]
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201af40: 7f ff b5 dd call 20086b4 <_Chain_Append>
201af44: b0 10 20 00 clr %i0
/*
* Returns true if the signal was synchronously given to a thread
* blocked waiting for the signal.
*/
if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) {
_Thread_Enable_dispatch();
201af48: 7f ff be 0c call 200a778 <_Thread_Enable_dispatch>
201af4c: 01 00 00 00 nop
201af50: 81 c7 e0 08 ret
201af54: 81 e8 00 00 restore
}
DEBUG_STEP("\n");
_Thread_Enable_dispatch();
return 0;
}
201af58: 81 c7 e0 08 ret
201af5c: 91 e8 20 00 restore %g0, 0, %o0
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid != getpid() )
rtems_set_errno_and_return_minus_one( ESRCH );
201af60: 7f ff d5 1e call 20103d8 <__errno>
201af64: b0 10 3f ff mov -1, %i0
201af68: 82 10 20 03 mov 3, %g1
201af6c: c2 22 00 00 st %g1, [ %o0 ]
201af70: 81 c7 e0 08 ret
201af74: 81 e8 00 00 restore
*/
if ( !sig )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
rtems_set_errno_and_return_minus_one( EINVAL );
201af78: 7f ff d5 18 call 20103d8 <__errno>
201af7c: b0 10 3f ff mov -1, %i0
201af80: 82 10 20 16 mov 0x16, %g1
201af84: c2 22 00 00 st %g1, [ %o0 ]
201af88: 81 c7 e0 08 ret
201af8c: 81 e8 00 00 restore
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
psiginfo = (POSIX_signals_Siginfo_node *)
_Chain_Get( &_POSIX_signals_Inactive_siginfo );
if ( !psiginfo ) {
_Thread_Enable_dispatch();
201af90: 7f ff bd fa call 200a778 <_Thread_Enable_dispatch>
201af94: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
201af98: 7f ff d5 10 call 20103d8 <__errno>
201af9c: 01 00 00 00 nop
201afa0: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
201afa4: c2 22 00 00 st %g1, [ %o0 ]
201afa8: 81 c7 e0 08 ret
201afac: 81 e8 00 00 restore
02007d4c <mq_open>:
int oflag,
...
/* mode_t mode, */
/* struct mq_attr attr */
)
{
2007d4c: 9d e3 bf 88 save %sp, -120, %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;
2007d50: 03 00 80 8b sethi %hi(0x2022c00), %g1
2007d54: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
2007d58: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
++level;
2007d5c: 84 00 a0 01 inc %g2
2007d60: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
2007d64: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
2007d68: fa 27 a0 58 st %i5, [ %fp + 0x58 ]
_Thread_Dispatch_disable_level = level;
2007d6c: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
Objects_Locations location;
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
2007d70: a2 8e 62 00 andcc %i1, 0x200, %l1
2007d74: 12 80 00 36 bne 2007e4c <mq_open+0x100>
2007d78: a0 10 20 00 clr %l0
*/
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *
_POSIX_Message_queue_Allocate_fd( void )
{
return (POSIX_Message_queue_Control_fd *)
2007d7c: 39 00 80 8c sethi %hi(0x2023000), %i4
2007d80: 40 00 0c 21 call 200ae04 <_Objects_Allocate>
2007d84: 90 17 22 b0 or %i4, 0x2b0, %o0 ! 20232b0 <_POSIX_Message_queue_Information_fds>
attr = va_arg( arg, struct mq_attr * );
va_end(arg);
}
the_mq_fd = _POSIX_Message_queue_Allocate_fd();
if ( !the_mq_fd ) {
2007d88: ba 92 20 00 orcc %o0, 0, %i5
2007d8c: 02 80 00 39 be 2007e70 <mq_open+0x124> <== NEVER TAKEN
2007d90: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( ENFILE );
}
the_mq_fd->oflag = oflag;
2007d94: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
const char *name,
Objects_Id *id,
size_t *len
)
{
return _POSIX_Name_to_id( &_POSIX_Message_queue_Information, name, id, len );
2007d98: 35 00 80 8c sethi %hi(0x2023000), %i2
2007d9c: 92 10 00 18 mov %i0, %o1
2007da0: 90 16 a1 24 or %i2, 0x124, %o0
2007da4: 94 07 bf f0 add %fp, -16, %o2
2007da8: 40 00 01 42 call 20082b0 <_POSIX_Name_to_id>
2007dac: 96 07 bf fc add %fp, -4, %o3
* If the name to id translation worked, then the message queue exists
* and we can just return a pointer to the id. Otherwise we may
* need to check to see if this is a "message queue does not exist"
* or some other miscellaneous error on the name.
*/
if ( status ) {
2007db0: b6 92 20 00 orcc %o0, 0, %i3
2007db4: 22 80 00 0f be,a 2007df0 <mq_open+0xa4>
2007db8: b2 0e 6a 00 and %i1, 0xa00, %i1
/*
* Unless provided a valid name that did not already exist
* and we are willing to create then it is an error.
*/
if ( !( status == ENOENT && (oflag & O_CREAT) ) ) {
2007dbc: 80 a6 e0 02 cmp %i3, 2
2007dc0: 02 80 00 3f be 2007ebc <mq_open+0x170>
2007dc4: 80 a4 60 00 cmp %l1, 0
RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd (
POSIX_Message_queue_Control_fd *the_mq_fd
)
{
_Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object );
2007dc8: 90 17 22 b0 or %i4, 0x2b0, %o0
2007dcc: 40 00 0d 06 call 200b1e4 <_Objects_Free>
2007dd0: 92 10 00 1d mov %i5, %o1
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
2007dd4: 40 00 11 8f call 200c410 <_Thread_Enable_dispatch>
2007dd8: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, mqd_t );
2007ddc: 40 00 29 46 call 20122f4 <__errno>
2007de0: 01 00 00 00 nop
2007de4: f6 22 00 00 st %i3, [ %o0 ]
2007de8: 81 c7 e0 08 ret
2007dec: 81 e8 00 00 restore
} else { /* name -> ID translation succeeded */
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
2007df0: 80 a6 6a 00 cmp %i1, 0xa00
2007df4: 02 80 00 27 be 2007e90 <mq_open+0x144>
2007df8: d2 07 bf f0 ld [ %fp + -16 ], %o1
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (POSIX_Message_queue_Control *)
2007dfc: 94 07 bf f8 add %fp, -8, %o2
2007e00: 40 00 0d 5f call 200b37c <_Objects_Get>
2007e04: 90 16 a1 24 or %i2, 0x124, %o0
/*
* In this case we need to do an ID->pointer conversion to
* check the mode.
*/
the_mq = _POSIX_Message_queue_Get( the_mq_id, &location );
the_mq->open_count += 1;
2007e08: c4 02 20 18 ld [ %o0 + 0x18 ], %g2
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
2007e0c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
2007e10: 84 00 a0 01 inc %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007e14: b8 17 22 b0 or %i4, 0x2b0, %i4
2007e18: c4 22 20 18 st %g2, [ %o0 + 0x18 ]
2007e1c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
/*
* In this case we need to do an ID->pointer conversion to
* check the mode.
*/
the_mq = _POSIX_Message_queue_Get( the_mq_id, &location );
2007e20: d0 27 bf f4 st %o0, [ %fp + -12 ]
the_mq->open_count += 1;
the_mq_fd->Queue = the_mq;
2007e24: d0 27 60 10 st %o0, [ %i5 + 0x10 ]
2007e28: 83 28 60 02 sll %g1, 2, %g1
2007e2c: fa 20 80 01 st %i5, [ %g2 + %g1 ]
_Objects_Open_string(
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
2007e30: 40 00 11 78 call 200c410 <_Thread_Enable_dispatch>
2007e34: c0 27 60 0c clr [ %i5 + 0xc ]
_Thread_Enable_dispatch();
2007e38: 40 00 11 76 call 200c410 <_Thread_Enable_dispatch>
2007e3c: 01 00 00 00 nop
return (mqd_t)the_mq_fd->Object.id;
2007e40: f0 07 60 08 ld [ %i5 + 8 ], %i0
2007e44: 81 c7 e0 08 ret
2007e48: 81 e8 00 00 restore
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
2007e4c: 82 07 a0 4c add %fp, 0x4c, %g1
mode = va_arg( arg, mode_t );
attr = va_arg( arg, struct mq_attr * );
2007e50: e0 07 a0 50 ld [ %fp + 0x50 ], %l0
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
2007e54: c2 27 bf ec st %g1, [ %fp + -20 ]
*/
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *
_POSIX_Message_queue_Allocate_fd( void )
{
return (POSIX_Message_queue_Control_fd *)
2007e58: 39 00 80 8c sethi %hi(0x2023000), %i4
2007e5c: 40 00 0b ea call 200ae04 <_Objects_Allocate>
2007e60: 90 17 22 b0 or %i4, 0x2b0, %o0 ! 20232b0 <_POSIX_Message_queue_Information_fds>
attr = va_arg( arg, struct mq_attr * );
va_end(arg);
}
the_mq_fd = _POSIX_Message_queue_Allocate_fd();
if ( !the_mq_fd ) {
2007e64: ba 92 20 00 orcc %o0, 0, %i5
2007e68: 32 bf ff cc bne,a 2007d98 <mq_open+0x4c>
2007e6c: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_Thread_Enable_dispatch();
2007e70: 40 00 11 68 call 200c410 <_Thread_Enable_dispatch>
2007e74: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( ENFILE );
2007e78: 40 00 29 1f call 20122f4 <__errno>
2007e7c: 01 00 00 00 nop
2007e80: 82 10 20 17 mov 0x17, %g1 ! 17 <PROM_START+0x17>
2007e84: c2 22 00 00 st %g1, [ %o0 ]
2007e88: 81 c7 e0 08 ret
2007e8c: 81 e8 00 00 restore
RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd (
POSIX_Message_queue_Control_fd *the_mq_fd
)
{
_Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object );
2007e90: 90 17 22 b0 or %i4, 0x2b0, %o0
2007e94: 40 00 0c d4 call 200b1e4 <_Objects_Free>
2007e98: 92 10 00 1d mov %i5, %o1
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
2007e9c: 40 00 11 5d call 200c410 <_Thread_Enable_dispatch>
2007ea0: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t );
2007ea4: 40 00 29 14 call 20122f4 <__errno>
2007ea8: 01 00 00 00 nop
2007eac: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
2007eb0: c2 22 00 00 st %g1, [ %o0 ]
2007eb4: 81 c7 e0 08 ret
2007eb8: 81 e8 00 00 restore
if ( status ) {
/*
* Unless provided a valid name that did not already exist
* and we are willing to create then it is an error.
*/
if ( !( status == ENOENT && (oflag & O_CREAT) ) ) {
2007ebc: 02 bf ff c4 be 2007dcc <mq_open+0x80>
2007ec0: 90 17 22 b0 or %i4, 0x2b0, %o0
/*
* At this point, the message queue does not exist and everything has been
* checked. We should go ahead and create a message queue.
*/
status = _POSIX_Message_queue_Create_support(
2007ec4: d2 07 bf fc ld [ %fp + -4 ], %o1
2007ec8: 90 10 00 18 mov %i0, %o0
2007ecc: 94 10 20 01 mov 1, %o2
2007ed0: 96 10 00 10 mov %l0, %o3
2007ed4: 40 00 1c 37 call 200efb0 <_POSIX_Message_queue_Create_support>
2007ed8: 98 07 bf f4 add %fp, -12, %o4
);
/*
* errno was set by Create_support, so don't set it again.
*/
if ( status == -1 ) {
2007edc: 80 a2 3f ff cmp %o0, -1
2007ee0: 02 80 00 0d be 2007f14 <mq_open+0x1c8>
2007ee4: c6 07 bf f4 ld [ %fp + -12 ], %g3
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
2007ee8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007eec: b8 17 22 b0 or %i4, 0x2b0, %i4
2007ef0: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
return (mqd_t) -1;
}
the_mq_fd->Queue = the_mq;
2007ef4: c6 27 60 10 st %g3, [ %i5 + 0x10 ]
2007ef8: 83 28 60 02 sll %g1, 2, %g1
2007efc: fa 20 80 01 st %i5, [ %g2 + %g1 ]
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
2007f00: 40 00 11 44 call 200c410 <_Thread_Enable_dispatch>
2007f04: c0 27 60 0c clr [ %i5 + 0xc ]
return (mqd_t) the_mq_fd->Object.id;
2007f08: f0 07 60 08 ld [ %i5 + 8 ], %i0
}
2007f0c: 81 c7 e0 08 ret
2007f10: 81 e8 00 00 restore
2007f14: 90 17 22 b0 or %i4, 0x2b0, %o0
2007f18: 92 10 00 1d mov %i5, %o1
2007f1c: 40 00 0c b2 call 200b1e4 <_Objects_Free>
2007f20: b0 10 3f ff mov -1, %i0
/*
* errno was set by Create_support, so don't set it again.
*/
if ( status == -1 ) {
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
2007f24: 40 00 11 3b call 200c410 <_Thread_Enable_dispatch>
2007f28: 01 00 00 00 nop
2007f2c: 81 c7 e0 08 ret
2007f30: 81 e8 00 00 restore
0200c614 <pthread_attr_setschedpolicy>:
int pthread_attr_setschedpolicy(
pthread_attr_t *attr,
int policy
)
{
200c614: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
200c618: 80 a0 60 00 cmp %g1, 0
200c61c: 02 80 00 06 be 200c634 <pthread_attr_setschedpolicy+0x20>
200c620: 90 10 20 16 mov 0x16, %o0
200c624: c4 00 40 00 ld [ %g1 ], %g2
200c628: 80 a0 a0 00 cmp %g2, 0
200c62c: 12 80 00 04 bne 200c63c <pthread_attr_setschedpolicy+0x28>
200c630: 80 a2 60 04 cmp %o1, 4
return 0;
default:
return ENOTSUP;
}
}
200c634: 81 c3 e0 08 retl
200c638: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( policy ) {
200c63c: 18 80 00 09 bgu 200c660 <pthread_attr_setschedpolicy+0x4c>
200c640: 84 10 20 01 mov 1, %g2 ! 1 <PROM_START+0x1>
200c644: 85 28 80 09 sll %g2, %o1, %g2
200c648: 80 88 a0 17 btst 0x17, %g2
200c64c: 02 80 00 05 be 200c660 <pthread_attr_setschedpolicy+0x4c> <== NEVER TAKEN
200c650: 01 00 00 00 nop
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
case SCHED_SPORADIC:
attr->schedpolicy = policy;
200c654: d2 20 60 14 st %o1, [ %g1 + 0x14 ]
return 0;
200c658: 81 c3 e0 08 retl
200c65c: 90 10 20 00 clr %o0
default:
return ENOTSUP;
}
}
200c660: 81 c3 e0 08 retl
200c664: 90 10 20 86 mov 0x86, %o0
02007d98 <pthread_barrier_init>:
int pthread_barrier_init(
pthread_barrier_t *barrier,
const pthread_barrierattr_t *attr,
unsigned int count
)
{
2007d98: 9d e3 bf 90 save %sp, -112, %sp
const pthread_barrierattr_t *the_attr;
/*
* Error check parameters
*/
if ( !barrier )
2007d9c: 80 a6 20 00 cmp %i0, 0
2007da0: 02 80 00 04 be 2007db0 <pthread_barrier_init+0x18>
2007da4: 80 a6 a0 00 cmp %i2, 0
return EINVAL;
if ( count == 0 )
2007da8: 12 80 00 04 bne 2007db8 <pthread_barrier_init+0x20>
2007dac: 80 a6 60 00 cmp %i1, 0
* Exit the critical section and return the user an operational barrier
*/
*barrier = the_barrier->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2007db0: 81 c7 e0 08 ret
2007db4: 91 e8 20 16 restore %g0, 0x16, %o0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
2007db8: 02 80 00 23 be 2007e44 <pthread_barrier_init+0xac>
2007dbc: 90 07 bf f8 add %fp, -8, %o0
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
2007dc0: c2 06 40 00 ld [ %i1 ], %g1
2007dc4: 80 a0 60 00 cmp %g1, 0
2007dc8: 02 bf ff fa be 2007db0 <pthread_barrier_init+0x18>
2007dcc: 01 00 00 00 nop
return EINVAL;
switch ( the_attr->process_shared ) {
2007dd0: c2 06 60 04 ld [ %i1 + 4 ], %g1
2007dd4: 80 a0 60 00 cmp %g1, 0
2007dd8: 12 bf ff f6 bne 2007db0 <pthread_barrier_init+0x18> <== NEVER TAKEN
2007ddc: 03 00 80 7e sethi %hi(0x201f800), %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;
2007de0: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 201f970 <_Thread_Dispatch_disable_level>
}
/*
* Convert from POSIX attributes to Core Barrier attributes
*/
the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE;
2007de4: c0 27 bf f0 clr [ %fp + -16 ]
++level;
2007de8: 84 00 a0 01 inc %g2
the_attributes.maximum_count = count;
2007dec: f4 27 bf f4 st %i2, [ %fp + -12 ]
_Thread_Dispatch_disable_level = level;
2007df0: c4 20 61 70 st %g2, [ %g1 + 0x170 ]
* This function allocates a barrier control block from
* the inactive chain of free barrier control blocks.
*/
RTEMS_INLINE_ROUTINE POSIX_Barrier_Control *_POSIX_Barrier_Allocate( void )
{
return (POSIX_Barrier_Control *)
2007df4: 39 00 80 7f sethi %hi(0x201fc00), %i4
2007df8: 40 00 09 00 call 200a1f8 <_Objects_Allocate>
2007dfc: 90 17 21 04 or %i4, 0x104, %o0 ! 201fd04 <_POSIX_Barrier_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
2007e00: ba 92 20 00 orcc %o0, 0, %i5
2007e04: 02 80 00 14 be 2007e54 <pthread_barrier_init+0xbc>
2007e08: 90 07 60 10 add %i5, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes );
2007e0c: 40 00 06 49 call 2009730 <_CORE_barrier_Initialize>
2007e10: 92 07 bf f0 add %fp, -16, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007e14: c4 17 60 0a lduh [ %i5 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007e18: b8 17 21 04 or %i4, 0x104, %i4
2007e1c: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007e20: c2 07 60 08 ld [ %i5 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007e24: 85 28 a0 02 sll %g2, 2, %g2
2007e28: fa 20 c0 02 st %i5, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
2007e2c: c0 27 60 0c clr [ %i5 + 0xc ]
);
/*
* Exit the critical section and return the user an operational barrier
*/
*barrier = the_barrier->Object.id;
2007e30: c2 26 00 00 st %g1, [ %i0 ]
_Thread_Enable_dispatch();
2007e34: 40 00 0e 3d call 200b728 <_Thread_Enable_dispatch>
2007e38: b0 10 20 00 clr %i0
2007e3c: 81 c7 e0 08 ret
2007e40: 81 e8 00 00 restore
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
the_attr = attr;
} else {
(void) pthread_barrierattr_init( &my_attr );
2007e44: 7f ff ff 9c call 2007cb4 <pthread_barrierattr_init>
2007e48: b2 07 bf f8 add %fp, -8, %i1
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
2007e4c: 10 bf ff de b 2007dc4 <pthread_barrier_init+0x2c>
2007e50: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
_Thread_Enable_dispatch();
2007e54: 40 00 0e 35 call 200b728 <_Thread_Enable_dispatch>
2007e58: b0 10 20 0b mov 0xb, %i0
2007e5c: 81 c7 e0 08 ret
2007e60: 81 e8 00 00 restore
0200762c <pthread_cleanup_push>:
void pthread_cleanup_push(
void (*routine)( void * ),
void *arg
)
{
200762c: 9d e3 bf a0 save %sp, -96, %sp
/*
* The POSIX standard does not address what to do when the routine
* is NULL. It also does not address what happens when we cannot
* allocate memory or anything else bad happens.
*/
if ( !routine )
2007630: 80 a6 20 00 cmp %i0, 0
2007634: 02 80 00 13 be 2007680 <pthread_cleanup_push+0x54>
2007638: 03 00 80 7c sethi %hi(0x201f000), %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;
200763c: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 201f170 <_Thread_Dispatch_disable_level>
++level;
2007640: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2007644: c4 20 61 70 st %g2, [ %g1 + 0x170 ]
return;
_Thread_Disable_dispatch();
handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) );
2007648: 40 00 13 1b call 200c2b4 <_Workspace_Allocate>
200764c: 90 10 20 10 mov 0x10, %o0
if ( handler ) {
2007650: 80 a2 20 00 cmp %o0, 0
2007654: 02 80 00 09 be 2007678 <pthread_cleanup_push+0x4c> <== NEVER TAKEN
2007658: 03 00 80 7d sethi %hi(0x201f400), %g1
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
200765c: c2 00 62 a0 ld [ %g1 + 0x2a0 ], %g1 ! 201f6a0 <_Per_CPU_Information+0x10>
handler_stack = &thread_support->Cancellation_Handlers;
handler->routine = routine;
handler->arg = arg;
_Chain_Append( handler_stack, &handler->Node );
2007660: 92 10 00 08 mov %o0, %o1
handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) );
if ( handler ) {
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
handler_stack = &thread_support->Cancellation_Handlers;
2007664: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
handler->routine = routine;
2007668: f0 22 20 08 st %i0, [ %o0 + 8 ]
handler->arg = arg;
200766c: f2 22 20 0c st %i1, [ %o0 + 0xc ]
_Chain_Append( handler_stack, &handler->Node );
2007670: 40 00 06 79 call 2009054 <_Chain_Append>
2007674: 90 00 60 e4 add %g1, 0xe4, %o0
}
_Thread_Enable_dispatch();
2007678: 40 00 0e 7c call 200b068 <_Thread_Enable_dispatch>
200767c: 81 e8 00 00 restore
2007680: 81 c7 e0 08 ret
2007684: 81 e8 00 00 restore
020085cc <pthread_cond_init>:
*/
int pthread_cond_init(
pthread_cond_t *cond,
const pthread_condattr_t *attr
)
{
20085cc: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Condition_variables_Control *the_cond;
const pthread_condattr_t *the_attr;
if ( attr ) the_attr = attr;
20085d0: 80 a6 60 00 cmp %i1, 0
20085d4: 22 80 00 27 be,a 2008670 <pthread_cond_init+0xa4>
20085d8: 33 00 80 7a sethi %hi(0x201e800), %i1
else the_attr = &_POSIX_Condition_variables_Default_attributes;
/*
* Be careful about attributes when global!!!
*/
if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED )
20085dc: c4 06 60 04 ld [ %i1 + 4 ], %g2 ! 201e804 <rtems_status_assoc+0xcc>
20085e0: 80 a0 a0 01 cmp %g2, 1
20085e4: 02 80 00 06 be 20085fc <pthread_cond_init+0x30> <== NEVER TAKEN
20085e8: 82 10 20 16 mov 0x16, %g1
return EINVAL;
if ( !the_attr->is_initialized )
20085ec: c4 06 40 00 ld [ %i1 ], %g2
20085f0: 80 a0 a0 00 cmp %g2, 0
20085f4: 32 80 00 04 bne,a 2008604 <pthread_cond_init+0x38>
20085f8: 03 00 80 82 sethi %hi(0x2020800), %g1
*cond = the_cond->Object.id;
_Thread_Enable_dispatch();
return 0;
}
20085fc: 81 c7 e0 08 ret
2008600: 91 e8 00 01 restore %g0, %g1, %o0
*
* 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;
2008604: c4 00 63 70 ld [ %g1 + 0x370 ], %g2
++level;
2008608: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
200860c: c4 20 63 70 st %g2, [ %g1 + 0x370 ]
*/
RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control
*_POSIX_Condition_variables_Allocate( void )
{
return (POSIX_Condition_variables_Control *)
2008610: 39 00 80 83 sethi %hi(0x2020c00), %i4
2008614: 40 00 0a b0 call 200b0d4 <_Objects_Allocate>
2008618: 90 17 23 9c or %i4, 0x39c, %o0 ! 2020f9c <_POSIX_Condition_variables_Information>
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
200861c: ba 92 20 00 orcc %o0, 0, %i5
2008620: 02 80 00 16 be 2008678 <pthread_cond_init+0xac>
2008624: 90 07 60 18 add %i5, 0x18, %o0
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
2008628: c2 06 60 04 ld [ %i1 + 4 ], %g1
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
200862c: 92 10 20 00 clr %o1
2008630: 15 04 00 02 sethi %hi(0x10000800), %o2
2008634: 96 10 20 74 mov 0x74, %o3
if ( !the_cond ) {
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
2008638: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
200863c: 40 00 12 22 call 200cec4 <_Thread_queue_Initialize>
2008640: c0 27 60 14 clr [ %i5 + 0x14 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2008644: c4 17 60 0a lduh [ %i5 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008648: b8 17 23 9c or %i4, 0x39c, %i4
200864c: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2008650: c2 07 60 08 ld [ %i5 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008654: 85 28 a0 02 sll %g2, 2, %g2
2008658: fa 20 c0 02 st %i5, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
200865c: c0 27 60 0c clr [ %i5 + 0xc ]
0
);
*cond = the_cond->Object.id;
_Thread_Enable_dispatch();
2008660: 40 00 0f e9 call 200c604 <_Thread_Enable_dispatch>
2008664: c2 26 00 00 st %g1, [ %i0 ]
return 0;
2008668: 10 bf ff e5 b 20085fc <pthread_cond_init+0x30>
200866c: 82 10 20 00 clr %g1
{
POSIX_Condition_variables_Control *the_cond;
const pthread_condattr_t *the_attr;
if ( attr ) the_attr = attr;
else the_attr = &_POSIX_Condition_variables_Default_attributes;
2008670: 10 bf ff db b 20085dc <pthread_cond_init+0x10>
2008674: b2 16 61 ec or %i1, 0x1ec, %i1
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
_Thread_Enable_dispatch();
2008678: 40 00 0f e3 call 200c604 <_Thread_Enable_dispatch>
200867c: 01 00 00 00 nop
return ENOMEM;
2008680: 10 bf ff df b 20085fc <pthread_cond_init+0x30>
2008684: 82 10 20 0c mov 0xc, %g1 ! c <PROM_START+0xc>
02008430 <pthread_condattr_destroy>:
*/
int pthread_condattr_destroy(
pthread_condattr_t *attr
)
{
2008430: 82 10 00 08 mov %o0, %g1
if ( !attr || attr->is_initialized == false )
2008434: 80 a0 60 00 cmp %g1, 0
2008438: 02 80 00 06 be 2008450 <pthread_condattr_destroy+0x20>
200843c: 90 10 20 16 mov 0x16, %o0
2008440: c4 00 40 00 ld [ %g1 ], %g2
2008444: 80 a0 a0 00 cmp %g2, 0
2008448: 32 80 00 04 bne,a 2008458 <pthread_condattr_destroy+0x28><== ALWAYS TAKEN
200844c: c0 20 40 00 clr [ %g1 ]
return EINVAL;
attr->is_initialized = false;
return 0;
}
2008450: 81 c3 e0 08 retl
2008454: 01 00 00 00 nop
2008458: 81 c3 e0 08 retl
200845c: 90 10 20 00 clr %o0 ! 0 <PROM_START>
02007ad8 <pthread_create>:
pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine)( void * ),
void *arg
)
{
2007ad8: 9d e3 bf 58 save %sp, -168, %sp
int schedpolicy = SCHED_RR;
struct sched_param schedparam;
Objects_Name name;
int rc;
if ( !start_routine )
2007adc: 80 a6 a0 00 cmp %i2, 0
2007ae0: 02 80 00 0a be 2007b08 <pthread_create+0x30>
2007ae4: ba 10 20 0e mov 0xe, %i5
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
2007ae8: 80 a6 60 00 cmp %i1, 0
2007aec: 22 80 00 63 be,a 2007c78 <pthread_create+0x1a0>
2007af0: 33 00 80 84 sethi %hi(0x2021000), %i1
if ( !the_attr->is_initialized )
2007af4: c2 06 40 00 ld [ %i1 ], %g1
2007af8: 80 a0 60 00 cmp %g1, 0
2007afc: 32 80 00 05 bne,a 2007b10 <pthread_create+0x38>
2007b00: c2 06 60 04 ld [ %i1 + 4 ], %g1
schedpolicy = the_attr->schedpolicy;
schedparam = the_attr->schedparam;
break;
default:
return EINVAL;
2007b04: ba 10 20 16 mov 0x16, %i5
*/
*thread = the_thread->Object.id;
_RTEMS_Unlock_allocator();
return 0;
}
2007b08: 81 c7 e0 08 ret
2007b0c: 91 e8 00 1d restore %g0, %i5, %o0
* stack space if it is allowed to allocate it itself.
*
* NOTE: If the user provides the stack we will let it drop below
* twice the minimum.
*/
if ( the_attr->stackaddr && !_Stack_Is_enough(the_attr->stacksize) )
2007b10: 80 a0 60 00 cmp %g1, 0
2007b14: 02 80 00 07 be 2007b30 <pthread_create+0x58>
2007b18: 03 00 80 89 sethi %hi(0x2022400), %g1
2007b1c: c4 06 60 08 ld [ %i1 + 8 ], %g2
2007b20: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1
2007b24: 80 a0 80 01 cmp %g2, %g1
2007b28: 0a bf ff f8 bcs 2007b08 <pthread_create+0x30>
2007b2c: ba 10 20 16 mov 0x16, %i5
* If inheritsched is set to PTHREAD_INHERIT_SCHED, then this thread
* inherits scheduling attributes from the creating thread. If it is
* PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the
* attributes structure.
*/
switch ( the_attr->inheritsched ) {
2007b30: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
2007b34: 80 a0 60 01 cmp %g1, 1
2007b38: 02 80 00 52 be 2007c80 <pthread_create+0x1a8>
2007b3c: 80 a0 60 02 cmp %g1, 2
2007b40: 32 bf ff f2 bne,a 2007b08 <pthread_create+0x30>
2007b44: ba 10 20 16 mov 0x16, %i5
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
schedparam = the_attr->schedparam;
2007b48: da 06 60 18 ld [ %i1 + 0x18 ], %o5
2007b4c: de 06 60 1c ld [ %i1 + 0x1c ], %o7
2007b50: fa 06 60 20 ld [ %i1 + 0x20 ], %i5
2007b54: c8 06 60 24 ld [ %i1 + 0x24 ], %g4
2007b58: c6 06 60 28 ld [ %i1 + 0x28 ], %g3
2007b5c: c4 06 60 2c ld [ %i1 + 0x2c ], %g2
2007b60: c2 06 60 30 ld [ %i1 + 0x30 ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
2007b64: f8 06 60 14 ld [ %i1 + 0x14 ], %i4
schedparam = the_attr->schedparam;
2007b68: da 27 bf e4 st %o5, [ %fp + -28 ]
2007b6c: de 27 bf e8 st %o7, [ %fp + -24 ]
2007b70: fa 27 bf ec st %i5, [ %fp + -20 ]
2007b74: c8 27 bf f0 st %g4, [ %fp + -16 ]
2007b78: c6 27 bf f4 st %g3, [ %fp + -12 ]
2007b7c: c4 27 bf f8 st %g2, [ %fp + -8 ]
2007b80: c2 27 bf fc st %g1, [ %fp + -4 ]
/*
* Check the contentionscope since rtems only supports PROCESS wide
* contention (i.e. no system wide contention).
*/
if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS )
2007b84: c2 06 60 0c ld [ %i1 + 0xc ], %g1
2007b88: 80 a0 60 00 cmp %g1, 0
2007b8c: 12 bf ff df bne 2007b08 <pthread_create+0x30>
2007b90: ba 10 20 86 mov 0x86, %i5
return ENOTSUP;
/*
* Interpret the scheduling parameters.
*/
if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) )
2007b94: 40 00 1a bf call 200e690 <_POSIX_Priority_Is_valid>
2007b98: d0 07 bf e4 ld [ %fp + -28 ], %o0
2007b9c: 80 8a 20 ff btst 0xff, %o0
2007ba0: 02 bf ff da be 2007b08 <pthread_create+0x30> <== NEVER TAKEN
2007ba4: ba 10 20 16 mov 0x16, %i5
RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core(
int priority
)
{
return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1);
2007ba8: 03 00 80 89 sethi %hi(0x2022400), %g1
return EINVAL;
core_priority = _POSIX_Priority_To_core( schedparam.sched_priority );
2007bac: e0 07 bf e4 ld [ %fp + -28 ], %l0
2007bb0: e8 08 61 bc ldub [ %g1 + 0x1bc ], %l4
/*
* Set the core scheduling policy information.
*/
rc = _POSIX_Thread_Translate_sched_param(
2007bb4: 90 10 00 1c mov %i4, %o0
2007bb8: 92 07 bf e4 add %fp, -28, %o1
2007bbc: 94 07 bf dc add %fp, -36, %o2
2007bc0: 40 00 1a c1 call 200e6c4 <_POSIX_Thread_Translate_sched_param>
2007bc4: 96 07 bf e0 add %fp, -32, %o3
schedpolicy,
&schedparam,
&budget_algorithm,
&budget_callout
);
if ( rc )
2007bc8: ba 92 20 00 orcc %o0, 0, %i5
2007bcc: 12 bf ff cf bne 2007b08 <pthread_create+0x30>
2007bd0: 25 00 80 8c sethi %hi(0x2023000), %l2
#endif
/*
* Lock the allocator mutex for protection
*/
_RTEMS_Lock_allocator();
2007bd4: d0 04 a2 d4 ld [ %l2 + 0x2d4 ], %o0 ! 20232d4 <_RTEMS_Allocator_Mutex>
2007bd8: 40 00 06 ab call 2009684 <_API_Mutex_Lock>
2007bdc: 27 00 80 8d sethi %hi(0x2023400), %l3
* _POSIX_Threads_Allocate
*/
RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void )
{
return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information );
2007be0: 40 00 09 82 call 200a1e8 <_Objects_Allocate>
2007be4: 90 14 e0 64 or %l3, 0x64, %o0 ! 2023464 <_POSIX_Threads_Information>
* Allocate the thread control block.
*
* NOTE: Global threads are not currently supported.
*/
the_thread = _POSIX_Threads_Allocate();
if ( !the_thread ) {
2007be8: a2 92 20 00 orcc %o0, 0, %l1
2007bec: 02 80 00 1f be 2007c68 <pthread_create+0x190>
2007bf0: 05 00 80 89 sethi %hi(0x2022400), %g2
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
2007bf4: c2 06 60 08 ld [ %i1 + 8 ], %g1
static inline size_t _POSIX_Threads_Ensure_minimum_stack (
size_t size
)
{
if ( size >= PTHREAD_MINIMUM_STACK_SIZE )
2007bf8: d6 00 a1 c0 ld [ %g2 + 0x1c0 ], %o3
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
2007bfc: c0 27 bf d4 clr [ %fp + -44 ]
2007c00: 97 2a e0 01 sll %o3, 1, %o3
2007c04: 80 a2 c0 01 cmp %o3, %g1
2007c08: 1a 80 00 03 bcc 2007c14 <pthread_create+0x13c>
2007c0c: d4 06 60 04 ld [ %i1 + 4 ], %o2
2007c10: 96 10 00 01 mov %g1, %o3
2007c14: c2 07 bf dc ld [ %fp + -36 ], %g1
2007c18: 9a 0d 20 ff and %l4, 0xff, %o5
2007c1c: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2007c20: 82 10 20 01 mov 1, %g1
2007c24: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2007c28: c2 07 bf e0 ld [ %fp + -32 ], %g1
2007c2c: c0 23 a0 68 clr [ %sp + 0x68 ]
2007c30: c2 23 a0 64 st %g1, [ %sp + 0x64 ]
2007c34: 82 07 bf d4 add %fp, -44, %g1
2007c38: 90 14 e0 64 or %l3, 0x64, %o0
2007c3c: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2007c40: 92 10 00 11 mov %l1, %o1
2007c44: 98 10 20 01 mov 1, %o4
2007c48: 40 00 0e eb call 200b7f4 <_Thread_Initialize>
2007c4c: 9a 23 40 10 sub %o5, %l0, %o5
budget_callout,
0, /* isr level */
name /* posix threads don't have a name */
);
if ( !status ) {
2007c50: 80 8a 20 ff btst 0xff, %o0
2007c54: 12 80 00 1e bne 2007ccc <pthread_create+0x1f4>
2007c58: 11 00 80 8d sethi %hi(0x2023400), %o0
RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free (
Thread_Control *the_pthread
)
{
_Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object );
2007c5c: 92 10 00 11 mov %l1, %o1
2007c60: 40 00 0a 5a call 200a5c8 <_Objects_Free>
2007c64: 90 12 20 64 or %o0, 0x64, %o0
_POSIX_Threads_Free( the_thread );
_RTEMS_Unlock_allocator();
2007c68: d0 04 a2 d4 ld [ %l2 + 0x2d4 ], %o0
2007c6c: 40 00 06 9b call 20096d8 <_API_Mutex_Unlock>
2007c70: ba 10 20 0b mov 0xb, %i5
2007c74: 30 bf ff a5 b,a 2007b08 <pthread_create+0x30>
int rc;
if ( !start_routine )
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
2007c78: 10 bf ff 9f b 2007af4 <pthread_create+0x1c>
2007c7c: b2 16 60 c4 or %i1, 0xc4, %i1
* PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the
* attributes structure.
*/
switch ( the_attr->inheritsched ) {
case PTHREAD_INHERIT_SCHED:
api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
2007c80: 03 00 80 8d sethi %hi(0x2023400), %g1
2007c84: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 ! 2023780 <_Per_CPU_Information+0x10>
2007c88: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
2007c8c: d8 00 60 88 ld [ %g1 + 0x88 ], %o4
2007c90: da 00 60 8c ld [ %g1 + 0x8c ], %o5
2007c94: de 00 60 90 ld [ %g1 + 0x90 ], %o7
2007c98: fa 00 60 94 ld [ %g1 + 0x94 ], %i5
2007c9c: c8 00 60 98 ld [ %g1 + 0x98 ], %g4
2007ca0: c6 00 60 9c ld [ %g1 + 0x9c ], %g3
2007ca4: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2
* attributes structure.
*/
switch ( the_attr->inheritsched ) {
case PTHREAD_INHERIT_SCHED:
api = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
schedpolicy = api->schedpolicy;
2007ca8: f8 00 60 84 ld [ %g1 + 0x84 ], %i4
schedparam = api->schedparam;
2007cac: d8 27 bf e4 st %o4, [ %fp + -28 ]
2007cb0: da 27 bf e8 st %o5, [ %fp + -24 ]
2007cb4: de 27 bf ec st %o7, [ %fp + -20 ]
2007cb8: fa 27 bf f0 st %i5, [ %fp + -16 ]
2007cbc: c8 27 bf f4 st %g4, [ %fp + -12 ]
2007cc0: c6 27 bf f8 st %g3, [ %fp + -8 ]
break;
2007cc4: 10 bf ff b0 b 2007b84 <pthread_create+0xac>
2007cc8: c4 27 bf fc st %g2, [ %fp + -4 ]
}
/*
* finish initializing the per API structure
*/
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
2007ccc: e0 04 61 5c ld [ %l1 + 0x15c ], %l0
api->Attributes = *the_attr;
2007cd0: 92 10 00 19 mov %i1, %o1
2007cd4: 94 10 20 40 mov 0x40, %o2
2007cd8: 40 00 27 83 call 2011ae4 <memcpy>
2007cdc: 90 10 00 10 mov %l0, %o0
api->detachstate = the_attr->detachstate;
2007ce0: c2 06 60 3c ld [ %i1 + 0x3c ], %g1
api->schedpolicy = schedpolicy;
api->schedparam = schedparam;
2007ce4: 92 07 bf e4 add %fp, -28, %o1
2007ce8: 94 10 20 1c mov 0x1c, %o2
* finish initializing the per API structure
*/
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
api->Attributes = *the_attr;
api->detachstate = the_attr->detachstate;
2007cec: c2 24 20 40 st %g1, [ %l0 + 0x40 ]
api->schedpolicy = schedpolicy;
2007cf0: f8 24 20 84 st %i4, [ %l0 + 0x84 ]
api->schedparam = schedparam;
2007cf4: 40 00 27 7c call 2011ae4 <memcpy>
2007cf8: 90 04 20 88 add %l0, 0x88, %o0
/*
* POSIX threads are allocated and started in one operation.
*/
status = _Thread_Start(
2007cfc: 90 10 00 11 mov %l1, %o0
2007d00: 92 10 20 01 mov 1, %o1
2007d04: 94 10 00 1a mov %i2, %o2
2007d08: 96 10 00 1b mov %i3, %o3
2007d0c: 40 00 11 32 call 200c1d4 <_Thread_Start>
2007d10: 98 10 20 00 clr %o4
_RTEMS_Unlock_allocator();
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
2007d14: 80 a7 20 04 cmp %i4, 4
2007d18: 02 80 00 07 be 2007d34 <pthread_create+0x25c>
2007d1c: 01 00 00 00 nop
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
2007d20: c2 04 60 08 ld [ %l1 + 8 ], %g1
_RTEMS_Unlock_allocator();
2007d24: d0 04 a2 d4 ld [ %l2 + 0x2d4 ], %o0
2007d28: 40 00 06 6c call 20096d8 <_API_Mutex_Unlock>
2007d2c: c2 26 00 00 st %g1, [ %i0 ]
2007d30: 30 bf ff 76 b,a 2007b08 <pthread_create+0x30>
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
_Watchdog_Insert_ticks(
2007d34: 40 00 11 52 call 200c27c <_Timespec_To_ticks>
2007d38: 90 04 20 90 add %l0, 0x90, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007d3c: 92 04 20 a8 add %l0, 0xa8, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007d40: d0 24 20 b4 st %o0, [ %l0 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007d44: 11 00 80 8c sethi %hi(0x2023000), %o0
2007d48: 40 00 12 07 call 200c564 <_Watchdog_Insert>
2007d4c: 90 12 22 ec or %o0, 0x2ec, %o0 ! 20232ec <_Watchdog_Ticks_chain>
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
2007d50: 10 bf ff f5 b 2007d24 <pthread_create+0x24c>
2007d54: c2 04 60 08 ld [ %l1 + 8 ], %g1
0201b138 <pthread_kill>:
int pthread_kill(
pthread_t thread,
int sig
)
{
201b138: 9d e3 bf 98 save %sp, -104, %sp
POSIX_API_Control *api;
Thread_Control *the_thread;
Objects_Locations location;
if ( !sig )
201b13c: 80 a6 60 00 cmp %i1, 0
201b140: 02 80 00 31 be 201b204 <pthread_kill+0xcc>
201b144: b8 06 7f ff add %i1, -1, %i4
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201b148: 80 a7 20 1f cmp %i4, 0x1f
201b14c: 18 80 00 2e bgu 201b204 <pthread_kill+0xcc>
201b150: 90 10 00 18 mov %i0, %o0
rtems_set_errno_and_return_minus_one( EINVAL );
the_thread = _Thread_Get( thread, &location );
201b154: 7f ff bd 95 call 200a7a8 <_Thread_Get>
201b158: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
201b15c: c2 07 bf fc ld [ %fp + -4 ], %g1
201b160: 80 a0 60 00 cmp %g1, 0
201b164: 12 80 00 2e bne 201b21c <pthread_kill+0xe4> <== NEVER TAKEN
201b168: ba 10 00 08 mov %o0, %i5
201b16c: 11 00 80 76 sethi %hi(0x201d800), %o0
201b170: 7f ff b4 f7 call 200854c <_API_extensions_Add_post_switch>
201b174: 90 12 20 f4 or %o0, 0xf4, %o0 ! 201d8f4 <_POSIX_signals_Post_switch>
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( sig ) {
if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) {
201b178: 83 2e 60 02 sll %i1, 2, %g1
201b17c: 85 2e 60 04 sll %i1, 4, %g2
201b180: 84 20 80 01 sub %g2, %g1, %g2
201b184: 03 00 80 7a sethi %hi(0x201e800), %g1
201b188: 82 10 60 a0 or %g1, 0xa0, %g1 ! 201e8a0 <_POSIX_signals_Vectors>
201b18c: 82 00 40 02 add %g1, %g2, %g1
201b190: c4 00 60 08 ld [ %g1 + 8 ], %g2
201b194: 80 a0 a0 01 cmp %g2, 1
201b198: 02 80 00 15 be 201b1ec <pthread_kill+0xb4>
201b19c: c2 07 61 5c ld [ %i5 + 0x15c ], %g1
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201b1a0: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2
201b1a4: b6 10 20 01 mov 1, %i3
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201b1a8: 90 10 00 1d mov %i5, %o0
201b1ac: b9 2e c0 1c sll %i3, %i4, %i4
201b1b0: 92 10 00 19 mov %i1, %o1
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201b1b4: b8 10 80 1c or %g2, %i4, %i4
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201b1b8: 94 10 20 00 clr %o2
201b1bc: 7f ff ff 86 call 201afd4 <_POSIX_signals_Unblock_thread>
201b1c0: f8 20 60 d4 st %i4, [ %g1 + 0xd4 ]
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201b1c4: 03 00 80 7a sethi %hi(0x201e800), %g1
201b1c8: 82 10 60 40 or %g1, 0x40, %g1 ! 201e840 <_Per_CPU_Information>
201b1cc: c4 00 60 08 ld [ %g1 + 8 ], %g2
201b1d0: 80 a0 a0 00 cmp %g2, 0
201b1d4: 02 80 00 06 be 201b1ec <pthread_kill+0xb4>
201b1d8: 01 00 00 00 nop
201b1dc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
201b1e0: 80 a7 40 02 cmp %i5, %g2
201b1e4: 02 80 00 06 be 201b1fc <pthread_kill+0xc4>
201b1e8: 01 00 00 00 nop
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( sig ) {
if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) {
_Thread_Enable_dispatch();
201b1ec: 7f ff bd 63 call 200a778 <_Thread_Enable_dispatch>
201b1f0: b0 10 20 00 clr %i0 ! 0 <PROM_START>
201b1f4: 81 c7 e0 08 ret
201b1f8: 81 e8 00 00 restore
api->signals_pending |= signo_to_mask( sig );
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
201b1fc: f6 28 60 0c stb %i3, [ %g1 + 0xc ]
201b200: 30 bf ff fb b,a 201b1ec <pthread_kill+0xb4>
if ( !sig )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
rtems_set_errno_and_return_minus_one( EINVAL );
201b204: 7f ff d4 75 call 20103d8 <__errno>
201b208: b0 10 3f ff mov -1, %i0
201b20c: 82 10 20 16 mov 0x16, %g1
201b210: c2 22 00 00 st %g1, [ %o0 ]
201b214: 81 c7 e0 08 ret
201b218: 81 e8 00 00 restore
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( ESRCH );
201b21c: 7f ff d4 6f call 20103d8 <__errno> <== NOT EXECUTED
201b220: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED
201b224: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED
201b228: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
}
201b22c: 81 c7 e0 08 ret <== NOT EXECUTED
201b230: 81 e8 00 00 restore <== NOT EXECUTED
02009b18 <pthread_mutex_timedlock>:
*/
int pthread_mutex_timedlock(
pthread_mutex_t *mutex,
const struct timespec *abstime
)
{
2009b18: 9d e3 bf 98 save %sp, -104, %sp
*
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
2009b1c: 90 10 00 19 mov %i1, %o0
2009b20: 40 00 00 38 call 2009c00 <_POSIX_Absolute_timeout_to_ticks>
2009b24: 92 07 bf fc add %fp, -4, %o1
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks );
2009b28: d4 07 bf fc ld [ %fp + -4 ], %o2
*
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
2009b2c: ba 10 00 08 mov %o0, %i5
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
2009b30: 80 a7 60 03 cmp %i5, 3
2009b34: 02 80 00 0c be 2009b64 <pthread_mutex_timedlock+0x4c>
2009b38: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks );
2009b3c: 7f ff ff bd call 2009a30 <_POSIX_Mutex_Lock_support>
2009b40: 92 10 20 00 clr %o1
* This service only gives us the option to block. We used a polling
* attempt to lock if the abstime was not in the future. If we did
* not obtain the mutex, then not look at the status immediately,
* make sure the right reason is returned.
*/
if ( !do_wait && (lock_status == EBUSY) ) {
2009b44: 80 a2 20 10 cmp %o0, 0x10
2009b48: 12 80 00 0a bne 2009b70 <pthread_mutex_timedlock+0x58>
2009b4c: b0 10 00 08 mov %o0, %i0
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
2009b50: 80 a7 60 00 cmp %i5, 0
2009b54: 12 80 00 09 bne 2009b78 <pthread_mutex_timedlock+0x60> <== ALWAYS TAKEN
2009b58: ba 07 7f ff add %i5, -1, %i5
return EINVAL;
2009b5c: 81 c7 e0 08 ret <== NOT EXECUTED
2009b60: 91 e8 20 16 restore %g0, 0x16, %o0 <== NOT EXECUTED
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks );
2009b64: 7f ff ff b3 call 2009a30 <_POSIX_Mutex_Lock_support>
2009b68: 92 10 20 01 mov 1, %o1
2009b6c: b0 10 00 08 mov %o0, %i0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return lock_status;
}
2009b70: 81 c7 e0 08 ret
2009b74: 81 e8 00 00 restore
* make sure the right reason is returned.
*/
if ( !do_wait && (lock_status == EBUSY) ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
2009b78: 80 a7 60 01 cmp %i5, 1
2009b7c: 18 bf ff fd bgu 2009b70 <pthread_mutex_timedlock+0x58> <== NEVER TAKEN
2009b80: 01 00 00 00 nop
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
2009b84: 81 c7 e0 08 ret
2009b88: 91 e8 20 74 restore %g0, 0x74, %o0
02007358 <pthread_mutexattr_gettype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_gettype(
const pthread_mutexattr_t *attr,
int *type
)
{
2007358: 82 10 00 08 mov %o0, %g1
if ( !attr )
200735c: 80 a0 60 00 cmp %g1, 0
2007360: 02 80 00 06 be 2007378 <pthread_mutexattr_gettype+0x20>
2007364: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2007368: c4 00 40 00 ld [ %g1 ], %g2
200736c: 80 a0 a0 00 cmp %g2, 0
2007370: 12 80 00 04 bne 2007380 <pthread_mutexattr_gettype+0x28>
2007374: 80 a2 60 00 cmp %o1, 0
if ( !type )
return EINVAL;
*type = attr->type;
return 0;
}
2007378: 81 c3 e0 08 retl
200737c: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
if ( !type )
2007380: 02 bf ff fe be 2007378 <pthread_mutexattr_gettype+0x20> <== NEVER TAKEN
2007384: 01 00 00 00 nop
return EINVAL;
*type = attr->type;
2007388: c2 00 60 10 ld [ %g1 + 0x10 ], %g1
return 0;
200738c: 90 10 20 00 clr %o0
}
2007390: 81 c3 e0 08 retl
2007394: c2 22 40 00 st %g1, [ %o1 ]
020096e4 <pthread_mutexattr_setpshared>:
int pthread_mutexattr_setpshared(
pthread_mutexattr_t *attr,
int pshared
)
{
20096e4: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
20096e8: 80 a0 60 00 cmp %g1, 0
20096ec: 02 80 00 06 be 2009704 <pthread_mutexattr_setpshared+0x20>
20096f0: 90 10 20 16 mov 0x16, %o0
20096f4: c4 00 40 00 ld [ %g1 ], %g2
20096f8: 80 a0 a0 00 cmp %g2, 0
20096fc: 12 80 00 04 bne 200970c <pthread_mutexattr_setpshared+0x28>
2009700: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
2009704: 81 c3 e0 08 retl
2009708: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
200970c: 18 bf ff fe bgu 2009704 <pthread_mutexattr_setpshared+0x20><== NEVER TAKEN
2009710: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
2009714: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2009718: 81 c3 e0 08 retl
200971c: 90 10 20 00 clr %o0
020073ec <pthread_mutexattr_settype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_settype(
pthread_mutexattr_t *attr,
int type
)
{
20073ec: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
20073f0: 80 a0 60 00 cmp %g1, 0
20073f4: 02 80 00 06 be 200740c <pthread_mutexattr_settype+0x20>
20073f8: 90 10 20 16 mov 0x16, %o0
20073fc: c4 00 40 00 ld [ %g1 ], %g2
2007400: 80 a0 a0 00 cmp %g2, 0
2007404: 12 80 00 04 bne 2007414 <pthread_mutexattr_settype+0x28> <== ALWAYS TAKEN
2007408: 80 a2 60 03 cmp %o1, 3
return 0;
default:
return EINVAL;
}
}
200740c: 81 c3 e0 08 retl
2007410: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( type ) {
2007414: 18 bf ff fe bgu 200740c <pthread_mutexattr_settype+0x20>
2007418: 01 00 00 00 nop
case PTHREAD_MUTEX_NORMAL:
case PTHREAD_MUTEX_RECURSIVE:
case PTHREAD_MUTEX_ERRORCHECK:
case PTHREAD_MUTEX_DEFAULT:
attr->type = type;
200741c: d2 20 60 10 st %o1, [ %g1 + 0x10 ]
return 0;
default:
return EINVAL;
}
}
2007420: 81 c3 e0 08 retl
2007424: 90 10 20 00 clr %o0
0200820c <pthread_once>:
int pthread_once(
pthread_once_t *once_control,
void (*init_routine)(void)
)
{
200820c: 9d e3 bf 98 save %sp, -104, %sp
if ( !once_control || !init_routine )
2008210: 80 a6 60 00 cmp %i1, 0
2008214: 12 80 00 05 bne 2008228 <pthread_once+0x1c>
2008218: 80 a6 20 00 cmp %i0, 0
return EINVAL;
200821c: 82 10 20 16 mov 0x16, %g1
(*init_routine)();
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
}
return 0;
}
2008220: 81 c7 e0 08 ret
2008224: 91 e8 00 01 restore %g0, %g1, %o0
int pthread_once(
pthread_once_t *once_control,
void (*init_routine)(void)
)
{
if ( !once_control || !init_routine )
2008228: 22 bf ff fe be,a 2008220 <pthread_once+0x14>
200822c: 82 10 20 16 mov 0x16, %g1
return EINVAL;
if ( !once_control->init_executed ) {
2008230: c4 06 20 04 ld [ %i0 + 4 ], %g2
2008234: 80 a0 a0 00 cmp %g2, 0
2008238: 12 bf ff fa bne 2008220 <pthread_once+0x14>
200823c: 82 10 20 00 clr %g1
rtems_mode saveMode;
rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode);
2008240: 90 10 21 00 mov 0x100, %o0
2008244: 92 10 21 00 mov 0x100, %o1
2008248: 40 00 03 21 call 2008ecc <rtems_task_mode>
200824c: 94 07 bf fc add %fp, -4, %o2
if ( !once_control->init_executed ) {
2008250: c2 06 20 04 ld [ %i0 + 4 ], %g1
2008254: 80 a0 60 00 cmp %g1, 0
2008258: 02 80 00 09 be 200827c <pthread_once+0x70> <== ALWAYS TAKEN
200825c: 82 10 20 01 mov 1, %g1
once_control->is_initialized = true;
once_control->init_executed = true;
(*init_routine)();
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
2008260: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED
2008264: 92 10 21 00 mov 0x100, %o1
2008268: 40 00 03 19 call 2008ecc <rtems_task_mode>
200826c: 94 07 bf fc add %fp, -4, %o2
}
return 0;
2008270: 82 10 20 00 clr %g1
}
2008274: 81 c7 e0 08 ret
2008278: 91 e8 00 01 restore %g0, %g1, %o0
if ( !once_control->init_executed ) {
rtems_mode saveMode;
rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode);
if ( !once_control->init_executed ) {
once_control->is_initialized = true;
200827c: c2 26 00 00 st %g1, [ %i0 ]
once_control->init_executed = true;
(*init_routine)();
2008280: 9f c6 40 00 call %i1
2008284: c2 26 20 04 st %g1, [ %i0 + 4 ]
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
2008288: 10 bf ff f7 b 2008264 <pthread_once+0x58>
200828c: d0 07 bf fc ld [ %fp + -4 ], %o0
02008164 <pthread_rwlock_init>:
int pthread_rwlock_init(
pthread_rwlock_t *rwlock,
const pthread_rwlockattr_t *attr
)
{
2008164: 9d e3 bf 90 save %sp, -112, %sp
const pthread_rwlockattr_t *the_attr;
/*
* Error check parameters
*/
if ( !rwlock )
2008168: 80 a6 20 00 cmp %i0, 0
200816c: 02 80 00 08 be 200818c <pthread_rwlock_init+0x28>
2008170: 80 a6 60 00 cmp %i1, 0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
2008174: 02 80 00 23 be 2008200 <pthread_rwlock_init+0x9c>
2008178: 90 07 bf f8 add %fp, -8, %o0
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
200817c: c2 06 40 00 ld [ %i1 ], %g1
2008180: 80 a0 60 00 cmp %g1, 0
2008184: 32 80 00 04 bne,a 2008194 <pthread_rwlock_init+0x30> <== ALWAYS TAKEN
2008188: c2 06 60 04 ld [ %i1 + 4 ], %g1
*rwlock = the_rwlock->Object.id;
_Thread_Enable_dispatch();
return 0;
}
200818c: 81 c7 e0 08 ret
2008190: 91 e8 20 16 restore %g0, 0x16, %o0
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
return EINVAL;
switch ( the_attr->process_shared ) {
2008194: 80 a0 60 00 cmp %g1, 0
2008198: 12 bf ff fd bne 200818c <pthread_rwlock_init+0x28> <== NEVER TAKEN
200819c: 03 00 80 8b sethi %hi(0x2022c00), %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;
20081a0: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
*/
RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes(
CORE_RWLock_Attributes *the_attributes
)
{
the_attributes->XXX = 0;
20081a4: c0 27 bf f4 clr [ %fp + -12 ]
++level;
20081a8: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
20081ac: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
* This function allocates a RWLock control block from
* the inactive chain of free RWLock control blocks.
*/
RTEMS_INLINE_ROUTINE POSIX_RWLock_Control *_POSIX_RWLock_Allocate( void )
{
return (POSIX_RWLock_Control *)
20081b0: 39 00 80 8b sethi %hi(0x2022c00), %i4
20081b4: 40 00 0b 14 call 200ae04 <_Objects_Allocate>
20081b8: 90 17 23 e4 or %i4, 0x3e4, %o0 ! 2022fe4 <_POSIX_RWLock_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
20081bc: ba 92 20 00 orcc %o0, 0, %i5
20081c0: 02 80 00 14 be 2008210 <pthread_rwlock_init+0xac>
20081c4: 90 07 60 10 add %i5, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes );
20081c8: 40 00 09 5f call 200a744 <_CORE_RWLock_Initialize>
20081cc: 92 07 bf f4 add %fp, -12, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
20081d0: c4 17 60 0a lduh [ %i5 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20081d4: b8 17 23 e4 or %i4, 0x3e4, %i4
20081d8: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
20081dc: c2 07 60 08 ld [ %i5 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20081e0: 85 28 a0 02 sll %g2, 2, %g2
20081e4: fa 20 c0 02 st %i5, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
20081e8: c0 27 60 0c clr [ %i5 + 0xc ]
&_POSIX_RWLock_Information,
&the_rwlock->Object,
0
);
*rwlock = the_rwlock->Object.id;
20081ec: c2 26 00 00 st %g1, [ %i0 ]
_Thread_Enable_dispatch();
20081f0: 40 00 10 88 call 200c410 <_Thread_Enable_dispatch>
20081f4: b0 10 20 00 clr %i0
20081f8: 81 c7 e0 08 ret
20081fc: 81 e8 00 00 restore
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
the_attr = attr;
} else {
(void) pthread_rwlockattr_init( &default_attr );
2008200: 40 00 01 b6 call 20088d8 <pthread_rwlockattr_init>
2008204: b2 07 bf f8 add %fp, -8, %i1
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
2008208: 10 bf ff de b 2008180 <pthread_rwlock_init+0x1c>
200820c: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
_Thread_Enable_dispatch();
2008210: 40 00 10 80 call 200c410 <_Thread_Enable_dispatch>
2008214: b0 10 20 0b mov 0xb, %i0
2008218: 81 c7 e0 08 ret
200821c: 81 e8 00 00 restore
02008a64 <pthread_rwlock_timedrdlock>:
int pthread_rwlock_timedrdlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
2008a64: 9d e3 bf 98 save %sp, -104, %sp
Objects_Locations location;
Watchdog_Interval ticks;
bool do_wait = true;
POSIX_Absolute_timeout_conversion_results_t status;
if ( !rwlock )
2008a68: 80 a6 20 00 cmp %i0, 0
2008a6c: 02 80 00 25 be 2008b00 <pthread_rwlock_timedrdlock+0x9c>
2008a70: 92 07 bf fc add %fp, -4, %o1
*
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
2008a74: 40 00 1b 58 call 200f7d4 <_POSIX_Absolute_timeout_to_ticks>
2008a78: 90 10 00 19 mov %i1, %o0
2008a7c: d2 06 00 00 ld [ %i0 ], %o1
2008a80: ba 10 00 08 mov %o0, %i5
2008a84: 94 07 bf f8 add %fp, -8, %o2
2008a88: 11 00 80 85 sethi %hi(0x2021400), %o0
2008a8c: 40 00 0b ca call 200b9b4 <_Objects_Get>
2008a90: 90 12 21 14 or %o0, 0x114, %o0 ! 2021514 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2008a94: c2 07 bf f8 ld [ %fp + -8 ], %g1
2008a98: 80 a0 60 00 cmp %g1, 0
2008a9c: 32 80 00 1a bne,a 2008b04 <pthread_rwlock_timedrdlock+0xa0>
2008aa0: b0 10 20 16 mov 0x16, %i0
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_reading(
2008aa4: d2 06 00 00 ld [ %i0 ], %o1
2008aa8: d6 07 bf fc ld [ %fp + -4 ], %o3
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
2008aac: 82 1f 60 03 xor %i5, 3, %g1
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_reading(
2008ab0: 90 02 20 10 add %o0, 0x10, %o0
2008ab4: 80 a0 00 01 cmp %g0, %g1
2008ab8: 98 10 20 00 clr %o4
2008abc: b8 60 3f ff subx %g0, -1, %i4
2008ac0: 40 00 08 08 call 200aae0 <_CORE_RWLock_Obtain_for_reading>
2008ac4: 94 10 00 1c mov %i4, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2008ac8: 40 00 0f a9 call 200c96c <_Thread_Enable_dispatch>
2008acc: 01 00 00 00 nop
if ( !do_wait ) {
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
2008ad0: 03 00 80 86 sethi %hi(0x2021800), %g1
2008ad4: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 ! 2021870 <_Per_CPU_Information+0x10>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait ) {
2008ad8: 80 a7 20 00 cmp %i4, 0
2008adc: 12 80 00 05 bne 2008af0 <pthread_rwlock_timedrdlock+0x8c>
2008ae0: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
2008ae4: 80 a2 20 02 cmp %o0, 2
2008ae8: 02 80 00 09 be 2008b0c <pthread_rwlock_timedrdlock+0xa8>
2008aec: 80 a7 60 00 cmp %i5, 0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
}
return _POSIX_RWLock_Translate_core_RWLock_return_code(
2008af0: 40 00 00 3f call 2008bec <_POSIX_RWLock_Translate_core_RWLock_return_code>
2008af4: 01 00 00 00 nop
2008af8: 81 c7 e0 08 ret
2008afc: 91 e8 00 08 restore %g0, %o0, %o0
#endif
case OBJECTS_ERROR:
break;
}
return EINVAL;
2008b00: b0 10 20 16 mov 0x16, %i0
}
2008b04: 81 c7 e0 08 ret
2008b08: 81 e8 00 00 restore
);
_Thread_Enable_dispatch();
if ( !do_wait ) {
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
2008b0c: 22 bf ff fe be,a 2008b04 <pthread_rwlock_timedrdlock+0xa0><== NEVER TAKEN
2008b10: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
2008b14: ba 07 7f ff add %i5, -1, %i5
2008b18: 80 a7 60 01 cmp %i5, 1
2008b1c: 18 bf ff f5 bgu 2008af0 <pthread_rwlock_timedrdlock+0x8c> <== NEVER TAKEN
2008b20: b0 10 20 74 mov 0x74, %i0
2008b24: 30 bf ff f8 b,a 2008b04 <pthread_rwlock_timedrdlock+0xa0>
02008b28 <pthread_rwlock_timedwrlock>:
int pthread_rwlock_timedwrlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
2008b28: 9d e3 bf 98 save %sp, -104, %sp
Objects_Locations location;
Watchdog_Interval ticks;
bool do_wait = true;
POSIX_Absolute_timeout_conversion_results_t status;
if ( !rwlock )
2008b2c: 80 a6 20 00 cmp %i0, 0
2008b30: 02 80 00 25 be 2008bc4 <pthread_rwlock_timedwrlock+0x9c>
2008b34: 92 07 bf fc add %fp, -4, %o1
*
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
2008b38: 40 00 1b 27 call 200f7d4 <_POSIX_Absolute_timeout_to_ticks>
2008b3c: 90 10 00 19 mov %i1, %o0
2008b40: d2 06 00 00 ld [ %i0 ], %o1
2008b44: ba 10 00 08 mov %o0, %i5
2008b48: 94 07 bf f8 add %fp, -8, %o2
2008b4c: 11 00 80 85 sethi %hi(0x2021400), %o0
2008b50: 40 00 0b 99 call 200b9b4 <_Objects_Get>
2008b54: 90 12 21 14 or %o0, 0x114, %o0 ! 2021514 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2008b58: c2 07 bf f8 ld [ %fp + -8 ], %g1
2008b5c: 80 a0 60 00 cmp %g1, 0
2008b60: 32 80 00 1a bne,a 2008bc8 <pthread_rwlock_timedwrlock+0xa0>
2008b64: b0 10 20 16 mov 0x16, %i0
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_writing(
2008b68: d2 06 00 00 ld [ %i0 ], %o1
2008b6c: d6 07 bf fc ld [ %fp + -4 ], %o3
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
2008b70: 82 1f 60 03 xor %i5, 3, %g1
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_writing(
2008b74: 90 02 20 10 add %o0, 0x10, %o0
2008b78: 80 a0 00 01 cmp %g0, %g1
2008b7c: 98 10 20 00 clr %o4
2008b80: b8 60 3f ff subx %g0, -1, %i4
2008b84: 40 00 08 0c call 200abb4 <_CORE_RWLock_Obtain_for_writing>
2008b88: 94 10 00 1c mov %i4, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2008b8c: 40 00 0f 78 call 200c96c <_Thread_Enable_dispatch>
2008b90: 01 00 00 00 nop
if ( !do_wait &&
(_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) {
2008b94: 03 00 80 86 sethi %hi(0x2021800), %g1
2008b98: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 ! 2021870 <_Per_CPU_Information+0x10>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait &&
2008b9c: 80 a7 20 00 cmp %i4, 0
2008ba0: 12 80 00 05 bne 2008bb4 <pthread_rwlock_timedwrlock+0x8c>
2008ba4: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
2008ba8: 80 a2 20 02 cmp %o0, 2
2008bac: 02 80 00 09 be 2008bd0 <pthread_rwlock_timedwrlock+0xa8>
2008bb0: 80 a7 60 00 cmp %i5, 0
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return _POSIX_RWLock_Translate_core_RWLock_return_code(
2008bb4: 40 00 00 0e call 2008bec <_POSIX_RWLock_Translate_core_RWLock_return_code>
2008bb8: 01 00 00 00 nop
2008bbc: 81 c7 e0 08 ret
2008bc0: 91 e8 00 08 restore %g0, %o0, %o0
#endif
case OBJECTS_ERROR:
break;
}
return EINVAL;
2008bc4: b0 10 20 16 mov 0x16, %i0
}
2008bc8: 81 c7 e0 08 ret
2008bcc: 81 e8 00 00 restore
);
_Thread_Enable_dispatch();
if ( !do_wait &&
(_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
2008bd0: 22 bf ff fe be,a 2008bc8 <pthread_rwlock_timedwrlock+0xa0><== NEVER TAKEN
2008bd4: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
2008bd8: ba 07 7f ff add %i5, -1, %i5
2008bdc: 80 a7 60 01 cmp %i5, 1
2008be0: 18 bf ff f5 bgu 2008bb4 <pthread_rwlock_timedwrlock+0x8c> <== NEVER TAKEN
2008be4: b0 10 20 74 mov 0x74, %i0
2008be8: 30 bf ff f8 b,a 2008bc8 <pthread_rwlock_timedwrlock+0xa0>
02009404 <pthread_rwlockattr_setpshared>:
int pthread_rwlockattr_setpshared(
pthread_rwlockattr_t *attr,
int pshared
)
{
2009404: 82 10 00 08 mov %o0, %g1
if ( !attr )
2009408: 80 a0 60 00 cmp %g1, 0
200940c: 02 80 00 06 be 2009424 <pthread_rwlockattr_setpshared+0x20>
2009410: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2009414: c4 00 40 00 ld [ %g1 ], %g2
2009418: 80 a0 a0 00 cmp %g2, 0
200941c: 12 80 00 04 bne 200942c <pthread_rwlockattr_setpshared+0x28>
2009420: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
2009424: 81 c3 e0 08 retl
2009428: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
200942c: 18 bf ff fe bgu 2009424 <pthread_rwlockattr_setpshared+0x20><== NEVER TAKEN
2009430: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
2009434: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2009438: 81 c3 e0 08 retl
200943c: 90 10 20 00 clr %o0
0200a4c4 <pthread_setschedparam>:
int pthread_setschedparam(
pthread_t thread,
int policy,
struct sched_param *param
)
{
200a4c4: 9d e3 bf 90 save %sp, -112, %sp
int rc;
/*
* Check all the parameters
*/
if ( !param )
200a4c8: 80 a6 a0 00 cmp %i2, 0
200a4cc: 02 80 00 0a be 200a4f4 <pthread_setschedparam+0x30>
200a4d0: ba 10 20 16 mov 0x16, %i5
return EINVAL;
rc = _POSIX_Thread_Translate_sched_param(
200a4d4: 90 10 00 19 mov %i1, %o0
200a4d8: 92 10 00 1a mov %i2, %o1
200a4dc: 94 07 bf f4 add %fp, -12, %o2
200a4e0: 40 00 19 2a call 2010988 <_POSIX_Thread_Translate_sched_param>
200a4e4: 96 07 bf f8 add %fp, -8, %o3
policy,
param,
&budget_algorithm,
&budget_callout
);
if ( rc )
200a4e8: ba 92 20 00 orcc %o0, 0, %i5
200a4ec: 02 80 00 05 be 200a500 <pthread_setschedparam+0x3c>
200a4f0: 90 10 00 18 mov %i0, %o0
case OBJECTS_ERROR:
break;
}
return ESRCH;
}
200a4f4: b0 10 00 1d mov %i5, %i0
200a4f8: 81 c7 e0 08 ret
200a4fc: 81 e8 00 00 restore
return rc;
/*
* Actually change the scheduling policy and parameters
*/
the_thread = _Thread_Get( thread, &location );
200a500: 40 00 0c fc call 200d8f0 <_Thread_Get>
200a504: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200a508: c2 07 bf fc ld [ %fp + -4 ], %g1
200a50c: 80 a0 60 00 cmp %g1, 0
200a510: 12 80 00 2b bne 200a5bc <pthread_setschedparam+0xf8>
200a514: b6 10 00 08 mov %o0, %i3
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200a518: f8 02 21 5c ld [ %o0 + 0x15c ], %i4
if ( api->schedpolicy == SCHED_SPORADIC )
200a51c: c2 07 20 84 ld [ %i4 + 0x84 ], %g1
200a520: 80 a0 60 04 cmp %g1, 4
200a524: 02 80 00 35 be 200a5f8 <pthread_setschedparam+0x134>
200a528: 01 00 00 00 nop
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
api->schedparam = *param;
200a52c: c2 06 80 00 ld [ %i2 ], %g1
the_thread->budget_algorithm = budget_algorithm;
the_thread->budget_callout = budget_callout;
switch ( api->schedpolicy ) {
200a530: 80 a6 60 00 cmp %i1, 0
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
api->schedparam = *param;
200a534: c2 27 20 88 st %g1, [ %i4 + 0x88 ]
200a538: c4 06 a0 04 ld [ %i2 + 4 ], %g2
200a53c: c4 27 20 8c st %g2, [ %i4 + 0x8c ]
200a540: c4 06 a0 08 ld [ %i2 + 8 ], %g2
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
200a544: f2 27 20 84 st %i1, [ %i4 + 0x84 ]
api->schedparam = *param;
200a548: c4 27 20 90 st %g2, [ %i4 + 0x90 ]
200a54c: c4 06 a0 0c ld [ %i2 + 0xc ], %g2
200a550: c4 27 20 94 st %g2, [ %i4 + 0x94 ]
200a554: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2
200a558: c4 27 20 98 st %g2, [ %i4 + 0x98 ]
200a55c: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2
200a560: c4 27 20 9c st %g2, [ %i4 + 0x9c ]
200a564: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2
200a568: c4 27 20 a0 st %g2, [ %i4 + 0xa0 ]
the_thread->budget_algorithm = budget_algorithm;
200a56c: c4 07 bf f4 ld [ %fp + -12 ], %g2
200a570: c4 26 e0 78 st %g2, [ %i3 + 0x78 ]
the_thread->budget_callout = budget_callout;
200a574: c4 07 bf f8 ld [ %fp + -8 ], %g2
switch ( api->schedpolicy ) {
200a578: 06 80 00 0e bl 200a5b0 <pthread_setschedparam+0xec> <== NEVER TAKEN
200a57c: c4 26 e0 7c st %g2, [ %i3 + 0x7c ]
200a580: 80 a6 60 02 cmp %i1, 2
200a584: 04 80 00 11 ble 200a5c8 <pthread_setschedparam+0x104>
200a588: 07 00 80 8a sethi %hi(0x2022800), %g3
200a58c: 80 a6 60 04 cmp %i1, 4
200a590: 12 80 00 08 bne 200a5b0 <pthread_setschedparam+0xec> <== NEVER TAKEN
200a594: 01 00 00 00 nop
true
);
break;
case SCHED_SPORADIC:
api->ss_high_priority = api->schedparam.sched_priority;
200a598: c2 27 20 a4 st %g1, [ %i4 + 0xa4 ]
_Watchdog_Remove( &api->Sporadic_timer );
200a59c: 40 00 11 0f call 200e9d8 <_Watchdog_Remove>
200a5a0: 90 07 20 a8 add %i4, 0xa8, %o0
_POSIX_Threads_Sporadic_budget_TSR( 0, the_thread );
200a5a4: 90 10 20 00 clr %o0
200a5a8: 7f ff ff 7b call 200a394 <_POSIX_Threads_Sporadic_budget_TSR>
200a5ac: 92 10 00 1b mov %i3, %o1
break;
}
_Thread_Enable_dispatch();
200a5b0: 40 00 0c c4 call 200d8c0 <_Thread_Enable_dispatch>
200a5b4: b0 10 00 1d mov %i5, %i0
200a5b8: 30 bf ff d0 b,a 200a4f8 <pthread_setschedparam+0x34>
#endif
case OBJECTS_ERROR:
break;
}
return ESRCH;
200a5bc: ba 10 20 03 mov 3, %i5
}
200a5c0: 81 c7 e0 08 ret
200a5c4: 91 e8 00 1d restore %g0, %i5, %o0
200a5c8: d2 08 e3 dc ldub [ %g3 + 0x3dc ], %o1
switch ( api->schedpolicy ) {
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice;
200a5cc: 05 00 80 8e sethi %hi(0x2023800), %g2
200a5d0: c4 00 a0 40 ld [ %g2 + 0x40 ], %g2 ! 2023840 <_Thread_Ticks_per_timeslice>
200a5d4: 92 22 40 01 sub %o1, %g1, %o1
the_thread->real_priority =
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
200a5d8: 90 10 00 1b mov %i3, %o0
200a5dc: 94 10 20 01 mov 1, %o2
switch ( api->schedpolicy ) {
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice;
200a5e0: c4 26 e0 74 st %g2, [ %i3 + 0x74 ]
the_thread->real_priority =
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
200a5e4: 40 00 0b 65 call 200d378 <_Thread_Change_priority>
200a5e8: d2 26 e0 18 st %o1, [ %i3 + 0x18 ]
_Watchdog_Remove( &api->Sporadic_timer );
_POSIX_Threads_Sporadic_budget_TSR( 0, the_thread );
break;
}
_Thread_Enable_dispatch();
200a5ec: 40 00 0c b5 call 200d8c0 <_Thread_Enable_dispatch>
200a5f0: b0 10 00 1d mov %i5, %i0
200a5f4: 30 bf ff c1 b,a 200a4f8 <pthread_setschedparam+0x34>
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
200a5f8: 40 00 10 f8 call 200e9d8 <_Watchdog_Remove>
200a5fc: 90 07 20 a8 add %i4, 0xa8, %o0
api->schedpolicy = policy;
api->schedparam = *param;
200a600: 10 bf ff cc b 200a530 <pthread_setschedparam+0x6c>
200a604: c2 06 80 00 ld [ %i2 ], %g1
02007e5c <pthread_testcancel>:
/*
* 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183
*/
void pthread_testcancel( void )
{
2007e5c: 9d e3 bf a0 save %sp, -96, %sp
* Don't even think about deleting a resource from an ISR.
* Besides this request is supposed to be for _Thread_Executing
* and the ISR context is not a thread.
*/
if ( _ISR_Is_in_progress() )
2007e60: 3b 00 80 7d sethi %hi(0x201f400), %i5
2007e64: ba 17 62 90 or %i5, 0x290, %i5 ! 201f690 <_Per_CPU_Information>
2007e68: c2 07 60 08 ld [ %i5 + 8 ], %g1
2007e6c: 80 a0 60 00 cmp %g1, 0
2007e70: 12 80 00 16 bne 2007ec8 <pthread_testcancel+0x6c> <== NEVER TAKEN
2007e74: 03 00 80 7c sethi %hi(0x201f000), %g1
return;
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
2007e78: c4 07 60 10 ld [ %i5 + 0x10 ], %g2
*
* 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;
2007e7c: c6 00 61 70 ld [ %g1 + 0x170 ], %g3
2007e80: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2
++level;
2007e84: 86 00 e0 01 inc %g3
_Thread_Dispatch_disable_level = level;
2007e88: c6 20 61 70 st %g3, [ %g1 + 0x170 ]
_Thread_Disable_dispatch();
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
2007e8c: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1
2007e90: 80 a0 60 00 cmp %g1, 0
2007e94: 12 80 00 0b bne 2007ec0 <pthread_testcancel+0x64> <== NEVER TAKEN
2007e98: 01 00 00 00 nop
2007e9c: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1
2007ea0: 80 a0 60 00 cmp %g1, 0
2007ea4: 02 80 00 07 be 2007ec0 <pthread_testcancel+0x64>
2007ea8: 01 00 00 00 nop
thread_support->cancelation_requested )
cancel = true;
_Thread_Enable_dispatch();
2007eac: 40 00 0c 6f call 200b068 <_Thread_Enable_dispatch>
2007eb0: b2 10 3f ff mov -1, %i1 ! ffffffff <RAM_END+0xfdbfffff>
if ( cancel )
_POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED );
2007eb4: f0 07 60 10 ld [ %i5 + 0x10 ], %i0
2007eb8: 40 00 18 c7 call 200e1d4 <_POSIX_Thread_Exit>
2007ebc: 81 e8 00 00 restore
_Thread_Disable_dispatch();
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
thread_support->cancelation_requested )
cancel = true;
_Thread_Enable_dispatch();
2007ec0: 40 00 0c 6a call 200b068 <_Thread_Enable_dispatch>
2007ec4: 81 e8 00 00 restore
2007ec8: 81 c7 e0 08 ret <== NOT EXECUTED
2007ecc: 81 e8 00 00 restore <== NOT EXECUTED
020083b8 <rtems_aio_enqueue>:
* errno - otherwise
*/
int
rtems_aio_enqueue (rtems_aio_request *req)
{
20083b8: 9d e3 bf 78 save %sp, -136, %sp
struct sched_param param;
/* The queue should be initialized */
AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED);
result = pthread_mutex_lock (&aio_request_queue.mutex);
20083bc: 39 00 80 82 sethi %hi(0x2020800), %i4
20083c0: 40 00 02 7b call 2008dac <pthread_mutex_lock>
20083c4: 90 17 20 4c or %i4, 0x4c, %o0 ! 202084c <aio_request_queue>
if (result != 0) {
20083c8: b6 92 20 00 orcc %o0, 0, %i3
20083cc: 12 80 00 31 bne 2008490 <rtems_aio_enqueue+0xd8> <== NEVER TAKEN
20083d0: 90 10 00 18 mov %i0, %o0
return result;
}
/* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined,
we can use aio_reqprio to lower the priority of the request */
pthread_getschedparam (pthread_self(), &policy, ¶m);
20083d4: 40 00 04 b6 call 20096ac <pthread_self>
20083d8: b2 17 20 4c or %i4, 0x4c, %i1
20083dc: 92 07 bf e0 add %fp, -32, %o1
20083e0: 40 00 03 a8 call 2009280 <pthread_getschedparam>
20083e4: 94 07 bf e4 add %fp, -28, %o2
req->caller_thread = pthread_self ();
20083e8: 40 00 04 b1 call 20096ac <pthread_self>
20083ec: 01 00 00 00 nop
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
20083f0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
req->policy = policy;
20083f4: c6 07 bf e0 ld [ %fp + -32 ], %g3
/* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined,
we can use aio_reqprio to lower the priority of the request */
pthread_getschedparam (pthread_self(), &policy, ¶m);
req->caller_thread = pthread_self ();
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
20083f8: c4 00 60 18 ld [ %g1 + 0x18 ], %g2
req->policy = policy;
20083fc: c6 26 20 08 st %g3, [ %i0 + 8 ]
/* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined,
we can use aio_reqprio to lower the priority of the request */
pthread_getschedparam (pthread_self(), &policy, ¶m);
req->caller_thread = pthread_self ();
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
2008400: c6 07 bf e4 ld [ %fp + -28 ], %g3
/* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined,
we can use aio_reqprio to lower the priority of the request */
pthread_getschedparam (pthread_self(), &policy, ¶m);
req->caller_thread = pthread_self ();
2008404: d0 26 20 10 st %o0, [ %i0 + 0x10 ]
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
2008408: 84 20 c0 02 sub %g3, %g2, %g2
200840c: c4 26 20 0c st %g2, [ %i0 + 0xc ]
req->policy = policy;
req->aiocbp->error_code = EINPROGRESS;
req->aiocbp->return_value = 0;
if ((aio_request_queue.idle_threads == 0) &&
2008410: c4 06 60 68 ld [ %i1 + 0x68 ], %g2
pthread_getschedparam (pthread_self(), &policy, ¶m);
req->caller_thread = pthread_self ();
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
req->policy = policy;
req->aiocbp->error_code = EINPROGRESS;
2008414: 86 10 20 77 mov 0x77, %g3
req->aiocbp->return_value = 0;
2008418: c0 20 60 38 clr [ %g1 + 0x38 ]
pthread_getschedparam (pthread_self(), &policy, ¶m);
req->caller_thread = pthread_self ();
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
req->policy = policy;
req->aiocbp->error_code = EINPROGRESS;
200841c: c6 20 60 34 st %g3, [ %g1 + 0x34 ]
req->aiocbp->return_value = 0;
if ((aio_request_queue.idle_threads == 0) &&
2008420: 80 a0 a0 00 cmp %g2, 0
2008424: 12 80 00 06 bne 200843c <rtems_aio_enqueue+0x84> <== NEVER TAKEN
2008428: d2 00 40 00 ld [ %g1 ], %o1
200842c: c4 06 60 64 ld [ %i1 + 0x64 ], %g2
2008430: 80 a0 a0 04 cmp %g2, 4
2008434: 24 80 00 1b ble,a 20084a0 <rtems_aio_enqueue+0xe8>
2008438: 90 06 60 48 add %i1, 0x48, %o0
else
{
/* the maximum number of threads has been already created
even though some of them might be idle.
The request belongs to one of the active fd chain */
r_chain = rtems_aio_search_fd (&aio_request_queue.work_req,
200843c: 94 10 20 00 clr %o2
2008440: 11 00 80 82 sethi %hi(0x2020800), %o0
2008444: 7f ff ff 78 call 2008224 <rtems_aio_search_fd>
2008448: 90 12 20 94 or %o0, 0x94, %o0 ! 2020894 <aio_request_queue+0x48>
req->aiocbp->aio_fildes, 0);
if (r_chain != NULL)
200844c: b4 92 20 00 orcc %o0, 0, %i2
2008450: 22 80 00 31 be,a 2008514 <rtems_aio_enqueue+0x15c>
2008454: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
{
pthread_mutex_lock (&r_chain->mutex);
2008458: b2 06 a0 1c add %i2, 0x1c, %i1
200845c: 40 00 02 54 call 2008dac <pthread_mutex_lock>
2008460: 90 10 00 19 mov %i1, %o0
rtems_aio_insert_prio (&r_chain->perfd, req);
2008464: 90 06 a0 08 add %i2, 8, %o0
2008468: 7f ff ff 12 call 20080b0 <rtems_aio_insert_prio>
200846c: 92 10 00 18 mov %i0, %o1
pthread_cond_signal (&r_chain->cond);
2008470: 40 00 01 2c call 2008920 <pthread_cond_signal>
2008474: 90 06 a0 20 add %i2, 0x20, %o0
pthread_mutex_unlock (&r_chain->mutex);
2008478: 40 00 02 6d call 2008e2c <pthread_mutex_unlock>
200847c: 90 10 00 19 mov %i1, %o0
if (aio_request_queue.idle_threads > 0)
pthread_cond_signal (&aio_request_queue.new_req);
}
}
pthread_mutex_unlock (&aio_request_queue.mutex);
2008480: 40 00 02 6b call 2008e2c <pthread_mutex_unlock>
2008484: 90 17 20 4c or %i4, 0x4c, %o0
return 0;
}
2008488: 81 c7 e0 08 ret
200848c: 91 e8 00 1b restore %g0, %i3, %o0
/* The queue should be initialized */
AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED);
result = pthread_mutex_lock (&aio_request_queue.mutex);
if (result != 0) {
free (req);
2008490: 7f ff ed c7 call 2003bac <free> <== NOT EXECUTED
2008494: b0 10 00 1b mov %i3, %i0 <== NOT EXECUTED
}
}
pthread_mutex_unlock (&aio_request_queue.mutex);
return 0;
}
2008498: 81 c7 e0 08 ret <== NOT EXECUTED
200849c: 81 e8 00 00 restore <== NOT EXECUTED
if ((aio_request_queue.idle_threads == 0) &&
aio_request_queue.active_threads < AIO_MAX_THREADS)
/* we still have empty places on the active_threads chain */
{
chain = &aio_request_queue.work_req;
r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1);
20084a0: 7f ff ff 61 call 2008224 <rtems_aio_search_fd>
20084a4: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
20084a8: c2 02 20 18 ld [ %o0 + 0x18 ], %g1
20084ac: 80 a0 60 01 cmp %g1, 1
20084b0: 12 bf ff ea bne 2008458 <rtems_aio_enqueue+0xa0>
20084b4: b4 10 00 08 mov %o0, %i2
RTEMS_INLINE_ROUTINE void _Chain_Prepend(
Chain_Control *the_chain,
Chain_Node *the_node
)
{
_Chain_Insert(_Chain_Head(the_chain), the_node);
20084b8: 90 02 20 08 add %o0, 8, %o0
20084bc: 40 00 09 56 call 200aa14 <_Chain_Insert>
20084c0: 92 10 00 18 mov %i0, %o1
rtems_chain_prepend (&r_chain->perfd, &req->next_prio);
r_chain->new_fd = 0;
pthread_mutex_init (&r_chain->mutex, NULL);
20084c4: 92 10 20 00 clr %o1
chain = &aio_request_queue.work_req;
r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1);
if (r_chain->new_fd == 1) {
rtems_chain_prepend (&r_chain->perfd, &req->next_prio);
r_chain->new_fd = 0;
20084c8: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
20084cc: 40 00 01 df call 2008c48 <pthread_mutex_init>
20084d0: 90 06 a0 1c add %i2, 0x1c, %o0
pthread_cond_init (&r_chain->cond, NULL);
20084d4: 92 10 20 00 clr %o1
20084d8: 40 00 00 e3 call 2008864 <pthread_cond_init>
20084dc: 90 06 a0 20 add %i2, 0x20, %o0
AIO_printf ("New thread \n");
result = pthread_create (&thid, &aio_request_queue.attr,
20084e0: 90 07 bf dc add %fp, -36, %o0
20084e4: 92 06 60 08 add %i1, 8, %o1
20084e8: 96 10 00 1a mov %i2, %o3
20084ec: 15 00 80 1f sethi %hi(0x2007c00), %o2
20084f0: 40 00 02 c4 call 2009000 <pthread_create>
20084f4: 94 12 a2 04 or %o2, 0x204, %o2 ! 2007e04 <rtems_aio_handle>
rtems_aio_handle, (void *) r_chain);
if (result != 0) {
20084f8: 82 92 20 00 orcc %o0, 0, %g1
20084fc: 12 80 00 25 bne 2008590 <rtems_aio_enqueue+0x1d8> <== NEVER TAKEN
2008500: 90 10 00 19 mov %i1, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return result;
}
++aio_request_queue.active_threads;
2008504: c2 06 60 64 ld [ %i1 + 0x64 ], %g1
2008508: 82 00 60 01 inc %g1
200850c: 10 bf ff dd b 2008480 <rtems_aio_enqueue+0xc8>
2008510: c2 26 60 64 st %g1, [ %i1 + 0x64 ]
} else {
/* or to the idle chain */
chain = &aio_request_queue.idle_req;
r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1);
2008514: 11 00 80 82 sethi %hi(0x2020800), %o0
2008518: d2 00 40 00 ld [ %g1 ], %o1
200851c: 90 12 20 a0 or %o0, 0xa0, %o0
2008520: 7f ff ff 41 call 2008224 <rtems_aio_search_fd>
2008524: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
2008528: c2 02 20 18 ld [ %o0 + 0x18 ], %g1
} else {
/* or to the idle chain */
chain = &aio_request_queue.idle_req;
r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1);
200852c: b4 10 00 08 mov %o0, %i2
2008530: 92 10 00 18 mov %i0, %o1
if (r_chain->new_fd == 1) {
2008534: 80 a0 60 01 cmp %g1, 1
2008538: 02 80 00 0b be 2008564 <rtems_aio_enqueue+0x1ac>
200853c: 90 02 20 08 add %o0, 8, %o0
r_chain->new_fd = 0;
pthread_mutex_init (&r_chain->mutex, NULL);
pthread_cond_init (&r_chain->cond, NULL);
} else
/* just insert the request in the existing fd chain */
rtems_aio_insert_prio (&r_chain->perfd, req);
2008540: 7f ff fe dc call 20080b0 <rtems_aio_insert_prio>
2008544: 01 00 00 00 nop
if (aio_request_queue.idle_threads > 0)
2008548: c2 06 60 68 ld [ %i1 + 0x68 ], %g1
200854c: 80 a0 60 00 cmp %g1, 0
2008550: 04 bf ff cc ble 2008480 <rtems_aio_enqueue+0xc8> <== ALWAYS TAKEN
2008554: 01 00 00 00 nop
pthread_cond_signal (&aio_request_queue.new_req);
2008558: 40 00 00 f2 call 2008920 <pthread_cond_signal> <== NOT EXECUTED
200855c: 90 06 60 04 add %i1, 4, %o0 <== NOT EXECUTED
2008560: 30 bf ff c8 b,a 2008480 <rtems_aio_enqueue+0xc8> <== NOT EXECUTED
2008564: 40 00 09 2c call 200aa14 <_Chain_Insert>
2008568: 01 00 00 00 nop
/* If this is a new fd chain we signal the idle threads that
might be waiting for requests */
AIO_printf (" New chain on waiting queue \n ");
rtems_chain_prepend (&r_chain->perfd, &req->next_prio);
r_chain->new_fd = 0;
pthread_mutex_init (&r_chain->mutex, NULL);
200856c: 90 06 a0 1c add %i2, 0x1c, %o0
if (r_chain->new_fd == 1) {
/* If this is a new fd chain we signal the idle threads that
might be waiting for requests */
AIO_printf (" New chain on waiting queue \n ");
rtems_chain_prepend (&r_chain->perfd, &req->next_prio);
r_chain->new_fd = 0;
2008570: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
2008574: 40 00 01 b5 call 2008c48 <pthread_mutex_init>
2008578: 92 10 20 00 clr %o1
pthread_cond_init (&r_chain->cond, NULL);
200857c: 90 06 a0 20 add %i2, 0x20, %o0
2008580: 40 00 00 b9 call 2008864 <pthread_cond_init>
2008584: 92 10 20 00 clr %o1
} else
/* just insert the request in the existing fd chain */
rtems_aio_insert_prio (&r_chain->perfd, req);
if (aio_request_queue.idle_threads > 0)
2008588: 10 bf ff f1 b 200854c <rtems_aio_enqueue+0x194>
200858c: c2 06 60 68 ld [ %i1 + 0x68 ], %g1
AIO_printf ("New thread \n");
result = pthread_create (&thid, &aio_request_queue.attr,
rtems_aio_handle, (void *) r_chain);
if (result != 0) {
pthread_mutex_unlock (&aio_request_queue.mutex);
2008590: 40 00 02 27 call 2008e2c <pthread_mutex_unlock> <== NOT EXECUTED
2008594: b6 10 00 01 mov %g1, %i3 <== NOT EXECUTED
2008598: 30 bf ff bc b,a 2008488 <rtems_aio_enqueue+0xd0> <== NOT EXECUTED
02007e04 <rtems_aio_handle>:
* NULL - if error
*/
static void *
rtems_aio_handle (void *arg)
{
2007e04: 9d e3 bf 78 save %sp, -136, %sp
struct timespec timeout;
AIO_printf ("Chain is empty [WQ], wait for work\n");
pthread_mutex_unlock (&r_chain->mutex);
pthread_mutex_lock (&aio_request_queue.mutex);
2007e08: 35 00 80 82 sethi %hi(0x2020800), %i2
2007e0c: b6 06 20 1c add %i0, 0x1c, %i3
2007e10: b4 16 a0 4c or %i2, 0x4c, %i2
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007e14: a0 10 00 1a mov %i2, %l0
2007e18: a2 10 00 1a mov %i2, %l1
pthread_cond_destroy (&r_chain->cond);
free (r_chain);
/* If the idle chain is empty sleep for 3 seconds and wait for a
signal. The thread now becomes idle. */
if (rtems_chain_is_empty (&aio_request_queue.idle_req)) {
2007e1c: a4 06 a0 58 add %i2, 0x58, %l2
rtems_chain_node *node;
node = rtems_chain_first (&aio_request_queue.work_req);
temp = (rtems_aio_request_chain *) node;
while (temp->fildes < r_chain->fildes &&
2007e20: b2 06 a0 4c add %i2, 0x4c, %i1
/* acquire the mutex of the current fd chain.
we don't need to lock the queue mutex since we can
add requests to idle fd chains or even active ones
if the working request has been extracted from the
chain */
result = pthread_mutex_lock (&r_chain->mutex);
2007e24: 40 00 03 e2 call 2008dac <pthread_mutex_lock>
2007e28: 90 10 00 1b mov %i3, %o0
if (result != 0)
2007e2c: 80 a2 20 00 cmp %o0, 0
2007e30: 12 80 00 2b bne 2007edc <rtems_aio_handle+0xd8> <== NEVER TAKEN
2007e34: 01 00 00 00 nop
2007e38: fa 06 20 08 ld [ %i0 + 8 ], %i5
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
2007e3c: 82 06 20 0c add %i0, 0xc, %g1
/* If the locked chain is not empty, take the first
request extract it, unlock the chain and process
the request, in this way the user can supply more
requests to this fd chain */
if (!rtems_chain_is_empty (chain)) {
2007e40: 80 a7 40 01 cmp %i5, %g1
2007e44: 02 80 00 41 be 2007f48 <rtems_aio_handle+0x144>
2007e48: 01 00 00 00 nop
node = rtems_chain_first (chain);
req = (rtems_aio_request *) node;
/* See _POSIX_PRIORITIZE_IO and _POSIX_PRIORITY_SCHEDULING
discussion in rtems_aio_enqueue () */
pthread_getschedparam (pthread_self(), &policy, ¶m);
2007e4c: 40 00 06 18 call 20096ac <pthread_self>
2007e50: 01 00 00 00 nop
2007e54: 92 07 bf d8 add %fp, -40, %o1
2007e58: 40 00 05 0a call 2009280 <pthread_getschedparam>
2007e5c: 94 07 bf e4 add %fp, -28, %o2
param.sched_priority = req->priority;
2007e60: c2 07 60 0c ld [ %i5 + 0xc ], %g1
pthread_setschedparam (pthread_self(), req->policy, ¶m);
2007e64: 40 00 06 12 call 20096ac <pthread_self>
2007e68: c2 27 bf e4 st %g1, [ %fp + -28 ]
2007e6c: d2 07 60 08 ld [ %i5 + 8 ], %o1
2007e70: 40 00 06 13 call 20096bc <pthread_setschedparam>
2007e74: 94 07 bf e4 add %fp, -28, %o2
2007e78: 40 00 0a ce call 200a9b0 <_Chain_Extract>
2007e7c: 90 10 00 1d mov %i5, %o0
rtems_chain_extract (node);
pthread_mutex_unlock (&r_chain->mutex);
2007e80: 40 00 03 eb call 2008e2c <pthread_mutex_unlock>
2007e84: 90 10 00 1b mov %i3, %o0
switch (req->aiocbp->aio_lio_opcode) {
2007e88: f8 07 60 14 ld [ %i5 + 0x14 ], %i4
2007e8c: c2 07 20 30 ld [ %i4 + 0x30 ], %g1
2007e90: 80 a0 60 02 cmp %g1, 2
2007e94: 22 80 00 25 be,a 2007f28 <rtems_aio_handle+0x124>
2007e98: c4 1f 20 08 ldd [ %i4 + 8 ], %g2
2007e9c: 80 a0 60 03 cmp %g1, 3
2007ea0: 02 80 00 1e be 2007f18 <rtems_aio_handle+0x114> <== NEVER TAKEN
2007ea4: 01 00 00 00 nop
2007ea8: 80 a0 60 01 cmp %g1, 1
2007eac: 22 80 00 0e be,a 2007ee4 <rtems_aio_handle+0xe0> <== ALWAYS TAKEN
2007eb0: c4 1f 20 08 ldd [ %i4 + 8 ], %g2
default:
result = -1;
}
if (result == -1) {
req->aiocbp->return_value = -1;
2007eb4: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED
req->aiocbp->error_code = errno;
2007eb8: 40 00 2a 60 call 2012838 <__errno> <== NOT EXECUTED
2007ebc: c2 27 20 38 st %g1, [ %i4 + 0x38 ] <== NOT EXECUTED
2007ec0: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED
/* acquire the mutex of the current fd chain.
we don't need to lock the queue mutex since we can
add requests to idle fd chains or even active ones
if the working request has been extracted from the
chain */
result = pthread_mutex_lock (&r_chain->mutex);
2007ec4: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED
2007ec8: 40 00 03 b9 call 2008dac <pthread_mutex_lock> <== NOT EXECUTED
2007ecc: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED
if (result != 0)
2007ed0: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
2007ed4: 22 bf ff da be,a 2007e3c <rtems_aio_handle+0x38> <== NOT EXECUTED
2007ed8: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
2007edc: 81 c7 e0 08 ret
2007ee0: 91 e8 20 00 restore %g0, 0, %o0
pthread_mutex_unlock (&r_chain->mutex);
switch (req->aiocbp->aio_lio_opcode) {
case LIO_READ:
AIO_printf ("read\n");
result = pread (req->aiocbp->aio_fildes,
2007ee4: d0 07 00 00 ld [ %i4 ], %o0
2007ee8: d2 07 20 10 ld [ %i4 + 0x10 ], %o1
2007eec: d4 07 20 14 ld [ %i4 + 0x14 ], %o2
2007ef0: 96 10 00 02 mov %g2, %o3
2007ef4: 40 00 2d 57 call 2013450 <pread>
2007ef8: 98 10 00 03 mov %g3, %o4
break;
default:
result = -1;
}
if (result == -1) {
2007efc: 80 a2 3f ff cmp %o0, -1
2007f00: 22 bf ff ed be,a 2007eb4 <rtems_aio_handle+0xb0> <== NEVER TAKEN
2007f04: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 <== NOT EXECUTED
req->aiocbp->return_value = -1;
req->aiocbp->error_code = errno;
} else {
req->aiocbp->return_value = result;
2007f08: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2007f0c: d0 20 60 38 st %o0, [ %g1 + 0x38 ]
req->aiocbp->error_code = 0;
2007f10: 10 bf ff c5 b 2007e24 <rtems_aio_handle+0x20>
2007f14: c0 20 60 34 clr [ %g1 + 0x34 ]
req->aiocbp->aio_nbytes, req->aiocbp->aio_offset);
break;
case LIO_SYNC:
AIO_printf ("sync\n");
result = fsync (req->aiocbp->aio_fildes);
2007f18: 40 00 1c 3d call 200f00c <fsync> <== NOT EXECUTED
2007f1c: d0 07 00 00 ld [ %i4 ], %o0 <== NOT EXECUTED
break;
2007f20: 10 bf ff f8 b 2007f00 <rtems_aio_handle+0xfc> <== NOT EXECUTED
2007f24: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED
req->aiocbp->aio_nbytes, req->aiocbp->aio_offset);
break;
case LIO_WRITE:
AIO_printf ("write\n");
result = pwrite (req->aiocbp->aio_fildes,
2007f28: d0 07 00 00 ld [ %i4 ], %o0
2007f2c: d2 07 20 10 ld [ %i4 + 0x10 ], %o1
2007f30: d4 07 20 14 ld [ %i4 + 0x14 ], %o2
2007f34: 96 10 00 02 mov %g2, %o3
2007f38: 40 00 2d 84 call 2013548 <pwrite>
2007f3c: 98 10 00 03 mov %g3, %o4
(void *) req->aiocbp->aio_buf,
req->aiocbp->aio_nbytes, req->aiocbp->aio_offset);
break;
2007f40: 10 bf ff f0 b 2007f00 <rtems_aio_handle+0xfc>
2007f44: 80 a2 3f ff cmp %o0, -1
struct timespec timeout;
AIO_printf ("Chain is empty [WQ], wait for work\n");
pthread_mutex_unlock (&r_chain->mutex);
2007f48: 40 00 03 b9 call 2008e2c <pthread_mutex_unlock>
2007f4c: 90 10 00 1b mov %i3, %o0
pthread_mutex_lock (&aio_request_queue.mutex);
2007f50: 40 00 03 97 call 2008dac <pthread_mutex_lock>
2007f54: 90 10 00 1a mov %i2, %o0
if (rtems_chain_is_empty (chain))
2007f58: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007f5c: 80 a7 40 01 cmp %i5, %g1
2007f60: 02 80 00 05 be 2007f74 <rtems_aio_handle+0x170> <== ALWAYS TAKEN
2007f64: 92 07 bf dc add %fp, -36, %o1
}
}
/* If there was a request added in the initial fd chain then release
the mutex and process it */
pthread_mutex_unlock (&aio_request_queue.mutex);
2007f68: 40 00 03 b1 call 2008e2c <pthread_mutex_unlock>
2007f6c: 90 10 00 1a mov %i2, %o0
2007f70: 30 bf ff ad b,a 2007e24 <rtems_aio_handle+0x20>
pthread_mutex_unlock (&r_chain->mutex);
pthread_mutex_lock (&aio_request_queue.mutex);
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
2007f74: 40 00 01 d3 call 20086c0 <clock_gettime>
2007f78: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
2007f7c: c2 07 bf dc ld [ %fp + -36 ], %g1
timeout.tv_nsec = 0;
2007f80: c0 27 bf e0 clr [ %fp + -32 ]
pthread_mutex_lock (&aio_request_queue.mutex);
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
2007f84: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007f88: ba 06 20 20 add %i0, 0x20, %i5
pthread_mutex_lock (&aio_request_queue.mutex);
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
2007f8c: c2 27 bf dc st %g1, [ %fp + -36 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007f90: 90 10 00 1d mov %i5, %o0
2007f94: 92 10 00 10 mov %l0, %o1
2007f98: 40 00 02 7e call 2008990 <pthread_cond_timedwait>
2007f9c: 94 07 bf dc add %fp, -36, %o2
&aio_request_queue.mutex,
&timeout);
/* If no requests were added to the chain we delete the fd chain from
the queue and start working with idle fd chains */
if (result == ETIMEDOUT) {
2007fa0: 80 a2 20 74 cmp %o0, 0x74
2007fa4: 12 bf ff f1 bne 2007f68 <rtems_aio_handle+0x164> <== NEVER TAKEN
2007fa8: 01 00 00 00 nop
2007fac: 40 00 0a 81 call 200a9b0 <_Chain_Extract>
2007fb0: 90 10 00 18 mov %i0, %o0
rtems_chain_extract (&r_chain->next_fd);
pthread_mutex_destroy (&r_chain->mutex);
2007fb4: 40 00 02 d2 call 2008afc <pthread_mutex_destroy>
2007fb8: 90 10 00 1b mov %i3, %o0
pthread_cond_destroy (&r_chain->cond);
2007fbc: 40 00 01 f4 call 200878c <pthread_cond_destroy>
2007fc0: 90 10 00 1d mov %i5, %o0
free (r_chain);
2007fc4: 7f ff ee fa call 2003bac <free>
2007fc8: 90 10 00 18 mov %i0, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
2007fcc: f0 06 a0 54 ld [ %i2 + 0x54 ], %i0
/* If the idle chain is empty sleep for 3 seconds and wait for a
signal. The thread now becomes idle. */
if (rtems_chain_is_empty (&aio_request_queue.idle_req)) {
2007fd0: 80 a6 00 12 cmp %i0, %l2
2007fd4: 22 80 00 1d be,a 2008048 <rtems_aio_handle+0x244>
2007fd8: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2
}
}
/* Otherwise move this chain to the working chain and
start the loop all over again */
AIO_printf ("Work on idle\n");
--aio_request_queue.idle_threads;
2007fdc: c4 04 60 68 ld [ %l1 + 0x68 ], %g2
++aio_request_queue.active_threads;
2007fe0: c2 04 60 64 ld [ %l1 + 0x64 ], %g1
}
}
/* Otherwise move this chain to the working chain and
start the loop all over again */
AIO_printf ("Work on idle\n");
--aio_request_queue.idle_threads;
2007fe4: 84 00 bf ff add %g2, -1, %g2
++aio_request_queue.active_threads;
2007fe8: 82 00 60 01 inc %g1
}
}
/* Otherwise move this chain to the working chain and
start the loop all over again */
AIO_printf ("Work on idle\n");
--aio_request_queue.idle_threads;
2007fec: c4 24 60 68 st %g2, [ %l1 + 0x68 ]
++aio_request_queue.active_threads;
2007ff0: c2 24 60 64 st %g1, [ %l1 + 0x64 ]
2007ff4: 40 00 0a 6f call 200a9b0 <_Chain_Extract>
2007ff8: 90 10 00 18 mov %i0, %o0
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2007ffc: c2 04 60 48 ld [ %l1 + 0x48 ], %g1
rtems_chain_node *node;
node = rtems_chain_first (&aio_request_queue.work_req);
temp = (rtems_aio_request_chain *) node;
while (temp->fildes < r_chain->fildes &&
2008000: c6 06 20 14 ld [ %i0 + 0x14 ], %g3
2008004: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
2008008: 80 a0 c0 02 cmp %g3, %g2
200800c: 14 80 00 08 bg 200802c <rtems_aio_handle+0x228> <== ALWAYS TAKEN
2008010: 80 a0 40 19 cmp %g1, %i1
RTEMS_INLINE_ROUTINE void rtems_chain_insert(
rtems_chain_node *after_node,
rtems_chain_node *the_node
)
{
_Chain_Insert( after_node, the_node );
2008014: 10 80 00 09 b 2008038 <rtems_aio_handle+0x234> <== NOT EXECUTED
2008018: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED
200801c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
2008020: 80 a0 80 03 cmp %g2, %g3
2008024: 16 80 00 04 bge 2008034 <rtems_aio_handle+0x230>
2008028: 80 a0 40 19 cmp %g1, %i1
200802c: 32 bf ff fc bne,a 200801c <rtems_aio_handle+0x218> <== ALWAYS TAKEN
2008030: c2 00 40 00 ld [ %g1 ], %g1
2008034: d0 00 60 04 ld [ %g1 + 4 ], %o0
2008038: 92 10 00 18 mov %i0, %o1
200803c: 40 00 0a 76 call 200aa14 <_Chain_Insert>
2008040: b6 06 20 1c add %i0, 0x1c, %i3
2008044: 30 bf ff c9 b,a 2007f68 <rtems_aio_handle+0x164>
signal. The thread now becomes idle. */
if (rtems_chain_is_empty (&aio_request_queue.idle_req)) {
AIO_printf ("Chain is empty [IQ], wait for work\n");
++aio_request_queue.idle_threads;
--aio_request_queue.active_threads;
2008048: c2 06 a0 64 ld [ %i2 + 0x64 ], %g1
/* If the idle chain is empty sleep for 3 seconds and wait for a
signal. The thread now becomes idle. */
if (rtems_chain_is_empty (&aio_request_queue.idle_req)) {
AIO_printf ("Chain is empty [IQ], wait for work\n");
++aio_request_queue.idle_threads;
200804c: 84 00 a0 01 inc %g2
--aio_request_queue.active_threads;
2008050: 82 00 7f ff add %g1, -1, %g1
clock_gettime (CLOCK_REALTIME, &timeout);
2008054: 92 07 bf dc add %fp, -36, %o1
/* If the idle chain is empty sleep for 3 seconds and wait for a
signal. The thread now becomes idle. */
if (rtems_chain_is_empty (&aio_request_queue.idle_req)) {
AIO_printf ("Chain is empty [IQ], wait for work\n");
++aio_request_queue.idle_threads;
2008058: c4 26 a0 68 st %g2, [ %i2 + 0x68 ]
--aio_request_queue.active_threads;
200805c: c2 26 a0 64 st %g1, [ %i2 + 0x64 ]
clock_gettime (CLOCK_REALTIME, &timeout);
2008060: 40 00 01 98 call 20086c0 <clock_gettime>
2008064: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
2008068: c2 07 bf dc ld [ %fp + -36 ], %g1
timeout.tv_nsec = 0;
200806c: c0 27 bf e0 clr [ %fp + -32 ]
AIO_printf ("Chain is empty [IQ], wait for work\n");
++aio_request_queue.idle_threads;
--aio_request_queue.active_threads;
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
2008070: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
2008074: 90 06 a0 04 add %i2, 4, %o0
AIO_printf ("Chain is empty [IQ], wait for work\n");
++aio_request_queue.idle_threads;
--aio_request_queue.active_threads;
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
2008078: c2 27 bf dc st %g1, [ %fp + -36 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
200807c: 92 10 00 1a mov %i2, %o1
2008080: 40 00 02 44 call 2008990 <pthread_cond_timedwait>
2008084: 94 07 bf dc add %fp, -36, %o2
&aio_request_queue.mutex,
&timeout);
/* If no new fd chain was added in the idle requests
then this thread is finished */
if (result == ETIMEDOUT) {
2008088: 80 a2 20 74 cmp %o0, 0x74
200808c: 22 80 00 04 be,a 200809c <rtems_aio_handle+0x298> <== ALWAYS TAKEN
2008090: c2 06 a0 68 ld [ %i2 + 0x68 ], %g1
2008094: 10 bf ff d2 b 2007fdc <rtems_aio_handle+0x1d8> <== NOT EXECUTED
2008098: f0 06 a0 54 ld [ %i2 + 0x54 ], %i0 <== NOT EXECUTED
AIO_printf ("Etimeout\n");
--aio_request_queue.idle_threads;
pthread_mutex_unlock (&aio_request_queue.mutex);
200809c: 90 10 00 1a mov %i2, %o0
/* If no new fd chain was added in the idle requests
then this thread is finished */
if (result == ETIMEDOUT) {
AIO_printf ("Etimeout\n");
--aio_request_queue.idle_threads;
20080a0: 82 00 7f ff add %g1, -1, %g1
pthread_mutex_unlock (&aio_request_queue.mutex);
20080a4: 40 00 03 62 call 2008e2c <pthread_mutex_unlock>
20080a8: c2 26 a0 68 st %g1, [ %i2 + 0x68 ]
20080ac: 30 bf ff 8c b,a 2007edc <rtems_aio_handle+0xd8>
0200811c <rtems_aio_init>:
* 0 - if initialization succeeded
*/
int
rtems_aio_init (void)
{
200811c: 9d e3 bf a0 save %sp, -96, %sp
int result = 0;
result = pthread_attr_init (&aio_request_queue.attr);
2008120: 3b 00 80 82 sethi %hi(0x2020800), %i5
2008124: 40 00 03 9c call 2008f94 <pthread_attr_init>
2008128: 90 17 60 54 or %i5, 0x54, %o0 ! 2020854 <aio_request_queue+0x8>
if (result != 0)
200812c: b0 92 20 00 orcc %o0, 0, %i0
2008130: 12 80 00 23 bne 20081bc <rtems_aio_init+0xa0> <== NEVER TAKEN
2008134: 90 17 60 54 or %i5, 0x54, %o0
return result;
result =
2008138: 40 00 03 a3 call 2008fc4 <pthread_attr_setdetachstate>
200813c: 92 10 20 00 clr %o1
pthread_attr_setdetachstate (&aio_request_queue.attr,
PTHREAD_CREATE_DETACHED);
if (result != 0)
2008140: 80 a2 20 00 cmp %o0, 0
2008144: 12 80 00 20 bne 20081c4 <rtems_aio_init+0xa8> <== NEVER TAKEN
2008148: 39 00 80 82 sethi %hi(0x2020800), %i4
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
200814c: 92 10 20 00 clr %o1
2008150: 40 00 02 be call 2008c48 <pthread_mutex_init>
2008154: 90 17 20 4c or %i4, 0x4c, %o0
if (result != 0)
2008158: 80 a2 20 00 cmp %o0, 0
200815c: 12 80 00 23 bne 20081e8 <rtems_aio_init+0xcc> <== NEVER TAKEN
2008160: 92 10 20 00 clr %o1
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
2008164: 11 00 80 82 sethi %hi(0x2020800), %o0
2008168: 40 00 01 bf call 2008864 <pthread_cond_init>
200816c: 90 12 20 50 or %o0, 0x50, %o0 ! 2020850 <aio_request_queue+0x4>
if (result != 0) {
2008170: b0 92 20 00 orcc %o0, 0, %i0
2008174: 12 80 00 26 bne 200820c <rtems_aio_init+0xf0> <== NEVER TAKEN
2008178: 01 00 00 00 nop
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200817c: 82 17 20 4c or %i4, 0x4c, %g1
head->previous = NULL;
tail->previous = head;
2008180: 84 00 60 54 add %g1, 0x54, %g2
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2008184: ba 00 60 4c add %g1, 0x4c, %i5
head->previous = NULL;
tail->previous = head;
2008188: 88 00 60 48 add %g1, 0x48, %g4
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200818c: 86 00 60 58 add %g1, 0x58, %g3
head->previous = NULL;
tail->previous = head;
2008190: c4 20 60 5c st %g2, [ %g1 + 0x5c ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2008194: fa 20 60 48 st %i5, [ %g1 + 0x48 ]
head->previous = NULL;
2008198: c0 20 60 4c clr [ %g1 + 0x4c ]
tail->previous = head;
200819c: c8 20 60 50 st %g4, [ %g1 + 0x50 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
20081a0: c6 20 60 54 st %g3, [ %g1 + 0x54 ]
head->previous = NULL;
20081a4: c0 20 60 58 clr [ %g1 + 0x58 ]
}
rtems_chain_initialize_empty (&aio_request_queue.work_req);
rtems_chain_initialize_empty (&aio_request_queue.idle_req);
aio_request_queue.active_threads = 0;
20081a8: c0 20 60 64 clr [ %g1 + 0x64 ]
aio_request_queue.idle_threads = 0;
20081ac: c0 20 60 68 clr [ %g1 + 0x68 ]
aio_request_queue.initialized = AIO_QUEUE_INITIALIZED;
20081b0: 05 00 00 2c sethi %hi(0xb000), %g2
20081b4: 84 10 a0 0b or %g2, 0xb, %g2 ! b00b <PROM_START+0xb00b>
20081b8: c4 20 60 60 st %g2, [ %g1 + 0x60 ]
return result;
}
20081bc: 81 c7 e0 08 ret
20081c0: 81 e8 00 00 restore
result =
pthread_attr_setdetachstate (&aio_request_queue.attr,
PTHREAD_CREATE_DETACHED);
if (result != 0)
pthread_attr_destroy (&aio_request_queue.attr);
20081c4: 40 00 03 68 call 2008f64 <pthread_attr_destroy> <== NOT EXECUTED
20081c8: 90 17 60 54 or %i5, 0x54, %o0 <== NOT EXECUTED
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
20081cc: 39 00 80 82 sethi %hi(0x2020800), %i4 <== NOT EXECUTED
20081d0: 92 10 20 00 clr %o1 <== NOT EXECUTED
20081d4: 40 00 02 9d call 2008c48 <pthread_mutex_init> <== NOT EXECUTED
20081d8: 90 17 20 4c or %i4, 0x4c, %o0 <== NOT EXECUTED
if (result != 0)
20081dc: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
20081e0: 02 bf ff e1 be 2008164 <rtems_aio_init+0x48> <== NOT EXECUTED
20081e4: 92 10 20 00 clr %o1 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
20081e8: 40 00 03 5f call 2008f64 <pthread_attr_destroy> <== NOT EXECUTED
20081ec: 90 17 60 54 or %i5, 0x54, %o0 <== NOT EXECUTED
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
20081f0: 92 10 20 00 clr %o1 <== NOT EXECUTED
20081f4: 11 00 80 82 sethi %hi(0x2020800), %o0 <== NOT EXECUTED
20081f8: 40 00 01 9b call 2008864 <pthread_cond_init> <== NOT EXECUTED
20081fc: 90 12 20 50 or %o0, 0x50, %o0 ! 2020850 <aio_request_queue+0x4><== NOT EXECUTED
if (result != 0) {
2008200: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED
2008204: 22 bf ff df be,a 2008180 <rtems_aio_init+0x64> <== NOT EXECUTED
2008208: 82 17 20 4c or %i4, 0x4c, %g1 <== NOT EXECUTED
pthread_mutex_destroy (&aio_request_queue.mutex);
200820c: 40 00 02 3c call 2008afc <pthread_mutex_destroy> <== NOT EXECUTED
2008210: 90 17 20 4c or %i4, 0x4c, %o0 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
2008214: 40 00 03 54 call 2008f64 <pthread_attr_destroy> <== NOT EXECUTED
2008218: 90 17 60 54 or %i5, 0x54, %o0 <== NOT EXECUTED
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200821c: 10 bf ff d9 b 2008180 <rtems_aio_init+0x64> <== NOT EXECUTED
2008220: 82 17 20 4c or %i4, 0x4c, %g1 <== NOT EXECUTED
020080b0 <rtems_aio_insert_prio>:
20080b0: c2 02 00 00 ld [ %o0 ], %g1
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
20080b4: 88 02 20 04 add %o0, 4, %g4
rtems_chain_node *node;
AIO_printf ("FD exists \n");
node = rtems_chain_first (chain);
if (rtems_chain_is_empty (chain)) {
20080b8: 80 a0 40 04 cmp %g1, %g4
20080bc: 02 80 00 15 be 2008110 <rtems_aio_insert_prio+0x60> <== NEVER TAKEN
20080c0: 9a 10 00 09 mov %o1, %o5
rtems_chain_prepend (chain, &req->next_prio);
} else {
AIO_printf ("Add by priority \n");
int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
while (req->aiocbp->aio_reqprio > prio &&
20080c4: c6 02 60 14 ld [ %o1 + 0x14 ], %g3
if (rtems_chain_is_empty (chain)) {
AIO_printf ("First in chain \n");
rtems_chain_prepend (chain, &req->next_prio);
} else {
AIO_printf ("Add by priority \n");
int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
20080c8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
while (req->aiocbp->aio_reqprio > prio &&
20080cc: c6 00 e0 18 ld [ %g3 + 0x18 ], %g3
20080d0: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2
20080d4: 80 a0 80 03 cmp %g2, %g3
20080d8: 26 80 00 07 bl,a 20080f4 <rtems_aio_insert_prio+0x44> <== NEVER TAKEN
20080dc: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
20080e0: 10 80 00 0b b 200810c <rtems_aio_insert_prio+0x5c>
20080e4: d0 00 60 04 ld [ %g1 + 4 ], %o0
20080e8: 22 80 00 09 be,a 200810c <rtems_aio_insert_prio+0x5c> <== NOT EXECUTED
20080ec: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next(
Chain_Node *the_node
)
{
return the_node->next;
20080f0: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
!rtems_chain_is_tail (chain, node)) {
node = rtems_chain_next (node);
prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
20080f4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 <== NOT EXECUTED
rtems_chain_prepend (chain, &req->next_prio);
} else {
AIO_printf ("Add by priority \n");
int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
while (req->aiocbp->aio_reqprio > prio &&
20080f8: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 <== NOT EXECUTED
20080fc: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED
2008100: 06 bf ff fa bl 20080e8 <rtems_aio_insert_prio+0x38> <== NOT EXECUTED
2008104: 80 a1 00 01 cmp %g4, %g1 <== NOT EXECUTED
2008108: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED
200810c: 92 10 00 0d mov %o5, %o1
2008110: 82 13 c0 00 mov %o7, %g1
2008114: 40 00 0a 40 call 200aa14 <_Chain_Insert>
2008118: 9e 10 40 00 mov %g1, %o7
020082f8 <rtems_aio_remove_fd>:
* Output parameters:
* NONE
*/
void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain)
{
20082f8: 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;
20082fc: fa 06 20 08 ld [ %i0 + 8 ], %i5
RTEMS_INLINE_ROUTINE bool _Chain_Is_tail(
const Chain_Control *the_chain,
const Chain_Node *the_node
)
{
return (the_node == _Chain_Immutable_tail( the_chain ));
2008300: b0 06 20 0c add %i0, 0xc, %i0
rtems_chain_control *chain;
rtems_chain_node *node;
chain = &r_chain->perfd;
node = rtems_chain_first (chain);
while (!rtems_chain_is_tail (chain, node))
2008304: 80 a7 40 18 cmp %i5, %i0
2008308: 02 80 00 0e be 2008340 <rtems_aio_remove_fd+0x48> <== NEVER TAKEN
200830c: b6 10 20 8c mov 0x8c, %i3
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2008310: 40 00 09 a8 call 200a9b0 <_Chain_Extract>
2008314: 90 10 00 1d mov %i5, %o0
{
rtems_chain_extract (node);
rtems_aio_request *req = (rtems_aio_request *) node;
node = rtems_chain_next (node);
req->aiocbp->error_code = ECANCELED;
2008318: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next(
Chain_Node *the_node
)
{
return the_node->next;
200831c: f8 07 40 00 ld [ %i5 ], %i4
req->aiocbp->return_value = -1;
2008320: 84 10 3f ff mov -1, %g2
free (req);
2008324: 90 10 00 1d mov %i5, %o0
while (!rtems_chain_is_tail (chain, node))
{
rtems_chain_extract (node);
rtems_aio_request *req = (rtems_aio_request *) node;
node = rtems_chain_next (node);
req->aiocbp->error_code = ECANCELED;
2008328: f6 20 60 34 st %i3, [ %g1 + 0x34 ]
req->aiocbp->return_value = -1;
free (req);
200832c: 7f ff ee 20 call 2003bac <free>
2008330: c4 20 60 38 st %g2, [ %g1 + 0x38 ]
rtems_chain_control *chain;
rtems_chain_node *node;
chain = &r_chain->perfd;
node = rtems_chain_first (chain);
while (!rtems_chain_is_tail (chain, node))
2008334: 80 a7 00 18 cmp %i4, %i0
2008338: 12 bf ff f6 bne 2008310 <rtems_aio_remove_fd+0x18>
200833c: ba 10 00 1c mov %i4, %i5
2008340: 81 c7 e0 08 ret
2008344: 81 e8 00 00 restore
02008348 <rtems_aio_remove_req>:
* AIO_NOTCANCELED - if request was not canceled
* AIO_CANCELED - if request was canceled
*/
int rtems_aio_remove_req (rtems_chain_control *chain, struct aiocb *aiocbp)
{
2008348: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200834c: 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 );
2008350: 84 06 20 04 add %i0, 4, %g2
if (rtems_chain_is_empty (chain))
2008354: 80 a7 40 02 cmp %i5, %g2
2008358: 12 80 00 06 bne 2008370 <rtems_aio_remove_req+0x28>
200835c: b0 10 20 02 mov 2, %i0
2008360: 30 80 00 12 b,a 20083a8 <rtems_aio_remove_req+0x60>
rtems_chain_node *node = rtems_chain_first (chain);
rtems_aio_request *current;
current = (rtems_aio_request *) node;
while (!rtems_chain_is_tail (chain, node) && current->aiocbp != aiocbp) {
2008364: 80 a0 80 1d cmp %g2, %i5 <== NOT EXECUTED
2008368: 02 80 00 12 be 20083b0 <rtems_aio_remove_req+0x68> <== NOT EXECUTED
200836c: 01 00 00 00 nop <== NOT EXECUTED
2008370: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2008374: 80 a0 40 19 cmp %g1, %i1
2008378: 32 bf ff fb bne,a 2008364 <rtems_aio_remove_req+0x1c> <== NEVER TAKEN
200837c: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED
2008380: 40 00 09 8c call 200a9b0 <_Chain_Extract>
2008384: 90 10 00 1d mov %i5, %o0
if (rtems_chain_is_tail (chain, node))
return AIO_NOTCANCELED;
else
{
rtems_chain_extract (node);
current->aiocbp->error_code = ECANCELED;
2008388: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
current->aiocbp->return_value = -1;
200838c: 84 10 3f ff mov -1, %g2
2008390: c4 20 60 38 st %g2, [ %g1 + 0x38 ]
if (rtems_chain_is_tail (chain, node))
return AIO_NOTCANCELED;
else
{
rtems_chain_extract (node);
current->aiocbp->error_code = ECANCELED;
2008394: 84 10 20 8c mov 0x8c, %g2
current->aiocbp->return_value = -1;
free (current);
2008398: 90 10 00 1d mov %i5, %o0
if (rtems_chain_is_tail (chain, node))
return AIO_NOTCANCELED;
else
{
rtems_chain_extract (node);
current->aiocbp->error_code = ECANCELED;
200839c: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
current->aiocbp->return_value = -1;
free (current);
20083a0: 7f ff ee 03 call 2003bac <free>
20083a4: b0 10 20 00 clr %i0
}
return AIO_CANCELED;
}
20083a8: 81 c7 e0 08 ret
20083ac: 81 e8 00 00 restore
node = rtems_chain_next (node);
current = (rtems_aio_request *) node;
}
if (rtems_chain_is_tail (chain, node))
return AIO_NOTCANCELED;
20083b0: 81 c7 e0 08 ret <== NOT EXECUTED
20083b4: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED
020087d4 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
20087d4: 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 );
20087d8: 40 00 01 b3 call 2008ea4 <_Chain_Get>
20087dc: 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(
20087e0: 92 10 20 00 clr %o1
20087e4: ba 10 00 08 mov %o0, %i5
20087e8: 94 10 00 1a mov %i2, %o2
20087ec: 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
20087f0: 80 a7 60 00 cmp %i5, 0
20087f4: 12 80 00 0a bne 200881c <rtems_chain_get_with_wait+0x48>
20087f8: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
20087fc: 7f ff fc df call 2007b78 <rtems_event_receive>
2008800: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
2008804: 80 a2 20 00 cmp %o0, 0
2008808: 02 bf ff f4 be 20087d8 <rtems_chain_get_with_wait+0x4> <== NEVER TAKEN
200880c: 01 00 00 00 nop
timeout,
&out
);
}
*node_ptr = node;
2008810: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
2008814: 81 c7 e0 08 ret
2008818: 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
200881c: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
2008820: fa 26 c0 00 st %i5, [ %i3 ]
return sc;
}
2008824: 81 c7 e0 08 ret
2008828: 91 e8 00 08 restore %g0, %o0, %o0
02011e4c <rtems_event_system_receive>:
rtems_event_set event_in,
rtems_option option_set,
rtems_interval ticks,
rtems_event_set *event_out
)
{
2011e4c: 9d e3 bf 98 save %sp, -104, %sp
rtems_status_code sc;
if ( event_out != NULL ) {
2011e50: 80 a6 e0 00 cmp %i3, 0
2011e54: 02 80 00 0a be 2011e7c <rtems_event_system_receive+0x30> <== NEVER TAKEN
2011e58: 82 10 20 09 mov 9, %g1
Thread_Control *executing = _Thread_Executing;
2011e5c: 03 00 80 8b sethi %hi(0x2022c00), %g1
2011e60: fa 00 63 e0 ld [ %g1 + 0x3e0 ], %i5 ! 2022fe0 <_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 ) ) {
2011e64: 80 a6 20 00 cmp %i0, 0
2011e68: 12 80 00 07 bne 2011e84 <rtems_event_system_receive+0x38> <== ALWAYS TAKEN
2011e6c: da 07 61 58 ld [ %i5 + 0x158 ], %o5
);
_Thread_Enable_dispatch();
sc = executing->Wait.return_code;
} else {
*event_out = event->pending_events;
2011e70: c4 03 60 04 ld [ %o5 + 4 ], %g2 <== NOT EXECUTED
sc = RTEMS_SUCCESSFUL;
2011e74: 82 10 20 00 clr %g1 <== NOT EXECUTED
);
_Thread_Enable_dispatch();
sc = executing->Wait.return_code;
} else {
*event_out = event->pending_events;
2011e78: c4 26 c0 00 st %g2, [ %i3 ] <== NOT EXECUTED
} else {
sc = RTEMS_INVALID_ADDRESS;
}
return sc;
}
2011e7c: 81 c7 e0 08 ret <== NOT EXECUTED
2011e80: 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;
2011e84: 03 00 80 8a sethi %hi(0x2022800), %g1
2011e88: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 2022ab0 <_Thread_Dispatch_disable_level>
++level;
2011e8c: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2011e90: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ]
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(
2011e94: 03 00 01 00 sethi %hi(0x40000), %g1
2011e98: 90 10 00 18 mov %i0, %o0
2011e9c: 92 10 00 19 mov %i1, %o1
2011ea0: 94 10 00 1a mov %i2, %o2
2011ea4: 96 10 00 1b mov %i3, %o3
2011ea8: 98 10 00 1d mov %i5, %o4
2011eac: 9a 03 60 04 add %o5, 4, %o5
2011eb0: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2011eb4: 03 00 80 8c sethi %hi(0x2023000), %g1
2011eb8: 82 10 63 d0 or %g1, 0x3d0, %g1 ! 20233d0 <_System_event_Sync_state>
2011ebc: 7f ff da a5 call 2008950 <_Event_Seize>
2011ec0: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
executing,
event,
&_System_event_Sync_state,
STATES_WAITING_FOR_SYSTEM_EVENT
);
_Thread_Enable_dispatch();
2011ec4: 7f ff e6 cf call 200ba00 <_Thread_Enable_dispatch>
2011ec8: 01 00 00 00 nop
sc = executing->Wait.return_code;
2011ecc: c2 07 60 34 ld [ %i5 + 0x34 ], %g1
} else {
sc = RTEMS_INVALID_ADDRESS;
}
return sc;
}
2011ed0: 81 c7 e0 08 ret
2011ed4: 91 e8 00 01 restore %g0, %g1, %o0
02007d48 <rtems_event_system_send>:
rtems_status_code rtems_event_system_send(
rtems_id id,
rtems_event_set event_in
)
{
2007d48: 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 );
2007d4c: 90 10 00 18 mov %i0, %o0
2007d50: 40 00 0a 96 call 200a7a8 <_Thread_Get>
2007d54: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2007d58: c2 07 bf fc ld [ %fp + -4 ], %g1
2007d5c: 80 a0 60 00 cmp %g1, 0
2007d60: 12 80 00 0d bne 2007d94 <rtems_event_system_send+0x4c> <== NEVER TAKEN
2007d64: 92 10 00 19 mov %i1, %o1
case OBJECTS_LOCAL:
api = thread->API_Extensions[ THREAD_API_RTEMS ];
_Event_Surrender(
2007d68: d4 02 21 58 ld [ %o0 + 0x158 ], %o2
2007d6c: 94 02 a0 04 add %o2, 4, %o2
2007d70: 19 00 01 00 sethi %hi(0x40000), %o4
2007d74: 17 00 80 7b sethi %hi(0x201ec00), %o3
2007d78: 96 12 e0 40 or %o3, 0x40, %o3 ! 201ec40 <_System_event_Sync_state>
2007d7c: 7f ff fe 54 call 20076cc <_Event_Surrender>
2007d80: b0 10 20 00 clr %i0
event_in,
&api->System_event,
&_System_event_Sync_state,
STATES_WAITING_FOR_SYSTEM_EVENT
);
_Thread_Enable_dispatch();
2007d84: 40 00 0a 7d call 200a778 <_Thread_Enable_dispatch>
2007d88: 01 00 00 00 nop
sc = RTEMS_SUCCESSFUL;
break;
2007d8c: 81 c7 e0 08 ret
2007d90: 81 e8 00 00 restore
sc = RTEMS_INVALID_ID;
break;
}
return sc;
}
2007d94: 81 c7 e0 08 ret <== NOT EXECUTED
2007d98: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED
020097a8 <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
)
{
20097a8: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
20097ac: 03 00 80 8b sethi %hi(0x2022c00), %g1
20097b0: c4 00 63 d8 ld [ %g1 + 0x3d8 ], %g2 ! 2022fd8 <_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
)
{
20097b4: ba 10 00 18 mov %i0, %i5
rtems_device_major_number major_limit = _IO_Number_of_drivers;
20097b8: 03 00 80 8d sethi %hi(0x2023400), %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
)
{
20097bc: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
20097c0: c8 00 60 18 ld [ %g1 + 0x18 ], %g4
if ( rtems_interrupt_is_in_progress() )
20097c4: 80 a0 a0 00 cmp %g2, 0
20097c8: 12 80 00 1f bne 2009844 <rtems_io_register_driver+0x9c>
20097cc: b0 10 20 12 mov 0x12, %i0
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
20097d0: 80 a6 a0 00 cmp %i2, 0
20097d4: 02 80 00 21 be 2009858 <rtems_io_register_driver+0xb0>
20097d8: 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 )
20097dc: 02 80 00 1f be 2009858 <rtems_io_register_driver+0xb0>
20097e0: 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;
20097e4: c4 06 40 00 ld [ %i1 ], %g2
20097e8: 80 a0 a0 00 cmp %g2, 0
20097ec: 22 80 00 18 be,a 200984c <rtems_io_register_driver+0xa4>
20097f0: 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 )
20097f4: 80 a1 00 1d cmp %g4, %i5
20097f8: 08 80 00 13 bleu 2009844 <rtems_io_register_driver+0x9c>
20097fc: 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;
2009800: 05 00 80 8a sethi %hi(0x2022800), %g2
2009804: c8 00 a2 b0 ld [ %g2 + 0x2b0 ], %g4 ! 2022ab0 <_Thread_Dispatch_disable_level>
++level;
2009808: 88 01 20 01 inc %g4
_Thread_Dispatch_disable_level = level;
200980c: c8 20 a2 b0 st %g4, [ %g2 + 0x2b0 ]
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
2009810: 80 a7 60 00 cmp %i5, 0
2009814: 02 80 00 13 be 2009860 <rtems_io_register_driver+0xb8>
2009818: 39 00 80 8d sethi %hi(0x2023400), %i4
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
200981c: c8 07 20 1c ld [ %i4 + 0x1c ], %g4 ! 202341c <_IO_Driver_address_table>
2009820: 85 2f 60 03 sll %i5, 3, %g2
2009824: b7 2f 60 05 sll %i5, 5, %i3
2009828: 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;
200982c: f2 01 00 01 ld [ %g4 + %g1 ], %i1
2009830: 80 a6 60 00 cmp %i1, 0
2009834: 02 80 00 3a be 200991c <rtems_io_register_driver+0x174>
2009838: 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();
200983c: 40 00 08 71 call 200ba00 <_Thread_Enable_dispatch>
2009840: b0 10 20 0c mov 0xc, %i0
return RTEMS_RESOURCE_IN_USE;
2009844: 81 c7 e0 08 ret
2009848: 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;
200984c: 80 a0 a0 00 cmp %g2, 0
2009850: 12 bf ff ea bne 20097f8 <rtems_io_register_driver+0x50>
2009854: 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;
2009858: 81 c7 e0 08 ret
200985c: 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;
2009860: c8 00 60 18 ld [ %g1 + 0x18 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2009864: 80 a1 20 00 cmp %g4, 0
2009868: 02 80 00 33 be 2009934 <rtems_io_register_driver+0x18c> <== NEVER TAKEN
200986c: c2 07 20 1c ld [ %i4 + 0x1c ], %g1
2009870: 30 80 00 04 b,a 2009880 <rtems_io_register_driver+0xd8>
2009874: 80 a7 40 04 cmp %i5, %g4
2009878: 02 80 00 24 be 2009908 <rtems_io_register_driver+0x160>
200987c: 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;
2009880: c4 00 40 00 ld [ %g1 ], %g2
2009884: 80 a0 a0 00 cmp %g2, 0
2009888: 32 bf ff fb bne,a 2009874 <rtems_io_register_driver+0xcc>
200988c: ba 07 60 01 inc %i5
2009890: c4 00 60 04 ld [ %g1 + 4 ], %g2
2009894: 80 a0 a0 00 cmp %g2, 0
2009898: 32 bf ff f7 bne,a 2009874 <rtems_io_register_driver+0xcc>
200989c: ba 07 60 01 inc %i5
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
20098a0: fa 26 80 00 st %i5, [ %i2 ]
20098a4: 85 2f 60 03 sll %i5, 3, %g2
if ( m != n )
20098a8: 80 a1 00 1d cmp %g4, %i5
20098ac: 02 80 00 18 be 200990c <rtems_io_register_driver+0x164> <== NEVER TAKEN
20098b0: b7 2f 60 05 sll %i5, 5, %i3
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
20098b4: c8 00 c0 00 ld [ %g3 ], %g4
20098b8: c2 07 20 1c ld [ %i4 + 0x1c ], %g1
20098bc: 84 26 c0 02 sub %i3, %g2, %g2
20098c0: c8 20 40 02 st %g4, [ %g1 + %g2 ]
20098c4: c8 00 e0 04 ld [ %g3 + 4 ], %g4
20098c8: 82 00 40 02 add %g1, %g2, %g1
20098cc: c8 20 60 04 st %g4, [ %g1 + 4 ]
20098d0: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
20098d4: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
20098d8: c4 20 60 08 st %g2, [ %g1 + 8 ]
20098dc: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
20098e0: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
20098e4: c4 20 60 0c st %g2, [ %g1 + 0xc ]
20098e8: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
20098ec: b0 10 00 1d mov %i5, %i0
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
20098f0: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
20098f4: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
20098f8: 40 00 08 42 call 200ba00 <_Thread_Enable_dispatch>
20098fc: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
2009900: 40 00 22 81 call 2012304 <rtems_io_initialize>
2009904: 81 e8 00 00 restore
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2009908: 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();
200990c: 40 00 08 3d call 200ba00 <_Thread_Enable_dispatch>
2009910: b0 10 20 05 mov 5, %i0
return sc;
2009914: 81 c7 e0 08 ret
2009918: 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;
200991c: c2 00 60 04 ld [ %g1 + 4 ], %g1
2009920: 80 a0 60 00 cmp %g1, 0
2009924: 12 bf ff c6 bne 200983c <rtems_io_register_driver+0x94>
2009928: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
200992c: 10 bf ff e2 b 20098b4 <rtems_io_register_driver+0x10c>
2009930: fa 26 80 00 st %i5, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2009934: 10 bf ff f6 b 200990c <rtems_io_register_driver+0x164> <== NOT EXECUTED
2009938: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
0200a934 <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)
{
200a934: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
200a938: 80 a6 20 00 cmp %i0, 0
200a93c: 02 80 00 20 be 200a9bc <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
200a940: 37 00 80 83 sethi %hi(0x2020c00), %i3
200a944: b6 16 e2 a8 or %i3, 0x2a8, %i3 ! 2020ea8 <_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)
200a948: b4 06 e0 0c add %i3, 0xc, %i2
#if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG)
if ( !_Objects_Information_table[ api_index ] )
continue;
#endif
information = _Objects_Information_table[ api_index ][ 1 ];
200a94c: c2 06 c0 00 ld [ %i3 ], %g1
200a950: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
200a954: 80 a7 20 00 cmp %i4, 0
200a958: 22 80 00 16 be,a 200a9b0 <rtems_iterate_over_all_threads+0x7c>
200a95c: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
200a960: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
200a964: 86 90 60 00 orcc %g1, 0, %g3
200a968: 22 80 00 12 be,a 200a9b0 <rtems_iterate_over_all_threads+0x7c>
200a96c: b6 06 e0 04 add %i3, 4, %i3
200a970: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
200a974: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
200a978: 83 2f 60 02 sll %i5, 2, %g1
200a97c: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_thread )
200a980: 90 90 60 00 orcc %g1, 0, %o0
200a984: 02 80 00 05 be 200a998 <rtems_iterate_over_all_threads+0x64>
200a988: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
200a98c: 9f c6 00 00 call %i0
200a990: 01 00 00 00 nop
200a994: 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++ ) {
200a998: 83 28 e0 10 sll %g3, 0x10, %g1
200a99c: 83 30 60 10 srl %g1, 0x10, %g1
200a9a0: 80 a0 40 1d cmp %g1, %i5
200a9a4: 3a bf ff f5 bcc,a 200a978 <rtems_iterate_over_all_threads+0x44>
200a9a8: c4 07 20 1c ld [ %i4 + 0x1c ], %g2
200a9ac: 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++ ) {
200a9b0: 80 a6 c0 1a cmp %i3, %i2
200a9b4: 32 bf ff e7 bne,a 200a950 <rtems_iterate_over_all_threads+0x1c>
200a9b8: c2 06 c0 00 ld [ %i3 ], %g1
200a9bc: 81 c7 e0 08 ret
200a9c0: 81 e8 00 00 restore
0200953c <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
)
{
200953c: 9d e3 bf a0 save %sp, -96, %sp
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
2009540: 80 a6 a0 00 cmp %i2, 0
2009544: 02 80 00 21 be 20095c8 <rtems_object_get_class_information+0x8c>
2009548: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
200954c: 93 2e 60 10 sll %i1, 0x10, %o1
2009550: 90 10 00 18 mov %i0, %o0
2009554: 40 00 07 cc call 200b484 <_Objects_Get_information>
2009558: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
200955c: 80 a2 20 00 cmp %o0, 0
2009560: 02 80 00 1a be 20095c8 <rtems_object_get_class_information+0x8c>
2009564: 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;
2009568: 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;
200956c: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
2009570: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
2009574: 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;
2009578: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
200957c: c4 26 a0 04 st %g2, [ %i2 + 4 ]
info->auto_extend = obj_info->auto_extend;
2009580: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
2009584: 80 a1 20 00 cmp %g4, 0
2009588: 02 80 00 12 be 20095d0 <rtems_object_get_class_information+0x94><== NEVER TAKEN
200958c: c8 26 a0 08 st %g4, [ %i2 + 8 ]
2009590: fa 02 20 1c ld [ %o0 + 0x1c ], %i5
2009594: 86 10 20 01 mov 1, %g3
2009598: 82 10 20 01 mov 1, %g1
200959c: 84 10 20 00 clr %g2
if ( !obj_info->local_table[i] )
20095a0: 87 28 e0 02 sll %g3, 2, %g3
20095a4: 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++ )
20095a8: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
20095ac: 80 a0 00 03 cmp %g0, %g3
20095b0: 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++ )
20095b4: 80 a1 00 01 cmp %g4, %g1
20095b8: 1a bf ff fa bcc 20095a0 <rtems_object_get_class_information+0x64>
20095bc: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
20095c0: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
20095c4: 82 10 20 00 clr %g1
}
20095c8: 81 c7 e0 08 ret
20095cc: 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++ )
20095d0: 84 10 20 00 clr %g2 <== NOT EXECUTED
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
return RTEMS_SUCCESSFUL;
20095d4: 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;
20095d8: 10 bf ff fc b 20095c8 <rtems_object_get_class_information+0x8c><== NOT EXECUTED
20095dc: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] <== NOT EXECUTED
02008fd8 <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
2008fd8: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2008fdc: 80 a6 20 00 cmp %i0, 0
2008fe0: 12 80 00 04 bne 2008ff0 <rtems_partition_create+0x18>
2008fe4: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2008fe8: 81 c7 e0 08 ret
2008fec: 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 )
2008ff0: 80 a6 60 00 cmp %i1, 0
2008ff4: 02 bf ff fd be 2008fe8 <rtems_partition_create+0x10>
2008ff8: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2008ffc: 80 a7 60 00 cmp %i5, 0
2009000: 02 bf ff fa be 2008fe8 <rtems_partition_create+0x10> <== NEVER TAKEN
2009004: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2009008: 02 bf ff f8 be 2008fe8 <rtems_partition_create+0x10>
200900c: 82 10 20 08 mov 8, %g1
2009010: 80 a6 a0 00 cmp %i2, 0
2009014: 02 bf ff f5 be 2008fe8 <rtems_partition_create+0x10>
2009018: 80 a6 80 1b cmp %i2, %i3
200901c: 0a bf ff f3 bcs 2008fe8 <rtems_partition_create+0x10>
2009020: 80 8e e0 07 btst 7, %i3
2009024: 12 bf ff f1 bne 2008fe8 <rtems_partition_create+0x10>
2009028: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
200902c: 12 bf ff ef bne 2008fe8 <rtems_partition_create+0x10>
2009030: 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;
2009034: 03 00 80 8b sethi %hi(0x2022c00), %g1
2009038: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
++level;
200903c: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2009040: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
* 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 );
2009044: 23 00 80 8a sethi %hi(0x2022800), %l1
2009048: 40 00 07 6f call 200ae04 <_Objects_Allocate>
200904c: 90 14 63 cc or %l1, 0x3cc, %o0 ! 2022bcc <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2009050: a0 92 20 00 orcc %o0, 0, %l0
2009054: 02 80 00 1a be 20090bc <rtems_partition_create+0xe4>
2009058: 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;
200905c: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
2009060: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
2009064: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
2009068: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
200906c: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
2009070: 40 00 48 32 call 201b138 <.udiv>
2009074: 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,
2009078: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
200907c: 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,
2009080: 96 10 00 1b mov %i3, %o3
2009084: b8 04 20 24 add %l0, 0x24, %i4
2009088: 40 00 04 a5 call 200a31c <_Chain_Initialize>
200908c: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2009090: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2009094: a2 14 63 cc or %l1, 0x3cc, %l1
2009098: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
200909c: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20090a0: 85 28 a0 02 sll %g2, 2, %g2
20090a4: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
20090a8: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
20090ac: 40 00 0c d9 call 200c410 <_Thread_Enable_dispatch>
20090b0: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
20090b4: 10 bf ff cd b 2008fe8 <rtems_partition_create+0x10>
20090b8: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
20090bc: 40 00 0c d5 call 200c410 <_Thread_Enable_dispatch>
20090c0: 01 00 00 00 nop
return RTEMS_TOO_MANY;
20090c4: 10 bf ff c9 b 2008fe8 <rtems_partition_create+0x10>
20090c8: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
020157b0 <rtems_partition_return_buffer>:
rtems_status_code rtems_partition_return_buffer(
rtems_id id,
void *buffer
)
{
20157b0: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Partition_Control *)
20157b4: 11 00 80 f1 sethi %hi(0x203c400), %o0
20157b8: 92 10 00 18 mov %i0, %o1
20157bc: 90 12 23 2c or %o0, 0x32c, %o0
20157c0: 40 00 15 26 call 201ac58 <_Objects_Get>
20157c4: 94 07 bf fc add %fp, -4, %o2
register Partition_Control *the_partition;
Objects_Locations location;
the_partition = _Partition_Get( id, &location );
switch ( location ) {
20157c8: c2 07 bf fc ld [ %fp + -4 ], %g1
20157cc: 80 a0 60 00 cmp %g1, 0
20157d0: 12 80 00 19 bne 2015834 <rtems_partition_return_buffer+0x84>
20157d4: ba 10 00 08 mov %o0, %i5
)
{
void *starting;
void *ending;
starting = the_partition->starting_address;
20157d8: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
20157dc: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
20157e0: 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 ) &&
20157e4: 80 a6 40 01 cmp %i1, %g1
20157e8: 18 80 00 15 bgu 201583c <rtems_partition_return_buffer+0x8c><== NEVER TAKEN
20157ec: 80 a6 40 08 cmp %i1, %o0
20157f0: 0a 80 00 13 bcs 201583c <rtems_partition_return_buffer+0x8c>
20157f4: 01 00 00 00 nop
offset = (uint32_t) _Addresses_Subtract(
the_buffer,
the_partition->starting_address
);
return ((offset % the_partition->buffer_size) == 0);
20157f8: d2 07 60 18 ld [ %i5 + 0x18 ], %o1
20157fc: 40 00 5a c2 call 202c304 <.urem>
2015800: 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 ) &&
2015804: 80 a2 20 00 cmp %o0, 0
2015808: 12 80 00 0d bne 201583c <rtems_partition_return_buffer+0x8c>
201580c: 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 );
2015810: 40 00 0d 11 call 2018c54 <_Chain_Append>
2015814: 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;
2015818: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
201581c: 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;
2015820: 82 00 7f ff add %g1, -1, %g1
_Thread_Enable_dispatch();
2015824: 40 00 19 27 call 201bcc0 <_Thread_Enable_dispatch>
2015828: c2 27 60 20 st %g1, [ %i5 + 0x20 ]
201582c: 81 c7 e0 08 ret
2015830: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2015834: 81 c7 e0 08 ret
2015838: 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();
201583c: 40 00 19 21 call 201bcc0 <_Thread_Enable_dispatch>
2015840: b0 10 20 09 mov 9, %i0
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015844: 81 c7 e0 08 ret
2015848: 81 e8 00 00 restore
020381b4 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
20381b4: 9d e3 bf 98 save %sp, -104, %sp
20381b8: 11 00 81 9f sethi %hi(0x2067c00), %o0
20381bc: 92 10 00 18 mov %i0, %o1
20381c0: 90 12 22 44 or %o0, 0x244, %o0
20381c4: 7f ff 44 ae call 200947c <_Objects_Get>
20381c8: 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 ) {
20381cc: c2 07 bf fc ld [ %fp + -4 ], %g1
20381d0: 80 a0 60 00 cmp %g1, 0
20381d4: 12 80 00 0d bne 2038208 <rtems_rate_monotonic_period+0x54>
20381d8: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
20381dc: 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 );
20381e0: 39 00 81 9e sethi %hi(0x2067800), %i4
20381e4: b8 17 20 80 or %i4, 0x80, %i4 ! 2067880 <_Per_CPU_Information>
20381e8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
20381ec: 80 a0 80 01 cmp %g2, %g1
20381f0: 02 80 00 08 be 2038210 <rtems_rate_monotonic_period+0x5c>
20381f4: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
20381f8: 7f ff 48 8f call 200a434 <_Thread_Enable_dispatch>
20381fc: b0 10 20 17 mov 0x17, %i0
2038200: 81 c7 e0 08 ret
2038204: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2038208: 81 c7 e0 08 ret
203820c: 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 ) {
2038210: 12 80 00 0e bne 2038248 <rtems_rate_monotonic_period+0x94>
2038214: 01 00 00 00 nop
switch ( the_period->state ) {
2038218: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
203821c: 80 a0 60 04 cmp %g1, 4
2038220: 18 80 00 06 bgu 2038238 <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
2038224: b0 10 20 00 clr %i0
2038228: 83 28 60 02 sll %g1, 2, %g1
203822c: 05 00 81 84 sethi %hi(0x2061000), %g2
2038230: 84 10 a0 a8 or %g2, 0xa8, %g2 ! 20610a8 <CSWTCH.24>
2038234: f0 00 80 01 ld [ %g2 + %g1 ], %i0
id,
NULL
);
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2038238: 7f ff 48 7f call 200a434 <_Thread_Enable_dispatch>
203823c: 01 00 00 00 nop
2038240: 81 c7 e0 08 ret
2038244: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
2038248: 7f ff 28 65 call 20023dc <sparc_disable_interrupts>
203824c: 01 00 00 00 nop
2038250: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
2038254: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
2038258: 80 a6 e0 00 cmp %i3, 0
203825c: 02 80 00 1c be 20382cc <rtems_rate_monotonic_period+0x118>
2038260: 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 ) {
2038264: 02 80 00 2e be 203831c <rtems_rate_monotonic_period+0x168>
2038268: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
203826c: 12 bf ff e5 bne 2038200 <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
2038270: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
2038274: 7f ff ff 5e call 2037fec <_Rate_monotonic_Update_statistics>
2038278: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
203827c: 7f ff 28 5c call 20023ec <sparc_enable_interrupts>
2038280: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2038284: 82 10 20 02 mov 2, %g1
2038288: 92 07 60 10 add %i5, 0x10, %o1
203828c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
2038290: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2038294: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2038298: 11 00 81 9c sethi %hi(0x2067000), %o0
203829c: 7f ff 4b b8 call 200b17c <_Watchdog_Insert>
20382a0: 90 12 23 fc or %o0, 0x3fc, %o0 ! 20673fc <_Watchdog_Ticks_chain>
20382a4: d0 07 60 40 ld [ %i5 + 0x40 ], %o0
20382a8: d2 07 60 3c ld [ %i5 + 0x3c ], %o1
20382ac: 03 00 81 8c sethi %hi(0x2063000), %g1
20382b0: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 ! 2063024 <_Scheduler+0x34>
20382b4: 9f c0 40 00 call %g1
20382b8: 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();
20382bc: 7f ff 48 5e call 200a434 <_Thread_Enable_dispatch>
20382c0: 01 00 00 00 nop
20382c4: 81 c7 e0 08 ret
20382c8: 81 e8 00 00 restore
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
20382cc: 7f ff 28 48 call 20023ec <sparc_enable_interrupts>
20382d0: 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 );
20382d4: 90 10 00 1d mov %i5, %o0
20382d8: 7f ff ff 94 call 2038128 <_Rate_monotonic_Initiate_statistics>
20382dc: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
the_period->state = RATE_MONOTONIC_ACTIVE;
20382e0: 82 10 20 02 mov 2, %g1
20382e4: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20382e8: 03 00 80 e0 sethi %hi(0x2038000), %g1
20382ec: 82 10 63 90 or %g1, 0x390, %g1 ! 2038390 <_Rate_monotonic_Timeout>
the_watchdog->id = id;
20382f0: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20382f4: 92 07 60 10 add %i5, 0x10, %o1
20382f8: 11 00 81 9c sethi %hi(0x2067000), %o0
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20382fc: c0 27 60 18 clr [ %i5 + 0x18 ]
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2038300: 90 12 23 fc or %o0, 0x3fc, %o0
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
2038304: c0 27 60 34 clr [ %i5 + 0x34 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2038308: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
203830c: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2038310: 7f ff 4b 9b call 200b17c <_Watchdog_Insert>
2038314: b0 10 20 00 clr %i0
2038318: 30 bf ff c8 b,a 2038238 <rtems_rate_monotonic_period+0x84>
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
203831c: 7f ff ff 34 call 2037fec <_Rate_monotonic_Update_statistics>
2038320: 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;
2038324: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
2038328: 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;
203832c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
2038330: 7f ff 28 2f call 20023ec <sparc_enable_interrupts>
2038334: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
2038338: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
203833c: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
2038340: 90 10 00 01 mov %g1, %o0
2038344: 13 00 00 10 sethi %hi(0x4000), %o1
2038348: 7f ff 4a 9c call 200adb8 <_Thread_Set_state>
203834c: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
2038350: 7f ff 28 23 call 20023dc <sparc_disable_interrupts>
2038354: 01 00 00 00 nop
local_state = the_period->state;
2038358: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
203835c: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
2038360: 7f ff 28 23 call 20023ec <sparc_enable_interrupts>
2038364: 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 )
2038368: 80 a6 a0 03 cmp %i2, 3
203836c: 22 80 00 06 be,a 2038384 <rtems_rate_monotonic_period+0x1d0>
2038370: d0 07 20 10 ld [ %i4 + 0x10 ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
2038374: 7f ff 48 30 call 200a434 <_Thread_Enable_dispatch>
2038378: b0 10 20 00 clr %i0
203837c: 81 c7 e0 08 ret
2038380: 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 );
2038384: 7f ff 47 27 call 200a020 <_Thread_Clear_state>
2038388: 13 00 00 10 sethi %hi(0x4000), %o1
203838c: 30 bf ff fa b,a 2038374 <rtems_rate_monotonic_period+0x1c0>
02029e4c <rtems_rate_monotonic_report_statistics_with_plugin>:
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
2029e4c: 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 )
2029e50: 80 a6 60 00 cmp %i1, 0
2029e54: 02 80 00 48 be 2029f74 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
2029e58: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
2029e5c: 13 00 81 78 sethi %hi(0x205e000), %o1
2029e60: 9f c6 40 00 call %i1
2029e64: 92 12 63 88 or %o1, 0x388, %o1 ! 205e388 <_TOD_Days_per_month+0x68>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
2029e68: 90 10 00 18 mov %i0, %o0
2029e6c: 13 00 81 78 sethi %hi(0x205e000), %o1
2029e70: 9f c6 40 00 call %i1
2029e74: 92 12 63 a8 or %o1, 0x3a8, %o1 ! 205e3a8 <_TOD_Days_per_month+0x88>
(*print)( context, "--- Wall times are in seconds ---\n" );
2029e78: 90 10 00 18 mov %i0, %o0
2029e7c: 13 00 81 78 sethi %hi(0x205e000), %o1
2029e80: 9f c6 40 00 call %i1
2029e84: 92 12 63 d0 or %o1, 0x3d0, %o1 ! 205e3d0 <_TOD_Days_per_month+0xb0>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
2029e88: 90 10 00 18 mov %i0, %o0
2029e8c: 13 00 81 78 sethi %hi(0x205e000), %o1
2029e90: 9f c6 40 00 call %i1
2029e94: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 205e3f8 <_TOD_Days_per_month+0xd8>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
2029e98: 90 10 00 18 mov %i0, %o0
2029e9c: 13 00 81 79 sethi %hi(0x205e400), %o1
2029ea0: 9f c6 40 00 call %i1
2029ea4: 92 12 60 48 or %o1, 0x48, %o1 ! 205e448 <_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 ;
2029ea8: 39 00 81 9f sethi %hi(0x2067c00), %i4
2029eac: b8 17 22 44 or %i4, 0x244, %i4 ! 2067e44 <_Rate_monotonic_Information>
2029eb0: fa 07 20 08 ld [ %i4 + 8 ], %i5
2029eb4: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2029eb8: 80 a7 40 01 cmp %i5, %g1
2029ebc: 18 80 00 2e bgu 2029f74 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
2029ec0: 35 00 81 79 sethi %hi(0x205e400), %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,
2029ec4: 27 00 81 79 sethi %hi(0x205e400), %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,
2029ec8: 25 00 81 79 sethi %hi(0x205e400), %l2
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
2029ecc: 37 00 81 7e sethi %hi(0x205f800), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
2029ed0: 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,
2029ed4: 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,
2029ed8: 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" );
2029edc: 10 80 00 06 b 2029ef4 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
2029ee0: 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++ ) {
2029ee4: 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 ;
2029ee8: 80 a0 40 1d cmp %g1, %i5
2029eec: 0a 80 00 22 bcs 2029f74 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
2029ef0: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
2029ef4: 90 10 00 1d mov %i5, %o0
2029ef8: 40 00 37 59 call 2037c5c <rtems_rate_monotonic_get_statistics>
2029efc: 92 07 bf c8 add %fp, -56, %o1
if ( status != RTEMS_SUCCESSFUL )
2029f00: 80 a2 20 00 cmp %o0, 0
2029f04: 32 bf ff f8 bne,a 2029ee4 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
2029f08: 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 );
2029f0c: 92 07 bf b0 add %fp, -80, %o1
2029f10: 40 00 37 c5 call 2037e24 <rtems_rate_monotonic_get_status>
2029f14: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
2029f18: d0 07 bf b0 ld [ %fp + -80 ], %o0
2029f1c: 94 07 bf a0 add %fp, -96, %o2
2029f20: 7f ff 97 c1 call 200fe24 <rtems_object_get_name>
2029f24: 92 10 20 05 mov 5, %o1
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
2029f28: d8 1f bf c8 ldd [ %fp + -56 ], %o4
2029f2c: 92 10 00 1a mov %i2, %o1
2029f30: 94 10 00 1d mov %i5, %o2
2029f34: 90 10 00 18 mov %i0, %o0
2029f38: 9f c6 40 00 call %i1
2029f3c: 96 07 bf a0 add %fp, -96, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
2029f40: 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 );
2029f44: 94 07 bf a8 add %fp, -88, %o2
2029f48: 90 07 bf e0 add %fp, -32, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
2029f4c: 80 a0 60 00 cmp %g1, 0
2029f50: 12 80 00 0b bne 2029f7c <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
2029f54: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
2029f58: 9f c6 40 00 call %i1
2029f5c: 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 ;
2029f60: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2029f64: 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 ;
2029f68: 80 a0 40 1d cmp %g1, %i5
2029f6c: 1a bf ff e3 bcc 2029ef8 <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
2029f70: 90 10 00 1d mov %i5, %o0
2029f74: 81 c7 e0 08 ret
2029f78: 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 );
2029f7c: 40 00 02 ee call 202ab34 <_Timespec_Divide_by_integer>
2029f80: 92 10 00 01 mov %g1, %o1
(*print)( context,
2029f84: d0 07 bf d4 ld [ %fp + -44 ], %o0
2029f88: 40 00 ac cb call 20552b4 <.div>
2029f8c: 92 10 23 e8 mov 0x3e8, %o1
2029f90: aa 10 00 08 mov %o0, %l5
2029f94: d0 07 bf dc ld [ %fp + -36 ], %o0
2029f98: 40 00 ac c7 call 20552b4 <.div>
2029f9c: 92 10 23 e8 mov 0x3e8, %o1
2029fa0: c2 07 bf a8 ld [ %fp + -88 ], %g1
2029fa4: a2 10 00 08 mov %o0, %l1
2029fa8: d0 07 bf ac ld [ %fp + -84 ], %o0
2029fac: e0 07 bf d0 ld [ %fp + -48 ], %l0
2029fb0: e8 07 bf d8 ld [ %fp + -40 ], %l4
2029fb4: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2029fb8: 40 00 ac bf call 20552b4 <.div>
2029fbc: 92 10 23 e8 mov 0x3e8, %o1
2029fc0: 96 10 00 15 mov %l5, %o3
2029fc4: 98 10 00 14 mov %l4, %o4
2029fc8: 9a 10 00 11 mov %l1, %o5
2029fcc: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
2029fd0: 92 10 00 13 mov %l3, %o1
2029fd4: 94 10 00 10 mov %l0, %o2
2029fd8: 9f c6 40 00 call %i1
2029fdc: 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);
2029fe0: d2 07 bf c8 ld [ %fp + -56 ], %o1
2029fe4: 94 07 bf a8 add %fp, -88, %o2
2029fe8: 40 00 02 d3 call 202ab34 <_Timespec_Divide_by_integer>
2029fec: 90 07 bf f8 add %fp, -8, %o0
(*print)( context,
2029ff0: d0 07 bf ec ld [ %fp + -20 ], %o0
2029ff4: 40 00 ac b0 call 20552b4 <.div>
2029ff8: 92 10 23 e8 mov 0x3e8, %o1
2029ffc: a8 10 00 08 mov %o0, %l4
202a000: d0 07 bf f4 ld [ %fp + -12 ], %o0
202a004: 40 00 ac ac call 20552b4 <.div>
202a008: 92 10 23 e8 mov 0x3e8, %o1
202a00c: c2 07 bf a8 ld [ %fp + -88 ], %g1
202a010: a0 10 00 08 mov %o0, %l0
202a014: d0 07 bf ac ld [ %fp + -84 ], %o0
202a018: ea 07 bf e8 ld [ %fp + -24 ], %l5
202a01c: e2 07 bf f0 ld [ %fp + -16 ], %l1
202a020: 92 10 23 e8 mov 0x3e8, %o1
202a024: 40 00 ac a4 call 20552b4 <.div>
202a028: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
202a02c: 92 10 00 12 mov %l2, %o1
202a030: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
202a034: 94 10 00 15 mov %l5, %o2
202a038: 90 10 00 18 mov %i0, %o0
202a03c: 96 10 00 14 mov %l4, %o3
202a040: 98 10 00 11 mov %l1, %o4
202a044: 9f c6 40 00 call %i1
202a048: 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 ;
202a04c: 10 bf ff a6 b 2029ee4 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
202a050: c2 07 20 0c ld [ %i4 + 0xc ], %g1
0202a06c <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
202a06c: 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;
202a070: 03 00 81 9c sethi %hi(0x2067000), %g1
202a074: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 ! 2067360 <_Thread_Dispatch_disable_level>
++level;
202a078: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
202a07c: c4 20 63 60 st %g2, [ %g1 + 0x360 ]
/*
* 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 ;
202a080: 39 00 81 9f sethi %hi(0x2067c00), %i4
202a084: b8 17 22 44 or %i4, 0x244, %i4 ! 2067e44 <_Rate_monotonic_Information>
202a088: fa 07 20 08 ld [ %i4 + 8 ], %i5
202a08c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
202a090: 80 a7 40 01 cmp %i5, %g1
202a094: 18 80 00 09 bgu 202a0b8 <rtems_rate_monotonic_reset_all_statistics+0x4c><== NEVER TAKEN
202a098: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
202a09c: 40 00 00 09 call 202a0c0 <rtems_rate_monotonic_reset_statistics>
202a0a0: 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 ;
202a0a4: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
202a0a8: 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 ;
202a0ac: 80 a0 40 1d cmp %g1, %i5
202a0b0: 1a bf ff fb bcc 202a09c <rtems_rate_monotonic_reset_all_statistics+0x30>
202a0b4: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
202a0b8: 7f ff 80 df call 200a434 <_Thread_Enable_dispatch>
202a0bc: 81 e8 00 00 restore
02008e00 <rtems_rbheap_allocate>:
return big_enough;
}
void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size)
{
2008e00: 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;
2008e04: 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;
2008e08: 90 10 00 19 mov %i1, %o0
2008e0c: 40 00 46 ab call 201a8b8 <.urem>
2008e10: 92 10 00 1d mov %i5, %o1
if (excess > 0) {
2008e14: 80 a2 20 00 cmp %o0, 0
2008e18: 02 80 00 26 be 2008eb0 <rtems_rbheap_allocate+0xb0> <== ALWAYS TAKEN
2008e1c: b6 10 00 19 mov %i1, %i3
value += alignment - excess;
2008e20: ba 06 40 1d add %i1, %i5, %i5 <== NOT EXECUTED
2008e24: b6 27 40 08 sub %i5, %o0, %i3 <== NOT EXECUTED
2008e28: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED
2008e2c: 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) {
2008e30: 80 88 60 ff btst 0xff, %g1
2008e34: 02 80 00 1d be 2008ea8 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2008e38: 80 a6 60 00 cmp %i1, 0
2008e3c: 02 80 00 1b be 2008ea8 <rtems_rbheap_allocate+0xa8>
2008e40: 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;
2008e44: 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) {
2008e48: 80 a7 40 01 cmp %i5, %g1
2008e4c: 02 80 00 17 be 2008ea8 <rtems_rbheap_allocate+0xa8>
2008e50: 01 00 00 00 nop
rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current;
if (free_chunk->size >= size) {
2008e54: f8 07 60 1c ld [ %i5 + 0x1c ], %i4
2008e58: 80 a6 c0 1c cmp %i3, %i4
2008e5c: 38 80 00 10 bgu,a 2008e9c <rtems_rbheap_allocate+0x9c>
2008e60: 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) {
2008e64: 80 a7 60 00 cmp %i5, 0
2008e68: 02 80 00 10 be 2008ea8 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2008e6c: 80 a7 00 1b cmp %i4, %i3
uintptr_t free_size = free_chunk->size;
if (free_size > aligned_size) {
2008e70: 18 80 00 12 bgu 2008eb8 <rtems_rbheap_allocate+0xb8>
2008e74: 01 00 00 00 nop
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
2008e78: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
2008e7c: 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;
2008e80: f0 07 60 18 ld [ %i5 + 0x18 ], %i0
next->previous = previous;
2008e84: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
2008e88: c4 20 40 00 st %g2, [ %g1 ]
*/
RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain(
Chain_Node *node
)
{
node->next = node->previous = NULL;
2008e8c: c0 27 60 04 clr [ %i5 + 4 ]
2008e90: c0 27 40 00 clr [ %i5 ]
}
}
}
return ptr;
}
2008e94: 81 c7 e0 08 ret
2008e98: 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) {
2008e9c: 80 a0 40 1d cmp %g1, %i5
2008ea0: 32 bf ff ee bne,a 2008e58 <rtems_rbheap_allocate+0x58> <== NEVER TAKEN
2008ea4: 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;
2008ea8: 81 c7 e0 08 ret
2008eac: 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) {
2008eb0: 10 bf ff e0 b 2008e30 <rtems_rbheap_allocate+0x30>
2008eb4: 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);
2008eb8: 7f ff ff 46 call 2008bd0 <get_chunk>
2008ebc: 90 10 00 18 mov %i0, %o0
if (new_chunk != NULL) {
2008ec0: b4 92 20 00 orcc %o0, 0, %i2
2008ec4: 02 bf ff f9 be 2008ea8 <rtems_rbheap_allocate+0xa8> <== NEVER TAKEN
2008ec8: 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;
2008ecc: 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;
2008ed0: f8 27 60 1c st %i4, [ %i5 + 0x1c ]
new_chunk->begin = free_chunk->begin + new_free_size;
new_chunk->size = aligned_size;
2008ed4: 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;
2008ed8: b8 07 00 01 add %i4, %g1, %i4
2008edc: c0 26 a0 04 clr [ %i2 + 4 ]
2008ee0: f8 26 a0 18 st %i4, [ %i2 + 0x18 ]
2008ee4: 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);
2008ee8: 90 06 20 18 add %i0, 0x18, %o0
2008eec: 40 00 07 1c call 200ab5c <_RBTree_Insert_unprotected>
2008ef0: 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;
2008ef4: f0 06 a0 18 ld [ %i2 + 0x18 ], %i0
2008ef8: 81 c7 e0 08 ret
2008efc: 81 e8 00 00 restore
02009044 <rtems_rbheap_extend_descriptors_with_malloc>:
/* Do nothing */
}
void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control)
{
2009044: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED
rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk));
2009048: 7f ff ec 47 call 2004164 <malloc> <== NOT EXECUTED
200904c: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED
if (chunk != NULL) {
2009050: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
2009054: 02 80 00 07 be 2009070 <rtems_rbheap_extend_descriptors_with_malloc+0x2c><== NOT EXECUTED
2009058: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
200905c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED
after_node->next = the_node;
2009060: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2009064: 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;
2009068: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
before_node->previous = the_node;
200906c: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED
2009070: 81 c7 e0 08 ret <== NOT EXECUTED
2009074: 81 e8 00 00 restore <== NOT EXECUTED
02008f00 <rtems_rbheap_free>:
_RBTree_Extract_unprotected(chunk_tree, &b->tree_node);
}
}
rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr)
{
2008f00: 9d e3 bf 80 save %sp, -128, %sp
2008f04: b4 10 00 18 mov %i0, %i2
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (ptr != NULL) {
2008f08: 80 a6 60 00 cmp %i1, 0
2008f0c: 02 80 00 2a be 2008fb4 <rtems_rbheap_free+0xb4>
2008f10: 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;
2008f14: 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 };
2008f18: c0 27 bf fc clr [ %fp + -4 ]
2008f1c: c0 27 bf e0 clr [ %fp + -32 ]
2008f20: c0 27 bf e4 clr [ %fp + -28 ]
2008f24: c0 27 bf e8 clr [ %fp + -24 ]
2008f28: c0 27 bf ec clr [ %fp + -20 ]
2008f2c: c0 27 bf f0 clr [ %fp + -16 ]
2008f30: c0 27 bf f4 clr [ %fp + -12 ]
2008f34: f2 27 bf f8 st %i1, [ %fp + -8 ]
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
2008f38: 80 a7 60 00 cmp %i5, 0
2008f3c: 02 80 00 3e be 2009034 <rtems_rbheap_free+0x134> <== NEVER TAKEN
2008f40: b8 06 a0 18 add %i2, 0x18, %i4
2008f44: b6 10 20 00 clr %i3
compare_result = the_rbtree->compare_function(the_node, iter_node);
2008f48: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
2008f4c: 92 10 00 1d mov %i5, %o1
2008f50: 9f c0 40 00 call %g1
2008f54: 90 07 bf e8 add %fp, -24, %o0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
2008f58: 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 ) ) {
2008f5c: 80 a2 20 00 cmp %o0, 0
RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater(
int compare_result
)
{
return compare_result > 0;
2008f60: 82 20 40 08 sub %g1, %o0, %g1
2008f64: 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];
2008f68: 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 ) ) {
2008f6c: 12 80 00 06 bne 2008f84 <rtems_rbheap_free+0x84>
2008f70: 82 07 40 01 add %i5, %g1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
2008f74: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
2008f78: 80 a0 a0 00 cmp %g2, 0
2008f7c: 12 80 00 10 bne 2008fbc <rtems_rbheap_free+0xbc> <== ALWAYS TAKEN
2008f80: b6 10 00 1d mov %i5, %i3
break;
}
RBTree_Direction dir =
(RBTree_Direction) _RBTree_Is_greater( compare_result );
iter_node = iter_node->child[dir];
2008f84: 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) {
2008f88: 80 a7 60 00 cmp %i5, 0
2008f8c: 32 bf ff f0 bne,a 2008f4c <rtems_rbheap_free+0x4c>
2008f90: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return rtems_rbheap_chunk_of_node(
2008f94: 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) {
2008f98: 80 a7 7f f8 cmp %i5, -8
2008f9c: 02 80 00 06 be 2008fb4 <rtems_rbheap_free+0xb4>
2008fa0: 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);
2008fa4: c2 06 ff f8 ld [ %i3 + -8 ], %g1
2008fa8: 80 a0 60 00 cmp %g1, 0
2008fac: 02 80 00 06 be 2008fc4 <rtems_rbheap_free+0xc4>
2008fb0: b0 10 20 0e mov 0xe, %i0
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
2008fb4: 81 c7 e0 08 ret
2008fb8: 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(
2008fbc: 10 bf ff f7 b 2008f98 <rtems_rbheap_free+0x98>
2008fc0: ba 06 ff f8 add %i3, -8, %i5
2008fc4: c2 06 ff fc ld [ %i3 + -4 ], %g1
2008fc8: 80 a0 60 00 cmp %g1, 0
2008fcc: 12 bf ff fa bne 2008fb4 <rtems_rbheap_free+0xb4> <== NEVER TAKEN
2008fd0: 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(
2008fd4: 40 00 07 b1 call 200ae98 <_RBTree_Next_unprotected>
2008fd8: 90 10 00 1b mov %i3, %o0
2008fdc: 92 10 20 01 mov 1, %o1
2008fe0: b2 10 00 08 mov %o0, %i1
2008fe4: 40 00 07 ad call 200ae98 <_RBTree_Next_unprotected>
2008fe8: 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);
2008fec: 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(
2008ff0: 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);
2008ff4: 94 10 00 1d mov %i5, %o2
2008ff8: 7f ff ff 10 call 2008c38 <check_and_merge>
2008ffc: 90 10 00 1a mov %i2, %o0
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2009000: c2 06 80 00 ld [ %i2 ], %g1
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2009004: f4 26 ff fc st %i2, [ %i3 + -4 ]
before_node = after_node->next;
after_node->next = the_node;
2009008: fa 26 80 00 st %i5, [ %i2 ]
the_node->next = before_node;
200900c: c2 26 ff f8 st %g1, [ %i3 + -8 ]
before_node->previous = the_node;
2009010: fa 20 60 04 st %i5, [ %g1 + 4 ]
add_to_chain(free_chain, chunk);
check_and_merge(free_chain, chunk_tree, chunk, pred);
2009014: 90 10 00 1a mov %i2, %o0
2009018: 92 10 00 1c mov %i4, %o1
200901c: 94 10 00 1d mov %i5, %o2
2009020: 96 06 7f f8 add %i1, -8, %o3
2009024: 7f ff ff 05 call 2008c38 <check_and_merge>
2009028: b0 10 20 00 clr %i0
200902c: 81 c7 e0 08 ret
2009030: 81 e8 00 00 restore
sc = RTEMS_INVALID_ID;
}
}
return sc;
}
2009034: 81 c7 e0 08 ret <== NOT EXECUTED
2009038: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED
02008cd0 <rtems_rbheap_initialize>:
uintptr_t area_size,
uintptr_t alignment,
rtems_rbheap_extend_descriptors extend_descriptors,
void *handler_arg
)
{
2008cd0: 9d e3 bf a0 save %sp, -96, %sp
rtems_status_code sc = RTEMS_SUCCESSFUL;
if (alignment > 0) {
2008cd4: 80 a6 e0 00 cmp %i3, 0
2008cd8: 12 80 00 04 bne 2008ce8 <rtems_rbheap_initialize+0x18>
2008cdc: 82 10 20 0a mov 0xa, %g1
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
2008ce0: 81 c7 e0 08 ret
2008ce4: 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;
2008ce8: 90 10 00 19 mov %i1, %o0
2008cec: 92 10 00 1b mov %i3, %o1
2008cf0: 40 00 46 f2 call 201a8b8 <.urem>
2008cf4: b4 06 40 1a add %i1, %i2, %i2
if (excess > 0) {
2008cf8: 80 a2 20 00 cmp %o0, 0
2008cfc: 32 80 00 09 bne,a 2008d20 <rtems_rbheap_initialize+0x50>
2008d00: a0 06 40 1b add %i1, %i3, %l0
2008d04: 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) {
2008d08: 80 88 60 ff btst 0xff, %g1
2008d0c: 12 80 00 0b bne 2008d38 <rtems_rbheap_initialize+0x68> <== ALWAYS TAKEN
2008d10: a0 10 00 19 mov %i1, %l0
insert_into_tree(chunk_tree, first);
} else {
sc = RTEMS_NO_MEMORY;
}
} else {
sc = RTEMS_INVALID_ADDRESS;
2008d14: 82 10 20 09 mov 9, %g1 <== NOT EXECUTED
} else {
sc = RTEMS_INVALID_NUMBER;
}
return sc;
}
2008d18: 81 c7 e0 08 ret
2008d1c: 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;
2008d20: a0 24 00 08 sub %l0, %o0, %l0
2008d24: 80 a4 00 19 cmp %l0, %i1
2008d28: 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) {
2008d2c: 80 88 60 ff btst 0xff, %g1
2008d30: 02 bf ff fa be 2008d18 <rtems_rbheap_initialize+0x48>
2008d34: 82 10 20 09 mov 9, %g1
2008d38: 80 a6 40 1a cmp %i1, %i2
2008d3c: 1a bf ff f7 bcc 2008d18 <rtems_rbheap_initialize+0x48>
2008d40: 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;
2008d44: 90 10 00 1a mov %i2, %o0
2008d48: 40 00 46 dc call 201a8b8 <.urem>
2008d4c: 92 10 00 1b mov %i3, %o1
return value - excess;
2008d50: 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) {
2008d54: 80 a4 00 1a cmp %l0, %i2
2008d58: 1a bf ff e2 bcc 2008ce0 <rtems_rbheap_initialize+0x10>
2008d5c: 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 );
2008d60: 82 06 20 04 add %i0, 4, %g1
head->next = tail;
2008d64: 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 );
2008d68: 82 06 20 0c add %i0, 0xc, %g1
head->next = tail;
head->previous = NULL;
tail->previous = head;
2008d6c: 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;
2008d70: 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 );
2008d74: 84 06 20 10 add %i0, 0x10, %g2
2008d78: 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;
2008d7c: 03 00 80 22 sethi %hi(0x2008800), %g1
2008d80: 82 10 63 c0 or %g1, 0x3c0, %g1 ! 2008bc0 <chunk_compare>
head->next = tail;
head->previous = NULL;
2008d84: c0 26 20 04 clr [ %i0 + 4 ]
2008d88: c2 26 20 28 st %g1, [ %i0 + 0x28 ]
tail->previous = head;
2008d8c: 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;
2008d90: c0 26 20 10 clr [ %i0 + 0x10 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2008d94: 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;
2008d98: c0 26 20 18 clr [ %i0 + 0x18 ]
the_rbtree->root = NULL;
2008d9c: c0 26 20 1c clr [ %i0 + 0x1c ]
the_rbtree->first[0] = NULL;
2008da0: c0 26 20 20 clr [ %i0 + 0x20 ]
the_rbtree->first[1] = NULL;
2008da4: 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;
2008da8: f6 26 20 30 st %i3, [ %i0 + 0x30 ]
control->handler_arg = handler_arg;
2008dac: fa 26 20 38 st %i5, [ %i0 + 0x38 ]
control->extend_descriptors = extend_descriptors;
2008db0: f8 26 20 34 st %i4, [ %i0 + 0x34 ]
first = get_chunk(control);
2008db4: 7f ff ff 87 call 2008bd0 <get_chunk>
2008db8: 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;
2008dbc: 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) {
2008dc0: 80 a2 20 00 cmp %o0, 0
2008dc4: 02 bf ff c7 be 2008ce0 <rtems_rbheap_initialize+0x10>
2008dc8: 92 10 00 08 mov %o0, %o1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2008dcc: c2 06 00 00 ld [ %i0 ], %g1
first->begin = aligned_begin;
first->size = aligned_end - aligned_begin;
2008dd0: 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;
2008dd4: e0 22 20 18 st %l0, [ %o0 + 0x18 ]
first->size = aligned_end - aligned_begin;
2008dd8: f4 22 20 1c st %i2, [ %o0 + 0x1c ]
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2008ddc: f0 22 20 04 st %i0, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
2008de0: d0 26 00 00 st %o0, [ %i0 ]
the_node->next = before_node;
2008de4: c2 22 00 00 st %g1, [ %o0 ]
before_node->previous = the_node;
2008de8: 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);
2008dec: 92 02 60 08 add %o1, 8, %o1
2008df0: 40 00 07 5b call 200ab5c <_RBTree_Insert_unprotected>
2008df4: 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;
2008df8: 10 bf ff ba b 2008ce0 <rtems_rbheap_initialize+0x10>
2008dfc: 82 10 20 00 clr %g1
02016d64 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
2016d64: 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 )
2016d68: 80 a6 60 00 cmp %i1, 0
2016d6c: 12 80 00 04 bne 2016d7c <rtems_signal_send+0x18>
2016d70: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2016d74: 81 c7 e0 08 ret
2016d78: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2016d7c: 90 10 00 18 mov %i0, %o0
2016d80: 40 00 13 dc call 201bcf0 <_Thread_Get>
2016d84: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2016d88: c2 07 bf fc ld [ %fp + -4 ], %g1
2016d8c: 80 a0 60 00 cmp %g1, 0
2016d90: 12 80 00 20 bne 2016e10 <rtems_signal_send+0xac>
2016d94: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
2016d98: fa 02 21 58 ld [ %o0 + 0x158 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
2016d9c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2016da0: 80 a0 60 00 cmp %g1, 0
2016da4: 02 80 00 1e be 2016e1c <rtems_signal_send+0xb8>
2016da8: 01 00 00 00 nop
if ( asr->is_enabled ) {
2016dac: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2016db0: 80 a0 60 00 cmp %g1, 0
2016db4: 02 80 00 1e be 2016e2c <rtems_signal_send+0xc8>
2016db8: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2016dbc: 7f ff e2 4f call 200f6f8 <sparc_disable_interrupts>
2016dc0: 01 00 00 00 nop
*signal_set |= signals;
2016dc4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2016dc8: b2 10 40 19 or %g1, %i1, %i1
2016dcc: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2016dd0: 7f ff e2 4e call 200f708 <sparc_enable_interrupts>
2016dd4: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
2016dd8: 03 00 80 f3 sethi %hi(0x203cc00), %g1
2016ddc: 82 10 62 60 or %g1, 0x260, %g1 ! 203ce60 <_Per_CPU_Information>
2016de0: c4 00 60 08 ld [ %g1 + 8 ], %g2
2016de4: 80 a0 a0 00 cmp %g2, 0
2016de8: 02 80 00 06 be 2016e00 <rtems_signal_send+0x9c>
2016dec: 01 00 00 00 nop
2016df0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
2016df4: 80 a7 00 02 cmp %i4, %g2
2016df8: 02 80 00 15 be 2016e4c <rtems_signal_send+0xe8> <== ALWAYS TAKEN
2016dfc: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
2016e00: 40 00 13 b0 call 201bcc0 <_Thread_Enable_dispatch>
2016e04: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2016e08: 10 bf ff db b 2016d74 <rtems_signal_send+0x10>
2016e0c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2016e10: 82 10 20 04 mov 4, %g1
}
2016e14: 81 c7 e0 08 ret
2016e18: 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();
2016e1c: 40 00 13 a9 call 201bcc0 <_Thread_Enable_dispatch>
2016e20: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
2016e24: 10 bf ff d4 b 2016d74 <rtems_signal_send+0x10>
2016e28: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2016e2c: 7f ff e2 33 call 200f6f8 <sparc_disable_interrupts>
2016e30: 01 00 00 00 nop
*signal_set |= signals;
2016e34: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2016e38: b2 10 40 19 or %g1, %i1, %i1
2016e3c: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
2016e40: 7f ff e2 32 call 200f708 <sparc_enable_interrupts>
2016e44: 01 00 00 00 nop
2016e48: 30 bf ff ee b,a 2016e00 <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;
2016e4c: c4 28 60 0c stb %g2, [ %g1 + 0xc ]
2016e50: 30 bf ff ec b,a 2016e00 <rtems_signal_send+0x9c>
02011ed8 <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
2011ed8: 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 )
2011edc: 80 a6 a0 00 cmp %i2, 0
2011ee0: 02 80 00 3b be 2011fcc <rtems_task_mode+0xf4>
2011ee4: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
2011ee8: 21 00 80 8b sethi %hi(0x2022c00), %l0
2011eec: a0 14 23 d0 or %l0, 0x3d0, %l0 ! 2022fd0 <_Per_CPU_Information>
2011ef0: 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;
2011ef4: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
2011ef8: 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;
2011efc: 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 ];
2011f00: f8 07 61 58 ld [ %i5 + 0x158 ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
2011f04: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
2011f08: 80 a0 60 00 cmp %g1, 0
2011f0c: 12 80 00 40 bne 201200c <rtems_task_mode+0x134>
2011f10: 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;
2011f14: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
2011f18: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
2011f1c: 7f ff eb a8 call 200cdbc <_CPU_ISR_Get_level>
2011f20: 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;
2011f24: a3 2c 60 0a sll %l1, 0xa, %l1
2011f28: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
2011f2c: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
2011f30: 80 8e 61 00 btst 0x100, %i1
2011f34: 02 80 00 06 be 2011f4c <rtems_task_mode+0x74>
2011f38: 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;
2011f3c: 83 36 20 08 srl %i0, 8, %g1
2011f40: 82 18 60 01 xor %g1, 1, %g1
2011f44: 82 08 60 01 and %g1, 1, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
2011f48: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
2011f4c: 80 8e 62 00 btst 0x200, %i1
2011f50: 12 80 00 21 bne 2011fd4 <rtems_task_mode+0xfc>
2011f54: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
2011f58: 80 8e 60 0f btst 0xf, %i1
2011f5c: 12 80 00 27 bne 2011ff8 <rtems_task_mode+0x120>
2011f60: 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 ) {
2011f64: 80 8e 64 00 btst 0x400, %i1
2011f68: 02 80 00 14 be 2011fb8 <rtems_task_mode+0xe0>
2011f6c: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
2011f70: 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;
2011f74: b1 36 20 0a srl %i0, 0xa, %i0
2011f78: b0 1e 20 01 xor %i0, 1, %i0
2011f7c: b0 0e 20 01 and %i0, 1, %i0
if ( is_asr_enabled != asr->is_enabled ) {
2011f80: 80 a6 00 01 cmp %i0, %g1
2011f84: 22 80 00 0e be,a 2011fbc <rtems_task_mode+0xe4>
2011f88: 03 00 80 8b sethi %hi(0x2022c00), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
2011f8c: 7f ff c3 69 call 2002d30 <sparc_disable_interrupts>
2011f90: f0 2f 20 08 stb %i0, [ %i4 + 8 ]
_signals = information->signals_pending;
2011f94: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
2011f98: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
2011f9c: 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;
2011fa0: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
2011fa4: 7f ff c3 67 call 2002d40 <sparc_enable_interrupts>
2011fa8: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
2011fac: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
2011fb0: 80 a0 00 01 cmp %g0, %g1
2011fb4: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
2011fb8: 03 00 80 8b sethi %hi(0x2022c00), %g1
2011fbc: c4 00 63 c8 ld [ %g1 + 0x3c8 ], %g2 ! 2022fc8 <_System_state_Current>
2011fc0: 80 a0 a0 03 cmp %g2, 3
2011fc4: 02 80 00 1f be 2012040 <rtems_task_mode+0x168>
2011fc8: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
2011fcc: 81 c7 e0 08 ret
2011fd0: 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) ) {
2011fd4: 22 bf ff e1 be,a 2011f58 <rtems_task_mode+0x80>
2011fd8: c0 27 60 78 clr [ %i5 + 0x78 ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
2011fdc: 03 00 80 8a sethi %hi(0x2022800), %g1
2011fe0: c2 00 62 10 ld [ %g1 + 0x210 ], %g1 ! 2022a10 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
2011fe4: 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;
2011fe8: 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;
2011fec: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
2011ff0: 02 bf ff dd be 2011f64 <rtems_task_mode+0x8c>
2011ff4: 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 );
2011ff8: 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 ) );
2011ffc: 7f ff c3 51 call 2002d40 <sparc_enable_interrupts>
2012000: 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 ) {
2012004: 10 bf ff d9 b 2011f68 <rtems_task_mode+0x90>
2012008: 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;
201200c: 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;
2012010: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
2012014: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
2012018: 7f ff eb 69 call 200cdbc <_CPU_ISR_Get_level>
201201c: 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;
2012020: a3 2c 60 0a sll %l1, 0xa, %l1
2012024: 90 14 40 08 or %l1, %o0, %o0
old_mode |= _ISR_Get_level();
2012028: b6 12 00 1b or %o0, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
201202c: 80 8e 61 00 btst 0x100, %i1
2012030: 02 bf ff c7 be 2011f4c <rtems_task_mode+0x74>
2012034: 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;
2012038: 10 bf ff c2 b 2011f40 <rtems_task_mode+0x68>
201203c: 83 36 20 08 srl %i0, 8, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
2012040: 80 88 e0 ff btst 0xff, %g3
2012044: 12 80 00 0a bne 201206c <rtems_task_mode+0x194>
2012048: c4 04 20 10 ld [ %l0 + 0x10 ], %g2
201204c: c6 04 20 14 ld [ %l0 + 0x14 ], %g3
2012050: 80 a0 80 03 cmp %g2, %g3
2012054: 02 bf ff de be 2011fcc <rtems_task_mode+0xf4>
2012058: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
201205c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2
2012060: 80 a0 a0 00 cmp %g2, 0
2012064: 02 bf ff da be 2011fcc <rtems_task_mode+0xf4> <== NEVER TAKEN
2012068: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
201206c: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
2012070: 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();
2012074: 40 00 02 95 call 2012ac8 <_Thread_Dispatch>
2012078: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
201207c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
2012080: 81 c7 e0 08 ret
2012084: 91 e8 00 01 restore %g0, %g1, %o0
0200c6b4 <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200c6b4: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200c6b8: 80 a6 60 00 cmp %i1, 0
200c6bc: 02 80 00 08 be 200c6dc <rtems_task_set_priority+0x28>
200c6c0: 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 ) );
200c6c4: 03 00 80 88 sethi %hi(0x2022000), %g1
200c6c8: c4 08 61 0c ldub [ %g1 + 0x10c ], %g2 ! 202210c <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
200c6cc: 80 a6 40 02 cmp %i1, %g2
200c6d0: 18 80 00 1e bgu 200c748 <rtems_task_set_priority+0x94>
200c6d4: 82 10 20 13 mov 0x13, %g1
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200c6d8: 80 a6 a0 00 cmp %i2, 0
200c6dc: 02 80 00 1b be 200c748 <rtems_task_set_priority+0x94>
200c6e0: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200c6e4: 90 10 00 18 mov %i0, %o0
200c6e8: 40 00 0a 4c call 200f018 <_Thread_Get>
200c6ec: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200c6f0: c2 07 bf fc ld [ %fp + -4 ], %g1
200c6f4: 80 a0 60 00 cmp %g1, 0
200c6f8: 12 80 00 16 bne 200c750 <rtems_task_set_priority+0x9c>
200c6fc: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200c700: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200c704: 80 a6 60 00 cmp %i1, 0
200c708: 02 80 00 0d be 200c73c <rtems_task_set_priority+0x88>
200c70c: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200c710: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200c714: 80 a0 60 00 cmp %g1, 0
200c718: 02 80 00 06 be 200c730 <rtems_task_set_priority+0x7c>
200c71c: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200c720: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200c724: 80 a6 40 01 cmp %i1, %g1
200c728: 1a 80 00 05 bcc 200c73c <rtems_task_set_priority+0x88> <== ALWAYS TAKEN
200c72c: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200c730: 92 10 00 19 mov %i1, %o1
200c734: 40 00 08 db call 200eaa0 <_Thread_Change_priority>
200c738: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200c73c: 40 00 0a 2b call 200efe8 <_Thread_Enable_dispatch>
200c740: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
200c744: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
200c748: 81 c7 e0 08 ret
200c74c: 91 e8 00 01 restore %g0, %g1, %o0
200c750: 81 c7 e0 08 ret
200c754: 91 e8 00 01 restore %g0, %g1, %o0
0200621c <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
200621c: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
2006220: 80 a6 60 00 cmp %i1, 0
2006224: 02 80 00 1e be 200629c <rtems_task_variable_delete+0x80>
2006228: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
200622c: 90 10 00 18 mov %i0, %o0
2006230: 40 00 08 c0 call 2008530 <_Thread_Get>
2006234: 92 07 bf fc add %fp, -4, %o1
switch (location) {
2006238: c2 07 bf fc ld [ %fp + -4 ], %g1
200623c: 80 a0 60 00 cmp %g1, 0
2006240: 12 80 00 19 bne 20062a4 <rtems_task_variable_delete+0x88>
2006244: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
2006248: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200624c: 80 a0 60 00 cmp %g1, 0
2006250: 02 80 00 10 be 2006290 <rtems_task_variable_delete+0x74>
2006254: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2006258: c4 00 60 04 ld [ %g1 + 4 ], %g2
200625c: 80 a0 80 19 cmp %g2, %i1
2006260: 32 80 00 09 bne,a 2006284 <rtems_task_variable_delete+0x68>
2006264: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
2006268: 10 80 00 18 b 20062c8 <rtems_task_variable_delete+0xac>
200626c: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
2006270: 80 a0 80 19 cmp %g2, %i1
2006274: 22 80 00 0e be,a 20062ac <rtems_task_variable_delete+0x90>
2006278: c4 02 40 00 ld [ %o1 ], %g2
200627c: 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;
2006280: 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) {
2006284: 80 a2 60 00 cmp %o1, 0
2006288: 32 bf ff fa bne,a 2006270 <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
200628c: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
2006290: 40 00 08 9c call 2008500 <_Thread_Enable_dispatch>
2006294: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
2006298: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
200629c: 81 c7 e0 08 ret
20062a0: 91 e8 00 01 restore %g0, %g1, %o0
20062a4: 81 c7 e0 08 ret
20062a8: 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;
20062ac: 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 );
20062b0: 40 00 00 2e call 2006368 <_RTEMS_Tasks_Invoke_task_variable_dtor>
20062b4: 01 00 00 00 nop
_Thread_Enable_dispatch();
20062b8: 40 00 08 92 call 2008500 <_Thread_Enable_dispatch>
20062bc: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
20062c0: 10 bf ff f7 b 200629c <rtems_task_variable_delete+0x80>
20062c4: 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;
20062c8: 92 10 00 01 mov %g1, %o1
20062cc: 10 bf ff f9 b 20062b0 <rtems_task_variable_delete+0x94>
20062d0: c4 22 21 64 st %g2, [ %o0 + 0x164 ]
020062d4 <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
20062d4: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
20062d8: 80 a6 60 00 cmp %i1, 0
20062dc: 02 80 00 1b be 2006348 <rtems_task_variable_get+0x74>
20062e0: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !result )
20062e4: 80 a6 a0 00 cmp %i2, 0
20062e8: 02 80 00 18 be 2006348 <rtems_task_variable_get+0x74>
20062ec: 90 10 00 18 mov %i0, %o0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
20062f0: 40 00 08 90 call 2008530 <_Thread_Get>
20062f4: 92 07 bf fc add %fp, -4, %o1
switch (location) {
20062f8: c2 07 bf fc ld [ %fp + -4 ], %g1
20062fc: 80 a0 60 00 cmp %g1, 0
2006300: 12 80 00 14 bne 2006350 <rtems_task_variable_get+0x7c>
2006304: 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;
2006308: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200630c: 80 a0 60 00 cmp %g1, 0
2006310: 32 80 00 07 bne,a 200632c <rtems_task_variable_get+0x58>
2006314: c4 00 60 04 ld [ %g1 + 4 ], %g2
2006318: 30 80 00 10 b,a 2006358 <rtems_task_variable_get+0x84>
200631c: 80 a0 60 00 cmp %g1, 0
2006320: 02 80 00 0e be 2006358 <rtems_task_variable_get+0x84> <== NEVER TAKEN
2006324: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2006328: c4 00 60 04 ld [ %g1 + 4 ], %g2
200632c: 80 a0 80 19 cmp %g2, %i1
2006330: 32 bf ff fb bne,a 200631c <rtems_task_variable_get+0x48>
2006334: 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;
2006338: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
200633c: 40 00 08 71 call 2008500 <_Thread_Enable_dispatch>
2006340: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
2006344: 82 10 20 00 clr %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2006348: 81 c7 e0 08 ret
200634c: 91 e8 00 01 restore %g0, %g1, %o0
2006350: 81 c7 e0 08 ret
2006354: 91 e8 00 01 restore %g0, %g1, %o0
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
2006358: 40 00 08 6a call 2008500 <_Thread_Enable_dispatch>
200635c: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
2006360: 10 bf ff fa b 2006348 <rtems_task_variable_get+0x74>
2006364: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
02017850 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2017850: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2017854: 11 00 80 f4 sethi %hi(0x203d000), %o0
2017858: 92 10 00 18 mov %i0, %o1
201785c: 90 12 22 a8 or %o0, 0x2a8, %o0
2017860: 40 00 0c fe call 201ac58 <_Objects_Get>
2017864: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2017868: c2 07 bf fc ld [ %fp + -4 ], %g1
201786c: 80 a0 60 00 cmp %g1, 0
2017870: 12 80 00 0c bne 20178a0 <rtems_timer_cancel+0x50>
2017874: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
2017878: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
201787c: 80 a0 60 04 cmp %g1, 4
2017880: 02 80 00 04 be 2017890 <rtems_timer_cancel+0x40> <== NEVER TAKEN
2017884: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
2017888: 40 00 15 41 call 201cd8c <_Watchdog_Remove>
201788c: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
2017890: 40 00 11 0c call 201bcc0 <_Thread_Enable_dispatch>
2017894: b0 10 20 00 clr %i0
2017898: 81 c7 e0 08 ret
201789c: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20178a0: 81 c7 e0 08 ret
20178a4: 91 e8 20 04 restore %g0, 4, %o0
02017da8 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2017da8: 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;
2017dac: 03 00 80 f4 sethi %hi(0x203d000), %g1
2017db0: fa 00 62 e8 ld [ %g1 + 0x2e8 ], %i5 ! 203d2e8 <_Timer_server>
if ( !timer_server )
2017db4: 80 a7 60 00 cmp %i5, 0
2017db8: 02 80 00 08 be 2017dd8 <rtems_timer_server_fire_when+0x30>
2017dbc: 82 10 20 0e mov 0xe, %g1
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
2017dc0: 39 00 80 f2 sethi %hi(0x203c800), %i4
2017dc4: 82 17 20 78 or %i4, 0x78, %g1 ! 203c878 <_TOD>
2017dc8: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2
2017dcc: 80 a0 a0 00 cmp %g2, 0
2017dd0: 12 80 00 04 bne 2017de0 <rtems_timer_server_fire_when+0x38><== ALWAYS TAKEN
2017dd4: 82 10 20 0b mov 0xb, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2017dd8: 81 c7 e0 08 ret
2017ddc: 91 e8 00 01 restore %g0, %g1, %o0
return RTEMS_INCORRECT_STATE;
if ( !_TOD.is_set )
return RTEMS_NOT_DEFINED;
if ( !routine )
2017de0: 80 a6 a0 00 cmp %i2, 0
2017de4: 02 bf ff fd be 2017dd8 <rtems_timer_server_fire_when+0x30>
2017de8: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
2017dec: 7f ff f3 1e call 2014a64 <_TOD_Validate>
2017df0: 90 10 00 19 mov %i1, %o0
2017df4: 80 8a 20 ff btst 0xff, %o0
2017df8: 12 80 00 04 bne 2017e08 <rtems_timer_server_fire_when+0x60>
2017dfc: 82 10 20 14 mov 0x14, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2017e00: 81 c7 e0 08 ret
2017e04: 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 );
2017e08: 7f ff f2 dd call 201497c <_TOD_To_seconds>
2017e0c: 90 10 00 19 mov %i1, %o0
2017e10: b2 10 00 08 mov %o0, %i1
2017e14: d0 1f 20 78 ldd [ %i4 + 0x78 ], %o0
2017e18: 94 10 20 00 clr %o2
2017e1c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2017e20: 40 00 52 17 call 202c67c <__divdi3>
2017e24: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 <RAM_END+0x395aca00>
if ( seconds <= _TOD_Seconds_since_epoch() )
2017e28: 80 a6 40 09 cmp %i1, %o1
2017e2c: 08 bf ff f5 bleu 2017e00 <rtems_timer_server_fire_when+0x58>
2017e30: 82 10 20 14 mov 0x14, %g1
2017e34: 92 10 00 18 mov %i0, %o1
2017e38: 11 00 80 f4 sethi %hi(0x203d000), %o0
2017e3c: 94 07 bf fc add %fp, -4, %o2
2017e40: 40 00 0b 86 call 201ac58 <_Objects_Get>
2017e44: 90 12 22 a8 or %o0, 0x2a8, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2017e48: c2 07 bf fc ld [ %fp + -4 ], %g1
2017e4c: 80 a0 60 00 cmp %g1, 0
2017e50: 12 80 00 19 bne 2017eb4 <rtems_timer_server_fire_when+0x10c>
2017e54: a0 10 00 08 mov %o0, %l0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
2017e58: 40 00 13 cd call 201cd8c <_Watchdog_Remove>
2017e5c: 90 02 20 10 add %o0, 0x10, %o0
2017e60: d0 1f 20 78 ldd [ %i4 + 0x78 ], %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
2017e64: 82 10 20 03 mov 3, %g1
2017e68: 94 10 20 00 clr %o2
2017e6c: c2 24 20 38 st %g1, [ %l0 + 0x38 ]
2017e70: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2017e74: c0 24 20 18 clr [ %l0 + 0x18 ]
2017e78: 96 12 e2 00 or %o3, 0x200, %o3
the_watchdog->routine = routine;
2017e7c: f4 24 20 2c st %i2, [ %l0 + 0x2c ]
the_watchdog->id = id;
2017e80: f0 24 20 30 st %i0, [ %l0 + 0x30 ]
2017e84: 40 00 51 fe call 202c67c <__divdi3>
2017e88: 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 );
2017e8c: 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();
2017e90: b2 26 40 09 sub %i1, %o1, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
2017e94: 90 10 00 1d mov %i5, %o0
2017e98: 92 10 00 10 mov %l0, %o1
2017e9c: 9f c0 40 00 call %g1
2017ea0: f2 24 20 1c st %i1, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
2017ea4: 40 00 0f 87 call 201bcc0 <_Thread_Enable_dispatch>
2017ea8: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2017eac: 10 bf ff cb b 2017dd8 <rtems_timer_server_fire_when+0x30>
2017eb0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
#endif
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2017eb4: 10 bf ff c9 b 2017dd8 <rtems_timer_server_fire_when+0x30>
2017eb8: 82 10 20 04 mov 4, %g1
020082a0 <sched_get_priority_max>:
#include <rtems/posix/priority.h>
int sched_get_priority_max(
int policy
)
{
20082a0: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
20082a4: 80 a6 20 04 cmp %i0, 4
20082a8: 08 80 00 08 bleu 20082c8 <sched_get_priority_max+0x28>
20082ac: 82 10 20 01 mov 1, %g1
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
20082b0: 40 00 23 bc call 20111a0 <__errno>
20082b4: b0 10 3f ff mov -1, %i0
20082b8: 82 10 20 16 mov 0x16, %g1
20082bc: c2 22 00 00 st %g1, [ %o0 ]
20082c0: 81 c7 e0 08 ret
20082c4: 81 e8 00 00 restore
int sched_get_priority_max(
int policy
)
{
switch ( policy ) {
20082c8: b1 28 40 18 sll %g1, %i0, %i0
20082cc: 80 8e 20 17 btst 0x17, %i0
20082d0: 02 bf ff f8 be 20082b0 <sched_get_priority_max+0x10> <== NEVER TAKEN
20082d4: 03 00 80 89 sethi %hi(0x2022400), %g1
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MAXIMUM_PRIORITY;
20082d8: f0 08 61 bc ldub [ %g1 + 0x1bc ], %i0 ! 20225bc <rtems_maximum_priority>
}
20082dc: 81 c7 e0 08 ret
20082e0: 91 ee 3f ff restore %i0, -1, %o0
020082e4 <sched_get_priority_min>:
* 13.3.6 Get Scheduling Parameter Limits, P1003.1b-1993, p. 258
*/
int sched_get_priority_min(
int policy
)
{
20082e4: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
20082e8: 80 a6 20 04 cmp %i0, 4
20082ec: 08 80 00 08 bleu 200830c <sched_get_priority_min+0x28>
20082f0: 82 10 00 18 mov %i0, %g1
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
20082f4: 40 00 23 ab call 20111a0 <__errno>
20082f8: b0 10 3f ff mov -1, %i0
20082fc: 82 10 20 16 mov 0x16, %g1
2008300: c2 22 00 00 st %g1, [ %o0 ]
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2008304: 81 c7 e0 08 ret
2008308: 81 e8 00 00 restore
*/
int sched_get_priority_min(
int policy
)
{
switch ( policy ) {
200830c: 84 10 20 01 mov 1, %g2
2008310: 83 28 80 01 sll %g2, %g1, %g1
2008314: 80 88 60 17 btst 0x17, %g1
2008318: 02 bf ff f7 be 20082f4 <sched_get_priority_min+0x10> <== NEVER TAKEN
200831c: b0 10 20 01 mov 1, %i0
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2008320: 81 c7 e0 08 ret
2008324: 81 e8 00 00 restore
02008328 <sched_rr_get_interval>:
int sched_rr_get_interval(
pid_t pid,
struct timespec *interval
)
{
2008328: 9d e3 bf a0 save %sp, -96, %sp
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
200832c: 80 a6 20 00 cmp %i0, 0
2008330: 12 80 00 0a bne 2008358 <sched_rr_get_interval+0x30> <== ALWAYS TAKEN
2008334: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
if ( !interval )
2008338: 02 80 00 13 be 2008384 <sched_rr_get_interval+0x5c>
200833c: 03 00 80 8c sethi %hi(0x2023000), %g1
rtems_set_errno_and_return_minus_one( EINVAL );
_Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval );
2008340: d0 00 61 b0 ld [ %g1 + 0x1b0 ], %o0 ! 20231b0 <_Thread_Ticks_per_timeslice>
2008344: 92 10 00 19 mov %i1, %o1
2008348: 40 00 0f b8 call 200c228 <_Timespec_From_ticks>
200834c: b0 10 20 00 clr %i0
return 0;
}
2008350: 81 c7 e0 08 ret
2008354: 81 e8 00 00 restore
{
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
2008358: 7f ff ee 68 call 2003cf8 <getpid>
200835c: 01 00 00 00 nop
2008360: 80 a2 00 18 cmp %o0, %i0
2008364: 02 bf ff f5 be 2008338 <sched_rr_get_interval+0x10>
2008368: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
200836c: 40 00 23 8d call 20111a0 <__errno>
2008370: b0 10 3f ff mov -1, %i0
2008374: 82 10 20 03 mov 3, %g1
2008378: c2 22 00 00 st %g1, [ %o0 ]
200837c: 81 c7 e0 08 ret
2008380: 81 e8 00 00 restore
if ( !interval )
rtems_set_errno_and_return_minus_one( EINVAL );
2008384: 40 00 23 87 call 20111a0 <__errno>
2008388: b0 10 3f ff mov -1, %i0
200838c: 82 10 20 16 mov 0x16, %g1
2008390: c2 22 00 00 st %g1, [ %o0 ]
2008394: 81 c7 e0 08 ret
2008398: 81 e8 00 00 restore
02008900 <sem_open>:
int oflag,
...
/* mode_t mode, */
/* unsigned int value */
)
{
2008900: 9d e3 bf 88 save %sp, -120, %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;
2008904: 03 00 80 8b sethi %hi(0x2022c00), %g1
2008908: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
200890c: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
++level;
2008910: 84 00 a0 01 inc %g2
2008914: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
2008918: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
200891c: fa 27 a0 58 st %i5, [ %fp + 0x58 ]
_Thread_Dispatch_disable_level = level;
2008920: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
Objects_Locations location;
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
2008924: b4 8e 62 00 andcc %i1, 0x200, %i2
2008928: 12 80 00 27 bne 20089c4 <sem_open+0xc4>
200892c: b6 10 20 00 clr %i3
const char *name,
Objects_Id *id,
size_t *len
)
{
return _POSIX_Name_to_id( &_POSIX_Semaphore_Information, name, id, len );
2008930: 39 00 80 8c sethi %hi(0x2023000), %i4
2008934: 92 10 00 18 mov %i0, %o1
2008938: 90 17 20 a4 or %i4, 0xa4, %o0
200893c: 94 07 bf f0 add %fp, -16, %o2
2008940: 7f ff fe 5c call 20082b0 <_POSIX_Name_to_id>
2008944: 96 07 bf fc add %fp, -4, %o3
* and we can just return a pointer to the id. Otherwise we may
* need to check to see if this is a "semaphore does not exist"
* or some other miscellaneous error on the name.
*/
if ( status ) {
2008948: ba 92 20 00 orcc %o0, 0, %i5
200894c: 22 80 00 0e be,a 2008984 <sem_open+0x84>
2008950: b2 0e 6a 00 and %i1, 0xa00, %i1
/*
* Unless provided a valid name that did not already exist
* and we are willing to create then it is an error.
*/
if ( !( status == ENOENT && (oflag & O_CREAT) ) ) {
2008954: 80 a7 60 02 cmp %i5, 2
2008958: 12 80 00 04 bne 2008968 <sem_open+0x68>
200895c: 80 a6 a0 00 cmp %i2, 0
2008960: 12 80 00 1d bne 20089d4 <sem_open+0xd4>
2008964: d2 07 bf fc ld [ %fp + -4 ], %o1
_Thread_Enable_dispatch();
2008968: 40 00 0e aa call 200c410 <_Thread_Enable_dispatch>
200896c: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, sem_t * );
2008970: 40 00 26 61 call 20122f4 <__errno>
2008974: 01 00 00 00 nop
2008978: fa 22 00 00 st %i5, [ %o0 ]
200897c: 81 c7 e0 08 ret
2008980: 81 e8 00 00 restore
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
2008984: 80 a6 6a 00 cmp %i1, 0xa00
2008988: 02 80 00 1f be 2008a04 <sem_open+0x104>
200898c: d2 07 bf f0 ld [ %fp + -16 ], %o1
RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Get (
sem_t *id,
Objects_Locations *location
)
{
return (POSIX_Semaphore_Control *)
2008990: 94 07 bf f8 add %fp, -8, %o2
2008994: 40 00 0a 7a call 200b37c <_Objects_Get>
2008998: 90 17 20 a4 or %i4, 0xa4, %o0
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
}
the_semaphore = _POSIX_Semaphore_Get( (sem_t *) &the_semaphore_id, &location );
the_semaphore->open_count += 1;
200899c: c2 02 20 18 ld [ %o0 + 0x18 ], %g1
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
}
the_semaphore = _POSIX_Semaphore_Get( (sem_t *) &the_semaphore_id, &location );
20089a0: d0 27 bf f4 st %o0, [ %fp + -12 ]
the_semaphore->open_count += 1;
20089a4: 82 00 60 01 inc %g1
_Thread_Enable_dispatch();
20089a8: 40 00 0e 9a call 200c410 <_Thread_Enable_dispatch>
20089ac: c2 22 20 18 st %g1, [ %o0 + 0x18 ]
_Thread_Enable_dispatch();
20089b0: 40 00 0e 98 call 200c410 <_Thread_Enable_dispatch>
20089b4: 01 00 00 00 nop
return_id:
#if defined(RTEMS_USE_16_BIT_OBJECT)
the_semaphore->Semaphore_id = the_semaphore->Object.id;
return &the_semaphore->Semaphore_id;
#else
return (sem_t *)&the_semaphore->Object.id;
20089b8: f0 07 bf f4 ld [ %fp + -12 ], %i0
20089bc: 81 c7 e0 08 ret
20089c0: 91 ee 20 08 restore %i0, 8, %o0
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
20089c4: 82 07 a0 4c add %fp, 0x4c, %g1
mode = va_arg( arg, mode_t );
value = va_arg( arg, unsigned int );
20089c8: f6 07 a0 50 ld [ %fp + 0x50 ], %i3
size_t name_len;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
20089cc: 10 bf ff d9 b 2008930 <sem_open+0x30>
20089d0: c2 27 bf ec st %g1, [ %fp + -20 ]
/*
* At this point, the semaphore does not exist and everything has been
* checked. We should go ahead and create a semaphore.
*/
status =_POSIX_Semaphore_Create_support(
20089d4: 94 10 20 00 clr %o2
20089d8: 96 10 00 1b mov %i3, %o3
20089dc: 98 07 bf f4 add %fp, -12, %o4
20089e0: 40 00 1b 4f call 200f71c <_POSIX_Semaphore_Create_support>
20089e4: 90 10 00 18 mov %i0, %o0
/*
* errno was set by Create_support, so don't set it again.
*/
_Thread_Enable_dispatch();
20089e8: 40 00 0e 8a call 200c410 <_Thread_Enable_dispatch>
20089ec: ba 10 00 08 mov %o0, %i5
if ( status == -1 )
20089f0: 80 a7 7f ff cmp %i5, -1
20089f4: 32 bf ff f2 bne,a 20089bc <sem_open+0xbc> <== ALWAYS TAKEN
20089f8: f0 07 bf f4 ld [ %fp + -12 ], %i0
the_semaphore->Semaphore_id = the_semaphore->Object.id;
return &the_semaphore->Semaphore_id;
#else
return (sem_t *)&the_semaphore->Object.id;
#endif
}
20089fc: 81 c7 e0 08 ret <== NOT EXECUTED
2008a00: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
_Thread_Enable_dispatch();
2008a04: 40 00 0e 83 call 200c410 <_Thread_Enable_dispatch>
2008a08: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
2008a0c: 40 00 26 3a call 20122f4 <__errno>
2008a10: 01 00 00 00 nop
2008a14: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
2008a18: c2 22 00 00 st %g1, [ %o0 ]
2008a1c: 81 c7 e0 08 ret
2008a20: 81 e8 00 00 restore
0200ad48 <sem_timedwait>:
int sem_timedwait(
sem_t *sem,
const struct timespec *abstime
)
{
200ad48: 9d e3 bf 98 save %sp, -104, %sp
*
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
200ad4c: 90 10 00 19 mov %i1, %o0
200ad50: 40 00 17 47 call 2010a6c <_POSIX_Absolute_timeout_to_ticks>
200ad54: 92 07 bf fc add %fp, -4, %o1
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks );
200ad58: d4 07 bf fc ld [ %fp + -4 ], %o2
* If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID,
* POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW,
* then we should not wait.
*/
status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks );
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
200ad5c: 80 a2 20 03 cmp %o0, 3
200ad60: 02 80 00 06 be 200ad78 <sem_timedwait+0x30> <== ALWAYS TAKEN
200ad64: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks );
200ad68: 40 00 1a 41 call 201166c <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED
200ad6c: 92 10 20 00 clr %o1 <== NOT EXECUTED
200ad70: 81 c7 e0 08 ret <== NOT EXECUTED
200ad74: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
200ad78: 40 00 1a 3d call 201166c <_POSIX_Semaphore_Wait_support>
200ad7c: 92 10 20 01 mov 1, %o1
lock_status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
rtems_set_errno_and_return_minus_one( ETIMEDOUT );
}
return lock_status;
}
200ad80: 81 c7 e0 08 ret
200ad84: 91 e8 00 08 restore %g0, %o0, %o0
02008254 <sigaction>:
int sigaction(
int sig,
const struct sigaction *act,
struct sigaction *oact
)
{
2008254: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
if ( oact )
2008258: 80 a6 a0 00 cmp %i2, 0
200825c: 02 80 00 0d be 2008290 <sigaction+0x3c>
2008260: 87 2e 20 02 sll %i0, 2, %g3
*oact = _POSIX_signals_Vectors[ sig ];
2008264: 05 00 80 87 sethi %hi(0x2021c00), %g2
2008268: 83 2e 20 04 sll %i0, 4, %g1
200826c: 84 10 a3 10 or %g2, 0x310, %g2
2008270: 82 20 40 03 sub %g1, %g3, %g1
2008274: c6 00 80 01 ld [ %g2 + %g1 ], %g3
2008278: 82 00 80 01 add %g2, %g1, %g1
200827c: c6 26 80 00 st %g3, [ %i2 ]
2008280: c4 00 60 04 ld [ %g1 + 4 ], %g2
2008284: c4 26 a0 04 st %g2, [ %i2 + 4 ]
2008288: c2 00 60 08 ld [ %g1 + 8 ], %g1
200828c: c2 26 a0 08 st %g1, [ %i2 + 8 ]
if ( !sig )
2008290: 80 a6 20 00 cmp %i0, 0
2008294: 02 80 00 33 be 2008360 <sigaction+0x10c>
2008298: 01 00 00 00 nop
static inline bool is_valid_signo(
int signo
)
{
return ((signo) >= 1 && (signo) <= 32 );
200829c: 82 06 3f ff add %i0, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
20082a0: 80 a0 60 1f cmp %g1, 0x1f
20082a4: 18 80 00 2f bgu 2008360 <sigaction+0x10c>
20082a8: 80 a6 20 09 cmp %i0, 9
*
* NOTE: Solaris documentation claims to "silently enforce" this which
* contradicts the POSIX specification.
*/
if ( sig == SIGKILL )
20082ac: 02 80 00 2d be 2008360 <sigaction+0x10c>
20082b0: 80 a6 60 00 cmp %i1, 0
/*
* Evaluate the new action structure and set the global signal vector
* appropriately.
*/
if ( act ) {
20082b4: 02 80 00 1a be 200831c <sigaction+0xc8> <== NEVER TAKEN
20082b8: 82 10 20 00 clr %g1
/*
* Unless the user is installing the default signal actions, then
* we can just copy the provided sigaction structure into the vectors.
*/
_ISR_Disable( level );
20082bc: 7f ff e9 c0 call 20029bc <sparc_disable_interrupts>
20082c0: 01 00 00 00 nop
20082c4: ba 10 00 08 mov %o0, %i5
if ( act->sa_handler == SIG_DFL ) {
20082c8: c2 06 60 08 ld [ %i1 + 8 ], %g1
20082cc: 80 a0 60 00 cmp %g1, 0
20082d0: 02 80 00 15 be 2008324 <sigaction+0xd0>
20082d4: 83 2e 20 02 sll %i0, 2, %g1
_POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ];
} else {
_POSIX_signals_Clear_process_signals( sig );
20082d8: 40 00 18 98 call 200e538 <_POSIX_signals_Clear_process_signals>
20082dc: 90 10 00 18 mov %i0, %o0
_POSIX_signals_Vectors[ sig ] = *act;
20082e0: c4 06 40 00 ld [ %i1 ], %g2
20082e4: 87 2e 20 02 sll %i0, 2, %g3
20082e8: 03 00 80 87 sethi %hi(0x2021c00), %g1
20082ec: b1 2e 20 04 sll %i0, 4, %i0
20082f0: 82 10 63 10 or %g1, 0x310, %g1
20082f4: b0 26 00 03 sub %i0, %g3, %i0
20082f8: c4 20 40 18 st %g2, [ %g1 + %i0 ]
20082fc: c4 06 60 04 ld [ %i1 + 4 ], %g2
2008300: b0 00 40 18 add %g1, %i0, %i0
2008304: c4 26 20 04 st %g2, [ %i0 + 4 ]
2008308: c2 06 60 08 ld [ %i1 + 8 ], %g1
200830c: c2 26 20 08 st %g1, [ %i0 + 8 ]
}
_ISR_Enable( level );
2008310: 7f ff e9 af call 20029cc <sparc_enable_interrupts>
2008314: 90 10 00 1d mov %i5, %o0
* now (signals not posted when SIG_IGN).
* + If we are now ignoring a signal that was previously pending,
* we clear the pending signal indicator.
*/
return 0;
2008318: 82 10 20 00 clr %g1
}
200831c: 81 c7 e0 08 ret
2008320: 91 e8 00 01 restore %g0, %g1, %o0
* we can just copy the provided sigaction structure into the vectors.
*/
_ISR_Disable( level );
if ( act->sa_handler == SIG_DFL ) {
_POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ];
2008324: b1 2e 20 04 sll %i0, 4, %i0
2008328: b0 26 00 01 sub %i0, %g1, %i0
200832c: 03 00 80 7e sethi %hi(0x201f800), %g1
2008330: 82 10 62 9c or %g1, 0x29c, %g1 ! 201fa9c <_POSIX_signals_Default_vectors>
2008334: c8 00 40 18 ld [ %g1 + %i0 ], %g4
2008338: 82 00 40 18 add %g1, %i0, %g1
200833c: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008340: c4 00 60 08 ld [ %g1 + 8 ], %g2
2008344: 03 00 80 87 sethi %hi(0x2021c00), %g1
2008348: 82 10 63 10 or %g1, 0x310, %g1 ! 2021f10 <_POSIX_signals_Vectors>
200834c: c8 20 40 18 st %g4, [ %g1 + %i0 ]
2008350: b0 00 40 18 add %g1, %i0, %i0
2008354: c6 26 20 04 st %g3, [ %i0 + 4 ]
2008358: 10 bf ff ee b 2008310 <sigaction+0xbc>
200835c: c4 26 20 08 st %g2, [ %i0 + 8 ]
* NOTE: Solaris documentation claims to "silently enforce" this which
* contradicts the POSIX specification.
*/
if ( sig == SIGKILL )
rtems_set_errno_and_return_minus_one( EINVAL );
2008360: 40 00 24 a6 call 20115f8 <__errno>
2008364: 01 00 00 00 nop
2008368: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
200836c: 82 10 3f ff mov -1, %g1
2008370: 10 bf ff eb b 200831c <sigaction+0xc8>
2008374: c4 22 00 00 st %g2, [ %o0 ]
020087e4 <sigtimedwait>:
int sigtimedwait(
const sigset_t *set,
siginfo_t *info,
const struct timespec *timeout
)
{
20087e4: 9d e3 bf 90 save %sp, -112, %sp
ISR_Level level;
/*
* Error check parameters before disabling interrupts.
*/
if ( !set )
20087e8: ba 96 20 00 orcc %i0, 0, %i5
20087ec: 02 80 00 83 be 20089f8 <sigtimedwait+0x214>
20087f0: 80 a6 a0 00 cmp %i2, 0
/* NOTE: This is very specifically a RELATIVE not ABSOLUTE time
* in the Open Group specification.
*/
interval = 0;
if ( timeout ) {
20087f4: 02 80 00 5b be 2008960 <sigtimedwait+0x17c>
20087f8: 80 a6 60 00 cmp %i1, 0
if ( !_Timespec_Is_valid( timeout ) )
20087fc: 40 00 0f fc call 200c7ec <_Timespec_Is_valid>
2008800: 90 10 00 1a mov %i2, %o0
2008804: 80 8a 20 ff btst 0xff, %o0
2008808: 02 80 00 7c be 20089f8 <sigtimedwait+0x214>
200880c: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
interval = _Timespec_To_ticks( timeout );
2008810: 40 00 10 0a call 200c838 <_Timespec_To_ticks>
2008814: 90 10 00 1a mov %i2, %o0
if ( !interval )
2008818: b0 92 20 00 orcc %o0, 0, %i0
200881c: 02 80 00 77 be 20089f8 <sigtimedwait+0x214> <== NEVER TAKEN
2008820: 80 a6 60 00 cmp %i1, 0
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
2008824: 02 80 00 52 be 200896c <sigtimedwait+0x188> <== NEVER TAKEN
2008828: 35 00 80 88 sethi %hi(0x2022000), %i2
the_thread = _Thread_Executing;
200882c: 35 00 80 88 sethi %hi(0x2022000), %i2
2008830: b4 16 a3 d0 or %i2, 0x3d0, %i2 ! 20223d0 <_Per_CPU_Information>
2008834: f8 06 a0 10 ld [ %i2 + 0x10 ], %i4
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
2008838: 7f ff e9 3c call 2002d28 <sparc_disable_interrupts>
200883c: f6 07 21 5c ld [ %i4 + 0x15c ], %i3
2008840: a0 10 00 08 mov %o0, %l0
if ( *set & api->signals_pending ) {
2008844: c2 07 40 00 ld [ %i5 ], %g1
2008848: c4 06 e0 d4 ld [ %i3 + 0xd4 ], %g2
200884c: 80 88 40 02 btst %g1, %g2
2008850: 12 80 00 52 bne 2008998 <sigtimedwait+0x1b4>
2008854: 01 00 00 00 nop
return the_info->si_signo;
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
2008858: 05 00 80 89 sethi %hi(0x2022400), %g2
200885c: c4 00 a2 24 ld [ %g2 + 0x224 ], %g2 ! 2022624 <_POSIX_signals_Pending>
2008860: 80 88 40 02 btst %g1, %g2
2008864: 12 80 00 2e bne 200891c <sigtimedwait+0x138>
2008868: 03 00 80 87 sethi %hi(0x2021c00), %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;
200886c: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 2021eb0 <_Thread_Dispatch_disable_level>
the_info->si_code = SI_USER;
the_info->si_value.sival_int = 0;
return signo;
}
the_info->si_signo = -1;
2008870: 86 10 3f ff mov -1, %g3
2008874: c6 26 40 00 st %g3, [ %i1 ]
++level;
2008878: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
200887c: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ]
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
the_thread->Wait.return_code = EINTR;
2008880: 82 10 20 04 mov 4, %g1
2008884: c2 27 20 34 st %g1, [ %i4 + 0x34 ]
the_thread->Wait.option = *set;
2008888: c2 07 40 00 ld [ %i5 ], %g1
the_thread->Wait.return_argument = the_info;
200888c: f2 27 20 28 st %i1, [ %i4 + 0x28 ]
the_info->si_signo = -1;
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
the_thread->Wait.return_code = EINTR;
the_thread->Wait.option = *set;
2008890: c2 27 20 30 st %g1, [ %i4 + 0x30 ]
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;
2008894: a2 10 20 01 mov 1, %l1
}
the_info->si_signo = -1;
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
2008898: 21 00 80 89 sethi %hi(0x2022400), %l0
200889c: a0 14 21 bc or %l0, 0x1bc, %l0 ! 20225bc <_POSIX_signals_Wait_queue>
20088a0: e0 27 20 44 st %l0, [ %i4 + 0x44 ]
20088a4: e2 24 20 30 st %l1, [ %l0 + 0x30 ]
the_thread->Wait.return_code = EINTR;
the_thread->Wait.option = *set;
the_thread->Wait.return_argument = the_info;
_Thread_queue_Enter_critical_section( &_POSIX_signals_Wait_queue );
_ISR_Enable( level );
20088a8: 7f ff e9 24 call 2002d38 <sparc_enable_interrupts>
20088ac: 01 00 00 00 nop
_Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval );
20088b0: 90 10 00 10 mov %l0, %o0
20088b4: 92 10 00 18 mov %i0, %o1
20088b8: 15 00 80 31 sethi %hi(0x200c400), %o2
20088bc: 40 00 0e 59 call 200c220 <_Thread_queue_Enqueue_with_handler>
20088c0: 94 12 a2 00 or %o2, 0x200, %o2 ! 200c600 <_Thread_queue_Timeout>
_Thread_Enable_dispatch();
20088c4: 40 00 0d 06 call 200bcdc <_Thread_Enable_dispatch>
20088c8: 01 00 00 00 nop
/*
* When the thread is set free by a signal, it is need to eliminate
* the signal.
*/
_POSIX_signals_Clear_signals( api, the_info->si_signo, the_info, false, false );
20088cc: d2 06 40 00 ld [ %i1 ], %o1
20088d0: 90 10 00 1b mov %i3, %o0
20088d4: 94 10 00 19 mov %i1, %o2
20088d8: 96 10 20 00 clr %o3
20088dc: 40 00 19 54 call 200ee2c <_POSIX_signals_Clear_signals>
20088e0: 98 10 20 00 clr %o4
/* Set errno only if return code is not EINTR or
* if EINTR was caused by a signal being caught, which
* was not in our set.
*/
if ( (_Thread_Executing->Wait.return_code != EINTR)
20088e4: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1
20088e8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
20088ec: 80 a0 60 04 cmp %g1, 4
20088f0: 12 80 00 3b bne 20089dc <sigtimedwait+0x1f8>
20088f4: 01 00 00 00 nop
|| !(*set & signo_to_mask( the_info->si_signo )) ) {
20088f8: f0 06 40 00 ld [ %i1 ], %i0
20088fc: c2 07 40 00 ld [ %i5 ], %g1
2008900: 84 06 3f ff add %i0, -1, %g2
2008904: a3 2c 40 02 sll %l1, %g2, %l1
2008908: 80 8c 40 01 btst %l1, %g1
200890c: 02 80 00 34 be 20089dc <sigtimedwait+0x1f8>
2008910: 01 00 00 00 nop
errno = _Thread_Executing->Wait.return_code;
return -1;
}
return the_info->si_signo;
}
2008914: 81 c7 e0 08 ret
2008918: 81 e8 00 00 restore
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
200891c: 7f ff ff 9a call 2008784 <_POSIX_signals_Get_lowest>
2008920: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
2008924: 94 10 00 19 mov %i1, %o2
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
2008928: b0 10 00 08 mov %o0, %i0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
200892c: 96 10 20 01 mov 1, %o3
2008930: 90 10 00 1b mov %i3, %o0
2008934: 92 10 00 18 mov %i0, %o1
2008938: 40 00 19 3d call 200ee2c <_POSIX_signals_Clear_signals>
200893c: 98 10 20 00 clr %o4
_ISR_Enable( level );
2008940: 7f ff e8 fe call 2002d38 <sparc_enable_interrupts>
2008944: 90 10 00 10 mov %l0, %o0
the_info->si_signo = signo;
the_info->si_code = SI_USER;
2008948: 82 10 20 01 mov 1, %g1
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
_ISR_Enable( level );
the_info->si_signo = signo;
200894c: f0 26 40 00 st %i0, [ %i1 ]
the_info->si_code = SI_USER;
2008950: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
2008954: c0 26 60 08 clr [ %i1 + 8 ]
2008958: 81 c7 e0 08 ret
200895c: 81 e8 00 00 restore
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
2008960: 12 bf ff b3 bne 200882c <sigtimedwait+0x48>
2008964: b0 10 20 00 clr %i0
the_thread = _Thread_Executing;
2008968: 35 00 80 88 sethi %hi(0x2022000), %i2
200896c: b4 16 a3 d0 or %i2, 0x3d0, %i2 ! 20223d0 <_Per_CPU_Information>
2008970: f8 06 a0 10 ld [ %i2 + 0x10 ], %i4
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
2008974: b2 07 bf f4 add %fp, -12, %i1
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
2008978: 7f ff e8 ec call 2002d28 <sparc_disable_interrupts>
200897c: f6 07 21 5c ld [ %i4 + 0x15c ], %i3
2008980: a0 10 00 08 mov %o0, %l0
if ( *set & api->signals_pending ) {
2008984: c2 07 40 00 ld [ %i5 ], %g1
2008988: c4 06 e0 d4 ld [ %i3 + 0xd4 ], %g2
200898c: 80 88 40 02 btst %g1, %g2
2008990: 22 bf ff b3 be,a 200885c <sigtimedwait+0x78>
2008994: 05 00 80 89 sethi %hi(0x2022400), %g2
/* XXX real info later */
the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending );
2008998: 7f ff ff 7b call 2008784 <_POSIX_signals_Get_lowest>
200899c: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals(
20089a0: 94 10 00 19 mov %i1, %o2
/* API signals pending? */
_ISR_Disable( level );
if ( *set & api->signals_pending ) {
/* XXX real info later */
the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending );
20089a4: 92 10 00 08 mov %o0, %o1
20089a8: d0 26 40 00 st %o0, [ %i1 ]
_POSIX_signals_Clear_signals(
20089ac: 96 10 20 00 clr %o3
20089b0: 90 10 00 1b mov %i3, %o0
20089b4: 40 00 19 1e call 200ee2c <_POSIX_signals_Clear_signals>
20089b8: 98 10 20 00 clr %o4
the_info->si_signo,
the_info,
false,
false
);
_ISR_Enable( level );
20089bc: 7f ff e8 df call 2002d38 <sparc_enable_interrupts>
20089c0: 90 10 00 10 mov %l0, %o0
the_info->si_code = SI_USER;
20089c4: 82 10 20 01 mov 1, %g1
the_info->si_value.sival_int = 0;
20089c8: c0 26 60 08 clr [ %i1 + 8 ]
false,
false
);
_ISR_Enable( level );
the_info->si_code = SI_USER;
20089cc: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
return the_info->si_signo;
20089d0: f0 06 40 00 ld [ %i1 ], %i0
20089d4: 81 c7 e0 08 ret
20089d8: 81 e8 00 00 restore
* was not in our set.
*/
if ( (_Thread_Executing->Wait.return_code != EINTR)
|| !(*set & signo_to_mask( the_info->si_signo )) ) {
errno = _Thread_Executing->Wait.return_code;
20089dc: 40 00 24 e9 call 2011d80 <__errno>
20089e0: b0 10 3f ff mov -1, %i0
20089e4: c2 06 a0 10 ld [ %i2 + 0x10 ], %g1
20089e8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
20089ec: c2 22 00 00 st %g1, [ %o0 ]
return -1;
}
return the_info->si_signo;
}
20089f0: 81 c7 e0 08 ret
20089f4: 81 e8 00 00 restore
rtems_set_errno_and_return_minus_one( EINVAL );
interval = _Timespec_To_ticks( timeout );
if ( !interval )
rtems_set_errno_and_return_minus_one( EINVAL );
20089f8: 40 00 24 e2 call 2011d80 <__errno>
20089fc: b0 10 3f ff mov -1, %i0
2008a00: 82 10 20 16 mov 0x16, %g1
2008a04: c2 22 00 00 st %g1, [ %o0 ]
2008a08: 81 c7 e0 08 ret
2008a0c: 81 e8 00 00 restore
0200a610 <sigwait>:
int sigwait(
const sigset_t *set,
int *sig
)
{
200a610: 9d e3 bf a0 save %sp, -96, %sp
int status;
status = sigtimedwait( set, NULL, NULL );
200a614: 92 10 20 00 clr %o1
200a618: 90 10 00 18 mov %i0, %o0
200a61c: 7f ff ff 6e call 200a3d4 <sigtimedwait>
200a620: 94 10 20 00 clr %o2
if ( status != -1 ) {
200a624: 80 a2 3f ff cmp %o0, -1
200a628: 02 80 00 07 be 200a644 <sigwait+0x34>
200a62c: 80 a6 60 00 cmp %i1, 0
if ( sig )
200a630: 02 80 00 0a be 200a658 <sigwait+0x48> <== NEVER TAKEN
200a634: 01 00 00 00 nop
*sig = status;
200a638: d0 26 40 00 st %o0, [ %i1 ]
return 0;
200a63c: 81 c7 e0 08 ret
200a640: 91 e8 20 00 restore %g0, 0, %o0
}
return errno;
200a644: 40 00 24 02 call 201364c <__errno>
200a648: 01 00 00 00 nop
200a64c: f0 02 00 00 ld [ %o0 ], %i0
200a650: 81 c7 e0 08 ret
200a654: 81 e8 00 00 restore
}
200a658: 81 c7 e0 08 ret <== NOT EXECUTED
200a65c: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED
0200748c <sysconf>:
*/
long sysconf(
int name
)
{
200748c: 9d e3 bf a0 save %sp, -96, %sp
if ( name == _SC_CLK_TCK )
2007490: 80 a6 20 02 cmp %i0, 2
2007494: 02 80 00 12 be 20074dc <sysconf+0x50>
2007498: 82 10 00 18 mov %i0, %g1
return (TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick());
if ( name == _SC_OPEN_MAX )
200749c: 80 a6 20 04 cmp %i0, 4
20074a0: 02 80 00 16 be 20074f8 <sysconf+0x6c>
20074a4: 80 a0 60 33 cmp %g1, 0x33
return rtems_libio_number_iops;
if ( name == _SC_GETPW_R_SIZE_MAX )
20074a8: 02 80 00 0b be 20074d4 <sysconf+0x48>
20074ac: b0 10 24 00 mov 0x400, %i0
return 1024;
if ( name == _SC_PAGESIZE )
20074b0: 80 a0 60 08 cmp %g1, 8
20074b4: 02 80 00 08 be 20074d4 <sysconf+0x48>
20074b8: 31 00 00 04 sethi %hi(0x1000), %i0
return PAGE_SIZE;
if ( name == _SC_SYMLOOP_MAX )
20074bc: 80 a0 60 4f cmp %g1, 0x4f
20074c0: 02 80 00 05 be 20074d4 <sysconf+0x48> <== NEVER TAKEN
20074c4: b0 10 20 20 mov 0x20, %i0
return RTEMS_FILESYSTEM_SYMLOOP_MAX;
#if defined(__sparc__)
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
20074c8: 80 a0 62 03 cmp %g1, 0x203
20074cc: 12 80 00 0f bne 2007508 <sysconf+0x7c> <== ALWAYS TAKEN
20074d0: b0 10 20 00 clr %i0
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
}
20074d4: 81 c7 e0 08 ret
20074d8: 81 e8 00 00 restore
int name
)
{
if ( name == _SC_CLK_TCK )
return (TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick());
20074dc: 03 00 80 6e sethi %hi(0x201b800), %g1
long sysconf(
int name
)
{
if ( name == _SC_CLK_TCK )
return (TOD_MICROSECONDS_PER_SECOND /
20074e0: d2 00 61 b4 ld [ %g1 + 0x1b4 ], %o1 ! 201b9b4 <Configuration+0xc>
20074e4: 11 00 03 d0 sethi %hi(0xf4000), %o0
20074e8: 40 00 48 24 call 2019578 <.udiv>
20074ec: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
20074f0: 81 c7 e0 08 ret
20074f4: 91 e8 00 08 restore %g0, %o0, %o0
rtems_configuration_get_microseconds_per_tick());
if ( name == _SC_OPEN_MAX )
return rtems_libio_number_iops;
20074f8: 03 00 80 76 sethi %hi(0x201d800), %g1
20074fc: f0 00 63 58 ld [ %g1 + 0x358 ], %i0 ! 201db58 <rtems_libio_number_iops>
2007500: 81 c7 e0 08 ret
2007504: 81 e8 00 00 restore
#if defined(__sparc__)
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
2007508: 40 00 24 9f call 2010784 <__errno>
200750c: b0 10 3f ff mov -1, %i0
2007510: 82 10 20 16 mov 0x16, %g1
2007514: c2 22 00 00 st %g1, [ %o0 ]
}
2007518: 81 c7 e0 08 ret
200751c: 81 e8 00 00 restore
02008a24 <timer_create>:
int timer_create(
clockid_t clock_id,
struct sigevent *evp,
timer_t *timerid
)
{
2008a24: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Timer_Control *ptimer;
if ( clock_id != CLOCK_REALTIME )
2008a28: 80 a6 20 01 cmp %i0, 1
2008a2c: 12 80 00 3d bne 2008b20 <timer_create+0xfc>
2008a30: 80 a6 a0 00 cmp %i2, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !timerid )
2008a34: 02 80 00 3b be 2008b20 <timer_create+0xfc>
2008a38: 80 a6 60 00 cmp %i1, 0
/*
* The data of the structure evp are checked in order to verify if they
* are coherent.
*/
if (evp != NULL) {
2008a3c: 02 80 00 0e be 2008a74 <timer_create+0x50>
2008a40: 03 00 80 8b sethi %hi(0x2022c00), %g1
/* The structure has data */
if ( ( evp->sigev_notify != SIGEV_NONE ) &&
2008a44: c2 06 40 00 ld [ %i1 ], %g1
2008a48: 82 00 7f ff add %g1, -1, %g1
2008a4c: 80 a0 60 01 cmp %g1, 1
2008a50: 18 80 00 34 bgu 2008b20 <timer_create+0xfc> <== NEVER TAKEN
2008a54: 01 00 00 00 nop
( evp->sigev_notify != SIGEV_SIGNAL ) ) {
/* The value of the field sigev_notify is not valid */
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( !evp->sigev_signo )
2008a58: c2 06 60 04 ld [ %i1 + 4 ], %g1
2008a5c: 80 a0 60 00 cmp %g1, 0
2008a60: 02 80 00 30 be 2008b20 <timer_create+0xfc> <== NEVER TAKEN
2008a64: 82 00 7f ff add %g1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(evp->sigev_signo) )
2008a68: 80 a0 60 1f cmp %g1, 0x1f
2008a6c: 18 80 00 2d bgu 2008b20 <timer_create+0xfc> <== NEVER TAKEN
2008a70: 03 00 80 8b sethi %hi(0x2022c00), %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;
2008a74: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 2022dd0 <_Thread_Dispatch_disable_level>
++level;
2008a78: 84 00 a0 01 inc %g2
_Thread_Dispatch_disable_level = level;
2008a7c: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
* the inactive chain of free timer control blocks.
*/
RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Allocate( void )
{
return (POSIX_Timer_Control *) _Objects_Allocate( &_POSIX_Timer_Information );
2008a80: 3b 00 80 8c sethi %hi(0x2023000), %i5
2008a84: 40 00 08 e0 call 200ae04 <_Objects_Allocate>
2008a88: 90 17 60 e4 or %i5, 0xe4, %o0 ! 20230e4 <_POSIX_Timer_Information>
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
2008a8c: 80 a2 20 00 cmp %o0, 0
2008a90: 02 80 00 2a be 2008b38 <timer_create+0x114>
2008a94: 82 10 20 02 mov 2, %g1
rtems_set_errno_and_return_minus_one( EAGAIN );
}
/* The data of the created timer are stored to use them later */
ptimer->state = POSIX_TIMER_STATE_CREATE_NEW;
2008a98: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ]
ptimer->thread_id = _Thread_Executing->Object.id;
2008a9c: 03 00 80 8c sethi %hi(0x2023000), %g1
2008aa0: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 ! 2023340 <_Per_CPU_Information+0x10>
if ( evp != NULL ) {
2008aa4: 80 a6 60 00 cmp %i1, 0
}
/* The data of the created timer are stored to use them later */
ptimer->state = POSIX_TIMER_STATE_CREATE_NEW;
ptimer->thread_id = _Thread_Executing->Object.id;
2008aa8: c2 00 60 08 ld [ %g1 + 8 ], %g1
if ( evp != NULL ) {
2008aac: 02 80 00 08 be 2008acc <timer_create+0xa8>
2008ab0: c2 22 20 38 st %g1, [ %o0 + 0x38 ]
ptimer->inf.sigev_notify = evp->sigev_notify;
2008ab4: c6 06 40 00 ld [ %i1 ], %g3
ptimer->inf.sigev_signo = evp->sigev_signo;
2008ab8: c4 06 60 04 ld [ %i1 + 4 ], %g2
ptimer->inf.sigev_value = evp->sigev_value;
2008abc: c2 06 60 08 ld [ %i1 + 8 ], %g1
ptimer->state = POSIX_TIMER_STATE_CREATE_NEW;
ptimer->thread_id = _Thread_Executing->Object.id;
if ( evp != NULL ) {
ptimer->inf.sigev_notify = evp->sigev_notify;
2008ac0: c6 22 20 40 st %g3, [ %o0 + 0x40 ]
ptimer->inf.sigev_signo = evp->sigev_signo;
2008ac4: c4 22 20 44 st %g2, [ %o0 + 0x44 ]
ptimer->inf.sigev_value = evp->sigev_value;
2008ac8: c2 22 20 48 st %g1, [ %o0 + 0x48 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2008acc: c4 12 20 0a lduh [ %o0 + 0xa ], %g2
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008ad0: ba 17 60 e4 or %i5, 0xe4, %i5
2008ad4: c6 07 60 1c ld [ %i5 + 0x1c ], %g3
}
ptimer->overrun = 0;
2008ad8: c0 22 20 68 clr [ %o0 + 0x68 ]
ptimer->timer_data.it_value.tv_sec = 0;
2008adc: c0 22 20 5c clr [ %o0 + 0x5c ]
ptimer->timer_data.it_value.tv_nsec = 0;
2008ae0: c0 22 20 60 clr [ %o0 + 0x60 ]
ptimer->timer_data.it_interval.tv_sec = 0;
2008ae4: c0 22 20 54 clr [ %o0 + 0x54 ]
ptimer->timer_data.it_interval.tv_nsec = 0;
2008ae8: c0 22 20 58 clr [ %o0 + 0x58 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2008aec: c0 22 20 18 clr [ %o0 + 0x18 ]
the_watchdog->routine = routine;
2008af0: c0 22 20 2c clr [ %o0 + 0x2c ]
the_watchdog->id = id;
2008af4: c0 22 20 30 clr [ %o0 + 0x30 ]
the_watchdog->user_data = user_data;
2008af8: c0 22 20 34 clr [ %o0 + 0x34 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2008afc: c2 02 20 08 ld [ %o0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2008b00: 85 28 a0 02 sll %g2, 2, %g2
2008b04: d0 20 c0 02 st %o0, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
2008b08: c0 22 20 0c clr [ %o0 + 0xc ]
_Watchdog_Initialize( &ptimer->Timer, NULL, 0, NULL );
_Objects_Open_u32(&_POSIX_Timer_Information, &ptimer->Object, 0);
*timerid = ptimer->Object.id;
2008b0c: c2 26 80 00 st %g1, [ %i2 ]
_Thread_Enable_dispatch();
2008b10: 40 00 0e 40 call 200c410 <_Thread_Enable_dispatch>
2008b14: b0 10 20 00 clr %i0
return 0;
}
2008b18: 81 c7 e0 08 ret
2008b1c: 81 e8 00 00 restore
if ( !evp->sigev_signo )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(evp->sigev_signo) )
rtems_set_errno_and_return_minus_one( EINVAL );
2008b20: 40 00 25 f5 call 20122f4 <__errno>
2008b24: b0 10 3f ff mov -1, %i0
2008b28: 82 10 20 16 mov 0x16, %g1
2008b2c: c2 22 00 00 st %g1, [ %o0 ]
2008b30: 81 c7 e0 08 ret
2008b34: 81 e8 00 00 restore
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
_Thread_Enable_dispatch();
2008b38: 40 00 0e 36 call 200c410 <_Thread_Enable_dispatch>
2008b3c: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
2008b40: 40 00 25 ed call 20122f4 <__errno>
2008b44: 01 00 00 00 nop
2008b48: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
2008b4c: c2 22 00 00 st %g1, [ %o0 ]
2008b50: 81 c7 e0 08 ret
2008b54: 81 e8 00 00 restore
0200767c <timer_settime>:
timer_t timerid,
int flags,
const struct itimerspec *value,
struct itimerspec *ovalue
)
{
200767c: 9d e3 bf 78 save %sp, -136, %sp
Objects_Locations location;
bool activated;
uint32_t initial_period;
struct itimerspec normalize;
if ( !value )
2007680: 80 a6 a0 00 cmp %i2, 0
2007684: 02 80 00 86 be 200789c <timer_settime+0x220> <== NEVER TAKEN
2007688: 01 00 00 00 nop
/*
* First, it verifies if the structure "value" is correct
* if the number of nanoseconds is not correct return EINVAL
*/
if ( !_Timespec_Is_valid( &(value->it_value) ) ) {
200768c: 40 00 10 84 call 200b89c <_Timespec_Is_valid>
2007690: 90 06 a0 08 add %i2, 8, %o0
2007694: 80 8a 20 ff btst 0xff, %o0
2007698: 02 80 00 81 be 200789c <timer_settime+0x220>
200769c: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( !_Timespec_Is_valid( &(value->it_interval) ) ) {
20076a0: 40 00 10 7f call 200b89c <_Timespec_Is_valid>
20076a4: 90 10 00 1a mov %i2, %o0
20076a8: 80 8a 20 ff btst 0xff, %o0
20076ac: 02 80 00 7c be 200789c <timer_settime+0x220> <== NEVER TAKEN
20076b0: 80 8e 7f fb btst -5, %i1
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) {
20076b4: 12 80 00 7a bne 200789c <timer_settime+0x220>
20076b8: 80 a6 60 04 cmp %i1, 4
rtems_set_errno_and_return_minus_one( EINVAL );
}
normalize = *value;
20076bc: c8 06 80 00 ld [ %i2 ], %g4
20076c0: c6 06 a0 04 ld [ %i2 + 4 ], %g3
20076c4: c4 06 a0 08 ld [ %i2 + 8 ], %g2
20076c8: c2 06 a0 0c ld [ %i2 + 0xc ], %g1
20076cc: c8 27 bf f0 st %g4, [ %fp + -16 ]
20076d0: c6 27 bf f4 st %g3, [ %fp + -12 ]
20076d4: c4 27 bf f8 st %g2, [ %fp + -8 ]
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
20076d8: 02 80 00 4c be 2007808 <timer_settime+0x18c>
20076dc: c2 27 bf fc st %g1, [ %fp + -4 ]
RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get (
timer_t id,
Objects_Locations *location
)
{
return (POSIX_Timer_Control *)
20076e0: 92 10 00 18 mov %i0, %o1
20076e4: 11 00 80 7c sethi %hi(0x201f000), %o0
20076e8: 94 07 bf dc add %fp, -36, %o2
20076ec: 40 00 09 ba call 2009dd4 <_Objects_Get>
20076f0: 90 12 21 24 or %o0, 0x124, %o0
* something with the structure of times of the timer: to stop, start
* or start it again
*/
ptimer = _POSIX_Timer_Get( timerid, &location );
switch ( location ) {
20076f4: c2 07 bf dc ld [ %fp + -36 ], %g1
20076f8: 80 a0 60 00 cmp %g1, 0
20076fc: 12 80 00 68 bne 200789c <timer_settime+0x220> <== NEVER TAKEN
2007700: b2 10 00 08 mov %o0, %i1
case OBJECTS_LOCAL:
/* First, it verifies if the timer must be stopped */
if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) {
2007704: c2 07 bf f8 ld [ %fp + -8 ], %g1
2007708: 80 a0 60 00 cmp %g1, 0
200770c: 12 80 00 05 bne 2007720 <timer_settime+0xa4>
2007710: c2 07 bf fc ld [ %fp + -4 ], %g1
2007714: 80 a0 60 00 cmp %g1, 0
2007718: 02 80 00 67 be 20078b4 <timer_settime+0x238>
200771c: 01 00 00 00 nop
_Thread_Enable_dispatch();
return 0;
}
/* Convert from seconds and nanoseconds to ticks */
ptimer->ticks = _Timespec_To_ticks( &value->it_interval );
2007720: 40 00 10 98 call 200b980 <_Timespec_To_ticks>
2007724: 90 10 00 1a mov %i2, %o0
2007728: d0 26 60 64 st %o0, [ %i1 + 0x64 ]
initial_period = _Timespec_To_ticks( &normalize.it_value );
200772c: 40 00 10 95 call 200b980 <_Timespec_To_ticks>
2007730: 90 07 bf f8 add %fp, -8, %o0
activated = _POSIX_Timer_Insert_helper(
2007734: d4 06 60 08 ld [ %i1 + 8 ], %o2
return 0;
}
/* Convert from seconds and nanoseconds to ticks */
ptimer->ticks = _Timespec_To_ticks( &value->it_interval );
initial_period = _Timespec_To_ticks( &normalize.it_value );
2007738: 92 10 00 08 mov %o0, %o1
activated = _POSIX_Timer_Insert_helper(
200773c: 98 10 00 19 mov %i1, %o4
2007740: 90 06 60 10 add %i1, 0x10, %o0
2007744: 17 00 80 1e sethi %hi(0x2007800), %o3
2007748: 40 00 1a 5d call 200e0bc <_POSIX_Timer_Insert_helper>
200774c: 96 12 e1 20 or %o3, 0x120, %o3 ! 2007920 <_POSIX_Timer_TSR>
initial_period,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated ) {
2007750: 80 8a 20 ff btst 0xff, %o0
2007754: 02 80 00 29 be 20077f8 <timer_settime+0x17c>
2007758: 80 a6 e0 00 cmp %i3, 0
/*
* The timer has been started and is running. So we return the
* old ones in "ovalue"
*/
if ( ovalue )
200775c: 02 80 00 0b be 2007788 <timer_settime+0x10c>
2007760: c2 07 bf f0 ld [ %fp + -16 ], %g1
*ovalue = ptimer->timer_data;
2007764: c2 06 60 54 ld [ %i1 + 0x54 ], %g1
2007768: c2 26 c0 00 st %g1, [ %i3 ]
200776c: c2 06 60 58 ld [ %i1 + 0x58 ], %g1
2007770: c2 26 e0 04 st %g1, [ %i3 + 4 ]
2007774: c2 06 60 5c ld [ %i1 + 0x5c ], %g1
2007778: c2 26 e0 08 st %g1, [ %i3 + 8 ]
200777c: c2 06 60 60 ld [ %i1 + 0x60 ], %g1
2007780: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
ptimer->timer_data = normalize;
2007784: c2 07 bf f0 ld [ %fp + -16 ], %g1
)
{
Timestamp_Control tod_as_timestamp;
Timestamp_Control *tod_as_timestamp_ptr;
tod_as_timestamp_ptr =
2007788: 90 07 bf e0 add %fp, -32, %o0
200778c: c2 26 60 54 st %g1, [ %i1 + 0x54 ]
2007790: c2 07 bf f4 ld [ %fp + -12 ], %g1
2007794: 13 00 80 7b sethi %hi(0x201ec00), %o1
2007798: c2 26 60 58 st %g1, [ %i1 + 0x58 ]
200779c: c2 07 bf f8 ld [ %fp + -8 ], %g1
20077a0: 92 12 61 98 or %o1, 0x198, %o1
20077a4: c2 26 60 5c st %g1, [ %i1 + 0x5c ]
20077a8: c2 07 bf fc ld [ %fp + -4 ], %g1
20077ac: c2 26 60 60 st %g1, [ %i1 + 0x60 ]
/* Indicate that the time is running */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
20077b0: 82 10 20 03 mov 3, %g1
20077b4: 40 00 06 b4 call 2009284 <_TOD_Get_with_nanoseconds>
20077b8: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ]
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EINVAL );
}
20077bc: f8 1a 00 00 ldd [ %o0 ], %i4
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
20077c0: 94 10 20 00 clr %o2
20077c4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
20077c8: 90 10 00 1c mov %i4, %o0
20077cc: 96 12 e2 00 or %o3, 0x200, %o3
20077d0: 40 00 4b 0e call 201a408 <__divdi3>
20077d4: 92 10 00 1d mov %i5, %o1
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
20077d8: 94 10 20 00 clr %o2
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
20077dc: d2 26 60 6c st %o1, [ %i1 + 0x6c ]
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
20077e0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
20077e4: 90 10 00 1c mov %i4, %o0
20077e8: 96 12 e2 00 or %o3, 0x200, %o3
20077ec: 40 00 4b f2 call 201a7b4 <__moddi3>
20077f0: 92 10 00 1d mov %i5, %o1
20077f4: d2 26 60 70 st %o1, [ %i1 + 0x70 ]
ptimer->timer_data = normalize;
/* Indicate that the time is running */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
_TOD_Get( &ptimer->time );
_Thread_Enable_dispatch();
20077f8: 40 00 0d 65 call 200ad8c <_Thread_Enable_dispatch>
20077fc: b0 10 20 00 clr %i0
2007800: 81 c7 e0 08 ret
2007804: 81 e8 00 00 restore
2007808: 90 07 bf e0 add %fp, -32, %o0
200780c: 13 00 80 7b sethi %hi(0x201ec00), %o1
2007810: 40 00 06 9d call 2009284 <_TOD_Get_with_nanoseconds>
2007814: 92 12 61 98 or %o1, 0x198, %o1 ! 201ed98 <_TOD>
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EINVAL );
}
2007818: f8 1a 00 00 ldd [ %o0 ], %i4
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
200781c: 94 10 20 00 clr %o2
2007820: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2007824: 90 10 00 1c mov %i4, %o0
2007828: 96 12 e2 00 or %o3, 0x200, %o3
200782c: 40 00 4a f7 call 201a408 <__divdi3>
2007830: 92 10 00 1d mov %i5, %o1
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
2007834: 94 10 20 00 clr %o2
static inline void _Timestamp64_implementation_To_timespec(
const Timestamp64_Control *_timestamp,
struct timespec *_timespec
)
{
_timespec->tv_sec = (time_t) (*_timestamp / 1000000000L);
2007838: d2 27 bf e8 st %o1, [ %fp + -24 ]
_timespec->tv_nsec = (long) (*_timestamp % 1000000000L);
200783c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3
2007840: 90 10 00 1c mov %i4, %o0
2007844: 96 12 e2 00 or %o3, 0x200, %o3
2007848: 40 00 4b db call 201a7b4 <__moddi3>
200784c: 92 10 00 1d mov %i5, %o1
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
struct timespec now;
_TOD_Get( &now );
/* Check for seconds in the past */
if ( _Timespec_Greater_than( &now, &normalize.it_value ) )
2007850: 90 07 bf f8 add %fp, -8, %o0
2007854: d2 27 bf ec st %o1, [ %fp + -20 ]
2007858: 40 00 10 24 call 200b8e8 <_Timespec_Less_than>
200785c: 92 07 bf e8 add %fp, -24, %o1
2007860: 80 8a 20 ff btst 0xff, %o0
2007864: 12 80 00 0e bne 200789c <timer_settime+0x220>
2007868: 92 07 bf f8 add %fp, -8, %o1
rtems_set_errno_and_return_minus_one( EINVAL );
_Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value );
200786c: 90 07 bf e8 add %fp, -24, %o0
2007870: 40 00 10 30 call 200b930 <_Timespec_Subtract>
2007874: 94 10 00 09 mov %o1, %o2
2007878: 92 10 00 18 mov %i0, %o1
200787c: 11 00 80 7c sethi %hi(0x201f000), %o0
2007880: 94 07 bf dc add %fp, -36, %o2
2007884: 40 00 09 54 call 2009dd4 <_Objects_Get>
2007888: 90 12 21 24 or %o0, 0x124, %o0
* something with the structure of times of the timer: to stop, start
* or start it again
*/
ptimer = _POSIX_Timer_Get( timerid, &location );
switch ( location ) {
200788c: c2 07 bf dc ld [ %fp + -36 ], %g1
2007890: 80 a0 60 00 cmp %g1, 0
2007894: 02 bf ff 9c be 2007704 <timer_settime+0x88>
2007898: b2 10 00 08 mov %o0, %i1
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EINVAL );
200789c: 40 00 25 42 call 2010da4 <__errno>
20078a0: b0 10 3f ff mov -1, %i0
20078a4: 82 10 20 16 mov 0x16, %g1
20078a8: c2 22 00 00 st %g1, [ %o0 ]
}
20078ac: 81 c7 e0 08 ret
20078b0: 81 e8 00 00 restore
case OBJECTS_LOCAL:
/* First, it verifies if the timer must be stopped */
if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) {
/* Stop the timer */
(void) _Watchdog_Remove( &ptimer->Timer );
20078b4: 40 00 11 3c call 200bda4 <_Watchdog_Remove>
20078b8: 90 02 20 10 add %o0, 0x10, %o0
/* The old data of the timer are returned */
if ( ovalue )
20078bc: 80 a6 e0 00 cmp %i3, 0
20078c0: 02 80 00 0b be 20078ec <timer_settime+0x270>
20078c4: c2 07 bf f0 ld [ %fp + -16 ], %g1
*ovalue = ptimer->timer_data;
20078c8: c2 06 60 54 ld [ %i1 + 0x54 ], %g1
20078cc: c2 26 c0 00 st %g1, [ %i3 ]
20078d0: c2 06 60 58 ld [ %i1 + 0x58 ], %g1
20078d4: c2 26 e0 04 st %g1, [ %i3 + 4 ]
20078d8: c2 06 60 5c ld [ %i1 + 0x5c ], %g1
20078dc: c2 26 e0 08 st %g1, [ %i3 + 8 ]
20078e0: c2 06 60 60 ld [ %i1 + 0x60 ], %g1
20078e4: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
/* The new data are set */
ptimer->timer_data = normalize;
20078e8: c2 07 bf f0 ld [ %fp + -16 ], %g1
/* Indicates that the timer is created and stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
/* Returns with success */
_Thread_Enable_dispatch();
return 0;
20078ec: b0 10 20 00 clr %i0
(void) _Watchdog_Remove( &ptimer->Timer );
/* The old data of the timer are returned */
if ( ovalue )
*ovalue = ptimer->timer_data;
/* The new data are set */
ptimer->timer_data = normalize;
20078f0: c2 26 60 54 st %g1, [ %i1 + 0x54 ]
20078f4: c2 07 bf f4 ld [ %fp + -12 ], %g1
20078f8: c2 26 60 58 st %g1, [ %i1 + 0x58 ]
20078fc: c2 07 bf f8 ld [ %fp + -8 ], %g1
2007900: c2 26 60 5c st %g1, [ %i1 + 0x5c ]
2007904: c2 07 bf fc ld [ %fp + -4 ], %g1
2007908: c2 26 60 60 st %g1, [ %i1 + 0x60 ]
/* Indicates that the timer is created and stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
200790c: 82 10 20 04 mov 4, %g1
/* Returns with success */
_Thread_Enable_dispatch();
2007910: 40 00 0d 1f call 200ad8c <_Thread_Enable_dispatch>
2007914: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ]
2007918: 81 c7 e0 08 ret
200791c: 81 e8 00 00 restore
020078b8 <ualarm>:
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
20078b8: 9d e3 bf 98 save %sp, -104, %sp
/*
* Initialize the timer used to implement alarm().
*/
if ( !the_timer->routine ) {
20078bc: 3b 00 80 82 sethi %hi(0x2020800), %i5
20078c0: ba 17 61 18 or %i5, 0x118, %i5 ! 2020918 <_POSIX_signals_Ualarm_timer>
20078c4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
20078c8: 80 a0 60 00 cmp %g1, 0
20078cc: 02 80 00 24 be 200795c <ualarm+0xa4>
20078d0: b8 10 00 18 mov %i0, %i4
_Watchdog_Initialize( the_timer, _POSIX_signals_Ualarm_TSR, 0, NULL );
} else {
Watchdog_States state;
state = _Watchdog_Remove( the_timer );
20078d4: 40 00 10 ed call 200bc88 <_Watchdog_Remove>
20078d8: 90 10 00 1d mov %i5, %o0
if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) {
20078dc: 90 02 3f fe add %o0, -2, %o0
20078e0: 80 a2 20 01 cmp %o0, 1
20078e4: 08 80 00 26 bleu 200797c <ualarm+0xc4> <== ALWAYS TAKEN
20078e8: b0 10 20 00 clr %i0
/*
* If useconds is non-zero, then the caller wants to schedule
* the alarm repeatedly at that interval. If the interval is
* less than a single clock tick, then fudge it to a clock tick.
*/
if ( useconds ) {
20078ec: 80 a7 20 00 cmp %i4, 0
20078f0: 02 80 00 19 be 2007954 <ualarm+0x9c>
20078f4: 37 00 03 d0 sethi %hi(0xf4000), %i3
Watchdog_Interval ticks;
tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND;
20078f8: 90 10 00 1c mov %i4, %o0
20078fc: 40 00 4e 61 call 201b280 <.udiv>
2007900: 92 16 e2 40 or %i3, 0x240, %o1
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
2007904: 92 16 e2 40 or %i3, 0x240, %o1
* less than a single clock tick, then fudge it to a clock tick.
*/
if ( useconds ) {
Watchdog_Interval ticks;
tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND;
2007908: d0 27 bf f8 st %o0, [ %fp + -8 ]
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
200790c: 40 00 4f 09 call 201b530 <.urem>
2007910: 90 10 00 1c mov %i4, %o0
2007914: 87 2a 20 07 sll %o0, 7, %g3
2007918: 82 10 00 08 mov %o0, %g1
200791c: 85 2a 20 02 sll %o0, 2, %g2
2007920: 84 20 c0 02 sub %g3, %g2, %g2
2007924: 82 00 80 01 add %g2, %g1, %g1
2007928: 83 28 60 03 sll %g1, 3, %g1
ticks = _Timespec_To_ticks( &tp );
200792c: 90 07 bf f8 add %fp, -8, %o0
2007930: 40 00 0f 9d call 200b7a4 <_Timespec_To_ticks>
2007934: c2 27 bf fc st %g1, [ %fp + -4 ]
if ( ticks == 0 )
ticks = 1;
_Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) );
2007938: 40 00 0f 9b call 200b7a4 <_Timespec_To_ticks>
200793c: 90 07 bf f8 add %fp, -8, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007940: 92 10 00 1d mov %i5, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007944: d0 27 60 0c st %o0, [ %i5 + 0xc ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007948: 11 00 80 80 sethi %hi(0x2020000), %o0
200794c: 40 00 10 70 call 200bb0c <_Watchdog_Insert>
2007950: 90 12 20 bc or %o0, 0xbc, %o0 ! 20200bc <_Watchdog_Ticks_chain>
}
return remaining;
}
2007954: 81 c7 e0 08 ret
2007958: 81 e8 00 00 restore
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
200795c: 03 00 80 1e sethi %hi(0x2007800), %g1
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2007960: c0 27 60 08 clr [ %i5 + 8 ]
the_watchdog->routine = routine;
2007964: 82 10 60 88 or %g1, 0x88, %g1
the_watchdog->id = id;
2007968: c0 27 60 20 clr [ %i5 + 0x20 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
200796c: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
the_watchdog->id = id;
the_watchdog->user_data = user_data;
2007970: c0 27 60 24 clr [ %i5 + 0x24 ]
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
useconds_t remaining = 0;
2007974: 10 bf ff de b 20078ec <ualarm+0x34>
2007978: b0 10 20 00 clr %i0
* boot. Since alarm() is dealing in seconds, we must account for
* this.
*/
ticks = the_timer->initial;
ticks -= (the_timer->stop_time - the_timer->start_time);
200797c: c4 07 60 0c ld [ %i5 + 0xc ], %g2
2007980: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2007984: d0 07 60 14 ld [ %i5 + 0x14 ], %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
2007988: 92 07 bf f8 add %fp, -8, %o1
* boot. Since alarm() is dealing in seconds, we must account for
* this.
*/
ticks = the_timer->initial;
ticks -= (the_timer->stop_time - the_timer->start_time);
200798c: 90 02 00 02 add %o0, %g2, %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
2007990: 40 00 0f 70 call 200b750 <_Timespec_From_ticks>
2007994: 90 22 00 01 sub %o0, %g1, %o0
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
2007998: c2 07 bf f8 ld [ %fp + -8 ], %g1
remaining += tp.tv_nsec / 1000;
200799c: d0 07 bf fc ld [ %fp + -4 ], %o0
ticks = the_timer->initial;
ticks -= (the_timer->stop_time - the_timer->start_time);
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
20079a0: 85 28 60 03 sll %g1, 3, %g2
20079a4: 87 28 60 08 sll %g1, 8, %g3
20079a8: 84 20 c0 02 sub %g3, %g2, %g2
remaining += tp.tv_nsec / 1000;
20079ac: 92 10 23 e8 mov 0x3e8, %o1
ticks = the_timer->initial;
ticks -= (the_timer->stop_time - the_timer->start_time);
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
20079b0: b1 28 a0 06 sll %g2, 6, %i0
20079b4: b0 26 00 02 sub %i0, %g2, %i0
remaining += tp.tv_nsec / 1000;
20079b8: 40 00 4e 34 call 201b288 <.div>
20079bc: b0 06 00 01 add %i0, %g1, %i0
ticks = the_timer->initial;
ticks -= (the_timer->stop_time - the_timer->start_time);
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
20079c0: b1 2e 20 06 sll %i0, 6, %i0
remaining += tp.tv_nsec / 1000;
20079c4: 10 bf ff ca b 20078ec <ualarm+0x34>
20079c8: b0 02 00 18 add %o0, %i0, %i0