RTEMS 4.11Annotated Report
Tue Sep 20 07:44:28 2011
0200729c <_API_extensions_Run_postdriver>:
/*
* _API_extensions_Run_postdriver
*/
void _API_extensions_Run_postdriver( void )
{
200729c: 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;
20072a0: 39 00 80 77 sethi %hi(0x201dc00), %i4
20072a4: fa 07 20 f4 ld [ %i4 + 0xf4 ], %i5 ! 201dcf4 <_API_extensions_List>
20072a8: b8 17 20 f4 or %i4, 0xf4, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20072ac: b8 07 20 04 add %i4, 4, %i4
20072b0: 80 a7 40 1c cmp %i5, %i4
20072b4: 02 80 00 09 be 20072d8 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
20072b8: 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)();
20072bc: c2 07 60 08 ld [ %i5 + 8 ], %g1
20072c0: 9f c0 40 00 call %g1
20072c4: 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 ) {
20072c8: 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 );
20072cc: 80 a7 40 1c cmp %i5, %i4
20072d0: 32 bf ff fc bne,a 20072c0 <_API_extensions_Run_postdriver+0x24>
20072d4: c2 07 60 08 ld [ %i5 + 8 ], %g1
20072d8: 81 c7 e0 08 ret
20072dc: 81 e8 00 00 restore
020072e0 <_API_extensions_Run_postswitch>:
/*
* _API_extensions_Run_postswitch
*/
void _API_extensions_Run_postswitch( void )
{
20072e0: 9d e3 bf a0 save %sp, -96, %sp
20072e4: 39 00 80 77 sethi %hi(0x201dc00), %i4
20072e8: fa 07 20 f4 ld [ %i4 + 0xf4 ], %i5 ! 201dcf4 <_API_extensions_List>
20072ec: b8 17 20 f4 or %i4, 0xf4, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20072f0: b8 07 20 04 add %i4, 4, %i4
20072f4: 80 a7 40 1c cmp %i5, %i4
20072f8: 02 80 00 0a be 2007320 <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN
20072fc: 37 00 80 78 sethi %hi(0x201e000), %i3
2007300: b6 16 e0 40 or %i3, 0x40, %i3 ! 201e040 <_Per_CPU_Information>
!_Chain_Is_tail( &_API_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (API_extensions_Control *) the_node;
(*the_extension->postswitch_hook)( _Thread_Executing );
2007304: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2007308: 9f c0 40 00 call %g1
200730c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
!_Chain_Is_tail( &_API_extensions_List, the_node ) ;
the_node = the_node->next ) {
2007310: fa 07 40 00 ld [ %i5 ], %i5
void _API_extensions_Run_postswitch( void )
{
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2007314: 80 a7 40 1c cmp %i5, %i4
2007318: 32 bf ff fc bne,a 2007308 <_API_extensions_Run_postswitch+0x28>
200731c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2007320: 81 c7 e0 08 ret
2007324: 81 e8 00 00 restore
020095b8 <_CORE_RWLock_Release>:
*/
CORE_RWLock_Status _CORE_RWLock_Release(
CORE_RWLock_Control *the_rwlock
)
{
20095b8: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Thread_Control *executing = _Thread_Executing;
20095bc: 03 00 80 6c sethi %hi(0x201b000), %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 );
20095c0: 7f ff e7 f2 call 2003588 <sparc_disable_interrupts>
20095c4: fa 00 61 0c ld [ %g1 + 0x10c ], %i5 ! 201b10c <_Per_CPU_Information+0xc>
20095c8: 84 10 00 08 mov %o0, %g2
if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){
20095cc: c2 06 20 44 ld [ %i0 + 0x44 ], %g1
20095d0: 80 a0 60 00 cmp %g1, 0
20095d4: 02 80 00 2b be 2009680 <_CORE_RWLock_Release+0xc8>
20095d8: 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 ) {
20095dc: 22 80 00 22 be,a 2009664 <_CORE_RWLock_Release+0xac>
20095e0: 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;
20095e4: 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;
20095e8: c0 26 20 44 clr [ %i0 + 0x44 ]
_ISR_Enable( level );
20095ec: 7f ff e7 eb call 2003598 <sparc_enable_interrupts>
20095f0: 90 10 00 02 mov %g2, %o0
next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue );
20095f4: 40 00 07 fb call 200b5e0 <_Thread_queue_Dequeue>
20095f8: 90 10 00 18 mov %i0, %o0
if ( next ) {
20095fc: 80 a2 20 00 cmp %o0, 0
2009600: 22 80 00 24 be,a 2009690 <_CORE_RWLock_Release+0xd8>
2009604: b0 10 20 00 clr %i0
if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) {
2009608: c2 02 20 30 ld [ %o0 + 0x30 ], %g1
200960c: 80 a0 60 01 cmp %g1, 1
2009610: 02 80 00 22 be 2009698 <_CORE_RWLock_Release+0xe0>
2009614: 84 10 20 01 mov 1, %g2
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
2009618: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
200961c: 82 00 60 01 inc %g1
the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING;
2009620: c4 26 20 44 st %g2, [ %i0 + 0x44 ]
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
2009624: 10 80 00 09 b 2009648 <_CORE_RWLock_Release+0x90>
2009628: 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 ||
200962c: 80 a0 60 01 cmp %g1, 1
2009630: 02 80 00 0b be 200965c <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN
2009634: 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;
2009638: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
200963c: 82 00 60 01 inc %g1
_Thread_queue_Extract( &the_rwlock->Wait_queue, next );
2009640: 40 00 08 f8 call 200ba20 <_Thread_queue_Extract>
2009644: 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 );
2009648: 40 00 09 47 call 200bb64 <_Thread_queue_First>
200964c: 90 10 00 18 mov %i0, %o0
if ( !next ||
2009650: 92 92 20 00 orcc %o0, 0, %o1
2009654: 32 bf ff f6 bne,a 200962c <_CORE_RWLock_Release+0x74>
2009658: c2 02 60 30 ld [ %o1 + 0x30 ], %g1
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
200965c: 81 c7 e0 08 ret
2009660: 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;
2009664: 82 00 7f ff add %g1, -1, %g1
if ( the_rwlock->number_of_readers != 0 ) {
2009668: 80 a0 60 00 cmp %g1, 0
200966c: 02 bf ff de be 20095e4 <_CORE_RWLock_Release+0x2c>
2009670: c2 26 20 48 st %g1, [ %i0 + 0x48 ]
/* must be unlocked again */
_ISR_Enable( level );
2009674: 7f ff e7 c9 call 2003598 <sparc_enable_interrupts>
2009678: b0 10 20 00 clr %i0
return CORE_RWLOCK_SUCCESSFUL;
200967c: 30 80 00 05 b,a 2009690 <_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 );
2009680: 7f ff e7 c6 call 2003598 <sparc_enable_interrupts>
2009684: b0 10 20 00 clr %i0
executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE;
2009688: 82 10 20 02 mov 2, %g1
200968c: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
2009690: 81 c7 e0 08 ret
2009694: 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;
2009698: 82 10 20 02 mov 2, %g1
200969c: c2 26 20 44 st %g1, [ %i0 + 0x44 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
20096a0: 81 c7 e0 08 ret
20096a4: 91 e8 20 00 restore %g0, 0, %o0
020096a8 <_CORE_RWLock_Timeout>:
void _CORE_RWLock_Timeout(
Objects_Id id,
void *ignored
)
{
20096a8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
20096ac: 90 10 00 18 mov %i0, %o0
20096b0: 40 00 06 f5 call 200b284 <_Thread_Get>
20096b4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20096b8: c2 07 bf fc ld [ %fp + -4 ], %g1
20096bc: 80 a0 60 00 cmp %g1, 0
20096c0: 12 80 00 09 bne 20096e4 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN
20096c4: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
20096c8: 40 00 09 69 call 200bc6c <_Thread_queue_Process_timeout>
20096cc: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
20096d0: 03 00 80 6a sethi %hi(0x201a800), %g1
20096d4: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 201abc0 <_Thread_Dispatch_disable_level>
20096d8: 84 00 bf ff add %g2, -1, %g2
20096dc: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ]
return _Thread_Dispatch_disable_level;
20096e0: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1
20096e4: 81 c7 e0 08 ret
20096e8: 81 e8 00 00 restore
02010b2c <_CORE_message_queue_Initialize>:
CORE_message_queue_Control *the_message_queue,
CORE_message_queue_Attributes *the_message_queue_attributes,
uint32_t maximum_pending_messages,
size_t maximum_message_size
)
{
2010b2c: 9d e3 bf a0 save %sp, -96, %sp
size_t message_buffering_required = 0;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
the_message_queue->number_of_pending_messages = 0;
2010b30: c0 26 20 48 clr [ %i0 + 0x48 ]
)
{
size_t message_buffering_required = 0;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
2010b34: f4 26 20 44 st %i2, [ %i0 + 0x44 ]
the_message_queue->number_of_pending_messages = 0;
the_message_queue->maximum_message_size = maximum_message_size;
2010b38: f6 26 20 4c st %i3, [ %i0 + 0x4c ]
CORE_message_queue_Control *the_message_queue,
CORE_message_queue_Notify_Handler the_handler,
void *the_argument
)
{
the_message_queue->notify_handler = the_handler;
2010b3c: c0 26 20 60 clr [ %i0 + 0x60 ]
the_message_queue->notify_argument = the_argument;
2010b40: c0 26 20 64 clr [ %i0 + 0x64 ]
/*
* Round size up to multiple of a pointer for chain init and
* check for overflow on adding overhead to each message.
*/
allocated_message_size = maximum_message_size;
if (allocated_message_size & (sizeof(uint32_t) - 1)) {
2010b44: 80 8e e0 03 btst 3, %i3
2010b48: 02 80 00 0a be 2010b70 <_CORE_message_queue_Initialize+0x44>
2010b4c: b8 10 00 1b mov %i3, %i4
allocated_message_size += sizeof(uint32_t);
2010b50: b8 06 e0 04 add %i3, 4, %i4
allocated_message_size &= ~(sizeof(uint32_t) - 1);
2010b54: b8 0f 3f fc and %i4, -4, %i4
}
if (allocated_message_size < maximum_message_size)
2010b58: 80 a6 c0 1c cmp %i3, %i4
2010b5c: 08 80 00 05 bleu 2010b70 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN
2010b60: ba 10 20 00 clr %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010b64: b0 0f 60 01 and %i5, 1, %i0
2010b68: 81 c7 e0 08 ret
2010b6c: 81 e8 00 00 restore
/*
* Calculate how much total memory is required for message buffering and
* check for overflow on the multiplication.
*/
if ( !size_t_mult32_with_overflow(
2010b70: b8 07 20 14 add %i4, 0x14, %i4
size_t a,
size_t b,
size_t *c
)
{
long long x = (long long)a*b;
2010b74: 90 10 20 00 clr %o0
2010b78: 92 10 00 1a mov %i2, %o1
2010b7c: 94 10 20 00 clr %o2
2010b80: 96 10 00 1c mov %i4, %o3
2010b84: 40 00 45 70 call 2022144 <__muldi3>
2010b88: ba 10 20 00 clr %i5
if ( x > SIZE_MAX )
2010b8c: 80 a2 20 00 cmp %o0, 0
2010b90: 34 bf ff f6 bg,a 2010b68 <_CORE_message_queue_Initialize+0x3c>
2010b94: b0 0f 60 01 and %i5, 1, %i0
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
_Workspace_Allocate( message_buffering_required );
2010b98: 40 00 0d 36 call 2014070 <_Workspace_Allocate>
2010b9c: 90 10 00 09 mov %o1, %o0
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
2010ba0: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
2010ba4: 80 a2 20 00 cmp %o0, 0
2010ba8: 02 bf ff ef be 2010b64 <_CORE_message_queue_Initialize+0x38>
2010bac: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
2010bb0: 90 06 20 68 add %i0, 0x68, %o0
2010bb4: 94 10 00 1a mov %i2, %o2
2010bb8: 40 00 17 f7 call 2016b94 <_Chain_Initialize>
2010bbc: 96 10 00 1c mov %i4, %o3
allocated_message_size + sizeof( CORE_message_queue_Buffer_control )
);
_Chain_Initialize_empty( &the_message_queue->Pending_messages );
_Thread_queue_Initialize(
2010bc0: c4 06 40 00 ld [ %i1 ], %g2
RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty(
Chain_Control *the_chain
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
2010bc4: 82 06 20 50 add %i0, 0x50, %g1
2010bc8: 84 18 a0 01 xor %g2, 1, %g2
2010bcc: 80 a0 00 02 cmp %g0, %g2
2010bd0: 84 06 20 54 add %i0, 0x54, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
2010bd4: c2 26 20 58 st %g1, [ %i0 + 0x58 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2010bd8: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
2010bdc: 90 10 00 18 mov %i0, %o0
head->previous = NULL;
2010be0: c0 26 20 54 clr [ %i0 + 0x54 ]
2010be4: 92 60 3f ff subx %g0, -1, %o1
2010be8: 94 10 20 80 mov 0x80, %o2
2010bec: 96 10 20 06 mov 6, %o3
2010bf0: 40 00 0a 8d call 2013624 <_Thread_queue_Initialize>
2010bf4: ba 10 20 01 mov 1, %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010bf8: b0 0f 60 01 and %i5, 1, %i0
2010bfc: 81 c7 e0 08 ret
2010c00: 81 e8 00 00 restore
02007840 <_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
)
{
2007840: 9d e3 bf a0 save %sp, -96, %sp
2007844: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007848: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
200784c: 40 00 07 cc call 200977c <_Thread_queue_Dequeue>
2007850: 90 10 00 1d mov %i5, %o0
2007854: 80 a2 20 00 cmp %o0, 0
2007858: 02 80 00 04 be 2007868 <_CORE_semaphore_Surrender+0x28>
200785c: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
2007860: 81 c7 e0 08 ret
2007864: 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 );
2007868: 7f ff ea 5f call 20021e4 <sparc_disable_interrupts>
200786c: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
2007870: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
2007874: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
2007878: 80 a0 40 02 cmp %g1, %g2
200787c: 1a 80 00 05 bcc 2007890 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
2007880: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
2007884: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007888: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
200788c: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
2007890: 7f ff ea 59 call 20021f4 <sparc_enable_interrupts>
2007894: 01 00 00 00 nop
}
return status;
}
2007898: 81 c7 e0 08 ret
200789c: 81 e8 00 00 restore
0200d240 <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
200d240: 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;
200d244: 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 );
200d248: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d24c: 80 a6 a0 00 cmp %i2, 0
200d250: 02 80 00 12 be 200d298 <_Chain_Initialize+0x58> <== NEVER TAKEN
200d254: 90 10 00 18 mov %i0, %o0
200d258: b4 06 bf ff add %i2, -1, %i2
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
Chain_Node *next = starting_address;
200d25c: 82 10 00 19 mov %i1, %g1
head->previous = NULL;
while ( count-- ) {
200d260: 92 10 00 1a mov %i2, %o1
)
{
size_t count = number_nodes;
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
Chain_Node *current = head;
200d264: 10 80 00 05 b 200d278 <_Chain_Initialize+0x38>
200d268: 84 10 00 18 mov %i0, %g2
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d26c: 84 10 00 01 mov %g1, %g2
200d270: b4 06 bf ff add %i2, -1, %i2
current->next = next;
next->previous = current;
current = next;
next = (Chain_Node *)
200d274: 82 10 00 03 mov %g3, %g1
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
current->next = next;
200d278: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
200d27c: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d280: 80 a6 a0 00 cmp %i2, 0
200d284: 12 bf ff fa bne 200d26c <_Chain_Initialize+0x2c>
200d288: 86 00 40 1b add %g1, %i3, %g3
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
200d28c: 40 00 2d 50 call 20187cc <.umul>
200d290: 90 10 00 1b mov %i3, %o0
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d294: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
200d298: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
200d29c: d0 26 20 08 st %o0, [ %i0 + 8 ]
}
200d2a0: 81 c7 e0 08 ret
200d2a4: 81 e8 00 00 restore
020064b0 <_Event_Surrender>:
*/
void _Event_Surrender(
Thread_Control *the_thread
)
{
20064b0: 9d e3 bf a0 save %sp, -96, %sp
rtems_event_set event_condition;
rtems_event_set seized_events;
rtems_option option_set;
RTEMS_API_Control *api;
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
20064b4: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
option_set = (rtems_option) the_thread->Wait.option;
_ISR_Disable( level );
20064b8: 7f ff ef 4b call 20021e4 <sparc_disable_interrupts>
20064bc: f8 06 20 30 ld [ %i0 + 0x30 ], %i4
pending_events = api->pending_events;
20064c0: c4 07 40 00 ld [ %i5 ], %g2
event_condition = (rtems_event_set) the_thread->Wait.count;
20064c4: 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 ) ) {
20064c8: 86 88 40 02 andcc %g1, %g2, %g3
20064cc: 02 80 00 39 be 20065b0 <_Event_Surrender+0x100>
20064d0: 09 00 80 78 sethi %hi(0x201e000), %g4
/*
* If we are in an ISR and sending to the current thread, then
* we have a critical section issue to deal with.
*/
if ( _ISR_Is_in_progress() &&
20064d4: 88 11 20 40 or %g4, 0x40, %g4 ! 201e040 <_Per_CPU_Information>
20064d8: f2 01 20 08 ld [ %g4 + 8 ], %i1
20064dc: 80 a6 60 00 cmp %i1, 0
20064e0: 32 80 00 1c bne,a 2006550 <_Event_Surrender+0xa0>
20064e4: c8 01 20 0c ld [ %g4 + 0xc ], %g4
*/
RTEMS_INLINE_ROUTINE bool _States_Is_waiting_for_event (
States_Control the_states
)
{
return (the_states & STATES_WAITING_FOR_EVENT);
20064e8: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
}
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Is_waiting_for_event( the_thread->current_state ) ) {
20064ec: 80 89 21 00 btst 0x100, %g4
20064f0: 02 80 00 30 be 20065b0 <_Event_Surrender+0x100>
20064f4: 80 a0 40 03 cmp %g1, %g3
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
20064f8: 02 80 00 04 be 2006508 <_Event_Surrender+0x58>
20064fc: 80 8f 20 02 btst 2, %i4
2006500: 02 80 00 2c be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN
2006504: 01 00 00 00 nop
api->pending_events = _Event_sets_Clear( pending_events, seized_events );
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006508: 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) );
200650c: 84 28 80 03 andn %g2, %g3, %g2
/*
* Otherwise, this is a normal send to another thread
*/
if ( _States_Is_waiting_for_event( the_thread->current_state ) ) {
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
api->pending_events = _Event_sets_Clear( pending_events, seized_events );
2006510: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
2006514: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006518: c6 20 40 00 st %g3, [ %g1 ]
_ISR_Flash( level );
200651c: 7f ff ef 36 call 20021f4 <sparc_enable_interrupts>
2006520: 01 00 00 00 nop
2006524: 7f ff ef 30 call 20021e4 <sparc_disable_interrupts>
2006528: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
200652c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
2006530: 80 a0 60 02 cmp %g1, 2
2006534: 02 80 00 21 be 20065b8 <_Event_Surrender+0x108>
2006538: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
200653c: 7f ff ef 2e call 20021f4 <sparc_enable_interrupts>
2006540: 33 04 00 ff sethi %hi(0x1003fc00), %i1
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2006544: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
2006548: 40 00 0a b4 call 2009018 <_Thread_Clear_state>
200654c: 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() &&
2006550: 80 a6 00 04 cmp %i0, %g4
2006554: 32 bf ff e6 bne,a 20064ec <_Event_Surrender+0x3c>
2006558: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
200655c: 09 00 80 79 sethi %hi(0x201e400), %g4
2006560: f2 01 20 40 ld [ %g4 + 0x40 ], %i1 ! 201e440 <_Event_Sync_state>
/*
* If we are in an ISR and sending to the current thread, then
* we have a critical section issue to deal with.
*/
if ( _ISR_Is_in_progress() &&
_Thread_Is_executing( the_thread ) &&
2006564: 80 a6 60 02 cmp %i1, 2
2006568: 02 80 00 07 be 2006584 <_Event_Surrender+0xd4> <== NEVER TAKEN
200656c: 80 a0 40 03 cmp %g1, %g3
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
2006570: f2 01 20 40 ld [ %g4 + 0x40 ], %i1
* If we are in an ISR and sending to the current thread, then
* we have a critical section issue to deal with.
*/
if ( _ISR_Is_in_progress() &&
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
2006574: 80 a6 60 01 cmp %i1, 1
2006578: 32 bf ff dd bne,a 20064ec <_Event_Surrender+0x3c>
200657c: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
2006580: 80 a0 40 03 cmp %g1, %g3
2006584: 02 80 00 04 be 2006594 <_Event_Surrender+0xe4>
2006588: 80 8f 20 02 btst 2, %i4
200658c: 02 80 00 09 be 20065b0 <_Event_Surrender+0x100> <== NEVER TAKEN
2006590: 01 00 00 00 nop
api->pending_events = _Event_sets_Clear( pending_events,seized_events );
the_thread->Wait.count = 0;
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006594: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
2006598: 84 28 80 03 andn %g2, %g3, %g2
if ( _ISR_Is_in_progress() &&
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
if ( seized_events == event_condition || _Options_Is_any(option_set) ) {
api->pending_events = _Event_sets_Clear( pending_events,seized_events );
200659c: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
20065a0: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
20065a4: c6 20 40 00 st %g3, [ %g1 ]
_Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
20065a8: 82 10 20 03 mov 3, %g1
20065ac: c2 21 20 40 st %g1, [ %g4 + 0x40 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
20065b0: 7f ff ef 11 call 20021f4 <sparc_enable_interrupts>
20065b4: 91 e8 00 08 restore %g0, %o0, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
20065b8: 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 );
20065bc: 7f ff ef 0e call 20021f4 <sparc_enable_interrupts>
20065c0: 33 04 00 ff sethi %hi(0x1003fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
20065c4: 40 00 0f ab call 200a470 <_Watchdog_Remove>
20065c8: 90 06 20 48 add %i0, 0x48, %o0
20065cc: b2 16 63 f8 or %i1, 0x3f8, %i1
20065d0: 40 00 0a 92 call 2009018 <_Thread_Clear_state>
20065d4: 81 e8 00 00 restore
020065d8 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *ignored
)
{
20065d8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
ISR_Level level;
the_thread = _Thread_Get( id, &location );
20065dc: 90 10 00 18 mov %i0, %o0
20065e0: 40 00 0b 90 call 2009420 <_Thread_Get>
20065e4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20065e8: c2 07 bf fc ld [ %fp + -4 ], %g1
20065ec: 80 a0 60 00 cmp %g1, 0
20065f0: 12 80 00 16 bne 2006648 <_Event_Timeout+0x70> <== NEVER TAKEN
20065f4: 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 );
20065f8: 7f ff ee fb call 20021e4 <sparc_disable_interrupts>
20065fc: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
2006600: 03 00 80 78 sethi %hi(0x201e000), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
2006604: c2 00 60 4c ld [ %g1 + 0x4c ], %g1 ! 201e04c <_Per_CPU_Information+0xc>
2006608: 80 a7 40 01 cmp %i5, %g1
200660c: 02 80 00 11 be 2006650 <_Event_Timeout+0x78>
2006610: c0 27 60 24 clr [ %i5 + 0x24 ]
if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
2006614: 82 10 20 06 mov 6, %g1
2006618: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
200661c: 7f ff ee f6 call 20021f4 <sparc_enable_interrupts>
2006620: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2006624: 90 10 00 1d mov %i5, %o0
2006628: 13 04 00 ff sethi %hi(0x1003fc00), %o1
200662c: 40 00 0a 7b call 2009018 <_Thread_Clear_state>
2006630: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 <RAM_END+0xdc3fff8>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2006634: 03 00 80 76 sethi %hi(0x201d800), %g1
2006638: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 201db00 <_Thread_Dispatch_disable_level>
200663c: 84 00 bf ff add %g2, -1, %g2
2006640: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
2006644: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
2006648: 81 c7 e0 08 ret
200664c: 81 e8 00 00 restore
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED )
2006650: 03 00 80 79 sethi %hi(0x201e400), %g1
2006654: c4 00 60 40 ld [ %g1 + 0x40 ], %g2 ! 201e440 <_Event_Sync_state>
2006658: 80 a0 a0 01 cmp %g2, 1
200665c: 32 bf ff ef bne,a 2006618 <_Event_Timeout+0x40>
2006660: 82 10 20 06 mov 6, %g1
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
2006664: 84 10 20 02 mov 2, %g2
2006668: c4 20 60 40 st %g2, [ %g1 + 0x40 ]
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
200666c: 10 bf ff eb b 2006618 <_Event_Timeout+0x40>
2006670: 82 10 20 06 mov 6, %g1
0200d478 <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200d478: 9d e3 bf 98 save %sp, -104, %sp
200d47c: ba 10 00 18 mov %i0, %i5
Heap_Statistics *const stats = &heap->stats;
uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE
200d480: a0 06 60 04 add %i1, 4, %l0
- HEAP_ALLOC_BONUS;
uintptr_t const page_size = heap->page_size;
200d484: ec 06 20 10 ld [ %i0 + 0x10 ], %l6
Heap_Block *block = NULL;
uintptr_t alloc_begin = 0;
uint32_t search_count = 0;
bool search_again = false;
if ( block_size_floor < alloc_size ) {
200d488: 80 a6 40 10 cmp %i1, %l0
200d48c: 18 80 00 23 bgu 200d518 <_Heap_Allocate_aligned_with_boundary+0xa0>
200d490: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
200d494: 80 a6 e0 00 cmp %i3, 0
200d498: 12 80 00 7d bne 200d68c <_Heap_Allocate_aligned_with_boundary+0x214>
200d49c: 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;
200d4a0: e2 07 60 08 ld [ %i5 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d4a4: 80 a7 40 11 cmp %i5, %l1
200d4a8: 02 80 00 18 be 200d508 <_Heap_Allocate_aligned_with_boundary+0x90>
200d4ac: b8 10 20 00 clr %i4
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200d4b0: 82 05 a0 07 add %l6, 7, %g1
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200d4b4: ae 10 20 04 mov 4, %l7
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200d4b8: c2 27 bf fc st %g1, [ %fp + -4 ]
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200d4bc: 10 80 00 0b b 200d4e8 <_Heap_Allocate_aligned_with_boundary+0x70>
200d4c0: ae 25 c0 19 sub %l7, %i1, %l7
* The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag
* field. Thus the value is about one unit larger than the real block
* size. The greater than operator takes this into account.
*/
if ( block->size_and_flag > block_size_floor ) {
if ( alignment == 0 ) {
200d4c4: 12 80 00 17 bne 200d520 <_Heap_Allocate_aligned_with_boundary+0xa8>
200d4c8: b0 04 60 08 add %l1, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d4cc: 80 a6 20 00 cmp %i0, 0
200d4d0: 12 80 00 5b bne 200d63c <_Heap_Allocate_aligned_with_boundary+0x1c4>
200d4d4: b8 07 20 01 inc %i4
break;
}
block = block->next;
200d4d8: e2 04 60 08 ld [ %l1 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d4dc: 80 a7 40 11 cmp %i5, %l1
200d4e0: 22 80 00 0b be,a 200d50c <_Heap_Allocate_aligned_with_boundary+0x94>
200d4e4: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
/*
* The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag
* field. Thus the value is about one unit larger than the real block
* size. The greater than operator takes this into account.
*/
if ( block->size_and_flag > block_size_floor ) {
200d4e8: e4 04 60 04 ld [ %l1 + 4 ], %l2
200d4ec: 80 a4 00 12 cmp %l0, %l2
200d4f0: 0a bf ff f5 bcs 200d4c4 <_Heap_Allocate_aligned_with_boundary+0x4c>
200d4f4: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
200d4f8: e2 04 60 08 ld [ %l1 + 8 ], %l1
do {
Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
block = _Heap_Free_list_first( heap );
while ( block != free_list_tail ) {
200d4fc: 80 a7 40 11 cmp %i5, %l1
200d500: 12 bf ff fa bne 200d4e8 <_Heap_Allocate_aligned_with_boundary+0x70>
200d504: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d508: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200d50c: 80 a0 40 1c cmp %g1, %i4
200d510: 0a 80 00 5a bcs 200d678 <_Heap_Allocate_aligned_with_boundary+0x200>
200d514: b0 10 20 00 clr %i0
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200d518: 81 c7 e0 08 ret
200d51c: 81 e8 00 00 restore
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
200d520: c4 07 bf fc ld [ %fp + -4 ], %g2
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200d524: ea 07 60 14 ld [ %i5 + 0x14 ], %l5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200d528: a4 0c bf fe and %l2, -2, %l2
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
200d52c: 82 20 80 15 sub %g2, %l5, %g1
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
200d530: a4 04 40 12 add %l1, %l2, %l2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d534: 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;
200d538: b0 05 c0 12 add %l7, %l2, %i0
uintptr_t const block_begin = (uintptr_t) block;
uintptr_t const block_size = _Heap_Block_size( block );
uintptr_t const block_end = block_begin + block_size;
uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block );
uintptr_t const alloc_begin_ceiling = block_end - min_block_size
200d53c: a4 00 40 12 add %g1, %l2, %l2
200d540: 40 00 2d 89 call 2018b64 <.urem>
200d544: 90 10 00 18 mov %i0, %o0
200d548: 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 ) {
200d54c: 80 a4 80 18 cmp %l2, %i0
200d550: 1a 80 00 06 bcc 200d568 <_Heap_Allocate_aligned_with_boundary+0xf0>
200d554: a8 04 60 08 add %l1, 8, %l4
200d558: 90 10 00 12 mov %l2, %o0
200d55c: 40 00 2d 82 call 2018b64 <.urem>
200d560: 92 10 00 1a mov %i2, %o1
200d564: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
200d568: 80 a6 e0 00 cmp %i3, 0
200d56c: 02 80 00 24 be 200d5fc <_Heap_Allocate_aligned_with_boundary+0x184>
200d570: 80 a5 00 18 cmp %l4, %i0
/* Ensure that the we have a valid new block at the end */
if ( alloc_begin > alloc_begin_ceiling ) {
alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment );
}
alloc_end = alloc_begin + alloc_size;
200d574: a4 06 00 19 add %i0, %i1, %l2
200d578: 92 10 00 1b mov %i3, %o1
200d57c: 40 00 2d 7a call 2018b64 <.urem>
200d580: 90 10 00 12 mov %l2, %o0
200d584: 90 24 80 08 sub %l2, %o0, %o0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200d588: 80 a6 00 08 cmp %i0, %o0
200d58c: 1a 80 00 1b bcc 200d5f8 <_Heap_Allocate_aligned_with_boundary+0x180>
200d590: 80 a2 00 12 cmp %o0, %l2
200d594: 1a 80 00 1a bcc 200d5fc <_Heap_Allocate_aligned_with_boundary+0x184>
200d598: 80 a5 00 18 cmp %l4, %i0
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
200d59c: a6 05 00 19 add %l4, %i1, %l3
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
if ( boundary_line < boundary_floor ) {
200d5a0: 80 a4 c0 08 cmp %l3, %o0
200d5a4: 08 80 00 08 bleu 200d5c4 <_Heap_Allocate_aligned_with_boundary+0x14c>
200d5a8: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d5ac: 10 bf ff c9 b 200d4d0 <_Heap_Allocate_aligned_with_boundary+0x58>
200d5b0: 80 a6 20 00 cmp %i0, 0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200d5b4: 1a 80 00 11 bcc 200d5f8 <_Heap_Allocate_aligned_with_boundary+0x180>
200d5b8: 80 a4 c0 08 cmp %l3, %o0
if ( boundary_line < boundary_floor ) {
200d5bc: 18 bf ff c4 bgu 200d4cc <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN
200d5c0: b0 10 20 00 clr %i0
return 0;
}
alloc_begin = boundary_line - alloc_size;
200d5c4: b0 22 00 19 sub %o0, %i1, %i0
200d5c8: 92 10 00 1a mov %i2, %o1
200d5cc: 40 00 2d 66 call 2018b64 <.urem>
200d5d0: 90 10 00 18 mov %i0, %o0
200d5d4: 92 10 00 1b mov %i3, %o1
200d5d8: b0 26 00 08 sub %i0, %o0, %i0
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
alloc_end = alloc_begin + alloc_size;
200d5dc: a4 06 00 19 add %i0, %i1, %l2
200d5e0: 40 00 2d 61 call 2018b64 <.urem>
200d5e4: 90 10 00 12 mov %l2, %o0
200d5e8: 90 24 80 08 sub %l2, %o0, %o0
/* Ensure boundary constaint */
if ( boundary != 0 ) {
uintptr_t const boundary_floor = alloc_begin_floor + alloc_size;
uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary );
while ( alloc_begin < boundary_line && boundary_line < alloc_end ) {
200d5ec: 80 a2 00 12 cmp %o0, %l2
200d5f0: 0a bf ff f1 bcs 200d5b4 <_Heap_Allocate_aligned_with_boundary+0x13c>
200d5f4: 80 a6 00 08 cmp %i0, %o0
boundary_line = _Heap_Align_down( alloc_end, boundary );
}
}
/* Ensure that the we have a valid new block at the beginning */
if ( alloc_begin >= alloc_begin_floor ) {
200d5f8: 80 a5 00 18 cmp %l4, %i0
200d5fc: 18 80 00 22 bgu 200d684 <_Heap_Allocate_aligned_with_boundary+0x20c>
200d600: 82 10 3f f8 mov -8, %g1
200d604: 90 10 00 18 mov %i0, %o0
200d608: a4 20 40 11 sub %g1, %l1, %l2
200d60c: 92 10 00 16 mov %l6, %o1
200d610: 40 00 2d 55 call 2018b64 <.urem>
200d614: 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 ) {
200d618: 90 a4 80 08 subcc %l2, %o0, %o0
200d61c: 02 bf ff ad be 200d4d0 <_Heap_Allocate_aligned_with_boundary+0x58>
200d620: 80 a6 20 00 cmp %i0, 0
200d624: 80 a2 00 15 cmp %o0, %l5
return alloc_begin;
}
}
return 0;
200d628: 82 40 3f ff addx %g0, -1, %g1
200d62c: b0 0e 00 01 and %i0, %g1, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d630: 80 a6 20 00 cmp %i0, 0
200d634: 02 bf ff a9 be 200d4d8 <_Heap_Allocate_aligned_with_boundary+0x60>
200d638: 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;
200d63c: c4 07 60 48 ld [ %i5 + 0x48 ], %g2
stats->searches += search_count;
200d640: c2 07 60 4c ld [ %i5 + 0x4c ], %g1
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200d644: 84 00 a0 01 inc %g2
stats->searches += search_count;
200d648: 82 00 40 1c add %g1, %i4, %g1
search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin );
} while ( search_again );
if ( alloc_begin != 0 ) {
/* Statistics */
++stats->allocs;
200d64c: c4 27 60 48 st %g2, [ %i5 + 0x48 ]
stats->searches += search_count;
200d650: c2 27 60 4c st %g1, [ %i5 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
200d654: 90 10 00 1d mov %i5, %o0
200d658: 92 10 00 11 mov %l1, %o1
200d65c: 94 10 00 18 mov %i0, %o2
200d660: 7f ff e9 9d call 2007cd4 <_Heap_Block_allocate>
200d664: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d668: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200d66c: 80 a0 40 1c cmp %g1, %i4
200d670: 1a 80 00 03 bcc 200d67c <_Heap_Allocate_aligned_with_boundary+0x204>
200d674: 01 00 00 00 nop
stats->max_search = search_count;
200d678: f8 27 60 44 st %i4, [ %i5 + 0x44 ]
}
return (void *) alloc_begin;
}
200d67c: 81 c7 e0 08 ret
200d680: 81 e8 00 00 restore
if ( free_size >= min_block_size || free_size == 0 ) {
return alloc_begin;
}
}
return 0;
200d684: 10 bf ff 92 b 200d4cc <_Heap_Allocate_aligned_with_boundary+0x54>
200d688: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
200d68c: 18 bf ff a3 bgu 200d518 <_Heap_Allocate_aligned_with_boundary+0xa0>
200d690: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
200d694: 22 bf ff 83 be,a 200d4a0 <_Heap_Allocate_aligned_with_boundary+0x28>
200d698: b4 10 00 16 mov %l6, %i2
return &heap->free_list;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap )
{
return _Heap_Free_list_head(heap)->next;
200d69c: 10 bf ff 82 b 200d4a4 <_Heap_Allocate_aligned_with_boundary+0x2c>
200d6a0: e2 07 60 08 ld [ %i5 + 8 ], %l1
0200d280 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
200d280: 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;
200d284: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200d288: c0 27 bf fc clr [ %fp + -4 ]
uintptr_t const page_size = heap->page_size;
uintptr_t const min_block_size = heap->min_block_size;
uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr;
uintptr_t const extend_area_end = extend_area_begin + extend_area_size;
200d28c: ba 06 40 1a add %i1, %i2, %i5
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
Heap_Statistics *const stats = &heap->stats;
Heap_Block *const first_block = heap->first_block;
200d290: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
Heap_Block *merge_above_block = NULL;
Heap_Block *link_below_block = NULL;
Heap_Block *link_above_block = NULL;
Heap_Block *extend_first_block = NULL;
Heap_Block *extend_last_block = NULL;
uintptr_t const page_size = heap->page_size;
200d294: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
200d298: d6 06 20 14 ld [ %i0 + 0x14 ], %o3
uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr;
uintptr_t const extend_area_end = extend_area_begin + extend_area_size;
uintptr_t const free_size = stats->free_size;
200d29c: e4 06 20 30 ld [ %i0 + 0x30 ], %l2
uintptr_t extend_first_block_size = 0;
uintptr_t extended_size = 0;
bool extend_area_ok = false;
if ( extend_area_end < extend_area_begin ) {
200d2a0: 80 a6 40 1d cmp %i1, %i5
200d2a4: 08 80 00 05 bleu 200d2b8 <_Heap_Extend+0x38>
200d2a8: a2 10 20 00 clr %l1
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d2ac: b0 0c 60 01 and %l1, 1, %i0
200d2b0: 81 c7 e0 08 ret
200d2b4: 81 e8 00 00 restore
if ( extend_area_end < extend_area_begin ) {
return false;
}
extend_area_ok = _Heap_Get_first_and_last_block(
200d2b8: 90 10 00 19 mov %i1, %o0
200d2bc: 92 10 00 1a mov %i2, %o1
200d2c0: 94 10 00 10 mov %l0, %o2
200d2c4: 98 07 bf f8 add %fp, -8, %o4
200d2c8: 7f ff e9 4a call 20077f0 <_Heap_Get_first_and_last_block>
200d2cc: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200d2d0: 80 8a 20 ff btst 0xff, %o0
200d2d4: 02 bf ff f6 be 200d2ac <_Heap_Extend+0x2c>
200d2d8: aa 10 20 00 clr %l5
200d2dc: a2 10 00 1c mov %i4, %l1
200d2e0: ac 10 20 00 clr %l6
200d2e4: a6 10 20 00 clr %l3
200d2e8: 10 80 00 14 b 200d338 <_Heap_Extend+0xb8>
200d2ec: a8 10 20 00 clr %l4
return false;
}
if ( extend_area_end == sub_area_begin ) {
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
200d2f0: 2a 80 00 02 bcs,a 200d2f8 <_Heap_Extend+0x78>
200d2f4: ac 10 00 11 mov %l1, %l6
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d2f8: 90 10 00 1a mov %i2, %o0
200d2fc: 40 00 18 31 call 20133c0 <.urem>
200d300: 92 10 00 10 mov %l0, %o1
200d304: 82 06 bf f8 add %i2, -8, %g1
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200d308: 80 a6 80 19 cmp %i2, %i1
200d30c: 02 80 00 1c be 200d37c <_Heap_Extend+0xfc>
200d310: 82 20 40 08 sub %g1, %o0, %g1
start_block->prev_size = extend_area_end;
merge_above_block = end_block;
} else if ( sub_area_end < extend_area_begin ) {
200d314: 80 a6 40 1a cmp %i1, %i2
200d318: 38 80 00 02 bgu,a 200d320 <_Heap_Extend+0xa0>
200d31c: aa 10 00 01 mov %g1, %l5
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200d320: e2 00 60 04 ld [ %g1 + 4 ], %l1
200d324: a2 0c 7f fe and %l1, -2, %l1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d328: a2 04 40 01 add %l1, %g1, %l1
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200d32c: 80 a7 00 11 cmp %i4, %l1
200d330: 22 80 00 1b be,a 200d39c <_Heap_Extend+0x11c>
200d334: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
return false;
}
do {
uintptr_t const sub_area_begin = (start_block != first_block) ?
(uintptr_t) start_block : heap->area_begin;
200d338: 80 a4 40 1c cmp %l1, %i4
200d33c: 02 80 00 66 be 200d4d4 <_Heap_Extend+0x254>
200d340: 82 10 00 11 mov %l1, %g1
uintptr_t const sub_area_end = start_block->prev_size;
Heap_Block *const end_block =
_Heap_Block_of_alloc_area( sub_area_end, page_size );
if (
200d344: 80 a0 40 1d cmp %g1, %i5
200d348: 0a 80 00 70 bcs 200d508 <_Heap_Extend+0x288>
200d34c: f4 04 40 00 ld [ %l1 ], %i2
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
}
if ( extend_area_end == sub_area_begin ) {
200d350: 80 a0 40 1d cmp %g1, %i5
200d354: 12 bf ff e7 bne 200d2f0 <_Heap_Extend+0x70>
200d358: 80 a7 40 1a cmp %i5, %i2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d35c: 90 10 00 1a mov %i2, %o0
200d360: 40 00 18 18 call 20133c0 <.urem>
200d364: 92 10 00 10 mov %l0, %o1
200d368: 82 06 bf f8 add %i2, -8, %g1
200d36c: a8 10 00 11 mov %l1, %l4
merge_below_block = start_block;
} else if ( extend_area_end < sub_area_end ) {
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200d370: 80 a6 80 19 cmp %i2, %i1
200d374: 12 bf ff e8 bne 200d314 <_Heap_Extend+0x94> <== ALWAYS TAKEN
200d378: 82 20 40 08 sub %g1, %o0, %g1
start_block->prev_size = extend_area_end;
200d37c: fa 24 40 00 st %i5, [ %l1 ]
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200d380: e2 00 60 04 ld [ %g1 + 4 ], %l1
200d384: a2 0c 7f fe and %l1, -2, %l1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d388: a2 04 40 01 add %l1, %g1, %l1
} else if ( sub_area_end < extend_area_begin ) {
link_above_block = end_block;
}
start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) );
} while ( start_block != first_block );
200d38c: 80 a7 00 11 cmp %i4, %l1
200d390: 12 bf ff ea bne 200d338 <_Heap_Extend+0xb8> <== NEVER TAKEN
200d394: a6 10 00 01 mov %g1, %l3
if ( extend_area_begin < heap->area_begin ) {
200d398: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200d39c: 80 a6 40 01 cmp %i1, %g1
200d3a0: 3a 80 00 55 bcc,a 200d4f4 <_Heap_Extend+0x274>
200d3a4: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200d3a8: f2 26 20 18 st %i1, [ %i0 + 0x18 ]
} else if ( heap->area_end < extend_area_end ) {
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
200d3ac: c2 07 bf f8 ld [ %fp + -8 ], %g1
200d3b0: 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 ) {
200d3b4: c8 06 20 20 ld [ %i0 + 0x20 ], %g4
heap->area_begin = extend_area_begin;
} else if ( heap->area_end < extend_area_end ) {
heap->area_end = extend_area_end;
}
extend_first_block_size =
200d3b8: 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;
200d3bc: fa 20 40 00 st %i5, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200d3c0: b8 10 e0 01 or %g3, 1, %i4
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
extend_first_block->prev_size = extend_area_end;
extend_first_block->size_and_flag =
200d3c4: f8 20 60 04 st %i4, [ %g1 + 4 ]
extend_first_block_size | HEAP_PREV_BLOCK_USED;
_Heap_Protection_block_initialize( heap, extend_first_block );
extend_last_block->prev_size = extend_first_block_size;
200d3c8: 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 ) {
200d3cc: 80 a1 00 01 cmp %g4, %g1
200d3d0: 08 80 00 43 bleu 200d4dc <_Heap_Extend+0x25c>
200d3d4: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
200d3d8: c2 26 20 20 st %g1, [ %i0 + 0x20 ]
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200d3dc: 80 a5 20 00 cmp %l4, 0
200d3e0: 02 80 00 63 be 200d56c <_Heap_Extend+0x2ec>
200d3e4: 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;
200d3e8: f8 06 20 10 ld [ %i0 + 0x10 ], %i4
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up(
uintptr_t value,
uintptr_t alignment
)
{
uintptr_t remainder = value % alignment;
200d3ec: 92 10 00 1c mov %i4, %o1
200d3f0: 40 00 17 f4 call 20133c0 <.urem>
200d3f4: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200d3f8: 80 a2 20 00 cmp %o0, 0
200d3fc: 02 80 00 04 be 200d40c <_Heap_Extend+0x18c>
200d400: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
200d404: b2 06 40 1c add %i1, %i4, %i1
200d408: 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 =
200d40c: 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;
200d410: 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 =
200d414: 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;
200d418: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
200d41c: 90 10 00 18 mov %i0, %o0
200d420: 92 10 00 01 mov %g1, %o1
200d424: 7f ff ff 8d call 200d258 <_Heap_Free_block>
200d428: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200d42c: 80 a4 e0 00 cmp %l3, 0
200d430: 02 80 00 3b be 200d51c <_Heap_Extend+0x29c>
200d434: ba 07 7f f8 add %i5, -8, %i5
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d438: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
uintptr_t extend_area_end
)
{
uintptr_t const page_size = heap->page_size;
uintptr_t const last_block_begin = (uintptr_t) last_block;
uintptr_t const last_block_new_size = _Heap_Align_down(
200d43c: ba 27 40 13 sub %i5, %l3, %i5
200d440: 40 00 17 e0 call 20133c0 <.urem>
200d444: 90 10 00 1d mov %i5, %o0
);
Heap_Block *const new_last_block =
_Heap_Block_at( last_block, last_block_new_size );
new_last_block->size_and_flag =
(last_block->size_and_flag - last_block_new_size)
200d448: c2 04 e0 04 ld [ %l3 + 4 ], %g1
200d44c: ba 27 40 08 sub %i5, %o0, %i5
200d450: 82 20 40 1d sub %g1, %i5, %g1
| HEAP_PREV_BLOCK_USED;
200d454: 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 =
200d458: 84 07 40 13 add %i5, %l3, %g2
200d45c: 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;
200d460: 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 );
200d464: 90 10 00 18 mov %i0, %o0
200d468: 82 08 60 01 and %g1, 1, %g1
200d46c: 92 10 00 13 mov %l3, %o1
block->size_and_flag = size | flag;
200d470: ba 17 40 01 or %i5, %g1, %i5
200d474: 7f ff ff 79 call 200d258 <_Heap_Free_block>
200d478: fa 24 e0 04 st %i5, [ %l3 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200d47c: 80 a4 e0 00 cmp %l3, 0
200d480: 02 80 00 34 be 200d550 <_Heap_Extend+0x2d0>
200d484: 80 a5 20 00 cmp %l4, 0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d488: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
* This feature will be used to terminate the scattered heap area list. See
* also _Heap_Extend().
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
200d48c: c6 06 20 20 ld [ %i0 + 0x20 ], %g3
RTEMS_INLINE_ROUTINE void _Heap_Block_set_size(
Heap_Block *block,
uintptr_t size
)
{
uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED;
200d490: c4 00 60 04 ld [ %g1 + 4 ], %g2
* This feature will be used to terminate the scattered heap area list. See
* also _Heap_Extend().
*/
RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap )
{
_Heap_Block_set_size(
200d494: 86 20 c0 01 sub %g3, %g1, %g3
RTEMS_INLINE_ROUTINE void _Heap_Block_set_size(
Heap_Block *block,
uintptr_t size
)
{
uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED;
200d498: 84 08 a0 01 and %g2, 1, %g2
block->size_and_flag = size | flag;
200d49c: 84 10 80 03 or %g2, %g3, %g2
200d4a0: c4 20 60 04 st %g2, [ %g1 + 4 ]
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
/* Statistics */
stats->size += extended_size;
200d4a4: c2 06 20 2c ld [ %i0 + 0x2c ], %g1
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200d4a8: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
stats->size += extended_size;
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
200d4ac: a2 10 20 01 mov 1, %l1
_Heap_Free_block( heap, extend_first_block );
}
_Heap_Set_last_block_size( heap );
extended_size = stats->free_size - free_size;
200d4b0: a4 20 80 12 sub %g2, %l2, %l2
/* Statistics */
stats->size += extended_size;
200d4b4: 82 00 40 12 add %g1, %l2, %g1
if ( extended_size_ptr != NULL )
200d4b8: 80 a6 e0 00 cmp %i3, 0
200d4bc: 02 bf ff 7c be 200d2ac <_Heap_Extend+0x2c> <== NEVER TAKEN
200d4c0: c2 26 20 2c st %g1, [ %i0 + 0x2c ]
*extended_size_ptr = extended_size;
200d4c4: e4 26 c0 00 st %l2, [ %i3 ]
return true;
}
200d4c8: b0 0c 60 01 and %l1, 1, %i0
200d4cc: 81 c7 e0 08 ret
200d4d0: 81 e8 00 00 restore
return false;
}
do {
uintptr_t const sub_area_begin = (start_block != first_block) ?
(uintptr_t) start_block : heap->area_begin;
200d4d4: 10 bf ff 9c b 200d344 <_Heap_Extend+0xc4>
200d4d8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
extend_last_block->size_and_flag = 0;
_Heap_Protection_block_initialize( heap, extend_last_block );
if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) {
heap->first_block = extend_first_block;
} else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) {
200d4dc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200d4e0: 80 a0 40 02 cmp %g1, %g2
200d4e4: 2a bf ff be bcs,a 200d3dc <_Heap_Extend+0x15c>
200d4e8: c4 26 20 24 st %g2, [ %i0 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200d4ec: 10 bf ff bd b 200d3e0 <_Heap_Extend+0x160>
200d4f0: 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 ) {
200d4f4: 80 a7 40 01 cmp %i5, %g1
200d4f8: 38 bf ff ad bgu,a 200d3ac <_Heap_Extend+0x12c>
200d4fc: fa 26 20 1c st %i5, [ %i0 + 0x1c ]
heap->area_end = extend_area_end;
}
extend_first_block_size =
(uintptr_t) extend_last_block - (uintptr_t) extend_first_block;
200d500: 10 bf ff ac b 200d3b0 <_Heap_Extend+0x130>
200d504: 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 (
200d508: 80 a6 40 1a cmp %i1, %i2
200d50c: 1a bf ff 92 bcc 200d354 <_Heap_Extend+0xd4>
200d510: 80 a0 40 1d cmp %g1, %i5
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
200d514: 10 bf ff 66 b 200d2ac <_Heap_Extend+0x2c>
200d518: a2 10 20 00 clr %l1
);
}
if ( merge_above_block != NULL ) {
_Heap_Merge_above( heap, merge_above_block, extend_area_end );
} else if ( link_above_block != NULL ) {
200d51c: 80 a5 60 00 cmp %l5, 0
200d520: 02 bf ff d7 be 200d47c <_Heap_Extend+0x1fc>
200d524: 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;
200d528: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200d52c: c2 07 bf fc ld [ %fp + -4 ], %g1
200d530: 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 );
200d534: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200d538: 84 10 c0 02 or %g3, %g2, %g2
200d53c: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200d540: c4 00 60 04 ld [ %g1 + 4 ], %g2
200d544: 84 10 a0 01 or %g2, 1, %g2
200d548: 10 bf ff cd b 200d47c <_Heap_Extend+0x1fc>
200d54c: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200d550: 32 bf ff cf bne,a 200d48c <_Heap_Extend+0x20c>
200d554: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200d558: d2 07 bf f8 ld [ %fp + -8 ], %o1
200d55c: 7f ff ff 3f call 200d258 <_Heap_Free_block>
200d560: 90 10 00 18 mov %i0, %o0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d564: 10 bf ff ca b 200d48c <_Heap_Extend+0x20c>
200d568: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
_Heap_Merge_below( heap, extend_area_begin, merge_below_block );
} else if ( link_below_block != NULL ) {
200d56c: 80 a5 a0 00 cmp %l6, 0
200d570: 02 bf ff b0 be 200d430 <_Heap_Extend+0x1b0>
200d574: 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;
200d578: ac 25 80 02 sub %l6, %g2, %l6
200d57c: 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 =
200d580: 10 bf ff ac b 200d430 <_Heap_Extend+0x1b0>
200d584: ec 20 a0 04 st %l6, [ %g2 + 4 ]
0200d6a4 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200d6a4: 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 ) {
200d6a8: 80 a6 60 00 cmp %i1, 0
200d6ac: 02 80 00 56 be 200d804 <_Heap_Free+0x160>
200d6b0: 84 10 20 01 mov 1, %g2
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down(
uintptr_t value,
uintptr_t alignment
)
{
return value - (value % alignment);
200d6b4: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200d6b8: 40 00 2d 2b call 2018b64 <.urem>
200d6bc: 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
200d6c0: 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);
200d6c4: 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);
200d6c8: ba 27 40 08 sub %i5, %o0, %i5
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200d6cc: 80 a7 40 01 cmp %i5, %g1
200d6d0: 0a 80 00 4d bcs 200d804 <_Heap_Free+0x160>
200d6d4: 84 10 20 00 clr %g2
200d6d8: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
200d6dc: 80 a7 40 04 cmp %i5, %g4
200d6e0: 38 80 00 4a bgu,a 200d808 <_Heap_Free+0x164>
200d6e4: b0 08 a0 01 and %g2, 1, %i0
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d6e8: de 07 60 04 ld [ %i5 + 4 ], %o7
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200d6ec: b2 0b ff fe and %o7, -2, %i1
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d6f0: 86 06 40 1d add %i1, %i5, %g3
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200d6f4: 80 a0 40 03 cmp %g1, %g3
200d6f8: 38 80 00 44 bgu,a 200d808 <_Heap_Free+0x164> <== NEVER TAKEN
200d6fc: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200d700: 80 a1 00 03 cmp %g4, %g3
200d704: 2a 80 00 41 bcs,a 200d808 <_Heap_Free+0x164> <== NEVER TAKEN
200d708: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200d70c: da 00 e0 04 ld [ %g3 + 4 ], %o5
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200d710: 80 8b 60 01 btst 1, %o5
200d714: 02 80 00 3c be 200d804 <_Heap_Free+0x160>
200d718: 98 0b 7f fe and %o5, -2, %o4
return true;
}
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
200d71c: 80 a1 00 03 cmp %g4, %g3
200d720: 02 80 00 06 be 200d738 <_Heap_Free+0x94>
200d724: 9a 10 20 00 clr %o5
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d728: 84 00 c0 0c add %g3, %o4, %g2
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
200d72c: da 00 a0 04 ld [ %g2 + 4 ], %o5
200d730: 9a 0b 60 01 and %o5, 1, %o5
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
200d734: 9a 1b 60 01 xor %o5, 1, %o5
next_block_size = _Heap_Block_size( next_block );
next_is_free = next_block != heap->last_block
&& !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size ));
if ( !_Heap_Is_prev_used( block ) ) {
200d738: 80 8b e0 01 btst 1, %o7
200d73c: 12 80 00 1c bne 200d7ac <_Heap_Free+0x108>
200d740: 80 8b 60 ff btst 0xff, %o5
uintptr_t const prev_size = block->prev_size;
200d744: d6 07 40 00 ld [ %i5 ], %o3
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200d748: 9e 27 40 0b sub %i5, %o3, %o7
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200d74c: 80 a0 40 0f cmp %g1, %o7
200d750: 18 80 00 2d bgu 200d804 <_Heap_Free+0x160> <== NEVER TAKEN
200d754: 84 10 20 00 clr %g2
200d758: 80 a1 00 0f cmp %g4, %o7
200d75c: 2a 80 00 2b bcs,a 200d808 <_Heap_Free+0x164> <== NEVER TAKEN
200d760: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
200d764: c2 03 e0 04 ld [ %o7 + 4 ], %g1
return( false );
}
/* As we always coalesce free blocks, the block that preceedes prev_block
must have been used. */
if ( !_Heap_Is_prev_used ( prev_block) ) {
200d768: 80 88 60 01 btst 1, %g1
200d76c: 02 80 00 26 be 200d804 <_Heap_Free+0x160> <== NEVER TAKEN
200d770: 80 8b 60 ff btst 0xff, %o5
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200d774: 02 80 00 39 be 200d858 <_Heap_Free+0x1b4>
200d778: 96 06 40 0b add %i1, %o3, %o3
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d77c: c2 00 e0 08 ld [ %g3 + 8 ], %g1
200d780: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
}
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
200d784: c6 06 20 38 ld [ %i0 + 0x38 ], %g3
RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block )
{
Heap_Block *next = block->next;
Heap_Block *prev = block->prev;
prev->next = next;
200d788: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
200d78c: c4 20 60 0c st %g2, [ %g1 + 0xc ]
200d790: 82 00 ff ff add %g3, -1, %g1
200d794: 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;
200d798: 98 02 c0 0c add %o3, %o4, %o4
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200d79c: 82 13 20 01 or %o4, 1, %g1
next_block = _Heap_Block_at( prev_block, size );
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
200d7a0: d8 23 00 0f st %o4, [ %o4 + %o7 ]
if ( next_is_free ) { /* coalesce both */
uintptr_t const size = block_size + prev_size + next_block_size;
_Heap_Free_list_remove( next_block );
stats->free_blocks -= 1;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200d7a4: 10 80 00 0e b 200d7dc <_Heap_Free+0x138>
200d7a8: c2 23 e0 04 st %g1, [ %o7 + 4 ]
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
200d7ac: 22 80 00 19 be,a 200d810 <_Heap_Free+0x16c>
200d7b0: c4 06 20 08 ld [ %i0 + 8 ], %g2
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d7b4: c4 00 e0 08 ld [ %g3 + 8 ], %g2
200d7b8: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
)
{
Heap_Block *next = old_block->next;
Heap_Block *prev = old_block->prev;
new_block->next = next;
200d7bc: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = prev;
200d7c0: c2 27 60 0c st %g1, [ %i5 + 0xc ]
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
200d7c4: 98 03 00 19 add %o4, %i1, %o4
next->prev = new_block;
200d7c8: fa 20 a0 0c st %i5, [ %g2 + 0xc ]
prev->next = new_block;
200d7cc: fa 20 60 08 st %i5, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200d7d0: 84 13 20 01 or %o4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200d7d4: d8 23 00 1d st %o4, [ %o4 + %i5 ]
next_block->prev_size = size;
}
} else if ( next_is_free ) { /* coalesce next */
uintptr_t const size = block_size + next_block_size;
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200d7d8: c4 27 60 04 st %g2, [ %i5 + 4 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d7dc: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
200d7e0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->free_size += block_size;
200d7e4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d7e8: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
200d7ec: 82 00 60 01 inc %g1
stats->free_size += block_size;
200d7f0: b2 00 c0 19 add %g3, %i1, %i1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d7f4: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
200d7f8: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->free_size += block_size;
200d7fc: f2 26 20 30 st %i1, [ %i0 + 0x30 ]
return( true );
200d800: 84 10 20 01 mov 1, %g2
}
200d804: b0 08 a0 01 and %g2, 1, %i0
200d808: 81 c7 e0 08 ret
200d80c: 81 e8 00 00 restore
next_block->prev_size = size;
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
200d810: 82 16 60 01 or %i1, 1, %g1
200d814: c2 27 60 04 st %g1, [ %i5 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d818: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200d81c: f0 27 60 0c st %i0, [ %i5 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200d820: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200d824: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200d828: fa 20 a0 0c st %i5, [ %g2 + 0xc ]
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d82c: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
200d830: f2 26 40 1d st %i1, [ %i1 + %i5 ]
} else { /* no coalesce */
/* Add 'block' to the head of the free blocks list as it tends to
produce less fragmentation than adding to the tail. */
_Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block );
block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d834: 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 ) {
200d838: 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;
200d83c: 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;
200d840: fa 26 20 08 st %i5, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200d844: 80 a0 40 02 cmp %g1, %g2
200d848: 08 bf ff e5 bleu 200d7dc <_Heap_Free+0x138>
200d84c: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200d850: 10 bf ff e3 b 200d7dc <_Heap_Free+0x138>
200d854: 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;
200d858: 82 12 e0 01 or %o3, 1, %g1
200d85c: c2 23 e0 04 st %g1, [ %o7 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d860: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
200d864: d6 26 40 1d st %o3, [ %i1 + %i5 ]
_HAssert(!_Heap_Is_prev_used( next_block));
next_block->prev_size = size;
} else { /* coalesce prev */
uintptr_t const size = block_size + prev_size;
prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d868: 82 08 7f fe and %g1, -2, %g1
200d86c: 10 bf ff dc b 200d7dc <_Heap_Free+0x138>
200d870: c2 20 e0 04 st %g1, [ %g3 + 4 ]
0200dd8c <_Heap_Get_information>:
void _Heap_Get_information(
Heap_Control *the_heap,
Heap_Information_block *the_info
)
{
200dd8c: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *the_block = the_heap->first_block;
200dd90: fa 06 20 20 ld [ %i0 + 0x20 ], %i5
Heap_Block *const end = the_heap->last_block;
200dd94: f8 06 20 24 ld [ %i0 + 0x24 ], %i4
memset(the_info, 0, sizeof(*the_info));
200dd98: 92 10 20 00 clr %o1
200dd9c: 90 10 00 19 mov %i1, %o0
200dda0: 40 00 0a 9b call 201080c <memset>
200dda4: 94 10 20 18 mov 0x18, %o2
while ( the_block != end ) {
200dda8: 80 a7 40 1c cmp %i5, %i4
200ddac: 02 80 00 17 be 200de08 <_Heap_Get_information+0x7c> <== NEVER TAKEN
200ddb0: 01 00 00 00 nop
200ddb4: c6 07 60 04 ld [ %i5 + 4 ], %g3
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
200ddb8: 84 08 ff fe and %g3, -2, %g2
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
200ddbc: ba 07 40 02 add %i5, %g2, %i5
if ( info->largest < the_size )
info->largest = the_size;
the_block = next_block;
}
}
200ddc0: c6 07 60 04 ld [ %i5 + 4 ], %g3
while ( the_block != end ) {
uintptr_t const the_size = _Heap_Block_size(the_block);
Heap_Block *const next_block = _Heap_Block_at(the_block, the_size);
Heap_Information *info;
if ( _Heap_Is_prev_used(next_block) )
200ddc4: 80 88 e0 01 btst 1, %g3
200ddc8: 02 80 00 03 be 200ddd4 <_Heap_Get_information+0x48>
200ddcc: 82 10 00 19 mov %i1, %g1
info = &the_info->Used;
200ddd0: 82 06 60 0c add %i1, 0xc, %g1
else
info = &the_info->Free;
info->number++;
200ddd4: de 00 40 00 ld [ %g1 ], %o7
info->total += the_size;
200ddd8: f0 00 60 08 ld [ %g1 + 8 ], %i0
if ( info->largest < the_size )
200dddc: c8 00 60 04 ld [ %g1 + 4 ], %g4
if ( _Heap_Is_prev_used(next_block) )
info = &the_info->Used;
else
info = &the_info->Free;
info->number++;
200dde0: 9e 03 e0 01 inc %o7
info->total += the_size;
200dde4: b0 06 00 02 add %i0, %g2, %i0
if ( _Heap_Is_prev_used(next_block) )
info = &the_info->Used;
else
info = &the_info->Free;
info->number++;
200dde8: de 20 40 00 st %o7, [ %g1 ]
info->total += the_size;
if ( info->largest < the_size )
200ddec: 80 a1 00 02 cmp %g4, %g2
200ddf0: 1a 80 00 03 bcc 200ddfc <_Heap_Get_information+0x70>
200ddf4: f0 20 60 08 st %i0, [ %g1 + 8 ]
info->largest = the_size;
200ddf8: c4 20 60 04 st %g2, [ %g1 + 4 ]
Heap_Block *the_block = the_heap->first_block;
Heap_Block *const end = the_heap->last_block;
memset(the_info, 0, sizeof(*the_info));
while ( the_block != end ) {
200ddfc: 80 a7 00 1d cmp %i4, %i5
200de00: 12 bf ff ef bne 200ddbc <_Heap_Get_information+0x30>
200de04: 84 08 ff fe and %g3, -2, %g2
200de08: 81 c7 e0 08 ret
200de0c: 81 e8 00 00 restore
0201ac14 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
201ac14: 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);
201ac18: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
201ac1c: 7f ff f7 d2 call 2018b64 <.urem>
201ac20: 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
201ac24: 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);
201ac28: 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);
201ac2c: 84 20 80 08 sub %g2, %o0, %g2
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
201ac30: 80 a0 80 01 cmp %g2, %g1
201ac34: 0a 80 00 16 bcs 201ac8c <_Heap_Size_of_alloc_area+0x78>
201ac38: 86 10 20 00 clr %g3
201ac3c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
201ac40: 80 a0 80 04 cmp %g2, %g4
201ac44: 18 80 00 13 bgu 201ac90 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ac48: b0 08 e0 01 and %g3, 1, %i0
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
201ac4c: f0 00 a0 04 ld [ %g2 + 4 ], %i0
201ac50: b0 0e 3f fe and %i0, -2, %i0
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
201ac54: 84 06 00 02 add %i0, %g2, %g2
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
201ac58: 80 a0 40 02 cmp %g1, %g2
201ac5c: 18 80 00 0d bgu 201ac90 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ac60: b0 08 e0 01 and %g3, 1, %i0
201ac64: 80 a1 00 02 cmp %g4, %g2
201ac68: 0a 80 00 0a bcs 201ac90 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ac6c: 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;
201ac70: c2 00 a0 04 ld [ %g2 + 4 ], %g1
block_size = _Heap_Block_size( block );
next_block = _Heap_Block_at( block, block_size );
if (
!_Heap_Is_block_in_heap( heap, next_block )
|| !_Heap_Is_prev_used( next_block )
201ac74: 80 88 60 01 btst 1, %g1
201ac78: 02 80 00 06 be 201ac90 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ac7c: 84 20 80 19 sub %g2, %i1, %g2
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
201ac80: 86 10 20 01 mov 1, %g3
|| !_Heap_Is_prev_used( next_block )
) {
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
201ac84: 84 00 a0 04 add %g2, 4, %g2
201ac88: c4 26 80 00 st %g2, [ %i2 ]
return true;
}
201ac8c: b0 08 e0 01 and %g3, 1, %i0
201ac90: 81 c7 e0 08 ret
201ac94: 81 e8 00 00 restore
02008768 <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
2008768: 9d e3 bf 80 save %sp, -128, %sp
uintptr_t const min_block_size = heap->min_block_size;
Heap_Block *const first_block = heap->first_block;
Heap_Block *const last_block = heap->last_block;
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
200876c: 3b 00 80 21 sethi %hi(0x2008400), %i5
Heap_Control *heap,
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
2008770: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
2008774: f6 06 20 14 ld [ %i0 + 0x14 ], %i3
Heap_Block *const first_block = heap->first_block;
2008778: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
Heap_Block *const last_block = heap->last_block;
200877c: e2 06 20 24 ld [ %i0 + 0x24 ], %l1
Heap_Block *block = first_block;
Heap_Walk_printer printer = dump ?
_Heap_Walk_print : _Heap_Walk_print_nothing;
2008780: 80 a6 a0 00 cmp %i2, 0
2008784: 02 80 00 04 be 2008794 <_Heap_Walk+0x2c>
2008788: ba 17 62 fc or %i5, 0x2fc, %i5
200878c: 3b 00 80 21 sethi %hi(0x2008400), %i5
2008790: ba 17 63 04 or %i5, 0x304, %i5 ! 2008704 <_Heap_Walk_print>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2008794: 03 00 80 65 sethi %hi(0x2019400), %g1
2008798: c4 00 61 c4 ld [ %g1 + 0x1c4 ], %g2 ! 20195c4 <_System_state_Current>
200879c: 80 a0 a0 03 cmp %g2, 3
20087a0: 02 80 00 05 be 20087b4 <_Heap_Walk+0x4c>
20087a4: 82 10 20 01 mov 1, %g1
block = next_block;
} while ( block != first_block );
return true;
}
20087a8: b0 08 60 01 and %g1, 1, %i0
20087ac: 81 c7 e0 08 ret
20087b0: 81 e8 00 00 restore
Heap_Block *const first_free_block = _Heap_Free_list_first( heap );
Heap_Block *const last_free_block = _Heap_Free_list_last( heap );
Heap_Block *const first_block = heap->first_block;
Heap_Block *const last_block = heap->last_block;
(*printer)(
20087b4: da 06 20 18 ld [ %i0 + 0x18 ], %o5
20087b8: c6 06 20 1c ld [ %i0 + 0x1c ], %g3
20087bc: c4 06 20 08 ld [ %i0 + 8 ], %g2
20087c0: c2 06 20 0c ld [ %i0 + 0xc ], %g1
20087c4: 90 10 00 19 mov %i1, %o0
20087c8: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
20087cc: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
20087d0: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
20087d4: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
20087d8: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
20087dc: 92 10 20 00 clr %o1
20087e0: 96 10 00 10 mov %l0, %o3
20087e4: 15 00 80 5a sethi %hi(0x2016800), %o2
20087e8: 98 10 00 1b mov %i3, %o4
20087ec: 9f c7 40 00 call %i5
20087f0: 94 12 a1 30 or %o2, 0x130, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
20087f4: 80 a4 20 00 cmp %l0, 0
20087f8: 02 80 00 28 be 2008898 <_Heap_Walk+0x130>
20087fc: 80 8c 20 07 btst 7, %l0
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
2008800: 12 80 00 2d bne 20088b4 <_Heap_Walk+0x14c>
2008804: 90 10 00 1b mov %i3, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008808: 7f ff e4 b1 call 2001acc <.urem>
200880c: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
2008810: 80 a2 20 00 cmp %o0, 0
2008814: 12 80 00 30 bne 20088d4 <_Heap_Walk+0x16c>
2008818: 90 07 20 08 add %i4, 8, %o0
200881c: 7f ff e4 ac call 2001acc <.urem>
2008820: 92 10 00 10 mov %l0, %o1
);
return false;
}
if (
2008824: 80 a2 20 00 cmp %o0, 0
2008828: 32 80 00 33 bne,a 20088f4 <_Heap_Walk+0x18c>
200882c: 90 10 00 19 mov %i1, %o0
block = next_block;
} while ( block != first_block );
return true;
}
2008830: e8 07 20 04 ld [ %i4 + 4 ], %l4
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2008834: 80 8d 20 01 btst 1, %l4
2008838: 22 80 00 36 be,a 2008910 <_Heap_Walk+0x1a8>
200883c: 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;
2008840: c2 04 60 04 ld [ %l1 + 4 ], %g1
2008844: 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);
2008848: 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;
200884c: c4 00 60 04 ld [ %g1 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
2008850: 80 88 a0 01 btst 1, %g2
2008854: 02 80 00 0a be 200887c <_Heap_Walk+0x114>
2008858: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
200885c: 02 80 00 33 be 2008928 <_Heap_Walk+0x1c0>
2008860: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
2008864: 92 10 20 01 mov 1, %o1
2008868: 15 00 80 5a sethi %hi(0x2016800), %o2
200886c: 9f c7 40 00 call %i5
2008870: 94 12 a2 a8 or %o2, 0x2a8, %o2 ! 2016aa8 <_Status_Object_name_errors_to_status+0x1f0>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008874: 10 bf ff cd b 20087a8 <_Heap_Walk+0x40>
2008878: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
200887c: 90 10 00 19 mov %i1, %o0
2008880: 92 10 20 01 mov 1, %o1
2008884: 15 00 80 5a sethi %hi(0x2016800), %o2
2008888: 9f c7 40 00 call %i5
200888c: 94 12 a2 90 or %o2, 0x290, %o2 ! 2016a90 <_Status_Object_name_errors_to_status+0x1d8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008890: 10 bf ff c6 b 20087a8 <_Heap_Walk+0x40>
2008894: 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" );
2008898: 90 10 00 19 mov %i1, %o0
200889c: 92 10 20 01 mov 1, %o1
20088a0: 15 00 80 5a sethi %hi(0x2016800), %o2
20088a4: 9f c7 40 00 call %i5
20088a8: 94 12 a1 c8 or %o2, 0x1c8, %o2 ! 20169c8 <_Status_Object_name_errors_to_status+0x110>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20088ac: 10 bf ff bf b 20087a8 <_Heap_Walk+0x40>
20088b0: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
20088b4: 90 10 00 19 mov %i1, %o0
20088b8: 92 10 20 01 mov 1, %o1
20088bc: 96 10 00 10 mov %l0, %o3
20088c0: 15 00 80 5a sethi %hi(0x2016800), %o2
20088c4: 9f c7 40 00 call %i5
20088c8: 94 12 a1 e0 or %o2, 0x1e0, %o2 ! 20169e0 <_Status_Object_name_errors_to_status+0x128>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20088cc: 10 bf ff b7 b 20087a8 <_Heap_Walk+0x40>
20088d0: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
20088d4: 90 10 00 19 mov %i1, %o0
20088d8: 92 10 20 01 mov 1, %o1
20088dc: 96 10 00 1b mov %i3, %o3
20088e0: 15 00 80 5a sethi %hi(0x2016800), %o2
20088e4: 9f c7 40 00 call %i5
20088e8: 94 12 a2 00 or %o2, 0x200, %o2 ! 2016a00 <_Status_Object_name_errors_to_status+0x148>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
20088ec: 10 bf ff af b 20087a8 <_Heap_Walk+0x40>
20088f0: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
20088f4: 92 10 20 01 mov 1, %o1
20088f8: 96 10 00 1c mov %i4, %o3
20088fc: 15 00 80 5a sethi %hi(0x2016800), %o2
2008900: 9f c7 40 00 call %i5
2008904: 94 12 a2 28 or %o2, 0x228, %o2 ! 2016a28 <_Status_Object_name_errors_to_status+0x170>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008908: 10 bf ff a8 b 20087a8 <_Heap_Walk+0x40>
200890c: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
2008910: 92 10 20 01 mov 1, %o1
2008914: 15 00 80 5a sethi %hi(0x2016800), %o2
2008918: 9f c7 40 00 call %i5
200891c: 94 12 a2 60 or %o2, 0x260, %o2 ! 2016a60 <_Status_Object_name_errors_to_status+0x1a8>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008920: 10 bf ff a2 b 20087a8 <_Heap_Walk+0x40>
2008924: 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;
2008928: f4 06 20 08 ld [ %i0 + 8 ], %i2
int source,
Heap_Walk_printer printer,
Heap_Control *heap
)
{
uintptr_t const page_size = heap->page_size;
200892c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5
const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
const Heap_Block *const first_free_block = _Heap_Free_list_first( heap );
const Heap_Block *prev_block = free_list_tail;
const Heap_Block *free_block = first_free_block;
while ( free_block != free_list_tail ) {
2008930: 80 a6 00 1a cmp %i0, %i2
2008934: 02 80 00 0d be 2008968 <_Heap_Walk+0x200>
2008938: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
200893c: 80 a0 40 1a cmp %g1, %i2
2008940: 28 80 00 bc bleu,a 2008c30 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN
2008944: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
2008948: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
200894c: 92 10 20 01 mov 1, %o1
2008950: 96 10 00 1a mov %i2, %o3
2008954: 15 00 80 5a sethi %hi(0x2016800), %o2
2008958: 9f c7 40 00 call %i5
200895c: 94 12 a2 d8 or %o2, 0x2d8, %o2 ! 2016ad8 <_Status_Object_name_errors_to_status+0x220>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008960: 10 bf ff 92 b 20087a8 <_Heap_Walk+0x40>
2008964: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008968: 2d 00 80 5b sethi %hi(0x2016c00), %l6
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
200896c: 2f 00 80 5b sethi %hi(0x2016c00), %l7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008970: a4 10 00 1c mov %i4, %l2
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008974: ac 15 a1 08 or %l6, 0x108, %l6
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
(*printer)(
2008978: ae 15 e0 f0 or %l7, 0xf0, %l7
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
200897c: 2b 00 80 5b sethi %hi(0x2016c00), %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;
2008980: a6 0d 3f fe and %l4, -2, %l3
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at(
const Heap_Block *block,
uintptr_t offset
)
{
return (Heap_Block *) ((uintptr_t) block + offset);
2008984: b4 04 c0 12 add %l3, %l2, %i2
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
2008988: 80 a0 40 1a cmp %g1, %i2
200898c: 28 80 00 0b bleu,a 20089b8 <_Heap_Walk+0x250> <== ALWAYS TAKEN
2008990: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
uintptr_t const next_block_begin = (uintptr_t) next_block;
bool const is_not_last_block = block != last_block;
if ( !_Heap_Is_block_in_heap( heap, next_block ) ) {
(*printer)(
2008994: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
2008998: 92 10 20 01 mov 1, %o1
200899c: 96 10 00 12 mov %l2, %o3
20089a0: 15 00 80 5a sethi %hi(0x2016800), %o2
20089a4: 98 10 00 1a mov %i2, %o4
20089a8: 9f c7 40 00 call %i5
20089ac: 94 12 a3 80 or %o2, 0x380, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
20089b0: 10 bf ff 7e b 20087a8 <_Heap_Walk+0x40>
20089b4: 82 10 20 00 clr %g1
20089b8: 80 a0 40 1a cmp %g1, %i2
20089bc: 0a bf ff f7 bcs 2008998 <_Heap_Walk+0x230>
20089c0: 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;
20089c4: 82 1c 80 11 xor %l2, %l1, %g1
20089c8: 80 a0 00 01 cmp %g0, %g1
20089cc: 82 40 20 00 addx %g0, 0, %g1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
20089d0: 90 10 00 13 mov %l3, %o0
20089d4: c2 27 bf fc st %g1, [ %fp + -4 ]
20089d8: 7f ff e4 3d call 2001acc <.urem>
20089dc: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
20089e0: 80 a2 20 00 cmp %o0, 0
20089e4: 02 80 00 05 be 20089f8 <_Heap_Walk+0x290>
20089e8: c2 07 bf fc ld [ %fp + -4 ], %g1
20089ec: 80 88 60 ff btst 0xff, %g1
20089f0: 12 80 00 76 bne 2008bc8 <_Heap_Walk+0x460>
20089f4: 90 10 00 19 mov %i1, %o0
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
20089f8: 80 a6 c0 13 cmp %i3, %l3
20089fc: 08 80 00 05 bleu 2008a10 <_Heap_Walk+0x2a8>
2008a00: 80 a4 80 1a cmp %l2, %i2
2008a04: 80 88 60 ff btst 0xff, %g1
2008a08: 12 80 00 78 bne 2008be8 <_Heap_Walk+0x480> <== ALWAYS TAKEN
2008a0c: 80 a4 80 1a cmp %l2, %i2
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
2008a10: 2a 80 00 06 bcs,a 2008a28 <_Heap_Walk+0x2c0>
2008a14: c2 06 a0 04 ld [ %i2 + 4 ], %g1
2008a18: 80 88 60 ff btst 0xff, %g1
2008a1c: 12 80 00 7d bne 2008c10 <_Heap_Walk+0x4a8>
2008a20: 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;
2008a24: c2 06 a0 04 ld [ %i2 + 4 ], %g1
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
2008a28: 80 88 60 01 btst 1, %g1
2008a2c: 02 80 00 19 be 2008a90 <_Heap_Walk+0x328>
2008a30: a8 0d 20 01 and %l4, 1, %l4
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
2008a34: 80 a5 20 00 cmp %l4, 0
2008a38: 22 80 00 0e be,a 2008a70 <_Heap_Walk+0x308>
2008a3c: da 04 80 00 ld [ %l2 ], %o5
(*printer)(
2008a40: 90 10 00 19 mov %i1, %o0
2008a44: 92 10 20 00 clr %o1
2008a48: 94 10 00 17 mov %l7, %o2
2008a4c: 96 10 00 12 mov %l2, %o3
2008a50: 9f c7 40 00 call %i5
2008a54: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
2008a58: 80 a7 00 1a cmp %i4, %i2
2008a5c: 02 80 00 42 be 2008b64 <_Heap_Walk+0x3fc>
2008a60: a4 10 00 1a mov %i2, %l2
2008a64: e8 06 a0 04 ld [ %i2 + 4 ], %l4
2008a68: 10 bf ff c6 b 2008980 <_Heap_Walk+0x218>
2008a6c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008a70: 96 10 00 12 mov %l2, %o3
2008a74: 90 10 00 19 mov %i1, %o0
2008a78: 92 10 20 00 clr %o1
2008a7c: 94 10 00 16 mov %l6, %o2
2008a80: 9f c7 40 00 call %i5
2008a84: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
2008a88: 10 bf ff f5 b 2008a5c <_Heap_Walk+0x2f4>
2008a8c: 80 a7 00 1a cmp %i4, %i2
false,
"block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n",
block,
block_size,
block->prev,
block->prev == first_free_block ?
2008a90: da 04 a0 0c ld [ %l2 + 0xc ], %o5
Heap_Block *const last_free_block = _Heap_Free_list_last( heap );
bool const prev_used = _Heap_Is_prev_used( block );
uintptr_t const block_size = _Heap_Block_size( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
(*printer)(
2008a94: c2 06 20 08 ld [ %i0 + 8 ], %g1
2008a98: 05 00 80 5a sethi %hi(0x2016800), %g2
return _Heap_Free_list_head(heap)->next;
}
RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap )
{
return _Heap_Free_list_tail(heap)->prev;
2008a9c: c8 06 20 0c ld [ %i0 + 0xc ], %g4
2008aa0: 80 a0 40 0d cmp %g1, %o5
2008aa4: 02 80 00 05 be 2008ab8 <_Heap_Walk+0x350>
2008aa8: 86 10 a0 f0 or %g2, 0xf0, %g3
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
2008aac: 80 a6 00 0d cmp %i0, %o5
2008ab0: 02 80 00 3c be 2008ba0 <_Heap_Walk+0x438>
2008ab4: 86 15 60 b8 or %l5, 0xb8, %g3
block->next,
block->next == last_free_block ?
2008ab8: c2 04 a0 08 ld [ %l2 + 8 ], %g1
Heap_Block *const last_free_block = _Heap_Free_list_last( heap );
bool const prev_used = _Heap_Is_prev_used( block );
uintptr_t const block_size = _Heap_Block_size( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
(*printer)(
2008abc: 1f 00 80 5a sethi %hi(0x2016800), %o7
2008ac0: 80 a1 00 01 cmp %g4, %g1
2008ac4: 02 80 00 05 be 2008ad8 <_Heap_Walk+0x370>
2008ac8: 84 13 e1 10 or %o7, 0x110, %g2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008acc: 80 a6 00 01 cmp %i0, %g1
2008ad0: 02 80 00 31 be 2008b94 <_Heap_Walk+0x42c>
2008ad4: 84 15 60 b8 or %l5, 0xb8, %g2
Heap_Block *const last_free_block = _Heap_Free_list_last( heap );
bool const prev_used = _Heap_Is_prev_used( block );
uintptr_t const block_size = _Heap_Block_size( block );
Heap_Block *const next_block = _Heap_Block_at( block, block_size );
(*printer)(
2008ad8: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
2008adc: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2008ae0: c4 23 a0 64 st %g2, [ %sp + 0x64 ]
2008ae4: 90 10 00 19 mov %i1, %o0
2008ae8: 92 10 20 00 clr %o1
2008aec: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008af0: 96 10 00 12 mov %l2, %o3
2008af4: 94 12 a0 48 or %o2, 0x48, %o2
2008af8: 9f c7 40 00 call %i5
2008afc: 98 10 00 13 mov %l3, %o4
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
2008b00: da 06 80 00 ld [ %i2 ], %o5
2008b04: 80 a4 c0 0d cmp %l3, %o5
2008b08: 12 80 00 19 bne 2008b6c <_Heap_Walk+0x404>
2008b0c: 80 a5 20 00 cmp %l4, 0
);
return false;
}
if ( !prev_used ) {
2008b10: 02 80 00 27 be 2008bac <_Heap_Walk+0x444>
2008b14: 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;
2008b18: c2 06 20 08 ld [ %i0 + 8 ], %g1
)
{
const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
const Heap_Block *free_block = _Heap_Free_list_first( heap );
while ( free_block != free_list_tail ) {
2008b1c: 80 a6 00 01 cmp %i0, %g1
2008b20: 02 80 00 0b be 2008b4c <_Heap_Walk+0x3e4> <== NEVER TAKEN
2008b24: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
2008b28: 80 a4 80 01 cmp %l2, %g1
2008b2c: 02 bf ff cc be 2008a5c <_Heap_Walk+0x2f4>
2008b30: 80 a7 00 1a cmp %i4, %i2
return true;
}
free_block = free_block->next;
2008b34: c2 00 60 08 ld [ %g1 + 8 ], %g1
)
{
const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
const Heap_Block *free_block = _Heap_Free_list_first( heap );
while ( free_block != free_list_tail ) {
2008b38: 80 a6 00 01 cmp %i0, %g1
2008b3c: 12 bf ff fc bne 2008b2c <_Heap_Walk+0x3c4>
2008b40: 80 a4 80 01 cmp %l2, %g1
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
2008b44: 90 10 00 19 mov %i1, %o0
2008b48: 92 10 20 01 mov 1, %o1
2008b4c: 96 10 00 12 mov %l2, %o3
2008b50: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008b54: 9f c7 40 00 call %i5
2008b58: 94 12 a1 30 or %o2, 0x130, %o2 ! 2016d30 <_Status_Object_name_errors_to_status+0x478>
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008b5c: 10 bf ff 13 b 20087a8 <_Heap_Walk+0x40>
2008b60: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
2008b64: 10 bf ff 11 b 20087a8 <_Heap_Walk+0x40>
2008b68: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
2008b6c: f4 23 a0 5c st %i2, [ %sp + 0x5c ]
2008b70: 90 10 00 19 mov %i1, %o0
2008b74: 92 10 20 01 mov 1, %o1
2008b78: 96 10 00 12 mov %l2, %o3
2008b7c: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008b80: 98 10 00 13 mov %l3, %o4
2008b84: 9f c7 40 00 call %i5
2008b88: 94 12 a0 80 or %o2, 0x80, %o2
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008b8c: 10 bf ff 07 b 20087a8 <_Heap_Walk+0x40>
2008b90: 82 10 20 00 clr %g1
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008b94: 05 00 80 5a sethi %hi(0x2016800), %g2
2008b98: 10 bf ff d0 b 2008ad8 <_Heap_Walk+0x370>
2008b9c: 84 10 a1 20 or %g2, 0x120, %g2 ! 2016920 <_Status_Object_name_errors_to_status+0x68>
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
2008ba0: 07 00 80 5a sethi %hi(0x2016800), %g3
2008ba4: 10 bf ff c5 b 2008ab8 <_Heap_Walk+0x350>
2008ba8: 86 10 e1 00 or %g3, 0x100, %g3 ! 2016900 <_Status_Object_name_errors_to_status+0x48>
return false;
}
if ( !prev_used ) {
(*printer)(
2008bac: 92 10 20 01 mov 1, %o1
2008bb0: 96 10 00 12 mov %l2, %o3
2008bb4: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008bb8: 9f c7 40 00 call %i5
2008bbc: 94 12 a0 c0 or %o2, 0xc0, %o2 ! 2016cc0 <_Status_Object_name_errors_to_status+0x408>
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008bc0: 10 bf fe fa b 20087a8 <_Heap_Walk+0x40>
2008bc4: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
2008bc8: 92 10 20 01 mov 1, %o1
2008bcc: 96 10 00 12 mov %l2, %o3
2008bd0: 15 00 80 5a sethi %hi(0x2016800), %o2
2008bd4: 98 10 00 13 mov %l3, %o4
2008bd8: 9f c7 40 00 call %i5
2008bdc: 94 12 a3 b0 or %o2, 0x3b0, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
2008be0: 10 bf fe f2 b 20087a8 <_Heap_Walk+0x40>
2008be4: 82 10 20 00 clr %g1
}
if ( block_size < min_block_size && is_not_last_block ) {
(*printer)(
2008be8: 90 10 00 19 mov %i1, %o0
2008bec: 92 10 20 01 mov 1, %o1
2008bf0: 96 10 00 12 mov %l2, %o3
2008bf4: 15 00 80 5a sethi %hi(0x2016800), %o2
2008bf8: 98 10 00 13 mov %l3, %o4
2008bfc: 94 12 a3 e0 or %o2, 0x3e0, %o2
2008c00: 9f c7 40 00 call %i5
2008c04: 9a 10 00 1b mov %i3, %o5
block,
block_size,
min_block_size
);
return false;
2008c08: 10 bf fe e8 b 20087a8 <_Heap_Walk+0x40>
2008c0c: 82 10 20 00 clr %g1
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
(*printer)(
2008c10: 92 10 20 01 mov 1, %o1
2008c14: 96 10 00 12 mov %l2, %o3
2008c18: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008c1c: 98 10 00 1a mov %i2, %o4
2008c20: 9f c7 40 00 call %i5
2008c24: 94 12 a0 10 or %o2, 0x10, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
2008c28: 10 bf fe e0 b 20087a8 <_Heap_Walk+0x40>
2008c2c: 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;
2008c30: 80 a6 80 13 cmp %i2, %l3
2008c34: 18 bf ff 46 bgu 200894c <_Heap_Walk+0x1e4> <== NEVER TAKEN
2008c38: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008c3c: c2 27 bf fc st %g1, [ %fp + -4 ]
2008c40: 90 06 a0 08 add %i2, 8, %o0
2008c44: 7f ff e3 a2 call 2001acc <.urem>
2008c48: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008c4c: 80 a2 20 00 cmp %o0, 0
2008c50: 12 80 00 36 bne 2008d28 <_Heap_Walk+0x5c0> <== NEVER TAKEN
2008c54: c2 07 bf fc ld [ %fp + -4 ], %g1
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2008c58: c4 06 a0 04 ld [ %i2 + 4 ], %g2
2008c5c: 84 08 bf fe and %g2, -2, %g2
block = next_block;
} while ( block != first_block );
return true;
}
2008c60: 84 06 80 02 add %i2, %g2, %g2
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
2008c64: c4 00 a0 04 ld [ %g2 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008c68: 80 88 a0 01 btst 1, %g2
2008c6c: 12 80 00 27 bne 2008d08 <_Heap_Walk+0x5a0> <== NEVER TAKEN
2008c70: 84 10 00 18 mov %i0, %g2
2008c74: 10 80 00 19 b 2008cd8 <_Heap_Walk+0x570>
2008c78: a4 10 00 1a mov %i2, %l2
const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap );
const Heap_Block *const first_free_block = _Heap_Free_list_first( heap );
const Heap_Block *prev_block = free_list_tail;
const Heap_Block *free_block = first_free_block;
while ( free_block != free_list_tail ) {
2008c7c: 80 a6 00 1a cmp %i0, %i2
2008c80: 02 bf ff 3a be 2008968 <_Heap_Walk+0x200>
2008c84: 80 a6 80 01 cmp %i2, %g1
const Heap_Control *heap,
const Heap_Block *block
)
{
return (uintptr_t) block >= (uintptr_t) heap->first_block
&& (uintptr_t) block <= (uintptr_t) heap->last_block;
2008c88: 0a bf ff 31 bcs 200894c <_Heap_Walk+0x1e4>
2008c8c: 90 10 00 19 mov %i1, %o0
2008c90: 80 a6 80 13 cmp %i2, %l3
2008c94: 18 bf ff 2f bgu 2008950 <_Heap_Walk+0x1e8> <== NEVER TAKEN
2008c98: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008c9c: c2 27 bf fc st %g1, [ %fp + -4 ]
2008ca0: 90 06 a0 08 add %i2, 8, %o0
2008ca4: 7f ff e3 8a call 2001acc <.urem>
2008ca8: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008cac: 80 a2 20 00 cmp %o0, 0
2008cb0: 12 80 00 1e bne 2008d28 <_Heap_Walk+0x5c0>
2008cb4: c2 07 bf fc ld [ %fp + -4 ], %g1
- HEAP_BLOCK_HEADER_SIZE);
}
RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block )
{
return block->size_and_flag & ~HEAP_PREV_BLOCK_USED;
2008cb8: c6 06 a0 04 ld [ %i2 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008cbc: 84 10 00 12 mov %l2, %g2
2008cc0: 86 08 ff fe and %g3, -2, %g3
block = next_block;
} while ( block != first_block );
return true;
}
2008cc4: 86 06 80 03 add %i2, %g3, %g3
block->size_and_flag = size | flag;
}
RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block )
{
return block->size_and_flag & HEAP_PREV_BLOCK_USED;
2008cc8: c6 00 e0 04 ld [ %g3 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008ccc: 80 88 e0 01 btst 1, %g3
2008cd0: 12 80 00 0e bne 2008d08 <_Heap_Walk+0x5a0>
2008cd4: a4 10 00 1a mov %i2, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
2008cd8: d8 06 a0 0c ld [ %i2 + 0xc ], %o4
2008cdc: 80 a3 00 02 cmp %o4, %g2
2008ce0: 22 bf ff e7 be,a 2008c7c <_Heap_Walk+0x514>
2008ce4: f4 06 a0 08 ld [ %i2 + 8 ], %i2
(*printer)(
2008ce8: 90 10 00 19 mov %i1, %o0
2008cec: 92 10 20 01 mov 1, %o1
2008cf0: 96 10 00 1a mov %i2, %o3
2008cf4: 15 00 80 5a sethi %hi(0x2016800), %o2
2008cf8: 9f c7 40 00 call %i5
2008cfc: 94 12 a3 48 or %o2, 0x348, %o2 ! 2016b48 <_Status_Object_name_errors_to_status+0x290>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008d00: 10 bf fe aa b 20087a8 <_Heap_Walk+0x40>
2008d04: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
2008d08: 90 10 00 19 mov %i1, %o0
2008d0c: 92 10 20 01 mov 1, %o1
2008d10: 96 10 00 1a mov %i2, %o3
2008d14: 15 00 80 5a sethi %hi(0x2016800), %o2
2008d18: 9f c7 40 00 call %i5
2008d1c: 94 12 a3 28 or %o2, 0x328, %o2 ! 2016b28 <_Status_Object_name_errors_to_status+0x270>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008d20: 10 bf fe a2 b 20087a8 <_Heap_Walk+0x40>
2008d24: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
2008d28: 90 10 00 19 mov %i1, %o0
2008d2c: 92 10 20 01 mov 1, %o1
2008d30: 96 10 00 1a mov %i2, %o3
2008d34: 15 00 80 5a sethi %hi(0x2016800), %o2
2008d38: 9f c7 40 00 call %i5
2008d3c: 94 12 a2 f8 or %o2, 0x2f8, %o2 ! 2016af8 <_Status_Object_name_errors_to_status+0x240>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
return true;
}
if ( !_Heap_Walk_check_control( source, printer, heap ) ) {
return false;
2008d40: 10 bf fe 9a b 20087a8 <_Heap_Walk+0x40>
2008d44: 82 10 20 00 clr %g1
02007150 <_IO_Initialize_all_drivers>:
*
* Output Parameters: NONE
*/
void _IO_Initialize_all_drivers( void )
{
2007150: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
2007154: 39 00 80 79 sethi %hi(0x201e400), %i4
2007158: c2 07 20 84 ld [ %i4 + 0x84 ], %g1 ! 201e484 <_IO_Number_of_drivers>
200715c: 80 a0 60 00 cmp %g1, 0
2007160: 02 80 00 0c be 2007190 <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
2007164: ba 10 20 00 clr %i5
2007168: b8 17 20 84 or %i4, 0x84, %i4
(void) rtems_io_initialize( major, 0, NULL );
200716c: 90 10 00 1d mov %i5, %o0
2007170: 92 10 20 00 clr %o1
2007174: 40 00 18 1b call 200d1e0 <rtems_io_initialize>
2007178: 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 ++ )
200717c: c2 07 00 00 ld [ %i4 ], %g1
2007180: ba 07 60 01 inc %i5
2007184: 80 a0 40 1d cmp %g1, %i5
2007188: 18 bf ff fa bgu 2007170 <_IO_Initialize_all_drivers+0x20>
200718c: 90 10 00 1d mov %i5, %o0
2007190: 81 c7 e0 08 ret
2007194: 81 e8 00 00 restore
02007084 <_IO_Manager_initialization>:
* workspace.
*
*/
void _IO_Manager_initialization(void)
{
2007084: 9d e3 bf a0 save %sp, -96, %sp
uint32_t index;
rtems_driver_address_table *driver_table;
uint32_t drivers_in_table;
uint32_t number_of_drivers;
driver_table = Configuration.Device_driver_table;
2007088: 03 00 80 73 sethi %hi(0x201cc00), %g1
200708c: 82 10 61 8c or %g1, 0x18c, %g1 ! 201cd8c <Configuration>
drivers_in_table = Configuration.number_of_device_drivers;
2007090: f8 00 60 30 ld [ %g1 + 0x30 ], %i4
number_of_drivers = Configuration.maximum_drivers;
2007094: f2 00 60 2c ld [ %g1 + 0x2c ], %i1
/*
* If the user claims there are less drivers than are actually in
* the table, then let's just go with the table's count.
*/
if ( number_of_drivers <= drivers_in_table )
2007098: 80 a7 00 19 cmp %i4, %i1
200709c: 0a 80 00 08 bcs 20070bc <_IO_Manager_initialization+0x38>
20070a0: fa 00 60 34 ld [ %g1 + 0x34 ], %i5
* If the maximum number of driver is the same as the number in the
* table, then we do not have to copy the driver table. They can't
* register any dynamically.
*/
if ( number_of_drivers == drivers_in_table ) {
_IO_Driver_address_table = driver_table;
20070a4: 03 00 80 79 sethi %hi(0x201e400), %g1
20070a8: fa 20 60 88 st %i5, [ %g1 + 0x88 ] ! 201e488 <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
20070ac: 03 00 80 79 sethi %hi(0x201e400), %g1
20070b0: f8 20 60 84 st %i4, [ %g1 + 0x84 ] ! 201e484 <_IO_Number_of_drivers>
return;
20070b4: 81 c7 e0 08 ret
20070b8: 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 )
20070bc: 83 2e 60 03 sll %i1, 3, %g1
20070c0: b5 2e 60 05 sll %i1, 5, %i2
20070c4: 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(
20070c8: 40 00 0d 74 call 200a698 <_Workspace_Allocate_or_fatal_error>
20070cc: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
20070d0: 03 00 80 79 sethi %hi(0x201e400), %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 *)
20070d4: 37 00 80 79 sethi %hi(0x201e400), %i3
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
20070d8: f2 20 60 84 st %i1, [ %g1 + 0x84 ]
/*
* 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 *)
20070dc: d0 26 e0 88 st %o0, [ %i3 + 0x88 ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
20070e0: 92 10 20 00 clr %o1
20070e4: 40 00 25 12 call 201052c <memset>
20070e8: 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++ )
20070ec: 80 a7 20 00 cmp %i4, 0
20070f0: 02 bf ff f1 be 20070b4 <_IO_Manager_initialization+0x30> <== NEVER TAKEN
20070f4: f6 06 e0 88 ld [ %i3 + 0x88 ], %i3
20070f8: 82 10 20 00 clr %g1
20070fc: 88 10 20 00 clr %g4
_IO_Driver_address_table[index] = driver_table[index];
2007100: c4 07 40 01 ld [ %i5 + %g1 ], %g2
2007104: 86 07 40 01 add %i5, %g1, %g3
2007108: c4 26 c0 01 st %g2, [ %i3 + %g1 ]
200710c: f4 00 e0 04 ld [ %g3 + 4 ], %i2
2007110: 84 06 c0 01 add %i3, %g1, %g2
2007114: f4 20 a0 04 st %i2, [ %g2 + 4 ]
2007118: f4 00 e0 08 ld [ %g3 + 8 ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
200711c: 88 01 20 01 inc %g4
_IO_Driver_address_table[index] = driver_table[index];
2007120: f4 20 a0 08 st %i2, [ %g2 + 8 ]
2007124: f4 00 e0 0c ld [ %g3 + 0xc ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2007128: 82 00 60 18 add %g1, 0x18, %g1
_IO_Driver_address_table[index] = driver_table[index];
200712c: f4 20 a0 0c st %i2, [ %g2 + 0xc ]
2007130: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2
memset(
_IO_Driver_address_table, 0,
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
for ( index = 0 ; index < drivers_in_table ; index++ )
2007134: 80 a1 00 1c cmp %g4, %i4
_IO_Driver_address_table[index] = driver_table[index];
2007138: f4 20 a0 10 st %i2, [ %g2 + 0x10 ]
200713c: 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++ )
2007140: 12 bf ff f0 bne 2007100 <_IO_Manager_initialization+0x7c>
2007144: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
2007148: 81 c7 e0 08 ret
200714c: 81 e8 00 00 restore
02007ec8 <_Objects_Allocate>:
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2007ec8: 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 )
2007ecc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2007ed0: ba 10 00 18 mov %i0, %i5
* If the application is using the optional manager stubs and
* still attempts to create the object, the information block
* should be all zeroed out because it is in the BSS. So let's
* check that code for this manager is even present.
*/
if ( information->size == 0 )
2007ed4: 80 a0 60 00 cmp %g1, 0
2007ed8: 02 80 00 19 be 2007f3c <_Objects_Allocate+0x74> <== NEVER TAKEN
2007edc: b0 10 20 00 clr %i0
/*
* OK. The manager should be initialized and configured to have objects.
* With any luck, it is safe to attempt to allocate an object.
*/
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
2007ee0: b8 07 60 20 add %i5, 0x20, %i4
2007ee4: 7f ff fd 5e call 200745c <_Chain_Get>
2007ee8: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
2007eec: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
2007ef0: 80 a0 60 00 cmp %g1, 0
2007ef4: 02 80 00 12 be 2007f3c <_Objects_Allocate+0x74>
2007ef8: 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 ) {
2007efc: 80 a2 20 00 cmp %o0, 0
2007f00: 02 80 00 11 be 2007f44 <_Objects_Allocate+0x7c>
2007f04: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
2007f08: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
2007f0c: d0 16 20 0a lduh [ %i0 + 0xa ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
2007f10: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
2007f14: 40 00 42 68 call 20188b4 <.udiv>
2007f18: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
2007f1c: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
2007f20: 91 2a 20 02 sll %o0, 2, %o0
2007f24: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
2007f28: 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 ]--;
2007f2c: 86 00 ff ff add %g3, -1, %g3
2007f30: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
2007f34: 82 00 bf ff add %g2, -1, %g1
2007f38: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
2007f3c: 81 c7 e0 08 ret
2007f40: 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 );
2007f44: 40 00 00 10 call 2007f84 <_Objects_Extend_information>
2007f48: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
2007f4c: 7f ff fd 44 call 200745c <_Chain_Get>
2007f50: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
2007f54: b0 92 20 00 orcc %o0, 0, %i0
2007f58: 32 bf ff ed bne,a 2007f0c <_Objects_Allocate+0x44>
2007f5c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
);
}
#endif
return the_object;
}
2007f60: 81 c7 e0 08 ret
2007f64: 81 e8 00 00 restore
02007f84 <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
2007f84: 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 )
2007f88: e0 06 20 34 ld [ %i0 + 0x34 ], %l0
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007f8c: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
2007f90: 80 a4 20 00 cmp %l0, 0
2007f94: 02 80 00 a6 be 200822c <_Objects_Extend_information+0x2a8>
2007f98: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
2007f9c: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2
2007fa0: b3 2e 60 10 sll %i1, 0x10, %i1
2007fa4: 92 10 00 1a mov %i2, %o1
2007fa8: 40 00 42 43 call 20188b4 <.udiv>
2007fac: 91 36 60 10 srl %i1, 0x10, %o0
2007fb0: a7 2a 20 10 sll %o0, 0x10, %l3
2007fb4: a7 34 e0 10 srl %l3, 0x10, %l3
for ( ; block < block_count; block++ ) {
2007fb8: 80 a4 e0 00 cmp %l3, 0
2007fbc: 02 80 00 a3 be 2008248 <_Objects_Extend_information+0x2c4><== NEVER TAKEN
2007fc0: 90 10 00 1a mov %i2, %o0
if ( information->object_blocks[ block ] == NULL ) {
2007fc4: c2 04 00 00 ld [ %l0 ], %g1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2007fc8: ba 10 00 1c mov %i4, %i5
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
2007fcc: 80 a0 60 00 cmp %g1, 0
2007fd0: 12 80 00 08 bne 2007ff0 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN
2007fd4: b6 10 20 00 clr %i3
do_extend = false;
2007fd8: 10 80 00 a0 b 2008258 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED
2007fdc: b4 10 20 00 clr %i2 <== NOT EXECUTED
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
if ( information->object_blocks[ block ] == NULL ) {
2007fe0: c2 04 00 01 ld [ %l0 + %g1 ], %g1
2007fe4: 80 a0 60 00 cmp %g1, 0
2007fe8: 22 80 00 08 be,a 2008008 <_Objects_Extend_information+0x84>
2007fec: b4 10 20 00 clr %i2
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
2007ff0: b6 06 e0 01 inc %i3
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
2007ff4: ba 07 40 1a add %i5, %i2, %i5
if ( information->object_blocks == NULL )
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
for ( ; block < block_count; block++ ) {
2007ff8: 80 a4 c0 1b cmp %l3, %i3
2007ffc: 18 bf ff f9 bgu 2007fe0 <_Objects_Extend_information+0x5c>
2008000: 83 2e e0 02 sll %i3, 2, %g1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
2008004: b4 10 20 01 mov 1, %i2
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
2008008: b3 36 60 10 srl %i1, 0x10, %i1
/*
* We need to limit the number of objects to the maximum number
* representable in the index portion of the object Id. In the
* case of 16-bit Ids, this is only 256 object instances.
*/
if ( maximum > OBJECTS_ID_FINAL_INDEX ) {
200800c: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
2008010: 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 ) {
2008014: 82 10 63 ff or %g1, 0x3ff, %g1
2008018: 80 a6 40 01 cmp %i1, %g1
200801c: 18 80 00 93 bgu 2008268 <_Objects_Extend_information+0x2e4>
2008020: 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;
2008024: 40 00 41 ea call 20187cc <.umul>
2008028: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
200802c: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
2008030: 80 a0 60 00 cmp %g1, 0
2008034: 02 80 00 6a be 20081dc <_Objects_Extend_information+0x258>
2008038: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
200803c: 40 00 09 89 call 200a660 <_Workspace_Allocate>
2008040: 01 00 00 00 nop
if ( !new_object_block )
2008044: a0 92 20 00 orcc %o0, 0, %l0
2008048: 02 80 00 88 be 2008268 <_Objects_Extend_information+0x2e4>
200804c: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
2008050: 80 8e a0 ff btst 0xff, %i2
2008054: 22 80 00 3f be,a 2008150 <_Objects_Extend_information+0x1cc>
2008058: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
200805c: b4 04 e0 01 add %l3, 1, %i2
/*
* Allocate the tables and break it up.
*/
block_size = block_count *
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
2008060: 91 2e a0 01 sll %i2, 1, %o0
2008064: 90 02 00 1a add %o0, %i2, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
2008068: 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 *)) +
200806c: 90 02 00 1c add %o0, %i4, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
2008070: 40 00 09 7c call 200a660 <_Workspace_Allocate>
2008074: 91 2a 20 02 sll %o0, 2, %o0
if ( !object_blocks ) {
2008078: a2 92 20 00 orcc %o0, 0, %l1
200807c: 02 80 00 79 be 2008260 <_Objects_Extend_information+0x2dc>
2008080: b5 2e a0 02 sll %i2, 2, %i2
* Take the block count down. Saves all the (block_count - 1)
* in the copies.
*/
block_count--;
if ( information->maximum > minimum_index ) {
2008084: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
2008088: 80 a7 00 01 cmp %i4, %g1
200808c: a4 04 40 1a add %l1, %i2, %l2
2008090: 0a 80 00 57 bcs 20081ec <_Objects_Extend_information+0x268>
2008094: b4 04 80 1a add %l2, %i2, %i2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
2008098: 80 a7 20 00 cmp %i4, 0
200809c: 02 80 00 07 be 20080b8 <_Objects_Extend_information+0x134><== NEVER TAKEN
20080a0: 82 10 20 00 clr %g1
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
20080a4: 85 28 60 02 sll %g1, 2, %g2
} else {
/*
* Deal with the special case of the 0 to minimum_index
*/
for ( index = 0; index < minimum_index; index++ ) {
20080a8: 82 00 60 01 inc %g1
20080ac: 80 a7 00 01 cmp %i4, %g1
20080b0: 18 bf ff fd bgu 20080a4 <_Objects_Extend_information+0x120><== NEVER TAKEN
20080b4: c0 20 80 1a clr [ %g2 + %i2 ]
20080b8: a7 2c e0 02 sll %l3, 2, %l3
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
20080bc: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
20080c0: c0 24 40 13 clr [ %l1 + %l3 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
20080c4: 86 07 40 03 add %i5, %g3, %g3
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
20080c8: 80 a7 40 03 cmp %i5, %g3
20080cc: 1a 80 00 0a bcc 20080f4 <_Objects_Extend_information+0x170><== NEVER TAKEN
20080d0: c0 24 80 13 clr [ %l2 + %l3 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
20080d4: 83 2f 60 02 sll %i5, 2, %g1
20080d8: 84 10 00 1d mov %i5, %g2
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
20080dc: 82 06 80 01 add %i2, %g1, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
20080e0: c0 20 40 00 clr [ %g1 ]
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
index++ ) {
20080e4: 84 00 a0 01 inc %g2
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
20080e8: 80 a0 c0 02 cmp %g3, %g2
20080ec: 18 bf ff fd bgu 20080e0 <_Objects_Extend_information+0x15c>
20080f0: 82 00 60 04 add %g1, 4, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
20080f4: 7f ff e8 3c call 20021e4 <sparc_disable_interrupts>
20080f8: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
20080fc: 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(
2008100: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
2008104: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
information->object_blocks = object_blocks;
information->inactive_per_block = inactive_per_block;
information->local_table = local_table;
information->maximum = (Objects_Maximum) maximum;
2008108: f2 36 20 10 sth %i1, [ %i0 + 0x10 ]
200810c: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2008110: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
2008114: e2 26 20 34 st %l1, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
2008118: e4 26 20 30 st %l2, [ %i0 + 0x30 ]
information->local_table = local_table;
200811c: f4 26 20 1c st %i2, [ %i0 + 0x1c ]
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
2008120: b3 2e 60 10 sll %i1, 0x10, %i1
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
2008124: 03 00 00 40 sethi %hi(0x10000), %g1
2008128: b3 36 60 10 srl %i1, 0x10, %i1
200812c: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2008130: 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) |
2008134: 82 10 40 19 or %g1, %i1, %g1
2008138: c2 26 20 0c st %g1, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
200813c: 7f ff e8 2e call 20021f4 <sparc_enable_interrupts>
2008140: 01 00 00 00 nop
_Workspace_Free( old_tables );
2008144: 40 00 09 4f call 200a680 <_Workspace_Free>
2008148: 90 10 00 1c mov %i4, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
200814c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2008150: b7 2e e0 02 sll %i3, 2, %i3
2008154: e0 20 40 1b st %l0, [ %g1 + %i3 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
2008158: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
200815c: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
2008160: d2 00 40 1b ld [ %g1 + %i3 ], %o1
2008164: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
2008168: 90 07 bf f4 add %fp, -12, %o0
200816c: 40 00 14 35 call 200d240 <_Chain_Initialize>
2008170: 39 00 00 40 sethi %hi(0x10000), %i4
/*
* Move from the local chain, initialise, then append to the inactive chain
*/
index = index_base;
while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) {
2008174: 10 80 00 0d b 20081a8 <_Objects_Extend_information+0x224>
2008178: b4 06 20 20 add %i0, 0x20, %i2
the_object->id = _Objects_Build_id(
200817c: c6 16 20 04 lduh [ %i0 + 4 ], %g3
2008180: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2008184: 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) |
2008188: 84 10 80 1c or %g2, %i4, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
200818c: 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) |
2008190: 84 10 80 1d or %g2, %i5, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2008194: 90 10 00 1a mov %i2, %o0
2008198: 92 10 00 01 mov %g1, %o1
index++;
200819c: ba 07 60 01 inc %i5
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
20081a0: 7f ff fc 9b call 200740c <_Chain_Append>
20081a4: 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 ) {
20081a8: 7f ff fc ad call 200745c <_Chain_Get>
20081ac: 90 07 bf f4 add %fp, -12, %o0
20081b0: 82 92 20 00 orcc %o0, 0, %g1
20081b4: 32 bf ff f2 bne,a 200817c <_Objects_Extend_information+0x1f8>
20081b8: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20081bc: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
20081c0: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
20081c4: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20081c8: c8 20 c0 1b st %g4, [ %g3 + %i3 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
20081cc: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
20081d0: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
20081d4: 81 c7 e0 08 ret
20081d8: 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 );
20081dc: 40 00 09 2f call 200a698 <_Workspace_Allocate_or_fatal_error>
20081e0: 01 00 00 00 nop
20081e4: 10 bf ff 9b b 2008050 <_Objects_Extend_information+0xcc>
20081e8: a0 10 00 08 mov %o0, %l0
/*
* Copy each section of the table over. This has to be performed as
* separate parts as size of each block has changed.
*/
memcpy( object_blocks,
20081ec: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
20081f0: a7 2c e0 02 sll %l3, 2, %l3
/*
* Copy each section of the table over. This has to be performed as
* separate parts as size of each block has changed.
*/
memcpy( object_blocks,
20081f4: 40 00 20 92 call 201043c <memcpy>
20081f8: 94 10 00 13 mov %l3, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
20081fc: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
2008200: 94 10 00 13 mov %l3, %o2
2008204: 40 00 20 8e call 201043c <memcpy>
2008208: 90 10 00 12 mov %l2, %o0
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
200820c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
2008210: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
2008214: b8 07 00 01 add %i4, %g1, %i4
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
information->inactive_per_block,
block_count * sizeof(uint32_t) );
memcpy( local_table,
2008218: 90 10 00 1a mov %i2, %o0
200821c: 40 00 20 88 call 201043c <memcpy>
2008220: 95 2f 20 02 sll %i4, 2, %o2
*/
object_blocks[block_count] = NULL;
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
2008224: 10 bf ff a7 b 20080c0 <_Objects_Extend_information+0x13c>
2008228: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
200822c: 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 );
2008230: ba 10 00 1c mov %i4, %i5
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
2008234: b4 10 20 01 mov 1, %i2
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2008238: b6 10 20 00 clr %i3
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
200823c: a6 10 20 00 clr %l3
2008240: 10 bf ff 72 b 2008008 <_Objects_Extend_information+0x84>
2008244: b3 2e 60 10 sll %i1, 0x10, %i1
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
minimum_index = _Objects_Get_index( information->minimum_id );
2008248: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED
/*
* Search for a free block of indexes. If we do NOT need to allocate or
* extend the block table, then we will change do_extend.
*/
do_extend = true;
200824c: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2008250: 10 bf ff 6e b 2008008 <_Objects_Extend_information+0x84> <== NOT EXECUTED
2008254: b6 10 20 00 clr %i3 <== NOT EXECUTED
2008258: 10 bf ff 6c b 2008008 <_Objects_Extend_information+0x84> <== NOT EXECUTED
200825c: b6 10 20 00 clr %i3 <== NOT EXECUTED
(sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) +
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
if ( !object_blocks ) {
_Workspace_Free( new_object_block );
2008260: 40 00 09 08 call 200a680 <_Workspace_Free>
2008264: 90 10 00 10 mov %l0, %o0
return;
2008268: 81 c7 e0 08 ret
200826c: 81 e8 00 00 restore
02008314 <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
2008314: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
2008318: 80 a6 60 00 cmp %i1, 0
200831c: 02 80 00 17 be 2008378 <_Objects_Get_information+0x64>
2008320: ba 10 20 00 clr %i5
/*
* This call implicitly validates the_api so we do not call
* _Objects_Is_api_valid above here.
*/
the_class_api_maximum = _Objects_API_maximum_class( the_api );
2008324: 40 00 15 54 call 200d874 <_Objects_API_maximum_class>
2008328: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
200832c: 80 a2 20 00 cmp %o0, 0
2008330: 02 80 00 12 be 2008378 <_Objects_Get_information+0x64>
2008334: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
2008338: 0a 80 00 10 bcs 2008378 <_Objects_Get_information+0x64>
200833c: 03 00 80 76 sethi %hi(0x201d800), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
2008340: b1 2e 20 02 sll %i0, 2, %i0
2008344: 82 10 62 68 or %g1, 0x268, %g1
2008348: c2 00 40 18 ld [ %g1 + %i0 ], %g1
200834c: 80 a0 60 00 cmp %g1, 0
2008350: 02 80 00 0a be 2008378 <_Objects_Get_information+0x64> <== NEVER TAKEN
2008354: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
2008358: fa 00 40 19 ld [ %g1 + %i1 ], %i5
if ( !info )
200835c: 80 a7 60 00 cmp %i5, 0
2008360: 02 80 00 06 be 2008378 <_Objects_Get_information+0x64> <== NEVER TAKEN
2008364: 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 )
2008368: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1
return NULL;
200836c: 80 a0 00 01 cmp %g0, %g1
2008370: 82 60 20 00 subx %g0, 0, %g1
2008374: ba 0f 40 01 and %i5, %g1, %i5
#endif
return info;
}
2008378: 81 c7 e0 08 ret
200837c: 91 e8 00 1d restore %g0, %i5, %o0
02009b58 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
2009b58: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
2009b5c: 80 a6 60 00 cmp %i1, 0
2009b60: 02 80 00 41 be 2009c64 <_Objects_Get_name_as_string+0x10c>
2009b64: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
2009b68: 02 80 00 3a be 2009c50 <_Objects_Get_name_as_string+0xf8>
2009b6c: 80 a6 20 00 cmp %i0, 0
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2009b70: 02 80 00 3a be 2009c58 <_Objects_Get_name_as_string+0x100>
2009b74: 03 00 80 82 sethi %hi(0x2020800), %g1
information = _Objects_Get_information_id( tmpId );
2009b78: 7f ff ff ba call 2009a60 <_Objects_Get_information_id>
2009b7c: 90 10 00 18 mov %i0, %o0
if ( !information )
2009b80: ba 92 20 00 orcc %o0, 0, %i5
2009b84: 02 80 00 38 be 2009c64 <_Objects_Get_name_as_string+0x10c>
2009b88: 92 10 00 18 mov %i0, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
2009b8c: 40 00 00 3f call 2009c88 <_Objects_Get>
2009b90: 94 07 bf fc add %fp, -4, %o2
switch ( location ) {
2009b94: c2 07 bf fc ld [ %fp + -4 ], %g1
2009b98: 80 a0 60 00 cmp %g1, 0
2009b9c: 32 80 00 33 bne,a 2009c68 <_Objects_Get_name_as_string+0x110>
2009ba0: b4 10 20 00 clr %i2
return NULL;
case OBJECTS_LOCAL:
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string ) {
2009ba4: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1
2009ba8: 80 a0 60 00 cmp %g1, 0
2009bac: 32 80 00 31 bne,a 2009c70 <_Objects_Get_name_as_string+0x118>
2009bb0: c4 02 20 0c ld [ %o0 + 0xc ], %g2
s = the_object->name.name_p;
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
2009bb4: c2 02 20 0c ld [ %o0 + 0xc ], %g1
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
lname[ 4 ] = '\0';
2009bb8: c0 2f bf f4 clrb [ %fp + -12 ]
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
lname[ 1 ] = (u32_name >> 16) & 0xff;
lname[ 2 ] = (u32_name >> 8) & 0xff;
2009bbc: 85 30 60 08 srl %g1, 8, %g2
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2009bc0: 89 30 60 18 srl %g1, 0x18, %g4
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009bc4: 87 30 60 10 srl %g1, 0x10, %g3
lname[ 2 ] = (u32_name >> 8) & 0xff;
2009bc8: c4 2f bf f2 stb %g2, [ %fp + -14 ]
} else
#endif
{
uint32_t u32_name = (uint32_t) the_object->name.name_u32;
lname[ 0 ] = (u32_name >> 24) & 0xff;
2009bcc: c8 2f bf f0 stb %g4, [ %fp + -16 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009bd0: c6 2f bf f1 stb %g3, [ %fp + -15 ]
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
2009bd4: c2 2f bf f3 stb %g1, [ %fp + -13 ]
lname[ 4 ] = '\0';
s = lname;
2009bd8: 84 07 bf f0 add %fp, -16, %g2
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009bdc: b2 86 7f ff addcc %i1, -1, %i1
2009be0: 02 80 00 1a be 2009c48 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN
2009be4: 82 10 00 1a mov %i2, %g1
2009be8: c8 48 80 00 ldsb [ %g2 ], %g4
2009bec: 80 a1 20 00 cmp %g4, 0
2009bf0: 02 80 00 16 be 2009c48 <_Objects_Get_name_as_string+0xf0>
2009bf4: c6 08 80 00 ldub [ %g2 ], %g3
2009bf8: 31 00 80 7e sethi %hi(0x201f800), %i0
* 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(
2009bfc: b2 06 80 19 add %i2, %i1, %i1
2009c00: 10 80 00 05 b 2009c14 <_Objects_Get_name_as_string+0xbc>
2009c04: b0 16 20 7c or %i0, 0x7c, %i0
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009c08: 80 a1 20 00 cmp %g4, 0
2009c0c: 02 80 00 0f be 2009c48 <_Objects_Get_name_as_string+0xf0>
2009c10: c6 08 80 00 ldub [ %g2 ], %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
2009c14: fa 06 00 00 ld [ %i0 ], %i5
2009c18: 88 08 e0 ff and %g3, 0xff, %g4
2009c1c: 88 07 40 04 add %i5, %g4, %g4
2009c20: c8 49 20 01 ldsb [ %g4 + 1 ], %g4
2009c24: 80 89 20 97 btst 0x97, %g4
2009c28: 12 80 00 03 bne 2009c34 <_Objects_Get_name_as_string+0xdc>
2009c2c: 84 00 a0 01 inc %g2
2009c30: 86 10 20 2a mov 0x2a, %g3
2009c34: c6 28 40 00 stb %g3, [ %g1 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009c38: 82 00 60 01 inc %g1
2009c3c: 80 a0 40 19 cmp %g1, %i1
2009c40: 32 bf ff f2 bne,a 2009c08 <_Objects_Get_name_as_string+0xb0>
2009c44: c8 48 80 00 ldsb [ %g2 ], %g4
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2009c48: 40 00 03 e2 call 200abd0 <_Thread_Enable_dispatch>
2009c4c: c0 28 40 00 clrb [ %g1 ]
return name;
}
return NULL; /* unreachable path */
}
2009c50: 81 c7 e0 08 ret
2009c54: 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;
2009c58: c2 00 63 6c ld [ %g1 + 0x36c ], %g1
2009c5c: 10 bf ff c7 b 2009b78 <_Objects_Get_name_as_string+0x20>
2009c60: f0 00 60 08 ld [ %g1 + 8 ], %i0
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
2009c64: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
2009c68: 81 c7 e0 08 ret
2009c6c: 91 e8 00 1a restore %g0, %i2, %o0
lname[ 4 ] = '\0';
s = lname;
}
d = name;
if ( s ) {
2009c70: 80 a0 a0 00 cmp %g2, 0
2009c74: 12 bf ff da bne 2009bdc <_Objects_Get_name_as_string+0x84>
2009c78: 82 10 00 1a mov %i2, %g1
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2009c7c: 40 00 03 d5 call 200abd0 <_Thread_Enable_dispatch>
2009c80: c0 28 40 00 clrb [ %g1 ]
2009c84: 30 bf ff f3 b,a 2009c50 <_Objects_Get_name_as_string+0xf8>
02008008 <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
2008008: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
200800c: 90 10 20 00 clr %o0
)
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
2008010: 80 a6 20 00 cmp %i0, 0
2008014: 02 80 00 19 be 2008078 <_Objects_Get_next+0x70>
2008018: ba 10 00 18 mov %i0, %i5
return NULL;
if ( !location_p )
200801c: 80 a6 a0 00 cmp %i2, 0
2008020: 02 80 00 16 be 2008078 <_Objects_Get_next+0x70>
2008024: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
2008028: 02 80 00 14 be 2008078 <_Objects_Get_next+0x70>
200802c: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
2008030: 80 a0 60 00 cmp %g1, 0
2008034: 22 80 00 13 be,a 2008080 <_Objects_Get_next+0x78>
2008038: 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)
200803c: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2008040: 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);
2008044: 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)
2008048: 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);
200804c: 90 10 00 1d mov %i5, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2008050: 80 a0 80 01 cmp %g2, %g1
2008054: 0a 80 00 13 bcs 20080a0 <_Objects_Get_next+0x98>
2008058: 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);
200805c: 40 00 00 18 call 20080bc <_Objects_Get>
2008060: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
2008064: c2 06 80 00 ld [ %i2 ], %g1
2008068: 80 a0 60 00 cmp %g1, 0
200806c: 32 bf ff f5 bne,a 2008040 <_Objects_Get_next+0x38>
2008070: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
*next_id_p = next_id;
2008074: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
2008078: 81 c7 e0 08 ret
200807c: 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)
2008080: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2008084: 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);
2008088: 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)
200808c: 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);
2008090: 90 10 00 1d mov %i5, %o0
else
next_id = id;
do {
/* walked off end of list? */
if (_Objects_Get_index(next_id) > information->maximum)
2008094: 80 a0 80 01 cmp %g2, %g1
2008098: 1a bf ff f1 bcc 200805c <_Objects_Get_next+0x54> <== ALWAYS TAKEN
200809c: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
20080a0: 82 10 20 01 mov 1, %g1
20080a4: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
20080a8: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
20080ac: 82 10 3f ff mov -1, %g1
20080b0: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
20080b4: 81 c7 e0 08 ret
20080b8: 91 e8 00 08 restore %g0, %o0, %o0
02008dd8 <_Objects_Id_to_name>:
*/
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
2008dd8: 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;
2008ddc: 80 a6 20 00 cmp %i0, 0
2008de0: 12 80 00 06 bne 2008df8 <_Objects_Id_to_name+0x20>
2008de4: 83 36 20 18 srl %i0, 0x18, %g1
2008de8: 03 00 80 7c sethi %hi(0x201f000), %g1
2008dec: c2 00 63 dc ld [ %g1 + 0x3dc ], %g1 ! 201f3dc <_Per_CPU_Information+0xc>
2008df0: f0 00 60 08 ld [ %g1 + 8 ], %i0
2008df4: 83 36 20 18 srl %i0, 0x18, %g1
2008df8: 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 )
2008dfc: 84 00 7f ff add %g1, -1, %g2
2008e00: 80 a0 a0 02 cmp %g2, 2
2008e04: 18 80 00 12 bgu 2008e4c <_Objects_Id_to_name+0x74>
2008e08: ba 10 20 03 mov 3, %i5
the_api = _Objects_Get_API( tmpId );
if ( !_Objects_Is_api_valid( the_api ) )
return OBJECTS_INVALID_ID;
if ( !_Objects_Information_table[ the_api ] )
2008e0c: 83 28 60 02 sll %g1, 2, %g1
2008e10: 05 00 80 7b sethi %hi(0x201ec00), %g2
2008e14: 84 10 a1 f8 or %g2, 0x1f8, %g2 ! 201edf8 <_Objects_Information_table>
2008e18: c2 00 80 01 ld [ %g2 + %g1 ], %g1
2008e1c: 80 a0 60 00 cmp %g1, 0
2008e20: 02 80 00 0b be 2008e4c <_Objects_Id_to_name+0x74>
2008e24: 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 ];
2008e28: 85 28 a0 02 sll %g2, 2, %g2
2008e2c: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
2008e30: 80 a2 20 00 cmp %o0, 0
2008e34: 02 80 00 06 be 2008e4c <_Objects_Id_to_name+0x74> <== NEVER TAKEN
2008e38: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string )
2008e3c: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1
2008e40: 80 a0 60 00 cmp %g1, 0
2008e44: 02 80 00 04 be 2008e54 <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN
2008e48: 92 10 00 18 mov %i0, %o1
return OBJECTS_INVALID_ID;
*name = the_object->name;
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
}
2008e4c: 81 c7 e0 08 ret
2008e50: 91 e8 00 1d restore %g0, %i5, %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 );
2008e54: 7f ff ff c3 call 2008d60 <_Objects_Get>
2008e58: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
2008e5c: 80 a2 20 00 cmp %o0, 0
2008e60: 02 bf ff fb be 2008e4c <_Objects_Id_to_name+0x74>
2008e64: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
2008e68: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2008e6c: ba 10 20 00 clr %i5
the_object = _Objects_Get( information, tmpId, &ignored_location );
if ( !the_object )
return OBJECTS_INVALID_ID;
*name = the_object->name;
_Thread_Enable_dispatch();
2008e70: 40 00 03 b7 call 2009d4c <_Thread_Enable_dispatch>
2008e74: c2 26 40 00 st %g1, [ %i1 ]
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2008e78: 30 bf ff f5 b,a 2008e4c <_Objects_Id_to_name+0x74>
02008650 <_Objects_Shrink_information>:
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
2008650: 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 );
2008654: fa 16 20 0a lduh [ %i0 + 0xa ], %i5
block_count = (information->maximum - index_base) /
2008658: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4
200865c: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
2008660: 92 10 00 1c mov %i4, %o1
2008664: 40 00 40 94 call 20188b4 <.udiv>
2008668: 90 22 00 1d sub %o0, %i5, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
200866c: 80 a2 20 00 cmp %o0, 0
2008670: 02 80 00 34 be 2008740 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN
2008674: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
2008678: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
200867c: c2 01 00 00 ld [ %g4 ], %g1
2008680: 80 a7 00 01 cmp %i4, %g1
2008684: 02 80 00 0f be 20086c0 <_Objects_Shrink_information+0x70> <== NEVER TAKEN
2008688: 82 10 20 00 clr %g1
200868c: 10 80 00 07 b 20086a8 <_Objects_Shrink_information+0x58>
2008690: b6 10 20 04 mov 4, %i3
* the_block - the block to remove
*
* Output parameters: NONE
*/
void _Objects_Shrink_information(
2008694: 86 06 e0 04 add %i3, 4, %g3
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
if ( information->inactive_per_block[ block ] ==
2008698: 80 a7 00 02 cmp %i4, %g2
200869c: 02 80 00 0a be 20086c4 <_Objects_Shrink_information+0x74>
20086a0: ba 07 40 1c add %i5, %i4, %i5
20086a4: b6 10 00 03 mov %g3, %i3
index_base = _Objects_Get_index( information->minimum_id );
block_count = (information->maximum - index_base) /
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
20086a8: 82 00 60 01 inc %g1
20086ac: 80 a0 40 08 cmp %g1, %o0
20086b0: 32 bf ff f9 bne,a 2008694 <_Objects_Shrink_information+0x44>
20086b4: c4 01 00 1b ld [ %g4 + %i3 ], %g2
20086b8: 81 c7 e0 08 ret
20086bc: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
20086c0: b6 10 20 00 clr %i3 <== NOT EXECUTED
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
20086c4: 10 80 00 06 b 20086dc <_Objects_Shrink_information+0x8c>
20086c8: d0 06 20 20 ld [ %i0 + 0x20 ], %o0
if ((index >= index_base) &&
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
}
}
while ( the_object );
20086cc: 80 a7 20 00 cmp %i4, 0
20086d0: 22 80 00 12 be,a 2008718 <_Objects_Shrink_information+0xc8>
20086d4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
index = _Objects_Get_index( the_object->id );
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
20086d8: 90 10 00 1c mov %i4, %o0
* Assume the Inactive chain is never empty at this point
*/
the_object = (Objects_Control *) _Chain_First( &information->Inactive );
do {
index = _Objects_Get_index( the_object->id );
20086dc: c2 12 20 0a lduh [ %o0 + 0xa ], %g1
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
if ((index >= index_base) &&
20086e0: 80 a0 40 1d cmp %g1, %i5
20086e4: 0a bf ff fa bcs 20086cc <_Objects_Shrink_information+0x7c>
20086e8: f8 02 00 00 ld [ %o0 ], %i4
(index < (index_base + information->allocation_size))) {
20086ec: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
20086f0: 84 07 40 02 add %i5, %g2, %g2
/*
* Get the next node before the node is extracted
*/
extract_me = the_object;
the_object = (Objects_Control *) the_object->Node.next;
if ((index >= index_base) &&
20086f4: 80 a0 40 02 cmp %g1, %g2
20086f8: 1a bf ff f6 bcc 20086d0 <_Objects_Shrink_information+0x80>
20086fc: 80 a7 20 00 cmp %i4, 0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
2008700: 7f ff fb 4e call 2007438 <_Chain_Extract>
2008704: 01 00 00 00 nop
}
}
while ( the_object );
2008708: 80 a7 20 00 cmp %i4, 0
200870c: 12 bf ff f4 bne 20086dc <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN
2008710: 90 10 00 1c mov %i4, %o0
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
2008714: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
2008718: 40 00 07 da call 200a680 <_Workspace_Free>
200871c: d0 00 40 1b ld [ %g1 + %i3 ], %o0
information->object_blocks[ block ] = NULL;
2008720: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
2008724: 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;
2008728: c0 20 40 1b clr [ %g1 + %i3 ]
information->inactive_per_block[ block ] = 0;
200872c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
2008730: 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;
2008734: c0 20 c0 1b clr [ %g3 + %i3 ]
information->inactive -= information->allocation_size;
2008738: 82 20 80 01 sub %g2, %g1, %g1
200873c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
2008740: 81 c7 e0 08 ret
2008744: 81 e8 00 00 restore
0200f0b4 <_POSIX_Keys_Run_destructors>:
*/
void _POSIX_Keys_Run_destructors(
Thread_Control *thread
)
{
200f0b4: 9d e3 bf a0 save %sp, -96, %sp
Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id );
200f0b8: f4 06 20 08 ld [ %i0 + 8 ], %i2
200f0bc: 3b 00 80 77 sethi %hi(0x201dc00), %i5
200f0c0: b3 36 a0 18 srl %i2, 0x18, %i1
200f0c4: ba 17 63 18 or %i5, 0x318, %i5
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 ];
200f0c8: b5 2e a0 10 sll %i2, 0x10, %i2
200f0cc: b2 0e 60 07 and %i1, 7, %i1
200f0d0: b5 36 a0 0e srl %i2, 0xe, %i2
200f0d4: b2 06 60 04 add %i1, 4, %i1
200f0d8: 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 ) {
200f0dc: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3
200f0e0: 80 a6 e0 00 cmp %i3, 0
200f0e4: 02 80 00 20 be 200f164 <_POSIX_Keys_Run_destructors+0xb0>
200f0e8: b8 10 20 01 mov 1, %i4
200f0ec: 84 10 20 01 mov 1, %g2
POSIX_Keys_Control *key = (POSIX_Keys_Control *)
200f0f0: c6 07 60 1c ld [ %i5 + 0x1c ], %g3
_POSIX_Keys_Information.local_table [ index ];
200f0f4: 83 2f 20 10 sll %i4, 0x10, %g1
Objects_Maximum max = _POSIX_Keys_Information.maximum;
done = true;
for ( index = 1 ; index <= max ; ++index ) {
POSIX_Keys_Control *key = (POSIX_Keys_Control *)
200f0f8: 83 30 60 0e srl %g1, 0xe, %g1
200f0fc: c2 00 c0 01 ld [ %g3 + %g1 ], %g1
_POSIX_Keys_Information.local_table [ index ];
if ( key != NULL && key->destructor != NULL ) {
200f100: 80 a0 60 00 cmp %g1, 0
200f104: 02 80 00 10 be 200f144 <_POSIX_Keys_Run_destructors+0x90>
200f108: 86 00 40 19 add %g1, %i1, %g3
200f10c: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
200f110: 80 a1 20 00 cmp %g4, 0
200f114: 22 80 00 0d be,a 200f148 <_POSIX_Keys_Run_destructors+0x94>
200f118: b8 07 20 01 inc %i4
void *value = key->Values [ thread_api ][ thread_index ];
200f11c: c6 00 e0 04 ld [ %g3 + 4 ], %g3
200f120: d0 00 c0 1a ld [ %g3 + %i2 ], %o0
if ( value != NULL ) {
200f124: 80 a2 20 00 cmp %o0, 0
200f128: 22 80 00 08 be,a 200f148 <_POSIX_Keys_Run_destructors+0x94><== ALWAYS TAKEN
200f12c: b8 07 20 01 inc %i4
key->Values [ thread_api ][ thread_index ] = NULL;
200f130: c0 20 c0 1a clr [ %g3 + %i2 ] <== NOT EXECUTED
(*key->destructor)( value );
200f134: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED
200f138: 9f c0 40 00 call %g1 <== NOT EXECUTED
200f13c: 01 00 00 00 nop <== NOT EXECUTED
done = false;
200f140: 84 10 20 00 clr %g2 ! 0 <PROM_START> <== NOT EXECUTED
Objects_Maximum index = 0;
Objects_Maximum max = _POSIX_Keys_Information.maximum;
done = true;
for ( index = 1 ; index <= max ; ++index ) {
200f144: b8 07 20 01 inc %i4
200f148: 83 2f 20 10 sll %i4, 0x10, %g1
200f14c: 83 30 60 10 srl %g1, 0x10, %g1
200f150: 80 a6 c0 01 cmp %i3, %g1
200f154: 1a bf ff e7 bcc 200f0f0 <_POSIX_Keys_Run_destructors+0x3c>
200f158: 80 88 a0 ff btst 0xff, %g2
* 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 ) {
200f15c: 22 bf ff e1 be,a 200f0e0 <_POSIX_Keys_Run_destructors+0x2c><== NEVER TAKEN
200f160: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 <== NOT EXECUTED
200f164: 81 c7 e0 08 ret
200f168: 81 e8 00 00 restore
0200b628 <_POSIX_Message_queue_Receive_support>:
size_t msg_len,
unsigned int *msg_prio,
bool wait,
Watchdog_Interval timeout
)
{
200b628: 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(
200b62c: 11 00 80 9f sethi %hi(0x2027c00), %o0
200b630: 92 10 00 18 mov %i0, %o1
200b634: 90 12 23 5c or %o0, 0x35c, %o0
200b638: 40 00 0d 4c call 200eb68 <_Objects_Get>
200b63c: 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 ) {
200b640: c2 07 bf f8 ld [ %fp + -8 ], %g1
200b644: 80 a0 60 00 cmp %g1, 0
200b648: 22 80 00 08 be,a 200b668 <_POSIX_Message_queue_Receive_support+0x40>
200b64c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EBADF );
200b650: 40 00 2d 42 call 2016b58 <__errno>
200b654: b0 10 3f ff mov -1, %i0
200b658: 82 10 20 09 mov 9, %g1
200b65c: c2 22 00 00 st %g1, [ %o0 ]
}
200b660: 81 c7 e0 08 ret
200b664: 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 ) {
200b668: 84 08 60 03 and %g1, 3, %g2
200b66c: 80 a0 a0 01 cmp %g2, 1
200b670: 02 80 00 3a be 200b758 <_POSIX_Message_queue_Receive_support+0x130>
200b674: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EBADF );
}
the_mq = the_mq_fd->Queue;
200b678: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
if ( msg_len < the_mq->Message_queue.maximum_message_size ) {
200b67c: c4 02 20 68 ld [ %o0 + 0x68 ], %g2
200b680: 80 a0 80 1a cmp %g2, %i2
200b684: 18 80 00 24 bgu 200b714 <_POSIX_Message_queue_Receive_support+0xec>
200b688: 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;
200b68c: c4 27 bf fc st %g2, [ %fp + -4 ]
/*
* A timed receive with a bad time will do a poll regardless.
*/
if ( wait )
200b690: 80 a7 20 00 cmp %i4, 0
200b694: 12 80 00 1b bne 200b700 <_POSIX_Message_queue_Receive_support+0xd8>
200b698: 98 10 20 00 clr %o4
do_wait = wait;
/*
* Now perform the actual message receive
*/
_CORE_message_queue_Seize(
200b69c: 9a 10 00 1d mov %i5, %o5
200b6a0: 90 02 20 1c add %o0, 0x1c, %o0
200b6a4: 92 10 00 18 mov %i0, %o1
200b6a8: 94 10 00 19 mov %i1, %o2
200b6ac: 96 07 bf fc add %fp, -4, %o3
200b6b0: 40 00 08 c4 call 200d9c0 <_CORE_message_queue_Seize>
200b6b4: 98 0b 20 01 and %o4, 1, %o4
&length_out,
do_wait,
timeout
);
_Thread_Enable_dispatch();
200b6b8: 40 00 11 1d call 200fb2c <_Thread_Enable_dispatch>
200b6bc: 3b 00 80 9f sethi %hi(0x2027c00), %i5
if (msg_prio) {
200b6c0: 80 a6 e0 00 cmp %i3, 0
*msg_prio = _POSIX_Message_queue_Priority_from_core(
_Thread_Executing->Wait.count
200b6c4: ba 17 63 d0 or %i5, 0x3d0, %i5
do_wait,
timeout
);
_Thread_Enable_dispatch();
if (msg_prio) {
200b6c8: 02 80 00 07 be 200b6e4 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN
200b6cc: c2 07 60 0c ld [ %i5 + 0xc ], %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 ((priority >= 0) ? priority : -priority);
200b6d0: c6 00 60 24 ld [ %g1 + 0x24 ], %g3
200b6d4: 85 38 e0 1f sra %g3, 0x1f, %g2
200b6d8: 86 18 80 03 xor %g2, %g3, %g3
200b6dc: 84 20 c0 02 sub %g3, %g2, %g2
*msg_prio = _POSIX_Message_queue_Priority_from_core(
200b6e0: c4 26 c0 00 st %g2, [ %i3 ]
_Thread_Executing->Wait.count
);
}
if ( !_Thread_Executing->Wait.return_code )
200b6e4: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
200b6e8: 80 a0 60 00 cmp %g1, 0
200b6ec: 12 80 00 12 bne 200b734 <_POSIX_Message_queue_Receive_support+0x10c>
200b6f0: 01 00 00 00 nop
return length_out;
200b6f4: f0 07 bf fc ld [ %fp + -4 ], %i0
200b6f8: 81 c7 e0 08 ret
200b6fc: 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;
200b700: 05 00 00 10 sethi %hi(0x4000), %g2
200b704: 82 08 40 02 and %g1, %g2, %g1
200b708: 80 a0 00 01 cmp %g0, %g1
200b70c: 10 bf ff e4 b 200b69c <_POSIX_Message_queue_Receive_support+0x74>
200b710: 98 60 3f ff subx %g0, -1, %o4
}
the_mq = the_mq_fd->Queue;
if ( msg_len < the_mq->Message_queue.maximum_message_size ) {
_Thread_Enable_dispatch();
200b714: 40 00 11 06 call 200fb2c <_Thread_Enable_dispatch>
200b718: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EMSGSIZE );
200b71c: 40 00 2d 0f call 2016b58 <__errno>
200b720: 01 00 00 00 nop
200b724: 82 10 20 7a mov 0x7a, %g1 ! 7a <PROM_START+0x7a>
200b728: c2 22 00 00 st %g1, [ %o0 ]
200b72c: 81 c7 e0 08 ret
200b730: 81 e8 00 00 restore
}
if ( !_Thread_Executing->Wait.return_code )
return length_out;
rtems_set_errno_and_return_minus_one(
200b734: 40 00 2d 09 call 2016b58 <__errno>
200b738: b0 10 3f ff mov -1, %i0
200b73c: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200b740: b6 10 00 08 mov %o0, %i3
200b744: 40 00 00 a3 call 200b9d0 <_POSIX_Message_queue_Translate_core_message_queue_return_code>
200b748: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
200b74c: d0 26 c0 00 st %o0, [ %i3 ]
200b750: 81 c7 e0 08 ret
200b754: 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();
200b758: 40 00 10 f5 call 200fb2c <_Thread_Enable_dispatch>
200b75c: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EBADF );
200b760: 40 00 2c fe call 2016b58 <__errno>
200b764: 01 00 00 00 nop
200b768: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
200b76c: c2 22 00 00 st %g1, [ %o0 ]
200b770: 81 c7 e0 08 ret
200b774: 81 e8 00 00 restore
0200c278 <_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 ];
200c278: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
200c27c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2
200c280: 80 a0 a0 00 cmp %g2, 0
200c284: 12 80 00 06 bne 200c29c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN
200c288: 01 00 00 00 nop
200c28c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2
200c290: 80 a0 a0 01 cmp %g2, 1
200c294: 22 80 00 05 be,a 200c2a8 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30>
200c298: 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();
200c29c: 82 13 c0 00 mov %o7, %g1
200c2a0: 7f ff f3 d1 call 20091e4 <_Thread_Enable_dispatch>
200c2a4: 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 &&
200c2a8: 80 a0 60 00 cmp %g1, 0
200c2ac: 02 bf ff fc be 200c29c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24>
200c2b0: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
200c2b4: 03 00 80 60 sethi %hi(0x2018000), %g1
200c2b8: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 20181d0 <_Thread_Dispatch_disable_level>
thread_support->cancelation_requested ) {
_Thread_Unnest_dispatch();
_POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED );
200c2bc: 92 10 3f ff mov -1, %o1
200c2c0: 84 00 bf ff add %g2, -1, %g2
200c2c4: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
return _Thread_Dispatch_disable_level;
200c2c8: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1
200c2cc: 82 13 c0 00 mov %o7, %g1
200c2d0: 40 00 01 da call 200ca38 <_POSIX_Thread_Exit>
200c2d4: 9e 10 40 00 mov %g1, %o7
0200d79c <_POSIX_Thread_Translate_sched_param>:
int policy,
struct sched_param *param,
Thread_CPU_budget_algorithms *budget_algorithm,
Thread_CPU_budget_algorithm_callout *budget_callout
)
{
200d79c: 9d e3 bf a0 save %sp, -96, %sp
if ( !_POSIX_Priority_Is_valid( param->sched_priority ) )
200d7a0: d0 06 40 00 ld [ %i1 ], %o0
200d7a4: 7f ff ff f1 call 200d768 <_POSIX_Priority_Is_valid>
200d7a8: ba 10 00 18 mov %i0, %i5
200d7ac: 80 8a 20 ff btst 0xff, %o0
200d7b0: 02 80 00 34 be 200d880 <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN
200d7b4: b0 10 20 16 mov 0x16, %i0
return EINVAL;
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
200d7b8: c0 26 80 00 clr [ %i2 ]
*budget_callout = NULL;
200d7bc: c0 26 c0 00 clr [ %i3 ]
if ( policy == SCHED_OTHER ) {
200d7c0: 80 a7 60 00 cmp %i5, 0
200d7c4: 02 80 00 2d be 200d878 <_POSIX_Thread_Translate_sched_param+0xdc>
200d7c8: b0 10 20 00 clr %i0
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
return 0;
}
if ( policy == SCHED_FIFO ) {
200d7cc: 80 a7 60 01 cmp %i5, 1
200d7d0: 02 80 00 2c be 200d880 <_POSIX_Thread_Translate_sched_param+0xe4>
200d7d4: 80 a7 60 02 cmp %i5, 2
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
return 0;
}
if ( policy == SCHED_RR ) {
200d7d8: 02 80 00 2c be 200d888 <_POSIX_Thread_Translate_sched_param+0xec>
200d7dc: 80 a7 60 04 cmp %i5, 4
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE;
return 0;
}
if ( policy == SCHED_SPORADIC ) {
200d7e0: 12 80 00 28 bne 200d880 <_POSIX_Thread_Translate_sched_param+0xe4>
200d7e4: b0 10 20 16 mov 0x16, %i0
if ( (param->sched_ss_repl_period.tv_sec == 0) &&
200d7e8: c2 06 60 08 ld [ %i1 + 8 ], %g1
200d7ec: 80 a0 60 00 cmp %g1, 0
200d7f0: 32 80 00 07 bne,a 200d80c <_POSIX_Thread_Translate_sched_param+0x70>
200d7f4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200d7f8: c2 06 60 0c ld [ %i1 + 0xc ], %g1
200d7fc: 80 a0 60 00 cmp %g1, 0
200d800: 02 80 00 23 be 200d88c <_POSIX_Thread_Translate_sched_param+0xf0>
200d804: 01 00 00 00 nop
(param->sched_ss_repl_period.tv_nsec == 0) )
return EINVAL;
if ( (param->sched_ss_init_budget.tv_sec == 0) &&
200d808: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200d80c: 80 a0 60 00 cmp %g1, 0
200d810: 12 80 00 06 bne 200d828 <_POSIX_Thread_Translate_sched_param+0x8c>
200d814: 01 00 00 00 nop
200d818: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200d81c: 80 a0 60 00 cmp %g1, 0
200d820: 02 80 00 18 be 200d880 <_POSIX_Thread_Translate_sched_param+0xe4>
200d824: b0 10 20 16 mov 0x16, %i0
(param->sched_ss_init_budget.tv_nsec == 0) )
return EINVAL;
if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) <
200d828: 7f ff f5 26 call 200acc0 <_Timespec_To_ticks>
200d82c: 90 06 60 08 add %i1, 8, %o0
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
return EINVAL;
200d830: b0 10 20 16 mov 0x16, %i0
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 ) <
200d834: ba 10 00 08 mov %o0, %i5
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
200d838: 7f ff f5 22 call 200acc0 <_Timespec_To_ticks>
200d83c: 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 ) <
200d840: 80 a7 40 08 cmp %i5, %o0
200d844: 0a 80 00 12 bcs 200d88c <_POSIX_Thread_Translate_sched_param+0xf0>
200d848: 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 ) )
200d84c: 7f ff ff c7 call 200d768 <_POSIX_Priority_Is_valid>
200d850: d0 06 60 04 ld [ %i1 + 4 ], %o0
200d854: 80 8a 20 ff btst 0xff, %o0
200d858: 02 80 00 0a be 200d880 <_POSIX_Thread_Translate_sched_param+0xe4>
200d85c: 82 10 20 03 mov 3, %g1
return EINVAL;
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT;
200d860: c2 26 80 00 st %g1, [ %i2 ]
*budget_callout = _POSIX_Threads_Sporadic_budget_callout;
200d864: 03 00 80 1b sethi %hi(0x2006c00), %g1
200d868: 82 10 60 7c or %g1, 0x7c, %g1 ! 2006c7c <_POSIX_Threads_Sporadic_budget_callout>
200d86c: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
return EINVAL;
}
200d870: 81 c7 e0 08 ret
200d874: 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;
200d878: 82 10 20 01 mov 1, %g1
200d87c: c2 26 80 00 st %g1, [ %i2 ]
return 0;
200d880: 81 c7 e0 08 ret
200d884: 81 e8 00 00 restore
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
return 0;
}
if ( policy == SCHED_RR ) {
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE;
200d888: fa 26 80 00 st %i5, [ %i2 ]
return 0;
200d88c: 81 c7 e0 08 ret
200d890: 81 e8 00 00 restore
0200c9bc <_POSIX_Threads_Delete_extension>:
*/
void _POSIX_Threads_Delete_extension(
Thread_Control *executing __attribute__((unused)),
Thread_Control *deleted
)
{
200c9bc: 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 ];
200c9c0: f0 06 61 5c ld [ %i1 + 0x15c ], %i0
/*
* Run the POSIX cancellation handlers
*/
_POSIX_Threads_cancel_run( deleted );
200c9c4: 40 00 09 a0 call 200f044 <_POSIX_Threads_cancel_run>
200c9c8: 90 10 00 19 mov %i1, %o0
/*
* Run all the key destructors
*/
_POSIX_Keys_Run_destructors( deleted );
200c9cc: 90 10 00 19 mov %i1, %o0
200c9d0: 40 00 09 b9 call 200f0b4 <_POSIX_Keys_Run_destructors>
200c9d4: 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 )) )
200c9d8: 10 80 00 03 b 200c9e4 <_POSIX_Threads_Delete_extension+0x28>
200c9dc: f8 06 60 28 ld [ %i1 + 0x28 ], %i4
*(void **)the_thread->Wait.return_argument = value_ptr;
200c9e0: 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 )) )
200c9e4: 7f ff f3 66 call 200977c <_Thread_queue_Dequeue>
200c9e8: 90 10 00 1d mov %i5, %o0
200c9ec: 80 a2 20 00 cmp %o0, 0
200c9f0: 32 bf ff fc bne,a 200c9e0 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN
200c9f4: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED
*(void **)the_thread->Wait.return_argument = value_ptr;
if ( api->schedpolicy == SCHED_SPORADIC )
200c9f8: c2 06 20 84 ld [ %i0 + 0x84 ], %g1
200c9fc: 80 a0 60 04 cmp %g1, 4
200ca00: 02 80 00 05 be 200ca14 <_POSIX_Threads_Delete_extension+0x58>
200ca04: 01 00 00 00 nop
(void) _Watchdog_Remove( &api->Sporadic_timer );
deleted->API_Extensions[ THREAD_API_POSIX ] = NULL;
200ca08: c0 26 61 5c clr [ %i1 + 0x15c ]
_Workspace_Free( api );
200ca0c: 7f ff f7 1d call 200a680 <_Workspace_Free>
200ca10: 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 );
200ca14: 7f ff f6 97 call 200a470 <_Watchdog_Remove>
200ca18: 90 06 20 a8 add %i0, 0xa8, %o0
deleted->API_Extensions[ THREAD_API_POSIX ] = NULL;
200ca1c: c0 26 61 5c clr [ %i1 + 0x15c ]
_Workspace_Free( api );
200ca20: 7f ff f7 18 call 200a680 <_Workspace_Free>
200ca24: 81 e8 00 00 restore
0200697c <_POSIX_Threads_Initialize_user_threads_body>:
*
* Output parameters: NONE
*/
void _POSIX_Threads_Initialize_user_threads_body(void)
{
200697c: 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;
2006980: 03 00 80 76 sethi %hi(0x201d800), %g1
2006984: 82 10 60 14 or %g1, 0x14, %g1 ! 201d814 <Configuration_POSIX_API>
maximum = Configuration_POSIX_API.number_of_initialization_threads;
2006988: f6 00 60 30 ld [ %g1 + 0x30 ], %i3
if ( !user_threads || maximum == 0 )
200698c: 80 a6 e0 00 cmp %i3, 0
2006990: 02 80 00 18 be 20069f0 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
2006994: fa 00 60 34 ld [ %g1 + 0x34 ], %i5
2006998: 80 a7 60 00 cmp %i5, 0
200699c: 02 80 00 15 be 20069f0 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
20069a0: 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 );
20069a4: 40 00 1b bc call 200d894 <pthread_attr_init>
20069a8: 90 07 bf bc add %fp, -68, %o0
(void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED );
20069ac: 92 10 20 02 mov 2, %o1
20069b0: 40 00 1b c5 call 200d8c4 <pthread_attr_setinheritsched>
20069b4: 90 07 bf bc add %fp, -68, %o0
(void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size);
20069b8: d2 07 60 04 ld [ %i5 + 4 ], %o1
20069bc: 40 00 1b d2 call 200d904 <pthread_attr_setstacksize>
20069c0: 90 07 bf bc add %fp, -68, %o0
status = pthread_create(
20069c4: d4 07 40 00 ld [ %i5 ], %o2
20069c8: 90 07 bf fc add %fp, -4, %o0
20069cc: 92 07 bf bc add %fp, -68, %o1
20069d0: 7f ff fe fd call 20065c4 <pthread_create>
20069d4: 96 10 20 00 clr %o3
&thread_id,
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
20069d8: 94 92 20 00 orcc %o0, 0, %o2
20069dc: 12 80 00 07 bne 20069f8 <_POSIX_Threads_Initialize_user_threads_body+0x7c>
20069e0: 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++ ) {
20069e4: 80 a6 c0 1c cmp %i3, %i4
20069e8: 18 bf ff ef bgu 20069a4 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN
20069ec: ba 07 60 08 add %i5, 8, %i5
20069f0: 81 c7 e0 08 ret
20069f4: 81 e8 00 00 restore
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
_Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status );
20069f8: 90 10 20 02 mov 2, %o0
20069fc: 40 00 08 55 call 2008b50 <_Internal_error_Occurred>
2006a00: 92 10 20 01 mov 1, %o1
0200cb5c <_POSIX_Threads_Sporadic_budget_TSR>:
*/
void _POSIX_Threads_Sporadic_budget_TSR(
Objects_Id id __attribute__((unused)),
void *argument
)
{
200cb5c: 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 ];
200cb60: 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 );
200cb64: 40 00 04 09 call 200db88 <_Timespec_To_ticks>
200cb68: 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);
200cb6c: c4 07 60 88 ld [ %i5 + 0x88 ], %g2
200cb70: 03 00 80 73 sethi %hi(0x201cc00), %g1
200cb74: d2 08 61 cc ldub [ %g1 + 0x1cc ], %o1 ! 201cdcc <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 ) {
200cb78: c2 06 60 1c ld [ %i1 + 0x1c ], %g1
200cb7c: 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;
200cb80: d0 26 60 78 st %o0, [ %i1 + 0x78 ]
*/
#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 ) {
200cb84: 80 a0 60 00 cmp %g1, 0
200cb88: 12 80 00 06 bne 200cba0 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN
200cb8c: 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 ) {
200cb90: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200cb94: 80 a0 40 09 cmp %g1, %o1
200cb98: 38 80 00 09 bgu,a 200cbbc <_POSIX_Threads_Sporadic_budget_TSR+0x60>
200cb9c: 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 );
200cba0: 40 00 03 fa call 200db88 <_Timespec_To_ticks>
200cba4: 90 07 60 90 add %i5, 0x90, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cba8: 31 00 80 76 sethi %hi(0x201d800), %i0
200cbac: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200cbb0: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cbb4: 7f ff f5 cd call 200a2e8 <_Watchdog_Insert>
200cbb8: 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 );
200cbbc: 7f ff f0 cc call 2008eec <_Thread_Change_priority>
200cbc0: 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 );
200cbc4: 40 00 03 f1 call 200db88 <_Timespec_To_ticks>
200cbc8: 90 07 60 90 add %i5, 0x90, %o0
200cbcc: 31 00 80 76 sethi %hi(0x201d800), %i0
200cbd0: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200cbd4: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cbd8: 7f ff f5 c4 call 200a2e8 <_Watchdog_Insert>
200cbdc: 91 ee 23 bc restore %i0, 0x3bc, %o0
0200cbe0 <_POSIX_Threads_Sporadic_budget_callout>:
)
{
POSIX_API_Control *api;
uint32_t new_priority;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200cbe0: c4 02 21 5c ld [ %o0 + 0x15c ], %g2
200cbe4: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3
200cbe8: 05 00 80 73 sethi %hi(0x201cc00), %g2
200cbec: d2 08 a1 cc ldub [ %g2 + 0x1cc ], %o1 ! 201cdcc <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 ) {
200cbf0: c4 02 20 1c ld [ %o0 + 0x1c ], %g2
200cbf4: 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 */
200cbf8: 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;
200cbfc: 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 ) {
200cc00: 80 a0 a0 00 cmp %g2, 0
200cc04: 12 80 00 06 bne 200cc1c <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN
200cc08: c6 22 20 78 st %g3, [ %o0 + 0x78 ]
/*
* 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 ) {
200cc0c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200cc10: 80 a0 40 09 cmp %g1, %o1
200cc14: 0a 80 00 04 bcs 200cc24 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN
200cc18: 94 10 20 01 mov 1, %o2
200cc1c: 81 c3 e0 08 retl <== NOT EXECUTED
200cc20: 01 00 00 00 nop <== NOT EXECUTED
_Thread_Change_priority( the_thread, new_priority, true );
200cc24: 82 13 c0 00 mov %o7, %g1
200cc28: 7f ff f0 b1 call 2008eec <_Thread_Change_priority>
200cc2c: 9e 10 40 00 mov %g1, %o7
0200f044 <_POSIX_Threads_cancel_run>:
#include <rtems/posix/threadsup.h>
void _POSIX_Threads_cancel_run(
Thread_Control *the_thread
)
{
200f044: 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 ];
200f048: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
handler_stack = &thread_support->Cancellation_Handlers;
thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE;
200f04c: 84 10 20 01 mov 1, %g2
while ( !_Chain_Is_empty( handler_stack ) ) {
200f050: 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 );
200f054: b6 07 20 e8 add %i4, 0xe8, %i3
200f058: 80 a0 40 1b cmp %g1, %i3
200f05c: 02 80 00 14 be 200f0ac <_POSIX_Threads_cancel_run+0x68>
200f060: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ]
_ISR_Disable( level );
200f064: 7f ff cc 60 call 20021e4 <sparc_disable_interrupts>
200f068: 01 00 00 00 nop
handler = (POSIX_Cancel_Handler_control *)
200f06c: fa 07 20 ec ld [ %i4 + 0xec ], %i5
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
200f070: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
200f074: c2 07 60 04 ld [ %i5 + 4 ], %g1
next->previous = previous;
200f078: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
200f07c: c4 20 40 00 st %g2, [ %g1 ]
_Chain_Tail( handler_stack )->previous;
_Chain_Extract_unprotected( &handler->Node );
_ISR_Enable( level );
200f080: 7f ff cc 5d call 20021f4 <sparc_enable_interrupts>
200f084: 01 00 00 00 nop
(*handler->routine)( handler->arg );
200f088: c2 07 60 08 ld [ %i5 + 8 ], %g1
200f08c: 9f c0 40 00 call %g1
200f090: d0 07 60 0c ld [ %i5 + 0xc ], %o0
_Workspace_Free( handler );
200f094: 7f ff ed 7b call 200a680 <_Workspace_Free>
200f098: 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 ) ) {
200f09c: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1
200f0a0: 80 a0 40 1b cmp %g1, %i3
200f0a4: 12 bf ff f0 bne 200f064 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN
200f0a8: 01 00 00 00 nop
200f0ac: 81 c7 e0 08 ret
200f0b0: 81 e8 00 00 restore
020066a4 <_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)
{
20066a4: 9d e3 bf a0 save %sp, -96, %sp
bool activated;
ptimer = (POSIX_Timer_Control *)data;
/* Increment the number of expirations. */
ptimer->overrun = ptimer->overrun + 1;
20066a8: c4 06 60 68 ld [ %i1 + 0x68 ], %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
20066ac: 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;
20066b0: 84 00 a0 01 inc %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
20066b4: 80 a0 60 00 cmp %g1, 0
20066b8: 12 80 00 0e bne 20066f0 <_POSIX_Timer_TSR+0x4c>
20066bc: c4 26 60 68 st %g2, [ %i1 + 0x68 ]
20066c0: c2 06 60 58 ld [ %i1 + 0x58 ], %g1
20066c4: 80 a0 60 00 cmp %g1, 0
20066c8: 32 80 00 0b bne,a 20066f4 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN
20066cc: 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;
20066d0: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED
20066d4: 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 ) ) {
20066d8: d0 06 60 38 ld [ %i1 + 0x38 ], %o0
20066dc: 40 00 1a 46 call 200cff4 <pthread_kill>
20066e0: 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;
20066e4: c0 26 60 68 clr [ %i1 + 0x68 ]
20066e8: 81 c7 e0 08 ret
20066ec: 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(
20066f0: d2 06 60 64 ld [ %i1 + 0x64 ], %o1
20066f4: d4 06 60 08 ld [ %i1 + 8 ], %o2
20066f8: 90 06 60 10 add %i1, 0x10, %o0
20066fc: 98 10 00 19 mov %i1, %o4
2006700: 17 00 80 19 sethi %hi(0x2006400), %o3
2006704: 40 00 1b 63 call 200d490 <_POSIX_Timer_Insert_helper>
2006708: 96 12 e2 a4 or %o3, 0x2a4, %o3 ! 20066a4 <_POSIX_Timer_TSR>
ptimer->ticks,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated )
200670c: 80 8a 20 ff btst 0xff, %o0
2006710: 02 bf ff f6 be 20066e8 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN
2006714: 01 00 00 00 nop
return;
/* Store the time when the timer was started again */
_TOD_Get( &ptimer->time );
2006718: 40 00 05 ec call 2007ec8 <_TOD_Get>
200671c: 90 06 60 6c add %i1, 0x6c, %o0
/* The state really did not change but just to be safe */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
2006720: 82 10 20 03 mov 3, %g1
2006724: 10 bf ff ed b 20066d8 <_POSIX_Timer_TSR+0x34>
2006728: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ]
0200f16c <_POSIX_signals_Check_signal>:
bool _POSIX_signals_Check_signal(
POSIX_API_Control *api,
int signo,
bool is_global
)
{
200f16c: 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,
200f170: 98 10 20 01 mov 1, %o4
200f174: 90 10 00 18 mov %i0, %o0
200f178: 92 10 00 19 mov %i1, %o1
200f17c: 94 07 bf f4 add %fp, -12, %o2
200f180: 40 00 00 2e call 200f238 <_POSIX_signals_Clear_signals>
200f184: 96 10 00 1a mov %i2, %o3
200f188: 80 8a 20 ff btst 0xff, %o0
200f18c: 02 80 00 23 be 200f218 <_POSIX_signals_Check_signal+0xac>
200f190: 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 )
200f194: 85 2e 60 02 sll %i1, 2, %g2
200f198: 37 00 80 78 sethi %hi(0x201e000), %i3
200f19c: b9 2e 60 04 sll %i1, 4, %i4
200f1a0: b6 16 e0 a0 or %i3, 0xa0, %i3
200f1a4: b8 27 00 02 sub %i4, %g2, %i4
200f1a8: 84 06 c0 1c add %i3, %i4, %g2
200f1ac: fa 00 a0 08 ld [ %g2 + 8 ], %i5
200f1b0: 80 a7 60 01 cmp %i5, 1
200f1b4: 02 80 00 19 be 200f218 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN
200f1b8: 21 00 80 78 sethi %hi(0x201e000), %l0
return false;
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
200f1bc: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200f1c0: 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,
200f1c4: a0 14 20 40 or %l0, 0x40, %l0
200f1c8: d2 04 20 0c ld [ %l0 + 0xc ], %o1
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200f1cc: 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,
200f1d0: 90 07 bf cc add %fp, -52, %o0
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200f1d4: 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,
200f1d8: 92 02 60 20 add %o1, 0x20, %o1
200f1dc: 40 00 04 98 call 201043c <memcpy>
200f1e0: 94 10 20 28 mov 0x28, %o2
sizeof( Thread_Wait_information ));
/*
* Here, the signal handler function executes
*/
switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) {
200f1e4: c2 06 c0 1c ld [ %i3 + %i4 ], %g1
200f1e8: 80 a0 60 02 cmp %g1, 2
200f1ec: 02 80 00 0e be 200f224 <_POSIX_signals_Check_signal+0xb8>
200f1f0: 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 );
200f1f4: 9f c7 40 00 call %i5
200f1f8: 01 00 00 00 nop
}
/*
* Restore the blocking information
*/
memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information,
200f1fc: d0 04 20 0c ld [ %l0 + 0xc ], %o0
200f200: 92 07 bf cc add %fp, -52, %o1
200f204: 90 02 20 20 add %o0, 0x20, %o0
200f208: 40 00 04 8d call 201043c <memcpy>
200f20c: 94 10 20 28 mov 0x28, %o2
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
return true;
200f210: 82 10 20 01 mov 1, %g1
sizeof( Thread_Wait_information ));
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
200f214: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ]
return true;
}
200f218: b0 08 60 01 and %g1, 1, %i0
200f21c: 81 c7 e0 08 ret
200f220: 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)(
200f224: 92 07 bf f4 add %fp, -12, %o1
200f228: 9f c7 40 00 call %i5
200f22c: 94 10 20 00 clr %o2
signo,
&siginfo_struct,
NULL /* context is undefined per 1003.1b-1993, p. 66 */
);
break;
200f230: 10 bf ff f4 b 200f200 <_POSIX_signals_Check_signal+0x94>
200f234: d0 04 20 0c ld [ %l0 + 0xc ], %o0
0200fa20 <_POSIX_signals_Clear_process_signals>:
*/
void _POSIX_signals_Clear_process_signals(
int signo
)
{
200fa20: 9d e3 bf a0 save %sp, -96, %sp
clear_signal = true;
mask = signo_to_mask( signo );
ISR_Level level;
_ISR_Disable( level );
200fa24: 7f ff c9 f0 call 20021e4 <sparc_disable_interrupts>
200fa28: 01 00 00 00 nop
if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) {
200fa2c: 85 2e 20 04 sll %i0, 4, %g2
200fa30: 83 2e 20 02 sll %i0, 2, %g1
200fa34: 82 20 80 01 sub %g2, %g1, %g1
200fa38: 05 00 80 78 sethi %hi(0x201e000), %g2
200fa3c: 84 10 a0 a0 or %g2, 0xa0, %g2 ! 201e0a0 <_POSIX_signals_Vectors>
200fa40: c4 00 80 01 ld [ %g2 + %g1 ], %g2
200fa44: 80 a0 a0 02 cmp %g2, 2
200fa48: 02 80 00 0b be 200fa74 <_POSIX_signals_Clear_process_signals+0x54>
200fa4c: 05 00 80 78 sethi %hi(0x201e000), %g2
if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) )
clear_signal = false;
}
if ( clear_signal ) {
_POSIX_signals_Pending &= ~mask;
200fa50: 03 00 80 78 sethi %hi(0x201e000), %g1
200fa54: c4 00 62 94 ld [ %g1 + 0x294 ], %g2 ! 201e294 <_POSIX_signals_Pending>
200fa58: 86 10 20 01 mov 1, %g3
200fa5c: b0 06 3f ff add %i0, -1, %i0
200fa60: b1 28 c0 18 sll %g3, %i0, %i0
200fa64: b0 28 80 18 andn %g2, %i0, %i0
200fa68: f0 20 62 94 st %i0, [ %g1 + 0x294 ]
}
_ISR_Enable( level );
200fa6c: 7f ff c9 e2 call 20021f4 <sparc_enable_interrupts>
200fa70: 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 ] ) )
200fa74: 84 10 a2 98 or %g2, 0x298, %g2
200fa78: c6 00 40 02 ld [ %g1 + %g2 ], %g3
200fa7c: 82 00 40 02 add %g1, %g2, %g1
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200fa80: 82 00 60 04 add %g1, 4, %g1
200fa84: 80 a0 c0 01 cmp %g3, %g1
200fa88: 02 bf ff f3 be 200fa54 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN
200fa8c: 03 00 80 78 sethi %hi(0x201e000), %g1
clear_signal = false;
}
if ( clear_signal ) {
_POSIX_signals_Pending &= ~mask;
}
_ISR_Enable( level );
200fa90: 7f ff c9 d9 call 20021f4 <sparc_enable_interrupts> <== NOT EXECUTED
200fa94: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
020071a8 <_POSIX_signals_Get_lowest>:
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
20071a8: 82 10 20 1b mov 0x1b, %g1
20071ac: 86 10 20 01 mov 1, %g3
#include <rtems/posix/psignal.h>
#include <rtems/seterr.h>
#include <rtems/posix/time.h>
#include <rtems/score/isr.h>
int _POSIX_signals_Get_lowest(
20071b0: 84 00 7f ff add %g1, -1, %g2
20071b4: 85 28 c0 02 sll %g3, %g2, %g2
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
if ( set & signo_to_mask( signo ) ) {
20071b8: 80 88 80 08 btst %g2, %o0
20071bc: 12 80 00 11 bne 2007200 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
20071c0: 01 00 00 00 nop
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
20071c4: 82 00 60 01 inc %g1
20071c8: 80 a0 60 20 cmp %g1, 0x20
20071cc: 12 bf ff fa bne 20071b4 <_POSIX_signals_Get_lowest+0xc>
20071d0: 84 00 7f ff add %g1, -1, %g2
20071d4: 82 10 20 01 mov 1, %g1
20071d8: 10 80 00 05 b 20071ec <_POSIX_signals_Get_lowest+0x44>
20071dc: 86 10 20 01 mov 1, %g3
*/
#if (SIGHUP != 1)
#error "Assumption that SIGHUP==1 violated!!"
#endif
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
20071e0: 80 a0 60 1b cmp %g1, 0x1b
20071e4: 02 80 00 07 be 2007200 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
20071e8: 01 00 00 00 nop
#include <rtems/posix/psignal.h>
#include <rtems/seterr.h>
#include <rtems/posix/time.h>
#include <rtems/score/isr.h>
int _POSIX_signals_Get_lowest(
20071ec: 84 00 7f ff add %g1, -1, %g2
20071f0: 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 ) ) {
20071f4: 80 88 80 08 btst %g2, %o0
20071f8: 22 bf ff fa be,a 20071e0 <_POSIX_signals_Get_lowest+0x38>
20071fc: 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;
}
2007200: 81 c3 e0 08 retl
2007204: 90 10 00 01 mov %g1, %o0
0200c70c <_POSIX_signals_Post_switch_extension>:
*/
void _POSIX_signals_Post_switch_extension(
Thread_Control *the_thread
)
{
200c70c: 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;
200c710: 35 00 80 78 sethi %hi(0x201e000), %i2
POSIX_API_Control *api;
int signo;
ISR_Level level;
int hold_errno;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200c714: 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;
200c718: b4 16 a0 40 or %i2, 0x40, %i2
200c71c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1
/*
* api may be NULL in case of a thread close in progress
*/
if ( !api )
200c720: 80 a7 20 00 cmp %i4, 0
200c724: 02 80 00 34 be 200c7f4 <_POSIX_signals_Post_switch_extension+0xe8>
200c728: 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 );
200c72c: 7f ff d6 ae call 20021e4 <sparc_disable_interrupts>
200c730: 37 00 80 78 sethi %hi(0x201e000), %i3
200c734: b6 16 e2 94 or %i3, 0x294, %i3 ! 201e294 <_POSIX_signals_Pending>
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c738: c6 06 c0 00 ld [ %i3 ], %g3
200c73c: 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 &
200c740: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c744: 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 &
200c748: 80 a8 40 02 andncc %g1, %g2, %g0
200c74c: 02 80 00 26 be 200c7e4 <_POSIX_signals_Post_switch_extension+0xd8>
200c750: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
200c754: 7f ff d6 a8 call 20021f4 <sparc_enable_interrupts>
200c758: ba 10 20 1b mov 0x1b, %i5 ! 1b <PROM_START+0x1b>
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
_POSIX_signals_Check_signal( api, signo, false );
200c75c: 92 10 00 1d mov %i5, %o1
200c760: 94 10 20 00 clr %o2
200c764: 40 00 0a 82 call 200f16c <_POSIX_signals_Check_signal>
200c768: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200c76c: 92 10 00 1d mov %i5, %o1
200c770: 90 10 00 1c mov %i4, %o0
200c774: 40 00 0a 7e call 200f16c <_POSIX_signals_Check_signal>
200c778: 94 10 20 01 mov 1, %o2
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
200c77c: ba 07 60 01 inc %i5
200c780: 80 a7 60 20 cmp %i5, 0x20
200c784: 12 bf ff f7 bne 200c760 <_POSIX_signals_Post_switch_extension+0x54>
200c788: 92 10 00 1d mov %i5, %o1
200c78c: 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 );
200c790: 92 10 00 1d mov %i5, %o1
200c794: 94 10 20 00 clr %o2
200c798: 40 00 0a 75 call 200f16c <_POSIX_signals_Check_signal>
200c79c: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200c7a0: 92 10 00 1d mov %i5, %o1
200c7a4: 90 10 00 1c mov %i4, %o0
200c7a8: 40 00 0a 71 call 200f16c <_POSIX_signals_Check_signal>
200c7ac: 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++ ) {
200c7b0: ba 07 60 01 inc %i5
200c7b4: 80 a7 60 1b cmp %i5, 0x1b
200c7b8: 12 bf ff f7 bne 200c794 <_POSIX_signals_Post_switch_extension+0x88>
200c7bc: 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 );
200c7c0: 7f ff d6 89 call 20021e4 <sparc_disable_interrupts>
200c7c4: 01 00 00 00 nop
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c7c8: c6 06 c0 00 ld [ %i3 ], %g3
200c7cc: 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 &
200c7d0: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c7d4: 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 &
200c7d8: 80 a8 40 02 andncc %g1, %g2, %g0
200c7dc: 12 bf ff de bne 200c754 <_POSIX_signals_Post_switch_extension+0x48><== NEVER TAKEN
200c7e0: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
200c7e4: 7f ff d6 84 call 20021f4 <sparc_enable_interrupts>
200c7e8: 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;
200c7ec: c2 06 a0 0c ld [ %i2 + 0xc ], %g1
200c7f0: f2 20 60 34 st %i1, [ %g1 + 0x34 ]
200c7f4: 81 c7 e0 08 ret
200c7f8: 81 e8 00 00 restore
0201a824 <_POSIX_signals_Unblock_thread>:
bool _POSIX_signals_Unblock_thread(
Thread_Control *the_thread,
int signo,
siginfo_t *info
)
{
201a824: 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 ) ) {
201a828: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
201a82c: 05 04 00 20 sethi %hi(0x10008000), %g2
201a830: 86 10 20 01 mov 1, %g3
201a834: ba 06 7f ff add %i1, -1, %i5
201a838: 88 08 40 02 and %g1, %g2, %g4
{
POSIX_API_Control *api;
sigset_t mask;
siginfo_t *the_info = NULL;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
201a83c: da 06 21 5c ld [ %i0 + 0x15c ], %o5
/*
* Is the thread is specifically waiting for a signal?
*/
if ( _States_Is_interruptible_signal( the_thread->current_state ) ) {
201a840: 80 a1 00 02 cmp %g4, %g2
201a844: 02 80 00 1c be 201a8b4 <_POSIX_signals_Unblock_thread+0x90>
201a848: 9f 28 c0 1d sll %g3, %i5, %o7
}
/*
* Thread is not waiting due to a sigwait.
*/
if ( ~api->signals_blocked & mask ) {
201a84c: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2
201a850: 80 ab c0 02 andncc %o7, %g2, %g0
201a854: 02 80 00 15 be 201a8a8 <_POSIX_signals_Unblock_thread+0x84>
201a858: ba 10 20 00 clr %i5
201a85c: 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 ) ) {
201a860: 80 88 40 02 btst %g1, %g2
201a864: 02 80 00 29 be 201a908 <_POSIX_signals_Unblock_thread+0xe4>
201a868: 80 a0 60 00 cmp %g1, 0
the_thread->Wait.return_code = EINTR;
201a86c: 84 10 20 04 mov 4, %g2
201a870: 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);
201a874: 05 00 00 ef sethi %hi(0x3bc00), %g2
201a878: 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) )
201a87c: 80 88 40 02 btst %g1, %g2
201a880: 12 80 00 36 bne 201a958 <_POSIX_signals_Unblock_thread+0x134>
201a884: 80 88 60 08 btst 8, %g1
_Thread_queue_Extract_with_proxy( the_thread );
else if ( _States_Is_delaying(the_thread->current_state) ) {
201a888: 22 80 00 09 be,a 201a8ac <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN
201a88c: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED
(void) _Watchdog_Remove( &the_thread->Timer );
201a890: 7f ff be f8 call 200a470 <_Watchdog_Remove>
201a894: 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 );
201a898: 13 04 00 ff sethi %hi(0x1003fc00), %o1
201a89c: 90 10 00 18 mov %i0, %o0
201a8a0: 7f ff b9 de call 2009018 <_Thread_Clear_state>
201a8a4: 92 12 63 f8 or %o1, 0x3f8, %o1
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
}
201a8a8: b0 0f 60 01 and %i5, 1, %i0
201a8ac: 81 c7 e0 08 ret
201a8b0: 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) ) {
201a8b4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
201a8b8: 80 8b c0 01 btst %o7, %g1
201a8bc: 22 80 00 21 be,a 201a940 <_POSIX_signals_Unblock_thread+0x11c>
201a8c0: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1
the_thread->Wait.return_code = EINTR;
201a8c4: 82 10 20 04 mov 4, %g1
201a8c8: c2 26 20 34 st %g1, [ %i0 + 0x34 ]
the_info = (siginfo_t *) the_thread->Wait.return_argument;
if ( !info ) {
201a8cc: 80 a6 a0 00 cmp %i2, 0
201a8d0: 02 80 00 27 be 201a96c <_POSIX_signals_Unblock_thread+0x148>
201a8d4: 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;
201a8d8: c4 06 80 00 ld [ %i2 ], %g2
201a8dc: c4 20 40 00 st %g2, [ %g1 ]
201a8e0: c4 06 a0 04 ld [ %i2 + 4 ], %g2
201a8e4: c4 20 60 04 st %g2, [ %g1 + 4 ]
201a8e8: c4 06 a0 08 ld [ %i2 + 8 ], %g2
201a8ec: c4 20 60 08 st %g2, [ %g1 + 8 ]
}
_Thread_queue_Extract_with_proxy( the_thread );
201a8f0: 90 10 00 18 mov %i0, %o0
201a8f4: 7f ff bc b2 call 2009bbc <_Thread_queue_Extract_with_proxy>
201a8f8: ba 10 20 01 mov 1, %i5
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
}
201a8fc: b0 0f 60 01 and %i5, 1, %i0
201a900: 81 c7 e0 08 ret
201a904: 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 ) {
201a908: 12 bf ff e8 bne 201a8a8 <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN
201a90c: 03 00 80 78 sethi %hi(0x201e000), %g1
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201a910: 82 10 60 40 or %g1, 0x40, %g1 ! 201e040 <_Per_CPU_Information>
201a914: c4 00 60 08 ld [ %g1 + 8 ], %g2
201a918: 80 a0 a0 00 cmp %g2, 0
201a91c: 22 bf ff e4 be,a 201a8ac <_POSIX_signals_Unblock_thread+0x88>
201a920: b0 0f 60 01 and %i5, 1, %i0
201a924: c4 00 60 0c ld [ %g1 + 0xc ], %g2
201a928: 80 a6 00 02 cmp %i0, %g2
201a92c: 22 bf ff df be,a 201a8a8 <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN
201a930: c6 28 60 18 stb %g3, [ %g1 + 0x18 ]
201a934: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED
201a938: 81 c7 e0 08 ret <== NOT EXECUTED
201a93c: 81 e8 00 00 restore <== NOT EXECUTED
* 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) ) {
201a940: 80 ab c0 01 andncc %o7, %g1, %g0
201a944: 12 bf ff e0 bne 201a8c4 <_POSIX_signals_Unblock_thread+0xa0>
201a948: ba 10 20 00 clr %i5
201a94c: b0 0f 60 01 and %i5, 1, %i0
201a950: 81 c7 e0 08 ret
201a954: 81 e8 00 00 restore
/*
* 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 );
201a958: 7f ff bc 99 call 2009bbc <_Thread_queue_Extract_with_proxy>
201a95c: 90 10 00 18 mov %i0, %o0
201a960: b0 0f 60 01 and %i5, 1, %i0
201a964: 81 c7 e0 08 ret
201a968: 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;
201a96c: 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;
201a970: f2 20 40 00 st %i1, [ %g1 ]
the_info->si_code = SI_USER;
201a974: c4 20 60 04 st %g2, [ %g1 + 4 ]
the_info->si_value.sival_int = 0;
201a978: 10 bf ff de b 201a8f0 <_POSIX_signals_Unblock_thread+0xcc>
201a97c: c0 20 60 08 clr [ %g1 + 8 ]
0200e47c <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
200e47c: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if (!the_node) return;
200e480: 80 a6 60 00 cmp %i1, 0
200e484: 02 80 00 4c be 200e5b4 <_RBTree_Extract_unprotected+0x138>
200e488: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
200e48c: c2 06 20 08 ld [ %i0 + 8 ], %g1
200e490: 80 a0 40 19 cmp %g1, %i1
200e494: 22 80 00 59 be,a 200e5f8 <_RBTree_Extract_unprotected+0x17c>
200e498: c2 06 60 08 ld [ %i1 + 8 ], %g1
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
}
}
/* check if max needs to be updated: note, min can equal max (1 element) */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
200e49c: c2 06 20 0c ld [ %i0 + 0xc ], %g1
200e4a0: 80 a0 40 19 cmp %g1, %i1
200e4a4: 22 80 00 46 be,a 200e5bc <_RBTree_Extract_unprotected+0x140>
200e4a8: c2 06 60 04 ld [ %i1 + 4 ], %g1
* 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]) {
200e4ac: fa 06 60 04 ld [ %i1 + 4 ], %i5
200e4b0: 80 a7 60 00 cmp %i5, 0
200e4b4: 22 80 00 4a be,a 200e5dc <_RBTree_Extract_unprotected+0x160>
200e4b8: f8 06 60 08 ld [ %i1 + 8 ], %i4
200e4bc: c2 06 60 08 ld [ %i1 + 8 ], %g1
200e4c0: 80 a0 60 00 cmp %g1, 0
200e4c4: 32 80 00 05 bne,a 200e4d8 <_RBTree_Extract_unprotected+0x5c>
200e4c8: c2 07 60 08 ld [ %i5 + 8 ], %g1
200e4cc: 10 80 00 50 b 200e60c <_RBTree_Extract_unprotected+0x190>
200e4d0: 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];
200e4d4: c2 07 60 08 ld [ %i5 + 8 ], %g1
200e4d8: 80 a0 60 00 cmp %g1, 0
200e4dc: 32 bf ff fe bne,a 200e4d4 <_RBTree_Extract_unprotected+0x58>
200e4e0: 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];
200e4e4: f8 07 60 04 ld [ %i5 + 4 ], %i4
if(leaf) {
200e4e8: 80 a7 20 00 cmp %i4, 0
200e4ec: 02 80 00 54 be 200e63c <_RBTree_Extract_unprotected+0x1c0>
200e4f0: 01 00 00 00 nop
leaf->parent = target->parent;
200e4f4: c2 07 40 00 ld [ %i5 ], %g1
200e4f8: 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];
200e4fc: 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];
200e500: 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];
200e504: 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;
200e508: c6 07 60 0c ld [ %i5 + 0xc ], %g3
dir = target != target->parent->child[0];
200e50c: 88 19 00 1d xor %g4, %i5, %g4
200e510: 80 a0 00 04 cmp %g0, %g4
200e514: 88 40 20 00 addx %g0, 0, %g4
target->parent->child[dir] = leaf;
200e518: 89 29 20 02 sll %g4, 2, %g4
200e51c: 84 00 80 04 add %g2, %g4, %g2
200e520: f8 20 a0 04 st %i4, [ %g2 + 4 ]
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
200e524: c4 00 60 04 ld [ %g1 + 4 ], %g2
200e528: 84 18 80 19 xor %g2, %i1, %g2
200e52c: 80 a0 00 02 cmp %g0, %g2
200e530: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = target;
200e534: 85 28 a0 02 sll %g2, 2, %g2
200e538: 82 00 40 02 add %g1, %g2, %g1
200e53c: 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];
200e540: c2 06 60 08 ld [ %i1 + 8 ], %g1
200e544: c2 27 60 08 st %g1, [ %i5 + 8 ]
if (the_node->child[RBT_RIGHT])
200e548: c2 06 60 08 ld [ %i1 + 8 ], %g1
200e54c: 80 a0 60 00 cmp %g1, 0
200e550: 32 80 00 02 bne,a 200e558 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN
200e554: fa 20 40 00 st %i5, [ %g1 ]
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
200e558: c2 06 60 04 ld [ %i1 + 4 ], %g1
200e55c: c2 27 60 04 st %g1, [ %i5 + 4 ]
if (the_node->child[RBT_LEFT])
200e560: c2 06 60 04 ld [ %i1 + 4 ], %g1
200e564: 80 a0 60 00 cmp %g1, 0
200e568: 32 80 00 02 bne,a 200e570 <_RBTree_Extract_unprotected+0xf4>
200e56c: 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;
200e570: c4 06 40 00 ld [ %i1 ], %g2
target->color = the_node->color;
200e574: 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;
200e578: c4 27 40 00 st %g2, [ %i5 ]
target->color = the_node->color;
200e57c: 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 */
200e580: 80 a0 e0 00 cmp %g3, 0
200e584: 32 80 00 06 bne,a 200e59c <_RBTree_Extract_unprotected+0x120>
200e588: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (leaf) {
200e58c: 80 a7 20 00 cmp %i4, 0
200e590: 32 80 00 02 bne,a 200e598 <_RBTree_Extract_unprotected+0x11c>
200e594: 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;
200e598: 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;
200e59c: c0 26 60 08 clr [ %i1 + 8 ]
200e5a0: c0 26 60 04 clr [ %i1 + 4 ]
200e5a4: 80 a0 60 00 cmp %g1, 0
200e5a8: 02 80 00 03 be 200e5b4 <_RBTree_Extract_unprotected+0x138>
200e5ac: c0 26 40 00 clr [ %i1 ]
200e5b0: c0 20 60 0c clr [ %g1 + 0xc ]
200e5b4: 81 c7 e0 08 ret
200e5b8: 81 e8 00 00 restore
the_rbtree->first[RBT_LEFT] = NULL;
}
}
/* check if max needs to be updated: note, min can equal max (1 element) */
if (the_node == the_rbtree->first[RBT_RIGHT]) {
if (the_node->child[RBT_LEFT])
200e5bc: 80 a0 60 00 cmp %g1, 0
200e5c0: 22 80 00 28 be,a 200e660 <_RBTree_Extract_unprotected+0x1e4>
200e5c4: c2 06 40 00 ld [ %i1 ], %g1
* 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]) {
200e5c8: fa 06 60 04 ld [ %i1 + 4 ], %i5
200e5cc: 80 a7 60 00 cmp %i5, 0
200e5d0: 12 bf ff bb bne 200e4bc <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN
200e5d4: c2 26 20 0c st %g1, [ %i0 + 0xc ]
* the_node's location in the tree. This may cause the coloring to be
* 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];
200e5d8: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED
if( leaf ) {
200e5dc: 80 a7 20 00 cmp %i4, 0
200e5e0: 32 80 00 0c bne,a 200e610 <_RBTree_Extract_unprotected+0x194>
200e5e4: 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);
200e5e8: 7f ff fe e0 call 200e168 <_RBTree_Extract_validate_unprotected>
200e5ec: 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];
200e5f0: 10 80 00 0a b 200e618 <_RBTree_Extract_unprotected+0x19c>
200e5f4: c2 06 40 00 ld [ %i1 ], %g1
if (!the_node) return;
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
if (the_node->child[RBT_RIGHT])
200e5f8: 80 a0 60 00 cmp %g1, 0
200e5fc: 22 80 00 14 be,a 200e64c <_RBTree_Extract_unprotected+0x1d0>
200e600: c2 06 40 00 ld [ %i1 ], %g1
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
200e604: 10 bf ff a6 b 200e49c <_RBTree_Extract_unprotected+0x20>
200e608: c2 26 20 08 st %g1, [ %i0 + 8 ]
* 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;
200e60c: c2 06 40 00 ld [ %i1 ], %g1
200e610: 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];
200e614: 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;
200e618: c6 06 60 0c ld [ %i1 + 0xc ], %g3
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
200e61c: c4 00 60 04 ld [ %g1 + 4 ], %g2
200e620: 84 18 80 19 xor %g2, %i1, %g2
200e624: 80 a0 00 02 cmp %g0, %g2
200e628: 84 40 20 00 addx %g0, 0, %g2
the_node->parent->child[dir] = leaf;
200e62c: 85 28 a0 02 sll %g2, 2, %g2
200e630: 82 00 40 02 add %g1, %g2, %g1
200e634: 10 bf ff d3 b 200e580 <_RBTree_Extract_unprotected+0x104>
200e638: f8 20 60 04 st %i4, [ %g1 + 4 ]
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);
200e63c: 7f ff fe cb call 200e168 <_RBTree_Extract_validate_unprotected>
200e640: 90 10 00 1d mov %i5, %o0
}
victim_color = target->color;
dir = target != target->parent->child[0];
200e644: 10 bf ff af b 200e500 <_RBTree_Extract_unprotected+0x84>
200e648: c4 07 40 00 ld [ %i5 ], %g2
if (the_node == the_rbtree->first[RBT_LEFT]) {
if (the_node->child[RBT_RIGHT])
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
else {
the_rbtree->first[RBT_LEFT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
200e64c: 80 a6 00 01 cmp %i0, %g1
200e650: 12 bf ff 93 bne 200e49c <_RBTree_Extract_unprotected+0x20>
200e654: c2 26 20 08 st %g1, [ %i0 + 8 ]
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
200e658: 10 bf ff 91 b 200e49c <_RBTree_Extract_unprotected+0x20>
200e65c: c0 26 20 08 clr [ %i0 + 8 ]
if (the_node == the_rbtree->first[RBT_RIGHT]) {
if (the_node->child[RBT_LEFT])
the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT];
else {
the_rbtree->first[RBT_RIGHT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
200e660: 80 a6 00 01 cmp %i0, %g1
200e664: 12 bf ff 92 bne 200e4ac <_RBTree_Extract_unprotected+0x30>
200e668: c2 26 20 0c st %g1, [ %i0 + 0xc ]
the_rbtree->first[RBT_RIGHT]))
the_rbtree->first[RBT_RIGHT] = NULL;
200e66c: 10 bf ff 90 b 200e4ac <_RBTree_Extract_unprotected+0x30>
200e670: c0 26 20 0c clr [ %i0 + 0xc ]
0200e168 <_RBTree_Extract_validate_unprotected>:
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
RBTree_Node *the_node
)
{
200e168: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
200e16c: c2 06 00 00 ld [ %i0 ], %g1
if(!parent->parent) return;
200e170: c4 00 40 00 ld [ %g1 ], %g2
200e174: 80 a0 a0 00 cmp %g2, 0
200e178: 02 80 00 bf be 200e474 <_RBTree_Extract_validate_unprotected+0x30c>
200e17c: 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])
200e180: c4 00 60 04 ld [ %g1 + 4 ], %g2
200e184: 80 a6 00 02 cmp %i0, %g2
200e188: 22 80 00 02 be,a 200e190 <_RBTree_Extract_validate_unprotected+0x28>
200e18c: c4 00 60 08 ld [ %g1 + 8 ], %g2
}
/* sibling is black, see if both of its children are also black. */
if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
sibling->color = RBT_RED;
200e190: 98 10 20 01 mov 1, %o4
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200e194: c6 06 20 0c ld [ %i0 + 0xc ], %g3
200e198: 80 a0 e0 01 cmp %g3, 1
200e19c: 22 80 00 58 be,a 200e2fc <_RBTree_Extract_validate_unprotected+0x194>
200e1a0: c2 06 00 00 ld [ %i0 ], %g1
if(!parent->parent) return;
sibling = _RBTree_Sibling(the_node);
/* continue to correct tree as long as the_node is black and not the root */
while (!_RBTree_Is_red(the_node) && parent->parent) {
200e1a4: c6 00 40 00 ld [ %g1 ], %g3
200e1a8: 80 a0 e0 00 cmp %g3, 0
200e1ac: 02 80 00 53 be 200e2f8 <_RBTree_Extract_validate_unprotected+0x190>
200e1b0: 80 a0 a0 00 cmp %g2, 0
200e1b4: 22 80 00 07 be,a 200e1d0 <_RBTree_Extract_validate_unprotected+0x68><== NEVER TAKEN
200e1b8: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED
200e1bc: c8 00 a0 0c ld [ %g2 + 0xc ], %g4
200e1c0: 80 a1 20 01 cmp %g4, 1
200e1c4: 22 80 00 28 be,a 200e264 <_RBTree_Extract_validate_unprotected+0xfc>
200e1c8: de 00 60 04 ld [ %g1 + 4 ], %o7
_RBTree_Rotate(parent, dir);
sibling = parent->child[!dir];
}
/* sibling is black, see if both of its children are also black. */
if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
200e1cc: c6 00 a0 08 ld [ %g2 + 8 ], %g3
200e1d0: 80 a0 e0 00 cmp %g3, 0
200e1d4: 22 80 00 07 be,a 200e1f0 <_RBTree_Extract_validate_unprotected+0x88>
200e1d8: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200e1dc: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200e1e0: 80 a0 e0 01 cmp %g3, 1
200e1e4: 22 80 00 4c be,a 200e314 <_RBTree_Extract_validate_unprotected+0x1ac>
200e1e8: c6 00 60 04 ld [ %g1 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
200e1ec: c6 00 a0 04 ld [ %g2 + 4 ], %g3
200e1f0: 80 a0 e0 00 cmp %g3, 0
200e1f4: 22 80 00 07 be,a 200e210 <_RBTree_Extract_validate_unprotected+0xa8>
200e1f8: d8 20 a0 0c st %o4, [ %g2 + 0xc ]
200e1fc: c6 00 e0 0c ld [ %g3 + 0xc ], %g3
200e200: 80 a0 e0 01 cmp %g3, 1
200e204: 22 80 00 44 be,a 200e314 <_RBTree_Extract_validate_unprotected+0x1ac>
200e208: c6 00 60 04 ld [ %g1 + 4 ], %g3
sibling->color = RBT_RED;
200e20c: d8 20 a0 0c st %o4, [ %g2 + 0xc ]
200e210: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200e214: 80 a0 a0 01 cmp %g2, 1
200e218: 22 80 00 38 be,a 200e2f8 <_RBTree_Extract_validate_unprotected+0x190>
200e21c: 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;
200e220: c6 00 40 00 ld [ %g1 ], %g3
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200e224: 80 a0 e0 00 cmp %g3, 0
200e228: 02 80 00 0a be 200e250 <_RBTree_Extract_validate_unprotected+0xe8><== NEVER TAKEN
200e22c: 84 10 20 00 clr %g2
if(!(the_node->parent->parent)) return NULL;
200e230: c8 00 c0 00 ld [ %g3 ], %g4
200e234: 80 a1 20 00 cmp %g4, 0
200e238: 02 80 00 07 be 200e254 <_RBTree_Extract_validate_unprotected+0xec>
200e23c: b0 10 00 01 mov %g1, %i0
if(the_node == the_node->parent->child[RBT_LEFT])
200e240: c4 00 e0 04 ld [ %g3 + 4 ], %g2
200e244: 80 a0 40 02 cmp %g1, %g2
200e248: 22 80 00 05 be,a 200e25c <_RBTree_Extract_validate_unprotected+0xf4>
200e24c: c4 00 e0 08 ld [ %g3 + 8 ], %g2
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
c->parent = the_node->parent;
the_node->parent = c;
200e250: b0 10 00 01 mov %g1, %i0
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
200e254: 10 bf ff d0 b 200e194 <_RBTree_Extract_validate_unprotected+0x2c>
200e258: 82 10 00 03 mov %g3, %g1
200e25c: 10 bf ff ce b 200e194 <_RBTree_Extract_validate_unprotected+0x2c>
200e260: 82 10 00 03 mov %g3, %g1
* 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;
200e264: c8 20 60 0c st %g4, [ %g1 + 0xc ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
200e268: 9e 1b c0 18 xor %o7, %i0, %o7
200e26c: 80 a0 00 0f cmp %g0, %o7
200e270: 9a 40 20 00 addx %g0, 0, %o5
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
200e274: 88 21 00 0d sub %g4, %o5, %g4
200e278: 89 29 20 02 sll %g4, 2, %g4
200e27c: 88 00 40 04 add %g1, %g4, %g4
200e280: de 01 20 04 ld [ %g4 + 4 ], %o7
200e284: 80 a3 e0 00 cmp %o7, 0
200e288: 02 80 00 16 be 200e2e0 <_RBTree_Extract_validate_unprotected+0x178><== NEVER TAKEN
200e28c: c0 20 a0 0c clr [ %g2 + 0xc ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200e290: 85 2b 60 02 sll %o5, 2, %g2
200e294: 96 03 c0 02 add %o7, %g2, %o3
200e298: d4 02 e0 04 ld [ %o3 + 4 ], %o2
200e29c: d4 21 20 04 st %o2, [ %g4 + 4 ]
if (c->child[dir])
200e2a0: c8 02 e0 04 ld [ %o3 + 4 ], %g4
200e2a4: 80 a1 20 00 cmp %g4, 0
200e2a8: 02 80 00 04 be 200e2b8 <_RBTree_Extract_validate_unprotected+0x150><== NEVER TAKEN
200e2ac: 84 03 c0 02 add %o7, %g2, %g2
c->child[dir]->parent = the_node;
200e2b0: c2 21 00 00 st %g1, [ %g4 ]
200e2b4: c6 00 40 00 ld [ %g1 ], %g3
c->child[dir] = the_node;
200e2b8: c2 20 a0 04 st %g1, [ %g2 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e2bc: c4 00 e0 04 ld [ %g3 + 4 ], %g2
c->parent = the_node->parent;
200e2c0: c6 23 c0 00 st %g3, [ %o7 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e2c4: 84 18 40 02 xor %g1, %g2, %g2
c->parent = the_node->parent;
the_node->parent = c;
200e2c8: de 20 40 00 st %o7, [ %g1 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e2cc: 80 a0 00 02 cmp %g0, %g2
200e2d0: 84 40 20 00 addx %g0, 0, %g2
200e2d4: 85 28 a0 02 sll %g2, 2, %g2
200e2d8: 86 00 c0 02 add %g3, %g2, %g3
200e2dc: de 20 e0 04 st %o7, [ %g3 + 4 ]
_RBTree_Rotate(parent, dir);
sibling = parent->child[!dir];
200e2e0: 80 a0 00 0d cmp %g0, %o5
200e2e4: 84 60 3f ff subx %g0, -1, %g2
200e2e8: 85 28 a0 02 sll %g2, 2, %g2
200e2ec: 84 00 40 02 add %g1, %g2, %g2
200e2f0: 10 bf ff b7 b 200e1cc <_RBTree_Extract_validate_unprotected+0x64>
200e2f4: c4 00 a0 04 ld [ %g2 + 4 ], %g2
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200e2f8: c2 06 00 00 ld [ %i0 ], %g1
200e2fc: c2 00 40 00 ld [ %g1 ], %g1
200e300: 80 a0 60 00 cmp %g1, 0
200e304: 22 80 00 02 be,a 200e30c <_RBTree_Extract_validate_unprotected+0x1a4>
200e308: c0 26 20 0c clr [ %i0 + 0xc ]
200e30c: 81 c7 e0 08 ret
200e310: 81 e8 00 00 restore
* 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];
200e314: 86 18 c0 18 xor %g3, %i0, %g3
200e318: 80 a0 00 03 cmp %g0, %g3
200e31c: 86 40 20 00 addx %g0, 0, %g3
if (!_RBTree_Is_red(sibling->child[!dir])) {
200e320: 80 a0 00 03 cmp %g0, %g3
200e324: 9e 60 3f ff subx %g0, -1, %o7
200e328: 9f 2b e0 02 sll %o7, 2, %o7
200e32c: 88 00 80 0f add %g2, %o7, %g4
200e330: 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);
200e334: 80 a1 20 00 cmp %g4, 0
200e338: 22 80 00 07 be,a 200e354 <_RBTree_Extract_validate_unprotected+0x1ec>
200e33c: 89 28 e0 02 sll %g3, 2, %g4
200e340: da 01 20 0c ld [ %g4 + 0xc ], %o5
200e344: 80 a3 60 01 cmp %o5, 1
200e348: 22 80 00 28 be,a 200e3e8 <_RBTree_Extract_validate_unprotected+0x280>
200e34c: de 00 60 0c ld [ %g1 + 0xc ], %o7
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
200e350: 89 28 e0 02 sll %g3, 2, %g4
200e354: 88 00 80 04 add %g2, %g4, %g4
200e358: d6 01 20 04 ld [ %g4 + 4 ], %o3
* and if so rotate in the proper direction and update sibling pointer.
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[!dir])) {
sibling->color = RBT_RED;
200e35c: 88 10 20 01 mov 1, %g4
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
200e360: 98 18 e0 01 xor %g3, 1, %o4
* and if so rotate in the proper direction and update sibling pointer.
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[!dir])) {
sibling->color = RBT_RED;
200e364: c8 20 a0 0c st %g4, [ %g2 + 0xc ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
200e368: 9a 21 00 0c sub %g4, %o4, %o5
200e36c: 9b 2b 60 02 sll %o5, 2, %o5
200e370: 9a 00 80 0d add %g2, %o5, %o5
200e374: c8 03 60 04 ld [ %o5 + 4 ], %g4
200e378: 80 a1 20 00 cmp %g4, 0
200e37c: 02 80 00 16 be 200e3d4 <_RBTree_Extract_validate_unprotected+0x26c><== NEVER TAKEN
200e380: c0 22 e0 0c clr [ %o3 + 0xc ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200e384: 99 2b 20 02 sll %o4, 2, %o4
200e388: 96 01 00 0c add %g4, %o4, %o3
200e38c: d4 02 e0 04 ld [ %o3 + 4 ], %o2
200e390: d4 23 60 04 st %o2, [ %o5 + 4 ]
if (c->child[dir])
200e394: da 02 e0 04 ld [ %o3 + 4 ], %o5
200e398: 80 a3 60 00 cmp %o5, 0
200e39c: 32 80 00 02 bne,a 200e3a4 <_RBTree_Extract_validate_unprotected+0x23c>
200e3a0: c4 23 40 00 st %g2, [ %o5 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e3a4: da 00 80 00 ld [ %g2 ], %o5
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200e3a8: 98 01 00 0c add %g4, %o4, %o4
200e3ac: c4 23 20 04 st %g2, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e3b0: d8 03 60 04 ld [ %o5 + 4 ], %o4
c->parent = the_node->parent;
200e3b4: da 21 00 00 st %o5, [ %g4 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e3b8: 98 18 80 0c xor %g2, %o4, %o4
c->parent = the_node->parent;
the_node->parent = c;
200e3bc: 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;
200e3c0: 80 a0 00 0c cmp %g0, %o4
200e3c4: 84 40 20 00 addx %g0, 0, %g2
200e3c8: 85 28 a0 02 sll %g2, 2, %g2
200e3cc: 9a 03 40 02 add %o5, %g2, %o5
200e3d0: c8 23 60 04 st %g4, [ %o5 + 4 ]
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
sibling = parent->child[!dir];
200e3d4: 84 00 40 0f add %g1, %o7, %g2
200e3d8: c4 00 a0 04 ld [ %g2 + 4 ], %g2
200e3dc: 9e 00 80 0f add %g2, %o7, %o7
200e3e0: c8 03 e0 04 ld [ %o7 + 4 ], %g4
}
sibling->color = parent->color;
200e3e4: de 00 60 0c ld [ %g1 + 0xc ], %o7
200e3e8: de 20 a0 0c st %o7, [ %g2 + 0xc ]
parent->color = RBT_BLACK;
200e3ec: c0 20 60 0c clr [ %g1 + 0xc ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
200e3f0: 9e 10 20 01 mov 1, %o7
200e3f4: 9e 23 c0 03 sub %o7, %g3, %o7
200e3f8: 9f 2b e0 02 sll %o7, 2, %o7
200e3fc: 9e 00 40 0f add %g1, %o7, %o7
200e400: c4 03 e0 04 ld [ %o7 + 4 ], %g2
200e404: 80 a0 a0 00 cmp %g2, 0
200e408: 02 bf ff bc be 200e2f8 <_RBTree_Extract_validate_unprotected+0x190><== NEVER TAKEN
200e40c: c0 21 20 0c clr [ %g4 + 0xc ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200e410: 87 28 e0 02 sll %g3, 2, %g3
200e414: 88 00 80 03 add %g2, %g3, %g4
200e418: da 01 20 04 ld [ %g4 + 4 ], %o5
200e41c: da 23 e0 04 st %o5, [ %o7 + 4 ]
if (c->child[dir])
200e420: c8 01 20 04 ld [ %g4 + 4 ], %g4
200e424: 80 a1 20 00 cmp %g4, 0
200e428: 32 80 00 02 bne,a 200e430 <_RBTree_Extract_validate_unprotected+0x2c8>
200e42c: c2 21 00 00 st %g1, [ %g4 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e430: c8 00 40 00 ld [ %g1 ], %g4
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200e434: 86 00 80 03 add %g2, %g3, %g3
200e438: c2 20 e0 04 st %g1, [ %g3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e43c: c6 01 20 04 ld [ %g4 + 4 ], %g3
c->parent = the_node->parent;
200e440: c8 20 80 00 st %g4, [ %g2 ]
the_node->parent = c;
200e444: 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;
200e448: 86 18 40 03 xor %g1, %g3, %g3
200e44c: 80 a0 00 03 cmp %g0, %g3
200e450: 82 40 20 00 addx %g0, 0, %g1
200e454: 83 28 60 02 sll %g1, 2, %g1
200e458: 88 01 00 01 add %g4, %g1, %g4
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200e45c: c2 06 00 00 ld [ %i0 ], %g1
200e460: c4 21 20 04 st %g2, [ %g4 + 4 ]
200e464: c2 00 40 00 ld [ %g1 ], %g1
200e468: 80 a0 60 00 cmp %g1, 0
200e46c: 22 bf ff a8 be,a 200e30c <_RBTree_Extract_validate_unprotected+0x1a4><== NEVER TAKEN
200e470: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED
200e474: 81 c7 e0 08 ret
200e478: 81 e8 00 00 restore
02009f5c <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
RBTree_Node *search_node
)
{
2009f5c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
2009f60: 7f ff e6 59 call 20038c4 <sparc_disable_interrupts>
2009f64: b8 10 00 18 mov %i0, %i4
2009f68: ba 10 00 08 mov %o0, %i5
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
RBTree_Node* iter_node = the_rbtree->root;
2009f6c: f6 06 20 04 ld [ %i0 + 4 ], %i3
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
2009f70: 80 a6 e0 00 cmp %i3, 0
2009f74: 02 80 00 15 be 2009fc8 <_RBTree_Find+0x6c> <== NEVER TAKEN
2009f78: b0 10 20 00 clr %i0
compare_result = the_rbtree->compare_function(the_node, iter_node);
2009f7c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
2009f80: 92 10 00 1b mov %i3, %o1
2009f84: 9f c0 40 00 call %g1
2009f88: 90 10 00 19 mov %i1, %o0
if (compare_result == 0) {
2009f8c: 80 a2 20 00 cmp %o0, 0
2009f90: 12 80 00 06 bne 2009fa8 <_RBTree_Find+0x4c>
2009f94: 82 1a 20 01 xor %o0, 1, %g1
found = iter_node;
if ( the_rbtree->is_unique )
2009f98: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2
2009f9c: 80 a0 a0 00 cmp %g2, 0
2009fa0: 12 80 00 0e bne 2009fd8 <_RBTree_Find+0x7c>
2009fa4: b0 10 00 1b mov %i3, %i0
break;
}
RBTree_Direction dir = (compare_result == 1);
2009fa8: 80 a0 00 01 cmp %g0, %g1
2009fac: 82 60 3f ff subx %g0, -1, %g1
iter_node = iter_node->child[dir];
2009fb0: 83 28 60 02 sll %g1, 2, %g1
2009fb4: b6 06 c0 01 add %i3, %g1, %i3
2009fb8: f6 06 e0 04 ld [ %i3 + 4 ], %i3
)
{
RBTree_Node* iter_node = the_rbtree->root;
RBTree_Node* found = NULL;
int compare_result;
while (iter_node) {
2009fbc: 80 a6 e0 00 cmp %i3, 0
2009fc0: 32 bf ff f0 bne,a 2009f80 <_RBTree_Find+0x24>
2009fc4: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
return_node = _RBTree_Find_unprotected( the_rbtree, search_node );
_ISR_Enable( level );
2009fc8: 7f ff e6 43 call 20038d4 <sparc_enable_interrupts>
2009fcc: 90 10 00 1d mov %i5, %o0
return return_node;
}
2009fd0: 81 c7 e0 08 ret
2009fd4: 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 );
2009fd8: 7f ff e6 3f call 20038d4 <sparc_enable_interrupts>
2009fdc: 90 10 00 1d mov %i5, %o0
return return_node;
}
2009fe0: 81 c7 e0 08 ret
2009fe4: 81 e8 00 00 restore
0200a2d0 <_RBTree_Initialize>:
void *starting_address,
size_t number_nodes,
size_t node_size,
bool is_unique
)
{
200a2d0: 9d e3 bf a0 save %sp, -96, %sp
size_t count;
RBTree_Node *next;
/* TODO: Error message? */
if (!the_rbtree) return;
200a2d4: 80 a6 20 00 cmp %i0, 0
200a2d8: 02 80 00 0f be 200a314 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200a2dc: 80 a6 e0 00 cmp %i3, 0
RBTree_Control *the_rbtree,
RBTree_Compare_function compare_function,
bool is_unique
)
{
the_rbtree->permanent_null = NULL;
200a2e0: c0 26 00 00 clr [ %i0 ]
the_rbtree->root = NULL;
200a2e4: c0 26 20 04 clr [ %i0 + 4 ]
the_rbtree->first[0] = NULL;
200a2e8: c0 26 20 08 clr [ %i0 + 8 ]
the_rbtree->first[1] = NULL;
200a2ec: c0 26 20 0c clr [ %i0 + 0xc ]
the_rbtree->compare_function = compare_function;
200a2f0: 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-- ) {
200a2f4: 02 80 00 08 be 200a314 <_RBTree_Initialize+0x44> <== NEVER TAKEN
200a2f8: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ]
_RBTree_Insert(the_rbtree, next);
200a2fc: 92 10 00 1a mov %i2, %o1
200a300: 7f ff ff ef call 200a2bc <_RBTree_Insert>
200a304: 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-- ) {
200a308: b6 86 ff ff addcc %i3, -1, %i3
200a30c: 12 bf ff fc bne 200a2fc <_RBTree_Initialize+0x2c>
200a310: b4 06 80 1c add %i2, %i4, %i2
200a314: 81 c7 e0 08 ret
200a318: 81 e8 00 00 restore
0200e69c <_RBTree_Validate_insert_unprotected>:
* append operation.
*/
void _RBTree_Validate_insert_unprotected(
RBTree_Node *the_node
)
{
200e69c: 9d e3 bf a0 save %sp, -96, %sp
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
RBTree_Direction pdir = the_node->parent != g->child[0];
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
200e6a0: 96 10 20 01 mov 1, %o3
ISR_Level level;
_ISR_Disable( level );
return _RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
200e6a4: c2 06 00 00 ld [ %i0 ], %g1
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
200e6a8: c4 00 40 00 ld [ %g1 ], %g2
200e6ac: 86 90 a0 00 orcc %g2, 0, %g3
200e6b0: 22 80 00 06 be,a 200e6c8 <_RBTree_Validate_insert_unprotected+0x2c>
200e6b4: c0 26 20 0c clr [ %i0 + 0xc ]
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200e6b8: c8 00 60 0c ld [ %g1 + 0xc ], %g4
200e6bc: 80 a1 20 01 cmp %g4, 1
200e6c0: 22 80 00 04 be,a 200e6d0 <_RBTree_Validate_insert_unprotected+0x34>
200e6c4: c8 00 80 00 ld [ %g2 ], %g4
200e6c8: 81 c7 e0 08 ret
200e6cc: 81 e8 00 00 restore
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(!(the_node->parent->parent->parent)) return NULL;
200e6d0: 80 a1 20 00 cmp %g4, 0
200e6d4: 02 80 00 0c be 200e704 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN
200e6d8: de 00 a0 04 ld [ %g2 + 4 ], %o7
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(the_node == the_node->parent->child[RBT_LEFT])
200e6dc: 80 a0 40 0f cmp %g1, %o7
200e6e0: 02 80 00 59 be 200e844 <_RBTree_Validate_insert_unprotected+0x1a8>
200e6e4: 88 10 00 0f mov %o7, %g4
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
200e6e8: 80 a1 20 00 cmp %g4, 0
200e6ec: 22 80 00 07 be,a 200e708 <_RBTree_Validate_insert_unprotected+0x6c>
200e6f0: c8 00 60 04 ld [ %g1 + 4 ], %g4
200e6f4: da 01 20 0c ld [ %g4 + 0xc ], %o5
200e6f8: 80 a3 60 01 cmp %o5, 1
200e6fc: 22 80 00 4c be,a 200e82c <_RBTree_Validate_insert_unprotected+0x190>
200e700: 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];
200e704: c8 00 60 04 ld [ %g1 + 4 ], %g4
RBTree_Direction pdir = the_node->parent != g->child[0];
200e708: 9e 18 40 0f xor %g1, %o7, %o7
the_node->parent->color = RBT_BLACK;
u->color = RBT_BLACK;
g->color = RBT_RED;
the_node = g;
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
200e70c: 88 19 00 18 xor %g4, %i0, %g4
200e710: 80 a0 00 04 cmp %g0, %g4
200e714: 9a 40 20 00 addx %g0, 0, %o5
RBTree_Direction pdir = the_node->parent != g->child[0];
200e718: 80 a0 00 0f cmp %g0, %o7
200e71c: 88 40 20 00 addx %g0, 0, %g4
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
200e720: 80 a3 40 04 cmp %o5, %g4
200e724: 02 80 00 46 be 200e83c <_RBTree_Validate_insert_unprotected+0x1a0>
200e728: 98 22 c0 0d sub %o3, %o5, %o4
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
200e72c: 98 22 c0 04 sub %o3, %g4, %o4
200e730: 9b 2b 20 02 sll %o4, 2, %o5
200e734: 9a 00 40 0d add %g1, %o5, %o5
200e738: de 03 60 04 ld [ %o5 + 4 ], %o7
200e73c: 80 a3 e0 00 cmp %o7, 0
200e740: 02 80 00 16 be 200e798 <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN
200e744: 89 29 20 02 sll %g4, 2, %g4
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200e748: 94 03 c0 04 add %o7, %g4, %o2
200e74c: d2 02 a0 04 ld [ %o2 + 4 ], %o1
200e750: d2 23 60 04 st %o1, [ %o5 + 4 ]
if (c->child[dir])
200e754: da 02 a0 04 ld [ %o2 + 4 ], %o5
200e758: 80 a3 60 00 cmp %o5, 0
200e75c: 22 80 00 05 be,a 200e770 <_RBTree_Validate_insert_unprotected+0xd4>
200e760: 9a 03 c0 04 add %o7, %g4, %o5
c->child[dir]->parent = the_node;
200e764: c2 23 40 00 st %g1, [ %o5 ]
200e768: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
200e76c: 9a 03 c0 04 add %o7, %g4, %o5
200e770: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e774: da 00 a0 04 ld [ %g2 + 4 ], %o5
c->parent = the_node->parent;
200e778: c4 23 c0 00 st %g2, [ %o7 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e77c: 9a 18 40 0d xor %g1, %o5, %o5
c->parent = the_node->parent;
the_node->parent = c;
200e780: de 20 40 00 st %o7, [ %g1 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e784: 80 a0 00 0d cmp %g0, %o5
200e788: 82 40 20 00 addx %g0, 0, %g1
200e78c: 83 28 60 02 sll %g1, 2, %g1
200e790: 84 00 80 01 add %g2, %g1, %g2
200e794: de 20 a0 04 st %o7, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
200e798: b0 06 00 04 add %i0, %g4, %i0
200e79c: f0 06 20 04 ld [ %i0 + 4 ], %i0
200e7a0: c2 06 00 00 ld [ %i0 ], %g1
}
the_node->parent->color = RBT_BLACK;
200e7a4: c0 20 60 0c clr [ %g1 + 0xc ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
200e7a8: 88 00 c0 04 add %g3, %g4, %g4
200e7ac: c2 01 20 04 ld [ %g4 + 4 ], %g1
200e7b0: 80 a0 60 00 cmp %g1, 0
200e7b4: 02 bf ff bc be 200e6a4 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN
200e7b8: d6 20 e0 0c st %o3, [ %g3 + 0xc ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200e7bc: 99 2b 20 02 sll %o4, 2, %o4
200e7c0: 84 00 40 0c add %g1, %o4, %g2
200e7c4: de 00 a0 04 ld [ %g2 + 4 ], %o7
200e7c8: de 21 20 04 st %o7, [ %g4 + 4 ]
if (c->child[dir])
200e7cc: c4 00 a0 04 ld [ %g2 + 4 ], %g2
200e7d0: 80 a0 a0 00 cmp %g2, 0
200e7d4: 32 80 00 02 bne,a 200e7dc <_RBTree_Validate_insert_unprotected+0x140>
200e7d8: c6 20 80 00 st %g3, [ %g2 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e7dc: c4 00 c0 00 ld [ %g3 ], %g2
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
200e7e0: 98 00 40 0c add %g1, %o4, %o4
200e7e4: c6 23 20 04 st %g3, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e7e8: c8 00 a0 04 ld [ %g2 + 4 ], %g4
c->parent = the_node->parent;
200e7ec: c4 20 40 00 st %g2, [ %g1 ]
the_node->parent = c;
200e7f0: c2 20 c0 00 st %g1, [ %g3 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
200e7f4: 88 19 00 03 xor %g4, %g3, %g4
200e7f8: 80 a0 00 04 cmp %g0, %g4
200e7fc: 86 40 20 00 addx %g0, 0, %g3
200e800: 87 28 e0 02 sll %g3, 2, %g3
200e804: 84 00 80 03 add %g2, %g3, %g2
200e808: c2 20 a0 04 st %g1, [ %g2 + 4 ]
ISR_Level level;
_ISR_Disable( level );
return _RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
200e80c: c2 06 00 00 ld [ %i0 ], %g1
*/
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent(
RBTree_Node *the_node
)
{
if (!the_node->parent->parent) return NULL;
200e810: c4 00 40 00 ld [ %g1 ], %g2
200e814: 86 90 a0 00 orcc %g2, 0, %g3
200e818: 32 bf ff a9 bne,a 200e6bc <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN
200e81c: c8 00 60 0c ld [ %g1 + 0xc ], %g4
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
200e820: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED
200e824: 81 c7 e0 08 ret <== NOT EXECUTED
200e828: 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;
200e82c: c0 21 20 0c clr [ %g4 + 0xc ]
g->color = RBT_RED;
200e830: da 20 a0 0c st %o5, [ %g2 + 0xc ]
200e834: 10 bf ff 9c b 200e6a4 <_RBTree_Validate_insert_unprotected+0x8>
200e838: b0 10 00 02 mov %g2, %i0
200e83c: 10 bf ff da b 200e7a4 <_RBTree_Validate_insert_unprotected+0x108>
200e840: 89 2b 60 02 sll %o5, 2, %g4
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
if(!(the_node->parent->parent)) return NULL;
if(the_node == the_node->parent->child[RBT_LEFT])
return the_node->parent->child[RBT_RIGHT];
200e844: 10 bf ff a9 b 200e6e8 <_RBTree_Validate_insert_unprotected+0x4c>
200e848: c8 00 a0 08 ld [ %g2 + 8 ], %g4
02006d28 <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
2006d28: 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;
2006d2c: 03 00 80 73 sethi %hi(0x201cc00), %g1
2006d30: 82 10 61 d4 or %g1, 0x1d4, %g1 ! 201cdd4 <Configuration_RTEMS_API>
2006d34: 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 )
2006d38: 80 a7 60 00 cmp %i5, 0
2006d3c: 02 80 00 18 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
2006d40: 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++ ) {
2006d44: 80 a6 e0 00 cmp %i3, 0
2006d48: 02 80 00 15 be 2006d9c <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
2006d4c: b8 10 20 00 clr %i4
return_value = rtems_task_create(
2006d50: d4 07 60 04 ld [ %i5 + 4 ], %o2
2006d54: d0 07 40 00 ld [ %i5 ], %o0
2006d58: d2 07 60 08 ld [ %i5 + 8 ], %o1
2006d5c: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
2006d60: d8 07 60 0c ld [ %i5 + 0xc ], %o4
2006d64: 7f ff ff 70 call 2006b24 <rtems_task_create>
2006d68: 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 ) )
2006d6c: 94 92 20 00 orcc %o0, 0, %o2
2006d70: 12 80 00 0d bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2006d74: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
2006d78: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
2006d7c: 40 00 00 0e call 2006db4 <rtems_task_start>
2006d80: 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 ) )
2006d84: 94 92 20 00 orcc %o0, 0, %o2
2006d88: 12 80 00 07 bne 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2006d8c: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
2006d90: 80 a7 00 1b cmp %i4, %i3
2006d94: 12 bf ff ef bne 2006d50 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
2006d98: ba 07 60 1c add %i5, 0x1c, %i5
2006d9c: 81 c7 e0 08 ret
2006da0: 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 );
2006da4: 90 10 20 01 mov 1, %o0
2006da8: 40 00 04 1b call 2007e14 <_Internal_error_Occurred>
2006dac: 92 10 20 01 mov 1, %o1
0200cf08 <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
200cf08: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200cf0c: 80 a0 60 00 cmp %g1, 0
200cf10: 22 80 00 0c be,a 200cf40 <_RTEMS_tasks_Switch_extension+0x38>
200cf14: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
tvp->tval = *tvp->ptr;
200cf18: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
200cf1c: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
200cf20: c8 00 80 00 ld [ %g2 ], %g4
200cf24: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
200cf28: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200cf2c: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
200cf30: 80 a0 60 00 cmp %g1, 0
200cf34: 32 bf ff fa bne,a 200cf1c <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
200cf38: 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;
200cf3c: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
while (tvp) {
200cf40: 80 a0 60 00 cmp %g1, 0
200cf44: 02 80 00 0b be 200cf70 <_RTEMS_tasks_Switch_extension+0x68>
200cf48: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
200cf4c: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
200cf50: 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;
200cf54: c8 00 80 00 ld [ %g2 ], %g4
200cf58: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
200cf5c: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200cf60: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
200cf64: 80 a0 60 00 cmp %g1, 0
200cf68: 32 bf ff fa bne,a 200cf50 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
200cf6c: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
200cf70: 81 c3 e0 08 retl
02007aec <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2007aec: 9d e3 bf 98 save %sp, -104, %sp
2007af0: 11 00 80 7e sethi %hi(0x201f800), %o0
2007af4: 92 10 00 18 mov %i0, %o1
2007af8: 90 12 20 44 or %o0, 0x44, %o0
2007afc: 40 00 08 53 call 2009c48 <_Objects_Get>
2007b00: 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 ) {
2007b04: c2 07 bf fc ld [ %fp + -4 ], %g1
2007b08: 80 a0 60 00 cmp %g1, 0
2007b0c: 12 80 00 17 bne 2007b68 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN
2007b10: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
2007b14: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
2007b18: 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);
2007b1c: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
2007b20: 80 88 80 01 btst %g2, %g1
2007b24: 22 80 00 08 be,a 2007b44 <_Rate_monotonic_Timeout+0x58>
2007b28: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007b2c: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
2007b30: c2 07 60 08 ld [ %i5 + 8 ], %g1
2007b34: 80 a0 80 01 cmp %g2, %g1
2007b38: 02 80 00 1a be 2007ba0 <_Rate_monotonic_Timeout+0xb4>
2007b3c: 13 04 00 ff sethi %hi(0x1003fc00), %o1
_Thread_Unblock( the_thread );
_Rate_monotonic_Initiate_statistics( the_period );
_Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length );
} else if ( the_period->state == RATE_MONOTONIC_OWNER_IS_BLOCKING ) {
2007b40: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007b44: 80 a0 60 01 cmp %g1, 1
2007b48: 02 80 00 0a be 2007b70 <_Rate_monotonic_Timeout+0x84>
2007b4c: 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;
2007b50: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2007b54: 03 00 80 7e sethi %hi(0x201f800), %g1
2007b58: c4 00 61 b0 ld [ %g1 + 0x1b0 ], %g2 ! 201f9b0 <_Thread_Dispatch_disable_level>
2007b5c: 84 00 bf ff add %g2, -1, %g2
2007b60: c4 20 61 b0 st %g2, [ %g1 + 0x1b0 ]
return _Thread_Dispatch_disable_level;
2007b64: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1
2007b68: 81 c7 e0 08 ret
2007b6c: 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;
2007b70: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
2007b74: 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;
2007b78: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
2007b7c: 7f ff fe 49 call 20074a0 <_Rate_monotonic_Initiate_statistics>
2007b80: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b84: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b88: 11 00 80 7e sethi %hi(0x201f800), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b8c: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b90: 90 12 22 6c or %o0, 0x26c, %o0
2007b94: 40 00 10 50 call 200bcd4 <_Watchdog_Insert>
2007b98: 92 07 60 10 add %i5, 0x10, %o1
2007b9c: 30 bf ff ee b,a 2007b54 <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007ba0: 40 00 0b 33 call 200a86c <_Thread_Clear_state>
2007ba4: 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 );
2007ba8: 10 bf ff f5 b 2007b7c <_Rate_monotonic_Timeout+0x90>
2007bac: 90 10 00 1d mov %i5, %o0
0200a644 <_Scheduler_CBS_Budget_callout>:
#include <rtems/rtems/signal.h>
void _Scheduler_CBS_Budget_callout(
Thread_Control *the_thread
)
{
200a644: 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;
200a648: d2 06 20 b0 ld [ %i0 + 0xb0 ], %o1
if ( the_thread->real_priority != new_priority )
200a64c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200a650: 80 a0 40 09 cmp %g1, %o1
200a654: 32 80 00 02 bne,a 200a65c <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN
200a658: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
200a65c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200a660: 80 a0 40 09 cmp %g1, %o1
200a664: 02 80 00 04 be 200a674 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN
200a668: 90 10 00 18 mov %i0, %o0
_Thread_Change_priority(the_thread, new_priority, true);
200a66c: 40 00 01 a0 call 200acec <_Thread_Change_priority>
200a670: 94 10 20 01 mov 1, %o2
/* Invoke callback function if any. */
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
200a674: f0 06 20 8c ld [ %i0 + 0x8c ], %i0
if ( sched_info->cbs_server->cbs_budget_overrun ) {
200a678: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200a67c: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200a680: 80 a0 a0 00 cmp %g2, 0
200a684: 02 80 00 09 be 200a6a8 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN
200a688: 01 00 00 00 nop
_Scheduler_CBS_Get_server_id(
200a68c: d0 00 40 00 ld [ %g1 ], %o0
200a690: 7f ff ff d1 call 200a5d4 <_Scheduler_CBS_Get_server_id>
200a694: 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 );
200a698: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200a69c: c2 00 60 0c ld [ %g1 + 0xc ], %g1
200a6a0: 9f c0 40 00 call %g1
200a6a4: d0 07 bf fc ld [ %fp + -4 ], %o0
200a6a8: 81 c7 e0 08 ret
200a6ac: 81 e8 00 00 restore
0200a1ac <_Scheduler_CBS_Cleanup>:
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Cleanup (void)
{
200a1ac: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a1b0: 39 00 80 81 sethi %hi(0x2020400), %i4
200a1b4: c2 07 21 d0 ld [ %i4 + 0x1d0 ], %g1 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
200a1b8: 80 a0 60 00 cmp %g1, 0
200a1bc: 02 80 00 18 be 200a21c <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN
200a1c0: 03 00 80 83 sethi %hi(0x2020c00), %g1
200a1c4: 37 00 80 83 sethi %hi(0x2020c00), %i3
200a1c8: c4 06 e3 54 ld [ %i3 + 0x354 ], %g2 ! 2020f54 <_Scheduler_CBS_Server_list>
200a1cc: ba 10 20 00 clr %i5
200a1d0: b8 17 21 d0 or %i4, 0x1d0, %i4
if ( _Scheduler_CBS_Server_list[ i ] )
200a1d4: 83 2f 60 02 sll %i5, 2, %g1
200a1d8: c2 00 80 01 ld [ %g2 + %g1 ], %g1
200a1dc: 80 a0 60 00 cmp %g1, 0
200a1e0: 02 80 00 05 be 200a1f4 <_Scheduler_CBS_Cleanup+0x48>
200a1e4: 90 10 00 1d mov %i5, %o0
_Scheduler_CBS_Destroy_server( i );
200a1e8: 40 00 00 45 call 200a2fc <_Scheduler_CBS_Destroy_server>
200a1ec: 01 00 00 00 nop
200a1f0: c4 06 e3 54 ld [ %i3 + 0x354 ], %g2
int _Scheduler_CBS_Cleanup (void)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a1f4: c2 07 00 00 ld [ %i4 ], %g1
200a1f8: ba 07 60 01 inc %i5
200a1fc: 80 a0 40 1d cmp %g1, %i5
200a200: 18 bf ff f6 bgu 200a1d8 <_Scheduler_CBS_Cleanup+0x2c>
200a204: 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;
}
200a208: 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 );
200a20c: 40 00 08 c1 call 200c510 <_Workspace_Free>
200a210: 90 10 00 02 mov %g2, %o0
return SCHEDULER_CBS_OK;
}
200a214: 81 c7 e0 08 ret
200a218: 81 e8 00 00 restore
int _Scheduler_CBS_Cleanup (void)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a21c: 10 bf ff fb b 200a208 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED
200a220: c4 00 63 54 ld [ %g1 + 0x354 ], %g2 <== NOT EXECUTED
0200a224 <_Scheduler_CBS_Create_server>:
int _Scheduler_CBS_Create_server (
Scheduler_CBS_Parameters *params,
Scheduler_CBS_Budget_overrun budget_overrun_callback,
rtems_id *server_id
)
{
200a224: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
Scheduler_CBS_Server *the_server;
if ( params->budget <= 0 ||
200a228: c2 06 20 04 ld [ %i0 + 4 ], %g1
int _Scheduler_CBS_Create_server (
Scheduler_CBS_Parameters *params,
Scheduler_CBS_Budget_overrun budget_overrun_callback,
rtems_id *server_id
)
{
200a22c: ba 10 00 18 mov %i0, %i5
unsigned int i;
Scheduler_CBS_Server *the_server;
if ( params->budget <= 0 ||
200a230: 80 a0 60 00 cmp %g1, 0
200a234: 04 80 00 30 ble 200a2f4 <_Scheduler_CBS_Create_server+0xd0>
200a238: b0 10 3f ee mov -18, %i0
200a23c: c2 07 40 00 ld [ %i5 ], %g1
200a240: 80 a0 60 00 cmp %g1, 0
200a244: 04 80 00 2c ble 200a2f4 <_Scheduler_CBS_Create_server+0xd0>
200a248: 03 00 80 81 sethi %hi(0x2020400), %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++ ) {
200a24c: c6 00 61 d0 ld [ %g1 + 0x1d0 ], %g3 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
200a250: 80 a0 e0 00 cmp %g3, 0
200a254: 02 80 00 28 be 200a2f4 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN
200a258: b0 10 3f e6 mov -26, %i0
if ( !_Scheduler_CBS_Server_list[i] )
200a25c: 37 00 80 83 sethi %hi(0x2020c00), %i3
200a260: f8 06 e3 54 ld [ %i3 + 0x354 ], %i4 ! 2020f54 <_Scheduler_CBS_Server_list>
200a264: c2 07 00 00 ld [ %i4 ], %g1
200a268: 80 a0 60 00 cmp %g1, 0
200a26c: 02 80 00 0e be 200a2a4 <_Scheduler_CBS_Create_server+0x80>
200a270: 82 10 20 00 clr %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++ ) {
200a274: 10 80 00 07 b 200a290 <_Scheduler_CBS_Create_server+0x6c>
200a278: 82 00 60 01 inc %g1
if ( !_Scheduler_CBS_Server_list[i] )
200a27c: c4 07 00 18 ld [ %i4 + %i0 ], %g2
200a280: 80 a0 a0 00 cmp %g2, 0
200a284: 22 80 00 0a be,a 200a2ac <_Scheduler_CBS_Create_server+0x88>
200a288: c2 26 80 00 st %g1, [ %i2 ]
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++ ) {
200a28c: 82 00 60 01 inc %g1
200a290: 80 a0 40 03 cmp %g1, %g3
200a294: 12 bf ff fa bne 200a27c <_Scheduler_CBS_Create_server+0x58>
200a298: b1 28 60 02 sll %g1, 2, %i0
if ( !_Scheduler_CBS_Server_list[i] )
break;
}
if ( i == _Scheduler_CBS_Maximum_servers )
return SCHEDULER_CBS_ERROR_FULL;
200a29c: 81 c7 e0 08 ret
200a2a0: 91 e8 3f e6 restore %g0, -26, %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] )
200a2a4: b0 10 20 00 clr %i0
}
if ( i == _Scheduler_CBS_Maximum_servers )
return SCHEDULER_CBS_ERROR_FULL;
*server_id = i;
200a2a8: c2 26 80 00 st %g1, [ %i2 ]
_Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *)
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
200a2ac: 40 00 08 91 call 200c4f0 <_Workspace_Allocate>
200a2b0: 90 10 20 10 mov 0x10, %o0
the_server = _Scheduler_CBS_Server_list[*server_id];
200a2b4: 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 *)
200a2b8: d0 27 00 18 st %o0, [ %i4 + %i0 ]
_Workspace_Allocate( sizeof(Scheduler_CBS_Server) );
the_server = _Scheduler_CBS_Server_list[*server_id];
200a2bc: c4 06 e3 54 ld [ %i3 + 0x354 ], %g2
200a2c0: 83 28 60 02 sll %g1, 2, %g1
200a2c4: c2 00 80 01 ld [ %g2 + %g1 ], %g1
if ( !the_server )
200a2c8: 80 a0 60 00 cmp %g1, 0
200a2cc: 02 80 00 0a be 200a2f4 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN
200a2d0: b0 10 3f ef mov -17, %i0
return SCHEDULER_CBS_ERROR_NO_MEMORY;
the_server->parameters = *params;
200a2d4: c4 07 40 00 ld [ %i5 ], %g2
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
return SCHEDULER_CBS_OK;
200a2d8: b0 10 20 00 clr %i0
_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;
200a2dc: c4 20 60 04 st %g2, [ %g1 + 4 ]
200a2e0: c4 07 60 04 ld [ %i5 + 4 ], %g2
the_server->task_id = -1;
the_server->cbs_budget_overrun = budget_overrun_callback;
200a2e4: f2 20 60 0c st %i1, [ %g1 + 0xc ]
_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;
200a2e8: c4 20 60 08 st %g2, [ %g1 + 8 ]
the_server->task_id = -1;
200a2ec: 84 10 3f ff mov -1, %g2
200a2f0: c4 20 40 00 st %g2, [ %g1 ]
the_server->cbs_budget_overrun = budget_overrun_callback;
return SCHEDULER_CBS_OK;
}
200a2f4: 81 c7 e0 08 ret
200a2f8: 81 e8 00 00 restore
0200a36c <_Scheduler_CBS_Detach_thread>:
int _Scheduler_CBS_Detach_thread (
Scheduler_CBS_Server_id server_id,
rtems_id task_id
)
{
200a36c: 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);
200a370: 92 07 bf fc add %fp, -4, %o1
200a374: 40 00 03 ab call 200b220 <_Thread_Get>
200a378: 90 10 00 19 mov %i1, %o0
/* The routine _Thread_Get may disable dispatch and not enable again. */
if ( the_thread ) {
200a37c: b8 92 20 00 orcc %o0, 0, %i4
200a380: 22 80 00 06 be,a 200a398 <_Scheduler_CBS_Detach_thread+0x2c>
200a384: 03 00 80 81 sethi %hi(0x2020400), %g1
_Thread_Enable_dispatch();
200a388: 40 00 03 99 call 200b1ec <_Thread_Enable_dispatch>
200a38c: 01 00 00 00 nop
sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info;
200a390: fa 07 20 8c ld [ %i4 + 0x8c ], %i5
}
if ( server_id < 0 || server_id >= _Scheduler_CBS_Maximum_servers )
200a394: 03 00 80 81 sethi %hi(0x2020400), %g1
200a398: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
200a39c: 80 a0 80 18 cmp %g2, %i0
200a3a0: 08 80 00 1a bleu 200a408 <_Scheduler_CBS_Detach_thread+0x9c>
200a3a4: 82 10 3f ee mov -18, %g1
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
if ( !the_thread )
200a3a8: 80 a7 20 00 cmp %i4, 0
200a3ac: 02 80 00 17 be 200a408 <_Scheduler_CBS_Detach_thread+0x9c>
200a3b0: 01 00 00 00 nop
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
/* Server is not valid. */
if ( !_Scheduler_CBS_Server_list[server_id] )
200a3b4: 03 00 80 83 sethi %hi(0x2020c00), %g1
200a3b8: c2 00 63 54 ld [ %g1 + 0x354 ], %g1 ! 2020f54 <_Scheduler_CBS_Server_list>
200a3bc: b1 2e 20 02 sll %i0, 2, %i0
200a3c0: c4 00 40 18 ld [ %g1 + %i0 ], %g2
200a3c4: 80 a0 a0 00 cmp %g2, 0
200a3c8: 02 80 00 10 be 200a408 <_Scheduler_CBS_Detach_thread+0x9c>
200a3cc: 82 10 3f e7 mov -25, %g1
return SCHEDULER_CBS_ERROR_NOSERVER;
/* Thread and server are not attached. */
if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id )
200a3d0: c6 00 80 00 ld [ %g2 ], %g3
200a3d4: 80 a0 c0 19 cmp %g3, %i1
200a3d8: 12 80 00 0c bne 200a408 <_Scheduler_CBS_Detach_thread+0x9c><== NEVER TAKEN
200a3dc: 82 10 3f ee mov -18, %g1
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
200a3e0: 82 10 3f ff mov -1, %g1
sched_info->cbs_server = NULL;
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200a3e4: c6 07 20 a4 ld [ %i4 + 0xa4 ], %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;
200a3e8: c2 20 80 00 st %g1, [ %g2 ]
sched_info->cbs_server = NULL;
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;
200a3ec: c2 0f 20 a0 ldub [ %i4 + 0xa0 ], %g1
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
sched_info->cbs_server = NULL;
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
the_thread->budget_callout = the_thread->Start.budget_callout;
200a3f0: c4 07 20 a8 ld [ %i4 + 0xa8 ], %g2
/* 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;
sched_info->cbs_server = NULL;
200a3f4: c0 27 60 18 clr [ %i5 + 0x18 ]
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;
200a3f8: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ]
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
_Scheduler_CBS_Server_list[server_id]->task_id = -1;
sched_info->cbs_server = NULL;
the_thread->budget_algorithm = the_thread->Start.budget_algorithm;
200a3fc: c6 27 20 7c st %g3, [ %i4 + 0x7c ]
the_thread->budget_callout = the_thread->Start.budget_callout;
200a400: c4 27 20 80 st %g2, [ %i4 + 0x80 ]
the_thread->is_preemptible = the_thread->Start.is_preemptible;
return SCHEDULER_CBS_OK;
200a404: 82 10 20 00 clr %g1
}
200a408: 81 c7 e0 08 ret
200a40c: 91 e8 00 01 restore %g0, %g1, %o0
0200a454 <_Scheduler_CBS_Get_execution_time>:
int _Scheduler_CBS_Get_execution_time (
Scheduler_CBS_Server_id server_id,
time_t *exec_time,
time_t *abs_time
)
{
200a454: 9d e3 bf 98 save %sp, -104, %sp
Objects_Locations location;
Thread_Control *the_thread;
if ( server_id < 0 || server_id >= _Scheduler_CBS_Maximum_servers )
200a458: 03 00 80 81 sethi %hi(0x2020400), %g1
200a45c: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
int _Scheduler_CBS_Get_execution_time (
Scheduler_CBS_Server_id server_id,
time_t *exec_time,
time_t *abs_time
)
{
200a460: ba 10 00 18 mov %i0, %i5
Objects_Locations location;
Thread_Control *the_thread;
if ( server_id < 0 || server_id >= _Scheduler_CBS_Maximum_servers )
200a464: 80 a0 40 1d cmp %g1, %i5
200a468: 08 80 00 0e bleu 200a4a0 <_Scheduler_CBS_Get_execution_time+0x4c>
200a46c: b0 10 3f ee mov -18, %i0
return SCHEDULER_CBS_ERROR_INVALID_PARAMETER;
if ( !_Scheduler_CBS_Server_list[server_id] )
200a470: 39 00 80 83 sethi %hi(0x2020c00), %i4
200a474: c2 07 23 54 ld [ %i4 + 0x354 ], %g1 ! 2020f54 <_Scheduler_CBS_Server_list>
200a478: bb 2f 60 02 sll %i5, 2, %i5
200a47c: c2 00 40 1d ld [ %g1 + %i5 ], %g1
200a480: 80 a0 60 00 cmp %g1, 0
200a484: 02 80 00 07 be 200a4a0 <_Scheduler_CBS_Get_execution_time+0x4c>
200a488: b0 10 3f e7 mov -25, %i0
return SCHEDULER_CBS_ERROR_NOSERVER;
if ( !_Scheduler_CBS_Server_list[server_id]->task_id ) {
200a48c: d0 00 40 00 ld [ %g1 ], %o0
200a490: 80 a2 20 00 cmp %o0, 0
200a494: 12 80 00 0a bne 200a4bc <_Scheduler_CBS_Get_execution_time+0x68><== ALWAYS TAKEN
200a498: b0 10 20 00 clr %i0
*exec_time = 0;
200a49c: c0 26 40 00 clr [ %i1 ] <== NOT EXECUTED
return SCHEDULER_CBS_OK;
200a4a0: 81 c7 e0 08 ret
200a4a4: 81 e8 00 00 restore
_Thread_Enable_dispatch();
*exec_time = _Scheduler_CBS_Server_list[server_id]->parameters.budget -
the_thread->cpu_time_budget;
}
else {
*exec_time = _Scheduler_CBS_Server_list[server_id]->parameters.budget;
200a4a8: c2 00 40 1d ld [ %g1 + %i5 ], %g1
200a4ac: c2 00 60 08 ld [ %g1 + 8 ], %g1
200a4b0: c2 26 40 00 st %g1, [ %i1 ]
}
return SCHEDULER_CBS_OK;
}
200a4b4: 81 c7 e0 08 ret
200a4b8: 91 e8 20 00 restore %g0, 0, %o0
if ( !_Scheduler_CBS_Server_list[server_id]->task_id ) {
*exec_time = 0;
return SCHEDULER_CBS_OK;
}
the_thread = _Thread_Get(
200a4bc: 40 00 03 59 call 200b220 <_Thread_Get>
200a4c0: 92 07 bf fc add %fp, -4, %o1
_Scheduler_CBS_Server_list[server_id]->task_id,
&location
);
/* The routine _Thread_Get may disable dispatch and not enable again. */
if ( the_thread ) {
200a4c4: b6 92 20 00 orcc %o0, 0, %i3
200a4c8: 02 bf ff f8 be 200a4a8 <_Scheduler_CBS_Get_execution_time+0x54>
200a4cc: c2 07 23 54 ld [ %i4 + 0x354 ], %g1
_Thread_Enable_dispatch();
200a4d0: 40 00 03 47 call 200b1ec <_Thread_Enable_dispatch>
200a4d4: b0 10 20 00 clr %i0
*exec_time = _Scheduler_CBS_Server_list[server_id]->parameters.budget -
200a4d8: c4 07 23 54 ld [ %i4 + 0x354 ], %g2
200a4dc: c2 06 e0 78 ld [ %i3 + 0x78 ], %g1
200a4e0: c4 00 80 1d ld [ %g2 + %i5 ], %g2
200a4e4: c4 00 a0 08 ld [ %g2 + 8 ], %g2
200a4e8: 82 20 80 01 sub %g2, %g1, %g1
200a4ec: c2 26 40 00 st %g1, [ %i1 ]
200a4f0: 81 c7 e0 08 ret
200a4f4: 81 e8 00 00 restore
0200a5d4 <_Scheduler_CBS_Get_server_id>:
int _Scheduler_CBS_Get_server_id (
rtems_id task_id,
Scheduler_CBS_Server_id *server_id
)
{
200a5d4: 9d e3 bf a0 save %sp, -96, %sp
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a5d8: 03 00 80 81 sethi %hi(0x2020400), %g1
200a5dc: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
int _Scheduler_CBS_Get_server_id (
rtems_id task_id,
Scheduler_CBS_Server_id *server_id
)
{
200a5e0: 84 10 00 18 mov %i0, %g2
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a5e4: 80 a0 60 00 cmp %g1, 0
200a5e8: 02 80 00 13 be 200a634 <_Scheduler_CBS_Get_server_id+0x60><== NEVER TAKEN
200a5ec: b0 10 3f e7 mov -25, %i0
200a5f0: 07 00 80 83 sethi %hi(0x2020c00), %g3
200a5f4: de 00 e3 54 ld [ %g3 + 0x354 ], %o7 ! 2020f54 <_Scheduler_CBS_Server_list>
200a5f8: 86 10 20 00 clr %g3
#include <rtems/system.h>
#include <rtems/config.h>
#include <rtems/score/scheduler.h>
#include <rtems/score/schedulercbs.h>
int _Scheduler_CBS_Get_server_id (
200a5fc: 89 28 e0 02 sll %g3, 2, %g4
Scheduler_CBS_Server_id *server_id
)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
if ( _Scheduler_CBS_Server_list[i] &&
200a600: c8 03 c0 04 ld [ %o7 + %g4 ], %g4
200a604: 80 a1 20 00 cmp %g4, 0
200a608: 22 80 00 07 be,a 200a624 <_Scheduler_CBS_Get_server_id+0x50>
200a60c: 86 00 e0 01 inc %g3
200a610: c8 01 00 00 ld [ %g4 ], %g4
200a614: 80 a1 00 02 cmp %g4, %g2
200a618: 22 80 00 09 be,a 200a63c <_Scheduler_CBS_Get_server_id+0x68>
200a61c: c6 26 40 00 st %g3, [ %i1 ]
rtems_id task_id,
Scheduler_CBS_Server_id *server_id
)
{
unsigned int i;
for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) {
200a620: 86 00 e0 01 inc %g3
200a624: 80 a0 c0 01 cmp %g3, %g1
200a628: 12 bf ff f6 bne 200a600 <_Scheduler_CBS_Get_server_id+0x2c>
200a62c: 89 28 e0 02 sll %g3, 2, %g4
_Scheduler_CBS_Server_list[i]->task_id == task_id ) {
*server_id = i;
return SCHEDULER_CBS_OK;
}
}
return SCHEDULER_CBS_ERROR_NOSERVER;
200a630: b0 10 3f e7 mov -25, %i0
}
200a634: 81 c7 e0 08 ret
200a638: 81 e8 00 00 restore
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;
200a63c: 81 c7 e0 08 ret
200a640: 91 e8 20 00 restore %g0, 0, %o0
0200a6b0 <_Scheduler_CBS_Initialize>:
}
}
int _Scheduler_CBS_Initialize(void)
{
200a6b0: 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*) );
200a6b4: 3b 00 80 81 sethi %hi(0x2020400), %i5
200a6b8: d0 07 61 d0 ld [ %i5 + 0x1d0 ], %o0 ! 20205d0 <_Scheduler_CBS_Maximum_servers>
if ( !_Scheduler_CBS_Server_list )
return SCHEDULER_CBS_ERROR_NO_MEMORY;
200a6bc: b0 10 3f ef mov -17, %i0
}
int _Scheduler_CBS_Initialize(void)
{
unsigned int i;
_Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate(
200a6c0: 40 00 07 8c call 200c4f0 <_Workspace_Allocate>
200a6c4: 91 2a 20 02 sll %o0, 2, %o0
200a6c8: 09 00 80 83 sethi %hi(0x2020c00), %g4
_Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) );
if ( !_Scheduler_CBS_Server_list )
200a6cc: 80 a2 20 00 cmp %o0, 0
200a6d0: 02 80 00 0f be 200a70c <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN
200a6d4: d0 21 23 54 st %o0, [ %g4 + 0x354 ]
return SCHEDULER_CBS_ERROR_NO_MEMORY;
for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) {
200a6d8: c6 07 61 d0 ld [ %i5 + 0x1d0 ], %g3
200a6dc: 80 a0 e0 00 cmp %g3, 0
200a6e0: 02 80 00 0b be 200a70c <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN
200a6e4: b0 10 20 00 clr %i0
200a6e8: 10 80 00 03 b 200a6f4 <_Scheduler_CBS_Initialize+0x44>
200a6ec: 82 10 20 00 clr %g1
200a6f0: d0 01 23 54 ld [ %g4 + 0x354 ], %o0
_Scheduler_CBS_Server_list[i] = NULL;
200a6f4: 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++) {
200a6f8: 82 00 60 01 inc %g1
200a6fc: 80 a0 40 03 cmp %g1, %g3
200a700: 12 bf ff fc bne 200a6f0 <_Scheduler_CBS_Initialize+0x40>
200a704: c0 22 00 02 clr [ %o0 + %g2 ]
_Scheduler_CBS_Server_list[i] = NULL;
}
return SCHEDULER_CBS_OK;
200a708: b0 10 20 00 clr %i0
}
200a70c: 81 c7 e0 08 ret
200a710: 81 e8 00 00 restore
02009188 <_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;
2009188: c2 02 20 8c ld [ %o0 + 0x8c ], %g1
if (deadline) {
200918c: 80 a2 60 00 cmp %o1, 0
2009190: 02 80 00 11 be 20091d4 <_Scheduler_CBS_Release_job+0x4c>
2009194: c2 00 60 18 ld [ %g1 + 0x18 ], %g1
/* Initializing or shifting deadline. */
if (serv_info)
2009198: 80 a0 60 00 cmp %g1, 0
200919c: 02 80 00 13 be 20091e8 <_Scheduler_CBS_Release_job+0x60>
20091a0: 07 00 80 7d sethi %hi(0x201f400), %g3
new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline)
20091a4: c4 00 60 04 ld [ %g1 + 4 ], %g2
20091a8: d2 00 e2 9c ld [ %g3 + 0x29c ], %o1
20091ac: 92 02 40 02 add %o1, %g2, %o1
20091b0: 05 20 00 00 sethi %hi(0x80000000), %g2
20091b4: 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;
20091b8: c2 00 60 08 ld [ %g1 + 8 ], %g1
20091bc: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
the_thread->real_priority = new_priority;
20091c0: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
_Thread_Change_priority(the_thread, new_priority, true);
20091c4: 94 10 20 01 mov 1, %o2
20091c8: 82 13 c0 00 mov %o7, %g1
20091cc: 40 00 01 4c call 20096fc <_Thread_Change_priority>
20091d0: 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)
20091d4: 80 a0 60 00 cmp %g1, 0
20091d8: 12 bf ff f8 bne 20091b8 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN
20091dc: d2 02 20 b0 ld [ %o0 + 0xb0 ], %o1
the_thread->cpu_time_budget = serv_info->parameters.budget;
the_thread->real_priority = new_priority;
20091e0: 10 bf ff f9 b 20091c4 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED
20091e4: 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)
20091e8: 03 00 80 7d sethi %hi(0x201f400), %g1
20091ec: c2 00 62 9c ld [ %g1 + 0x29c ], %g1 ! 201f69c <_Watchdog_Ticks_since_boot>
20091f0: 92 02 40 01 add %o1, %g1, %o1
20091f4: 03 20 00 00 sethi %hi(0x80000000), %g1
20091f8: 10 bf ff f2 b 20091c0 <_Scheduler_CBS_Release_job+0x38>
20091fc: 92 2a 40 01 andn %o1, %g1, %o1
02009200 <_Scheduler_CBS_Unblock>:
#include <rtems/score/schedulercbs.h>
void _Scheduler_CBS_Unblock(
Thread_Control *the_thread
)
{
2009200: 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);
2009204: 40 00 00 5b call 2009370 <_Scheduler_EDF_Enqueue>
2009208: 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;
200920c: c2 06 20 8c ld [ %i0 + 0x8c ], %g1
2009210: 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) {
2009214: 80 a7 60 00 cmp %i5, 0
2009218: 02 80 00 19 be 200927c <_Scheduler_CBS_Unblock+0x7c>
200921c: 03 00 80 7d sethi %hi(0x201f400), %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 ) {
2009220: 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 -
2009224: d0 00 62 9c ld [ %g1 + 0x29c ], %o0
2009228: f8 06 20 18 ld [ %i0 + 0x18 ], %i4
_Watchdog_Ticks_since_boot;
if ( deadline*budget_left > budget*deadline_left ) {
200922c: 40 00 43 77 call 201a008 <.umul>
2009230: 90 27 00 08 sub %i4, %o0, %o0
2009234: d2 06 20 78 ld [ %i0 + 0x78 ], %o1
2009238: b6 10 00 08 mov %o0, %i3
200923c: 40 00 43 73 call 201a008 <.umul>
2009240: d0 07 60 08 ld [ %i5 + 8 ], %o0
2009244: 80 a6 c0 08 cmp %i3, %o0
2009248: 24 80 00 0e ble,a 2009280 <_Scheduler_CBS_Unblock+0x80>
200924c: 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;
2009250: d2 06 20 b0 ld [ %i0 + 0xb0 ], %o1
if ( the_thread->real_priority != new_priority )
2009254: 80 a7 00 09 cmp %i4, %o1
2009258: 32 80 00 02 bne,a 2009260 <_Scheduler_CBS_Unblock+0x60>
200925c: d2 26 20 18 st %o1, [ %i0 + 0x18 ]
the_thread->real_priority = new_priority;
if ( the_thread->current_priority != new_priority )
2009260: d0 06 20 14 ld [ %i0 + 0x14 ], %o0
2009264: 80 a2 00 09 cmp %o0, %o1
2009268: 02 80 00 07 be 2009284 <_Scheduler_CBS_Unblock+0x84>
200926c: 3b 00 80 7e sethi %hi(0x201f800), %i5
_Thread_Change_priority(the_thread, new_priority, true);
2009270: 90 10 00 18 mov %i0, %o0
2009274: 40 00 01 22 call 20096fc <_Thread_Change_priority>
2009278: 94 10 20 01 mov 1, %o2
200927c: 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,
2009280: 3b 00 80 7e sethi %hi(0x201f800), %i5
2009284: ba 17 62 d0 or %i5, 0x2d0, %i5 ! 201fad0 <_Per_CPU_Information>
2009288: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
200928c: d2 00 60 14 ld [ %g1 + 0x14 ], %o1
2009290: 03 00 80 7a sethi %hi(0x201e800), %g1
2009294: c2 00 60 c4 ld [ %g1 + 0xc4 ], %g1 ! 201e8c4 <_Scheduler+0x30>
2009298: 9f c0 40 00 call %g1
200929c: 01 00 00 00 nop
20092a0: 80 a2 20 00 cmp %o0, 0
20092a4: 04 80 00 0a ble 20092cc <_Scheduler_CBS_Unblock+0xcc>
20092a8: 01 00 00 00 nop
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
if ( _Thread_Executing->is_preemptible ||
20092ac: c2 07 60 0c ld [ %i5 + 0xc ], %g1
* Even if the thread isn't preemptible, if the new heir is
* a pseudo-ISR system task, we need to do a context switch.
*/
if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority,
_Thread_Heir->current_priority)) {
_Thread_Heir = the_thread;
20092b0: f0 27 60 10 st %i0, [ %i5 + 0x10 ]
if ( _Thread_Executing->is_preemptible ||
20092b4: c2 08 60 74 ldub [ %g1 + 0x74 ], %g1
20092b8: 80 a0 60 00 cmp %g1, 0
20092bc: 22 80 00 06 be,a 20092d4 <_Scheduler_CBS_Unblock+0xd4> <== NEVER TAKEN
20092c0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 <== NOT EXECUTED
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
20092c4: 82 10 20 01 mov 1, %g1
20092c8: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ]
20092cc: 81 c7 e0 08 ret
20092d0: 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 ||
20092d4: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED
20092d8: 12 bf ff fd bne 20092cc <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED
20092dc: 82 10 20 01 mov 1, %g1 <== NOT EXECUTED
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
20092e0: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED
20092e4: 30 bf ff fa b,a 20092cc <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED
020092e8 <_Scheduler_EDF_Allocate>:
#include <rtems/score/wkspace.h>
void *_Scheduler_EDF_Allocate(
Thread_Control *the_thread
)
{
20092e8: 9d e3 bf a0 save %sp, -96, %sp
void *sched;
Scheduler_EDF_Per_thread *schinfo;
sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) );
20092ec: 40 00 07 10 call 200af2c <_Workspace_Allocate>
20092f0: 90 10 20 18 mov 0x18, %o0
if ( sched ) {
20092f4: 80 a2 20 00 cmp %o0, 0
20092f8: 02 80 00 05 be 200930c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN
20092fc: 82 10 20 02 mov 2, %g1
the_thread->scheduler_info = sched;
2009300: d0 26 20 8c st %o0, [ %i0 + 0x8c ]
schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info);
schinfo->thread = the_thread;
2009304: f0 22 00 00 st %i0, [ %o0 ]
schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN;
2009308: c2 22 20 14 st %g1, [ %o0 + 0x14 ]
}
return sched;
}
200930c: 81 c7 e0 08 ret
2009310: 91 e8 00 08 restore %g0, %o0, %o0
0200931c <_Scheduler_EDF_Release_job>:
uint32_t deadline
)
{
Priority_Control new_priority;
if (deadline) {
200931c: 80 a2 60 00 cmp %o1, 0
2009320: 12 80 00 07 bne 200933c <_Scheduler_EDF_Release_job+0x20> <== ALWAYS TAKEN
2009324: 94 10 20 01 mov 1, %o2
new_priority = (_Watchdog_Ticks_since_boot + deadline)
& ~SCHEDULER_EDF_PRIO_MSB;
}
else {
/* Switch back to background priority. */
new_priority = the_thread->Start.initial_priority;
2009328: d2 02 20 b0 ld [ %o0 + 0xb0 ], %o1 <== NOT EXECUTED
}
the_thread->real_priority = new_priority;
200932c: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED
_Thread_Change_priority(the_thread, new_priority, true);
2009330: 82 13 c0 00 mov %o7, %g1 <== NOT EXECUTED
2009334: 40 00 00 ca call 200965c <_Thread_Change_priority> <== NOT EXECUTED
2009338: 9e 10 40 00 mov %g1, %o7 <== NOT EXECUTED
{
Priority_Control new_priority;
if (deadline) {
/* Initializing or shifting deadline. */
new_priority = (_Watchdog_Ticks_since_boot + deadline)
200933c: 03 00 80 7d sethi %hi(0x201f400), %g1
2009340: c2 00 61 ec ld [ %g1 + 0x1ec ], %g1 ! 201f5ec <_Watchdog_Ticks_since_boot>
/* Switch back to background priority. */
new_priority = the_thread->Start.initial_priority;
}
the_thread->real_priority = new_priority;
_Thread_Change_priority(the_thread, new_priority, true);
2009344: 94 10 20 01 mov 1, %o2
{
Priority_Control new_priority;
if (deadline) {
/* Initializing or shifting deadline. */
new_priority = (_Watchdog_Ticks_since_boot + deadline)
2009348: 92 02 40 01 add %o1, %g1, %o1
200934c: 03 20 00 00 sethi %hi(0x80000000), %g1
2009350: 92 2a 40 01 andn %o1, %g1, %o1
else {
/* Switch back to background priority. */
new_priority = the_thread->Start.initial_priority;
}
the_thread->real_priority = new_priority;
2009354: d2 22 20 18 st %o1, [ %o0 + 0x18 ]
_Thread_Change_priority(the_thread, new_priority, true);
2009358: 82 13 c0 00 mov %o7, %g1
200935c: 40 00 00 c0 call 200965c <_Thread_Change_priority>
2009360: 9e 10 40 00 mov %g1, %o7
0200938c <_Scheduler_EDF_Unblock>:
#include <rtems/score/scheduleredf.h>
void _Scheduler_EDF_Unblock(
Thread_Control *the_thread
)
{
200938c: 9d e3 bf a0 save %sp, -96, %sp
_Scheduler_EDF_Enqueue(the_thread);
2009390: 7f ff ff a0 call 2009210 <_Scheduler_EDF_Enqueue>
2009394: 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(
2009398: 3b 00 80 7e sethi %hi(0x201f800), %i5
200939c: ba 17 62 20 or %i5, 0x220, %i5 ! 201fa20 <_Per_CPU_Information>
20093a0: c2 07 60 10 ld [ %i5 + 0x10 ], %g1
20093a4: d0 00 60 14 ld [ %g1 + 0x14 ], %o0
20093a8: 03 00 80 7a sethi %hi(0x201e800), %g1
20093ac: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 ! 201e824 <_Scheduler+0x30>
20093b0: 9f c0 40 00 call %g1
20093b4: d2 06 20 14 ld [ %i0 + 0x14 ], %o1
20093b8: 80 a2 20 00 cmp %o0, 0
20093bc: 26 80 00 04 bl,a 20093cc <_Scheduler_EDF_Unblock+0x40>
20093c0: c2 07 60 0c ld [ %i5 + 0xc ], %g1
20093c4: 81 c7 e0 08 ret
20093c8: 81 e8 00 00 restore
_Thread_Heir->current_priority,
the_thread->current_priority )) {
_Thread_Heir = the_thread;
20093cc: f0 27 60 10 st %i0, [ %i5 + 0x10 ]
if ( _Thread_Executing->is_preemptible ||
20093d0: c2 08 60 74 ldub [ %g1 + 0x74 ], %g1
20093d4: 80 a0 60 00 cmp %g1, 0
20093d8: 22 80 00 06 be,a 20093f0 <_Scheduler_EDF_Unblock+0x64>
20093dc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
20093e0: 82 10 20 01 mov 1, %g1
20093e4: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ]
20093e8: 81 c7 e0 08 ret
20093ec: 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 ||
20093f0: 80 a0 60 00 cmp %g1, 0
20093f4: 12 bf ff f4 bne 20093c4 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN
20093f8: 82 10 20 01 mov 1, %g1
the_thread->current_priority == 0 )
_Thread_Dispatch_necessary = true;
20093fc: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED
2009400: 30 bf ff fa b,a 20093e8 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED
02008c14 <_Scheduler_priority_Tick>:
#include <rtems/system.h>
#include <rtems/score/schedulerpriority.h>
void _Scheduler_priority_Tick( void )
{
2008c14: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *executing;
executing = _Thread_Executing;
2008c18: 03 00 80 78 sethi %hi(0x201e000), %g1
2008c1c: d0 00 60 4c ld [ %g1 + 0x4c ], %o0 ! 201e04c <_Per_CPU_Information+0xc>
/*
* If the thread is not preemptible or is not ready, then
* just return.
*/
if ( !executing->is_preemptible )
2008c20: c2 0a 20 74 ldub [ %o0 + 0x74 ], %g1
2008c24: 80 a0 60 00 cmp %g1, 0
2008c28: 02 80 00 26 be 2008cc0 <_Scheduler_priority_Tick+0xac>
2008c2c: 01 00 00 00 nop
return;
if ( !_States_Is_ready( executing->current_state ) )
2008c30: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
2008c34: 80 a0 60 00 cmp %g1, 0
2008c38: 12 80 00 22 bne 2008cc0 <_Scheduler_priority_Tick+0xac>
2008c3c: 01 00 00 00 nop
/*
* The cpu budget algorithm determines what happens next.
*/
switch ( executing->budget_algorithm ) {
2008c40: c2 02 20 7c ld [ %o0 + 0x7c ], %g1
2008c44: 80 a0 60 01 cmp %g1, 1
2008c48: 0a 80 00 07 bcs 2008c64 <_Scheduler_priority_Tick+0x50>
2008c4c: 80 a0 60 02 cmp %g1, 2
2008c50: 28 80 00 10 bleu,a 2008c90 <_Scheduler_priority_Tick+0x7c>
2008c54: c2 02 20 78 ld [ %o0 + 0x78 ], %g1
2008c58: 80 a0 60 03 cmp %g1, 3
2008c5c: 22 80 00 04 be,a 2008c6c <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN
2008c60: c2 02 20 78 ld [ %o0 + 0x78 ], %g1
2008c64: 81 c7 e0 08 ret
2008c68: 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 )
2008c6c: 82 00 7f ff add %g1, -1, %g1
2008c70: 80 a0 60 00 cmp %g1, 0
2008c74: 12 bf ff fc bne 2008c64 <_Scheduler_priority_Tick+0x50>
2008c78: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
(*executing->budget_callout)( executing );
2008c7c: c2 02 20 80 ld [ %o0 + 0x80 ], %g1
2008c80: 9f c0 40 00 call %g1
2008c84: 01 00 00 00 nop
2008c88: 81 c7 e0 08 ret
2008c8c: 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 ) {
2008c90: 82 00 7f ff add %g1, -1, %g1
2008c94: 80 a0 60 00 cmp %g1, 0
2008c98: 14 bf ff f3 bg 2008c64 <_Scheduler_priority_Tick+0x50>
2008c9c: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
* always operates on the scheduler that 'owns' the currently executing
* thread.
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void )
{
_Scheduler.Operations.yield();
2008ca0: 03 00 80 73 sethi %hi(0x201cc00), %g1
2008ca4: c2 00 62 80 ld [ %g1 + 0x280 ], %g1 ! 201ce80 <_Scheduler+0xc>
2008ca8: 9f c0 40 00 call %g1
2008cac: 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;
2008cb0: 03 00 80 76 sethi %hi(0x201d800), %g1
2008cb4: d0 07 bf fc ld [ %fp + -4 ], %o0
2008cb8: c2 00 62 64 ld [ %g1 + 0x264 ], %g1
2008cbc: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
2008cc0: 81 c7 e0 08 ret
2008cc4: 81 e8 00 00 restore
02009384 <_Scheduler_simple_Ready_queue_enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
2009384: 03 00 80 77 sethi %hi(0x201dc00), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009388: c2 00 61 54 ld [ %g1 + 0x154 ], %g1 ! 201dd54 <_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 ) {
200938c: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
2009390: c2 00 40 00 ld [ %g1 ], %g1
2009394: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
2009398: 80 a0 80 03 cmp %g2, %g3
200939c: 3a 80 00 08 bcc,a 20093bc <_Scheduler_simple_Ready_queue_enqueue_first+0x38>
20093a0: 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 ) {
20093a4: 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 ) {
20093a8: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
20093ac: 80 a0 80 03 cmp %g2, %g3
20093b0: 2a bf ff fe bcs,a 20093a8 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN
20093b4: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
current = (Thread_Control *)current->Object.Node.previous;
20093b8: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
20093bc: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
20093c0: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
20093c4: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
20093c8: c4 22 00 00 st %g2, [ %o0 ]
}
}
/* enqueue */
_Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node );
}
20093cc: 81 c3 e0 08 retl
20093d0: d0 20 a0 04 st %o0, [ %g2 + 4 ]
020074ec <_TOD_Validate>:
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
20074ec: 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();
20074f0: 03 00 80 7d sethi %hi(0x201f400), %g1
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
return false;
20074f4: ba 10 20 00 clr %i5
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
20074f8: 80 a6 20 00 cmp %i0, 0
20074fc: 02 80 00 2c be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN
2007500: d2 00 60 b8 ld [ %g1 + 0xb8 ], %o1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
2007504: 11 00 03 d0 sethi %hi(0xf4000), %o0
2007508: 40 00 4c ff call 201a904 <.udiv>
200750c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
2007510: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2007514: 80 a2 00 01 cmp %o0, %g1
2007518: 28 80 00 26 bleu,a 20075b0 <_TOD_Validate+0xc4>
200751c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
2007520: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
2007524: 80 a0 60 3b cmp %g1, 0x3b
2007528: 38 80 00 22 bgu,a 20075b0 <_TOD_Validate+0xc4>
200752c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
2007530: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
2007534: 80 a0 60 3b cmp %g1, 0x3b
2007538: 38 80 00 1e bgu,a 20075b0 <_TOD_Validate+0xc4>
200753c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
2007540: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2007544: 80 a0 60 17 cmp %g1, 0x17
2007548: 38 80 00 1a bgu,a 20075b0 <_TOD_Validate+0xc4>
200754c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
2007550: c2 06 20 04 ld [ %i0 + 4 ], %g1
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
2007554: 80 a0 60 00 cmp %g1, 0
2007558: 02 80 00 15 be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN
200755c: 80 a0 60 0c cmp %g1, 0xc
(the_tod->month == 0) ||
2007560: 38 80 00 14 bgu,a 20075b0 <_TOD_Validate+0xc4>
2007564: b0 0f 60 01 and %i5, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2007568: c4 06 00 00 ld [ %i0 ], %g2
(the_tod->ticks >= ticks_per_second) ||
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
200756c: 80 a0 a7 c3 cmp %g2, 0x7c3
2007570: 28 80 00 10 bleu,a 20075b0 <_TOD_Validate+0xc4>
2007574: b0 0f 60 01 and %i5, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2007578: c6 06 20 08 ld [ %i0 + 8 ], %g3
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
200757c: 80 a0 e0 00 cmp %g3, 0
2007580: 02 80 00 0b be 20075ac <_TOD_Validate+0xc0> <== NEVER TAKEN
2007584: 80 88 a0 03 btst 3, %g2
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
2007588: 32 80 00 0c bne,a 20075b8 <_TOD_Validate+0xcc>
200758c: 83 28 60 02 sll %g1, 2, %g1
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
2007590: 82 00 60 0d add %g1, 0xd, %g1
2007594: 05 00 80 78 sethi %hi(0x201e000), %g2
2007598: 83 28 60 02 sll %g1, 2, %g1
200759c: 84 10 a0 08 or %g2, 8, %g2
20075a0: c2 00 80 01 ld [ %g2 + %g1 ], %g1
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
20075a4: 80 a0 40 03 cmp %g1, %g3
20075a8: ba 60 3f ff subx %g0, -1, %i5
if ( the_tod->day > days_in_month )
return false;
return true;
}
20075ac: b0 0f 60 01 and %i5, 1, %i0
20075b0: 81 c7 e0 08 ret
20075b4: 81 e8 00 00 restore
return false;
if ( (the_tod->year % 4) == 0 )
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
else
days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ];
20075b8: 05 00 80 78 sethi %hi(0x201e000), %g2
20075bc: 84 10 a0 08 or %g2, 8, %g2 ! 201e008 <_TOD_Days_per_month>
20075c0: c2 00 80 01 ld [ %g2 + %g1 ], %g1
* false - if the the_tod is invalid
*
* NOTE: This routine only works for leap-years through 2099.
*/
bool _TOD_Validate(
20075c4: 80 a0 40 03 cmp %g1, %g3
20075c8: 10 bf ff f9 b 20075ac <_TOD_Validate+0xc0>
20075cc: ba 60 3f ff subx %g0, -1, %i5
02008eec <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
2008eec: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
2008ef0: f8 06 20 10 ld [ %i0 + 0x10 ], %i4
/*
* Set a transient state for the thread so it is pulled off the Ready chains.
* This will prevent it from being scheduled no matter what happens in an
* ISR.
*/
_Thread_Set_transient( the_thread );
2008ef4: 40 00 03 ac call 2009da4 <_Thread_Set_transient>
2008ef8: 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 )
2008efc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
2008f00: 80 a0 40 19 cmp %g1, %i1
2008f04: 02 80 00 05 be 2008f18 <_Thread_Change_priority+0x2c>
2008f08: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
2008f0c: 90 10 00 18 mov %i0, %o0
2008f10: 40 00 03 8b call 2009d3c <_Thread_Set_priority>
2008f14: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
2008f18: 7f ff e4 b3 call 20021e4 <sparc_disable_interrupts>
2008f1c: 01 00 00 00 nop
2008f20: 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;
2008f24: f6 07 60 10 ld [ %i5 + 0x10 ], %i3
if ( state != STATES_TRANSIENT ) {
2008f28: 80 a6 e0 04 cmp %i3, 4
2008f2c: 02 80 00 18 be 2008f8c <_Thread_Change_priority+0xa0>
2008f30: 80 8f 20 04 btst 4, %i4
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
2008f34: 02 80 00 0b be 2008f60 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
2008f38: 82 0e ff fb and %i3, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
2008f3c: 7f ff e4 ae call 20021f4 <sparc_enable_interrupts> <== NOT EXECUTED
2008f40: 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);
2008f44: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
2008f48: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
2008f4c: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED
2008f50: 32 80 00 0d bne,a 2008f84 <_Thread_Change_priority+0x98> <== NOT EXECUTED
2008f54: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
2008f58: 81 c7 e0 08 ret
2008f5c: 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 );
2008f60: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
2008f64: 7f ff e4 a4 call 20021f4 <sparc_enable_interrupts>
2008f68: 90 10 00 19 mov %i1, %o0
2008f6c: 03 00 00 ef sethi %hi(0x3bc00), %g1
2008f70: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
2008f74: 80 8e c0 01 btst %i3, %g1
2008f78: 02 bf ff f8 be 2008f58 <_Thread_Change_priority+0x6c>
2008f7c: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
2008f80: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
2008f84: 40 00 03 3d call 2009c78 <_Thread_queue_Requeue>
2008f88: 93 e8 00 1d restore %g0, %i5, %o1
2008f8c: 39 00 80 73 sethi %hi(0x201cc00), %i4
}
return;
}
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) ) {
2008f90: 12 80 00 08 bne 2008fb0 <_Thread_Change_priority+0xc4> <== NEVER TAKEN
2008f94: b8 17 22 74 or %i4, 0x274, %i4 ! 201ce74 <_Scheduler>
* the TRANSIENT state. So we have to place it on the appropriate
* Ready Queue with interrupts off.
*/
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
if ( prepend_it )
2008f98: 80 a6 a0 00 cmp %i2, 0
2008f9c: 02 80 00 1b be 2009008 <_Thread_Change_priority+0x11c>
2008fa0: c0 27 60 10 clr [ %i5 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
2008fa4: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
2008fa8: 9f c0 40 00 call %g1
2008fac: 90 10 00 1d mov %i5, %o0
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
2008fb0: 7f ff e4 91 call 20021f4 <sparc_enable_interrupts>
2008fb4: 90 10 00 19 mov %i1, %o0
2008fb8: 7f ff e4 8b call 20021e4 <sparc_disable_interrupts>
2008fbc: 01 00 00 00 nop
2008fc0: 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();
2008fc4: c2 07 20 08 ld [ %i4 + 8 ], %g1
2008fc8: 9f c0 40 00 call %g1
2008fcc: 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 );
2008fd0: 03 00 80 78 sethi %hi(0x201e000), %g1
2008fd4: 82 10 60 40 or %g1, 0x40, %g1 ! 201e040 <_Per_CPU_Information>
2008fd8: c4 00 60 0c ld [ %g1 + 0xc ], %g2
* We altered the set of thread priorities. So let's figure out
* who is the heir and if we need to switch to them.
*/
_Scheduler_Schedule();
if ( !_Thread_Is_executing_also_the_heir() &&
2008fdc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
2008fe0: 80 a0 80 03 cmp %g2, %g3
2008fe4: 02 80 00 07 be 2009000 <_Thread_Change_priority+0x114>
2008fe8: 01 00 00 00 nop
2008fec: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
2008ff0: 80 a0 a0 00 cmp %g2, 0
2008ff4: 02 80 00 03 be 2009000 <_Thread_Change_priority+0x114>
2008ff8: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
2008ffc: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
_ISR_Enable( level );
2009000: 7f ff e4 7d call 20021f4 <sparc_enable_interrupts>
2009004: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
2009008: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
200900c: 9f c0 40 00 call %g1
2009010: 90 10 00 1d mov %i5, %o0
2009014: 30 bf ff e7 b,a 2008fb0 <_Thread_Change_priority+0xc4>
02009230 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
2009230: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2009234: 90 10 00 18 mov %i0, %o0
2009238: 40 00 00 7a call 2009420 <_Thread_Get>
200923c: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009240: c2 07 bf fc ld [ %fp + -4 ], %g1
2009244: 80 a0 60 00 cmp %g1, 0
2009248: 12 80 00 09 bne 200926c <_Thread_Delay_ended+0x3c> <== NEVER TAKEN
200924c: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
2009250: 7f ff ff 72 call 2009018 <_Thread_Clear_state>
2009254: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 <RAM_END+0xdc00018>
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2009258: 03 00 80 76 sethi %hi(0x201d800), %g1
200925c: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 201db00 <_Thread_Dispatch_disable_level>
2009260: 84 00 bf ff add %g2, -1, %g2
2009264: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
2009268: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
200926c: 81 c7 e0 08 ret
2009270: 81 e8 00 00 restore
02009274 <_Thread_Dispatch>:
* INTERRUPT LATENCY:
* dispatch thread
* no dispatch thread
*/
void _Thread_Dispatch( void )
{
2009274: 9d e3 bf 90 save %sp, -112, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2009278: 21 00 80 76 sethi %hi(0x201d800), %l0
200927c: c2 04 23 00 ld [ %l0 + 0x300 ], %g1 ! 201db00 <_Thread_Dispatch_disable_level>
2009280: 82 00 60 01 inc %g1
2009284: c2 24 23 00 st %g1, [ %l0 + 0x300 ]
return _Thread_Dispatch_disable_level;
2009288: c2 04 23 00 ld [ %l0 + 0x300 ], %g1
#endif
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
200928c: 39 00 80 78 sethi %hi(0x201e000), %i4
2009290: b8 17 20 40 or %i4, 0x40, %i4 ! 201e040 <_Per_CPU_Information>
_ISR_Disable( level );
2009294: 7f ff e3 d4 call 20021e4 <sparc_disable_interrupts>
2009298: fa 07 20 0c ld [ %i4 + 0xc ], %i5
while ( _Thread_Dispatch_necessary == true ) {
200929c: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1
20092a0: 80 a0 60 00 cmp %g1, 0
20092a4: 02 80 00 48 be 20093c4 <_Thread_Dispatch+0x150>
20092a8: 01 00 00 00 nop
heir = _Thread_Heir;
20092ac: f6 07 20 10 ld [ %i4 + 0x10 ], %i3
_Thread_Dispatch_necessary = false;
20092b0: c0 2f 20 18 clrb [ %i4 + 0x18 ]
/*
* When the heir and executing are the same, then we are being
* requested to do the post switch dispatching. This is normally
* done to dispatch signals.
*/
if ( heir == executing )
20092b4: 80 a7 40 1b cmp %i5, %i3
20092b8: 02 80 00 43 be 20093c4 <_Thread_Dispatch+0x150>
20092bc: f6 27 20 0c st %i3, [ %i4 + 0xc ]
20092c0: 31 00 80 76 sethi %hi(0x201d800), %i0
#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;
20092c4: 23 00 80 76 sethi %hi(0x201d800), %l1
20092c8: b0 16 23 88 or %i0, 0x388, %i0
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
20092cc: b2 07 20 1c add %i4, 0x1c, %i1
#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 );
20092d0: 10 80 00 37 b 20093ac <_Thread_Dispatch+0x138>
20092d4: 35 00 80 76 sethi %hi(0x201d800), %i2
rtems_ada_self = heir->rtems_ada_self;
#endif
if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE )
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
_ISR_Enable( level );
20092d8: 7f ff e3 c7 call 20021f4 <sparc_enable_interrupts>
20092dc: 01 00 00 00 nop
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
20092e0: 40 00 10 4b call 200d40c <_TOD_Get_uptime>
20092e4: 90 07 bf f0 add %fp, -16, %o0
_Timestamp_Subtract(
20092e8: 90 10 00 19 mov %i1, %o0
20092ec: 92 07 bf f0 add %fp, -16, %o1
20092f0: 40 00 03 28 call 2009f90 <_Timespec_Subtract>
20092f4: 94 07 bf f8 add %fp, -8, %o2
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
20092f8: 90 07 60 84 add %i5, 0x84, %o0
20092fc: 40 00 03 0c call 2009f2c <_Timespec_Add_to>
2009300: 92 07 bf f8 add %fp, -8, %o1
_Thread_Time_of_last_context_switch = uptime;
2009304: c4 07 bf f0 ld [ %fp + -16 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
2009308: c2 06 00 00 ld [ %i0 ], %g1
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
_Thread_Time_of_last_context_switch = uptime;
200930c: c4 27 20 1c st %g2, [ %i4 + 0x1c ]
2009310: c4 07 bf f4 ld [ %fp + -12 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
2009314: 80 a0 60 00 cmp %g1, 0
2009318: 02 80 00 06 be 2009330 <_Thread_Dispatch+0xbc> <== NEVER TAKEN
200931c: c4 27 20 20 st %g2, [ %i4 + 0x20 ]
executing->libc_reent = *_Thread_libc_reent;
2009320: c4 00 40 00 ld [ %g1 ], %g2
2009324: c4 27 61 54 st %g2, [ %i5 + 0x154 ]
*_Thread_libc_reent = heir->libc_reent;
2009328: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2
200932c: c4 20 40 00 st %g2, [ %g1 ]
}
_User_extensions_Thread_switch( executing, heir );
2009330: 90 10 00 1d mov %i5, %o0
2009334: 40 00 03 db call 200a2a0 <_User_extensions_Thread_switch>
2009338: 92 10 00 1b mov %i3, %o1
if ( executing->fp_context != NULL )
_Context_Save_fp( &executing->fp_context );
#endif
#endif
_Context_Switch( &executing->Registers, &heir->Registers );
200933c: 90 07 60 c8 add %i5, 0xc8, %o0
2009340: 40 00 05 1f call 200a7bc <_CPU_Context_switch>
2009344: 92 06 e0 c8 add %i3, 0xc8, %o1
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
2009348: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
200934c: 80 a0 60 00 cmp %g1, 0
2009350: 02 80 00 0c be 2009380 <_Thread_Dispatch+0x10c>
2009354: d0 06 a3 84 ld [ %i2 + 0x384 ], %o0
2009358: 80 a7 40 08 cmp %i5, %o0
200935c: 02 80 00 09 be 2009380 <_Thread_Dispatch+0x10c>
2009360: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
2009364: 02 80 00 04 be 2009374 <_Thread_Dispatch+0x100>
2009368: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200936c: 40 00 04 da call 200a6d4 <_CPU_Context_save_fp>
2009370: 90 02 21 50 add %o0, 0x150, %o0
_Context_Restore_fp( &executing->fp_context );
2009374: 40 00 04 f5 call 200a748 <_CPU_Context_restore_fp>
2009378: 90 07 61 50 add %i5, 0x150, %o0
_Thread_Allocated_fp = executing;
200937c: fa 26 a3 84 st %i5, [ %i2 + 0x384 ]
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
2009380: 7f ff e3 99 call 20021e4 <sparc_disable_interrupts>
2009384: fa 07 20 0c ld [ %i4 + 0xc ], %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 ) {
2009388: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1
200938c: 80 a0 60 00 cmp %g1, 0
2009390: 02 80 00 0d be 20093c4 <_Thread_Dispatch+0x150>
2009394: 01 00 00 00 nop
heir = _Thread_Heir;
2009398: f6 07 20 10 ld [ %i4 + 0x10 ], %i3
_Thread_Dispatch_necessary = false;
200939c: c0 2f 20 18 clrb [ %i4 + 0x18 ]
/*
* When the heir and executing are the same, then we are being
* requested to do the post switch dispatching. This is normally
* done to dispatch signals.
*/
if ( heir == executing )
20093a0: 80 a6 c0 1d cmp %i3, %i5
20093a4: 02 80 00 08 be 20093c4 <_Thread_Dispatch+0x150> <== NEVER TAKEN
20093a8: f6 27 20 0c st %i3, [ %i4 + 0xc ]
*/
#if __RTEMS_ADA__
executing->rtems_ada_self = rtems_ada_self;
rtems_ada_self = heir->rtems_ada_self;
#endif
if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE )
20093ac: c2 06 e0 7c ld [ %i3 + 0x7c ], %g1
20093b0: 80 a0 60 01 cmp %g1, 1
20093b4: 12 bf ff c9 bne 20092d8 <_Thread_Dispatch+0x64>
20093b8: c2 04 62 64 ld [ %l1 + 0x264 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
20093bc: 10 bf ff c7 b 20092d8 <_Thread_Dispatch+0x64>
20093c0: c2 26 e0 78 st %g1, [ %i3 + 0x78 ]
_ISR_Disable( level );
}
post_switch:
_ISR_Enable( level );
20093c4: 7f ff e3 8c call 20021f4 <sparc_enable_interrupts>
20093c8: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
20093cc: c2 04 23 00 ld [ %l0 + 0x300 ], %g1
20093d0: 82 00 7f ff add %g1, -1, %g1
20093d4: c2 24 23 00 st %g1, [ %l0 + 0x300 ]
return _Thread_Dispatch_disable_level;
20093d8: c2 04 23 00 ld [ %l0 + 0x300 ], %g1
_Thread_Unnest_dispatch();
_API_extensions_Run_postswitch();
20093dc: 7f ff f7 c1 call 20072e0 <_API_extensions_Run_postswitch>
20093e0: 01 00 00 00 nop
}
20093e4: 81 c7 e0 08 ret
20093e8: 81 e8 00 00 restore
0200f864 <_Thread_Handler>:
* Input parameters: NONE
*
* Output parameters: NONE
*/
void _Thread_Handler( void )
{
200f864: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static bool doneConstructors;
bool doCons;
#endif
executing = _Thread_Executing;
200f868: 03 00 80 78 sethi %hi(0x201e000), %g1
200f86c: fa 00 60 4c ld [ %g1 + 0x4c ], %i5 ! 201e04c <_Per_CPU_Information+0xc>
/*
* Some CPUs need to tinker with the call frame or registers when the
* thread actually begins to execute for the first time. This is a
* hook point where the port gets a shot at doing whatever it requires.
*/
_Context_Initialization_at_thread_begin();
200f870: 3f 00 80 3e sethi %hi(0x200f800), %i7
200f874: be 17 e0 64 or %i7, 0x64, %i7 ! 200f864 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
200f878: d0 07 60 ac ld [ %i5 + 0xac ], %o0
_ISR_Set_level(level);
200f87c: 7f ff ca 5e call 20021f4 <sparc_enable_interrupts>
200f880: 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) &&
200f884: 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;
200f888: 03 00 80 75 sethi %hi(0x201d400), %g1
doneConstructors = true;
200f88c: 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;
200f890: f6 08 63 bc ldub [ %g1 + 0x3bc ], %i3
#endif
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200f894: 80 a0 a0 00 cmp %g2, 0
200f898: 02 80 00 0c be 200f8c8 <_Thread_Handler+0x64>
200f89c: c6 28 63 bc stb %g3, [ %g1 + 0x3bc ]
#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 );
200f8a0: 39 00 80 76 sethi %hi(0x201d800), %i4
200f8a4: d0 07 23 84 ld [ %i4 + 0x384 ], %o0 ! 201db84 <_Thread_Allocated_fp>
200f8a8: 80 a7 40 08 cmp %i5, %o0
200f8ac: 02 80 00 07 be 200f8c8 <_Thread_Handler+0x64>
200f8b0: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200f8b4: 22 80 00 05 be,a 200f8c8 <_Thread_Handler+0x64>
200f8b8: fa 27 23 84 st %i5, [ %i4 + 0x384 ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200f8bc: 7f ff eb 86 call 200a6d4 <_CPU_Context_save_fp>
200f8c0: 90 02 21 50 add %o0, 0x150, %o0
_Thread_Allocated_fp = executing;
200f8c4: fa 27 23 84 st %i5, [ %i4 + 0x384 ]
/*
* Take care that 'begin' extensions get to complete before
* 'switch' extensions can run. This means must keep dispatch
* disabled until all 'begin' extensions complete.
*/
_User_extensions_Thread_begin( executing );
200f8c8: 7f ff e9 f4 call 200a098 <_User_extensions_Thread_begin>
200f8cc: 90 10 00 1d mov %i5, %o0
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
200f8d0: 7f ff e6 c7 call 20093ec <_Thread_Enable_dispatch>
200f8d4: 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) */ {
200f8d8: 80 8e e0 ff btst 0xff, %i3
200f8dc: 02 80 00 0e be 200f914 <_Thread_Handler+0xb0>
200f8e0: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f8e4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
200f8e8: 80 a0 60 00 cmp %g1, 0
200f8ec: 02 80 00 0e be 200f924 <_Thread_Handler+0xc0>
200f8f0: 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 ) {
200f8f4: 22 80 00 11 be,a 200f938 <_Thread_Handler+0xd4> <== ALWAYS TAKEN
200f8f8: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
* was placed in return_argument. This assumed that if it returned
* anything (which is not supporting in all APIs), then it would be
* able to fit in a (void *).
*/
_User_extensions_Thread_exitted( executing );
200f8fc: 7f ff e9 fb call 200a0e8 <_User_extensions_Thread_exitted>
200f900: 90 10 00 1d mov %i5, %o0
_Internal_error_Occurred(
200f904: 90 10 20 00 clr %o0
200f908: 92 10 20 01 mov 1, %o1
200f90c: 7f ff e1 42 call 2007e14 <_Internal_error_Occurred>
200f910: 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 ();
200f914: 40 00 35 0f call 201cd50 <_init>
200f918: 01 00 00 00 nop
_Thread_Enable_dispatch();
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f91c: 10 bf ff f3 b 200f8e8 <_Thread_Handler+0x84>
200f920: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
200f924: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
200f928: 9f c0 40 00 call %g1
200f92c: d0 07 60 9c ld [ %i5 + 0x9c ], %o0
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
200f930: 10 bf ff f3 b 200f8fc <_Thread_Handler+0x98>
200f934: 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)(
200f938: 9f c0 40 00 call %g1
200f93c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0
executing->Start.numeric_argument
);
}
#if defined(RTEMS_POSIX_API)
else if ( executing->Start.prototype == THREAD_START_POINTER ) {
executing->Wait.return_argument =
200f940: 10 bf ff ef b 200f8fc <_Thread_Handler+0x98>
200f944: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
020094d0 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
20094d0: 9d e3 bf a0 save %sp, -96, %sp
20094d4: 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;
20094d8: c0 26 61 58 clr [ %i1 + 0x158 ]
20094dc: c0 26 61 5c clr [ %i1 + 0x15c ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
20094e0: 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
)
{
20094e4: e0 07 a0 60 ld [ %fp + 0x60 ], %l0
20094e8: e4 00 40 00 ld [ %g1 ], %l2
if ( !actual_stack_size || actual_stack_size < stack_size )
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
#else
if ( !stack_area ) {
20094ec: 80 a6 a0 00 cmp %i2, 0
20094f0: 02 80 00 6b be 200969c <_Thread_Initialize+0x1cc>
20094f4: e2 0f a0 5f ldub [ %fp + 0x5f ], %l1
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;
20094f8: c0 2e 60 b4 clrb [ %i1 + 0xb4 ]
20094fc: 90 10 00 1b mov %i3, %o0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
2009500: f4 26 60 bc st %i2, [ %i1 + 0xbc ]
the_stack->size = size;
2009504: d0 26 60 b8 st %o0, [ %i1 + 0xb8 ]
/*
* Allocate the floating point area for this thread
*/
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
if ( is_fp ) {
2009508: 80 a7 20 00 cmp %i4, 0
200950c: 12 80 00 48 bne 200962c <_Thread_Initialize+0x15c>
2009510: b6 10 20 00 clr %i3
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2009514: 39 00 80 76 sethi %hi(0x201d800), %i4
2009518: c2 07 23 94 ld [ %i4 + 0x394 ], %g1 ! 201db94 <_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;
200951c: f6 26 61 50 st %i3, [ %i1 + 0x150 ]
the_thread->Start.fp_context = fp_area;
2009520: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2009524: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
2009528: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
200952c: c0 26 60 68 clr [ %i1 + 0x68 ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
2009530: 80 a0 60 00 cmp %g1, 0
2009534: 12 80 00 46 bne 200964c <_Thread_Initialize+0x17c>
2009538: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200953c: 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;
2009540: 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;
2009544: c2 07 a0 64 ld [ %fp + 0x64 ], %g1
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
2009548: e2 2e 60 a0 stb %l1, [ %i1 + 0xa0 ]
the_thread->Start.budget_algorithm = budget_algorithm;
200954c: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ]
the_thread->Start.budget_callout = budget_callout;
switch ( budget_algorithm ) {
2009550: 80 a4 20 02 cmp %l0, 2
2009554: 12 80 00 05 bne 2009568 <_Thread_Initialize+0x98>
2009558: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ]
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;
200955c: 03 00 80 76 sethi %hi(0x201d800), %g1
2009560: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 ! 201da64 <_Thread_Ticks_per_timeslice>
2009564: c2 26 60 78 st %g1, [ %i1 + 0x78 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2009568: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
200956c: 03 00 80 73 sethi %hi(0x201cc00), %g1
2009570: c2 00 62 8c ld [ %g1 + 0x28c ], %g1 ! 201ce8c <_Scheduler+0x18>
2009574: c4 26 60 ac st %g2, [ %i1 + 0xac ]
the_thread->current_state = STATES_DORMANT;
2009578: 84 10 20 01 mov 1, %g2
the_thread->Wait.queue = NULL;
200957c: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
2009580: c4 26 60 10 st %g2, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
2009584: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
2009588: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
200958c: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ]
2009590: 9f c0 40 00 call %g1
2009594: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
2009598: b8 92 20 00 orcc %o0, 0, %i4
200959c: 22 80 00 13 be,a 20095e8 <_Thread_Initialize+0x118>
20095a0: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
20095a4: 90 10 00 19 mov %i1, %o0
20095a8: 40 00 01 e5 call 2009d3c <_Thread_Set_priority>
20095ac: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20095b0: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
20095b4: c2 16 60 0a lduh [ %i1 + 0xa ], %g1
/*
* Initialize the CPU usage statistics
*/
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
_Timestamp_Set_to_zero( &the_thread->cpu_time_used );
20095b8: c0 26 60 84 clr [ %i1 + 0x84 ]
20095bc: c0 26 60 88 clr [ %i1 + 0x88 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20095c0: 83 28 60 02 sll %g1, 2, %g1
20095c4: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
20095c8: e4 26 60 0c st %l2, [ %i1 + 0xc ]
* enabled when we get here. We want to be able to run the
* user extensions with dispatching enabled. The Allocator
* Mutex provides sufficient protection to let the user extensions
* run safely.
*/
extension_status = _User_extensions_Thread_create( the_thread );
20095cc: 90 10 00 19 mov %i1, %o0
20095d0: 40 00 02 ed call 200a184 <_User_extensions_Thread_create>
20095d4: b0 10 20 01 mov 1, %i0
if ( extension_status )
20095d8: 80 8a 20 ff btst 0xff, %o0
20095dc: 32 80 00 12 bne,a 2009624 <_Thread_Initialize+0x154>
20095e0: b0 0e 20 01 and %i0, 1, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
20095e4: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
20095e8: 40 00 04 26 call 200a680 <_Workspace_Free>
20095ec: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
20095f0: 40 00 04 24 call 200a680 <_Workspace_Free>
20095f4: d0 06 61 58 ld [ %i1 + 0x158 ], %o0
20095f8: 40 00 04 22 call 200a680 <_Workspace_Free>
20095fc: d0 06 61 5c ld [ %i1 + 0x15c ], %o0
_Workspace_Free( extensions_area );
2009600: 40 00 04 20 call 200a680 <_Workspace_Free>
2009604: 90 10 00 1a mov %i2, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
2009608: 40 00 04 1e call 200a680 <_Workspace_Free>
200960c: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
2009610: 40 00 04 1c call 200a680 <_Workspace_Free>
2009614: 90 10 00 1c mov %i4, %o0
_Thread_Stack_Free( the_thread );
2009618: 40 00 02 0d call 2009e4c <_Thread_Stack_Free>
200961c: 90 10 00 19 mov %i1, %o0
return false;
}
2009620: b0 0e 20 01 and %i0, 1, %i0
2009624: 81 c7 e0 08 ret
2009628: 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 );
200962c: 40 00 04 0d call 200a660 <_Workspace_Allocate>
2009630: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
2009634: b6 92 20 00 orcc %o0, 0, %i3
2009638: 32 bf ff b8 bne,a 2009518 <_Thread_Initialize+0x48>
200963c: 39 00 80 76 sethi %hi(0x201d800), %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;
2009640: 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;
2009644: 10 bf ff e8 b 20095e4 <_Thread_Initialize+0x114>
2009648: b8 10 20 00 clr %i4
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
200964c: 82 00 60 01 inc %g1
2009650: 40 00 04 04 call 200a660 <_Workspace_Allocate>
2009654: 91 28 60 02 sll %g1, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
2009658: b4 92 20 00 orcc %o0, 0, %i2
200965c: 02 80 00 1d be 20096d0 <_Thread_Initialize+0x200>
2009660: 86 10 00 1a mov %i2, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2009664: f4 26 61 60 st %i2, [ %i1 + 0x160 ]
2009668: c8 07 23 94 ld [ %i4 + 0x394 ], %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++ )
200966c: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2009670: 10 80 00 03 b 200967c <_Thread_Initialize+0x1ac>
2009674: 82 10 20 00 clr %g1
2009678: 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;
200967c: 85 28 a0 02 sll %g2, 2, %g2
2009680: 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++ )
2009684: 82 00 60 01 inc %g1
2009688: 80 a0 40 04 cmp %g1, %g4
200968c: 08 bf ff fb bleu 2009678 <_Thread_Initialize+0x1a8>
2009690: 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;
2009694: 10 bf ff ad b 2009548 <_Thread_Initialize+0x78>
2009698: 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 );
200969c: 90 10 00 19 mov %i1, %o0
20096a0: 40 00 01 d0 call 2009de0 <_Thread_Stack_Allocate>
20096a4: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
20096a8: 80 a2 00 1b cmp %o0, %i3
20096ac: 0a 80 00 07 bcs 20096c8 <_Thread_Initialize+0x1f8>
20096b0: 80 a2 20 00 cmp %o0, 0
20096b4: 02 80 00 05 be 20096c8 <_Thread_Initialize+0x1f8> <== NEVER TAKEN
20096b8: 82 10 20 01 mov 1, %g1
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
20096bc: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2
the_thread->Start.core_allocated_stack = true;
20096c0: 10 bf ff 90 b 2009500 <_Thread_Initialize+0x30>
20096c4: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ]
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 */
20096c8: 10 bf ff d6 b 2009620 <_Thread_Initialize+0x150>
20096cc: 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;
20096d0: 10 bf ff c5 b 20095e4 <_Thread_Initialize+0x114>
20096d4: b8 10 20 00 clr %i4
02009e4c <_Thread_Stack_Free>:
*/
void _Thread_Stack_Free(
Thread_Control *the_thread
)
{
2009e4c: 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 )
2009e50: c2 0e 20 b4 ldub [ %i0 + 0xb4 ], %g1
2009e54: 80 a0 60 00 cmp %g1, 0
2009e58: 02 80 00 0b be 2009e84 <_Thread_Stack_Free+0x38> <== NEVER TAKEN
2009e5c: 01 00 00 00 nop
* 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.
*/
if ( Configuration.stack_free_hook )
2009e60: 03 00 80 73 sethi %hi(0x201cc00), %g1
2009e64: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1 ! 201cdb0 <Configuration+0x24>
2009e68: 80 a0 60 00 cmp %g1, 0
2009e6c: 22 80 00 08 be,a 2009e8c <_Thread_Stack_Free+0x40>
2009e70: f0 06 20 bc ld [ %i0 + 0xbc ], %i0
(*Configuration.stack_free_hook)( the_thread->Start.Initial_stack.area );
2009e74: 9f c0 40 00 call %g1
2009e78: d0 06 20 bc ld [ %i0 + 0xbc ], %o0
2009e7c: 81 c7 e0 08 ret
2009e80: 81 e8 00 00 restore
2009e84: 81 c7 e0 08 ret <== NOT EXECUTED
2009e88: 81 e8 00 00 restore <== NOT EXECUTED
else
_Workspace_Free( the_thread->Start.Initial_stack.area );
2009e8c: 40 00 01 fd call 200a680 <_Workspace_Free>
2009e90: 81 e8 00 00 restore
02009c78 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
2009c78: 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 )
2009c7c: 80 a6 20 00 cmp %i0, 0
2009c80: 02 80 00 13 be 2009ccc <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
2009c84: 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 ) {
2009c88: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
2009c8c: 80 a7 20 01 cmp %i4, 1
2009c90: 02 80 00 04 be 2009ca0 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
2009c94: 01 00 00 00 nop
2009c98: 81 c7 e0 08 ret <== NOT EXECUTED
2009c9c: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
2009ca0: 7f ff e1 51 call 20021e4 <sparc_disable_interrupts>
2009ca4: 01 00 00 00 nop
2009ca8: ba 10 00 08 mov %o0, %i5
2009cac: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
2009cb0: 03 00 00 ef sethi %hi(0x3bc00), %g1
2009cb4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
2009cb8: 80 88 80 01 btst %g2, %g1
2009cbc: 12 80 00 06 bne 2009cd4 <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
2009cc0: 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 );
2009cc4: 7f ff e1 4c call 20021f4 <sparc_enable_interrupts>
2009cc8: 90 10 00 1d mov %i5, %o0
2009ccc: 81 c7 e0 08 ret
2009cd0: 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 );
2009cd4: 92 10 00 19 mov %i1, %o1
2009cd8: 94 10 20 01 mov 1, %o2
2009cdc: 40 00 0f 4f call 200da18 <_Thread_queue_Extract_priority_helper>
2009ce0: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
2009ce4: 90 10 00 18 mov %i0, %o0
2009ce8: 92 10 00 19 mov %i1, %o1
2009cec: 7f ff ff 35 call 20099c0 <_Thread_queue_Enqueue_priority>
2009cf0: 94 07 bf fc add %fp, -4, %o2
2009cf4: 30 bf ff f4 b,a 2009cc4 <_Thread_queue_Requeue+0x4c>
02009cf8 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
2009cf8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2009cfc: 90 10 00 18 mov %i0, %o0
2009d00: 7f ff fd c8 call 2009420 <_Thread_Get>
2009d04: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009d08: c2 07 bf fc ld [ %fp + -4 ], %g1
2009d0c: 80 a0 60 00 cmp %g1, 0
2009d10: 12 80 00 09 bne 2009d34 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN
2009d14: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
2009d18: 40 00 0f 79 call 200dafc <_Thread_queue_Process_timeout>
2009d1c: 01 00 00 00 nop
*
* This routine decrements the thread dispatch level.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void)
{
_Thread_Dispatch_disable_level--;
2009d20: 03 00 80 76 sethi %hi(0x201d800), %g1
2009d24: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 201db00 <_Thread_Dispatch_disable_level>
2009d28: 84 00 bf ff add %g2, -1, %g2
2009d2c: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
2009d30: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
2009d34: 81 c7 e0 08 ret
2009d38: 81 e8 00 00 restore
0201650c <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
201650c: 9d e3 bf 88 save %sp, -120, %sp
2016510: 23 00 80 ee sethi %hi(0x203b800), %l1
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2016514: a6 07 bf e8 add %fp, -24, %l3
2016518: b2 07 bf ec add %fp, -20, %i1
201651c: b6 07 bf f4 add %fp, -12, %i3
2016520: a4 07 bf f8 add %fp, -8, %l2
2016524: 21 00 80 ee sethi %hi(0x203b800), %l0
2016528: 29 00 80 ee sethi %hi(0x203b800), %l4
201652c: f2 27 bf e8 st %i1, [ %fp + -24 ]
head->previous = NULL;
2016530: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
2016534: e6 27 bf f0 st %l3, [ %fp + -16 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2016538: e4 27 bf f4 st %l2, [ %fp + -12 ]
head->previous = NULL;
201653c: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
2016540: f6 27 bf fc st %i3, [ %fp + -4 ]
2016544: a2 14 61 0c or %l1, 0x10c, %l1
2016548: b8 06 20 30 add %i0, 0x30, %i4
201654c: a0 14 20 8c or %l0, 0x8c, %l0
2016550: b4 06 20 68 add %i0, 0x68, %i2
2016554: a8 15 20 00 mov %l4, %l4
2016558: ae 06 20 08 add %i0, 8, %l7
201655c: ac 06 20 40 add %i0, 0x40, %l6
_Thread_Set_state( ts->thread, STATES_DELAYING );
_Timer_server_Reset_interval_system_watchdog( ts );
_Timer_server_Reset_tod_system_watchdog( ts );
_Thread_Enable_dispatch();
ts->active = true;
2016560: aa 10 20 01 mov 1, %l5
{
/*
* Afterwards all timer inserts are directed to this chain and the interval
* and TOD chains will be no more modified by other parties.
*/
ts->insert_chain = insert_chain;
2016564: e6 26 20 78 st %l3, [ %i0 + 0x78 ]
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
2016568: c2 04 40 00 ld [ %l1 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
201656c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016570: 94 10 00 1b mov %i3, %o2
2016574: 90 10 00 1c mov %i4, %o0
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2016578: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
201657c: 40 00 13 4d call 201b2b0 <_Watchdog_Adjust_to_chain>
2016580: 92 20 40 09 sub %g1, %o1, %o1
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
2016584: d4 06 20 74 ld [ %i0 + 0x74 ], %o2
static void _Timer_server_Process_tod_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
2016588: fa 04 00 00 ld [ %l0 ], %i5
/*
* Process the seconds chain. Start by checking that the Time
* of Day (TOD) has not been set backwards. If it has then
* we want to adjust the watchdogs->Chain to indicate this.
*/
if ( snapshot > last_snapshot ) {
201658c: 80 a7 40 0a cmp %i5, %o2
2016590: 18 80 00 2e bgu 2016648 <_Timer_server_Body+0x13c>
2016594: 92 27 40 0a sub %i5, %o2, %o1
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
} else if ( snapshot < last_snapshot ) {
2016598: 80 a7 40 0a cmp %i5, %o2
201659c: 0a 80 00 2f bcs 2016658 <_Timer_server_Body+0x14c>
20165a0: 90 10 00 1a mov %i2, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
20165a4: fa 26 20 74 st %i5, [ %i0 + 0x74 ]
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
20165a8: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20165ac: 40 00 03 22 call 2017234 <_Chain_Get>
20165b0: 01 00 00 00 nop
if ( timer == NULL ) {
20165b4: 92 92 20 00 orcc %o0, 0, %o1
20165b8: 02 80 00 10 be 20165f8 <_Timer_server_Body+0xec>
20165bc: 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 ) {
20165c0: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
20165c4: 80 a0 60 01 cmp %g1, 1
20165c8: 02 80 00 28 be 2016668 <_Timer_server_Body+0x15c>
20165cc: 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 ) {
20165d0: 12 bf ff f6 bne 20165a8 <_Timer_server_Body+0x9c> <== NEVER TAKEN
20165d4: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20165d8: 40 00 13 67 call 201b374 <_Watchdog_Insert>
20165dc: 90 10 00 1a mov %i2, %o0
}
static void _Timer_server_Process_insertions( Timer_server_Control *ts )
{
while ( true ) {
Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain );
20165e0: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20165e4: 40 00 03 14 call 2017234 <_Chain_Get>
20165e8: 01 00 00 00 nop
if ( timer == NULL ) {
20165ec: 92 92 20 00 orcc %o0, 0, %o1
20165f0: 32 bf ff f5 bne,a 20165c4 <_Timer_server_Body+0xb8> <== NEVER TAKEN
20165f4: 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 );
20165f8: 7f ff e2 35 call 200eecc <sparc_disable_interrupts>
20165fc: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
2016600: c2 07 bf e8 ld [ %fp + -24 ], %g1
2016604: 80 a0 40 19 cmp %g1, %i1
2016608: 02 80 00 1c be 2016678 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN
201660c: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
2016610: 7f ff e2 33 call 200eedc <sparc_enable_interrupts> <== NOT EXECUTED
2016614: 01 00 00 00 nop <== NOT EXECUTED
static void _Timer_server_Process_interval_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot;
2016618: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
201661c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016620: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED
2016624: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2016628: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
201662c: 40 00 13 21 call 201b2b0 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED
2016630: 92 20 40 09 sub %g1, %o1, %o1 <== NOT EXECUTED
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
Watchdog_Interval last_snapshot = watchdogs->last_snapshot;
2016634: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 <== NOT EXECUTED
static void _Timer_server_Process_tod_watchdogs(
Timer_server_Watchdogs *watchdogs,
Chain_Control *fire_chain
)
{
Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
2016638: fa 04 00 00 ld [ %l0 ], %i5 <== NOT EXECUTED
/*
* Process the seconds chain. Start by checking that the Time
* of Day (TOD) has not been set backwards. If it has then
* we want to adjust the watchdogs->Chain to indicate this.
*/
if ( snapshot > last_snapshot ) {
201663c: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED
2016640: 08 bf ff d7 bleu 201659c <_Timer_server_Body+0x90> <== NOT EXECUTED
2016644: 92 27 40 0a sub %i5, %o2, %o1 <== NOT EXECUTED
/*
* This path is for normal forward movement and cases where the
* TOD has been set forward.
*/
delta = snapshot - last_snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016648: 90 10 00 1a mov %i2, %o0
201664c: 40 00 13 19 call 201b2b0 <_Watchdog_Adjust_to_chain>
2016650: 94 10 00 1b mov %i3, %o2
2016654: 30 bf ff d4 b,a 20165a4 <_Timer_server_Body+0x98>
/*
* The current TOD is before the last TOD which indicates that
* TOD has been set backwards.
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
2016658: 92 10 20 01 mov 1, %o1
201665c: 40 00 12 e6 call 201b1f4 <_Watchdog_Adjust>
2016660: 94 22 80 1d sub %o2, %i5, %o2
2016664: 30 bf ff d0 b,a 20165a4 <_Timer_server_Body+0x98>
Timer_server_Control *ts,
Timer_Control *timer
)
{
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
2016668: 90 10 00 1c mov %i4, %o0
201666c: 40 00 13 42 call 201b374 <_Watchdog_Insert>
2016670: 92 02 60 10 add %o1, 0x10, %o1
2016674: 30 bf ff cd b,a 20165a8 <_Timer_server_Body+0x9c>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
2016678: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
201667c: 7f ff e2 18 call 200eedc <sparc_enable_interrupts>
2016680: 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 ) ) {
2016684: c2 07 bf f4 ld [ %fp + -12 ], %g1
2016688: 80 a0 40 12 cmp %g1, %l2
201668c: 12 80 00 0c bne 20166bc <_Timer_server_Body+0x1b0>
2016690: 01 00 00 00 nop
2016694: 30 80 00 13 b,a 20166e0 <_Timer_server_Body+0x1d4>
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *old_first = head->next;
Chain_Node *new_first = old_first->next;
head->next = new_first;
new_first->previous = head;
2016698: f6 20 60 04 st %i3, [ %g1 + 4 ]
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *old_first = head->next;
Chain_Node *new_first = old_first->next;
head->next = new_first;
201669c: 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;
20166a0: c0 27 60 08 clr [ %i5 + 8 ]
_ISR_Enable( level );
20166a4: 7f ff e2 0e call 200eedc <sparc_enable_interrupts>
20166a8: 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 );
20166ac: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
20166b0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
20166b4: 9f c0 40 00 call %g1
20166b8: d2 07 60 24 ld [ %i5 + 0x24 ], %o1
/*
* It is essential that interrupts are disable here since an interrupt
* service routine may remove a watchdog from the chain.
*/
_ISR_Disable( level );
20166bc: 7f ff e2 04 call 200eecc <sparc_disable_interrupts>
20166c0: 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;
20166c4: fa 07 bf f4 ld [ %fp + -12 ], %i5
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected(
Chain_Control *the_chain
)
{
if ( !_Chain_Is_empty(the_chain))
20166c8: 80 a7 40 12 cmp %i5, %l2
20166cc: 32 bf ff f3 bne,a 2016698 <_Timer_server_Body+0x18c>
20166d0: c2 07 40 00 ld [ %i5 ], %g1
watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain );
if ( watchdog != NULL ) {
watchdog->state = WATCHDOG_INACTIVE;
_ISR_Enable( level );
} else {
_ISR_Enable( level );
20166d4: 7f ff e2 02 call 200eedc <sparc_enable_interrupts>
20166d8: 01 00 00 00 nop
20166dc: 30 bf ff a2 b,a 2016564 <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
20166e0: c0 2e 20 7c clrb [ %i0 + 0x7c ]
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20166e4: c2 05 00 00 ld [ %l4 ], %g1
20166e8: 82 00 60 01 inc %g1
20166ec: c2 25 00 00 st %g1, [ %l4 ]
return _Thread_Dispatch_disable_level;
20166f0: c2 05 00 00 ld [ %l4 ], %g1
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
20166f4: d0 06 00 00 ld [ %i0 ], %o0
20166f8: 40 00 11 23 call 201ab84 <_Thread_Set_state>
20166fc: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
2016700: 7f ff ff 5b call 201646c <_Timer_server_Reset_interval_system_watchdog>
2016704: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
2016708: 7f ff ff 6d call 20164bc <_Timer_server_Reset_tod_system_watchdog>
201670c: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
2016710: 40 00 0e 9d call 201a184 <_Thread_Enable_dispatch>
2016714: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016718: 90 10 00 17 mov %l7, %o0
_Thread_Set_state( ts->thread, STATES_DELAYING );
_Timer_server_Reset_interval_system_watchdog( ts );
_Timer_server_Reset_tod_system_watchdog( ts );
_Thread_Enable_dispatch();
ts->active = true;
201671c: ea 2e 20 7c stb %l5, [ %i0 + 0x7c ]
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
2016720: 40 00 13 77 call 201b4fc <_Watchdog_Remove>
2016724: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
2016728: 40 00 13 75 call 201b4fc <_Watchdog_Remove>
201672c: 90 10 00 16 mov %l6, %o0
2016730: 30 bf ff 8d b,a 2016564 <_Timer_server_Body+0x58>
02016734 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
2016734: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
2016738: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
201673c: 80 a0 60 00 cmp %g1, 0
2016740: 02 80 00 05 be 2016754 <_Timer_server_Schedule_operation_method+0x20>
2016744: 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 );
2016748: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
201674c: 40 00 02 a6 call 20171e4 <_Chain_Append>
2016750: 81 e8 00 00 restore
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2016754: 03 00 80 ee sethi %hi(0x203b800), %g1
2016758: c4 00 60 00 ld [ %g1 ], %g2
201675c: 84 00 a0 01 inc %g2
2016760: c4 20 60 00 st %g2, [ %g1 ]
return _Thread_Dispatch_disable_level;
2016764: c2 00 60 00 ld [ %g1 ], %g1
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
2016768: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
201676c: 80 a0 60 01 cmp %g1, 1
2016770: 02 80 00 28 be 2016810 <_Timer_server_Schedule_operation_method+0xdc>
2016774: 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 ) {
2016778: 02 80 00 04 be 2016788 <_Timer_server_Schedule_operation_method+0x54>
201677c: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
2016780: 40 00 0e 81 call 201a184 <_Thread_Enable_dispatch>
2016784: 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 );
2016788: 7f ff e1 d1 call 200eecc <sparc_disable_interrupts>
201678c: 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;
2016790: c4 06 20 68 ld [ %i0 + 0x68 ], %g2
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
2016794: c6 06 20 74 ld [ %i0 + 0x74 ], %g3
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
2016798: 88 06 20 6c add %i0, 0x6c, %g4
/*
* We have to advance the last known seconds value of the server and update
* the watchdog chain accordingly.
*/
_ISR_Disable( level );
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
201679c: 03 00 80 ee sethi %hi(0x203b800), %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
20167a0: 80 a0 80 04 cmp %g2, %g4
20167a4: 02 80 00 0d be 20167d8 <_Timer_server_Schedule_operation_method+0xa4>
20167a8: c2 00 60 8c ld [ %g1 + 0x8c ], %g1
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
20167ac: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
if ( snapshot > last_snapshot ) {
20167b0: 80 a0 40 03 cmp %g1, %g3
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
20167b4: 88 03 c0 03 add %o7, %g3, %g4
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
if ( snapshot > last_snapshot ) {
20167b8: 08 80 00 07 bleu 20167d4 <_Timer_server_Schedule_operation_method+0xa0>
20167bc: 88 21 00 01 sub %g4, %g1, %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
20167c0: 86 20 40 03 sub %g1, %g3, %g3
if (delta_interval > delta) {
20167c4: 80 a3 c0 03 cmp %o7, %g3
20167c8: 08 80 00 03 bleu 20167d4 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN
20167cc: 88 10 20 00 clr %g4
delta_interval -= delta;
20167d0: 88 23 c0 03 sub %o7, %g3, %g4
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
delta_interval += delta;
}
first_watchdog->delta_interval = delta_interval;
20167d4: c8 20 a0 10 st %g4, [ %g2 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
20167d8: c2 26 20 74 st %g1, [ %i0 + 0x74 ]
_ISR_Enable( level );
20167dc: 7f ff e1 c0 call 200eedc <sparc_enable_interrupts>
20167e0: 01 00 00 00 nop
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20167e4: 90 06 20 68 add %i0, 0x68, %o0
20167e8: 40 00 12 e3 call 201b374 <_Watchdog_Insert>
20167ec: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
20167f0: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
20167f4: 80 a0 60 00 cmp %g1, 0
20167f8: 12 bf ff e2 bne 2016780 <_Timer_server_Schedule_operation_method+0x4c>
20167fc: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
2016800: 7f ff ff 2f call 20164bc <_Timer_server_Reset_tod_system_watchdog>
2016804: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
2016808: 40 00 0e 5f call 201a184 <_Thread_Enable_dispatch>
201680c: 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 );
2016810: 7f ff e1 af call 200eecc <sparc_disable_interrupts>
2016814: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
2016818: 05 00 80 ee sethi %hi(0x203b800), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
201681c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
2016820: c4 00 a1 0c ld [ %g2 + 0x10c ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
2016824: 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 );
2016828: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
201682c: 80 a0 40 03 cmp %g1, %g3
2016830: 02 80 00 08 be 2016850 <_Timer_server_Schedule_operation_method+0x11c>
2016834: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
2016838: de 00 60 10 ld [ %g1 + 0x10 ], %o7
if (delta_interval > delta) {
201683c: 80 a1 00 0f cmp %g4, %o7
2016840: 1a 80 00 03 bcc 201684c <_Timer_server_Schedule_operation_method+0x118>
2016844: 86 10 20 00 clr %g3
delta_interval -= delta;
2016848: 86 23 c0 04 sub %o7, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
201684c: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
2016850: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
2016854: 7f ff e1 a2 call 200eedc <sparc_enable_interrupts>
2016858: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
201685c: 90 06 20 30 add %i0, 0x30, %o0
2016860: 40 00 12 c5 call 201b374 <_Watchdog_Insert>
2016864: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2016868: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
201686c: 80 a0 60 00 cmp %g1, 0
2016870: 12 bf ff c4 bne 2016780 <_Timer_server_Schedule_operation_method+0x4c>
2016874: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
2016878: 7f ff fe fd call 201646c <_Timer_server_Reset_interval_system_watchdog>
201687c: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
2016880: 40 00 0e 41 call 201a184 <_Thread_Enable_dispatch>
2016884: 81 e8 00 00 restore
0200a134 <_User_extensions_Fatal>:
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
200a134: 9d e3 bf a0 save %sp, -96, %sp
200a138: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a13c: b8 17 20 e8 or %i4, 0xe8, %i4 ! 201dce8 <_User_extensions_List>
200a140: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a144: 80 a7 40 1c cmp %i5, %i4
200a148: 02 80 00 0d be 200a17c <_User_extensions_Fatal+0x48> <== NEVER TAKEN
200a14c: 01 00 00 00 nop
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.fatal != NULL )
200a150: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200a154: 80 a0 60 00 cmp %g1, 0
200a158: 02 80 00 05 be 200a16c <_User_extensions_Fatal+0x38>
200a15c: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
200a160: 92 10 00 19 mov %i1, %o1
200a164: 9f c0 40 00 call %g1
200a168: 94 10 00 1a mov %i2, %o2
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
200a16c: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a170: 80 a7 40 1c cmp %i5, %i4
200a174: 32 bf ff f8 bne,a 200a154 <_User_extensions_Fatal+0x20>
200a178: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200a17c: 81 c7 e0 08 ret
200a180: 81 e8 00 00 restore
02009fe0 <_User_extensions_Handler_initialization>:
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _User_extensions_Handler_initialization(void)
{
2009fe0: 9d e3 bf a0 save %sp, -96, %sp
User_extensions_Control *extension;
uint32_t i;
uint32_t number_of_extensions;
User_extensions_Table *initial_extensions;
number_of_extensions = Configuration.number_of_initial_extensions;
2009fe4: 07 00 80 73 sethi %hi(0x201cc00), %g3
2009fe8: 86 10 e1 8c or %g3, 0x18c, %g3 ! 201cd8c <Configuration>
initial_extensions = Configuration.User_extension_table;
2009fec: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3
2009ff0: 3b 00 80 77 sethi %hi(0x201dc00), %i5
2009ff4: 09 00 80 76 sethi %hi(0x201d800), %g4
2009ff8: 84 17 60 e8 or %i5, 0xe8, %g2
2009ffc: 82 11 23 04 or %g4, 0x304, %g1
200a000: b4 00 a0 04 add %g2, 4, %i2
200a004: b8 00 60 04 add %g1, 4, %i4
200a008: f4 27 60 e8 st %i2, [ %i5 + 0xe8 ]
head->previous = NULL;
200a00c: c0 20 a0 04 clr [ %g2 + 4 ]
tail->previous = head;
200a010: c4 20 a0 08 st %g2, [ %g2 + 8 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200a014: f8 21 23 04 st %i4, [ %g4 + 0x304 ]
head->previous = NULL;
200a018: c0 20 60 04 clr [ %g1 + 4 ]
tail->previous = head;
200a01c: c2 20 60 08 st %g1, [ %g1 + 8 ]
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
200a020: 80 a6 e0 00 cmp %i3, 0
200a024: 02 80 00 1b be 200a090 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200a028: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2
extension = (User_extensions_Control *)
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
200a02c: 83 2e a0 02 sll %i2, 2, %g1
200a030: b9 2e a0 04 sll %i2, 4, %i4
200a034: b8 27 00 01 sub %i4, %g1, %i4
200a038: b8 07 00 1a add %i4, %i2, %i4
200a03c: b9 2f 20 02 sll %i4, 2, %i4
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
200a040: 40 00 01 96 call 200a698 <_Workspace_Allocate_or_fatal_error>
200a044: 90 10 00 1c mov %i4, %o0
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200a048: 92 10 20 00 clr %o1
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
extension = (User_extensions_Control *)
200a04c: ba 10 00 08 mov %o0, %i5
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200a050: 40 00 19 37 call 201052c <memset>
200a054: 94 10 00 1c mov %i4, %o2
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
200a058: 80 a6 a0 00 cmp %i2, 0
200a05c: 02 80 00 0d be 200a090 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200a060: b8 10 20 00 clr %i4
RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table(
User_extensions_Control *extension,
const User_extensions_Table *extension_table
)
{
extension->Callouts = *extension_table;
200a064: 92 10 00 1b mov %i3, %o1
200a068: 94 10 20 20 mov 0x20, %o2
200a06c: 40 00 18 f4 call 201043c <memcpy>
200a070: 90 07 60 14 add %i5, 0x14, %o0
_User_extensions_Add_set( extension );
200a074: 40 00 0e e6 call 200dc0c <_User_extensions_Add_set>
200a078: 90 10 00 1d mov %i5, %o0
200a07c: b8 07 20 01 inc %i4
_User_extensions_Add_set_with_table (extension, &initial_extensions[i]);
extension++;
200a080: ba 07 60 34 add %i5, 0x34, %i5
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
200a084: 80 a7 00 1a cmp %i4, %i2
200a088: 12 bf ff f7 bne 200a064 <_User_extensions_Handler_initialization+0x84>
200a08c: b6 06 e0 20 add %i3, 0x20, %i3
200a090: 81 c7 e0 08 ret
200a094: 81 e8 00 00 restore
0200a098 <_User_extensions_Thread_begin>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_begin (
Thread_Control *executing
)
{
200a098: 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;
200a09c: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a0a0: fa 07 20 e8 ld [ %i4 + 0xe8 ], %i5 ! 201dce8 <_User_extensions_List>
200a0a4: b8 17 20 e8 or %i4, 0xe8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a0a8: b8 07 20 04 add %i4, 4, %i4
200a0ac: 80 a7 40 1c cmp %i5, %i4
200a0b0: 02 80 00 0c be 200a0e0 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN
200a0b4: 01 00 00 00 nop
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_begin != NULL )
200a0b8: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200a0bc: 80 a0 60 00 cmp %g1, 0
200a0c0: 02 80 00 04 be 200a0d0 <_User_extensions_Thread_begin+0x38>
200a0c4: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_begin)( executing );
200a0c8: 9f c0 40 00 call %g1
200a0cc: 01 00 00 00 nop
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
200a0d0: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a0d4: 80 a7 40 1c cmp %i5, %i4
200a0d8: 32 bf ff f9 bne,a 200a0bc <_User_extensions_Thread_begin+0x24>
200a0dc: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200a0e0: 81 c7 e0 08 ret
200a0e4: 81 e8 00 00 restore
0200a184 <_User_extensions_Thread_create>:
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
200a184: 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;
200a188: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a18c: fa 07 20 e8 ld [ %i4 + 0xe8 ], %i5 ! 201dce8 <_User_extensions_List>
200a190: b8 17 20 e8 or %i4, 0xe8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
200a194: b8 07 20 04 add %i4, 4, %i4
200a198: 80 a7 40 1c cmp %i5, %i4
200a19c: 02 80 00 12 be 200a1e4 <_User_extensions_Thread_create+0x60><== NEVER TAKEN
200a1a0: 82 10 20 01 mov 1, %g1
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
status = (*the_extension->Callouts.thread_create)(
200a1a4: 37 00 80 78 sethi %hi(0x201e000), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
200a1a8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200a1ac: 80 a0 60 00 cmp %g1, 0
200a1b0: 02 80 00 08 be 200a1d0 <_User_extensions_Thread_create+0x4c>
200a1b4: 84 16 e0 40 or %i3, 0x40, %g2
status = (*the_extension->Callouts.thread_create)(
200a1b8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a1bc: 9f c0 40 00 call %g1
200a1c0: 92 10 00 18 mov %i0, %o1
_Thread_Executing,
the_thread
);
if ( !status )
200a1c4: 80 8a 20 ff btst 0xff, %o0
200a1c8: 02 80 00 0a be 200a1f0 <_User_extensions_Thread_create+0x6c>
200a1cc: 82 10 20 00 clr %g1
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
200a1d0: fa 07 40 00 ld [ %i5 ], %i5
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
200a1d4: 80 a7 40 1c cmp %i5, %i4
200a1d8: 32 bf ff f5 bne,a 200a1ac <_User_extensions_Thread_create+0x28>
200a1dc: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
if ( !status )
return false;
}
}
return true;
200a1e0: 82 10 20 01 mov 1, %g1
}
200a1e4: b0 08 60 01 and %g1, 1, %i0
200a1e8: 81 c7 e0 08 ret
200a1ec: 81 e8 00 00 restore
200a1f0: b0 08 60 01 and %g1, 1, %i0
200a1f4: 81 c7 e0 08 ret
200a1f8: 81 e8 00 00 restore
0200a1fc <_User_extensions_Thread_delete>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_delete (
Thread_Control *the_thread
)
{
200a1fc: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last(
Chain_Control *the_chain
)
{
return _Chain_Tail( the_chain )->previous;
200a200: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a204: b8 17 20 e8 or %i4, 0xe8, %i4 ! 201dce8 <_User_extensions_List>
200a208: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a20c: 80 a7 40 1c cmp %i5, %i4
200a210: 02 80 00 0d be 200a244 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN
200a214: 37 00 80 78 sethi %hi(0x201e000), %i3
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_delete != NULL )
200a218: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200a21c: 80 a0 60 00 cmp %g1, 0
200a220: 02 80 00 05 be 200a234 <_User_extensions_Thread_delete+0x38>
200a224: 84 16 e0 40 or %i3, 0x40, %g2
(*the_extension->Callouts.thread_delete)(
200a228: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a22c: 9f c0 40 00 call %g1
200a230: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
200a234: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a238: 80 a7 40 1c cmp %i5, %i4
200a23c: 32 bf ff f8 bne,a 200a21c <_User_extensions_Thread_delete+0x20>
200a240: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200a244: 81 c7 e0 08 ret
200a248: 81 e8 00 00 restore
0200a0e8 <_User_extensions_Thread_exitted>:
}
void _User_extensions_Thread_exitted (
Thread_Control *executing
)
{
200a0e8: 9d e3 bf a0 save %sp, -96, %sp
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Last(
Chain_Control *the_chain
)
{
return _Chain_Tail( the_chain )->previous;
200a0ec: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a0f0: b8 17 20 e8 or %i4, 0xe8, %i4 ! 201dce8 <_User_extensions_List>
200a0f4: fa 07 20 08 ld [ %i4 + 8 ], %i5
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a0f8: 80 a7 40 1c cmp %i5, %i4
200a0fc: 02 80 00 0c be 200a12c <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN
200a100: 01 00 00 00 nop
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_exitted != NULL )
200a104: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200a108: 80 a0 60 00 cmp %g1, 0
200a10c: 02 80 00 04 be 200a11c <_User_extensions_Thread_exitted+0x34>
200a110: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_exitted)( executing );
200a114: 9f c0 40 00 call %g1
200a118: 01 00 00 00 nop
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
!_Chain_Is_head( &_User_extensions_List, the_node ) ;
the_node = the_node->previous ) {
200a11c: fa 07 60 04 ld [ %i5 + 4 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_Last( &_User_extensions_List );
200a120: 80 a7 40 1c cmp %i5, %i4
200a124: 32 bf ff f9 bne,a 200a108 <_User_extensions_Thread_exitted+0x20>
200a128: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200a12c: 81 c7 e0 08 ret
200a130: 81 e8 00 00 restore
0200aa8c <_User_extensions_Thread_restart>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_restart (
Thread_Control *the_thread
)
{
200aa8c: 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;
200aa90: 39 00 80 7a sethi %hi(0x201e800), %i4
200aa94: fa 07 20 18 ld [ %i4 + 0x18 ], %i5 ! 201e818 <_User_extensions_List>
200aa98: b8 17 20 18 or %i4, 0x18, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200aa9c: b8 07 20 04 add %i4, 4, %i4
200aaa0: 80 a7 40 1c cmp %i5, %i4
200aaa4: 02 80 00 0d be 200aad8 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN
200aaa8: 37 00 80 7a sethi %hi(0x201e800), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_restart != NULL )
200aaac: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200aab0: 80 a0 60 00 cmp %g1, 0
200aab4: 02 80 00 05 be 200aac8 <_User_extensions_Thread_restart+0x3c>
200aab8: 84 16 e3 70 or %i3, 0x370, %g2
(*the_extension->Callouts.thread_restart)(
200aabc: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200aac0: 9f c0 40 00 call %g1
200aac4: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
200aac8: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200aacc: 80 a7 40 1c cmp %i5, %i4
200aad0: 32 bf ff f8 bne,a 200aab0 <_User_extensions_Thread_restart+0x24>
200aad4: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200aad8: 81 c7 e0 08 ret
200aadc: 81 e8 00 00 restore
0200a24c <_User_extensions_Thread_start>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_start (
Thread_Control *the_thread
)
{
200a24c: 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;
200a250: 39 00 80 77 sethi %hi(0x201dc00), %i4
200a254: fa 07 20 e8 ld [ %i4 + 0xe8 ], %i5 ! 201dce8 <_User_extensions_List>
200a258: b8 17 20 e8 or %i4, 0xe8, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a25c: b8 07 20 04 add %i4, 4, %i4
200a260: 80 a7 40 1c cmp %i5, %i4
200a264: 02 80 00 0d be 200a298 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN
200a268: 37 00 80 78 sethi %hi(0x201e000), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_start != NULL )
200a26c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200a270: 80 a0 60 00 cmp %g1, 0
200a274: 02 80 00 05 be 200a288 <_User_extensions_Thread_start+0x3c>
200a278: 84 16 e0 40 or %i3, 0x40, %g2
(*the_extension->Callouts.thread_start)(
200a27c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a280: 9f c0 40 00 call %g1
200a284: 92 10 00 18 mov %i0, %o1
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
200a288: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a28c: 80 a7 40 1c cmp %i5, %i4
200a290: 32 bf ff f8 bne,a 200a270 <_User_extensions_Thread_start+0x24>
200a294: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200a298: 81 c7 e0 08 ret
200a29c: 81 e8 00 00 restore
0200a2a0 <_User_extensions_Thread_switch>:
void _User_extensions_Thread_switch (
Thread_Control *executing,
Thread_Control *heir
)
{
200a2a0: 9d e3 bf a0 save %sp, -96, %sp
200a2a4: 39 00 80 76 sethi %hi(0x201d800), %i4
200a2a8: fa 07 23 04 ld [ %i4 + 0x304 ], %i5 ! 201db04 <_User_extensions_Switches_list>
200a2ac: b8 17 23 04 or %i4, 0x304, %i4
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
200a2b0: b8 07 20 04 add %i4, 4, %i4
200a2b4: 80 a7 40 1c cmp %i5, %i4
200a2b8: 02 80 00 0a be 200a2e0 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN
200a2bc: 01 00 00 00 nop
!_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ;
the_node = the_node->next ) {
the_extension_switch = (User_extensions_Switch_control *) the_node;
(*the_extension_switch->thread_switch)( executing, heir );
200a2c0: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a2c4: 90 10 00 18 mov %i0, %o0
200a2c8: 9f c0 40 00 call %g1
200a2cc: 92 10 00 19 mov %i1, %o1
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
!_Chain_Is_tail( &_User_extensions_Switches_list, the_node ) ;
the_node = the_node->next ) {
200a2d0: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
200a2d4: 80 a7 40 1c cmp %i5, %i4
200a2d8: 32 bf ff fb bne,a 200a2c4 <_User_extensions_Thread_switch+0x24>
200a2dc: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a2e0: 81 c7 e0 08 ret
200a2e4: 81 e8 00 00 restore
0200bd70 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200bd70: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200bd74: 7f ff dc 6f call 2002f30 <sparc_disable_interrupts>
200bd78: ba 10 00 18 mov %i0, %i5
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200bd7c: 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 );
200bd80: b6 06 20 04 add %i0, 4, %i3
* hence the compiler must not assume *header to remain
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
200bd84: 80 a0 40 1b cmp %g1, %i3
200bd88: 02 80 00 1e be 200be00 <_Watchdog_Adjust+0x90>
200bd8c: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200bd90: 12 80 00 1e bne 200be08 <_Watchdog_Adjust+0x98>
200bd94: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200bd98: 80 a6 a0 00 cmp %i2, 0
200bd9c: 02 80 00 19 be 200be00 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bda0: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bda4: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bda8: 80 a6 80 1c cmp %i2, %i4
200bdac: 1a 80 00 0a bcc 200bdd4 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
200bdb0: b2 10 20 01 mov 1, %i1
_Watchdog_First( header )->delta_interval -= units;
200bdb4: 10 80 00 1c b 200be24 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED
200bdb8: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED
switch ( direction ) {
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200bdbc: 02 80 00 11 be 200be00 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bdc0: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bdc4: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bdc8: 80 a7 00 1a cmp %i4, %i2
200bdcc: 38 80 00 16 bgu,a 200be24 <_Watchdog_Adjust+0xb4>
200bdd0: b8 27 00 1a sub %i4, %i2, %i4
_Watchdog_First( header )->delta_interval -= units;
break;
} else {
units -= _Watchdog_First( header )->delta_interval;
_Watchdog_First( header )->delta_interval = 1;
200bdd4: f2 20 60 10 st %i1, [ %g1 + 0x10 ]
_ISR_Enable( level );
200bdd8: 7f ff dc 5a call 2002f40 <sparc_enable_interrupts>
200bddc: 01 00 00 00 nop
_Watchdog_Tickle( header );
200bde0: 40 00 00 ab call 200c08c <_Watchdog_Tickle>
200bde4: 90 10 00 1d mov %i5, %o0
_ISR_Disable( level );
200bde8: 7f ff dc 52 call 2002f30 <sparc_disable_interrupts>
200bdec: 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;
200bdf0: c2 07 40 00 ld [ %i5 ], %g1
if ( _Chain_Is_empty( header ) )
200bdf4: 80 a6 c0 01 cmp %i3, %g1
200bdf8: 32 bf ff f1 bne,a 200bdbc <_Watchdog_Adjust+0x4c>
200bdfc: b4 a6 80 1c subcc %i2, %i4, %i2
}
break;
}
}
_ISR_Enable( level );
200be00: 7f ff dc 50 call 2002f40 <sparc_enable_interrupts>
200be04: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
200be08: 12 bf ff fe bne 200be00 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200be0c: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200be10: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200be14: b4 00 80 1a add %g2, %i2, %i2
200be18: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
200be1c: 7f ff dc 49 call 2002f40 <sparc_enable_interrupts>
200be20: 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;
200be24: 10 bf ff f7 b 200be00 <_Watchdog_Adjust+0x90>
200be28: f8 20 60 10 st %i4, [ %g1 + 0x10 ]
0200a470 <_Watchdog_Remove>:
*/
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
200a470: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
200a474: 7f ff df 5c call 20021e4 <sparc_disable_interrupts>
200a478: 01 00 00 00 nop
previous_state = the_watchdog->state;
200a47c: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
200a480: 80 a7 60 01 cmp %i5, 1
200a484: 02 80 00 2a be 200a52c <_Watchdog_Remove+0xbc>
200a488: 03 00 80 77 sethi %hi(0x201dc00), %g1
200a48c: 1a 80 00 09 bcc 200a4b0 <_Watchdog_Remove+0x40>
200a490: 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;
200a494: 03 00 80 77 sethi %hi(0x201dc00), %g1
200a498: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201dc0c <_Watchdog_Ticks_since_boot>
200a49c: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a4a0: 7f ff df 55 call 20021f4 <sparc_enable_interrupts>
200a4a4: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a4a8: 81 c7 e0 08 ret
200a4ac: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
200a4b0: 18 bf ff fa bgu 200a498 <_Watchdog_Remove+0x28> <== NEVER TAKEN
200a4b4: 03 00 80 77 sethi %hi(0x201dc00), %g1
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
_ISR_Enable( level );
return( previous_state );
}
200a4b8: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
200a4bc: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
200a4c0: c4 00 40 00 ld [ %g1 ], %g2
200a4c4: 80 a0 a0 00 cmp %g2, 0
200a4c8: 02 80 00 07 be 200a4e4 <_Watchdog_Remove+0x74>
200a4cc: 05 00 80 77 sethi %hi(0x201dc00), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
200a4d0: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200a4d4: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
200a4d8: 84 00 c0 02 add %g3, %g2, %g2
200a4dc: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
200a4e0: 05 00 80 77 sethi %hi(0x201dc00), %g2
200a4e4: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ! 201dc08 <_Watchdog_Sync_count>
200a4e8: 80 a0 a0 00 cmp %g2, 0
200a4ec: 22 80 00 07 be,a 200a508 <_Watchdog_Remove+0x98>
200a4f0: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
200a4f4: 05 00 80 78 sethi %hi(0x201e000), %g2
200a4f8: c6 00 a0 48 ld [ %g2 + 0x48 ], %g3 ! 201e048 <_Per_CPU_Information+0x8>
200a4fc: 05 00 80 76 sethi %hi(0x201d800), %g2
200a500: c6 20 a3 a8 st %g3, [ %g2 + 0x3a8 ] ! 201dba8 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
200a504: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
200a508: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
200a50c: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
200a510: 03 00 80 77 sethi %hi(0x201dc00), %g1
200a514: c2 00 60 0c ld [ %g1 + 0xc ], %g1 ! 201dc0c <_Watchdog_Ticks_since_boot>
200a518: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a51c: 7f ff df 36 call 20021f4 <sparc_enable_interrupts>
200a520: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a524: 81 c7 e0 08 ret
200a528: 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;
200a52c: 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;
200a530: 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;
200a534: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a538: 7f ff df 2f call 20021f4 <sparc_enable_interrupts>
200a53c: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a540: 81 c7 e0 08 ret
200a544: 81 e8 00 00 restore
0200b58c <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200b58c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200b590: 7f ff dd 49 call 2002ab4 <sparc_disable_interrupts>
200b594: 01 00 00 00 nop
200b598: ba 10 00 08 mov %o0, %i5
printk( "Watchdog Chain: %s %p\n", name, header );
200b59c: 11 00 80 76 sethi %hi(0x201d800), %o0
200b5a0: 94 10 00 19 mov %i1, %o2
200b5a4: 92 10 00 18 mov %i0, %o1
200b5a8: 7f ff e4 61 call 200472c <printk>
200b5ac: 90 12 20 e0 or %o0, 0xe0, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200b5b0: f8 06 40 00 ld [ %i1 ], %i4
RTEMS_INLINE_ROUTINE bool _Chain_Is_empty(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_first( the_chain )
== _Chain_Immutable_tail( the_chain );
200b5b4: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200b5b8: 80 a7 00 19 cmp %i4, %i1
200b5bc: 02 80 00 0f be 200b5f8 <_Watchdog_Report_chain+0x6c>
200b5c0: 11 00 80 76 sethi %hi(0x201d800), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200b5c4: 92 10 00 1c mov %i4, %o1
200b5c8: 40 00 00 0f call 200b604 <_Watchdog_Report>
200b5cc: 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 )
200b5d0: f8 07 00 00 ld [ %i4 ], %i4
Chain_Node *node;
_ISR_Disable( level );
printk( "Watchdog Chain: %s %p\n", name, header );
if ( !_Chain_Is_empty( header ) ) {
for ( node = _Chain_First( header ) ;
200b5d4: 80 a7 00 19 cmp %i4, %i1
200b5d8: 12 bf ff fc bne 200b5c8 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
200b5dc: 92 10 00 1c mov %i4, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200b5e0: 11 00 80 76 sethi %hi(0x201d800), %o0
200b5e4: 92 10 00 18 mov %i0, %o1
200b5e8: 7f ff e4 51 call 200472c <printk>
200b5ec: 90 12 20 f8 or %o0, 0xf8, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
200b5f0: 7f ff dd 35 call 2002ac4 <sparc_enable_interrupts>
200b5f4: 91 e8 00 1d restore %g0, %i5, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200b5f8: 7f ff e4 4d call 200472c <printk>
200b5fc: 90 12 21 08 or %o0, 0x108, %o0
200b600: 30 bf ff fc b,a 200b5f0 <_Watchdog_Report_chain+0x64>
0200646c <adjtime>:
int adjtime(
struct timeval *delta,
struct timeval *olddelta
)
{
200646c: 9d e3 bf 98 save %sp, -104, %sp
long adjustment;
/*
* Simple validations
*/
if ( !delta )
2006470: ba 96 20 00 orcc %i0, 0, %i5
2006474: 02 80 00 54 be 20065c4 <adjtime+0x158>
2006478: 03 00 03 d0 sethi %hi(0xf4000), %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
200647c: c4 07 60 04 ld [ %i5 + 4 ], %g2
2006480: 82 10 62 3f or %g1, 0x23f, %g1
2006484: 80 a0 80 01 cmp %g2, %g1
2006488: 18 80 00 4f bgu 20065c4 <adjtime+0x158>
200648c: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( olddelta ) {
2006490: 22 80 00 06 be,a 20064a8 <adjtime+0x3c>
2006494: c2 07 40 00 ld [ %i5 ], %g1
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
2006498: c0 26 60 04 clr [ %i1 + 4 ]
200649c: c4 07 60 04 ld [ %i5 + 4 ], %g2
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( olddelta ) {
olddelta->tv_sec = 0;
20064a0: c0 26 40 00 clr [ %i1 ]
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20064a4: c2 07 40 00 ld [ %i5 ], %g1
adjustment += delta->tv_usec;
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20064a8: 07 00 80 63 sethi %hi(0x2018c00), %g3
20064ac: c8 00 e0 58 ld [ %g3 + 0x58 ], %g4 ! 2018c58 <Configuration+0xc>
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20064b0: 9f 28 60 08 sll %g1, 8, %o7
20064b4: 87 28 60 03 sll %g1, 3, %g3
20064b8: 86 23 c0 03 sub %o7, %g3, %g3
20064bc: 9f 28 e0 06 sll %g3, 6, %o7
20064c0: 86 23 c0 03 sub %o7, %g3, %g3
20064c4: 82 00 c0 01 add %g3, %g1, %g1
20064c8: 83 28 60 06 sll %g1, 6, %g1
adjustment += delta->tv_usec;
20064cc: 84 00 40 02 add %g1, %g2, %g2
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20064d0: 80 a0 80 04 cmp %g2, %g4
20064d4: 0a 80 00 3a bcs 20065bc <adjtime+0x150>
20064d8: b0 10 20 00 clr %i0
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20064dc: 03 00 80 66 sethi %hi(0x2019800), %g1
20064e0: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 2019ac0 <_Thread_Dispatch_disable_level>
20064e4: 84 00 a0 01 inc %g2
20064e8: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ]
return _Thread_Dispatch_disable_level;
20064ec: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1
* This prevents context switches while we are adjusting the TOD
*/
_Thread_Disable_dispatch();
_TOD_Get( &ts );
20064f0: 40 00 06 75 call 2007ec4 <_TOD_Get>
20064f4: 90 07 bf f8 add %fp, -8, %o0
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
20064f8: c2 07 60 04 ld [ %i5 + 4 ], %g1
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
20064fc: c8 07 bf f8 ld [ %fp + -8 ], %g4
2006500: c4 07 40 00 ld [ %i5 ], %g2
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2006504: 87 28 60 02 sll %g1, 2, %g3
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2006508: 84 01 00 02 add %g4, %g2, %g2
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
200650c: 89 28 60 07 sll %g1, 7, %g4
2006510: 86 21 00 03 sub %g4, %g3, %g3
2006514: 82 00 c0 01 add %g3, %g1, %g1
2006518: c6 07 bf fc ld [ %fp + -4 ], %g3
200651c: 83 28 60 03 sll %g1, 3, %g1
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2006520: c4 27 bf f8 st %g2, [ %fp + -8 ]
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2006524: 82 00 40 03 add %g1, %g3, %g1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2006528: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3
200652c: 86 10 e1 ff or %g3, 0x1ff, %g3 ! 3b9ac9ff <RAM_END+0x395ac9ff>
2006530: 80 a0 40 03 cmp %g1, %g3
2006534: 08 80 00 0a bleu 200655c <adjtime+0xf0>
2006538: c2 27 bf fc st %g1, [ %fp + -4 ]
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
200653c: 09 31 19 4d sethi %hi(0xc4653400), %g4
2006540: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 <RAM_END+0xc2253600>
2006544: 82 00 40 04 add %g1, %g4, %g1
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 ) {
2006548: 80 a0 40 03 cmp %g1, %g3
200654c: 18 bf ff fe bgu 2006544 <adjtime+0xd8> <== NEVER TAKEN
2006550: 84 00 a0 01 inc %g2
2006554: c2 27 bf fc st %g1, [ %fp + -4 ]
2006558: c4 27 bf f8 st %g2, [ %fp + -8 ]
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) ) {
200655c: 09 31 19 4d sethi %hi(0xc4653400), %g4
2006560: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 <RAM_END+0xc2253600>
2006564: 80 a0 40 04 cmp %g1, %g4
2006568: 18 80 00 0a bgu 2006590 <adjtime+0x124> <== NEVER TAKEN
200656c: c4 07 bf f8 ld [ %fp + -8 ], %g2
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
2006570: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3
2006574: 86 10 e2 00 or %g3, 0x200, %g3 ! 3b9aca00 <RAM_END+0x395aca00>
2006578: 82 00 40 03 add %g1, %g3, %g1
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) ) {
200657c: 80 a0 40 04 cmp %g1, %g4
2006580: 08 bf ff fe bleu 2006578 <adjtime+0x10c>
2006584: 84 00 bf ff add %g2, -1, %g2
2006588: c2 27 bf fc st %g1, [ %fp + -4 ]
200658c: c4 27 bf f8 st %g2, [ %fp + -8 ]
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
ts.tv_sec--;
}
_TOD_Set( &ts );
2006590: 40 00 06 77 call 2007f6c <_TOD_Set>
2006594: 90 07 bf f8 add %fp, -8, %o0
_Thread_Enable_dispatch();
2006598: 40 00 0d 1b call 2009a04 <_Thread_Enable_dispatch>
200659c: b0 10 20 00 clr %i0
/* set the user's output */
if ( olddelta )
20065a0: 80 a6 60 00 cmp %i1, 0
20065a4: 02 80 00 0c be 20065d4 <adjtime+0x168>
20065a8: 01 00 00 00 nop
*olddelta = *delta;
20065ac: c2 07 40 00 ld [ %i5 ], %g1
20065b0: c2 26 40 00 st %g1, [ %i1 ]
20065b4: c2 07 60 04 ld [ %i5 + 4 ], %g1
20065b8: c2 26 60 04 st %g1, [ %i1 + 4 ]
return 0;
}
20065bc: 81 c7 e0 08 ret
20065c0: 81 e8 00 00 restore
*/
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 );
20065c4: 40 00 27 0a call 20101ec <__errno>
20065c8: b0 10 3f ff mov -1, %i0
20065cc: 82 10 20 16 mov 0x16, %g1
20065d0: c2 22 00 00 st %g1, [ %o0 ]
20065d4: 81 c7 e0 08 ret
20065d8: 81 e8 00 00 restore
02006cd8 <aio_cancel>:
* operation(s) cannot be canceled
*/
int aio_cancel(int fildes, struct aiocb *aiocbp)
{
2006cd8: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request_chain *r_chain;
int result;
pthread_mutex_lock (&aio_request_queue.mutex);
2006cdc: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2006ce0: 40 00 04 91 call 2007f24 <pthread_mutex_lock>
2006ce4: 90 17 61 3c or %i5, 0x13c, %o0 ! 2019d3c <aio_request_queue>
if (fcntl (fildes, F_GETFD) < 0) {
2006ce8: 90 10 00 18 mov %i0, %o0
2006cec: 40 00 1e ab call 200e798 <fcntl>
2006cf0: 92 10 20 01 mov 1, %o1
2006cf4: 80 a2 20 00 cmp %o0, 0
2006cf8: 06 80 00 6c bl 2006ea8 <aio_cancel+0x1d0>
2006cfc: 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) {
2006d00: 02 80 00 3b be 2006dec <aio_cancel+0x114>
2006d04: 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) {
2006d08: f8 06 40 00 ld [ %i1 ], %i4
2006d0c: 80 a7 00 18 cmp %i4, %i0
2006d10: 12 80 00 2f bne 2006dcc <aio_cancel+0xf4>
2006d14: 90 17 61 3c or %i5, 0x13c, %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);
2006d18: 92 10 00 1c mov %i4, %o1
2006d1c: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006d20: 94 10 20 00 clr %o2
2006d24: 40 00 00 cc call 2007054 <rtems_aio_search_fd>
2006d28: 90 12 21 84 or %o0, 0x184, %o0
if (r_chain == NULL) {
2006d2c: b0 92 20 00 orcc %o0, 0, %i0
2006d30: 22 80 00 0f be,a 2006d6c <aio_cancel+0x94>
2006d34: ba 17 61 3c or %i5, 0x13c, %i5
return AIO_ALLDONE;
}
}
AIO_printf ("Request on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2006d38: b8 06 20 1c add %i0, 0x1c, %i4
2006d3c: 40 00 04 7a call 2007f24 <pthread_mutex_lock>
2006d40: 90 10 00 1c mov %i4, %o0
result = rtems_aio_remove_req (&r_chain->perfd, aiocbp);
2006d44: 92 10 00 19 mov %i1, %o1
2006d48: 40 00 01 e4 call 20074d8 <rtems_aio_remove_req>
2006d4c: 90 06 20 08 add %i0, 8, %o0
2006d50: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&r_chain->mutex);
2006d54: 40 00 04 94 call 2007fa4 <pthread_mutex_unlock>
2006d58: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006d5c: 40 00 04 92 call 2007fa4 <pthread_mutex_unlock>
2006d60: 90 17 61 3c or %i5, 0x13c, %o0
return result;
}
return AIO_ALLDONE;
}
2006d64: 81 c7 e0 08 ret
2006d68: 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)) {
2006d6c: c4 07 60 54 ld [ %i5 + 0x54 ], %g2
2006d70: 82 07 60 58 add %i5, 0x58, %g1
2006d74: 80 a0 80 01 cmp %g2, %g1
2006d78: 02 80 00 0f be 2006db4 <aio_cancel+0xdc> <== NEVER TAKEN
2006d7c: 90 07 60 54 add %i5, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2006d80: 92 10 00 1c mov %i4, %o1
2006d84: 40 00 00 b4 call 2007054 <rtems_aio_search_fd>
2006d88: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2006d8c: 80 a2 20 00 cmp %o0, 0
2006d90: 02 80 00 0e be 2006dc8 <aio_cancel+0xf0>
2006d94: 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);
2006d98: 40 00 01 d0 call 20074d8 <rtems_aio_remove_req>
2006d9c: 90 02 20 08 add %o0, 8, %o0
2006da0: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006da4: 40 00 04 80 call 2007fa4 <pthread_mutex_unlock>
2006da8: 90 10 00 1d mov %i5, %o0
return result;
2006dac: 81 c7 e0 08 ret
2006db0: 81 e8 00 00 restore
} else {
pthread_mutex_unlock (&aio_request_queue.mutex);
2006db4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED
2006db8: 40 00 04 7b call 2007fa4 <pthread_mutex_unlock>
2006dbc: b0 10 20 02 mov 2, %i0
return AIO_ALLDONE;
2006dc0: 81 c7 e0 08 ret
2006dc4: 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);
2006dc8: 90 10 00 1d mov %i5, %o0
2006dcc: 40 00 04 76 call 2007fa4 <pthread_mutex_unlock>
2006dd0: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one (EINVAL);
2006dd4: 40 00 2c f3 call 20121a0 <__errno>
2006dd8: 01 00 00 00 nop
2006ddc: 82 10 20 16 mov 0x16, %g1 ! 16 <PROM_START+0x16>
2006de0: c2 22 00 00 st %g1, [ %o0 ]
2006de4: 81 c7 e0 08 ret
2006de8: 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);
2006dec: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006df0: 94 10 20 00 clr %o2
2006df4: 40 00 00 98 call 2007054 <rtems_aio_search_fd>
2006df8: 90 12 21 84 or %o0, 0x184, %o0
if (r_chain == NULL) {
2006dfc: b8 92 20 00 orcc %o0, 0, %i4
2006e00: 02 80 00 0f be 2006e3c <aio_cancel+0x164>
2006e04: b2 07 20 1c add %i4, 0x1c, %i1
return AIO_ALLDONE;
}
AIO_printf ("Request chain on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2006e08: 40 00 04 47 call 2007f24 <pthread_mutex_lock>
2006e0c: 90 10 00 19 mov %i1, %o0
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2006e10: 40 00 0b 08 call 2009a30 <_Chain_Extract>
2006e14: 90 10 00 1c mov %i4, %o0
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
2006e18: 40 00 01 9c call 2007488 <rtems_aio_remove_fd>
2006e1c: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&r_chain->mutex);
2006e20: 40 00 04 61 call 2007fa4 <pthread_mutex_unlock>
2006e24: 90 10 00 19 mov %i1, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006e28: 90 17 61 3c or %i5, 0x13c, %o0
2006e2c: 40 00 04 5e call 2007fa4 <pthread_mutex_unlock>
2006e30: b0 10 20 00 clr %i0
return AIO_CANCELED;
2006e34: 81 c7 e0 08 ret
2006e38: 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;
2006e3c: ba 17 61 3c or %i5, 0x13c, %i5
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)) {
2006e40: c4 07 60 54 ld [ %i5 + 0x54 ], %g2
2006e44: 82 07 60 58 add %i5, 0x58, %g1
2006e48: 80 a0 80 01 cmp %g2, %g1
2006e4c: 02 bf ff da be 2006db4 <aio_cancel+0xdc> <== NEVER TAKEN
2006e50: 90 07 60 54 add %i5, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2006e54: 92 10 00 18 mov %i0, %o1
2006e58: 40 00 00 7f call 2007054 <rtems_aio_search_fd>
2006e5c: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2006e60: b8 92 20 00 orcc %o0, 0, %i4
2006e64: 22 bf ff d5 be,a 2006db8 <aio_cancel+0xe0>
2006e68: 90 10 00 1d mov %i5, %o0
2006e6c: 40 00 0a f1 call 2009a30 <_Chain_Extract>
2006e70: b2 07 20 1c add %i4, 0x1c, %i1
}
AIO_printf ("Request chain on [IQ]\n");
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
2006e74: 40 00 01 85 call 2007488 <rtems_aio_remove_fd>
2006e78: 90 10 00 1c mov %i4, %o0
pthread_mutex_destroy (&r_chain->mutex);
2006e7c: 40 00 03 7f call 2007c78 <pthread_mutex_destroy>
2006e80: 90 10 00 19 mov %i1, %o0
pthread_cond_destroy (&r_chain->mutex);
2006e84: 40 00 02 9e call 20078fc <pthread_cond_destroy>
2006e88: 90 10 00 19 mov %i1, %o0
free (r_chain);
2006e8c: 7f ff f2 0a call 20036b4 <free>
2006e90: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return AIO_CANCELED;
2006e94: 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);
2006e98: 40 00 04 43 call 2007fa4 <pthread_mutex_unlock>
2006e9c: 90 10 00 1d mov %i5, %o0
return AIO_CANCELED;
2006ea0: 81 c7 e0 08 ret
2006ea4: 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);
2006ea8: 40 00 04 3f call 2007fa4 <pthread_mutex_unlock>
2006eac: 90 17 61 3c or %i5, 0x13c, %o0
rtems_set_errno_and_return_minus_one (EBADF);
2006eb0: 40 00 2c bc call 20121a0 <__errno>
2006eb4: b0 10 3f ff mov -1, %i0
2006eb8: 82 10 20 09 mov 9, %g1
2006ebc: c2 22 00 00 st %g1, [ %o0 ]
2006ec0: 81 c7 e0 08 ret
2006ec4: 81 e8 00 00 restore
02006ed0 <aio_fsync>:
int aio_fsync(
int op,
struct aiocb *aiocbp
)
{
2006ed0: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
if (op != O_SYNC)
2006ed4: 03 00 00 08 sethi %hi(0x2000), %g1
2006ed8: 80 a6 00 01 cmp %i0, %g1
2006edc: 12 80 00 14 bne 2006f2c <aio_fsync+0x5c>
2006ee0: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2006ee4: d0 06 40 00 ld [ %i1 ], %o0
2006ee8: 40 00 1e 2c call 200e798 <fcntl>
2006eec: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
2006ef0: 90 0a 20 03 and %o0, 3, %o0
2006ef4: 90 02 3f ff add %o0, -1, %o0
2006ef8: 80 a2 20 01 cmp %o0, 1
2006efc: 18 80 00 0c bgu 2006f2c <aio_fsync+0x5c>
2006f00: ba 10 20 09 mov 9, %i5
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2006f04: 7f ff f3 76 call 2003cdc <malloc>
2006f08: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2006f0c: 80 a2 20 00 cmp %o0, 0
2006f10: 02 80 00 06 be 2006f28 <aio_fsync+0x58> <== NEVER TAKEN
2006f14: 82 10 20 03 mov 3, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2006f18: f2 22 20 14 st %i1, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_SYNC;
2006f1c: c2 26 60 30 st %g1, [ %i1 + 0x30 ]
return rtems_aio_enqueue (req);
2006f20: 40 00 01 8a call 2007548 <rtems_aio_enqueue>
2006f24: 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);
2006f28: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
2006f2c: 82 10 3f ff mov -1, %g1
2006f30: fa 26 60 34 st %i5, [ %i1 + 0x34 ]
2006f34: c2 26 60 38 st %g1, [ %i1 + 0x38 ]
2006f38: 40 00 2c 9a call 20121a0 <__errno>
2006f3c: b0 10 3f ff mov -1, %i0
2006f40: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_SYNC;
return rtems_aio_enqueue (req);
}
2006f44: 81 c7 e0 08 ret
2006f48: 81 e8 00 00 restore
0200772c <aio_read>:
* 0 - otherwise
*/
int
aio_read (struct aiocb *aiocbp)
{
200772c: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2007730: d0 06 00 00 ld [ %i0 ], %o0
2007734: 40 00 1c 19 call 200e798 <fcntl>
2007738: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR)))
200773c: 90 0a 20 03 and %o0, 3, %o0
2007740: 80 a2 20 02 cmp %o0, 2
2007744: 12 80 00 1b bne 20077b0 <aio_read+0x84>
2007748: 80 a2 20 00 cmp %o0, 0
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX)
200774c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2007750: 80 a0 60 00 cmp %g1, 0
2007754: 12 80 00 0f bne 2007790 <aio_read+0x64>
2007758: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
200775c: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007760: 80 a0 60 00 cmp %g1, 0
2007764: 06 80 00 0c bl 2007794 <aio_read+0x68>
2007768: 82 10 3f ff mov -1, %g1
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
200776c: 7f ff f1 5c call 2003cdc <malloc>
2007770: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2007774: 80 a2 20 00 cmp %o0, 0
2007778: 02 80 00 12 be 20077c0 <aio_read+0x94> <== NEVER TAKEN
200777c: 82 10 20 01 mov 1, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2007780: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_READ;
2007784: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
2007788: 7f ff ff 70 call 2007548 <rtems_aio_enqueue>
200778c: 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);
2007790: 82 10 3f ff mov -1, %g1
2007794: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
2007798: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
200779c: 40 00 2a 81 call 20121a0 <__errno>
20077a0: b0 10 3f ff mov -1, %i0
20077a4: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_READ;
return rtems_aio_enqueue (req);
}
20077a8: 81 c7 e0 08 ret
20077ac: 81 e8 00 00 restore
{
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR)))
20077b0: 02 bf ff e7 be 200774c <aio_read+0x20> <== NEVER TAKEN
20077b4: ba 10 20 09 mov 9, %i5
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);
20077b8: 10 bf ff f7 b 2007794 <aio_read+0x68>
20077bc: 82 10 3f ff mov -1, %g1
20077c0: 10 bf ff f4 b 2007790 <aio_read+0x64> <== NOT EXECUTED
20077c4: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
020077d0 <aio_write>:
* 0 - otherwise
*/
int
aio_write (struct aiocb *aiocbp)
{
20077d0: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
20077d4: d0 06 00 00 ld [ %i0 ], %o0
20077d8: 40 00 1b f0 call 200e798 <fcntl>
20077dc: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
20077e0: 90 0a 20 03 and %o0, 3, %o0
20077e4: 90 02 3f ff add %o0, -1, %o0
20077e8: 80 a2 20 01 cmp %o0, 1
20077ec: 18 80 00 14 bgu 200783c <aio_write+0x6c>
20077f0: 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)
20077f4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
20077f8: 80 a0 60 00 cmp %g1, 0
20077fc: 12 80 00 10 bne 200783c <aio_write+0x6c>
2007800: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
2007804: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007808: 80 a0 60 00 cmp %g1, 0
200780c: 06 80 00 0d bl 2007840 <aio_write+0x70>
2007810: 82 10 3f ff mov -1, %g1
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2007814: 7f ff f1 32 call 2003cdc <malloc>
2007818: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
200781c: 80 a2 20 00 cmp %o0, 0
2007820: 02 80 00 06 be 2007838 <aio_write+0x68> <== NEVER TAKEN
2007824: 82 10 20 02 mov 2, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2007828: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_WRITE;
200782c: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
2007830: 7f ff ff 46 call 2007548 <rtems_aio_enqueue>
2007834: 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);
2007838: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
200783c: 82 10 3f ff mov -1, %g1
2007840: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
2007844: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
2007848: 40 00 2a 56 call 20121a0 <__errno>
200784c: b0 10 3f ff mov -1, %i0
2007850: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_WRITE;
return rtems_aio_enqueue (req);
}
2007854: 81 c7 e0 08 ret
2007858: 81 e8 00 00 restore
020062d4 <clock_gettime>:
int clock_gettime(
clockid_t clock_id,
struct timespec *tp
)
{
20062d4: 9d e3 bf a0 save %sp, -96, %sp
if ( !tp )
20062d8: 80 a6 60 00 cmp %i1, 0
20062dc: 02 80 00 20 be 200635c <clock_gettime+0x88>
20062e0: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
20062e4: 02 80 00 19 be 2006348 <clock_gettime+0x74>
20062e8: 80 a6 20 04 cmp %i0, 4
_TOD_Get(tp);
return 0;
}
#ifdef CLOCK_MONOTONIC
if ( clock_id == CLOCK_MONOTONIC ) {
20062ec: 02 80 00 12 be 2006334 <clock_gettime+0x60> <== NEVER TAKEN
20062f0: 80 a6 20 02 cmp %i0, 2
return 0;
}
#endif
#ifdef _POSIX_CPUTIME
if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) {
20062f4: 02 80 00 10 be 2006334 <clock_gettime+0x60>
20062f8: 80 a6 20 03 cmp %i0, 3
return 0;
}
#endif
#ifdef _POSIX_THREAD_CPUTIME
if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
20062fc: 02 80 00 08 be 200631c <clock_gettime+0x48>
2006300: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
2006304: 40 00 29 43 call 2010810 <__errno>
2006308: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
200630c: 82 10 20 16 mov 0x16, %g1
2006310: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
2006314: 81 c7 e0 08 ret
2006318: 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 );
200631c: 40 00 29 3d call 2010810 <__errno>
2006320: b0 10 3f ff mov -1, %i0
2006324: 82 10 20 58 mov 0x58, %g1
2006328: c2 22 00 00 st %g1, [ %o0 ]
200632c: 81 c7 e0 08 ret
2006330: 81 e8 00 00 restore
}
#endif
#ifdef _POSIX_CPUTIME
if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) {
_TOD_Get_uptime_as_timespec( tp );
2006334: 90 10 00 19 mov %i1, %o0
2006338: 40 00 08 40 call 2008438 <_TOD_Get_uptime_as_timespec>
200633c: b0 10 20 00 clr %i0
return 0;
2006340: 81 c7 e0 08 ret
2006344: 81 e8 00 00 restore
{
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
_TOD_Get(tp);
2006348: 90 10 00 19 mov %i1, %o0
200634c: 40 00 08 20 call 20083cc <_TOD_Get>
2006350: b0 10 20 00 clr %i0
return 0;
2006354: 81 c7 e0 08 ret
2006358: 81 e8 00 00 restore
clockid_t clock_id,
struct timespec *tp
)
{
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
200635c: 40 00 29 2d call 2010810 <__errno>
2006360: b0 10 3f ff mov -1, %i0
2006364: 82 10 20 16 mov 0x16, %g1
2006368: c2 22 00 00 st %g1, [ %o0 ]
200636c: 81 c7 e0 08 ret
2006370: 81 e8 00 00 restore
02006374 <clock_settime>:
int clock_settime(
clockid_t clock_id,
const struct timespec *tp
)
{
2006374: 9d e3 bf a0 save %sp, -96, %sp
if ( !tp )
2006378: 80 a6 60 00 cmp %i1, 0
200637c: 02 80 00 25 be 2006410 <clock_settime+0x9c> <== NEVER TAKEN
2006380: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
2006384: 02 80 00 0c be 20063b4 <clock_settime+0x40>
2006388: 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 )
200638c: 02 80 00 1b be 20063f8 <clock_settime+0x84>
2006390: 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 )
2006394: 02 80 00 19 be 20063f8 <clock_settime+0x84>
2006398: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
else
rtems_set_errno_and_return_minus_one( EINVAL );
200639c: 40 00 29 1d call 2010810 <__errno>
20063a0: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
20063a4: 82 10 20 16 mov 0x16, %g1
20063a8: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
20063ac: 81 c7 e0 08 ret
20063b0: 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 )
20063b4: c4 06 40 00 ld [ %i1 ], %g2
20063b8: 03 08 76 b9 sethi %hi(0x21dae400), %g1
20063bc: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff <RAM_END+0x1f9ae4ff>
20063c0: 80 a0 80 01 cmp %g2, %g1
20063c4: 08 80 00 13 bleu 2006410 <clock_settime+0x9c>
20063c8: 03 00 80 69 sethi %hi(0x201a400), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20063cc: c4 00 62 60 ld [ %g1 + 0x260 ], %g2 ! 201a660 <_Thread_Dispatch_disable_level>
20063d0: 84 00 a0 01 inc %g2
20063d4: c4 20 62 60 st %g2, [ %g1 + 0x260 ]
return _Thread_Dispatch_disable_level;
20063d8: c2 00 62 60 ld [ %g1 + 0x260 ], %g1
rtems_set_errno_and_return_minus_one( EINVAL );
_Thread_Disable_dispatch();
_TOD_Set( tp );
20063dc: 90 10 00 19 mov %i1, %o0
20063e0: 40 00 08 2e call 2008498 <_TOD_Set>
20063e4: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
20063e8: 40 00 0e d2 call 2009f30 <_Thread_Enable_dispatch>
20063ec: 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;
20063f0: 81 c7 e0 08 ret
20063f4: 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 );
20063f8: 40 00 29 06 call 2010810 <__errno>
20063fc: b0 10 3f ff mov -1, %i0
2006400: 82 10 20 58 mov 0x58, %g1
2006404: c2 22 00 00 st %g1, [ %o0 ]
2006408: 81 c7 e0 08 ret
200640c: 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 )
rtems_set_errno_and_return_minus_one( EINVAL );
2006410: 40 00 29 00 call 2010810 <__errno>
2006414: b0 10 3f ff mov -1, %i0
2006418: 82 10 20 16 mov 0x16, %g1
200641c: c2 22 00 00 st %g1, [ %o0 ]
2006420: 81 c7 e0 08 ret
2006424: 81 e8 00 00 restore
0201a4e4 <killinfo>:
int killinfo(
pid_t pid,
int sig,
const union sigval *value
)
{
201a4e4: 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() )
201a4e8: 7f ff fe e2 call 201a070 <getpid>
201a4ec: 01 00 00 00 nop
201a4f0: 80 a2 00 18 cmp %o0, %i0
201a4f4: 12 80 00 af bne 201a7b0 <killinfo+0x2cc>
201a4f8: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
/*
* Validate the signal passed.
*/
if ( !sig )
201a4fc: 02 80 00 b3 be 201a7c8 <killinfo+0x2e4>
201a500: 82 06 7f ff add %i1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201a504: 80 a0 60 1f cmp %g1, 0x1f
201a508: 18 80 00 b0 bgu 201a7c8 <killinfo+0x2e4>
201a50c: b7 2e 60 02 sll %i1, 2, %i3
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 )
201a510: 39 00 80 78 sethi %hi(0x201e000), %i4
201a514: a1 2e 60 04 sll %i1, 4, %l0
201a518: b8 17 20 a0 or %i4, 0xa0, %i4
201a51c: 84 24 00 1b sub %l0, %i3, %g2
201a520: 84 07 00 02 add %i4, %g2, %g2
201a524: c4 00 a0 08 ld [ %g2 + 8 ], %g2
201a528: 80 a0 a0 01 cmp %g2, 1
201a52c: 02 80 00 3f be 201a628 <killinfo+0x144>
201a530: b0 10 20 00 clr %i0
/*
* 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 ) )
201a534: 80 a6 60 04 cmp %i1, 4
201a538: 02 80 00 3e be 201a630 <killinfo+0x14c>
201a53c: 80 a6 60 08 cmp %i1, 8
201a540: 02 80 00 3c be 201a630 <killinfo+0x14c>
201a544: 80 a6 60 0b cmp %i1, 0xb
201a548: 02 80 00 3a be 201a630 <killinfo+0x14c>
201a54c: ba 10 20 01 mov 1, %i5
/*
* Build up a siginfo structure
*/
siginfo = &siginfo_struct;
siginfo->si_signo = sig;
201a550: f2 27 bf f4 st %i1, [ %fp + -12 ]
siginfo->si_code = SI_USER;
201a554: fa 27 bf f8 st %i5, [ %fp + -8 ]
if ( !value ) {
201a558: 80 a6 a0 00 cmp %i2, 0
201a55c: 02 80 00 3b be 201a648 <killinfo+0x164>
201a560: bb 2f 40 01 sll %i5, %g1, %i5
siginfo->si_value.sival_int = 0;
} else {
siginfo->si_value = *value;
201a564: c2 06 80 00 ld [ %i2 ], %g1
201a568: 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)
{
_Thread_Dispatch_disable_level++;
201a56c: 03 00 80 76 sethi %hi(0x201d800), %g1
201a570: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 201db00 <_Thread_Dispatch_disable_level>
201a574: 84 00 a0 01 inc %g2
201a578: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
201a57c: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
/*
* 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;
201a580: 03 00 80 78 sethi %hi(0x201e000), %g1
201a584: d0 00 60 4c ld [ %g1 + 0x4c ], %o0 ! 201e04c <_Per_CPU_Information+0xc>
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( _POSIX_signals_Is_interested( api, mask ) ) {
201a588: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
201a58c: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1
201a590: 80 af 40 01 andncc %i5, %g1, %g0
201a594: 12 80 00 16 bne 201a5ec <killinfo+0x108>
201a598: 07 00 80 78 sethi %hi(0x201e000), %g3
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
201a59c: d0 00 e2 2c ld [ %g3 + 0x22c ], %o0 ! 201e22c <_POSIX_signals_Wait_queue>
201a5a0: 86 10 e2 2c or %g3, 0x22c, %g3
/* 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 );
201a5a4: 86 00 e0 04 add %g3, 4, %g3
201a5a8: 80 a2 00 03 cmp %o0, %g3
201a5ac: 32 80 00 0d bne,a 201a5e0 <killinfo+0xfc>
201a5b0: c2 02 20 30 ld [ %o0 + 0x30 ], %g1
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201a5b4: 10 80 00 27 b 201a650 <killinfo+0x16c>
201a5b8: 03 00 80 73 sethi %hi(0x201cc00), %g1
/*
* Is this thread is blocked waiting for another signal but has
* not blocked this one?
*/
if (~api->signals_blocked & mask)
201a5bc: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1
201a5c0: 80 af 40 01 andncc %i5, %g1, %g0
201a5c4: 12 80 00 0b bne 201a5f0 <killinfo+0x10c>
201a5c8: 92 10 00 19 mov %i1, %o1
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 ) {
201a5cc: d0 02 00 00 ld [ %o0 ], %o0
/* 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 );
201a5d0: 80 a2 00 03 cmp %o0, %g3
201a5d4: 02 80 00 1f be 201a650 <killinfo+0x16c> <== ALWAYS TAKEN
201a5d8: 03 00 80 73 sethi %hi(0x201cc00), %g1
#endif
/*
* Is this thread is actually blocked waiting for the signal?
*/
if (the_thread->Wait.option & mask)
201a5dc: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED
201a5e0: 80 8f 40 01 btst %i5, %g1
201a5e4: 02 bf ff f6 be 201a5bc <killinfo+0xd8>
201a5e8: c4 02 21 5c ld [ %o0 + 0x15c ], %g2
/*
* 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 ) ) {
201a5ec: 92 10 00 19 mov %i1, %o1
201a5f0: 40 00 00 8d call 201a824 <_POSIX_signals_Unblock_thread>
201a5f4: 94 07 bf f4 add %fp, -12, %o2
201a5f8: 80 8a 20 ff btst 0xff, %o0
201a5fc: 12 80 00 5a bne 201a764 <killinfo+0x280>
201a600: 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 );
201a604: 40 00 00 7f call 201a800 <_POSIX_signals_Set_process_signals>
201a608: 90 10 00 1d mov %i5, %o0
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
201a60c: b6 24 00 1b sub %l0, %i3, %i3
201a610: c2 07 00 1b ld [ %i4 + %i3 ], %g1
201a614: 80 a0 60 02 cmp %g1, 2
201a618: 02 80 00 57 be 201a774 <killinfo+0x290>
201a61c: 11 00 80 78 sethi %hi(0x201e000), %o0
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
}
DEBUG_STEP("\n");
_Thread_Enable_dispatch();
201a620: 7f ff bb 73 call 20093ec <_Thread_Enable_dispatch>
201a624: b0 10 20 00 clr %i0
return 0;
}
201a628: 81 c7 e0 08 ret
201a62c: 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 );
201a630: 40 00 01 0f call 201aa6c <pthread_self>
201a634: 01 00 00 00 nop
201a638: 40 00 00 d2 call 201a980 <pthread_kill>
201a63c: 92 10 00 19 mov %i1, %o1
201a640: 81 c7 e0 08 ret
201a644: 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;
201a648: 10 bf ff c9 b 201a56c <killinfo+0x88>
201a64c: c0 27 bf fc clr [ %fp + -4 ]
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201a650: c8 08 61 cc ldub [ %g1 + 0x1cc ], %g4
201a654: 1b 00 80 76 sethi %hi(0x201d800), %o5
201a658: 88 01 20 01 inc %g4
201a65c: 9a 13 62 70 or %o5, 0x270, %o5
*
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
201a660: 90 10 20 00 clr %o0
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201a664: 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);
201a668: 15 04 00 00 sethi %hi(0x10000000), %o2
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 ] )
201a66c: c2 03 40 00 ld [ %o5 ], %g1
201a670: 80 a0 60 00 cmp %g1, 0
201a674: 22 80 00 31 be,a 201a738 <killinfo+0x254> <== NEVER TAKEN
201a678: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED
continue;
the_info = _Objects_Information_table[ the_api ][ 1 ];
201a67c: c2 00 60 04 ld [ %g1 + 4 ], %g1
*/
if ( !the_info )
continue;
#endif
maximum = the_info->maximum;
201a680: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201a684: 80 a6 a0 00 cmp %i2, 0
201a688: 02 80 00 2b be 201a734 <killinfo+0x250>
201a68c: f0 00 60 1c ld [ %g1 + 0x1c ], %i0
201a690: 82 10 20 01 mov 1, %g1
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201a694: 85 28 60 02 sll %g1, 2, %g2
maximum = the_info->maximum;
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
the_thread = (Thread_Control *) object_table[ index ];
201a698: c4 06 00 02 ld [ %i0 + %g2 ], %g2
if ( !the_thread )
201a69c: 80 a0 a0 00 cmp %g2, 0
201a6a0: 22 80 00 22 be,a 201a728 <killinfo+0x244>
201a6a4: 82 00 60 01 inc %g1
/*
* If this thread is of lower priority than the interested thread,
* go on to the next thread.
*/
if ( the_thread->current_priority > interested_priority )
201a6a8: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3
201a6ac: 80 a0 c0 04 cmp %g3, %g4
201a6b0: 38 80 00 1e bgu,a 201a728 <killinfo+0x244>
201a6b4: 82 00 60 01 inc %g1
#if defined(RTEMS_DEBUG)
if ( !api )
continue;
#endif
if ( !_POSIX_signals_Is_interested( api, mask ) )
201a6b8: de 00 a1 5c ld [ %g2 + 0x15c ], %o7
201a6bc: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7
201a6c0: 80 af 40 0f andncc %i5, %o7, %g0
201a6c4: 22 80 00 19 be,a 201a728 <killinfo+0x244>
201a6c8: 82 00 60 01 inc %g1
*
* 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 ) {
201a6cc: 80 a0 c0 04 cmp %g3, %g4
201a6d0: 2a 80 00 14 bcs,a 201a720 <killinfo+0x23c>
201a6d4: 88 10 00 03 mov %g3, %g4
* and blocking interruptibutable by signal.
*
* If the interested thread is ready, don't think about changing.
*/
if ( interested && !_States_Is_ready( interested->current_state ) ) {
201a6d8: 80 a2 20 00 cmp %o0, 0
201a6dc: 22 80 00 13 be,a 201a728 <killinfo+0x244> <== NEVER TAKEN
201a6e0: 82 00 60 01 inc %g1 <== NOT EXECUTED
201a6e4: de 02 20 10 ld [ %o0 + 0x10 ], %o7
201a6e8: 80 a3 e0 00 cmp %o7, 0
201a6ec: 22 80 00 0f be,a 201a728 <killinfo+0x244> <== NEVER TAKEN
201a6f0: 82 00 60 01 inc %g1 <== NOT EXECUTED
/* preferred ready over blocked */
DEBUG_STEP("5");
if ( _States_Is_ready( the_thread->current_state ) ) {
201a6f4: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3
201a6f8: 80 a2 e0 00 cmp %o3, 0
201a6fc: 22 80 00 09 be,a 201a720 <killinfo+0x23c>
201a700: 88 10 00 03 mov %g3, %g4
continue;
}
DEBUG_STEP("6");
/* prefer blocked/interruptible over blocked/not interruptible */
if ( !_States_Is_interruptible_by_signal(interested->current_state) ) {
201a704: 80 8b c0 0a btst %o7, %o2
201a708: 32 80 00 08 bne,a 201a728 <killinfo+0x244>
201a70c: 82 00 60 01 inc %g1
DEBUG_STEP("7");
if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) {
201a710: 80 8a c0 0a btst %o3, %o2
201a714: 22 80 00 05 be,a 201a728 <killinfo+0x244>
201a718: 82 00 60 01 inc %g1
*/
if ( interested && !_States_Is_ready( interested->current_state ) ) {
/* preferred ready over blocked */
DEBUG_STEP("5");
if ( _States_Is_ready( the_thread->current_state ) ) {
201a71c: 88 10 00 03 mov %g3, %g4
201a720: 90 10 00 02 mov %g2, %o0
#endif
maximum = the_info->maximum;
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201a724: 82 00 60 01 inc %g1
201a728: 80 a6 80 01 cmp %i2, %g1
201a72c: 1a bf ff db bcc 201a698 <killinfo+0x1b4>
201a730: 85 28 60 02 sll %g1, 2, %g2
201a734: 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++) {
201a738: 80 a3 40 0c cmp %o5, %o4
201a73c: 32 bf ff cd bne,a 201a670 <killinfo+0x18c>
201a740: c2 03 40 00 ld [ %o5 ], %g1
}
}
}
}
if ( interested ) {
201a744: 80 a2 20 00 cmp %o0, 0
201a748: 02 bf ff af be 201a604 <killinfo+0x120>
201a74c: 92 10 00 19 mov %i1, %o1
/*
* 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 ) ) {
201a750: 40 00 00 35 call 201a824 <_POSIX_signals_Unblock_thread>
201a754: 94 07 bf f4 add %fp, -12, %o2
201a758: 80 8a 20 ff btst 0xff, %o0
201a75c: 02 bf ff aa be 201a604 <killinfo+0x120> <== ALWAYS TAKEN
201a760: 01 00 00 00 nop
_Thread_Enable_dispatch();
201a764: 7f ff bb 22 call 20093ec <_Thread_Enable_dispatch>
201a768: b0 10 20 00 clr %i0 ! 0 <PROM_START>
return 0;
201a76c: 81 c7 e0 08 ret
201a770: 81 e8 00 00 restore
*/
_POSIX_signals_Set_process_signals( mask );
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
psiginfo = (POSIX_signals_Siginfo_node *)
201a774: 7f ff b3 3a call 200745c <_Chain_Get>
201a778: 90 12 22 20 or %o0, 0x220, %o0
_Chain_Get( &_POSIX_signals_Inactive_siginfo );
if ( !psiginfo ) {
201a77c: 92 92 20 00 orcc %o0, 0, %o1
201a780: 02 80 00 18 be 201a7e0 <killinfo+0x2fc>
201a784: 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 );
201a788: 11 00 80 78 sethi %hi(0x201e000), %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201a78c: c2 22 60 08 st %g1, [ %o1 + 8 ]
201a790: c2 07 bf f8 ld [ %fp + -8 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201a794: 90 12 22 98 or %o0, 0x298, %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201a798: c2 22 60 0c st %g1, [ %o1 + 0xc ]
201a79c: c2 07 bf fc ld [ %fp + -4 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201a7a0: 90 02 00 1b add %o0, %i3, %o0
201a7a4: 7f ff b3 1a call 200740c <_Chain_Append>
201a7a8: c2 22 60 10 st %g1, [ %o1 + 0x10 ]
201a7ac: 30 bf ff 9d b,a 201a620 <killinfo+0x13c>
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid != getpid() )
rtems_set_errno_and_return_minus_one( ESRCH );
201a7b0: 7f ff d4 c7 call 200facc <__errno>
201a7b4: b0 10 3f ff mov -1, %i0
201a7b8: 82 10 20 03 mov 3, %g1
201a7bc: c2 22 00 00 st %g1, [ %o0 ]
201a7c0: 81 c7 e0 08 ret
201a7c4: 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 );
201a7c8: 7f ff d4 c1 call 200facc <__errno>
201a7cc: b0 10 3f ff mov -1, %i0
201a7d0: 82 10 20 16 mov 0x16, %g1
201a7d4: c2 22 00 00 st %g1, [ %o0 ]
201a7d8: 81 c7 e0 08 ret
201a7dc: 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();
201a7e0: 7f ff bb 03 call 20093ec <_Thread_Enable_dispatch>
201a7e4: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
201a7e8: 7f ff d4 b9 call 200facc <__errno>
201a7ec: 01 00 00 00 nop
201a7f0: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
201a7f4: c2 22 00 00 st %g1, [ %o0 ]
201a7f8: 81 c7 e0 08 ret
201a7fc: 81 e8 00 00 restore
0200b434 <mq_open>:
int oflag,
...
/* mode_t mode, */
/* struct mq_attr attr */
)
{
200b434: 9d e3 bf 90 save %sp, -112, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
200b438: 03 00 80 9e sethi %hi(0x2027800), %g1
200b43c: c4 00 62 90 ld [ %g1 + 0x290 ], %g2 ! 2027a90 <_Thread_Dispatch_disable_level>
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
200b440: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
200b444: 84 00 a0 01 inc %g2
200b448: c4 20 62 90 st %g2, [ %g1 + 0x290 ]
return _Thread_Dispatch_disable_level;
200b44c: c2 00 62 90 ld [ %g1 + 0x290 ], %g1
200b450: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
200b454: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
200b458: fa 27 a0 58 st %i5, [ %fp + 0x58 ]
POSIX_Message_queue_Control_fd *the_mq_fd;
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
200b45c: a0 8e 62 00 andcc %i1, 0x200, %l0
200b460: 12 80 00 34 bne 200b530 <mq_open+0xfc>
200b464: b4 10 20 00 clr %i2
*/
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *
_POSIX_Message_queue_Allocate_fd( void )
{
return (POSIX_Message_queue_Control_fd *)
200b468: 39 00 80 9f sethi %hi(0x2027c00), %i4
200b46c: 40 00 0c 74 call 200e63c <_Objects_Allocate>
200b470: 90 17 23 5c or %i4, 0x35c, %o0 ! 2027f5c <_POSIX_Message_queue_Information_fds>
attr = (struct mq_attr *) va_arg( arg, struct mq_attr * );
va_end(arg);
}
the_mq_fd = _POSIX_Message_queue_Allocate_fd();
if ( !the_mq_fd ) {
200b474: ba 92 20 00 orcc %o0, 0, %i5
200b478: 02 80 00 37 be 200b554 <mq_open+0x120> <== NEVER TAKEN
200b47c: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( ENFILE );
}
the_mq_fd->oflag = oflag;
200b480: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id );
200b484: 90 10 00 18 mov %i0, %o0
200b488: 40 00 1e f5 call 201305c <_POSIX_Message_queue_Name_to_id>
200b48c: 92 07 bf f4 add %fp, -12, %o1
* 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 ) {
200b490: b6 92 20 00 orcc %o0, 0, %i3
200b494: 22 80 00 0f be,a 200b4d0 <mq_open+0x9c>
200b498: 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) ) ) {
200b49c: 80 a6 e0 02 cmp %i3, 2
200b4a0: 02 80 00 40 be 200b5a0 <mq_open+0x16c>
200b4a4: 80 a4 20 00 cmp %l0, 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 );
200b4a8: 90 17 23 5c or %i4, 0x35c, %o0
200b4ac: 40 00 0d 4e call 200e9e4 <_Objects_Free>
200b4b0: 92 10 00 1d mov %i5, %o1
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
200b4b4: 40 00 11 9e call 200fb2c <_Thread_Enable_dispatch>
200b4b8: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, mqd_t );
200b4bc: 40 00 2d a7 call 2016b58 <__errno>
200b4c0: 01 00 00 00 nop
200b4c4: f6 22 00 00 st %i3, [ %o0 ]
200b4c8: 81 c7 e0 08 ret
200b4cc: 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) ) {
200b4d0: 80 a6 6a 00 cmp %i1, 0xa00
200b4d4: 02 80 00 28 be 200b574 <mq_open+0x140>
200b4d8: d2 07 bf f4 ld [ %fp + -12 ], %o1
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (POSIX_Message_queue_Control *)
200b4dc: 94 07 bf fc add %fp, -4, %o2
200b4e0: 11 00 80 9f sethi %hi(0x2027c00), %o0
200b4e4: 40 00 0d a1 call 200eb68 <_Objects_Get>
200b4e8: 90 12 21 d0 or %o0, 0x1d0, %o0 ! 2027dd0 <_POSIX_Message_queue_Information>
/*
* 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;
200b4ec: c4 02 20 18 ld [ %o0 + 0x18 ], %g2
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
200b4f0: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
200b4f4: 84 00 a0 01 inc %g2
);
_Thread_Enable_dispatch();
return (mqd_t) the_mq_fd->Object.id;
}
200b4f8: b8 17 23 5c or %i4, 0x35c, %i4
/*
* 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;
200b4fc: c4 22 20 18 st %g2, [ %o0 + 0x18 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200b500: 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 );
200b504: d0 27 bf f8 st %o0, [ %fp + -8 ]
the_mq->open_count += 1;
the_mq_fd->Queue = the_mq;
200b508: d0 27 60 10 st %o0, [ %i5 + 0x10 ]
200b50c: 83 28 60 02 sll %g1, 2, %g1
200b510: fa 20 80 01 st %i5, [ %g2 + %g1 ]
_Objects_Open_string(
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
200b514: 40 00 11 86 call 200fb2c <_Thread_Enable_dispatch>
200b518: c0 27 60 0c clr [ %i5 + 0xc ]
_Thread_Enable_dispatch();
200b51c: 40 00 11 84 call 200fb2c <_Thread_Enable_dispatch>
200b520: 01 00 00 00 nop
return (mqd_t)the_mq_fd->Object.id;
200b524: f0 07 60 08 ld [ %i5 + 8 ], %i0
200b528: 81 c7 e0 08 ret
200b52c: 81 e8 00 00 restore
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
mode = (mode_t) va_arg( arg, unsigned int );
attr = (struct mq_attr *) va_arg( arg, struct mq_attr * );
200b530: 82 07 a0 54 add %fp, 0x54, %g1
200b534: f4 07 a0 50 ld [ %fp + 0x50 ], %i2
200b538: c2 27 bf f0 st %g1, [ %fp + -16 ]
*/
RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd *
_POSIX_Message_queue_Allocate_fd( void )
{
return (POSIX_Message_queue_Control_fd *)
200b53c: 39 00 80 9f sethi %hi(0x2027c00), %i4
200b540: 40 00 0c 3f call 200e63c <_Objects_Allocate>
200b544: 90 17 23 5c or %i4, 0x35c, %o0 ! 2027f5c <_POSIX_Message_queue_Information_fds>
va_end(arg);
}
the_mq_fd = _POSIX_Message_queue_Allocate_fd();
if ( !the_mq_fd ) {
200b548: ba 92 20 00 orcc %o0, 0, %i5
200b54c: 32 bf ff ce bne,a 200b484 <mq_open+0x50>
200b550: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_Thread_Enable_dispatch();
200b554: 40 00 11 76 call 200fb2c <_Thread_Enable_dispatch>
200b558: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( ENFILE );
200b55c: 40 00 2d 7f call 2016b58 <__errno>
200b560: 01 00 00 00 nop
200b564: 82 10 20 17 mov 0x17, %g1 ! 17 <PROM_START+0x17>
200b568: c2 22 00 00 st %g1, [ %o0 ]
200b56c: 81 c7 e0 08 ret
200b570: 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 );
200b574: 90 17 23 5c or %i4, 0x35c, %o0
200b578: 40 00 0d 1b call 200e9e4 <_Objects_Free>
200b57c: 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();
200b580: 40 00 11 6b call 200fb2c <_Thread_Enable_dispatch>
200b584: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t );
200b588: 40 00 2d 74 call 2016b58 <__errno>
200b58c: 01 00 00 00 nop
200b590: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
200b594: c2 22 00 00 st %g1, [ %o0 ]
200b598: 81 c7 e0 08 ret
200b59c: 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) ) ) {
200b5a0: 02 bf ff c3 be 200b4ac <mq_open+0x78>
200b5a4: 90 17 23 5c or %i4, 0x35c, %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(
200b5a8: 90 10 00 18 mov %i0, %o0
200b5ac: 92 10 20 01 mov 1, %o1
200b5b0: 94 10 00 1a mov %i2, %o2
200b5b4: 40 00 1e 45 call 2012ec8 <_POSIX_Message_queue_Create_support>
200b5b8: 96 07 bf f8 add %fp, -8, %o3
);
/*
* errno was set by Create_support, so don't set it again.
*/
if ( status == -1 ) {
200b5bc: 80 a2 3f ff cmp %o0, -1
200b5c0: 02 80 00 0d be 200b5f4 <mq_open+0x1c0>
200b5c4: c6 07 bf f8 ld [ %fp + -8 ], %g3
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
200b5c8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
);
_Thread_Enable_dispatch();
return (mqd_t) the_mq_fd->Object.id;
}
200b5cc: b8 17 23 5c or %i4, 0x35c, %i4
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200b5d0: 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;
200b5d4: c6 27 60 10 st %g3, [ %i5 + 0x10 ]
200b5d8: 83 28 60 02 sll %g1, 2, %g1
200b5dc: fa 20 80 01 st %i5, [ %g2 + %g1 ]
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
200b5e0: 40 00 11 53 call 200fb2c <_Thread_Enable_dispatch>
200b5e4: c0 27 60 0c clr [ %i5 + 0xc ]
return (mqd_t) the_mq_fd->Object.id;
200b5e8: f0 07 60 08 ld [ %i5 + 8 ], %i0
}
200b5ec: 81 c7 e0 08 ret
200b5f0: 81 e8 00 00 restore
200b5f4: 90 17 23 5c or %i4, 0x35c, %o0
200b5f8: 92 10 00 1d mov %i5, %o1
200b5fc: 40 00 0c fa call 200e9e4 <_Objects_Free>
200b600: 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();
200b604: 40 00 11 4a call 200fb2c <_Thread_Enable_dispatch>
200b608: 01 00 00 00 nop
return (mqd_t) -1;
200b60c: 81 c7 e0 08 ret
200b610: 81 e8 00 00 restore
0200ba9c <pthread_attr_setschedpolicy>:
int pthread_attr_setschedpolicy(
pthread_attr_t *attr,
int policy
)
{
200ba9c: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
200baa0: 80 a0 60 00 cmp %g1, 0
200baa4: 02 80 00 06 be 200babc <pthread_attr_setschedpolicy+0x20>
200baa8: 90 10 20 16 mov 0x16, %o0
200baac: c4 00 40 00 ld [ %g1 ], %g2
200bab0: 80 a0 a0 00 cmp %g2, 0
200bab4: 12 80 00 04 bne 200bac4 <pthread_attr_setschedpolicy+0x28>
200bab8: 80 a2 60 04 cmp %o1, 4
return 0;
default:
return ENOTSUP;
}
}
200babc: 81 c3 e0 08 retl
200bac0: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( policy ) {
200bac4: 18 80 00 09 bgu 200bae8 <pthread_attr_setschedpolicy+0x4c>
200bac8: 84 10 20 01 mov 1, %g2 ! 1 <PROM_START+0x1>
200bacc: 85 28 80 09 sll %g2, %o1, %g2
200bad0: 80 88 a0 17 btst 0x17, %g2
200bad4: 02 80 00 05 be 200bae8 <pthread_attr_setschedpolicy+0x4c> <== NEVER TAKEN
200bad8: 01 00 00 00 nop
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
case SCHED_SPORADIC:
attr->schedpolicy = policy;
200badc: d2 20 60 14 st %o1, [ %g1 + 0x14 ]
return 0;
200bae0: 81 c3 e0 08 retl
200bae4: 90 10 20 00 clr %o0
default:
return ENOTSUP;
}
}
200bae8: 81 c3 e0 08 retl
200baec: 90 10 20 86 mov 0x86, %o0
02006880 <pthread_barrier_init>:
int pthread_barrier_init(
pthread_barrier_t *barrier,
const pthread_barrierattr_t *attr,
unsigned int count
)
{
2006880: 9d e3 bf 90 save %sp, -112, %sp
2006884: ba 10 00 18 mov %i0, %i5
const pthread_barrierattr_t *the_attr;
/*
* Error check parameters
*/
if ( !barrier )
2006888: 80 a7 60 00 cmp %i5, 0
200688c: 02 80 00 27 be 2006928 <pthread_barrier_init+0xa8>
2006890: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( count == 0 )
2006894: 80 a6 a0 00 cmp %i2, 0
2006898: 02 80 00 24 be 2006928 <pthread_barrier_init+0xa8>
200689c: 80 a6 60 00 cmp %i1, 0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
20068a0: 02 80 00 24 be 2006930 <pthread_barrier_init+0xb0>
20068a4: 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 )
20068a8: c2 06 40 00 ld [ %i1 ], %g1
20068ac: 80 a0 60 00 cmp %g1, 0
20068b0: 02 80 00 1e be 2006928 <pthread_barrier_init+0xa8>
20068b4: b0 10 20 16 mov 0x16, %i0
return EINVAL;
switch ( the_attr->process_shared ) {
20068b8: c2 06 60 04 ld [ %i1 + 4 ], %g1
20068bc: 80 a0 60 00 cmp %g1, 0
20068c0: 12 80 00 1a bne 2006928 <pthread_barrier_init+0xa8> <== NEVER TAKEN
20068c4: 03 00 80 61 sethi %hi(0x2018400), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20068c8: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 20185c0 <_Thread_Dispatch_disable_level>
}
/*
* Convert from POSIX attributes to Core Barrier attributes
*/
the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE;
20068cc: c0 27 bf f0 clr [ %fp + -16 ]
20068d0: 84 00 a0 01 inc %g2
the_attributes.maximum_count = count;
20068d4: f4 27 bf f4 st %i2, [ %fp + -12 ]
20068d8: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ]
return _Thread_Dispatch_disable_level;
20068dc: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1
* 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 *)
20068e0: 37 00 80 62 sethi %hi(0x2018800), %i3
20068e4: 40 00 08 c8 call 2008c04 <_Objects_Allocate>
20068e8: 90 16 e1 80 or %i3, 0x180, %o0 ! 2018980 <_POSIX_Barrier_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
20068ec: b8 92 20 00 orcc %o0, 0, %i4
20068f0: 02 80 00 14 be 2006940 <pthread_barrier_init+0xc0>
20068f4: 90 07 20 10 add %i4, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes );
20068f8: 40 00 06 0a call 2008120 <_CORE_barrier_Initialize>
20068fc: 92 07 bf f0 add %fp, -16, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2006900: c4 17 20 0a lduh [ %i4 + 0xa ], %g2
* Exit the critical section and return the user an operational barrier
*/
*barrier = the_barrier->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2006904: b6 16 e1 80 or %i3, 0x180, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2006908: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
200690c: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2006910: 85 28 a0 02 sll %g2, 2, %g2
2006914: f8 20 c0 02 st %i4, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
2006918: c0 27 20 0c clr [ %i4 + 0xc ]
);
/*
* Exit the critical section and return the user an operational barrier
*/
*barrier = the_barrier->Object.id;
200691c: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
2006920: 40 00 0d d6 call 200a078 <_Thread_Enable_dispatch>
2006924: b0 10 20 00 clr %i0
return 0;
}
2006928: 81 c7 e0 08 ret
200692c: 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 );
2006930: 7f ff ff 9c call 20067a0 <pthread_barrierattr_init>
2006934: 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 )
2006938: 10 bf ff dd b 20068ac <pthread_barrier_init+0x2c>
200693c: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
_Thread_Enable_dispatch();
2006940: 40 00 0d ce call 200a078 <_Thread_Enable_dispatch>
2006944: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
2006948: 81 c7 e0 08 ret
200694c: 81 e8 00 00 restore
0200611c <pthread_cleanup_push>:
void pthread_cleanup_push(
void (*routine)( void * ),
void *arg
)
{
200611c: 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 )
2006120: 80 a6 20 00 cmp %i0, 0
2006124: 02 80 00 16 be 200617c <pthread_cleanup_push+0x60>
2006128: 01 00 00 00 nop
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
200612c: 03 00 80 62 sethi %hi(0x2018800), %g1
2006130: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 2018b00 <_Thread_Dispatch_disable_level>
2006134: 84 00 a0 01 inc %g2
2006138: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
200613c: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
return;
_Thread_Disable_dispatch();
handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) );
2006140: 40 00 12 f5 call 200ad14 <_Workspace_Allocate>
2006144: 90 10 20 10 mov 0x10, %o0
if ( handler ) {
2006148: 80 a2 20 00 cmp %o0, 0
200614c: 02 80 00 0a be 2006174 <pthread_cleanup_push+0x58> <== NEVER TAKEN
2006150: 01 00 00 00 nop
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
2006154: 03 00 80 64 sethi %hi(0x2019000), %g1
2006158: c2 00 60 4c ld [ %g1 + 0x4c ], %g1 ! 201904c <_Per_CPU_Information+0xc>
handler_stack = &thread_support->Cancellation_Handlers;
handler->routine = routine;
handler->arg = arg;
_Chain_Append( handler_stack, &handler->Node );
200615c: 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;
2006160: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
handler->routine = routine;
2006164: f0 22 20 08 st %i0, [ %o0 + 8 ]
handler->arg = arg;
2006168: f2 22 20 0c st %i1, [ %o0 + 0xc ]
_Chain_Append( handler_stack, &handler->Node );
200616c: 40 00 06 50 call 2007aac <_Chain_Append>
2006170: 90 00 60 e4 add %g1, 0xe4, %o0
}
_Thread_Enable_dispatch();
2006174: 40 00 0e 1a call 20099dc <_Thread_Enable_dispatch>
2006178: 81 e8 00 00 restore
200617c: 81 c7 e0 08 ret
2006180: 81 e8 00 00 restore
02007088 <pthread_cond_init>:
int pthread_cond_init(
pthread_cond_t *cond,
const pthread_condattr_t *attr
)
{
2007088: 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;
200708c: 80 a6 60 00 cmp %i1, 0
2007090: 02 80 00 27 be 200712c <pthread_cond_init+0xa4>
2007094: ba 10 00 18 mov %i0, %i5
else the_attr = &_POSIX_Condition_variables_Default_attributes;
/*
* Be careful about attributes when global!!!
*/
if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED )
2007098: c2 06 60 04 ld [ %i1 + 4 ], %g1
200709c: 80 a0 60 01 cmp %g1, 1
20070a0: 02 80 00 21 be 2007124 <pthread_cond_init+0x9c> <== NEVER TAKEN
20070a4: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( !the_attr->is_initialized )
20070a8: c2 06 40 00 ld [ %i1 ], %g1
20070ac: 80 a0 60 00 cmp %g1, 0
20070b0: 02 80 00 1d be 2007124 <pthread_cond_init+0x9c>
20070b4: 03 00 80 65 sethi %hi(0x2019400), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20070b8: c4 00 63 00 ld [ %g1 + 0x300 ], %g2 ! 2019700 <_Thread_Dispatch_disable_level>
20070bc: 84 00 a0 01 inc %g2
20070c0: c4 20 63 00 st %g2, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
20070c4: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
*/
RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control
*_POSIX_Condition_variables_Allocate( void )
{
return (POSIX_Condition_variables_Control *)
20070c8: 37 00 80 66 sethi %hi(0x2019800), %i3
20070cc: 40 00 0a 61 call 2009a50 <_Objects_Allocate>
20070d0: 90 16 e3 58 or %i3, 0x358, %o0 ! 2019b58 <_POSIX_Condition_variables_Information>
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
20070d4: b8 92 20 00 orcc %o0, 0, %i4
20070d8: 02 80 00 18 be 2007138 <pthread_cond_init+0xb0>
20070dc: 90 07 20 18 add %i4, 0x18, %o0
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
20070e0: c2 06 60 04 ld [ %i1 + 4 ], %g1
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
20070e4: 92 10 20 00 clr %o1
20070e8: 15 04 00 02 sethi %hi(0x10000800), %o2
20070ec: 96 10 20 74 mov 0x74, %o3
if ( !the_cond ) {
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
20070f0: c2 27 20 10 st %g1, [ %i4 + 0x10 ]
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
20070f4: 40 00 11 9f call 200b770 <_Thread_queue_Initialize>
20070f8: c0 27 20 14 clr [ %i4 + 0x14 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
20070fc: c4 17 20 0a lduh [ %i4 + 0xa ], %g2
*cond = the_cond->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2007100: b6 16 e3 58 or %i3, 0x358, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007104: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007108: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200710c: 85 28 a0 02 sll %g2, 2, %g2
2007110: f8 20 c0 02 st %i4, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
2007114: c0 27 20 0c clr [ %i4 + 0xc ]
&_POSIX_Condition_variables_Information,
&the_cond->Object,
0
);
*cond = the_cond->Object.id;
2007118: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
200711c: 40 00 0f 6a call 200aec4 <_Thread_Enable_dispatch>
2007120: b0 10 20 00 clr %i0
return 0;
}
2007124: 81 c7 e0 08 ret
2007128: 81 e8 00 00 restore
{
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;
200712c: 33 00 80 5f sethi %hi(0x2017c00), %i1
2007130: 10 bf ff da b 2007098 <pthread_cond_init+0x10>
2007134: b2 16 62 b4 or %i1, 0x2b4, %i1 ! 2017eb4 <_POSIX_Condition_variables_Default_attributes>
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
_Thread_Enable_dispatch();
2007138: 40 00 0f 63 call 200aec4 <_Thread_Enable_dispatch>
200713c: b0 10 20 0c mov 0xc, %i0
return ENOMEM;
2007140: 81 c7 e0 08 ret
2007144: 81 e8 00 00 restore
02006eec <pthread_condattr_destroy>:
*/
int pthread_condattr_destroy(
pthread_condattr_t *attr
)
{
2006eec: 82 10 00 08 mov %o0, %g1
if ( !attr || attr->is_initialized == false )
2006ef0: 80 a0 60 00 cmp %g1, 0
2006ef4: 02 80 00 06 be 2006f0c <pthread_condattr_destroy+0x20>
2006ef8: 90 10 20 16 mov 0x16, %o0
2006efc: c4 00 40 00 ld [ %g1 ], %g2
2006f00: 80 a0 a0 00 cmp %g2, 0
2006f04: 32 80 00 04 bne,a 2006f14 <pthread_condattr_destroy+0x28><== ALWAYS TAKEN
2006f08: c0 20 40 00 clr [ %g1 ]
return EINVAL;
attr->is_initialized = false;
return 0;
}
2006f0c: 81 c3 e0 08 retl
2006f10: 01 00 00 00 nop
2006f14: 81 c3 e0 08 retl
2006f18: 90 10 20 00 clr %o0 ! 0 <PROM_START>
020065c4 <pthread_create>:
pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine)( void * ),
void *arg
)
{
20065c4: 9d e3 bf 58 save %sp, -168, %sp
20065c8: ba 10 00 18 mov %i0, %i5
int schedpolicy = SCHED_RR;
struct sched_param schedparam;
Objects_Name name;
int rc;
if ( !start_routine )
20065cc: 80 a6 a0 00 cmp %i2, 0
20065d0: 02 80 00 63 be 200675c <pthread_create+0x198>
20065d4: b0 10 20 0e mov 0xe, %i0
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
20065d8: 80 a6 60 00 cmp %i1, 0
20065dc: 22 80 00 62 be,a 2006764 <pthread_create+0x1a0>
20065e0: 33 00 80 72 sethi %hi(0x201c800), %i1
if ( !the_attr->is_initialized )
20065e4: c2 06 40 00 ld [ %i1 ], %g1
20065e8: 80 a0 60 00 cmp %g1, 0
20065ec: 02 80 00 5c be 200675c <pthread_create+0x198>
20065f0: b0 10 20 16 mov 0x16, %i0
* 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) )
20065f4: c2 06 60 04 ld [ %i1 + 4 ], %g1
20065f8: 80 a0 60 00 cmp %g1, 0
20065fc: 02 80 00 07 be 2006618 <pthread_create+0x54>
2006600: 03 00 80 76 sethi %hi(0x201d800), %g1
2006604: c4 06 60 08 ld [ %i1 + 8 ], %g2
2006608: c2 00 60 10 ld [ %g1 + 0x10 ], %g1
200660c: 80 a0 80 01 cmp %g2, %g1
2006610: 0a 80 00 83 bcs 200681c <pthread_create+0x258>
2006614: 01 00 00 00 nop
* 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 ) {
2006618: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200661c: 80 a0 60 01 cmp %g1, 1
2006620: 02 80 00 53 be 200676c <pthread_create+0x1a8>
2006624: 80 a0 60 02 cmp %g1, 2
2006628: 12 80 00 4d bne 200675c <pthread_create+0x198>
200662c: b0 10 20 16 mov 0x16, %i0
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
schedparam = the_attr->schedparam;
2006630: da 06 60 18 ld [ %i1 + 0x18 ], %o5
2006634: de 06 60 1c ld [ %i1 + 0x1c ], %o7
2006638: f0 06 60 20 ld [ %i1 + 0x20 ], %i0
200663c: c8 06 60 24 ld [ %i1 + 0x24 ], %g4
2006640: c6 06 60 28 ld [ %i1 + 0x28 ], %g3
2006644: c4 06 60 2c ld [ %i1 + 0x2c ], %g2
2006648: c2 06 60 30 ld [ %i1 + 0x30 ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
200664c: f8 06 60 14 ld [ %i1 + 0x14 ], %i4
schedparam = the_attr->schedparam;
2006650: da 27 bf dc st %o5, [ %fp + -36 ]
2006654: de 27 bf e0 st %o7, [ %fp + -32 ]
2006658: f0 27 bf e4 st %i0, [ %fp + -28 ]
200665c: c8 27 bf e8 st %g4, [ %fp + -24 ]
2006660: c6 27 bf ec st %g3, [ %fp + -20 ]
2006664: c4 27 bf f0 st %g2, [ %fp + -16 ]
2006668: c2 27 bf f4 st %g1, [ %fp + -12 ]
/*
* Check the contentionscope since rtems only supports PROCESS wide
* contention (i.e. no system wide contention).
*/
if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS )
200666c: c2 06 60 0c ld [ %i1 + 0xc ], %g1
2006670: 80 a0 60 00 cmp %g1, 0
2006674: 12 80 00 3a bne 200675c <pthread_create+0x198>
2006678: b0 10 20 86 mov 0x86, %i0
return ENOTSUP;
/*
* Interpret the scheduling parameters.
*/
if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) )
200667c: d0 07 bf dc ld [ %fp + -36 ], %o0
2006680: 40 00 1c 3a call 200d768 <_POSIX_Priority_Is_valid>
2006684: b0 10 20 16 mov 0x16, %i0
2006688: 80 8a 20 ff btst 0xff, %o0
200668c: 02 80 00 34 be 200675c <pthread_create+0x198> <== NEVER TAKEN
2006690: 03 00 80 76 sethi %hi(0x201d800), %g1
return EINVAL;
core_priority = _POSIX_Priority_To_core( schedparam.sched_priority );
2006694: e4 07 bf dc ld [ %fp + -36 ], %l2
RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core(
int priority
)
{
return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1);
2006698: e6 08 60 0c ldub [ %g1 + 0xc ], %l3
/*
* Set the core scheduling policy information.
*/
rc = _POSIX_Thread_Translate_sched_param(
200669c: 90 10 00 1c mov %i4, %o0
20066a0: 92 07 bf dc add %fp, -36, %o1
20066a4: 94 07 bf f8 add %fp, -8, %o2
20066a8: 40 00 1c 3d call 200d79c <_POSIX_Thread_Translate_sched_param>
20066ac: 96 07 bf fc add %fp, -4, %o3
schedpolicy,
&schedparam,
&budget_algorithm,
&budget_callout
);
if ( rc )
20066b0: b0 92 20 00 orcc %o0, 0, %i0
20066b4: 12 80 00 2a bne 200675c <pthread_create+0x198>
20066b8: 23 00 80 79 sethi %hi(0x201e400), %l1
#endif
/*
* Lock the allocator mutex for protection
*/
_RTEMS_Lock_allocator();
20066bc: d0 04 61 a4 ld [ %l1 + 0x1a4 ], %o0 ! 201e5a4 <_RTEMS_Allocator_Mutex>
20066c0: 40 00 06 81 call 20080c4 <_API_Mutex_Lock>
20066c4: 29 00 80 79 sethi %hi(0x201e400), %l4
* _POSIX_Threads_Allocate
*/
RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void )
{
return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information );
20066c8: 40 00 09 4f call 2008c04 <_Objects_Allocate>
20066cc: 90 15 23 40 or %l4, 0x340, %o0 ! 201e740 <_POSIX_Threads_Information>
* Allocate the thread control block.
*
* NOTE: Global threads are not currently supported.
*/
the_thread = _POSIX_Threads_Allocate();
if ( !the_thread ) {
20066d0: a0 92 20 00 orcc %o0, 0, %l0
20066d4: 02 80 00 1f be 2006750 <pthread_create+0x18c>
20066d8: 05 00 80 76 sethi %hi(0x201d800), %g2
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
20066dc: 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 )
20066e0: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
20066e4: c0 27 bf d4 clr [ %fp + -44 ]
static inline size_t _POSIX_Threads_Ensure_minimum_stack (
size_t size
)
{
if ( size >= PTHREAD_MINIMUM_STACK_SIZE )
20066e8: 97 2a e0 01 sll %o3, 1, %o3
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
20066ec: 80 a2 c0 01 cmp %o3, %g1
20066f0: 1a 80 00 03 bcc 20066fc <pthread_create+0x138>
20066f4: d4 06 60 04 ld [ %i1 + 4 ], %o2
20066f8: 96 10 00 01 mov %g1, %o3
20066fc: c2 07 bf f8 ld [ %fp + -8 ], %g1
2006700: 9a 0c e0 ff and %l3, 0xff, %o5
2006704: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2006708: 82 10 20 01 mov 1, %g1
200670c: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2006710: c2 07 bf fc ld [ %fp + -4 ], %g1
2006714: c0 23 a0 68 clr [ %sp + 0x68 ]
2006718: c2 23 a0 64 st %g1, [ %sp + 0x64 ]
200671c: 82 07 bf d4 add %fp, -44, %g1
2006720: 90 15 23 40 or %l4, 0x340, %o0
2006724: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2006728: 92 10 00 10 mov %l0, %o1
200672c: 98 10 20 01 mov 1, %o4
2006730: 40 00 0e 8b call 200a15c <_Thread_Initialize>
2006734: 9a 23 40 12 sub %o5, %l2, %o5
budget_callout,
0, /* isr level */
name /* posix threads don't have a name */
);
if ( !status ) {
2006738: 80 8a 20 ff btst 0xff, %o0
200673c: 12 80 00 1f bne 20067b8 <pthread_create+0x1f4>
2006740: 11 00 80 79 sethi %hi(0x201e400), %o0
RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free (
Thread_Control *the_pthread
)
{
_Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object );
2006744: 92 10 00 10 mov %l0, %o1
2006748: 40 00 0a 19 call 2008fac <_Objects_Free>
200674c: 90 12 23 40 or %o0, 0x340, %o0
_POSIX_Threads_Free( the_thread );
_RTEMS_Unlock_allocator();
2006750: d0 04 61 a4 ld [ %l1 + 0x1a4 ], %o0
2006754: 40 00 06 71 call 2008118 <_API_Mutex_Unlock>
2006758: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
200675c: 81 c7 e0 08 ret
2006760: 81 e8 00 00 restore
int rc;
if ( !start_routine )
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
2006764: 10 bf ff a0 b 20065e4 <pthread_create+0x20>
2006768: b2 16 62 dc or %i1, 0x2dc, %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 ];
200676c: 03 00 80 7a sethi %hi(0x201e800), %g1
2006770: c2 00 62 4c ld [ %g1 + 0x24c ], %g1 ! 201ea4c <_Per_CPU_Information+0xc>
2006774: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
2006778: d8 00 60 88 ld [ %g1 + 0x88 ], %o4
200677c: da 00 60 8c ld [ %g1 + 0x8c ], %o5
2006780: de 00 60 90 ld [ %g1 + 0x90 ], %o7
2006784: f0 00 60 94 ld [ %g1 + 0x94 ], %i0
2006788: c8 00 60 98 ld [ %g1 + 0x98 ], %g4
200678c: c6 00 60 9c ld [ %g1 + 0x9c ], %g3
2006790: 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;
2006794: f8 00 60 84 ld [ %g1 + 0x84 ], %i4
schedparam = api->schedparam;
2006798: d8 27 bf dc st %o4, [ %fp + -36 ]
200679c: da 27 bf e0 st %o5, [ %fp + -32 ]
20067a0: de 27 bf e4 st %o7, [ %fp + -28 ]
20067a4: f0 27 bf e8 st %i0, [ %fp + -24 ]
20067a8: c8 27 bf ec st %g4, [ %fp + -20 ]
20067ac: c6 27 bf f0 st %g3, [ %fp + -16 ]
break;
20067b0: 10 bf ff af b 200666c <pthread_create+0xa8>
20067b4: c4 27 bf f4 st %g2, [ %fp + -12 ]
}
/*
* finish initializing the per API structure
*/
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
20067b8: e4 04 21 5c ld [ %l0 + 0x15c ], %l2
api->Attributes = *the_attr;
20067bc: 92 10 00 19 mov %i1, %o1
20067c0: 94 10 20 40 mov 0x40, %o2
20067c4: 40 00 29 2a call 2010c6c <memcpy>
20067c8: 90 10 00 12 mov %l2, %o0
api->detachstate = the_attr->detachstate;
20067cc: c2 06 60 3c ld [ %i1 + 0x3c ], %g1
api->schedpolicy = schedpolicy;
api->schedparam = schedparam;
20067d0: 92 07 bf dc add %fp, -36, %o1
20067d4: 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;
20067d8: c2 24 a0 40 st %g1, [ %l2 + 0x40 ]
api->schedpolicy = schedpolicy;
20067dc: f8 24 a0 84 st %i4, [ %l2 + 0x84 ]
api->schedparam = schedparam;
20067e0: 40 00 29 23 call 2010c6c <memcpy>
20067e4: 90 04 a0 88 add %l2, 0x88, %o0
/*
* POSIX threads are allocated and started in one operation.
*/
status = _Thread_Start(
20067e8: 90 10 00 10 mov %l0, %o0
20067ec: 92 10 20 01 mov 1, %o1
20067f0: 94 10 00 1a mov %i2, %o2
20067f4: 96 10 00 1b mov %i3, %o3
20067f8: 40 00 10 dd call 200ab6c <_Thread_Start>
20067fc: 98 10 20 00 clr %o4
_RTEMS_Unlock_allocator();
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
2006800: 80 a7 20 04 cmp %i4, 4
2006804: 02 80 00 08 be 2006824 <pthread_create+0x260>
2006808: 01 00 00 00 nop
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
200680c: c2 04 20 08 ld [ %l0 + 8 ], %g1
_RTEMS_Unlock_allocator();
2006810: d0 04 61 a4 ld [ %l1 + 0x1a4 ], %o0
2006814: 40 00 06 41 call 2008118 <_API_Mutex_Unlock>
2006818: c2 27 40 00 st %g1, [ %i5 ]
return 0;
200681c: 81 c7 e0 08 ret
2006820: 81 e8 00 00 restore
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
_Watchdog_Insert_ticks(
2006824: 40 00 11 27 call 200acc0 <_Timespec_To_ticks>
2006828: 90 04 a0 90 add %l2, 0x90, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200682c: 92 04 a0 a8 add %l2, 0xa8, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2006830: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006834: 11 00 80 79 sethi %hi(0x201e400), %o0
2006838: 40 00 12 15 call 200b08c <_Watchdog_Insert>
200683c: 90 12 21 bc or %o0, 0x1bc, %o0 ! 201e5bc <_Watchdog_Ticks_chain>
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
2006840: 10 bf ff f4 b 2006810 <pthread_create+0x24c>
2006844: c2 04 20 08 ld [ %l0 + 8 ], %g1
0201a980 <pthread_kill>:
int pthread_kill(
pthread_t thread,
int sig
)
{
201a980: 9d e3 bf 98 save %sp, -104, %sp
POSIX_API_Control *api;
Thread_Control *the_thread;
Objects_Locations location;
if ( !sig )
201a984: 80 a6 60 00 cmp %i1, 0
201a988: 02 80 00 2d be 201aa3c <pthread_kill+0xbc>
201a98c: b6 06 7f ff add %i1, -1, %i3
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201a990: 80 a6 e0 1f cmp %i3, 0x1f
201a994: 18 80 00 2a bgu 201aa3c <pthread_kill+0xbc>
201a998: 90 10 00 18 mov %i0, %o0
rtems_set_errno_and_return_minus_one( EINVAL );
the_thread = _Thread_Get( thread, &location );
201a99c: 7f ff ba a1 call 2009420 <_Thread_Get>
201a9a0: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
201a9a4: c2 07 bf fc ld [ %fp + -4 ], %g1
201a9a8: 80 a0 60 00 cmp %g1, 0
201a9ac: 12 80 00 2a bne 201aa54 <pthread_kill+0xd4> <== NEVER TAKEN
201a9b0: ba 10 00 08 mov %o0, %i5
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( sig ) {
if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) {
201a9b4: 83 2e 60 02 sll %i1, 2, %g1
201a9b8: 85 2e 60 04 sll %i1, 4, %g2
201a9bc: 84 20 80 01 sub %g2, %g1, %g2
201a9c0: 03 00 80 78 sethi %hi(0x201e000), %g1
201a9c4: 82 10 60 a0 or %g1, 0xa0, %g1 ! 201e0a0 <_POSIX_signals_Vectors>
201a9c8: 82 00 40 02 add %g1, %g2, %g1
201a9cc: c4 00 60 08 ld [ %g1 + 8 ], %g2
201a9d0: 80 a0 a0 01 cmp %g2, 1
201a9d4: 02 80 00 14 be 201aa24 <pthread_kill+0xa4>
201a9d8: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201a9dc: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2
201a9e0: b8 10 20 01 mov 1, %i4
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201a9e4: 92 10 00 19 mov %i1, %o1
201a9e8: b7 2f 00 1b sll %i4, %i3, %i3
201a9ec: 94 10 20 00 clr %o2
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201a9f0: b6 10 80 1b or %g2, %i3, %i3
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201a9f4: 7f ff ff 8c call 201a824 <_POSIX_signals_Unblock_thread>
201a9f8: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ]
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201a9fc: 03 00 80 78 sethi %hi(0x201e000), %g1
201aa00: 82 10 60 40 or %g1, 0x40, %g1 ! 201e040 <_Per_CPU_Information>
201aa04: c4 00 60 08 ld [ %g1 + 8 ], %g2
201aa08: 80 a0 a0 00 cmp %g2, 0
201aa0c: 02 80 00 06 be 201aa24 <pthread_kill+0xa4>
201aa10: 01 00 00 00 nop
201aa14: c4 00 60 0c ld [ %g1 + 0xc ], %g2
201aa18: 80 a7 40 02 cmp %i5, %g2
201aa1c: 02 80 00 06 be 201aa34 <pthread_kill+0xb4>
201aa20: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
}
_Thread_Enable_dispatch();
201aa24: 7f ff ba 72 call 20093ec <_Thread_Enable_dispatch>
201aa28: b0 10 20 00 clr %i0 ! 0 <PROM_START>
return 0;
201aa2c: 81 c7 e0 08 ret
201aa30: 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;
201aa34: f8 28 60 18 stb %i4, [ %g1 + 0x18 ]
201aa38: 30 bf ff fb b,a 201aa24 <pthread_kill+0xa4>
if ( !sig )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
rtems_set_errno_and_return_minus_one( EINVAL );
201aa3c: 7f ff d4 24 call 200facc <__errno>
201aa40: b0 10 3f ff mov -1, %i0
201aa44: 82 10 20 16 mov 0x16, %g1
201aa48: c2 22 00 00 st %g1, [ %o0 ]
201aa4c: 81 c7 e0 08 ret
201aa50: 81 e8 00 00 restore
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( ESRCH );
201aa54: 7f ff d4 1e call 200facc <__errno> <== NOT EXECUTED
201aa58: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED
201aa5c: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED
201aa60: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
}
201aa64: 81 c7 e0 08 ret <== NOT EXECUTED
201aa68: 81 e8 00 00 restore <== NOT EXECUTED
02008550 <pthread_mutex_timedlock>:
int pthread_mutex_timedlock(
pthread_mutex_t *mutex,
const struct timespec *abstime
)
{
2008550: 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 );
2008554: 90 10 00 19 mov %i1, %o0
2008558: 40 00 00 37 call 2008634 <_POSIX_Absolute_timeout_to_ticks>
200855c: 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 );
2008560: 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 );
2008564: ba 10 00 08 mov %o0, %i5
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
2008568: 80 a7 60 03 cmp %i5, 3
200856c: 02 80 00 09 be 2008590 <pthread_mutex_timedlock+0x40>
2008570: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks );
2008574: 7f ff ff be call 200846c <_POSIX_Mutex_Lock_support>
2008578: 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) ) {
200857c: 80 a2 20 10 cmp %o0, 0x10
2008580: 02 80 00 08 be 20085a0 <pthread_mutex_timedlock+0x50>
2008584: 80 a7 60 00 cmp %i5, 0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return lock_status;
}
2008588: 81 c7 e0 08 ret
200858c: 91 e8 00 08 restore %g0, %o0, %o0
*/
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 );
2008590: 7f ff ff b7 call 200846c <_POSIX_Mutex_Lock_support>
2008594: 92 10 20 01 mov 1, %o1
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return lock_status;
}
2008598: 81 c7 e0 08 ret
200859c: 91 e8 00 08 restore %g0, %o0, %o0
* 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) ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
20085a0: 32 80 00 04 bne,a 20085b0 <pthread_mutex_timedlock+0x60> <== ALWAYS TAKEN
20085a4: ba 07 7f ff add %i5, -1, %i5
return EINVAL;
20085a8: 10 bf ff f8 b 2008588 <pthread_mutex_timedlock+0x38> <== NOT EXECUTED
20085ac: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
20085b0: 80 a7 60 01 cmp %i5, 1
20085b4: 28 bf ff f5 bleu,a 2008588 <pthread_mutex_timedlock+0x38><== ALWAYS TAKEN
20085b8: 90 10 20 74 mov 0x74, %o0
20085bc: 30 bf ff f3 b,a 2008588 <pthread_mutex_timedlock+0x38> <== NOT EXECUTED
02005e44 <pthread_mutexattr_gettype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_gettype(
const pthread_mutexattr_t *attr,
int *type
)
{
2005e44: 82 10 00 08 mov %o0, %g1
if ( !attr )
2005e48: 80 a0 60 00 cmp %g1, 0
2005e4c: 02 80 00 06 be 2005e64 <pthread_mutexattr_gettype+0x20>
2005e50: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2005e54: c4 00 40 00 ld [ %g1 ], %g2
2005e58: 80 a0 a0 00 cmp %g2, 0
2005e5c: 12 80 00 04 bne 2005e6c <pthread_mutexattr_gettype+0x28>
2005e60: 80 a2 60 00 cmp %o1, 0
if ( !type )
return EINVAL;
*type = attr->type;
return 0;
}
2005e64: 81 c3 e0 08 retl
2005e68: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
if ( !type )
2005e6c: 02 bf ff fe be 2005e64 <pthread_mutexattr_gettype+0x20> <== NEVER TAKEN
2005e70: 01 00 00 00 nop
return EINVAL;
*type = attr->type;
2005e74: c2 00 60 10 ld [ %g1 + 0x10 ], %g1
return 0;
2005e78: 90 10 20 00 clr %o0
}
2005e7c: 81 c3 e0 08 retl
2005e80: c2 22 40 00 st %g1, [ %o1 ]
02008124 <pthread_mutexattr_setpshared>:
int pthread_mutexattr_setpshared(
pthread_mutexattr_t *attr,
int pshared
)
{
2008124: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
2008128: 80 a0 60 00 cmp %g1, 0
200812c: 02 80 00 06 be 2008144 <pthread_mutexattr_setpshared+0x20>
2008130: 90 10 20 16 mov 0x16, %o0
2008134: c4 00 40 00 ld [ %g1 ], %g2
2008138: 80 a0 a0 00 cmp %g2, 0
200813c: 12 80 00 04 bne 200814c <pthread_mutexattr_setpshared+0x28>
2008140: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
2008144: 81 c3 e0 08 retl
2008148: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
200814c: 18 bf ff fe bgu 2008144 <pthread_mutexattr_setpshared+0x20><== NEVER TAKEN
2008150: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
2008154: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2008158: 81 c3 e0 08 retl
200815c: 90 10 20 00 clr %o0
02005ed8 <pthread_mutexattr_settype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_settype(
pthread_mutexattr_t *attr,
int type
)
{
2005ed8: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
2005edc: 80 a0 60 00 cmp %g1, 0
2005ee0: 02 80 00 06 be 2005ef8 <pthread_mutexattr_settype+0x20>
2005ee4: 90 10 20 16 mov 0x16, %o0
2005ee8: c4 00 40 00 ld [ %g1 ], %g2
2005eec: 80 a0 a0 00 cmp %g2, 0
2005ef0: 12 80 00 04 bne 2005f00 <pthread_mutexattr_settype+0x28> <== ALWAYS TAKEN
2005ef4: 80 a2 60 03 cmp %o1, 3
return 0;
default:
return EINVAL;
}
}
2005ef8: 81 c3 e0 08 retl
2005efc: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( type ) {
2005f00: 18 bf ff fe bgu 2005ef8 <pthread_mutexattr_settype+0x20>
2005f04: 01 00 00 00 nop
case PTHREAD_MUTEX_NORMAL:
case PTHREAD_MUTEX_RECURSIVE:
case PTHREAD_MUTEX_ERRORCHECK:
case PTHREAD_MUTEX_DEFAULT:
attr->type = type;
2005f08: d2 20 60 10 st %o1, [ %g1 + 0x10 ]
return 0;
default:
return EINVAL;
}
}
2005f0c: 81 c3 e0 08 retl
2005f10: 90 10 20 00 clr %o0
02006d14 <pthread_once>:
int pthread_once(
pthread_once_t *once_control,
void (*init_routine)(void)
)
{
2006d14: 9d e3 bf 98 save %sp, -104, %sp
if ( !once_control || !init_routine )
2006d18: 80 a6 60 00 cmp %i1, 0
2006d1c: 12 80 00 04 bne 2006d2c <pthread_once+0x18>
2006d20: ba 10 00 18 mov %i0, %i5
(*init_routine)();
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
}
return 0;
}
2006d24: 81 c7 e0 08 ret
2006d28: 91 e8 20 16 restore %g0, 0x16, %o0
int pthread_once(
pthread_once_t *once_control,
void (*init_routine)(void)
)
{
if ( !once_control || !init_routine )
2006d2c: 80 a6 20 00 cmp %i0, 0
2006d30: 22 80 00 13 be,a 2006d7c <pthread_once+0x68>
2006d34: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( !once_control->init_executed ) {
2006d38: c2 06 20 04 ld [ %i0 + 4 ], %g1
2006d3c: 80 a0 60 00 cmp %g1, 0
2006d40: 12 80 00 0f bne 2006d7c <pthread_once+0x68>
2006d44: b0 10 20 00 clr %i0
rtems_mode saveMode;
rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode);
2006d48: 90 10 21 00 mov 0x100, %o0
2006d4c: 92 10 21 00 mov 0x100, %o1
2006d50: 40 00 03 0e call 2007988 <rtems_task_mode>
2006d54: 94 07 bf fc add %fp, -4, %o2
if ( !once_control->init_executed ) {
2006d58: c2 07 60 04 ld [ %i5 + 4 ], %g1
2006d5c: 80 a0 60 00 cmp %g1, 0
2006d60: 02 80 00 09 be 2006d84 <pthread_once+0x70> <== ALWAYS TAKEN
2006d64: 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);
2006d68: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED
2006d6c: 92 10 21 00 mov 0x100, %o1
2006d70: 94 07 bf fc add %fp, -4, %o2
2006d74: 40 00 03 05 call 2007988 <rtems_task_mode>
2006d78: b0 10 20 00 clr %i0
2006d7c: 81 c7 e0 08 ret
2006d80: 81 e8 00 00 restore
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;
2006d84: c2 27 40 00 st %g1, [ %i5 ]
once_control->init_executed = true;
(*init_routine)();
2006d88: 9f c6 40 00 call %i1
2006d8c: c2 27 60 04 st %g1, [ %i5 + 4 ]
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
2006d90: 10 bf ff f7 b 2006d6c <pthread_once+0x58>
2006d94: d0 07 bf fc ld [ %fp + -4 ], %o0
020073f0 <pthread_rwlock_init>:
int pthread_rwlock_init(
pthread_rwlock_t *rwlock,
const pthread_rwlockattr_t *attr
)
{
20073f0: 9d e3 bf 90 save %sp, -112, %sp
20073f4: ba 10 00 18 mov %i0, %i5
const pthread_rwlockattr_t *the_attr;
/*
* Error check parameters
*/
if ( !rwlock )
20073f8: 80 a7 60 00 cmp %i5, 0
20073fc: 02 80 00 24 be 200748c <pthread_rwlock_init+0x9c>
2007400: b0 10 20 16 mov 0x16, %i0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
2007404: 80 a6 60 00 cmp %i1, 0
2007408: 02 80 00 23 be 2007494 <pthread_rwlock_init+0xa4>
200740c: 90 07 bf f4 add %fp, -12, %o0
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
2007410: c2 06 40 00 ld [ %i1 ], %g1
2007414: 80 a0 60 00 cmp %g1, 0
2007418: 02 80 00 1d be 200748c <pthread_rwlock_init+0x9c> <== NEVER TAKEN
200741c: b0 10 20 16 mov 0x16, %i0
return EINVAL;
switch ( the_attr->process_shared ) {
2007420: c2 06 60 04 ld [ %i1 + 4 ], %g1
2007424: 80 a0 60 00 cmp %g1, 0
2007428: 12 80 00 19 bne 200748c <pthread_rwlock_init+0x9c> <== NEVER TAKEN
200742c: 03 00 80 6a sethi %hi(0x201a800), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2007430: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 201abc0 <_Thread_Dispatch_disable_level>
*/
RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes(
CORE_RWLock_Attributes *the_attributes
)
{
the_attributes->XXX = 0;
2007434: c0 27 bf fc clr [ %fp + -4 ]
2007438: 84 00 a0 01 inc %g2
200743c: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ]
return _Thread_Dispatch_disable_level;
2007440: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1
* 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 *)
2007444: 37 00 80 6b sethi %hi(0x201ac00), %i3
2007448: 40 00 0a 65 call 2009ddc <_Objects_Allocate>
200744c: 90 16 e1 c0 or %i3, 0x1c0, %o0 ! 201adc0 <_POSIX_RWLock_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
2007450: b8 92 20 00 orcc %o0, 0, %i4
2007454: 02 80 00 14 be 20074a4 <pthread_rwlock_init+0xb4>
2007458: 90 07 20 10 add %i4, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes );
200745c: 40 00 07 f5 call 2009430 <_CORE_RWLock_Initialize>
2007460: 92 07 bf fc add %fp, -4, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007464: c4 17 20 0a lduh [ %i4 + 0xa ], %g2
*rwlock = the_rwlock->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2007468: b6 16 e1 c0 or %i3, 0x1c0, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200746c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007470: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007474: 85 28 a0 02 sll %g2, 2, %g2
2007478: f8 20 c0 02 st %i4, [ %g3 + %g2 ]
_Objects_Get_index( the_object->id ),
the_object
);
/* ASSERT: information->is_string == false */
the_object->name.name_u32 = name;
200747c: c0 27 20 0c clr [ %i4 + 0xc ]
&_POSIX_RWLock_Information,
&the_rwlock->Object,
0
);
*rwlock = the_rwlock->Object.id;
2007480: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
2007484: 40 00 0f 73 call 200b250 <_Thread_Enable_dispatch>
2007488: b0 10 20 00 clr %i0
return 0;
}
200748c: 81 c7 e0 08 ret
2007490: 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 );
2007494: 40 00 02 80 call 2007e94 <pthread_rwlockattr_init>
2007498: b2 07 bf f4 add %fp, -12, %i1
}
/*
* Now start error checking the attributes that we are going to use
*/
if ( !the_attr->is_initialized )
200749c: 10 bf ff de b 2007414 <pthread_rwlock_init+0x24>
20074a0: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
_Thread_Enable_dispatch();
20074a4: 40 00 0f 6b call 200b250 <_Thread_Enable_dispatch>
20074a8: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
20074ac: 81 c7 e0 08 ret
20074b0: 81 e8 00 00 restore
02007524 <pthread_rwlock_timedrdlock>:
int pthread_rwlock_timedrdlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
2007524: 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 )
2007528: 80 a6 20 00 cmp %i0, 0
200752c: 02 80 00 24 be 20075bc <pthread_rwlock_timedrdlock+0x98>
2007530: ba 10 20 16 mov 0x16, %i5
*
* 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 );
2007534: 92 07 bf fc add %fp, -4, %o1
2007538: 40 00 1c bf call 200e834 <_POSIX_Absolute_timeout_to_ticks>
200753c: 90 10 00 19 mov %i1, %o0
2007540: d2 06 00 00 ld [ %i0 ], %o1
2007544: b8 10 00 08 mov %o0, %i4
2007548: 94 07 bf f8 add %fp, -8, %o2
200754c: 11 00 80 6b sethi %hi(0x201ac00), %o0
2007550: 40 00 0b 6e call 200a308 <_Objects_Get>
2007554: 90 12 21 c0 or %o0, 0x1c0, %o0 ! 201adc0 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2007558: c2 07 bf f8 ld [ %fp + -8 ], %g1
200755c: 80 a0 60 00 cmp %g1, 0
2007560: 12 80 00 17 bne 20075bc <pthread_rwlock_timedrdlock+0x98>
2007564: d6 07 bf fc ld [ %fp + -4 ], %o3
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_reading(
2007568: d2 06 00 00 ld [ %i0 ], %o1
int _EXFUN(pthread_rwlock_init,
(pthread_rwlock_t *__rwlock, _CONST pthread_rwlockattr_t *__attr));
int _EXFUN(pthread_rwlock_destroy, (pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_rdlock,(pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_tryrdlock,(pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_timedrdlock,
200756c: 82 1f 20 03 xor %i4, 3, %g1
2007570: 90 02 20 10 add %o0, 0x10, %o0
2007574: 80 a0 00 01 cmp %g0, %g1
2007578: 98 10 20 00 clr %o4
200757c: b6 60 3f ff subx %g0, -1, %i3
2007580: 40 00 07 b6 call 2009458 <_CORE_RWLock_Obtain_for_reading>
2007584: 94 10 00 1b mov %i3, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2007588: 40 00 0f 32 call 200b250 <_Thread_Enable_dispatch>
200758c: 01 00 00 00 nop
if ( !do_wait ) {
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
2007590: 03 00 80 6c sethi %hi(0x201b000), %g1
2007594: c2 00 61 0c ld [ %g1 + 0x10c ], %g1 ! 201b10c <_Per_CPU_Information+0xc>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait ) {
2007598: 80 a6 e0 00 cmp %i3, 0
200759c: 12 80 00 05 bne 20075b0 <pthread_rwlock_timedrdlock+0x8c>
20075a0: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
20075a4: 80 a2 20 02 cmp %o0, 2
20075a8: 02 80 00 07 be 20075c4 <pthread_rwlock_timedrdlock+0xa0>
20075ac: 80 a7 20 00 cmp %i4, 0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
}
return _POSIX_RWLock_Translate_core_RWLock_return_code(
20075b0: 40 00 00 39 call 2007694 <_POSIX_RWLock_Translate_core_RWLock_return_code>
20075b4: 01 00 00 00 nop
20075b8: ba 10 00 08 mov %o0, %i5
case OBJECTS_ERROR:
break;
}
return EINVAL;
}
20075bc: 81 c7 e0 08 ret
20075c0: 91 e8 00 1d restore %g0, %i5, %o0
);
_Thread_Enable_dispatch();
if ( !do_wait ) {
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
20075c4: 02 bf ff fe be 20075bc <pthread_rwlock_timedrdlock+0x98> <== NEVER TAKEN
20075c8: b8 07 3f ff add %i4, -1, %i4
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
20075cc: 80 a7 20 01 cmp %i4, 1
20075d0: 18 bf ff f8 bgu 20075b0 <pthread_rwlock_timedrdlock+0x8c> <== NEVER TAKEN
20075d4: ba 10 20 74 mov 0x74, %i5
20075d8: 30 bf ff f9 b,a 20075bc <pthread_rwlock_timedrdlock+0x98>
020075dc <pthread_rwlock_timedwrlock>:
int pthread_rwlock_timedwrlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
20075dc: 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 )
20075e0: 80 a6 20 00 cmp %i0, 0
20075e4: 02 80 00 24 be 2007674 <pthread_rwlock_timedwrlock+0x98>
20075e8: ba 10 20 16 mov 0x16, %i5
*
* 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 );
20075ec: 92 07 bf fc add %fp, -4, %o1
20075f0: 40 00 1c 91 call 200e834 <_POSIX_Absolute_timeout_to_ticks>
20075f4: 90 10 00 19 mov %i1, %o0
20075f8: d2 06 00 00 ld [ %i0 ], %o1
20075fc: b8 10 00 08 mov %o0, %i4
2007600: 94 07 bf f8 add %fp, -8, %o2
2007604: 11 00 80 6b sethi %hi(0x201ac00), %o0
2007608: 40 00 0b 40 call 200a308 <_Objects_Get>
200760c: 90 12 21 c0 or %o0, 0x1c0, %o0 ! 201adc0 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2007610: c2 07 bf f8 ld [ %fp + -8 ], %g1
2007614: 80 a0 60 00 cmp %g1, 0
2007618: 12 80 00 17 bne 2007674 <pthread_rwlock_timedwrlock+0x98>
200761c: d6 07 bf fc ld [ %fp + -4 ], %o3
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_writing(
2007620: d2 06 00 00 ld [ %i0 ], %o1
(pthread_rwlock_t *__rwlock, _CONST struct timespec *__abstime));
int _EXFUN(pthread_rwlock_unlock,(pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_wrlock,(pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_trywrlock,(pthread_rwlock_t *__rwlock));
int _EXFUN(pthread_rwlock_timedwrlock,
2007624: 82 1f 20 03 xor %i4, 3, %g1
2007628: 90 02 20 10 add %o0, 0x10, %o0
200762c: 80 a0 00 01 cmp %g0, %g1
2007630: 98 10 20 00 clr %o4
2007634: b6 60 3f ff subx %g0, -1, %i3
2007638: 40 00 07 be call 2009530 <_CORE_RWLock_Obtain_for_writing>
200763c: 94 10 00 1b mov %i3, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2007640: 40 00 0f 04 call 200b250 <_Thread_Enable_dispatch>
2007644: 01 00 00 00 nop
if ( !do_wait &&
(_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) {
2007648: 03 00 80 6c sethi %hi(0x201b000), %g1
200764c: c2 00 61 0c ld [ %g1 + 0x10c ], %g1 ! 201b10c <_Per_CPU_Information+0xc>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait &&
2007650: 80 a6 e0 00 cmp %i3, 0
2007654: 12 80 00 05 bne 2007668 <pthread_rwlock_timedwrlock+0x8c>
2007658: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
200765c: 80 a2 20 02 cmp %o0, 2
2007660: 02 80 00 07 be 200767c <pthread_rwlock_timedwrlock+0xa0>
2007664: 80 a7 20 00 cmp %i4, 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(
2007668: 40 00 00 0b call 2007694 <_POSIX_RWLock_Translate_core_RWLock_return_code>
200766c: 01 00 00 00 nop
2007670: ba 10 00 08 mov %o0, %i5
case OBJECTS_ERROR:
break;
}
return EINVAL;
}
2007674: 81 c7 e0 08 ret
2007678: 91 e8 00 1d restore %g0, %i5, %o0
);
_Thread_Enable_dispatch();
if ( !do_wait &&
(_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) {
if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID )
200767c: 02 bf ff fe be 2007674 <pthread_rwlock_timedwrlock+0x98> <== NEVER TAKEN
2007680: b8 07 3f ff add %i4, -1, %i4
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
2007684: 80 a7 20 01 cmp %i4, 1
2007688: 18 bf ff f8 bgu 2007668 <pthread_rwlock_timedwrlock+0x8c> <== NEVER TAKEN
200768c: ba 10 20 74 mov 0x74, %i5
2007690: 30 bf ff f9 b,a 2007674 <pthread_rwlock_timedwrlock+0x98>
02007ebc <pthread_rwlockattr_setpshared>:
int pthread_rwlockattr_setpshared(
pthread_rwlockattr_t *attr,
int pshared
)
{
2007ebc: 82 10 00 08 mov %o0, %g1
if ( !attr )
2007ec0: 80 a0 60 00 cmp %g1, 0
2007ec4: 02 80 00 06 be 2007edc <pthread_rwlockattr_setpshared+0x20>
2007ec8: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2007ecc: c4 00 40 00 ld [ %g1 ], %g2
2007ed0: 80 a0 a0 00 cmp %g2, 0
2007ed4: 12 80 00 04 bne 2007ee4 <pthread_rwlockattr_setpshared+0x28>
2007ed8: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
2007edc: 81 c3 e0 08 retl
2007ee0: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
2007ee4: 18 bf ff fe bgu 2007edc <pthread_rwlockattr_setpshared+0x20><== NEVER TAKEN
2007ee8: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
2007eec: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2007ef0: 81 c3 e0 08 retl
2007ef4: 90 10 20 00 clr %o0
02008ed4 <pthread_setschedparam>:
int pthread_setschedparam(
pthread_t thread,
int policy,
struct sched_param *param
)
{
2008ed4: 9d e3 bf 90 save %sp, -112, %sp
2008ed8: ba 10 00 18 mov %i0, %i5
int rc;
/*
* Check all the parameters
*/
if ( !param )
2008edc: 80 a6 a0 00 cmp %i2, 0
2008ee0: 02 80 00 38 be 2008fc0 <pthread_setschedparam+0xec>
2008ee4: b0 10 20 16 mov 0x16, %i0
return EINVAL;
rc = _POSIX_Thread_Translate_sched_param(
2008ee8: 90 10 00 19 mov %i1, %o0
2008eec: 92 10 00 1a mov %i2, %o1
2008ef0: 94 07 bf f4 add %fp, -12, %o2
2008ef4: 40 00 1a 73 call 200f8c0 <_POSIX_Thread_Translate_sched_param>
2008ef8: 96 07 bf f8 add %fp, -8, %o3
policy,
param,
&budget_algorithm,
&budget_callout
);
if ( rc )
2008efc: b0 92 20 00 orcc %o0, 0, %i0
2008f00: 12 80 00 30 bne 2008fc0 <pthread_setschedparam+0xec>
2008f04: 90 10 00 1d mov %i5, %o0
return rc;
/*
* Actually change the scheduling policy and parameters
*/
the_thread = _Thread_Get( thread, &location );
2008f08: 40 00 0c 82 call 200c110 <_Thread_Get>
2008f0c: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2008f10: c2 07 bf fc ld [ %fp + -4 ], %g1
2008f14: 80 a0 60 00 cmp %g1, 0
2008f18: 12 80 00 2c bne 2008fc8 <pthread_setschedparam+0xf4>
2008f1c: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
2008f20: fa 02 21 5c ld [ %o0 + 0x15c ], %i5
if ( api->schedpolicy == SCHED_SPORADIC )
2008f24: c2 07 60 84 ld [ %i5 + 0x84 ], %g1
2008f28: 80 a0 60 04 cmp %g1, 4
2008f2c: 02 80 00 33 be 2008ff8 <pthread_setschedparam+0x124>
2008f30: 01 00 00 00 nop
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
2008f34: f2 27 60 84 st %i1, [ %i5 + 0x84 ]
api->schedparam = *param;
2008f38: c2 06 80 00 ld [ %i2 ], %g1
the_thread->budget_algorithm = budget_algorithm;
the_thread->budget_callout = budget_callout;
switch ( api->schedpolicy ) {
2008f3c: 80 a6 60 00 cmp %i1, 0
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
api->schedparam = *param;
2008f40: c2 27 60 88 st %g1, [ %i5 + 0x88 ]
2008f44: c4 06 a0 04 ld [ %i2 + 4 ], %g2
2008f48: c4 27 60 8c st %g2, [ %i5 + 0x8c ]
2008f4c: c4 06 a0 08 ld [ %i2 + 8 ], %g2
2008f50: c4 27 60 90 st %g2, [ %i5 + 0x90 ]
2008f54: c4 06 a0 0c ld [ %i2 + 0xc ], %g2
2008f58: c4 27 60 94 st %g2, [ %i5 + 0x94 ]
2008f5c: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2
2008f60: c4 27 60 98 st %g2, [ %i5 + 0x98 ]
2008f64: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2
2008f68: c4 27 60 9c st %g2, [ %i5 + 0x9c ]
2008f6c: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2
2008f70: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ]
the_thread->budget_algorithm = budget_algorithm;
2008f74: c4 07 bf f4 ld [ %fp + -12 ], %g2
2008f78: c4 27 20 7c st %g2, [ %i4 + 0x7c ]
the_thread->budget_callout = budget_callout;
2008f7c: c4 07 bf f8 ld [ %fp + -8 ], %g2
switch ( api->schedpolicy ) {
2008f80: 06 80 00 0e bl 2008fb8 <pthread_setschedparam+0xe4> <== NEVER TAKEN
2008f84: c4 27 20 80 st %g2, [ %i4 + 0x80 ]
2008f88: 80 a6 60 02 cmp %i1, 2
2008f8c: 04 80 00 11 ble 2008fd0 <pthread_setschedparam+0xfc>
2008f90: 07 00 80 6d sethi %hi(0x201b400), %g3
2008f94: 80 a6 60 04 cmp %i1, 4
2008f98: 12 80 00 08 bne 2008fb8 <pthread_setschedparam+0xe4> <== NEVER TAKEN
2008f9c: 01 00 00 00 nop
true
);
break;
case SCHED_SPORADIC:
api->ss_high_priority = api->schedparam.sched_priority;
2008fa0: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ]
_Watchdog_Remove( &api->Sporadic_timer );
2008fa4: 40 00 10 f2 call 200d36c <_Watchdog_Remove>
2008fa8: 90 07 60 a8 add %i5, 0xa8, %o0
_POSIX_Threads_Sporadic_budget_TSR( 0, the_thread );
2008fac: 90 10 20 00 clr %o0
2008fb0: 7f ff ff 7e call 2008da8 <_POSIX_Threads_Sporadic_budget_TSR>
2008fb4: 92 10 00 1c mov %i4, %o1
break;
}
_Thread_Enable_dispatch();
2008fb8: 40 00 0c 49 call 200c0dc <_Thread_Enable_dispatch>
2008fbc: 01 00 00 00 nop
return 0;
2008fc0: 81 c7 e0 08 ret
2008fc4: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return ESRCH;
}
2008fc8: 81 c7 e0 08 ret
2008fcc: 91 e8 20 03 restore %g0, 3, %o0
switch ( api->schedpolicy ) {
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice;
2008fd0: 05 00 80 70 sethi %hi(0x201c000), %g2
2008fd4: d2 08 e1 5c ldub [ %g3 + 0x15c ], %o1
2008fd8: c4 00 a2 14 ld [ %g2 + 0x214 ], %g2
2008fdc: 92 22 40 01 sub %o1, %g1, %o1
2008fe0: c4 27 20 78 st %g2, [ %i4 + 0x78 ]
the_thread->real_priority =
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
2008fe4: 90 10 00 1c mov %i4, %o0
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice;
the_thread->real_priority =
2008fe8: d2 27 20 18 st %o1, [ %i4 + 0x18 ]
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
2008fec: 40 00 0a fc call 200bbdc <_Thread_Change_priority>
2008ff0: 94 10 20 01 mov 1, %o2
the_thread,
the_thread->real_priority,
true
);
break;
2008ff4: 30 bf ff f1 b,a 2008fb8 <pthread_setschedparam+0xe4>
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
2008ff8: 40 00 10 dd call 200d36c <_Watchdog_Remove>
2008ffc: 90 07 60 a8 add %i5, 0xa8, %o0
api->schedpolicy = policy;
2009000: 10 bf ff ce b 2008f38 <pthread_setschedparam+0x64>
2009004: f2 27 60 84 st %i1, [ %i5 + 0x84 ]
02006974 <pthread_testcancel>:
/*
* 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183
*/
void pthread_testcancel( void )
{
2006974: 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() )
2006978: 3b 00 80 64 sethi %hi(0x2019000), %i5
200697c: ba 17 60 40 or %i5, 0x40, %i5 ! 2019040 <_Per_CPU_Information>
2006980: c2 07 60 08 ld [ %i5 + 8 ], %g1
2006984: 80 a0 60 00 cmp %g1, 0
2006988: 12 80 00 16 bne 20069e0 <pthread_testcancel+0x6c> <== NEVER TAKEN
200698c: 01 00 00 00 nop
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2006990: 03 00 80 62 sethi %hi(0x2018800), %g1
return;
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
2006994: c4 07 60 0c ld [ %i5 + 0xc ], %g2
2006998: c6 00 63 00 ld [ %g1 + 0x300 ], %g3
200699c: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2
20069a0: 86 00 e0 01 inc %g3
20069a4: c6 20 63 00 st %g3, [ %g1 + 0x300 ]
return _Thread_Dispatch_disable_level;
20069a8: c2 00 63 00 ld [ %g1 + 0x300 ], %g1
_Thread_Disable_dispatch();
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
20069ac: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1
20069b0: 80 a0 60 00 cmp %g1, 0
20069b4: 12 80 00 0d bne 20069e8 <pthread_testcancel+0x74> <== NEVER TAKEN
20069b8: 01 00 00 00 nop
20069bc: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1
20069c0: 80 a0 60 00 cmp %g1, 0
20069c4: 02 80 00 09 be 20069e8 <pthread_testcancel+0x74>
20069c8: 01 00 00 00 nop
thread_support->cancelation_requested )
cancel = true;
_Thread_Enable_dispatch();
20069cc: 40 00 0c 04 call 20099dc <_Thread_Enable_dispatch>
20069d0: b2 10 3f ff mov -1, %i1 ! ffffffff <RAM_END+0xfdbfffff>
if ( cancel )
_POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED );
20069d4: f0 07 60 0c ld [ %i5 + 0xc ], %i0
20069d8: 40 00 1a 3b call 200d2c4 <_POSIX_Thread_Exit>
20069dc: 81 e8 00 00 restore
20069e0: 81 c7 e0 08 ret <== NOT EXECUTED
20069e4: 81 e8 00 00 restore <== NOT EXECUTED
_Thread_Disable_dispatch();
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
thread_support->cancelation_requested )
cancel = true;
_Thread_Enable_dispatch();
20069e8: 40 00 0b fd call 20099dc <_Thread_Enable_dispatch>
20069ec: 81 e8 00 00 restore
02007548 <rtems_aio_enqueue>:
* errno - otherwise
*/
int
rtems_aio_enqueue (rtems_aio_request *req)
{
2007548: 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);
200754c: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2007550: 40 00 02 75 call 2007f24 <pthread_mutex_lock>
2007554: 90 17 61 3c or %i5, 0x13c, %o0 ! 2019d3c <aio_request_queue>
if (result != 0) {
2007558: b8 92 20 00 orcc %o0, 0, %i4
200755c: 12 80 00 31 bne 2007620 <rtems_aio_enqueue+0xd8> <== NEVER TAKEN
2007560: 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);
2007564: 40 00 04 a5 call 20087f8 <pthread_self>
2007568: b6 17 61 3c or %i5, 0x13c, %i3
200756c: 92 07 bf fc add %fp, -4, %o1
2007570: 40 00 03 93 call 20083bc <pthread_getschedparam>
2007574: 94 07 bf dc add %fp, -36, %o2
req->caller_thread = pthread_self ();
2007578: 40 00 04 a0 call 20087f8 <pthread_self>
200757c: 01 00 00 00 nop
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
2007580: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
req->policy = policy;
2007584: c6 07 bf fc ld [ %fp + -4 ], %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;
2007588: c4 00 60 18 ld [ %g1 + 0x18 ], %g2
req->policy = policy;
200758c: 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;
2007590: c6 07 bf dc ld [ %fp + -36 ], %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 ();
2007594: d0 26 20 10 st %o0, [ %i0 + 0x10 ]
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
2007598: 84 20 c0 02 sub %g3, %g2, %g2
200759c: 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) &&
20075a0: c4 06 e0 68 ld [ %i3 + 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;
20075a4: 86 10 20 77 mov 0x77, %g3
req->aiocbp->return_value = 0;
20075a8: 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;
20075ac: c6 20 60 34 st %g3, [ %g1 + 0x34 ]
req->aiocbp->return_value = 0;
if ((aio_request_queue.idle_threads == 0) &&
20075b0: 80 a0 a0 00 cmp %g2, 0
20075b4: 12 80 00 06 bne 20075cc <rtems_aio_enqueue+0x84> <== NEVER TAKEN
20075b8: d2 00 40 00 ld [ %g1 ], %o1
20075bc: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2
20075c0: 80 a0 a0 04 cmp %g2, 4
20075c4: 24 80 00 1b ble,a 2007630 <rtems_aio_enqueue+0xe8>
20075c8: 90 06 e0 48 add %i3, 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,
20075cc: 94 10 20 00 clr %o2
20075d0: 11 00 80 67 sethi %hi(0x2019c00), %o0
20075d4: 7f ff fe a0 call 2007054 <rtems_aio_search_fd>
20075d8: 90 12 21 84 or %o0, 0x184, %o0 ! 2019d84 <aio_request_queue+0x48>
req->aiocbp->aio_fildes, 0);
if (r_chain != NULL)
20075dc: b4 92 20 00 orcc %o0, 0, %i2
20075e0: 22 80 00 31 be,a 20076a4 <rtems_aio_enqueue+0x15c>
20075e4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
{
pthread_mutex_lock (&r_chain->mutex);
20075e8: b6 06 a0 1c add %i2, 0x1c, %i3
20075ec: 40 00 02 4e call 2007f24 <pthread_mutex_lock>
20075f0: 90 10 00 1b mov %i3, %o0
rtems_aio_insert_prio (&r_chain->perfd, req);
20075f4: 90 06 a0 08 add %i2, 8, %o0
20075f8: 7f ff ff 89 call 200741c <rtems_aio_insert_prio>
20075fc: 92 10 00 18 mov %i0, %o1
pthread_cond_signal (&r_chain->cond);
2007600: 40 00 01 25 call 2007a94 <pthread_cond_signal>
2007604: 90 06 a0 20 add %i2, 0x20, %o0
pthread_mutex_unlock (&r_chain->mutex);
2007608: 40 00 02 67 call 2007fa4 <pthread_mutex_unlock>
200760c: 90 10 00 1b mov %i3, %o0
if (aio_request_queue.idle_threads > 0)
pthread_cond_signal (&aio_request_queue.new_req);
}
}
pthread_mutex_unlock (&aio_request_queue.mutex);
2007610: 40 00 02 65 call 2007fa4 <pthread_mutex_unlock>
2007614: 90 17 61 3c or %i5, 0x13c, %o0
return 0;
}
2007618: 81 c7 e0 08 ret
200761c: 91 e8 00 1c restore %g0, %i4, %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);
2007620: 7f ff f0 25 call 20036b4 <free> <== NOT EXECUTED
2007624: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED
}
}
pthread_mutex_unlock (&aio_request_queue.mutex);
return 0;
}
2007628: 81 c7 e0 08 ret <== NOT EXECUTED
200762c: 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);
2007630: 7f ff fe 89 call 2007054 <rtems_aio_search_fd>
2007634: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
2007638: c2 02 20 18 ld [ %o0 + 0x18 ], %g1
200763c: 80 a0 60 01 cmp %g1, 1
2007640: 12 bf ff ea bne 20075e8 <rtems_aio_enqueue+0xa0>
2007644: 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);
2007648: 90 02 20 08 add %o0, 8, %o0
200764c: 40 00 09 11 call 2009a90 <_Chain_Insert>
2007650: 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);
2007654: 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;
2007658: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
200765c: 40 00 01 da call 2007dc4 <pthread_mutex_init>
2007660: 90 06 a0 1c add %i2, 0x1c, %o0
pthread_cond_init (&r_chain->cond, NULL);
2007664: 92 10 20 00 clr %o1
2007668: 40 00 00 db call 20079d4 <pthread_cond_init>
200766c: 90 06 a0 20 add %i2, 0x20, %o0
AIO_printf ("New thread \n");
result = pthread_create (&thid, &aio_request_queue.attr,
2007670: 90 07 bf f8 add %fp, -8, %o0
2007674: 92 06 e0 08 add %i3, 8, %o1
2007678: 96 10 00 1a mov %i2, %o3
200767c: 15 00 80 1c sethi %hi(0x2007000), %o2
2007680: 40 00 02 ae call 2008138 <pthread_create>
2007684: 94 12 a1 b0 or %o2, 0x1b0, %o2 ! 20071b0 <rtems_aio_handle>
rtems_aio_handle, (void *) r_chain);
if (result != 0) {
2007688: 82 92 20 00 orcc %o0, 0, %g1
200768c: 12 80 00 25 bne 2007720 <rtems_aio_enqueue+0x1d8> <== NEVER TAKEN
2007690: 90 10 00 1b mov %i3, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return result;
}
++aio_request_queue.active_threads;
2007694: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1
2007698: 82 00 60 01 inc %g1
200769c: 10 bf ff dd b 2007610 <rtems_aio_enqueue+0xc8>
20076a0: c2 26 e0 64 st %g1, [ %i3 + 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);
20076a4: 11 00 80 67 sethi %hi(0x2019c00), %o0
20076a8: d2 00 40 00 ld [ %g1 ], %o1
20076ac: 90 12 21 90 or %o0, 0x190, %o0
20076b0: 7f ff fe 69 call 2007054 <rtems_aio_search_fd>
20076b4: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
20076b8: 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);
20076bc: b4 10 00 08 mov %o0, %i2
20076c0: 92 10 00 18 mov %i0, %o1
if (r_chain->new_fd == 1) {
20076c4: 80 a0 60 01 cmp %g1, 1
20076c8: 02 80 00 0b be 20076f4 <rtems_aio_enqueue+0x1ac>
20076cc: 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);
20076d0: 7f ff ff 53 call 200741c <rtems_aio_insert_prio>
20076d4: 01 00 00 00 nop
if (aio_request_queue.idle_threads > 0)
20076d8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1
20076dc: 80 a0 60 00 cmp %g1, 0
20076e0: 04 bf ff cc ble 2007610 <rtems_aio_enqueue+0xc8> <== ALWAYS TAKEN
20076e4: 01 00 00 00 nop
pthread_cond_signal (&aio_request_queue.new_req);
20076e8: 40 00 00 eb call 2007a94 <pthread_cond_signal> <== NOT EXECUTED
20076ec: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED
20076f0: 30 bf ff c8 b,a 2007610 <rtems_aio_enqueue+0xc8> <== NOT EXECUTED
20076f4: 40 00 08 e7 call 2009a90 <_Chain_Insert>
20076f8: 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);
20076fc: 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;
2007700: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
2007704: 40 00 01 b0 call 2007dc4 <pthread_mutex_init>
2007708: 92 10 20 00 clr %o1
pthread_cond_init (&r_chain->cond, NULL);
200770c: 90 06 a0 20 add %i2, 0x20, %o0
2007710: 40 00 00 b1 call 20079d4 <pthread_cond_init>
2007714: 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)
2007718: 10 bf ff f1 b 20076dc <rtems_aio_enqueue+0x194>
200771c: c2 06 e0 68 ld [ %i3 + 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);
2007720: 40 00 02 21 call 2007fa4 <pthread_mutex_unlock> <== NOT EXECUTED
2007724: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED
return result;
2007728: 30 bf ff bc b,a 2007618 <rtems_aio_enqueue+0xd0> <== NOT EXECUTED
020071b0 <rtems_aio_handle>:
* NULL - if error
*/
static void *
rtems_aio_handle (void *arg)
{
20071b0: 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);
20071b4: 37 00 80 67 sethi %hi(0x2019c00), %i3
20071b8: b8 06 20 1c add %i0, 0x1c, %i4
20071bc: b6 16 e1 3c or %i3, 0x13c, %i3
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,
20071c0: b4 10 00 1b mov %i3, %i2
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)) {
20071c4: b2 06 e0 58 add %i3, 0x58, %i1
--aio_request_queue.active_threads;
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
20071c8: a0 06 e0 04 add %i3, 4, %l0
/* 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);
20071cc: 40 00 03 56 call 2007f24 <pthread_mutex_lock>
20071d0: 90 10 00 1c mov %i4, %o0
if (result != 0)
20071d4: 80 a2 20 00 cmp %o0, 0
20071d8: 12 80 00 2b bne 2007284 <rtems_aio_handle+0xd4> <== NEVER TAKEN
20071dc: 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;
20071e0: 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 );
20071e4: 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)) {
20071e8: 80 a7 40 01 cmp %i5, %g1
20071ec: 02 80 00 41 be 20072f0 <rtems_aio_handle+0x140>
20071f0: 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);
20071f4: 40 00 05 81 call 20087f8 <pthread_self>
20071f8: 01 00 00 00 nop
20071fc: 92 07 bf fc add %fp, -4, %o1
2007200: 40 00 04 6f call 20083bc <pthread_getschedparam>
2007204: 94 07 bf d8 add %fp, -40, %o2
param.sched_priority = req->priority;
2007208: c2 07 60 0c ld [ %i5 + 0xc ], %g1
pthread_setschedparam (pthread_self(), req->policy, ¶m);
200720c: 40 00 05 7b call 20087f8 <pthread_self>
2007210: c2 27 bf d8 st %g1, [ %fp + -40 ]
2007214: d2 07 60 08 ld [ %i5 + 8 ], %o1
2007218: 40 00 05 7c call 2008808 <pthread_setschedparam>
200721c: 94 07 bf d8 add %fp, -40, %o2
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2007220: 40 00 0a 04 call 2009a30 <_Chain_Extract>
2007224: 90 10 00 1d mov %i5, %o0
rtems_chain_extract (node);
pthread_mutex_unlock (&r_chain->mutex);
2007228: 40 00 03 5f call 2007fa4 <pthread_mutex_unlock>
200722c: 90 10 00 1c mov %i4, %o0
switch (req->aiocbp->aio_lio_opcode) {
2007230: e2 07 60 14 ld [ %i5 + 0x14 ], %l1
2007234: c2 04 60 30 ld [ %l1 + 0x30 ], %g1
2007238: 80 a0 60 02 cmp %g1, 2
200723c: 22 80 00 25 be,a 20072d0 <rtems_aio_handle+0x120>
2007240: c4 1c 60 08 ldd [ %l1 + 8 ], %g2
2007244: 80 a0 60 03 cmp %g1, 3
2007248: 02 80 00 1e be 20072c0 <rtems_aio_handle+0x110> <== NEVER TAKEN
200724c: 01 00 00 00 nop
2007250: 80 a0 60 01 cmp %g1, 1
2007254: 22 80 00 0e be,a 200728c <rtems_aio_handle+0xdc> <== ALWAYS TAKEN
2007258: c4 1c 60 08 ldd [ %l1 + 8 ], %g2
default:
result = -1;
}
if (result == -1) {
req->aiocbp->return_value = -1;
200725c: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED
req->aiocbp->error_code = errno;
2007260: 40 00 2b d0 call 20121a0 <__errno> <== NOT EXECUTED
2007264: c2 24 60 38 st %g1, [ %l1 + 0x38 ] <== NOT EXECUTED
2007268: 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);
200726c: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
2007270: 40 00 03 2d call 2007f24 <pthread_mutex_lock> <== NOT EXECUTED
2007274: c2 24 60 34 st %g1, [ %l1 + 0x34 ] <== NOT EXECUTED
if (result != 0)
2007278: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
200727c: 22 bf ff da be,a 20071e4 <rtems_aio_handle+0x34> <== NOT EXECUTED
2007280: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
2007284: 81 c7 e0 08 ret
2007288: 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,
200728c: d0 04 40 00 ld [ %l1 ], %o0
2007290: d2 04 60 10 ld [ %l1 + 0x10 ], %o1
2007294: d4 04 60 14 ld [ %l1 + 0x14 ], %o2
2007298: 96 10 00 02 mov %g2, %o3
200729c: 40 00 2e e4 call 2012e2c <pread>
20072a0: 98 10 00 03 mov %g3, %o4
break;
default:
result = -1;
}
if (result == -1) {
20072a4: 80 a2 3f ff cmp %o0, -1
20072a8: 22 bf ff ed be,a 200725c <rtems_aio_handle+0xac> <== NEVER TAKEN
20072ac: e2 07 60 14 ld [ %i5 + 0x14 ], %l1 <== NOT EXECUTED
req->aiocbp->return_value = -1;
req->aiocbp->error_code = errno;
} else {
req->aiocbp->return_value = result;
20072b0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
20072b4: d0 20 60 38 st %o0, [ %g1 + 0x38 ]
req->aiocbp->error_code = 0;
20072b8: 10 bf ff c5 b 20071cc <rtems_aio_handle+0x1c>
20072bc: 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);
20072c0: 40 00 1d b9 call 200e9a4 <fsync> <== NOT EXECUTED
20072c4: d0 04 40 00 ld [ %l1 ], %o0 <== NOT EXECUTED
break;
20072c8: 10 bf ff f8 b 20072a8 <rtems_aio_handle+0xf8> <== NOT EXECUTED
20072cc: 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,
20072d0: d0 04 40 00 ld [ %l1 ], %o0
20072d4: d2 04 60 10 ld [ %l1 + 0x10 ], %o1
20072d8: d4 04 60 14 ld [ %l1 + 0x14 ], %o2
20072dc: 96 10 00 02 mov %g2, %o3
20072e0: 40 00 2f 11 call 2012f24 <pwrite>
20072e4: 98 10 00 03 mov %g3, %o4
(void *) req->aiocbp->aio_buf,
req->aiocbp->aio_nbytes, req->aiocbp->aio_offset);
break;
20072e8: 10 bf ff f0 b 20072a8 <rtems_aio_handle+0xf8>
20072ec: 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);
20072f0: 40 00 03 2d call 2007fa4 <pthread_mutex_unlock>
20072f4: 90 10 00 1c mov %i4, %o0
pthread_mutex_lock (&aio_request_queue.mutex);
20072f8: 40 00 03 0b call 2007f24 <pthread_mutex_lock>
20072fc: 90 10 00 1b mov %i3, %o0
if (rtems_chain_is_empty (chain))
2007300: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007304: 80 a7 40 01 cmp %i5, %g1
2007308: 02 80 00 05 be 200731c <rtems_aio_handle+0x16c> <== ALWAYS TAKEN
200730c: 92 07 bf f4 add %fp, -12, %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);
2007310: 40 00 03 25 call 2007fa4 <pthread_mutex_unlock>
2007314: 90 10 00 1b mov %i3, %o0
2007318: 30 bf ff ad b,a 20071cc <rtems_aio_handle+0x1c>
pthread_mutex_unlock (&r_chain->mutex);
pthread_mutex_lock (&aio_request_queue.mutex);
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
200731c: 40 00 01 50 call 200785c <clock_gettime>
2007320: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
2007324: c2 07 bf f4 ld [ %fp + -12 ], %g1
timeout.tv_nsec = 0;
2007328: c0 27 bf f8 clr [ %fp + -8 ]
pthread_mutex_lock (&aio_request_queue.mutex);
if (rtems_chain_is_empty (chain))
{
clock_gettime (CLOCK_REALTIME, &timeout);
timeout.tv_sec += 3;
200732c: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007330: 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;
2007334: c2 27 bf f4 st %g1, [ %fp + -12 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007338: 90 10 00 1d mov %i5, %o0
200733c: 92 10 00 1a mov %i2, %o1
2007340: 40 00 01 f4 call 2007b10 <pthread_cond_timedwait>
2007344: 94 07 bf f4 add %fp, -12, %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) {
2007348: 80 a2 20 74 cmp %o0, 0x74
200734c: 12 bf ff f1 bne 2007310 <rtems_aio_handle+0x160> <== NEVER TAKEN
2007350: 01 00 00 00 nop
2007354: 40 00 09 b7 call 2009a30 <_Chain_Extract>
2007358: 90 10 00 18 mov %i0, %o0
rtems_chain_extract (&r_chain->next_fd);
pthread_mutex_destroy (&r_chain->mutex);
200735c: 40 00 02 47 call 2007c78 <pthread_mutex_destroy>
2007360: 90 10 00 1c mov %i4, %o0
pthread_cond_destroy (&r_chain->cond);
2007364: 40 00 01 66 call 20078fc <pthread_cond_destroy>
2007368: 90 10 00 1d mov %i5, %o0
free (r_chain);
200736c: 7f ff f0 d2 call 20036b4 <free>
2007370: 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;
2007374: f0 06 e0 54 ld [ %i3 + 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)) {
2007378: 80 a6 00 19 cmp %i0, %i1
200737c: 22 80 00 0e be,a 20073b4 <rtems_aio_handle+0x204>
2007380: c4 06 e0 68 ld [ %i3 + 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;
2007384: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2
++aio_request_queue.active_threads;
2007388: c2 06 a0 64 ld [ %i2 + 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;
200738c: 84 00 bf ff add %g2, -1, %g2
++aio_request_queue.active_threads;
2007390: 82 00 60 01 inc %g1
2007394: 90 10 00 18 mov %i0, %o0
}
}
/* 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;
2007398: c4 26 a0 68 st %g2, [ %i2 + 0x68 ]
200739c: 40 00 09 a5 call 2009a30 <_Chain_Extract>
20073a0: c2 26 a0 64 st %g1, [ %i2 + 0x64 ]
20073a4: b8 06 20 1c add %i0, 0x1c, %i4
node = rtems_chain_first (&aio_request_queue.idle_req);
rtems_chain_extract (node);
r_chain = (rtems_aio_request_chain *) node;
rtems_aio_move_to_work (r_chain);
20073a8: 7f ff ff 64 call 2007138 <rtems_aio_move_to_work>
20073ac: 90 10 00 18 mov %i0, %o0
20073b0: 30 bf ff d8 b,a 2007310 <rtems_aio_handle+0x160>
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;
20073b4: c2 06 e0 64 ld [ %i3 + 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;
20073b8: 84 00 a0 01 inc %g2
--aio_request_queue.active_threads;
20073bc: 82 00 7f ff add %g1, -1, %g1
clock_gettime (CLOCK_REALTIME, &timeout);
20073c0: 92 07 bf f4 add %fp, -12, %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;
20073c4: c4 26 e0 68 st %g2, [ %i3 + 0x68 ]
--aio_request_queue.active_threads;
20073c8: c2 26 e0 64 st %g1, [ %i3 + 0x64 ]
clock_gettime (CLOCK_REALTIME, &timeout);
20073cc: 40 00 01 24 call 200785c <clock_gettime>
20073d0: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
20073d4: c2 07 bf f4 ld [ %fp + -12 ], %g1
timeout.tv_nsec = 0;
20073d8: c0 27 bf f8 clr [ %fp + -8 ]
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;
20073dc: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
20073e0: 90 10 00 10 mov %l0, %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;
20073e4: c2 27 bf f4 st %g1, [ %fp + -12 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
20073e8: 92 10 00 1b mov %i3, %o1
20073ec: 40 00 01 c9 call 2007b10 <pthread_cond_timedwait>
20073f0: 94 07 bf f4 add %fp, -12, %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) {
20073f4: 80 a2 20 74 cmp %o0, 0x74
20073f8: 22 80 00 04 be,a 2007408 <rtems_aio_handle+0x258> <== ALWAYS TAKEN
20073fc: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1
2007400: 10 bf ff e1 b 2007384 <rtems_aio_handle+0x1d4> <== NOT EXECUTED
2007404: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 <== NOT EXECUTED
AIO_printf ("Etimeout\n");
--aio_request_queue.idle_threads;
pthread_mutex_unlock (&aio_request_queue.mutex);
2007408: 90 10 00 1b mov %i3, %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;
200740c: 82 00 7f ff add %g1, -1, %g1
pthread_mutex_unlock (&aio_request_queue.mutex);
2007410: 40 00 02 e5 call 2007fa4 <pthread_mutex_unlock>
2007414: c2 26 e0 68 st %g1, [ %i3 + 0x68 ]
return NULL;
2007418: 30 bf ff 9b b,a 2007284 <rtems_aio_handle+0xd4>
02006f4c <rtems_aio_init>:
* 0 - if initialization succeeded
*/
int
rtems_aio_init (void)
{
2006f4c: 9d e3 bf a0 save %sp, -96, %sp
int result = 0;
result = pthread_attr_init (&aio_request_queue.attr);
2006f50: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2006f54: 40 00 04 5e call 20080cc <pthread_attr_init>
2006f58: 90 17 61 44 or %i5, 0x144, %o0 ! 2019d44 <aio_request_queue+0x8>
if (result != 0)
2006f5c: b0 92 20 00 orcc %o0, 0, %i0
2006f60: 12 80 00 23 bne 2006fec <rtems_aio_init+0xa0> <== NEVER TAKEN
2006f64: 90 17 61 44 or %i5, 0x144, %o0
return result;
result =
2006f68: 40 00 04 65 call 20080fc <pthread_attr_setdetachstate>
2006f6c: 92 10 20 00 clr %o1
pthread_attr_setdetachstate (&aio_request_queue.attr,
PTHREAD_CREATE_DETACHED);
if (result != 0)
2006f70: 80 a2 20 00 cmp %o0, 0
2006f74: 12 80 00 20 bne 2006ff4 <rtems_aio_init+0xa8> <== NEVER TAKEN
2006f78: 39 00 80 67 sethi %hi(0x2019c00), %i4
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
2006f7c: 92 10 20 00 clr %o1
2006f80: 40 00 03 91 call 2007dc4 <pthread_mutex_init>
2006f84: 90 17 21 3c or %i4, 0x13c, %o0
if (result != 0)
2006f88: 80 a2 20 00 cmp %o0, 0
2006f8c: 12 80 00 23 bne 2007018 <rtems_aio_init+0xcc> <== NEVER TAKEN
2006f90: 92 10 20 00 clr %o1
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
2006f94: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006f98: 40 00 02 8f call 20079d4 <pthread_cond_init>
2006f9c: 90 12 21 40 or %o0, 0x140, %o0 ! 2019d40 <aio_request_queue+0x4>
if (result != 0) {
2006fa0: b0 92 20 00 orcc %o0, 0, %i0
2006fa4: 12 80 00 26 bne 200703c <rtems_aio_init+0xf0> <== NEVER TAKEN
2006fa8: 01 00 00 00 nop
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fac: b8 17 21 3c or %i4, 0x13c, %i4
head->previous = NULL;
tail->previous = head;
2006fb0: 82 07 20 54 add %i4, 0x54, %g1
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fb4: 88 07 20 4c add %i4, 0x4c, %g4
head->previous = NULL;
tail->previous = head;
2006fb8: 86 07 20 48 add %i4, 0x48, %g3
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fbc: 84 07 20 58 add %i4, 0x58, %g2
head->previous = NULL;
tail->previous = head;
2006fc0: c2 27 20 5c st %g1, [ %i4 + 0x5c ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fc4: c8 27 20 48 st %g4, [ %i4 + 0x48 ]
head->previous = NULL;
2006fc8: c0 27 20 4c clr [ %i4 + 0x4c ]
tail->previous = head;
2006fcc: c6 27 20 50 st %g3, [ %i4 + 0x50 ]
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fd0: c4 27 20 54 st %g2, [ %i4 + 0x54 ]
head->previous = NULL;
2006fd4: c0 27 20 58 clr [ %i4 + 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;
2006fd8: c0 27 20 64 clr [ %i4 + 0x64 ]
aio_request_queue.idle_threads = 0;
2006fdc: c0 27 20 68 clr [ %i4 + 0x68 ]
aio_request_queue.initialized = AIO_QUEUE_INITIALIZED;
2006fe0: 03 00 00 2c sethi %hi(0xb000), %g1
2006fe4: 82 10 60 0b or %g1, 0xb, %g1 ! b00b <PROM_START+0xb00b>
2006fe8: c2 27 20 60 st %g1, [ %i4 + 0x60 ]
return result;
}
2006fec: 81 c7 e0 08 ret
2006ff0: 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);
2006ff4: 40 00 04 2a call 200809c <pthread_attr_destroy> <== NOT EXECUTED
2006ff8: 90 17 61 44 or %i5, 0x144, %o0 <== NOT EXECUTED
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
2006ffc: 39 00 80 67 sethi %hi(0x2019c00), %i4 <== NOT EXECUTED
2007000: 92 10 20 00 clr %o1 <== NOT EXECUTED
2007004: 40 00 03 70 call 2007dc4 <pthread_mutex_init> <== NOT EXECUTED
2007008: 90 17 21 3c or %i4, 0x13c, %o0 <== NOT EXECUTED
if (result != 0)
200700c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
2007010: 02 bf ff e1 be 2006f94 <rtems_aio_init+0x48> <== NOT EXECUTED
2007014: 92 10 20 00 clr %o1 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
2007018: 40 00 04 21 call 200809c <pthread_attr_destroy> <== NOT EXECUTED
200701c: 90 17 61 44 or %i5, 0x144, %o0 <== NOT EXECUTED
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
2007020: 92 10 20 00 clr %o1 <== NOT EXECUTED
2007024: 11 00 80 67 sethi %hi(0x2019c00), %o0 <== NOT EXECUTED
2007028: 40 00 02 6b call 20079d4 <pthread_cond_init> <== NOT EXECUTED
200702c: 90 12 21 40 or %o0, 0x140, %o0 ! 2019d40 <aio_request_queue+0x4><== NOT EXECUTED
if (result != 0) {
2007030: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED
2007034: 22 bf ff df be,a 2006fb0 <rtems_aio_init+0x64> <== NOT EXECUTED
2007038: b8 17 21 3c or %i4, 0x13c, %i4 <== NOT EXECUTED
pthread_mutex_destroy (&aio_request_queue.mutex);
200703c: 40 00 03 0f call 2007c78 <pthread_mutex_destroy> <== NOT EXECUTED
2007040: 90 17 21 3c or %i4, 0x13c, %o0 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
2007044: 40 00 04 16 call 200809c <pthread_attr_destroy> <== NOT EXECUTED
2007048: 90 17 61 44 or %i5, 0x144, %o0 <== NOT EXECUTED
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
200704c: 10 bf ff d9 b 2006fb0 <rtems_aio_init+0x64> <== NOT EXECUTED
2007050: b8 17 21 3c or %i4, 0x13c, %i4 <== NOT EXECUTED
0200741c <rtems_aio_insert_prio>:
* NONE
*/
void
rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req)
{
200741c: 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;
2007420: 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 );
2007424: 84 06 20 04 add %i0, 4, %g2
rtems_chain_node *node;
AIO_printf ("FD exists \n");
node = rtems_chain_first (chain);
if (rtems_chain_is_empty (chain)) {
2007428: 80 a0 40 02 cmp %g1, %g2
200742c: 02 80 00 15 be 2007480 <rtems_aio_insert_prio+0x64> <== NEVER TAKEN
2007430: 86 10 00 19 mov %i1, %g3
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 &&
2007434: de 06 60 14 ld [ %i1 + 0x14 ], %o7
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;
2007438: c8 00 60 14 ld [ %g1 + 0x14 ], %g4
while (req->aiocbp->aio_reqprio > prio &&
200743c: de 03 e0 18 ld [ %o7 + 0x18 ], %o7
2007440: c8 01 20 18 ld [ %g4 + 0x18 ], %g4
2007444: 80 a1 00 0f cmp %g4, %o7
2007448: 26 80 00 07 bl,a 2007464 <rtems_aio_insert_prio+0x48> <== NEVER TAKEN
200744c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
RTEMS_INLINE_ROUTINE void rtems_chain_insert(
rtems_chain_node *after_node,
rtems_chain_node *the_node
)
{
_Chain_Insert( after_node, the_node );
2007450: 10 80 00 0b b 200747c <rtems_aio_insert_prio+0x60>
2007454: f0 00 60 04 ld [ %g1 + 4 ], %i0
2007458: 22 80 00 09 be,a 200747c <rtems_aio_insert_prio+0x60> <== NOT EXECUTED
200745c: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
2007460: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
while (req->aiocbp->aio_reqprio > prio &&
!rtems_chain_is_tail (chain, node)) {
node = rtems_chain_next (node);
prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio;
2007464: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== 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 &&
2007468: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED
200746c: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED
2007470: 06 bf ff fa bl 2007458 <rtems_aio_insert_prio+0x3c> <== NOT EXECUTED
2007474: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED
2007478: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED
200747c: b2 10 00 03 mov %g3, %i1
2007480: 40 00 09 84 call 2009a90 <_Chain_Insert>
2007484: 81 e8 00 00 restore
02007138 <rtems_aio_move_to_work>:
* NONE
*/
void
rtems_aio_move_to_work (rtems_aio_request_chain *r_chain)
{
2007138: 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;
200713c: 05 00 80 67 sethi %hi(0x2019c00), %g2
2007140: 84 10 a1 3c or %g2, 0x13c, %g2 ! 2019d3c <aio_request_queue>
2007144: c2 00 a0 48 ld [ %g2 + 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 &&
2007148: de 06 20 14 ld [ %i0 + 0x14 ], %o7
200714c: c8 00 60 14 ld [ %g1 + 0x14 ], %g4
* NONE
*/
void
rtems_aio_move_to_work (rtems_aio_request_chain *r_chain)
{
2007150: b2 10 00 18 mov %i0, %i1
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 &&
2007154: 80 a1 00 0f cmp %g4, %o7
2007158: 16 80 00 10 bge 2007198 <rtems_aio_move_to_work+0x60> <== NEVER TAKEN
200715c: 86 10 00 01 mov %g1, %g3
2007160: 84 00 a0 4c add %g2, 0x4c, %g2
2007164: 80 a0 40 02 cmp %g1, %g2
2007168: 32 80 00 08 bne,a 2007188 <rtems_aio_move_to_work+0x50> <== ALWAYS TAKEN
200716c: c6 00 40 00 ld [ %g1 ], %g3
2007170: 10 80 00 0b b 200719c <rtems_aio_move_to_work+0x64> <== NOT EXECUTED
2007174: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED
2007178: 80 a0 c0 02 cmp %g3, %g2
200717c: 02 80 00 0a be 20071a4 <rtems_aio_move_to_work+0x6c> <== NEVER TAKEN
2007180: 86 10 00 02 mov %g2, %g3
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
2007184: c6 00 40 00 ld [ %g1 ], %g3
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 &&
2007188: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4
200718c: 80 a1 00 0f cmp %g4, %o7
2007190: 06 bf ff fa bl 2007178 <rtems_aio_move_to_work+0x40>
2007194: 82 10 00 03 mov %g3, %g1
2007198: f0 00 e0 04 ld [ %g3 + 4 ], %i0
200719c: 40 00 0a 3d call 2009a90 <_Chain_Insert>
20071a0: 81 e8 00 00 restore
20071a4: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED
20071a8: 40 00 0a 3a call 2009a90 <_Chain_Insert> <== NOT EXECUTED
20071ac: 81 e8 00 00 restore <== NOT EXECUTED
02007488 <rtems_aio_remove_fd>:
* Output parameters:
* NONE
*/
void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain)
{
2007488: 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;
200748c: fa 06 20 08 ld [ %i0 + 8 ], %i5
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;
2007490: b4 10 20 8c mov 0x8c, %i2
RTEMS_INLINE_ROUTINE bool _Chain_Is_tail(
Chain_Control *the_chain,
const Chain_Node *the_node
)
{
return (the_node == _Chain_Tail(the_chain));
2007494: 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))
2007498: 80 a7 40 18 cmp %i5, %i0
200749c: 02 80 00 0d be 20074d0 <rtems_aio_remove_fd+0x48> <== NEVER TAKEN
20074a0: b6 10 3f ff mov -1, %i3
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
20074a4: 40 00 09 63 call 2009a30 <_Chain_Extract>
20074a8: 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;
20074ac: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
20074b0: f8 07 40 00 ld [ %i5 ], %i4
rtems_chain_extract (node);
rtems_aio_request *req = (rtems_aio_request *) node;
node = rtems_chain_next (node);
req->aiocbp->error_code = ECANCELED;
req->aiocbp->return_value = -1;
free (req);
20074b4: 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;
20074b8: f4 20 60 34 st %i2, [ %g1 + 0x34 ]
req->aiocbp->return_value = -1;
free (req);
20074bc: 7f ff f0 7e call 20036b4 <free>
20074c0: f6 20 60 38 st %i3, [ %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))
20074c4: 80 a7 00 18 cmp %i4, %i0
20074c8: 12 bf ff f7 bne 20074a4 <rtems_aio_remove_fd+0x1c>
20074cc: ba 10 00 1c mov %i4, %i5
20074d0: 81 c7 e0 08 ret
20074d4: 81 e8 00 00 restore
020074d8 <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)
{
20074d8: 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;
20074dc: 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 );
20074e0: 82 06 20 04 add %i0, 4, %g1
if (rtems_chain_is_empty (chain))
20074e4: 80 a7 40 01 cmp %i5, %g1
20074e8: 12 80 00 06 bne 2007500 <rtems_aio_remove_req+0x28>
20074ec: b0 10 20 02 mov 2, %i0
20074f0: 30 80 00 14 b,a 2007540 <rtems_aio_remove_req+0x68>
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) {
20074f4: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED
20074f8: 02 80 00 10 be 2007538 <rtems_aio_remove_req+0x60> <== NOT EXECUTED
20074fc: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED
2007500: c4 07 60 14 ld [ %i5 + 0x14 ], %g2
2007504: 80 a0 80 19 cmp %g2, %i1
2007508: 32 bf ff fb bne,a 20074f4 <rtems_aio_remove_req+0x1c> <== NEVER TAKEN
200750c: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED
2007510: 40 00 09 48 call 2009a30 <_Chain_Extract>
2007514: 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;
2007518: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200751c: 84 10 20 8c mov 0x8c, %g2
2007520: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
current->aiocbp->return_value = -1;
2007524: 84 10 3f ff mov -1, %g2
free (current);
2007528: 90 10 00 1d mov %i5, %o0
return AIO_NOTCANCELED;
else
{
rtems_chain_extract (node);
current->aiocbp->error_code = ECANCELED;
current->aiocbp->return_value = -1;
200752c: c4 20 60 38 st %g2, [ %g1 + 0x38 ]
free (current);
2007530: 7f ff f0 61 call 20036b4 <free>
2007534: b0 10 20 00 clr %i0
}
return AIO_CANCELED;
2007538: 81 c7 e0 08 ret
200753c: 81 e8 00 00 restore
}
2007540: 81 c7 e0 08 ret
2007544: 81 e8 00 00 restore
02007184 <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
2007184: 9d e3 bf 98 save %sp, -104, %sp
2007188: ba 10 00 18 mov %i0, %i5
*/
RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get(
rtems_chain_control *the_chain
)
{
return _Chain_Get( the_chain );
200718c: 40 00 01 a0 call 200780c <_Chain_Get>
2007190: 90 10 00 1d mov %i5, %o0
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
) {
rtems_event_set out;
sc = rtems_event_receive(
2007194: 92 10 20 00 clr %o1
2007198: b8 10 00 08 mov %o0, %i4
200719c: 94 10 00 1a mov %i2, %o2
20071a0: 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
20071a4: 80 a7 20 00 cmp %i4, 0
20071a8: 12 80 00 0a bne 20071d0 <rtems_chain_get_with_wait+0x4c>
20071ac: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
20071b0: 7f ff fc f4 call 2006580 <rtems_event_receive>
20071b4: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
20071b8: 80 a2 20 00 cmp %o0, 0
20071bc: 02 bf ff f4 be 200718c <rtems_chain_get_with_wait+0x8> <== NEVER TAKEN
20071c0: b0 10 00 08 mov %o0, %i0
timeout,
&out
);
}
*node_ptr = node;
20071c4: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
20071c8: 81 c7 e0 08 ret
20071cc: 81 e8 00 00 restore
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
sc == RTEMS_SUCCESSFUL
&& (node = rtems_chain_get( chain )) == NULL
20071d0: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
20071d4: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
20071d8: 81 c7 e0 08 ret
20071dc: 91 e8 00 08 restore %g0, %o0, %o0
02007e10 <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
)
{
2007e10: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
2007e14: 03 00 80 6c sethi %hi(0x201b000), %g1
2007e18: c4 00 63 f8 ld [ %g1 + 0x3f8 ], %g2 ! 201b3f8 <_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
)
{
2007e1c: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
2007e20: 03 00 80 6e sethi %hi(0x201b800), %g1
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
2007e24: 88 10 20 12 mov 0x12, %g4
rtems_device_major_number *registered_major
)
{
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
2007e28: 80 a0 a0 00 cmp %g2, 0
2007e2c: 02 80 00 04 be 2007e3c <rtems_io_register_driver+0x2c>
2007e30: de 00 60 34 ld [ %g1 + 0x34 ], %o7
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007e34: 81 c7 e0 08 ret
2007e38: 91 e8 00 04 restore %g0, %g4, %o0
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
if ( registered_major == NULL )
2007e3c: 80 a6 a0 00 cmp %i2, 0
2007e40: 02 80 00 40 be 2007f40 <rtems_io_register_driver+0x130>
2007e44: 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 )
2007e48: 02 80 00 3e be 2007f40 <rtems_io_register_driver+0x130>
2007e4c: de 26 80 00 st %o7, [ %i2 ]
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007e50: c4 06 40 00 ld [ %i1 ], %g2
2007e54: 80 a0 a0 00 cmp %g2, 0
2007e58: 22 80 00 37 be,a 2007f34 <rtems_io_register_driver+0x124>
2007e5c: 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 )
2007e60: 80 a3 c0 18 cmp %o7, %i0
2007e64: 08 bf ff f4 bleu 2007e34 <rtems_io_register_driver+0x24>
2007e68: 88 10 20 0a mov 0xa, %g4
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2007e6c: 05 00 80 6b sethi %hi(0x201ac00), %g2
2007e70: c8 00 a2 b0 ld [ %g2 + 0x2b0 ], %g4 ! 201aeb0 <_Thread_Dispatch_disable_level>
2007e74: 88 01 20 01 inc %g4
2007e78: c8 20 a2 b0 st %g4, [ %g2 + 0x2b0 ]
return _Thread_Dispatch_disable_level;
2007e7c: c4 00 a2 b0 ld [ %g2 + 0x2b0 ], %g2
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
2007e80: 80 a6 20 00 cmp %i0, 0
2007e84: 12 80 00 32 bne 2007f4c <rtems_io_register_driver+0x13c>
2007e88: 1f 00 80 6e sethi %hi(0x201b800), %o7
static rtems_status_code rtems_io_obtain_major_number(
rtems_device_major_number *major
)
{
rtems_device_major_number n = _IO_Number_of_drivers;
2007e8c: c8 00 60 34 ld [ %g1 + 0x34 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2007e90: 80 a1 20 00 cmp %g4, 0
2007e94: 02 80 00 45 be 2007fa8 <rtems_io_register_driver+0x198> <== NEVER TAKEN
2007e98: c2 03 e0 38 ld [ %o7 + 0x38 ], %g1
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007e9c: 10 80 00 06 b 2007eb4 <rtems_io_register_driver+0xa4>
2007ea0: c4 00 40 00 ld [ %g1 ], %g2
rtems_device_major_number n = _IO_Number_of_drivers;
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2007ea4: 80 a6 00 04 cmp %i0, %g4
2007ea8: 02 80 00 35 be 2007f7c <rtems_io_register_driver+0x16c>
2007eac: 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;
2007eb0: c4 00 40 00 ld [ %g1 ], %g2
2007eb4: 80 a0 a0 00 cmp %g2, 0
2007eb8: 32 bf ff fb bne,a 2007ea4 <rtems_io_register_driver+0x94>
2007ebc: b0 06 20 01 inc %i0
2007ec0: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007ec4: 80 a0 a0 00 cmp %g2, 0
2007ec8: 32 bf ff f7 bne,a 2007ea4 <rtems_io_register_driver+0x94>
2007ecc: b0 06 20 01 inc %i0
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007ed0: f0 26 80 00 st %i0, [ %i2 ]
2007ed4: 83 2e 20 03 sll %i0, 3, %g1
if ( m != n )
2007ed8: 80 a1 00 18 cmp %g4, %i0
2007edc: 02 80 00 29 be 2007f80 <rtems_io_register_driver+0x170> <== NEVER TAKEN
2007ee0: 9b 2e 20 05 sll %i0, 5, %o5
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007ee4: c8 00 c0 00 ld [ %g3 ], %g4
2007ee8: c4 03 e0 38 ld [ %o7 + 0x38 ], %g2
2007eec: 82 23 40 01 sub %o5, %g1, %g1
2007ef0: c8 20 80 01 st %g4, [ %g2 + %g1 ]
2007ef4: c8 00 e0 04 ld [ %g3 + 4 ], %g4
2007ef8: 82 00 80 01 add %g2, %g1, %g1
2007efc: c8 20 60 04 st %g4, [ %g1 + 4 ]
2007f00: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007f04: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007f08: c4 20 60 08 st %g2, [ %g1 + 8 ]
2007f0c: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007f10: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007f14: c4 20 60 0c st %g2, [ %g1 + 0xc ]
2007f18: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
2007f1c: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
2007f20: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
2007f24: 40 00 08 4b call 200a050 <_Thread_Enable_dispatch>
2007f28: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
2007f2c: 40 00 23 a1 call 2010db0 <rtems_io_initialize>
2007f30: 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;
2007f34: 80 a0 a0 00 cmp %g2, 0
2007f38: 12 bf ff cb bne 2007e64 <rtems_io_register_driver+0x54>
2007f3c: 80 a3 c0 18 cmp %o7, %i0
if ( driver_table == NULL )
return RTEMS_INVALID_ADDRESS;
if ( rtems_io_is_empty_table( driver_table ) )
return RTEMS_INVALID_ADDRESS;
2007f40: 88 10 20 09 mov 9, %g4
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007f44: 81 c7 e0 08 ret
2007f48: 91 e8 00 04 restore %g0, %g4, %o0
_Thread_Enable_dispatch();
return sc;
}
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
2007f4c: c8 03 e0 38 ld [ %o7 + 0x38 ], %g4
2007f50: 83 2e 20 03 sll %i0, 3, %g1
2007f54: 9b 2e 20 05 sll %i0, 5, %o5
2007f58: 84 23 40 01 sub %o5, %g1, %g2
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007f5c: d8 01 00 02 ld [ %g4 + %g2 ], %o4
2007f60: 80 a3 20 00 cmp %o4, 0
2007f64: 02 80 00 0b be 2007f90 <rtems_io_register_driver+0x180>
2007f68: 84 01 00 02 add %g4, %g2, %g2
major = *registered_major;
} else {
rtems_driver_address_table *const table = _IO_Driver_address_table + major;
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
2007f6c: 40 00 08 39 call 200a050 <_Thread_Enable_dispatch>
2007f70: 01 00 00 00 nop
return RTEMS_RESOURCE_IN_USE;
2007f74: 10 bf ff b0 b 2007e34 <rtems_io_register_driver+0x24>
2007f78: 88 10 20 0c mov 0xc, %g4 ! c <PROM_START+0xc>
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007f7c: f0 26 80 00 st %i0, [ %i2 ]
if ( major == 0 ) {
rtems_status_code sc = rtems_io_obtain_major_number( registered_major );
if ( sc != RTEMS_SUCCESSFUL ) {
_Thread_Enable_dispatch();
2007f80: 40 00 08 34 call 200a050 <_Thread_Enable_dispatch>
2007f84: 01 00 00 00 nop
return sc;
2007f88: 10 bf ff ab b 2007e34 <rtems_io_register_driver+0x24>
2007f8c: 88 10 20 05 mov 5, %g4 ! 5 <PROM_START+0x5>
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007f90: c4 00 a0 04 ld [ %g2 + 4 ], %g2
2007f94: 80 a0 a0 00 cmp %g2, 0
2007f98: 12 bf ff f5 bne 2007f6c <rtems_io_register_driver+0x15c>
2007f9c: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
2007fa0: 10 bf ff d1 b 2007ee4 <rtems_io_register_driver+0xd4>
2007fa4: f0 26 80 00 st %i0, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007fa8: 10 bf ff f6 b 2007f80 <rtems_io_register_driver+0x170> <== NOT EXECUTED
2007fac: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
0200959c <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)
{
200959c: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
20095a0: 80 a6 20 00 cmp %i0, 0
20095a4: 02 80 00 20 be 2009624 <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
20095a8: 37 00 80 81 sethi %hi(0x2020400), %i3
20095ac: b6 16 e1 4c or %i3, 0x14c, %i3 ! 202054c <_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)
20095b0: 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 ];
20095b4: c2 06 c0 00 ld [ %i3 ], %g1
20095b8: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
20095bc: 80 a7 20 00 cmp %i4, 0
20095c0: 22 80 00 16 be,a 2009618 <rtems_iterate_over_all_threads+0x7c>
20095c4: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
20095c8: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
20095cc: 84 90 60 00 orcc %g1, 0, %g2
20095d0: 22 80 00 12 be,a 2009618 <rtems_iterate_over_all_threads+0x7c>
20095d4: b6 06 e0 04 add %i3, 4, %i3
20095d8: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
20095dc: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
20095e0: 83 2f 60 02 sll %i5, 2, %g1
20095e4: c2 00 c0 01 ld [ %g3 + %g1 ], %g1
if ( !the_thread )
20095e8: 90 90 60 00 orcc %g1, 0, %o0
20095ec: 02 80 00 05 be 2009600 <rtems_iterate_over_all_threads+0x64>
20095f0: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
20095f4: 9f c6 00 00 call %i0
20095f8: 01 00 00 00 nop
20095fc: c4 17 20 10 lduh [ %i4 + 0x10 ], %g2
information = _Objects_Information_table[ api_index ][ 1 ];
if ( !information )
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
2009600: 83 28 a0 10 sll %g2, 0x10, %g1
2009604: 83 30 60 10 srl %g1, 0x10, %g1
2009608: 80 a0 40 1d cmp %g1, %i5
200960c: 3a bf ff f5 bcc,a 20095e0 <rtems_iterate_over_all_threads+0x44>
2009610: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
2009614: 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++ ) {
2009618: 80 a6 c0 1a cmp %i3, %i2
200961c: 32 bf ff e7 bne,a 20095b8 <rtems_iterate_over_all_threads+0x1c>
2009620: c2 06 c0 00 ld [ %i3 ], %g1
2009624: 81 c7 e0 08 ret
2009628: 81 e8 00 00 restore
020081c8 <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
)
{
20081c8: 9d e3 bf a0 save %sp, -96, %sp
20081cc: 90 10 00 18 mov %i0, %o0
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
20081d0: 80 a6 a0 00 cmp %i2, 0
20081d4: 02 80 00 21 be 2008258 <rtems_object_get_class_information+0x90>
20081d8: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
20081dc: 93 2e 60 10 sll %i1, 0x10, %o1
if ( !obj_info )
return RTEMS_INVALID_NUMBER;
20081e0: b0 10 20 0a mov 0xa, %i0
* Validate parameters and look up information structure.
*/
if ( !info )
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
20081e4: 40 00 07 82 call 2009fec <_Objects_Get_information>
20081e8: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
20081ec: 80 a2 20 00 cmp %o0, 0
20081f0: 02 80 00 1a be 2008258 <rtems_object_get_class_information+0x90>
20081f4: 01 00 00 00 nop
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
20081f8: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
20081fc: 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;
2008200: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
2008204: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
2008208: c4 26 a0 04 st %g2, [ %i2 + 4 ]
return RTEMS_INVALID_NUMBER;
/*
* Return information about this object class to the user.
*/
info->minimum_id = obj_info->minimum_id;
200820c: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
2008210: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
2008214: c8 26 a0 08 st %g4, [ %i2 + 8 ]
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
2008218: 80 a1 20 00 cmp %g4, 0
200821c: 02 80 00 0d be 2008250 <rtems_object_get_class_information+0x88><== NEVER TAKEN
2008220: 84 10 20 00 clr %g2
2008224: de 02 20 1c ld [ %o0 + 0x1c ], %o7
2008228: 86 10 20 01 mov 1, %g3
200822c: 82 10 20 01 mov 1, %g1
if ( !obj_info->local_table[i] )
2008230: 87 28 e0 02 sll %g3, 2, %g3
2008234: c6 03 c0 03 ld [ %o7 + %g3 ], %g3
info->minimum_id = obj_info->minimum_id;
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
2008238: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
200823c: 80 a0 00 03 cmp %g0, %g3
2008240: 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++ )
2008244: 80 a1 00 01 cmp %g4, %g1
2008248: 1a bf ff fa bcc 2008230 <rtems_object_get_class_information+0x68>
200824c: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
2008250: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
2008254: b0 10 20 00 clr %i0
}
2008258: 81 c7 e0 08 ret
200825c: 81 e8 00 00 restore
02013dcc <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
2013dcc: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2013dd0: 80 a6 20 00 cmp %i0, 0
2013dd4: 12 80 00 04 bne 2013de4 <rtems_partition_create+0x18>
2013dd8: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013ddc: 81 c7 e0 08 ret
2013de0: 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 )
2013de4: 80 a6 60 00 cmp %i1, 0
2013de8: 02 bf ff fd be 2013ddc <rtems_partition_create+0x10>
2013dec: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2013df0: 80 a7 60 00 cmp %i5, 0
2013df4: 02 bf ff fa be 2013ddc <rtems_partition_create+0x10> <== NEVER TAKEN
2013df8: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2013dfc: 02 bf ff f8 be 2013ddc <rtems_partition_create+0x10>
2013e00: 82 10 20 08 mov 8, %g1
2013e04: 80 a6 a0 00 cmp %i2, 0
2013e08: 02 bf ff f5 be 2013ddc <rtems_partition_create+0x10>
2013e0c: 80 a6 80 1b cmp %i2, %i3
2013e10: 0a bf ff f3 bcs 2013ddc <rtems_partition_create+0x10>
2013e14: 80 8e e0 07 btst 7, %i3
2013e18: 12 bf ff f1 bne 2013ddc <rtems_partition_create+0x10>
2013e1c: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
2013e20: 12 bf ff ef bne 2013ddc <rtems_partition_create+0x10>
2013e24: 82 10 20 09 mov 9, %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2013e28: 03 00 80 ee sethi %hi(0x203b800), %g1
2013e2c: c4 00 60 00 ld [ %g1 ], %g2
2013e30: 84 00 a0 01 inc %g2
2013e34: c4 20 60 00 st %g2, [ %g1 ]
return _Thread_Dispatch_disable_level;
2013e38: c2 00 60 00 ld [ %g1 ], %g1
* This function allocates a partition control block from
* the inactive chain of free partition control blocks.
*/
RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Allocate ( void )
{
return (Partition_Control *) _Objects_Allocate( &_Partition_Information );
2013e3c: 23 00 80 ed sethi %hi(0x203b400), %l1
2013e40: 40 00 13 78 call 2018c20 <_Objects_Allocate>
2013e44: 90 14 62 14 or %l1, 0x214, %o0 ! 203b614 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2013e48: a0 92 20 00 orcc %o0, 0, %l0
2013e4c: 02 80 00 1a be 2013eb4 <rtems_partition_create+0xe8>
2013e50: 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;
2013e54: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
2013e58: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
2013e5c: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
2013e60: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
2013e64: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
2013e68: 40 00 5c 6a call 202b010 <.udiv>
2013e6c: 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,
2013e70: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
2013e74: 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,
2013e78: 96 10 00 1b mov %i3, %o3
2013e7c: b8 04 20 24 add %l0, 0x24, %i4
2013e80: 40 00 0c fc call 2017270 <_Chain_Initialize>
2013e84: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013e88: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013e8c: a2 14 62 14 or %l1, 0x214, %l1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013e90: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013e94: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013e98: 85 28 a0 02 sll %g2, 2, %g2
2013e9c: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2013ea0: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
2013ea4: 40 00 18 b8 call 201a184 <_Thread_Enable_dispatch>
2013ea8: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
2013eac: 10 bf ff cc b 2013ddc <rtems_partition_create+0x10>
2013eb0: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
2013eb4: 40 00 18 b4 call 201a184 <_Thread_Enable_dispatch>
2013eb8: 01 00 00 00 nop
return RTEMS_TOO_MANY;
2013ebc: 10 bf ff c8 b 2013ddc <rtems_partition_create+0x10>
2013ec0: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
02007630 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
2007630: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Rate_monotonic_Control *)
2007634: 11 00 80 7e sethi %hi(0x201f800), %o0
2007638: 92 10 00 18 mov %i0, %o1
200763c: 90 12 20 44 or %o0, 0x44, %o0
2007640: 40 00 09 82 call 2009c48 <_Objects_Get>
2007644: 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 ) {
2007648: c2 07 bf fc ld [ %fp + -4 ], %g1
200764c: 80 a0 60 00 cmp %g1, 0
2007650: 12 80 00 0d bne 2007684 <rtems_rate_monotonic_period+0x54>
2007654: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
2007658: 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 );
200765c: 39 00 80 7f sethi %hi(0x201fc00), %i4
2007660: b8 17 22 f0 or %i4, 0x2f0, %i4 ! 201fef0 <_Per_CPU_Information>
2007664: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007668: 80 a0 80 01 cmp %g2, %g1
200766c: 02 80 00 08 be 200768c <rtems_rate_monotonic_period+0x5c>
2007670: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
2007674: 40 00 0d 73 call 200ac40 <_Thread_Enable_dispatch>
2007678: b0 10 20 17 mov 0x17, %i0
return RTEMS_NOT_OWNER_OF_RESOURCE;
200767c: 81 c7 e0 08 ret
2007680: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2007684: 81 c7 e0 08 ret
2007688: 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 ) {
200768c: 12 80 00 0e bne 20076c4 <rtems_rate_monotonic_period+0x94>
2007690: 01 00 00 00 nop
switch ( the_period->state ) {
2007694: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2007698: 80 a0 60 04 cmp %g1, 4
200769c: 18 80 00 06 bgu 20076b4 <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
20076a0: b0 10 20 00 clr %i0
20076a4: 83 28 60 02 sll %g1, 2, %g1
20076a8: 05 00 80 75 sethi %hi(0x201d400), %g2
20076ac: 84 10 a2 34 or %g2, 0x234, %g2 ! 201d634 <CSWTCH.2>
20076b0: f0 00 80 01 ld [ %g2 + %g1 ], %i0
the_period->state = RATE_MONOTONIC_ACTIVE;
the_period->next_length = length;
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Scheduler_Release_job(the_period->owner, the_period->next_length);
_Thread_Enable_dispatch();
20076b4: 40 00 0d 63 call 200ac40 <_Thread_Enable_dispatch>
20076b8: 01 00 00 00 nop
return RTEMS_TIMEOUT;
20076bc: 81 c7 e0 08 ret
20076c0: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
20076c4: 7f ff ed d8 call 2002e24 <sparc_disable_interrupts>
20076c8: 01 00 00 00 nop
20076cc: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
20076d0: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
20076d4: 80 a6 e0 00 cmp %i3, 0
20076d8: 02 80 00 19 be 200773c <rtems_rate_monotonic_period+0x10c>
20076dc: 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 ) {
20076e0: 02 80 00 2e be 2007798 <rtems_rate_monotonic_period+0x168>
20076e4: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
20076e8: 12 bf ff e5 bne 200767c <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
20076ec: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
20076f0: 7f ff ff 92 call 2007538 <_Rate_monotonic_Update_statistics>
20076f4: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
20076f8: 7f ff ed cf call 2002e34 <sparc_enable_interrupts>
20076fc: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2007700: 82 10 20 02 mov 2, %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007704: 92 07 60 10 add %i5, 0x10, %o1
2007708: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
200770c: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007710: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007714: 11 00 80 7e sethi %hi(0x201f800), %o0
2007718: 40 00 11 6f call 200bcd4 <_Watchdog_Insert>
200771c: 90 12 22 6c or %o0, 0x26c, %o0 ! 201fa6c <_Watchdog_Ticks_chain>
2007720: d0 07 60 40 ld [ %i5 + 0x40 ], %o0
2007724: d2 07 60 3c ld [ %i5 + 0x3c ], %o1
2007728: 03 00 80 7b sethi %hi(0x201ec00), %g1
200772c: c2 00 60 78 ld [ %g1 + 0x78 ], %g1 ! 201ec78 <_Scheduler+0x34>
2007730: 9f c0 40 00 call %g1
2007734: b0 10 20 06 mov 6, %i0
2007738: 30 bf ff df b,a 20076b4 <rtems_rate_monotonic_period+0x84>
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
200773c: 7f ff ed be call 2002e34 <sparc_enable_interrupts>
2007740: 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 );
2007744: 90 10 00 1d mov %i5, %o0
2007748: 7f ff ff 56 call 20074a0 <_Rate_monotonic_Initiate_statistics>
200774c: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
the_period->state = RATE_MONOTONIC_ACTIVE;
2007750: 82 10 20 02 mov 2, %g1
2007754: 92 07 60 10 add %i5, 0x10, %o1
2007758: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
200775c: 11 00 80 7e sethi %hi(0x201f800), %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007760: 03 00 80 1e sethi %hi(0x2007800), %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007764: 90 12 22 6c or %o0, 0x26c, %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007768: 82 10 62 ec or %g1, 0x2ec, %g1
the_watchdog->id = id;
200776c: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007770: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2007774: c0 27 60 18 clr [ %i5 + 0x18 ]
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
2007778: c0 27 60 34 clr [ %i5 + 0x34 ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200777c: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007780: 40 00 11 55 call 200bcd4 <_Watchdog_Insert>
2007784: b0 10 20 00 clr %i0
id,
NULL
);
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
2007788: 40 00 0d 2e call 200ac40 <_Thread_Enable_dispatch>
200778c: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2007790: 81 c7 e0 08 ret
2007794: 81 e8 00 00 restore
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
2007798: 7f ff ff 68 call 2007538 <_Rate_monotonic_Update_statistics>
200779c: 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;
20077a0: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
20077a4: 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;
20077a8: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
20077ac: 7f ff ed a2 call 2002e34 <sparc_enable_interrupts>
20077b0: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
20077b4: c2 07 20 0c ld [ %i4 + 0xc ], %g1
20077b8: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
20077bc: 90 10 00 01 mov %g1, %o0
20077c0: 13 00 00 10 sethi %hi(0x4000), %o1
20077c4: 40 00 0f 7b call 200b5b0 <_Thread_Set_state>
20077c8: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
20077cc: 7f ff ed 96 call 2002e24 <sparc_disable_interrupts>
20077d0: 01 00 00 00 nop
local_state = the_period->state;
20077d4: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
20077d8: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
20077dc: 7f ff ed 96 call 2002e34 <sparc_enable_interrupts>
20077e0: 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 )
20077e4: 80 a6 a0 03 cmp %i2, 3
20077e8: 22 80 00 06 be,a 2007800 <rtems_rate_monotonic_period+0x1d0>
20077ec: d0 07 20 0c ld [ %i4 + 0xc ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
20077f0: 40 00 0d 14 call 200ac40 <_Thread_Enable_dispatch>
20077f4: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
20077f8: 81 c7 e0 08 ret
20077fc: 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 );
2007800: 40 00 0c 1b call 200a86c <_Thread_Clear_state>
2007804: 13 00 00 10 sethi %hi(0x4000), %o1
2007808: 30 bf ff fa b,a 20077f0 <rtems_rate_monotonic_period+0x1c0>
0200780c <rtems_rate_monotonic_report_statistics_with_plugin>:
*/
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
200780c: 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 )
2007810: 80 a6 60 00 cmp %i1, 0
2007814: 02 80 00 48 be 2007934 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
2007818: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
200781c: 13 00 80 75 sethi %hi(0x201d400), %o1
2007820: 9f c6 40 00 call %i1
2007824: 92 12 62 48 or %o1, 0x248, %o1 ! 201d648 <CSWTCH.2+0x14>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
2007828: 90 10 00 18 mov %i0, %o0
200782c: 13 00 80 75 sethi %hi(0x201d400), %o1
2007830: 9f c6 40 00 call %i1
2007834: 92 12 62 68 or %o1, 0x268, %o1 ! 201d668 <CSWTCH.2+0x34>
(*print)( context, "--- Wall times are in seconds ---\n" );
2007838: 90 10 00 18 mov %i0, %o0
200783c: 13 00 80 75 sethi %hi(0x201d400), %o1
2007840: 9f c6 40 00 call %i1
2007844: 92 12 62 90 or %o1, 0x290, %o1 ! 201d690 <CSWTCH.2+0x5c>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
2007848: 90 10 00 18 mov %i0, %o0
200784c: 13 00 80 75 sethi %hi(0x201d400), %o1
2007850: 9f c6 40 00 call %i1
2007854: 92 12 62 b8 or %o1, 0x2b8, %o1 ! 201d6b8 <CSWTCH.2+0x84>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
2007858: 90 10 00 18 mov %i0, %o0
200785c: 13 00 80 75 sethi %hi(0x201d400), %o1
2007860: 9f c6 40 00 call %i1
2007864: 92 12 63 08 or %o1, 0x308, %o1 ! 201d708 <CSWTCH.2+0xd4>
/*
* Cycle through all possible ids and try to report on each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
2007868: 39 00 80 7e sethi %hi(0x201f800), %i4
200786c: b8 17 20 44 or %i4, 0x44, %i4 ! 201f844 <_Rate_monotonic_Information>
2007870: fa 07 20 08 ld [ %i4 + 8 ], %i5
2007874: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007878: 80 a7 40 01 cmp %i5, %g1
200787c: 18 80 00 2e bgu 2007934 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
2007880: 35 00 80 75 sethi %hi(0x201d400), %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,
2007884: 23 00 80 75 sethi %hi(0x201d400), %l1
struct timespec *min_wall = &the_stats.min_wall_time;
struct timespec *max_wall = &the_stats.max_wall_time;
struct timespec *total_wall = &the_stats.total_wall_time;
_Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average);
(*print)( context,
2007888: 21 00 80 75 sethi %hi(0x201d400), %l0
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
200788c: 37 00 80 72 sethi %hi(0x201c800), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
2007890: b4 16 a3 58 or %i2, 0x358, %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,
2007894: a2 14 63 70 or %l1, 0x370, %l1
struct timespec *min_wall = &the_stats.min_wall_time;
struct timespec *max_wall = &the_stats.max_wall_time;
struct timespec *total_wall = &the_stats.total_wall_time;
_Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average);
(*print)( context,
2007898: a0 14 23 90 or %l0, 0x390, %l0
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
200789c: 10 80 00 06 b 20078b4 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
20078a0: b6 16 e0 c8 or %i3, 0xc8, %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++ ) {
20078a4: 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 ;
20078a8: 80 a0 40 1d cmp %g1, %i5
20078ac: 0a 80 00 22 bcs 2007934 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
20078b0: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
20078b4: 90 10 00 1d mov %i5, %o0
20078b8: 40 00 1b dc call 200e828 <rtems_rate_monotonic_get_statistics>
20078bc: 92 07 bf a0 add %fp, -96, %o1
if ( status != RTEMS_SUCCESSFUL )
20078c0: 80 a2 20 00 cmp %o0, 0
20078c4: 32 bf ff f8 bne,a 20078a4 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
20078c8: 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 );
20078cc: 92 07 bf d8 add %fp, -40, %o1
20078d0: 40 00 1c 05 call 200e8e4 <rtems_rate_monotonic_get_status>
20078d4: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
20078d8: d0 07 bf d8 ld [ %fp + -40 ], %o0
20078dc: 92 10 20 05 mov 5, %o1
20078e0: 40 00 00 b4 call 2007bb0 <rtems_object_get_name>
20078e4: 94 07 bf f8 add %fp, -8, %o2
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
20078e8: d8 1f bf a0 ldd [ %fp + -96 ], %o4
20078ec: 92 10 00 1a mov %i2, %o1
20078f0: 94 10 00 1d mov %i5, %o2
20078f4: 90 10 00 18 mov %i0, %o0
20078f8: 9f c6 40 00 call %i1
20078fc: 96 07 bf f8 add %fp, -8, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
2007900: c2 07 bf a0 ld [ %fp + -96 ], %g1
struct timespec cpu_average;
struct timespec *min_cpu = &the_stats.min_cpu_time;
struct timespec *max_cpu = &the_stats.max_cpu_time;
struct timespec *total_cpu = &the_stats.total_cpu_time;
_Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average );
2007904: 94 07 bf f0 add %fp, -16, %o2
2007908: 90 07 bf b8 add %fp, -72, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
200790c: 80 a0 60 00 cmp %g1, 0
2007910: 12 80 00 0b bne 200793c <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
2007914: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
2007918: 9f c6 40 00 call %i1
200791c: 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 ;
2007920: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2007924: 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 ;
2007928: 80 a0 40 1d cmp %g1, %i5
200792c: 1a bf ff e3 bcc 20078b8 <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
2007930: 90 10 00 1d mov %i5, %o0
2007934: 81 c7 e0 08 ret
2007938: 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 );
200793c: 40 00 0f aa call 200b7e4 <_Timespec_Divide_by_integer>
2007940: 92 10 00 01 mov %g1, %o1
(*print)( context,
2007944: d0 07 bf ac ld [ %fp + -84 ], %o0
2007948: 40 00 4a 3e call 201a240 <.div>
200794c: 92 10 23 e8 mov 0x3e8, %o1
2007950: aa 10 00 08 mov %o0, %l5
2007954: d0 07 bf b4 ld [ %fp + -76 ], %o0
2007958: 40 00 4a 3a call 201a240 <.div>
200795c: 92 10 23 e8 mov 0x3e8, %o1
2007960: c2 07 bf f0 ld [ %fp + -16 ], %g1
2007964: a6 10 00 08 mov %o0, %l3
2007968: d0 07 bf f4 ld [ %fp + -12 ], %o0
200796c: e4 07 bf a8 ld [ %fp + -88 ], %l2
2007970: e8 07 bf b0 ld [ %fp + -80 ], %l4
2007974: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2007978: 40 00 4a 32 call 201a240 <.div>
200797c: 92 10 23 e8 mov 0x3e8, %o1
2007980: 96 10 00 15 mov %l5, %o3
2007984: 98 10 00 14 mov %l4, %o4
2007988: 9a 10 00 13 mov %l3, %o5
200798c: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
2007990: 92 10 00 11 mov %l1, %o1
2007994: 94 10 00 12 mov %l2, %o2
2007998: 9f c6 40 00 call %i1
200799c: 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);
20079a0: d2 07 bf a0 ld [ %fp + -96 ], %o1
20079a4: 94 07 bf f0 add %fp, -16, %o2
20079a8: 40 00 0f 8f call 200b7e4 <_Timespec_Divide_by_integer>
20079ac: 90 07 bf d0 add %fp, -48, %o0
(*print)( context,
20079b0: d0 07 bf c4 ld [ %fp + -60 ], %o0
20079b4: 40 00 4a 23 call 201a240 <.div>
20079b8: 92 10 23 e8 mov 0x3e8, %o1
20079bc: a8 10 00 08 mov %o0, %l4
20079c0: d0 07 bf cc ld [ %fp + -52 ], %o0
20079c4: 40 00 4a 1f call 201a240 <.div>
20079c8: 92 10 23 e8 mov 0x3e8, %o1
20079cc: c2 07 bf f0 ld [ %fp + -16 ], %g1
20079d0: a4 10 00 08 mov %o0, %l2
20079d4: d0 07 bf f4 ld [ %fp + -12 ], %o0
20079d8: ea 07 bf c0 ld [ %fp + -64 ], %l5
20079dc: e6 07 bf c8 ld [ %fp + -56 ], %l3
20079e0: 92 10 23 e8 mov 0x3e8, %o1
20079e4: 40 00 4a 17 call 201a240 <.div>
20079e8: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
20079ec: 92 10 00 10 mov %l0, %o1
20079f0: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
20079f4: 94 10 00 15 mov %l5, %o2
20079f8: 90 10 00 18 mov %i0, %o0
20079fc: 96 10 00 14 mov %l4, %o3
2007a00: 98 10 00 13 mov %l3, %o4
2007a04: 9f c6 40 00 call %i1
2007a08: 9a 10 00 12 mov %l2, %o5
/*
* Cycle through all possible ids and try to report on each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
2007a0c: 10 bf ff a6 b 20078a4 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
2007a10: c2 07 20 0c ld [ %i4 + 0xc ], %g1
02007a2c <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
2007a2c: 9d e3 bf a0 save %sp, -96, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2007a30: 03 00 80 7e sethi %hi(0x201f800), %g1
2007a34: c4 00 61 b0 ld [ %g1 + 0x1b0 ], %g2 ! 201f9b0 <_Thread_Dispatch_disable_level>
2007a38: 84 00 a0 01 inc %g2
2007a3c: c4 20 61 b0 st %g2, [ %g1 + 0x1b0 ]
return _Thread_Dispatch_disable_level;
2007a40: c2 00 61 b0 ld [ %g1 + 0x1b0 ], %g1
/*
* Cycle through all possible ids and try to reset each one. If it
* is a period that is inactive, we just get an error back. No big deal.
*/
for ( id=_Rate_monotonic_Information.minimum_id ;
2007a44: 39 00 80 7e sethi %hi(0x201f800), %i4
2007a48: b8 17 20 44 or %i4, 0x44, %i4 ! 201f844 <_Rate_monotonic_Information>
2007a4c: fa 07 20 08 ld [ %i4 + 8 ], %i5
2007a50: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007a54: 80 a7 40 01 cmp %i5, %g1
2007a58: 18 80 00 09 bgu 2007a7c <rtems_rate_monotonic_reset_all_statistics+0x50><== NEVER TAKEN
2007a5c: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
2007a60: 40 00 00 09 call 2007a84 <rtems_rate_monotonic_reset_statistics>
2007a64: 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 ;
2007a68: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2007a6c: 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 ;
2007a70: 80 a0 40 1d cmp %g1, %i5
2007a74: 1a bf ff fb bcc 2007a60 <rtems_rate_monotonic_reset_all_statistics+0x34>
2007a78: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
2007a7c: 40 00 0c 71 call 200ac40 <_Thread_Enable_dispatch>
2007a80: 81 e8 00 00 restore
020153f8 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
20153f8: 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 )
20153fc: 80 a6 60 00 cmp %i1, 0
2015400: 12 80 00 04 bne 2015410 <rtems_signal_send+0x18>
2015404: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015408: 81 c7 e0 08 ret
201540c: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
2015410: 90 10 00 18 mov %i0, %o0
2015414: 40 00 13 69 call 201a1b8 <_Thread_Get>
2015418: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
201541c: c2 07 bf fc ld [ %fp + -4 ], %g1
2015420: 80 a0 60 00 cmp %g1, 0
2015424: 12 80 00 20 bne 20154a4 <rtems_signal_send+0xac>
2015428: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
201542c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
2015430: c2 07 60 0c ld [ %i5 + 0xc ], %g1
2015434: 80 a0 60 00 cmp %g1, 0
2015438: 02 80 00 1e be 20154b0 <rtems_signal_send+0xb8>
201543c: 01 00 00 00 nop
if ( asr->is_enabled ) {
2015440: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2015444: 80 a0 60 00 cmp %g1, 0
2015448: 02 80 00 1e be 20154c0 <rtems_signal_send+0xc8>
201544c: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
2015450: 7f ff e6 9f call 200eecc <sparc_disable_interrupts>
2015454: 01 00 00 00 nop
*signal_set |= signals;
2015458: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
201545c: b2 10 40 19 or %g1, %i1, %i1
2015460: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2015464: 7f ff e6 9e call 200eedc <sparc_enable_interrupts>
2015468: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201546c: 03 00 80 ef sethi %hi(0x203bc00), %g1
2015470: 82 10 61 40 or %g1, 0x140, %g1 ! 203bd40 <_Per_CPU_Information>
2015474: c4 00 60 08 ld [ %g1 + 8 ], %g2
2015478: 80 a0 a0 00 cmp %g2, 0
201547c: 02 80 00 06 be 2015494 <rtems_signal_send+0x9c>
2015480: 01 00 00 00 nop
2015484: c4 00 60 0c ld [ %g1 + 0xc ], %g2
2015488: 80 a7 00 02 cmp %i4, %g2
201548c: 02 80 00 15 be 20154e0 <rtems_signal_send+0xe8> <== ALWAYS TAKEN
2015490: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
2015494: 40 00 13 3c call 201a184 <_Thread_Enable_dispatch>
2015498: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
201549c: 10 bf ff db b 2015408 <rtems_signal_send+0x10>
20154a0: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
20154a4: 82 10 20 04 mov 4, %g1
}
20154a8: 81 c7 e0 08 ret
20154ac: 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();
20154b0: 40 00 13 35 call 201a184 <_Thread_Enable_dispatch>
20154b4: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
20154b8: 10 bf ff d4 b 2015408 <rtems_signal_send+0x10>
20154bc: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
20154c0: 7f ff e6 83 call 200eecc <sparc_disable_interrupts>
20154c4: 01 00 00 00 nop
*signal_set |= signals;
20154c8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
20154cc: b2 10 40 19 or %g1, %i1, %i1
20154d0: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
20154d4: 7f ff e6 82 call 200eedc <sparc_enable_interrupts>
20154d8: 01 00 00 00 nop
20154dc: 30 bf ff ee b,a 2015494 <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;
20154e0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
20154e4: 30 bf ff ec b,a 2015494 <rtems_signal_send+0x9c>
0200f4a0 <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
200f4a0: 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 )
200f4a4: 80 a6 a0 00 cmp %i2, 0
200f4a8: 02 80 00 3b be 200f594 <rtems_task_mode+0xf4>
200f4ac: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
200f4b0: 21 00 80 78 sethi %hi(0x201e000), %l0
200f4b4: a0 14 20 40 or %l0, 0x40, %l0 ! 201e040 <_Per_CPU_Information>
200f4b8: fa 04 20 0c ld [ %l0 + 0xc ], %i5
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f4bc: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f4c0: c2 07 60 7c ld [ %i5 + 0x7c ], %g1
executing = _Thread_Executing;
api = executing->API_Extensions[ THREAD_API_RTEMS ];
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f4c4: 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 ];
200f4c8: f8 07 61 58 ld [ %i5 + 0x158 ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f4cc: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f4d0: 80 a0 60 00 cmp %g1, 0
200f4d4: 12 80 00 40 bne 200f5d4 <rtems_task_mode+0x134>
200f4d8: 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;
200f4dc: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
200f4e0: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f4e4: 7f ff ed 11 call 200a928 <_CPU_ISR_Get_level>
200f4e8: 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;
200f4ec: a3 2c 60 0a sll %l1, 0xa, %l1
200f4f0: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200f4f4: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f4f8: 80 8e 61 00 btst 0x100, %i1
200f4fc: 02 80 00 06 be 200f514 <rtems_task_mode+0x74>
200f500: 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;
200f504: 82 0e 21 00 and %i0, 0x100, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
200f508: 80 a0 00 01 cmp %g0, %g1
200f50c: 82 60 3f ff subx %g0, -1, %g1
200f510: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
200f514: 80 8e 62 00 btst 0x200, %i1
200f518: 12 80 00 21 bne 200f59c <rtems_task_mode+0xfc>
200f51c: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f520: 80 8e 60 0f btst 0xf, %i1
200f524: 12 80 00 27 bne 200f5c0 <rtems_task_mode+0x120>
200f528: 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 ) {
200f52c: 80 8e 64 00 btst 0x400, %i1
200f530: 02 80 00 14 be 200f580 <rtems_task_mode+0xe0>
200f534: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200f538: c4 0f 20 08 ldub [ %i4 + 8 ], %g2
*/
RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled (
Modes_Control mode_set
)
{
return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR;
200f53c: b0 0e 24 00 and %i0, 0x400, %i0
* Output:
* *previous_mode_set - previous mode set
* always return RTEMS_SUCCESSFUL;
*/
rtems_status_code rtems_task_mode(
200f540: 80 a0 00 18 cmp %g0, %i0
200f544: 82 60 3f ff subx %g0, -1, %g1
is_asr_enabled = false;
needs_asr_dispatching = false;
if ( mask & RTEMS_ASR_MASK ) {
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200f548: 80 a0 80 01 cmp %g2, %g1
200f54c: 22 80 00 0e be,a 200f584 <rtems_task_mode+0xe4>
200f550: 03 00 80 77 sethi %hi(0x201dc00), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
200f554: 7f ff cb 24 call 20021e4 <sparc_disable_interrupts>
200f558: c2 2f 20 08 stb %g1, [ %i4 + 8 ]
_signals = information->signals_pending;
200f55c: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
200f560: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
200f564: 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;
200f568: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
200f56c: 7f ff cb 22 call 20021f4 <sparc_enable_interrupts>
200f570: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
200f574: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
/*
* This is specific to the RTEMS API
*/
is_asr_enabled = false;
needs_asr_dispatching = false;
200f578: 80 a0 00 01 cmp %g0, %g1
200f57c: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
200f580: 03 00 80 77 sethi %hi(0x201dc00), %g1
200f584: c4 00 60 54 ld [ %g1 + 0x54 ], %g2 ! 201dc54 <_System_state_Current>
200f588: 80 a0 a0 03 cmp %g2, 3
200f58c: 02 80 00 1f be 200f608 <rtems_task_mode+0x168>
200f590: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
200f594: 81 c7 e0 08 ret
200f598: 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) ) {
200f59c: 22 bf ff e1 be,a 200f520 <rtems_task_mode+0x80>
200f5a0: c0 27 60 7c clr [ %i5 + 0x7c ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200f5a4: 03 00 80 76 sethi %hi(0x201d800), %g1
200f5a8: c2 00 62 64 ld [ %g1 + 0x264 ], %g1 ! 201da64 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f5ac: 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;
200f5b0: c2 27 60 78 st %g1, [ %i5 + 0x78 ]
if ( mask & RTEMS_PREEMPT_MASK )
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
if ( mask & RTEMS_TIMESLICE_MASK ) {
if ( _Modes_Is_timeslice(mode_set) ) {
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
200f5b4: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f5b8: 02 bf ff dd be 200f52c <rtems_task_mode+0x8c>
200f5bc: c2 27 60 7c st %g1, [ %i5 + 0x7c ]
*/
RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level (
Modes_Control mode_set
)
{
return ( mode_set & RTEMS_INTERRUPT_MASK );
200f5c0: 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 ) );
200f5c4: 7f ff cb 0c call 20021f4 <sparc_enable_interrupts>
200f5c8: 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 ) {
200f5cc: 10 bf ff d9 b 200f530 <rtems_task_mode+0x90>
200f5d0: 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;
200f5d4: 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;
200f5d8: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200f5dc: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f5e0: 7f ff ec d2 call 200a928 <_CPU_ISR_Get_level>
200f5e4: 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;
200f5e8: a3 2c 60 0a sll %l1, 0xa, %l1
200f5ec: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200f5f0: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f5f4: 80 8e 61 00 btst 0x100, %i1
200f5f8: 02 bf ff c7 be 200f514 <rtems_task_mode+0x74>
200f5fc: 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;
200f600: 10 bf ff c2 b 200f508 <rtems_task_mode+0x68>
200f604: 82 0e 21 00 and %i0, 0x100, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
200f608: 80 88 e0 ff btst 0xff, %g3
200f60c: 12 80 00 0a bne 200f634 <rtems_task_mode+0x194>
200f610: c4 04 20 0c ld [ %l0 + 0xc ], %g2
200f614: c6 04 20 10 ld [ %l0 + 0x10 ], %g3
200f618: 80 a0 80 03 cmp %g2, %g3
200f61c: 02 bf ff de be 200f594 <rtems_task_mode+0xf4>
200f620: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
200f624: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200f628: 80 a0 a0 00 cmp %g2, 0
200f62c: 02 bf ff da be 200f594 <rtems_task_mode+0xf4> <== NEVER TAKEN
200f630: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
200f634: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
200f638: c2 2c 20 18 stb %g1, [ %l0 + 0x18 ]
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
200f63c: 7f ff e7 0e call 2009274 <_Thread_Dispatch>
200f640: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
200f644: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
200f648: 81 c7 e0 08 ret
200f64c: 91 e8 00 01 restore %g0, %g1, %o0
0200b1f4 <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200b1f4: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200b1f8: 80 a6 60 00 cmp %i1, 0
200b1fc: 02 80 00 07 be 200b218 <rtems_task_set_priority+0x24>
200b200: 90 10 00 18 mov %i0, %o0
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
( the_priority <= RTEMS_MAXIMUM_PRIORITY ) );
200b204: 03 00 80 6a sethi %hi(0x201a800), %g1
200b208: c2 08 61 bc ldub [ %g1 + 0x1bc ], %g1 ! 201a9bc <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
200b20c: 80 a6 40 01 cmp %i1, %g1
200b210: 18 80 00 1c bgu 200b280 <rtems_task_set_priority+0x8c>
200b214: b0 10 20 13 mov 0x13, %i0
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200b218: 80 a6 a0 00 cmp %i2, 0
200b21c: 02 80 00 19 be 200b280 <rtems_task_set_priority+0x8c>
200b220: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200b224: 40 00 0a 1f call 200daa0 <_Thread_Get>
200b228: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200b22c: c2 07 bf fc ld [ %fp + -4 ], %g1
200b230: 80 a0 60 00 cmp %g1, 0
200b234: 12 80 00 13 bne 200b280 <rtems_task_set_priority+0x8c>
200b238: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200b23c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200b240: 80 a6 60 00 cmp %i1, 0
200b244: 02 80 00 0d be 200b278 <rtems_task_set_priority+0x84>
200b248: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200b24c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200b250: 80 a0 60 00 cmp %g1, 0
200b254: 02 80 00 06 be 200b26c <rtems_task_set_priority+0x78>
200b258: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200b25c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200b260: 80 a6 40 01 cmp %i1, %g1
200b264: 1a 80 00 05 bcc 200b278 <rtems_task_set_priority+0x84> <== ALWAYS TAKEN
200b268: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200b26c: 92 10 00 19 mov %i1, %o1
200b270: 40 00 08 bf call 200d56c <_Thread_Change_priority>
200b274: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200b278: 40 00 09 fd call 200da6c <_Thread_Enable_dispatch>
200b27c: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
200b280: 81 c7 e0 08 ret
200b284: 81 e8 00 00 restore
02007644 <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
2007644: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
2007648: 80 a6 60 00 cmp %i1, 0
200764c: 02 80 00 1e be 20076c4 <rtems_task_variable_delete+0x80>
2007650: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
2007654: 90 10 00 18 mov %i0, %o0
2007658: 40 00 09 a2 call 2009ce0 <_Thread_Get>
200765c: 92 07 bf fc add %fp, -4, %o1
switch (location) {
2007660: c2 07 bf fc ld [ %fp + -4 ], %g1
2007664: 80 a0 60 00 cmp %g1, 0
2007668: 12 80 00 19 bne 20076cc <rtems_task_variable_delete+0x88>
200766c: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
2007670: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
2007674: 80 a0 60 00 cmp %g1, 0
2007678: 02 80 00 10 be 20076b8 <rtems_task_variable_delete+0x74>
200767c: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2007680: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007684: 80 a0 80 19 cmp %g2, %i1
2007688: 32 80 00 09 bne,a 20076ac <rtems_task_variable_delete+0x68>
200768c: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
2007690: 10 80 00 18 b 20076f0 <rtems_task_variable_delete+0xac>
2007694: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
2007698: 80 a0 80 19 cmp %g2, %i1
200769c: 22 80 00 0e be,a 20076d4 <rtems_task_variable_delete+0x90>
20076a0: c4 02 40 00 ld [ %o1 ], %g2
20076a4: 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;
20076a8: 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) {
20076ac: 80 a2 60 00 cmp %o1, 0
20076b0: 32 bf ff fa bne,a 2007698 <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
20076b4: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
20076b8: 40 00 09 7d call 2009cac <_Thread_Enable_dispatch>
20076bc: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
20076c0: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20076c4: 81 c7 e0 08 ret
20076c8: 91 e8 00 01 restore %g0, %g1, %o0
20076cc: 81 c7 e0 08 ret
20076d0: 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;
20076d4: 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 );
20076d8: 40 00 00 2d call 200778c <_RTEMS_Tasks_Invoke_task_variable_dtor>
20076dc: 01 00 00 00 nop
_Thread_Enable_dispatch();
20076e0: 40 00 09 73 call 2009cac <_Thread_Enable_dispatch>
20076e4: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
20076e8: 10 bf ff f7 b 20076c4 <rtems_task_variable_delete+0x80>
20076ec: 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;
20076f0: 92 10 00 01 mov %g1, %o1
20076f4: 10 bf ff f9 b 20076d8 <rtems_task_variable_delete+0x94>
20076f8: c4 22 21 64 st %g2, [ %o0 + 0x164 ]
020076fc <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
20076fc: 9d e3 bf 98 save %sp, -104, %sp
2007700: 90 10 00 18 mov %i0, %o0
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
2007704: 80 a6 60 00 cmp %i1, 0
2007708: 02 80 00 1b be 2007774 <rtems_task_variable_get+0x78>
200770c: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !result )
2007710: 80 a6 a0 00 cmp %i2, 0
2007714: 02 80 00 1c be 2007784 <rtems_task_variable_get+0x88>
2007718: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
200771c: 40 00 09 71 call 2009ce0 <_Thread_Get>
2007720: 92 07 bf fc add %fp, -4, %o1
switch (location) {
2007724: c2 07 bf fc ld [ %fp + -4 ], %g1
2007728: 80 a0 60 00 cmp %g1, 0
200772c: 12 80 00 12 bne 2007774 <rtems_task_variable_get+0x78>
2007730: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/*
* Figure out if the variable is in this task's list.
*/
tvp = the_thread->task_variables;
2007734: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
2007738: 80 a0 60 00 cmp %g1, 0
200773c: 32 80 00 07 bne,a 2007758 <rtems_task_variable_get+0x5c>
2007740: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007744: 30 80 00 0e b,a 200777c <rtems_task_variable_get+0x80>
2007748: 80 a0 60 00 cmp %g1, 0
200774c: 02 80 00 0c be 200777c <rtems_task_variable_get+0x80> <== NEVER TAKEN
2007750: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2007754: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007758: 80 a0 80 19 cmp %g2, %i1
200775c: 32 bf ff fb bne,a 2007748 <rtems_task_variable_get+0x4c>
2007760: 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;
2007764: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
2007768: b0 10 20 00 clr %i0
/*
* Should this return the current (i.e not the
* saved) value if `tid' is the current task?
*/
*result = tvp->tval;
_Thread_Enable_dispatch();
200776c: 40 00 09 50 call 2009cac <_Thread_Enable_dispatch>
2007770: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
2007774: 81 c7 e0 08 ret
2007778: 81 e8 00 00 restore
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
200777c: 40 00 09 4c call 2009cac <_Thread_Enable_dispatch>
2007780: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
2007784: 81 c7 e0 08 ret
2007788: 81 e8 00 00 restore
02015e58 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2015e58: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2015e5c: 11 00 80 f0 sethi %hi(0x203c000), %o0
2015e60: 92 10 00 18 mov %i0, %o1
2015e64: 90 12 21 84 or %o0, 0x184, %o0
2015e68: 40 00 0c c9 call 201918c <_Objects_Get>
2015e6c: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2015e70: c2 07 bf fc ld [ %fp + -4 ], %g1
2015e74: 80 a0 60 00 cmp %g1, 0
2015e78: 12 80 00 0c bne 2015ea8 <rtems_timer_cancel+0x50>
2015e7c: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
2015e80: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2015e84: 80 a0 60 04 cmp %g1, 4
2015e88: 02 80 00 04 be 2015e98 <rtems_timer_cancel+0x40> <== NEVER TAKEN
2015e8c: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
2015e90: 40 00 15 9b call 201b4fc <_Watchdog_Remove>
2015e94: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
2015e98: 40 00 10 bb call 201a184 <_Thread_Enable_dispatch>
2015e9c: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
2015ea0: 81 c7 e0 08 ret
2015ea4: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015ea8: 81 c7 e0 08 ret
2015eac: 91 e8 20 04 restore %g0, 4, %o0
02016380 <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2016380: 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;
2016384: 03 00 80 f0 sethi %hi(0x203c000), %g1
2016388: fa 00 61 c4 ld [ %g1 + 0x1c4 ], %i5 ! 203c1c4 <_Timer_server>
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
201638c: b8 10 00 18 mov %i0, %i4
Timer_Control *the_timer;
Objects_Locations location;
rtems_interval seconds;
Timer_server_Control *timer_server = _Timer_server;
if ( !timer_server )
2016390: 80 a7 60 00 cmp %i5, 0
2016394: 02 80 00 32 be 201645c <rtems_timer_server_fire_when+0xdc>
2016398: b0 10 20 0e mov 0xe, %i0
return RTEMS_INCORRECT_STATE;
if ( !_TOD_Is_set )
201639c: 03 00 80 ee sethi %hi(0x203b800), %g1
20163a0: c2 08 60 10 ldub [ %g1 + 0x10 ], %g1 ! 203b810 <_TOD_Is_set>
20163a4: 80 a0 60 00 cmp %g1, 0
20163a8: 02 80 00 2d be 201645c <rtems_timer_server_fire_when+0xdc><== NEVER TAKEN
20163ac: b0 10 20 0b mov 0xb, %i0
return RTEMS_NOT_DEFINED;
if ( !routine )
20163b0: 80 a6 a0 00 cmp %i2, 0
20163b4: 02 80 00 2a be 201645c <rtems_timer_server_fire_when+0xdc>
20163b8: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
20163bc: 90 10 00 19 mov %i1, %o0
20163c0: 7f ff f3 b9 call 20132a4 <_TOD_Validate>
20163c4: b0 10 20 14 mov 0x14, %i0
20163c8: 80 8a 20 ff btst 0xff, %o0
20163cc: 02 80 00 24 be 201645c <rtems_timer_server_fire_when+0xdc>
20163d0: 01 00 00 00 nop
return RTEMS_INVALID_CLOCK;
seconds = _TOD_To_seconds( wall_time );
20163d4: 7f ff f3 80 call 20131d4 <_TOD_To_seconds>
20163d8: 90 10 00 19 mov %i1, %o0
if ( seconds <= _TOD_Seconds_since_epoch() )
20163dc: 21 00 80 ee sethi %hi(0x203b800), %l0
20163e0: c2 04 20 8c ld [ %l0 + 0x8c ], %g1 ! 203b88c <_TOD_Now>
20163e4: 80 a2 00 01 cmp %o0, %g1
20163e8: 08 80 00 1d bleu 201645c <rtems_timer_server_fire_when+0xdc>
20163ec: b2 10 00 08 mov %o0, %i1
20163f0: 92 10 00 1c mov %i4, %o1
20163f4: 11 00 80 f0 sethi %hi(0x203c000), %o0
20163f8: 94 07 bf fc add %fp, -4, %o2
20163fc: 40 00 0b 64 call 201918c <_Objects_Get>
2016400: 90 12 21 84 or %o0, 0x184, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2016404: c2 07 bf fc ld [ %fp + -4 ], %g1
2016408: 80 a0 60 00 cmp %g1, 0
201640c: 12 80 00 16 bne 2016464 <rtems_timer_server_fire_when+0xe4>
2016410: b0 10 00 08 mov %o0, %i0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
2016414: 40 00 14 3a call 201b4fc <_Watchdog_Remove>
2016418: 90 02 20 10 add %o0, 0x10, %o0
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
201641c: c4 04 20 8c ld [ %l0 + 0x8c ], %g2
(*timer_server->schedule_operation)( timer_server, the_timer );
2016420: c2 07 60 04 ld [ %i5 + 4 ], %g1
2016424: 92 10 00 18 mov %i0, %o1
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2016428: b2 26 40 02 sub %i1, %g2, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
201642c: 90 10 00 1d mov %i5, %o0
the_timer = _Timer_Get( id, &location );
switch ( location ) {
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK;
2016430: 84 10 20 03 mov 3, %g2
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2016434: f4 26 20 2c st %i2, [ %i0 + 0x2c ]
2016438: c4 26 20 38 st %g2, [ %i0 + 0x38 ]
the_watchdog->id = id;
201643c: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
the_watchdog->user_data = user_data;
2016440: f6 26 20 34 st %i3, [ %i0 + 0x34 ]
_Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data );
the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch();
2016444: f2 26 20 1c st %i1, [ %i0 + 0x1c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2016448: c0 26 20 18 clr [ %i0 + 0x18 ]
(*timer_server->schedule_operation)( timer_server, the_timer );
201644c: 9f c0 40 00 call %g1
2016450: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
2016454: 40 00 0f 4c call 201a184 <_Thread_Enable_dispatch>
2016458: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
201645c: 81 c7 e0 08 ret
2016460: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2016464: 81 c7 e0 08 ret
2016468: 91 e8 20 04 restore %g0, 4, %o0
02006da8 <sched_get_priority_max>:
#include <rtems/posix/priority.h>
int sched_get_priority_max(
int policy
)
{
2006da8: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
2006dac: 80 a6 20 04 cmp %i0, 4
2006db0: 08 80 00 08 bleu 2006dd0 <sched_get_priority_max+0x28>
2006db4: 82 10 20 01 mov 1, %g1
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
2006db8: 40 00 25 6b call 2010364 <__errno>
2006dbc: b0 10 3f ff mov -1, %i0
2006dc0: 82 10 20 16 mov 0x16, %g1
2006dc4: c2 22 00 00 st %g1, [ %o0 ]
2006dc8: 81 c7 e0 08 ret
2006dcc: 81 e8 00 00 restore
int sched_get_priority_max(
int policy
)
{
switch ( policy ) {
2006dd0: b1 28 40 18 sll %g1, %i0, %i0
2006dd4: 80 8e 20 17 btst 0x17, %i0
2006dd8: 02 bf ff f8 be 2006db8 <sched_get_priority_max+0x10> <== NEVER TAKEN
2006ddc: 03 00 80 76 sethi %hi(0x201d800), %g1
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MAXIMUM_PRIORITY;
2006de0: f0 08 60 0c ldub [ %g1 + 0xc ], %i0 ! 201d80c <rtems_maximum_priority>
}
2006de4: 81 c7 e0 08 ret
2006de8: 91 ee 3f ff restore %i0, -1, %o0
02006dec <sched_get_priority_min>:
#include <rtems/posix/priority.h>
int sched_get_priority_min(
int policy
)
{
2006dec: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
2006df0: 80 a6 20 04 cmp %i0, 4
2006df4: 08 80 00 09 bleu 2006e18 <sched_get_priority_min+0x2c>
2006df8: 84 10 20 01 mov 1, %g2
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
2006dfc: 40 00 25 5a call 2010364 <__errno>
2006e00: 01 00 00 00 nop
2006e04: 82 10 3f ff mov -1, %g1 ! ffffffff <RAM_END+0xfdbfffff>
2006e08: 84 10 20 16 mov 0x16, %g2
2006e0c: c4 22 00 00 st %g2, [ %o0 ]
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2006e10: 81 c7 e0 08 ret
2006e14: 91 e8 00 01 restore %g0, %g1, %o0
int sched_get_priority_min(
int policy
)
{
switch ( policy ) {
2006e18: b1 28 80 18 sll %g2, %i0, %i0
2006e1c: 80 8e 20 17 btst 0x17, %i0
2006e20: 02 bf ff f7 be 2006dfc <sched_get_priority_min+0x10> <== NEVER TAKEN
2006e24: 82 10 20 01 mov 1, %g1
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2006e28: 81 c7 e0 08 ret
2006e2c: 91 e8 00 01 restore %g0, %g1, %o0
02006e30 <sched_rr_get_interval>:
int sched_rr_get_interval(
pid_t pid,
struct timespec *interval
)
{
2006e30: 9d e3 bf a0 save %sp, -96, %sp
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
2006e34: 80 a6 20 00 cmp %i0, 0
2006e38: 12 80 00 0a bne 2006e60 <sched_rr_get_interval+0x30> <== ALWAYS TAKEN
2006e3c: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
if ( !interval )
2006e40: 02 80 00 13 be 2006e8c <sched_rr_get_interval+0x5c>
2006e44: 03 00 80 79 sethi %hi(0x201e400), %g1
rtems_set_errno_and_return_minus_one( EINVAL );
_Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval );
2006e48: d0 00 60 64 ld [ %g1 + 0x64 ], %o0 ! 201e464 <_Thread_Ticks_per_timeslice>
2006e4c: 92 10 00 19 mov %i1, %o1
2006e50: 40 00 0f 73 call 200ac1c <_Timespec_From_ticks>
2006e54: b0 10 20 00 clr %i0
return 0;
}
2006e58: 81 c7 e0 08 ret
2006e5c: 81 e8 00 00 restore
{
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
2006e60: 7f ff f1 38 call 2003340 <getpid>
2006e64: 01 00 00 00 nop
2006e68: 80 a2 00 18 cmp %o0, %i0
2006e6c: 02 bf ff f5 be 2006e40 <sched_rr_get_interval+0x10>
2006e70: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
2006e74: 40 00 25 3c call 2010364 <__errno>
2006e78: b0 10 3f ff mov -1, %i0
2006e7c: 82 10 20 03 mov 3, %g1
2006e80: c2 22 00 00 st %g1, [ %o0 ]
2006e84: 81 c7 e0 08 ret
2006e88: 81 e8 00 00 restore
if ( !interval )
rtems_set_errno_and_return_minus_one( EINVAL );
2006e8c: 40 00 25 36 call 2010364 <__errno>
2006e90: b0 10 3f ff mov -1, %i0
2006e94: 82 10 20 16 mov 0x16, %g1
2006e98: c2 22 00 00 st %g1, [ %o0 ]
2006e9c: 81 c7 e0 08 ret
2006ea0: 81 e8 00 00 restore
020097ec <sem_open>:
int oflag,
...
/* mode_t mode, */
/* unsigned int value */
)
{
20097ec: 9d e3 bf 90 save %sp, -112, %sp
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20097f0: 03 00 80 8d sethi %hi(0x2023400), %g1
20097f4: c4 00 62 90 ld [ %g1 + 0x290 ], %g2 ! 2023690 <_Thread_Dispatch_disable_level>
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
20097f8: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
20097fc: 84 00 a0 01 inc %g2
2009800: c4 20 62 90 st %g2, [ %g1 + 0x290 ]
return _Thread_Dispatch_disable_level;
2009804: c2 00 62 90 ld [ %g1 + 0x290 ], %g1
2009808: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
200980c: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
2009810: fa 27 a0 58 st %i5, [ %fp + 0x58 ]
POSIX_Semaphore_Control *the_semaphore;
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
2009814: b8 8e 62 00 andcc %i1, 0x200, %i4
2009818: 12 80 00 25 bne 20098ac <sem_open+0xc0>
200981c: ba 10 20 00 clr %i5
mode = (mode_t) va_arg( arg, unsigned int );
value = va_arg( arg, unsigned int );
va_end(arg);
}
status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id );
2009820: 90 10 00 18 mov %i0, %o0
2009824: 40 00 1c 16 call 201087c <_POSIX_Semaphore_Name_to_id>
2009828: 92 07 bf f4 add %fp, -12, %o1
* 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 ) {
200982c: b6 92 20 00 orcc %o0, 0, %i3
2009830: 22 80 00 0e be,a 2009868 <sem_open+0x7c>
2009834: 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) ) ) {
2009838: 80 a6 e0 02 cmp %i3, 2
200983c: 12 80 00 04 bne 200984c <sem_open+0x60> <== NEVER TAKEN
2009840: 80 a7 20 00 cmp %i4, 0
2009844: 12 80 00 1e bne 20098bc <sem_open+0xd0>
2009848: 94 10 00 1d mov %i5, %o2
_Thread_Enable_dispatch();
200984c: 40 00 0c c4 call 200cb5c <_Thread_Enable_dispatch>
2009850: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, sem_t * );
2009854: 40 00 28 da call 2013bbc <__errno>
2009858: 01 00 00 00 nop
200985c: f6 22 00 00 st %i3, [ %o0 ]
2009860: 81 c7 e0 08 ret
2009864: 81 e8 00 00 restore
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
2009868: 80 a6 6a 00 cmp %i1, 0xa00
200986c: 02 80 00 20 be 20098ec <sem_open+0x100>
2009870: d2 07 bf f4 ld [ %fp + -12 ], %o1
2009874: 94 07 bf fc add %fp, -4, %o2
2009878: 11 00 80 8e sethi %hi(0x2023800), %o0
200987c: 40 00 08 c7 call 200bb98 <_Objects_Get>
2009880: 90 12 21 50 or %o0, 0x150, %o0 ! 2023950 <_POSIX_Semaphore_Information>
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
}
the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location );
the_semaphore->open_count += 1;
2009884: 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( &the_semaphore_id, &location );
2009888: d0 27 bf f8 st %o0, [ %fp + -8 ]
the_semaphore->open_count += 1;
200988c: 82 00 60 01 inc %g1
_Thread_Enable_dispatch();
2009890: 40 00 0c b3 call 200cb5c <_Thread_Enable_dispatch>
2009894: c2 22 20 18 st %g1, [ %o0 + 0x18 ]
_Thread_Enable_dispatch();
2009898: 40 00 0c b1 call 200cb5c <_Thread_Enable_dispatch>
200989c: 01 00 00 00 nop
the_semaphore->Semaphore_id = the_semaphore->Object.id;
id = &the_semaphore->Semaphore_id;
#else
id = (sem_t *)&the_semaphore->Object.id;
#endif
return id;
20098a0: f0 07 bf f8 ld [ %fp + -8 ], %i0
}
20098a4: 81 c7 e0 08 ret
20098a8: 91 ee 20 08 restore %i0, 8, %o0
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
mode = (mode_t) va_arg( arg, unsigned int );
value = va_arg( arg, unsigned int );
20098ac: 82 07 a0 54 add %fp, 0x54, %g1
20098b0: fa 07 a0 50 ld [ %fp + 0x50 ], %i5
20098b4: 10 bf ff db b 2009820 <sem_open+0x34>
20098b8: c2 27 bf f0 st %g1, [ %fp + -16 ]
/*
* 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(
20098bc: 92 10 20 00 clr %o1
20098c0: 96 07 bf f8 add %fp, -8, %o3
20098c4: 40 00 1b 92 call 201070c <_POSIX_Semaphore_Create_support>
20098c8: 90 10 00 18 mov %i0, %o0
/*
* errno was set by Create_support, so don't set it again.
*/
_Thread_Enable_dispatch();
20098cc: 40 00 0c a4 call 200cb5c <_Thread_Enable_dispatch>
20098d0: ba 10 00 08 mov %o0, %i5
if ( status == -1 )
20098d4: 80 a7 7f ff cmp %i5, -1
20098d8: 02 bf ff e2 be 2009860 <sem_open+0x74>
20098dc: b0 10 3f ff mov -1, %i0
the_semaphore->Semaphore_id = the_semaphore->Object.id;
id = &the_semaphore->Semaphore_id;
#else
id = (sem_t *)&the_semaphore->Object.id;
#endif
return id;
20098e0: f0 07 bf f8 ld [ %fp + -8 ], %i0
20098e4: 81 c7 e0 08 ret
20098e8: 91 ee 20 08 restore %i0, 8, %o0
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
_Thread_Enable_dispatch();
20098ec: 40 00 0c 9c call 200cb5c <_Thread_Enable_dispatch>
20098f0: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
20098f4: 40 00 28 b2 call 2013bbc <__errno>
20098f8: 01 00 00 00 nop
20098fc: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
2009900: c2 22 00 00 st %g1, [ %o0 ]
2009904: 81 c7 e0 08 ret
2009908: 81 e8 00 00 restore
02009968 <sem_timedwait>:
int sem_timedwait(
sem_t *sem,
const struct timespec *abstime
)
{
2009968: 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 );
200996c: 90 10 00 19 mov %i1, %o0
2009970: 40 00 18 fd call 200fd64 <_POSIX_Absolute_timeout_to_ticks>
2009974: 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 );
2009978: 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 )
200997c: 80 a2 20 03 cmp %o0, 3
2009980: 02 80 00 06 be 2009998 <sem_timedwait+0x30> <== ALWAYS TAKEN
2009984: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks );
2009988: 40 00 1b df call 2010904 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED
200998c: 92 10 20 00 clr %o1 <== NOT EXECUTED
2009990: 81 c7 e0 08 ret <== NOT EXECUTED
2009994: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
2009998: 40 00 1b db call 2010904 <_POSIX_Semaphore_Wait_support>
200999c: 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;
}
20099a0: 81 c7 e0 08 ret
20099a4: 91 e8 00 08 restore %g0, %o0, %o0
02006c74 <sigaction>:
int sigaction(
int sig,
const struct sigaction *act,
struct sigaction *oact
)
{
2006c74: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
if ( oact )
2006c78: 80 a6 a0 00 cmp %i2, 0
2006c7c: 02 80 00 0d be 2006cb0 <sigaction+0x3c>
2006c80: 87 2e 20 02 sll %i0, 2, %g3
*oact = _POSIX_signals_Vectors[ sig ];
2006c84: 05 00 80 6b sethi %hi(0x201ac00), %g2
2006c88: 83 2e 20 04 sll %i0, 4, %g1
2006c8c: 84 10 a0 00 mov %g2, %g2
2006c90: 82 20 40 03 sub %g1, %g3, %g1
2006c94: c6 00 80 01 ld [ %g2 + %g1 ], %g3
2006c98: 82 00 80 01 add %g2, %g1, %g1
2006c9c: c6 26 80 00 st %g3, [ %i2 ]
2006ca0: c4 00 60 04 ld [ %g1 + 4 ], %g2
2006ca4: c4 26 a0 04 st %g2, [ %i2 + 4 ]
2006ca8: c2 00 60 08 ld [ %g1 + 8 ], %g1
2006cac: c2 26 a0 08 st %g1, [ %i2 + 8 ]
if ( !sig )
2006cb0: 80 a6 20 00 cmp %i0, 0
2006cb4: 02 80 00 33 be 2006d80 <sigaction+0x10c>
2006cb8: 01 00 00 00 nop
static inline bool is_valid_signo(
int signo
)
{
return ((signo) >= 1 && (signo) <= 32 );
2006cbc: 82 06 3f ff add %i0, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
2006cc0: 80 a0 60 1f cmp %g1, 0x1f
2006cc4: 18 80 00 2f bgu 2006d80 <sigaction+0x10c>
2006cc8: 80 a6 20 09 cmp %i0, 9
*
* NOTE: Solaris documentation claims to "silently enforce" this which
* contradicts the POSIX specification.
*/
if ( sig == SIGKILL )
2006ccc: 02 80 00 2d be 2006d80 <sigaction+0x10c>
2006cd0: 80 a6 60 00 cmp %i1, 0
/*
* Evaluate the new action structure and set the global signal vector
* appropriately.
*/
if ( act ) {
2006cd4: 02 80 00 1a be 2006d3c <sigaction+0xc8> <== NEVER TAKEN
2006cd8: 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 );
2006cdc: 7f ff ee 2c call 200258c <sparc_disable_interrupts>
2006ce0: 01 00 00 00 nop
2006ce4: b4 10 00 08 mov %o0, %i2
if ( act->sa_handler == SIG_DFL ) {
2006ce8: c2 06 60 08 ld [ %i1 + 8 ], %g1
2006cec: 80 a0 60 00 cmp %g1, 0
2006cf0: 02 80 00 15 be 2006d44 <sigaction+0xd0>
2006cf4: 83 2e 20 02 sll %i0, 2, %g1
_POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ];
} else {
_POSIX_signals_Clear_process_signals( sig );
2006cf8: 40 00 19 ee call 200d4b0 <_POSIX_signals_Clear_process_signals>
2006cfc: 90 10 00 18 mov %i0, %o0
_POSIX_signals_Vectors[ sig ] = *act;
2006d00: c4 06 40 00 ld [ %i1 ], %g2
2006d04: 87 2e 20 02 sll %i0, 2, %g3
2006d08: 03 00 80 6b sethi %hi(0x201ac00), %g1
2006d0c: b1 2e 20 04 sll %i0, 4, %i0
2006d10: 82 10 60 00 mov %g1, %g1
2006d14: b0 26 00 03 sub %i0, %g3, %i0
2006d18: c4 20 40 18 st %g2, [ %g1 + %i0 ]
2006d1c: c4 06 60 04 ld [ %i1 + 4 ], %g2
2006d20: b0 00 40 18 add %g1, %i0, %i0
2006d24: c4 26 20 04 st %g2, [ %i0 + 4 ]
2006d28: c2 06 60 08 ld [ %i1 + 8 ], %g1
2006d2c: c2 26 20 08 st %g1, [ %i0 + 8 ]
}
_ISR_Enable( level );
2006d30: 7f ff ee 1b call 200259c <sparc_enable_interrupts>
2006d34: 90 10 00 1a mov %i2, %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;
2006d38: 82 10 20 00 clr %g1
}
2006d3c: 81 c7 e0 08 ret
2006d40: 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 ];
2006d44: b1 2e 20 04 sll %i0, 4, %i0
2006d48: b0 26 00 01 sub %i0, %g1, %i0
2006d4c: 03 00 80 64 sethi %hi(0x2019000), %g1
2006d50: 82 10 60 9c or %g1, 0x9c, %g1 ! 201909c <_POSIX_signals_Default_vectors>
2006d54: c8 00 40 18 ld [ %g1 + %i0 ], %g4
2006d58: 82 00 40 18 add %g1, %i0, %g1
2006d5c: c6 00 60 04 ld [ %g1 + 4 ], %g3
2006d60: c4 00 60 08 ld [ %g1 + 8 ], %g2
2006d64: 03 00 80 6b sethi %hi(0x201ac00), %g1
2006d68: 82 10 60 00 mov %g1, %g1 ! 201ac00 <_POSIX_signals_Vectors>
2006d6c: c8 20 40 18 st %g4, [ %g1 + %i0 ]
2006d70: b0 00 40 18 add %g1, %i0, %i0
2006d74: c6 26 20 04 st %g3, [ %i0 + 4 ]
2006d78: 10 bf ff ee b 2006d30 <sigaction+0xbc>
2006d7c: 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 );
2006d80: 40 00 26 a4 call 2010810 <__errno>
2006d84: 01 00 00 00 nop
2006d88: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
2006d8c: 82 10 3f ff mov -1, %g1
2006d90: 10 bf ff eb b 2006d3c <sigaction+0xc8>
2006d94: c4 22 00 00 st %g2, [ %o0 ]
02007208 <sigtimedwait>:
int sigtimedwait(
const sigset_t *set,
siginfo_t *info,
const struct timespec *timeout
)
{
2007208: 9d e3 bf 90 save %sp, -112, %sp
ISR_Level level;
/*
* Error check parameters before disabling interrupts.
*/
if ( !set )
200720c: ba 96 20 00 orcc %i0, 0, %i5
2007210: 02 80 00 84 be 2007420 <sigtimedwait+0x218>
2007214: 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 ) {
2007218: 02 80 00 5c be 2007388 <sigtimedwait+0x180>
200721c: 80 a6 60 00 cmp %i1, 0
if ( !_Timespec_Is_valid( timeout ) )
2007220: 40 00 0f 9c call 200b090 <_Timespec_Is_valid>
2007224: 90 10 00 1a mov %i2, %o0
2007228: 80 8a 20 ff btst 0xff, %o0
200722c: 02 80 00 7d be 2007420 <sigtimedwait+0x218>
2007230: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
interval = _Timespec_To_ticks( timeout );
2007234: 40 00 0f bc call 200b124 <_Timespec_To_ticks>
2007238: 90 10 00 1a mov %i2, %o0
if ( !interval )
200723c: a0 92 20 00 orcc %o0, 0, %l0
2007240: 02 80 00 78 be 2007420 <sigtimedwait+0x218> <== NEVER TAKEN
2007244: 80 a6 60 00 cmp %i1, 0
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
2007248: 02 80 00 53 be 2007394 <sigtimedwait+0x18c> <== NEVER TAKEN
200724c: 39 00 80 6d sethi %hi(0x201b400), %i4
the_thread = _Thread_Executing;
2007250: 39 00 80 6d sethi %hi(0x201b400), %i4
2007254: b8 17 20 00 mov %i4, %i4 ! 201b400 <_Per_CPU_Information>
2007258: f0 07 20 0c ld [ %i4 + 0xc ], %i0
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
200725c: 7f ff ed a7 call 20028f8 <sparc_disable_interrupts>
2007260: f4 06 21 5c ld [ %i0 + 0x15c ], %i2
2007264: b6 10 00 08 mov %o0, %i3
if ( *set & api->signals_pending ) {
2007268: c2 07 40 00 ld [ %i5 ], %g1
200726c: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2
2007270: 80 88 40 02 btst %g1, %g2
2007274: 12 80 00 53 bne 20073c0 <sigtimedwait+0x1b8>
2007278: 01 00 00 00 nop
return the_info->si_signo;
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
200727c: 05 00 80 6d sethi %hi(0x201b400), %g2
2007280: c4 00 a2 54 ld [ %g2 + 0x254 ], %g2 ! 201b654 <_POSIX_signals_Pending>
2007284: 80 88 40 02 btst %g1, %g2
2007288: 12 80 00 2f bne 2007344 <sigtimedwait+0x13c>
200728c: 03 00 80 6b sethi %hi(0x201ac00), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2007290: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201aec0 <_Thread_Dispatch_disable_level>
the_info->si_code = SI_USER;
the_info->si_value.sival_int = 0;
return signo;
}
the_info->si_signo = -1;
2007294: 86 10 3f ff mov -1, %g3
2007298: c6 26 40 00 st %g3, [ %i1 ]
200729c: 84 00 a0 01 inc %g2
20072a0: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ]
return _Thread_Dispatch_disable_level;
20072a4: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
the_thread->Wait.return_code = EINTR;
20072a8: 82 10 20 04 mov 4, %g1
20072ac: c2 26 20 34 st %g1, [ %i0 + 0x34 ]
the_thread->Wait.option = *set;
20072b0: c2 07 40 00 ld [ %i5 ], %g1
the_thread->Wait.return_argument = the_info;
20072b4: f2 26 20 28 st %i1, [ %i0 + 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;
20072b8: c2 26 20 30 st %g1, [ %i0 + 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;
20072bc: b6 10 20 01 mov 1, %i3
}
the_info->si_signo = -1;
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
20072c0: 23 00 80 6d sethi %hi(0x201b400), %l1
20072c4: a2 14 61 ec or %l1, 0x1ec, %l1 ! 201b5ec <_POSIX_signals_Wait_queue>
20072c8: e2 26 20 44 st %l1, [ %i0 + 0x44 ]
20072cc: f6 24 60 30 st %i3, [ %l1 + 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 );
20072d0: 7f ff ed 8e call 2002908 <sparc_enable_interrupts>
20072d4: 01 00 00 00 nop
_Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval );
20072d8: 90 10 00 11 mov %l1, %o0
20072dc: 92 10 00 10 mov %l0, %o1
20072e0: 15 00 80 2b sethi %hi(0x200ac00), %o2
20072e4: 40 00 0d cd call 200aa18 <_Thread_queue_Enqueue_with_handler>
20072e8: 94 12 a1 f8 or %o2, 0x1f8, %o2 ! 200adf8 <_Thread_queue_Timeout>
_Thread_Enable_dispatch();
20072ec: 40 00 0c 80 call 200a4ec <_Thread_Enable_dispatch>
20072f0: 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 );
20072f4: d2 06 40 00 ld [ %i1 ], %o1
20072f8: 90 10 00 1a mov %i2, %o0
20072fc: 94 10 00 19 mov %i1, %o2
2007300: 96 10 20 00 clr %o3
2007304: 40 00 1a aa call 200ddac <_POSIX_signals_Clear_signals>
2007308: 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)
200730c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007310: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
2007314: 80 a0 60 04 cmp %g1, 4
2007318: 12 80 00 3b bne 2007404 <sigtimedwait+0x1fc>
200731c: 01 00 00 00 nop
|| !(*set & signo_to_mask( the_info->si_signo )) ) {
2007320: f0 06 40 00 ld [ %i1 ], %i0
2007324: c2 07 40 00 ld [ %i5 ], %g1
2007328: 84 06 3f ff add %i0, -1, %g2
200732c: b7 2e c0 02 sll %i3, %g2, %i3
2007330: 80 8e c0 01 btst %i3, %g1
2007334: 02 80 00 34 be 2007404 <sigtimedwait+0x1fc>
2007338: 01 00 00 00 nop
errno = _Thread_Executing->Wait.return_code;
return -1;
}
return the_info->si_signo;
}
200733c: 81 c7 e0 08 ret
2007340: 81 e8 00 00 restore
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
2007344: 7f ff ff 99 call 20071a8 <_POSIX_signals_Get_lowest>
2007348: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
200734c: 94 10 00 19 mov %i1, %o2
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
2007350: b0 10 00 08 mov %o0, %i0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
2007354: 96 10 20 01 mov 1, %o3
2007358: 90 10 00 1a mov %i2, %o0
200735c: 92 10 00 18 mov %i0, %o1
2007360: 40 00 1a 93 call 200ddac <_POSIX_signals_Clear_signals>
2007364: 98 10 20 00 clr %o4
_ISR_Enable( level );
2007368: 7f ff ed 68 call 2002908 <sparc_enable_interrupts>
200736c: 90 10 00 1b mov %i3, %o0
the_info->si_signo = signo;
the_info->si_code = SI_USER;
2007370: 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;
2007374: f0 26 40 00 st %i0, [ %i1 ]
the_info->si_code = SI_USER;
2007378: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
200737c: c0 26 60 08 clr [ %i1 + 8 ]
return signo;
2007380: 81 c7 e0 08 ret
2007384: 81 e8 00 00 restore
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
2007388: 12 bf ff b2 bne 2007250 <sigtimedwait+0x48>
200738c: a0 10 20 00 clr %l0
the_thread = _Thread_Executing;
2007390: 39 00 80 6d sethi %hi(0x201b400), %i4
2007394: b8 17 20 00 mov %i4, %i4 ! 201b400 <_Per_CPU_Information>
2007398: f0 07 20 0c ld [ %i4 + 0xc ], %i0
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
200739c: b2 07 bf f4 add %fp, -12, %i1
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
20073a0: 7f ff ed 56 call 20028f8 <sparc_disable_interrupts>
20073a4: f4 06 21 5c ld [ %i0 + 0x15c ], %i2
20073a8: b6 10 00 08 mov %o0, %i3
if ( *set & api->signals_pending ) {
20073ac: c2 07 40 00 ld [ %i5 ], %g1
20073b0: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2
20073b4: 80 88 40 02 btst %g1, %g2
20073b8: 22 bf ff b2 be,a 2007280 <sigtimedwait+0x78>
20073bc: 05 00 80 6d sethi %hi(0x201b400), %g2
/* XXX real info later */
the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending );
20073c0: 7f ff ff 7a call 20071a8 <_POSIX_signals_Get_lowest>
20073c4: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals(
20073c8: 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 );
20073cc: 92 10 00 08 mov %o0, %o1
20073d0: d0 26 40 00 st %o0, [ %i1 ]
_POSIX_signals_Clear_signals(
20073d4: 96 10 20 00 clr %o3
20073d8: 90 10 00 1a mov %i2, %o0
20073dc: 40 00 1a 74 call 200ddac <_POSIX_signals_Clear_signals>
20073e0: 98 10 20 00 clr %o4
the_info->si_signo,
the_info,
false,
false
);
_ISR_Enable( level );
20073e4: 7f ff ed 49 call 2002908 <sparc_enable_interrupts>
20073e8: 90 10 00 1b mov %i3, %o0
the_info->si_code = SI_USER;
20073ec: 82 10 20 01 mov 1, %g1
the_info->si_value.sival_int = 0;
20073f0: c0 26 60 08 clr [ %i1 + 8 ]
false,
false
);
_ISR_Enable( level );
the_info->si_code = SI_USER;
20073f4: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
return the_info->si_signo;
20073f8: f0 06 40 00 ld [ %i1 ], %i0
20073fc: 81 c7 e0 08 ret
2007400: 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;
2007404: 40 00 26 e4 call 2010f94 <__errno>
2007408: b0 10 3f ff mov -1, %i0
200740c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007410: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
2007414: c2 22 00 00 st %g1, [ %o0 ]
return -1;
}
return the_info->si_signo;
}
2007418: 81 c7 e0 08 ret
200741c: 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 );
2007420: 40 00 26 dd call 2010f94 <__errno>
2007424: b0 10 3f ff mov -1, %i0
2007428: 82 10 20 16 mov 0x16, %g1
200742c: c2 22 00 00 st %g1, [ %o0 ]
2007430: 81 c7 e0 08 ret
2007434: 81 e8 00 00 restore
02009078 <sigwait>:
int sigwait(
const sigset_t *set,
int *sig
)
{
2009078: 9d e3 bf a0 save %sp, -96, %sp
int status;
status = sigtimedwait( set, NULL, NULL );
200907c: 92 10 20 00 clr %o1
2009080: 90 10 00 18 mov %i0, %o0
2009084: 7f ff ff 6d call 2008e38 <sigtimedwait>
2009088: 94 10 20 00 clr %o2
if ( status != -1 ) {
200908c: 80 a2 3f ff cmp %o0, -1
2009090: 02 80 00 07 be 20090ac <sigwait+0x34>
2009094: 80 a6 60 00 cmp %i1, 0
if ( sig )
2009098: 02 80 00 03 be 20090a4 <sigwait+0x2c> <== NEVER TAKEN
200909c: b0 10 20 00 clr %i0
*sig = status;
20090a0: d0 26 40 00 st %o0, [ %i1 ]
20090a4: 81 c7 e0 08 ret
20090a8: 81 e8 00 00 restore
return 0;
}
return errno;
20090ac: 40 00 26 07 call 20128c8 <__errno>
20090b0: 01 00 00 00 nop
20090b4: f0 02 00 00 ld [ %o0 ], %i0
}
20090b8: 81 c7 e0 08 ret
20090bc: 81 e8 00 00 restore
02005f78 <sysconf>:
*/
long sysconf(
int name
)
{
2005f78: 9d e3 bf a0 save %sp, -96, %sp
if ( name == _SC_CLK_TCK )
2005f7c: 80 a6 20 02 cmp %i0, 2
2005f80: 02 80 00 10 be 2005fc0 <sysconf+0x48>
2005f84: 03 00 80 5d sethi %hi(0x2017400), %g1
return (TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick());
if ( name == _SC_OPEN_MAX )
2005f88: 80 a6 20 04 cmp %i0, 4
2005f8c: 02 80 00 0b be 2005fb8 <sysconf+0x40>
2005f90: c2 00 60 7c ld [ %g1 + 0x7c ], %g1
return rtems_libio_number_iops;
if ( name == _SC_GETPW_R_SIZE_MAX )
2005f94: 80 a6 20 33 cmp %i0, 0x33
2005f98: 02 80 00 08 be 2005fb8 <sysconf+0x40>
2005f9c: 82 10 24 00 mov 0x400, %g1
return 1024;
if ( name == _SC_PAGESIZE )
2005fa0: 80 a6 20 08 cmp %i0, 8
2005fa4: 02 80 00 05 be 2005fb8 <sysconf+0x40>
2005fa8: 03 00 00 04 sethi %hi(0x1000), %g1
return PAGE_SIZE;
#if defined(__sparc__)
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
2005fac: 80 a6 22 03 cmp %i0, 0x203
2005fb0: 12 80 00 0c bne 2005fe0 <sysconf+0x68> <== ALWAYS TAKEN
2005fb4: 82 10 20 00 clr %g1
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
}
2005fb8: 81 c7 e0 08 ret
2005fbc: 91 e8 00 01 restore %g0, %g1, %o0
int name
)
{
if ( name == _SC_CLK_TCK )
return (TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick());
2005fc0: 03 00 80 5c sethi %hi(0x2017000), %g1
long sysconf(
int name
)
{
if ( name == _SC_CLK_TCK )
return (TOD_MICROSECONDS_PER_SECOND /
2005fc4: d2 00 63 38 ld [ %g1 + 0x338 ], %o1 ! 2017338 <Configuration+0xc>
2005fc8: 11 00 03 d0 sethi %hi(0xf4000), %o0
2005fcc: 40 00 36 0c call 20137fc <.udiv>
2005fd0: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
2005fd4: 82 10 00 08 mov %o0, %g1
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
}
2005fd8: 81 c7 e0 08 ret
2005fdc: 91 e8 00 01 restore %g0, %g1, %o0
#if defined(__sparc__)
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
2005fe0: 40 00 26 c0 call 200fae0 <__errno>
2005fe4: 01 00 00 00 nop
2005fe8: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
2005fec: 82 10 3f ff mov -1, %g1
2005ff0: 10 bf ff f2 b 2005fb8 <sysconf+0x40>
2005ff4: c4 22 00 00 st %g2, [ %o0 ]
0200632c <timer_create>:
int timer_create(
clockid_t clock_id,
struct sigevent *evp,
timer_t *timerid
)
{
200632c: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Timer_Control *ptimer;
if ( clock_id != CLOCK_REALTIME )
2006330: 80 a6 20 01 cmp %i0, 1
2006334: 12 80 00 3e bne 200642c <timer_create+0x100>
2006338: 80 a6 a0 00 cmp %i2, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !timerid )
200633c: 02 80 00 3c be 200642c <timer_create+0x100>
2006340: 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) {
2006344: 02 80 00 0e be 200637c <timer_create+0x50>
2006348: 03 00 80 79 sethi %hi(0x201e400), %g1
/* The structure has data */
if ( ( evp->sigev_notify != SIGEV_NONE ) &&
200634c: c2 06 40 00 ld [ %i1 ], %g1
2006350: 82 00 7f ff add %g1, -1, %g1
2006354: 80 a0 60 01 cmp %g1, 1
2006358: 18 80 00 35 bgu 200642c <timer_create+0x100> <== NEVER TAKEN
200635c: 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 )
2006360: c2 06 60 04 ld [ %i1 + 4 ], %g1
2006364: 80 a0 60 00 cmp %g1, 0
2006368: 02 80 00 31 be 200642c <timer_create+0x100> <== NEVER TAKEN
200636c: 82 00 7f ff add %g1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(evp->sigev_signo) )
2006370: 80 a0 60 1f cmp %g1, 0x1f
2006374: 18 80 00 2e bgu 200642c <timer_create+0x100> <== NEVER TAKEN
2006378: 03 00 80 79 sethi %hi(0x201e400), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
200637c: c4 00 61 70 ld [ %g1 + 0x170 ], %g2 ! 201e570 <_Thread_Dispatch_disable_level>
2006380: 84 00 a0 01 inc %g2
2006384: c4 20 61 70 st %g2, [ %g1 + 0x170 ]
return _Thread_Dispatch_disable_level;
2006388: c2 00 61 70 ld [ %g1 + 0x170 ], %g1
* 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 );
200638c: 3b 00 80 7a sethi %hi(0x201e800), %i5
2006390: 40 00 08 58 call 20084f0 <_Objects_Allocate>
2006394: 90 17 60 70 or %i5, 0x70, %o0 ! 201e870 <_POSIX_Timer_Information>
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
2006398: 80 a2 20 00 cmp %o0, 0
200639c: 02 80 00 2a be 2006444 <timer_create+0x118>
20063a0: 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;
20063a4: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ]
ptimer->thread_id = _Thread_Executing->Object.id;
20063a8: 03 00 80 7a sethi %hi(0x201e800), %g1
20063ac: c2 00 62 bc ld [ %g1 + 0x2bc ], %g1 ! 201eabc <_Per_CPU_Information+0xc>
if ( evp != NULL ) {
20063b0: 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;
20063b4: c2 00 60 08 ld [ %g1 + 8 ], %g1
if ( evp != NULL ) {
20063b8: 02 80 00 08 be 20063d8 <timer_create+0xac>
20063bc: c2 22 20 38 st %g1, [ %o0 + 0x38 ]
ptimer->inf.sigev_notify = evp->sigev_notify;
20063c0: c6 06 40 00 ld [ %i1 ], %g3
ptimer->inf.sigev_signo = evp->sigev_signo;
20063c4: c4 06 60 04 ld [ %i1 + 4 ], %g2
ptimer->inf.sigev_value = evp->sigev_value;
20063c8: 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;
20063cc: c6 22 20 40 st %g3, [ %o0 + 0x40 ]
ptimer->inf.sigev_signo = evp->sigev_signo;
20063d0: c4 22 20 44 st %g2, [ %o0 + 0x44 ]
ptimer->inf.sigev_value = evp->sigev_value;
20063d4: c2 22 20 48 st %g1, [ %o0 + 0x48 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
20063d8: c4 12 20 0a lduh [ %o0 + 0xa ], %g2
_Objects_Open_u32(&_POSIX_Timer_Information, &ptimer->Object, 0);
*timerid = ptimer->Object.id;
_Thread_Enable_dispatch();
return 0;
}
20063dc: ba 17 60 70 or %i5, 0x70, %i5
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20063e0: c6 07 60 1c ld [ %i5 + 0x1c ], %g3
ptimer->inf.sigev_notify = evp->sigev_notify;
ptimer->inf.sigev_signo = evp->sigev_signo;
ptimer->inf.sigev_value = evp->sigev_value;
}
ptimer->overrun = 0;
20063e4: c0 22 20 68 clr [ %o0 + 0x68 ]
ptimer->timer_data.it_value.tv_sec = 0;
20063e8: c0 22 20 5c clr [ %o0 + 0x5c ]
ptimer->timer_data.it_value.tv_nsec = 0;
20063ec: c0 22 20 60 clr [ %o0 + 0x60 ]
ptimer->timer_data.it_interval.tv_sec = 0;
20063f0: c0 22 20 54 clr [ %o0 + 0x54 ]
ptimer->timer_data.it_interval.tv_nsec = 0;
20063f4: c0 22 20 58 clr [ %o0 + 0x58 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20063f8: c0 22 20 18 clr [ %o0 + 0x18 ]
the_watchdog->routine = routine;
20063fc: c0 22 20 2c clr [ %o0 + 0x2c ]
the_watchdog->id = id;
2006400: c0 22 20 30 clr [ %o0 + 0x30 ]
the_watchdog->user_data = user_data;
2006404: c0 22 20 34 clr [ %o0 + 0x34 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2006408: c2 02 20 08 ld [ %o0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200640c: 85 28 a0 02 sll %g2, 2, %g2
2006410: 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;
2006414: 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;
2006418: c2 26 80 00 st %g1, [ %i2 ]
_Thread_Enable_dispatch();
200641c: 40 00 0d 52 call 2009964 <_Thread_Enable_dispatch>
2006420: b0 10 20 00 clr %i0
return 0;
}
2006424: 81 c7 e0 08 ret
2006428: 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 );
200642c: 40 00 27 d8 call 201038c <__errno>
2006430: b0 10 3f ff mov -1, %i0
2006434: 82 10 20 16 mov 0x16, %g1
2006438: c2 22 00 00 st %g1, [ %o0 ]
200643c: 81 c7 e0 08 ret
2006440: 81 e8 00 00 restore
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
_Thread_Enable_dispatch();
2006444: 40 00 0d 48 call 2009964 <_Thread_Enable_dispatch>
2006448: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
200644c: 40 00 27 d0 call 201038c <__errno>
2006450: 01 00 00 00 nop
2006454: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
2006458: c2 22 00 00 st %g1, [ %o0 ]
200645c: 81 c7 e0 08 ret
2006460: 81 e8 00 00 restore
02006464 <timer_settime>:
timer_t timerid,
int flags,
const struct itimerspec *value,
struct itimerspec *ovalue
)
{
2006464: 9d e3 bf 80 save %sp, -128, %sp
Objects_Locations location;
bool activated;
uint32_t initial_period;
struct itimerspec normalize;
if ( !value )
2006468: 80 a6 a0 00 cmp %i2, 0
200646c: 02 80 00 88 be 200668c <timer_settime+0x228> <== NEVER TAKEN
2006470: 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) ) ) {
2006474: 40 00 10 37 call 200a550 <_Timespec_Is_valid>
2006478: 90 06 a0 08 add %i2, 8, %o0
200647c: 80 8a 20 ff btst 0xff, %o0
2006480: 02 80 00 83 be 200668c <timer_settime+0x228>
2006484: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( !_Timespec_Is_valid( &(value->it_interval) ) ) {
2006488: 40 00 10 32 call 200a550 <_Timespec_Is_valid>
200648c: 90 10 00 1a mov %i2, %o0
2006490: 80 8a 20 ff btst 0xff, %o0
2006494: 02 80 00 7e be 200668c <timer_settime+0x228> <== NEVER TAKEN
2006498: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) {
200649c: 12 80 00 7a bne 2006684 <timer_settime+0x220>
20064a0: 80 a6 60 04 cmp %i1, 4
rtems_set_errno_and_return_minus_one( EINVAL );
}
normalize = *value;
20064a4: c8 06 80 00 ld [ %i2 ], %g4
20064a8: c6 06 a0 04 ld [ %i2 + 4 ], %g3
20064ac: c4 06 a0 08 ld [ %i2 + 8 ], %g2
20064b0: c2 06 a0 0c ld [ %i2 + 0xc ], %g1
20064b4: c8 27 bf e4 st %g4, [ %fp + -28 ]
20064b8: c6 27 bf e8 st %g3, [ %fp + -24 ]
20064bc: c4 27 bf ec st %g2, [ %fp + -20 ]
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
20064c0: 80 a6 60 04 cmp %i1, 4
20064c4: 02 80 00 3b be 20065b0 <timer_settime+0x14c>
20064c8: c2 27 bf f0 st %g1, [ %fp + -16 ]
RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get (
timer_t id,
Objects_Locations *location
)
{
return (POSIX_Timer_Control *)
20064cc: 92 10 00 18 mov %i0, %o1
20064d0: 11 00 80 7a sethi %hi(0x201e800), %o0
20064d4: 94 07 bf fc add %fp, -4, %o2
20064d8: 40 00 09 51 call 2008a1c <_Objects_Get>
20064dc: 90 12 20 70 or %o0, 0x70, %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 ) {
20064e0: c2 07 bf fc ld [ %fp + -4 ], %g1
20064e4: 80 a0 60 00 cmp %g1, 0
20064e8: 12 80 00 46 bne 2006600 <timer_settime+0x19c> <== NEVER TAKEN
20064ec: ba 10 00 08 mov %o0, %i5
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 ) {
20064f0: c2 07 bf ec ld [ %fp + -20 ], %g1
20064f4: 80 a0 60 00 cmp %g1, 0
20064f8: 12 80 00 05 bne 200650c <timer_settime+0xa8>
20064fc: c2 07 bf f0 ld [ %fp + -16 ], %g1
2006500: 80 a0 60 00 cmp %g1, 0
2006504: 02 80 00 45 be 2006618 <timer_settime+0x1b4>
2006508: 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 );
200650c: 40 00 10 36 call 200a5e4 <_Timespec_To_ticks>
2006510: 90 10 00 1a mov %i2, %o0
2006514: d0 27 60 64 st %o0, [ %i5 + 0x64 ]
initial_period = _Timespec_To_ticks( &normalize.it_value );
2006518: 40 00 10 33 call 200a5e4 <_Timespec_To_ticks>
200651c: 90 07 bf ec add %fp, -20, %o0
activated = _POSIX_Timer_Insert_helper(
2006520: d4 07 60 08 ld [ %i5 + 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 );
2006524: 92 10 00 08 mov %o0, %o1
activated = _POSIX_Timer_Insert_helper(
2006528: 98 10 00 1d mov %i5, %o4
200652c: 90 07 60 10 add %i5, 0x10, %o0
2006530: 17 00 80 19 sethi %hi(0x2006400), %o3
2006534: 40 00 1b d7 call 200d490 <_POSIX_Timer_Insert_helper>
2006538: 96 12 e2 a4 or %o3, 0x2a4, %o3 ! 20066a4 <_POSIX_Timer_TSR>
initial_period,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated ) {
200653c: 80 8a 20 ff btst 0xff, %o0
2006540: 02 80 00 18 be 20065a0 <timer_settime+0x13c>
2006544: 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 )
2006548: 02 80 00 0b be 2006574 <timer_settime+0x110>
200654c: c2 07 bf e4 ld [ %fp + -28 ], %g1
*ovalue = ptimer->timer_data;
2006550: c2 07 60 54 ld [ %i5 + 0x54 ], %g1
2006554: c2 26 c0 00 st %g1, [ %i3 ]
2006558: c2 07 60 58 ld [ %i5 + 0x58 ], %g1
200655c: c2 26 e0 04 st %g1, [ %i3 + 4 ]
2006560: c2 07 60 5c ld [ %i5 + 0x5c ], %g1
2006564: c2 26 e0 08 st %g1, [ %i3 + 8 ]
2006568: c2 07 60 60 ld [ %i5 + 0x60 ], %g1
200656c: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
ptimer->timer_data = normalize;
2006570: c2 07 bf e4 ld [ %fp + -28 ], %g1
/* Indicate that the time is running */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
_TOD_Get( &ptimer->time );
2006574: 90 07 60 6c add %i5, 0x6c, %o0
* The timer has been started and is running. So we return the
* old ones in "ovalue"
*/
if ( ovalue )
*ovalue = ptimer->timer_data;
ptimer->timer_data = normalize;
2006578: c2 27 60 54 st %g1, [ %i5 + 0x54 ]
200657c: c2 07 bf e8 ld [ %fp + -24 ], %g1
2006580: c2 27 60 58 st %g1, [ %i5 + 0x58 ]
2006584: c2 07 bf ec ld [ %fp + -20 ], %g1
2006588: c2 27 60 5c st %g1, [ %i5 + 0x5c ]
200658c: c2 07 bf f0 ld [ %fp + -16 ], %g1
2006590: c2 27 60 60 st %g1, [ %i5 + 0x60 ]
/* Indicate that the time is running */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
2006594: 82 10 20 03 mov 3, %g1
_TOD_Get( &ptimer->time );
2006598: 40 00 06 4c call 2007ec8 <_TOD_Get>
200659c: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ]
_Thread_Enable_dispatch();
20065a0: 40 00 0c f1 call 2009964 <_Thread_Enable_dispatch>
20065a4: b0 10 20 00 clr %i0
return 0;
20065a8: 81 c7 e0 08 ret
20065ac: 81 e8 00 00 restore
normalize = *value;
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
struct timespec now;
_TOD_Get( &now );
20065b0: 40 00 06 46 call 2007ec8 <_TOD_Get>
20065b4: 90 07 bf f4 add %fp, -12, %o0
/* Check for seconds in the past */
if ( _Timespec_Greater_than( &now, &normalize.it_value ) )
20065b8: 90 07 bf f4 add %fp, -12, %o0
20065bc: 40 00 0f d3 call 200a508 <_Timespec_Greater_than>
20065c0: 92 07 bf ec add %fp, -20, %o1
20065c4: 80 8a 20 ff btst 0xff, %o0
20065c8: 12 80 00 31 bne 200668c <timer_settime+0x228>
20065cc: 92 07 bf ec add %fp, -20, %o1
rtems_set_errno_and_return_minus_one( EINVAL );
_Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value );
20065d0: 90 07 bf f4 add %fp, -12, %o0
20065d4: 40 00 0f f0 call 200a594 <_Timespec_Subtract>
20065d8: 94 10 00 09 mov %o1, %o2
20065dc: 92 10 00 18 mov %i0, %o1
20065e0: 11 00 80 7a sethi %hi(0x201e800), %o0
20065e4: 94 07 bf fc add %fp, -4, %o2
20065e8: 40 00 09 0d call 2008a1c <_Objects_Get>
20065ec: 90 12 20 70 or %o0, 0x70, %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 ) {
20065f0: c2 07 bf fc ld [ %fp + -4 ], %g1
20065f4: 80 a0 60 00 cmp %g1, 0
20065f8: 02 bf ff be be 20064f0 <timer_settime+0x8c>
20065fc: ba 10 00 08 mov %o0, %i5
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EINVAL );
2006600: 40 00 27 63 call 201038c <__errno>
2006604: b0 10 3f ff mov -1, %i0
2006608: 82 10 20 16 mov 0x16, %g1
200660c: c2 22 00 00 st %g1, [ %o0 ]
}
2006610: 81 c7 e0 08 ret
2006614: 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 );
2006618: 40 00 11 38 call 200aaf8 <_Watchdog_Remove>
200661c: 90 02 20 10 add %o0, 0x10, %o0
/* The old data of the timer are returned */
if ( ovalue )
2006620: 80 a6 e0 00 cmp %i3, 0
2006624: 02 80 00 0b be 2006650 <timer_settime+0x1ec>
2006628: c2 07 bf e4 ld [ %fp + -28 ], %g1
*ovalue = ptimer->timer_data;
200662c: c2 07 60 54 ld [ %i5 + 0x54 ], %g1
2006630: c2 26 c0 00 st %g1, [ %i3 ]
2006634: c2 07 60 58 ld [ %i5 + 0x58 ], %g1
2006638: c2 26 e0 04 st %g1, [ %i3 + 4 ]
200663c: c2 07 60 5c ld [ %i5 + 0x5c ], %g1
2006640: c2 26 e0 08 st %g1, [ %i3 + 8 ]
2006644: c2 07 60 60 ld [ %i5 + 0x60 ], %g1
2006648: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
/* The new data are set */
ptimer->timer_data = normalize;
200664c: c2 07 bf e4 ld [ %fp + -28 ], %g1
/* Indicates that the timer is created and stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
/* Returns with success */
_Thread_Enable_dispatch();
return 0;
2006650: 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;
2006654: c2 27 60 54 st %g1, [ %i5 + 0x54 ]
2006658: c2 07 bf e8 ld [ %fp + -24 ], %g1
200665c: c2 27 60 58 st %g1, [ %i5 + 0x58 ]
2006660: c2 07 bf ec ld [ %fp + -20 ], %g1
2006664: c2 27 60 5c st %g1, [ %i5 + 0x5c ]
2006668: c2 07 bf f0 ld [ %fp + -16 ], %g1
200666c: c2 27 60 60 st %g1, [ %i5 + 0x60 ]
/* Indicates that the timer is created and stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
2006670: 82 10 20 04 mov 4, %g1
/* Returns with success */
_Thread_Enable_dispatch();
2006674: 40 00 0c bc call 2009964 <_Thread_Enable_dispatch>
2006678: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ]
return 0;
200667c: 81 c7 e0 08 ret
2006680: 81 e8 00 00 restore
}
if ( !_Timespec_Is_valid( &(value->it_interval) ) ) {
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) {
2006684: 22 bf ff 89 be,a 20064a8 <timer_settime+0x44>
2006688: c8 06 80 00 ld [ %i2 ], %g4
if (flags == TIMER_ABSTIME) {
struct timespec now;
_TOD_Get( &now );
/* Check for seconds in the past */
if ( _Timespec_Greater_than( &now, &normalize.it_value ) )
rtems_set_errno_and_return_minus_one( EINVAL );
200668c: 40 00 27 40 call 201038c <__errno>
2006690: b0 10 3f ff mov -1, %i0
2006694: 82 10 20 16 mov 0x16, %g1
2006698: c2 22 00 00 st %g1, [ %o0 ]
200669c: 81 c7 e0 08 ret
20066a0: 81 e8 00 00 restore
02006300 <ualarm>:
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
2006300: 9d e3 bf 98 save %sp, -104, %sp
/*
* Initialize the timer used to implement alarm().
*/
if ( !the_timer->routine ) {
2006304: 3b 00 80 66 sethi %hi(0x2019800), %i5
2006308: ba 17 61 48 or %i5, 0x148, %i5 ! 2019948 <_POSIX_signals_Ualarm_timer>
200630c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
2006310: 80 a0 60 00 cmp %g1, 0
2006314: 02 80 00 24 be 20063a4 <ualarm+0xa4>
2006318: 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 );
200631c: 40 00 10 e8 call 200a6bc <_Watchdog_Remove>
2006320: 90 10 00 1d mov %i5, %o0
if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) {
2006324: 90 02 3f fe add %o0, -2, %o0
2006328: 80 a2 20 01 cmp %o0, 1
200632c: 08 80 00 26 bleu 20063c4 <ualarm+0xc4> <== ALWAYS TAKEN
2006330: 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 ) {
2006334: 80 a7 20 00 cmp %i4, 0
2006338: 02 80 00 19 be 200639c <ualarm+0x9c>
200633c: 37 00 03 d0 sethi %hi(0xf4000), %i3
Watchdog_Interval ticks;
tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND;
2006340: 90 10 00 1c mov %i4, %o0
2006344: 40 00 3a 67 call 2014ce0 <.udiv>
2006348: 92 16 e2 40 or %i3, 0x240, %o1
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
200634c: 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;
2006350: d0 27 bf f8 st %o0, [ %fp + -8 ]
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
2006354: 40 00 3b 0f call 2014f90 <.urem>
2006358: 90 10 00 1c mov %i4, %o0
200635c: 87 2a 20 07 sll %o0, 7, %g3
2006360: 82 10 00 08 mov %o0, %g1
2006364: 85 2a 20 02 sll %o0, 2, %g2
2006368: 84 20 c0 02 sub %g3, %g2, %g2
200636c: 82 00 80 01 add %g2, %g1, %g1
2006370: 83 28 60 03 sll %g1, 3, %g1
ticks = _Timespec_To_ticks( &tp );
2006374: 90 07 bf f8 add %fp, -8, %o0
2006378: 40 00 0f 5d call 200a0ec <_Timespec_To_ticks>
200637c: c2 27 bf fc st %g1, [ %fp + -4 ]
if ( ticks == 0 )
ticks = 1;
_Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) );
2006380: 40 00 0f 5b call 200a0ec <_Timespec_To_ticks>
2006384: 90 07 bf f8 add %fp, -8, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006388: 92 10 00 1d mov %i5, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200638c: d0 27 60 0c st %o0, [ %i5 + 0xc ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006390: 11 00 80 64 sethi %hi(0x2019000), %o0
2006394: 40 00 10 68 call 200a534 <_Watchdog_Insert>
2006398: 90 12 20 ec or %o0, 0xec, %o0 ! 20190ec <_Watchdog_Ticks_chain>
}
return remaining;
}
200639c: 81 c7 e0 08 ret
20063a0: 81 e8 00 00 restore
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20063a4: 03 00 80 18 sethi %hi(0x2006000), %g1
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20063a8: c0 27 60 08 clr [ %i5 + 8 ]
the_watchdog->routine = routine;
20063ac: 82 10 62 d4 or %g1, 0x2d4, %g1
the_watchdog->id = id;
20063b0: c0 27 60 20 clr [ %i5 + 0x20 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20063b4: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
the_watchdog->id = id;
the_watchdog->user_data = user_data;
20063b8: c0 27 60 24 clr [ %i5 + 0x24 ]
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
useconds_t remaining = 0;
20063bc: 10 bf ff de b 2006334 <ualarm+0x34>
20063c0: 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);
20063c4: c4 07 60 0c ld [ %i5 + 0xc ], %g2
20063c8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
20063cc: d0 07 60 14 ld [ %i5 + 0x14 ], %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
20063d0: 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);
20063d4: 90 02 00 02 add %o0, %g2, %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
20063d8: 40 00 0f 1c call 200a048 <_Timespec_From_ticks>
20063dc: 90 22 00 01 sub %o0, %g1, %o0
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
20063e0: c2 07 bf f8 ld [ %fp + -8 ], %g1
remaining += tp.tv_nsec / 1000;
20063e4: 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;
20063e8: 85 28 60 03 sll %g1, 3, %g2
20063ec: 87 28 60 08 sll %g1, 8, %g3
20063f0: 84 20 c0 02 sub %g3, %g2, %g2
remaining += tp.tv_nsec / 1000;
20063f4: 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;
20063f8: b1 28 a0 06 sll %g2, 6, %i0
20063fc: b0 26 00 02 sub %i0, %g2, %i0
remaining += tp.tv_nsec / 1000;
2006400: 40 00 3a 3a call 2014ce8 <.div>
2006404: 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;
2006408: b1 2e 20 06 sll %i0, 6, %i0
remaining += tp.tv_nsec / 1000;
200640c: 10 bf ff ca b 2006334 <ualarm+0x34>
2006410: b0 02 00 18 add %o0, %i0, %i0