RTEMS 4.11Annotated Report
Mon Jul 4 13:58:20 2011
02007288 <_API_extensions_Run_postdriver>:
*
* _API_extensions_Run_postdriver
*/
void _API_extensions_Run_postdriver( void )
{
2007288: 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;
200728c: 39 00 80 76 sethi %hi(0x201d800), %i4
2007290: fa 07 23 84 ld [ %i4 + 0x384 ], %i5 ! 201db84 <_API_extensions_List>
2007294: b8 17 23 84 or %i4, 0x384, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
2007298: b8 07 20 04 add %i4, 4, %i4
200729c: 80 a7 40 1c cmp %i5, %i4
20072a0: 02 80 00 09 be 20072c4 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN
20072a4: 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)();
20072a8: c2 07 60 08 ld [ %i5 + 8 ], %g1
20072ac: 9f c0 40 00 call %g1
20072b0: 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 ) {
20072b4: 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 );
20072b8: 80 a7 40 1c cmp %i5, %i4
20072bc: 32 bf ff fc bne,a 20072ac <_API_extensions_Run_postdriver+0x24>
20072c0: c2 07 60 08 ld [ %i5 + 8 ], %g1
20072c4: 81 c7 e0 08 ret
20072c8: 81 e8 00 00 restore
020072cc <_API_extensions_Run_postswitch>:
*
* _API_extensions_Run_postswitch
*/
void _API_extensions_Run_postswitch( void )
{
20072cc: 9d e3 bf a0 save %sp, -96, %sp
20072d0: 39 00 80 76 sethi %hi(0x201d800), %i4
20072d4: fa 07 23 84 ld [ %i4 + 0x384 ], %i5 ! 201db84 <_API_extensions_List>
20072d8: b8 17 23 84 or %i4, 0x384, %i4
Chain_Node *the_node;
API_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_API_extensions_List );
20072dc: b8 07 20 04 add %i4, 4, %i4
20072e0: 80 a7 40 1c cmp %i5, %i4
20072e4: 02 80 00 0a be 200730c <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN
20072e8: 37 00 80 77 sethi %hi(0x201dc00), %i3
20072ec: b6 16 e2 c8 or %i3, 0x2c8, %i3 ! 201dec8 <_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 );
20072f0: c2 07 60 0c ld [ %i5 + 0xc ], %g1
20072f4: 9f c0 40 00 call %g1
20072f8: 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 ) {
20072fc: 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 );
2007300: 80 a7 40 1c cmp %i5, %i4
2007304: 32 bf ff fc bne,a 20072f4 <_API_extensions_Run_postswitch+0x28>
2007308: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200730c: 81 c7 e0 08 ret
2007310: 81 e8 00 00 restore
0200953c <_CORE_RWLock_Release>:
*/
CORE_RWLock_Status _CORE_RWLock_Release(
CORE_RWLock_Control *the_rwlock
)
{
200953c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Thread_Control *executing = _Thread_Executing;
2009540: 03 00 80 6b sethi %hi(0x201ac00), %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 );
2009544: 7f ff e8 13 call 2003590 <sparc_disable_interrupts>
2009548: fa 00 63 34 ld [ %g1 + 0x334 ], %i5 ! 201af34 <_Per_CPU_Information+0xc>
200954c: 84 10 00 08 mov %o0, %g2
if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){
2009550: c2 06 20 44 ld [ %i0 + 0x44 ], %g1
2009554: 80 a0 60 00 cmp %g1, 0
2009558: 02 80 00 2b be 2009604 <_CORE_RWLock_Release+0xc8>
200955c: 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 ) {
2009560: 22 80 00 22 be,a 20095e8 <_CORE_RWLock_Release+0xac>
2009564: 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;
2009568: 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;
200956c: c0 26 20 44 clr [ %i0 + 0x44 ]
_ISR_Enable( level );
2009570: 7f ff e8 0c call 20035a0 <sparc_enable_interrupts>
2009574: 90 10 00 02 mov %g2, %o0
next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue );
2009578: 40 00 07 f3 call 200b544 <_Thread_queue_Dequeue>
200957c: 90 10 00 18 mov %i0, %o0
if ( next ) {
2009580: 80 a2 20 00 cmp %o0, 0
2009584: 22 80 00 24 be,a 2009614 <_CORE_RWLock_Release+0xd8>
2009588: b0 10 20 00 clr %i0
if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) {
200958c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1
2009590: 80 a0 60 01 cmp %g1, 1
2009594: 02 80 00 22 be 200961c <_CORE_RWLock_Release+0xe0>
2009598: 84 10 20 01 mov 1, %g2
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
200959c: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
20095a0: 82 00 60 01 inc %g1
the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING;
20095a4: c4 26 20 44 st %g2, [ %i0 + 0x44 ]
}
/*
* Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING
*/
the_rwlock->number_of_readers += 1;
20095a8: 10 80 00 09 b 20095cc <_CORE_RWLock_Release+0x90>
20095ac: 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 ||
20095b0: 80 a0 60 01 cmp %g1, 1
20095b4: 02 80 00 0b be 20095e0 <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN
20095b8: 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;
20095bc: c2 06 20 48 ld [ %i0 + 0x48 ], %g1
20095c0: 82 00 60 01 inc %g1
_Thread_queue_Extract( &the_rwlock->Wait_queue, next );
20095c4: 40 00 08 f0 call 200b984 <_Thread_queue_Extract>
20095c8: 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 );
20095cc: 40 00 09 3f call 200bac8 <_Thread_queue_First>
20095d0: 90 10 00 18 mov %i0, %o0
if ( !next ||
20095d4: 92 92 20 00 orcc %o0, 0, %o1
20095d8: 32 bf ff f6 bne,a 20095b0 <_CORE_RWLock_Release+0x74>
20095dc: c2 02 60 30 ld [ %o1 + 0x30 ], %g1
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
20095e0: 81 c7 e0 08 ret
20095e4: 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;
20095e8: 82 00 7f ff add %g1, -1, %g1
if ( the_rwlock->number_of_readers != 0 ) {
20095ec: 80 a0 60 00 cmp %g1, 0
20095f0: 02 bf ff de be 2009568 <_CORE_RWLock_Release+0x2c>
20095f4: c2 26 20 48 st %g1, [ %i0 + 0x48 ]
/* must be unlocked again */
_ISR_Enable( level );
20095f8: 7f ff e7 ea call 20035a0 <sparc_enable_interrupts>
20095fc: b0 10 20 00 clr %i0
return CORE_RWLOCK_SUCCESSFUL;
2009600: 30 80 00 05 b,a 2009614 <_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 );
2009604: 7f ff e7 e7 call 20035a0 <sparc_enable_interrupts>
2009608: b0 10 20 00 clr %i0
executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE;
200960c: 82 10 20 02 mov 2, %g1
2009610: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
2009614: 81 c7 e0 08 ret
2009618: 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;
200961c: 82 10 20 02 mov 2, %g1
2009620: c2 26 20 44 st %g1, [ %i0 + 0x44 ]
}
/* indentation is to match _ISR_Disable at top */
return CORE_RWLOCK_SUCCESSFUL;
}
2009624: 81 c7 e0 08 ret
2009628: 91 e8 20 00 restore %g0, 0, %o0
0200962c <_CORE_RWLock_Timeout>:
void _CORE_RWLock_Timeout(
Objects_Id id,
void *ignored
)
{
200962c: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2009630: 90 10 00 18 mov %i0, %o0
2009634: 40 00 06 ed call 200b1e8 <_Thread_Get>
2009638: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200963c: c2 07 bf fc ld [ %fp + -4 ], %g1
2009640: 80 a0 60 00 cmp %g1, 0
2009644: 12 80 00 09 bne 2009668 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN
2009648: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
200964c: 40 00 09 61 call 200bbd0 <_Thread_queue_Process_timeout>
2009650: 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--;
2009654: 03 00 80 6a sethi %hi(0x201a800), %g1
2009658: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 201a9f0 <_Thread_Dispatch_disable_level>
200965c: 84 00 bf ff add %g2, -1, %g2
2009660: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ]
return _Thread_Dispatch_disable_level;
2009664: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %g1
2009668: 81 c7 e0 08 ret
200966c: 81 e8 00 00 restore
02010b24 <_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
)
{
2010b24: 9d e3 bf a0 save %sp, -96, %sp
size_t message_buffering_required;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
the_message_queue->number_of_pending_messages = 0;
2010b28: c0 26 20 48 clr [ %i0 + 0x48 ]
)
{
size_t message_buffering_required;
size_t allocated_message_size;
the_message_queue->maximum_pending_messages = maximum_pending_messages;
2010b2c: 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;
2010b30: 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;
2010b34: c0 26 20 60 clr [ %i0 + 0x60 ]
the_message_queue->notify_argument = the_argument;
2010b38: 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)) {
2010b3c: 80 8e e0 03 btst 3, %i3
2010b40: 02 80 00 0a be 2010b68 <_CORE_message_queue_Initialize+0x44>
2010b44: a0 10 00 1b mov %i3, %l0
allocated_message_size += sizeof(uint32_t);
2010b48: a0 06 e0 04 add %i3, 4, %l0
allocated_message_size &= ~(sizeof(uint32_t) - 1);
2010b4c: a0 0c 3f fc and %l0, -4, %l0
}
if (allocated_message_size < maximum_message_size)
2010b50: 80 a6 c0 10 cmp %i3, %l0
2010b54: 08 80 00 05 bleu 2010b68 <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN
2010b58: ba 10 20 00 clr %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010b5c: b0 0f 60 01 and %i5, 1, %i0
2010b60: 81 c7 e0 08 ret
2010b64: 81 e8 00 00 restore
/*
* Calculate how much total memory is required for message buffering and
* check for overflow on the multiplication.
*/
message_buffering_required = (size_t) maximum_pending_messages *
(allocated_message_size + sizeof(CORE_message_queue_Buffer_control));
2010b68: b8 04 20 14 add %l0, 0x14, %i4
/*
* Calculate how much total memory is required for message buffering and
* check for overflow on the multiplication.
*/
message_buffering_required = (size_t) maximum_pending_messages *
2010b6c: 92 10 00 1a mov %i2, %o1
2010b70: 90 10 00 1c mov %i4, %o0
2010b74: 40 00 43 9b call 20219e0 <.umul>
2010b78: ba 10 20 00 clr %i5
(allocated_message_size + sizeof(CORE_message_queue_Buffer_control));
if (message_buffering_required < allocated_message_size)
2010b7c: 80 a2 00 10 cmp %o0, %l0
2010b80: 2a bf ff f8 bcs,a 2010b60 <_CORE_message_queue_Initialize+0x3c><== NEVER TAKEN
2010b84: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
_Workspace_Allocate( message_buffering_required );
2010b88: 40 00 0d 29 call 201402c <_Workspace_Allocate>
2010b8c: 01 00 00 00 nop
return false;
/*
* Attempt to allocate the message memory
*/
the_message_queue->message_buffers = (CORE_message_queue_Buffer *)
2010b90: d0 26 20 5c st %o0, [ %i0 + 0x5c ]
_Workspace_Allocate( message_buffering_required );
if (the_message_queue->message_buffers == 0)
2010b94: 80 a2 20 00 cmp %o0, 0
2010b98: 02 bf ff f1 be 2010b5c <_CORE_message_queue_Initialize+0x38>
2010b9c: 92 10 00 08 mov %o0, %o1
/*
* Initialize the pool of inactive messages, pending messages,
* and set of waiting threads.
*/
_Chain_Initialize (
2010ba0: 90 06 20 68 add %i0, 0x68, %o0
2010ba4: 94 10 00 1a mov %i2, %o2
2010ba8: 40 00 17 e9 call 2016b4c <_Chain_Initialize>
2010bac: 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(
2010bb0: 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 );
2010bb4: 82 06 20 50 add %i0, 0x50, %g1
2010bb8: 84 18 a0 01 xor %g2, 1, %g2
2010bbc: 80 a0 00 02 cmp %g0, %g2
2010bc0: 84 06 20 54 add %i0, 0x54, %g2
head->next = tail;
head->previous = NULL;
tail->previous = head;
2010bc4: 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;
2010bc8: c4 26 20 50 st %g2, [ %i0 + 0x50 ]
2010bcc: 90 10 00 18 mov %i0, %o0
head->previous = NULL;
2010bd0: c0 26 20 54 clr [ %i0 + 0x54 ]
2010bd4: 92 60 3f ff subx %g0, -1, %o1
2010bd8: 94 10 20 80 mov 0x80, %o2
2010bdc: 96 10 20 06 mov 6, %o3
2010be0: 40 00 0a 80 call 20135e0 <_Thread_queue_Initialize>
2010be4: ba 10 20 01 mov 1, %i5
STATES_WAITING_FOR_MESSAGE,
CORE_MESSAGE_QUEUE_STATUS_TIMEOUT
);
return true;
}
2010be8: b0 0f 60 01 and %i5, 1, %i0
2010bec: 81 c7 e0 08 ret
2010bf0: 81 e8 00 00 restore
020075dc <_CORE_mutex_Seize>:
Objects_Id _id,
bool _wait,
Watchdog_Interval _timeout,
ISR_Level _level
)
{
20075dc: 9d e3 bf a0 save %sp, -96, %sp
* This routine returns true if thread dispatch indicates
* that we are in a critical section.
*/
RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void)
{
if ( _Thread_Dispatch_disable_level == 0 )
20075e0: 3b 00 80 76 sethi %hi(0x201d800), %i5
20075e4: c2 07 61 90 ld [ %i5 + 0x190 ], %g1 ! 201d990 <_Thread_Dispatch_disable_level>
20075e8: 80 a0 60 00 cmp %g1, 0
20075ec: 02 80 00 05 be 2007600 <_CORE_mutex_Seize+0x24>
20075f0: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
_CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level );
20075f4: 80 a6 a0 00 cmp %i2, 0
20075f8: 12 80 00 1b bne 2007664 <_CORE_mutex_Seize+0x88> <== ALWAYS TAKEN
20075fc: 03 00 80 76 sethi %hi(0x201d800), %g1
2007600: 90 10 00 18 mov %i0, %o0
2007604: 40 00 17 16 call 200d25c <_CORE_mutex_Seize_interrupt_trylock>
2007608: 92 07 a0 54 add %fp, 0x54, %o1
200760c: 80 a2 20 00 cmp %o0, 0
2007610: 02 80 00 13 be 200765c <_CORE_mutex_Seize+0x80>
2007614: 80 a6 a0 00 cmp %i2, 0
2007618: 02 80 00 1b be 2007684 <_CORE_mutex_Seize+0xa8>
200761c: 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++;
2007620: c4 07 61 90 ld [ %i5 + 0x190 ], %g2
2007624: 03 00 80 77 sethi %hi(0x201dc00), %g1
2007628: c2 00 62 d4 ld [ %g1 + 0x2d4 ], %g1 ! 201ded4 <_Per_CPU_Information+0xc>
RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section (
Thread_queue_Control *the_thread_queue
)
{
the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED;
200762c: 86 10 20 01 mov 1, %g3
2007630: c6 26 20 30 st %g3, [ %i0 + 0x30 ]
2007634: f0 20 60 44 st %i0, [ %g1 + 0x44 ]
2007638: f2 20 60 20 st %i1, [ %g1 + 0x20 ]
200763c: 82 00 a0 01 add %g2, 1, %g1
2007640: c2 27 61 90 st %g1, [ %i5 + 0x190 ]
return _Thread_Dispatch_disable_level;
2007644: c2 07 61 90 ld [ %i5 + 0x190 ], %g1
2007648: 7f ff ea f1 call 200220c <sparc_enable_interrupts>
200764c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
2007650: 90 10 00 18 mov %i0, %o0
2007654: 7f ff ff c0 call 2007554 <_CORE_mutex_Seize_interrupt_blocking>
2007658: 92 10 00 1b mov %i3, %o1
200765c: 81 c7 e0 08 ret
2007660: 81 e8 00 00 restore
2007664: c2 00 62 e4 ld [ %g1 + 0x2e4 ], %g1
2007668: 80 a0 60 01 cmp %g1, 1
200766c: 28 bf ff e6 bleu,a 2007604 <_CORE_mutex_Seize+0x28>
2007670: 90 10 00 18 mov %i0, %o0
2007674: 90 10 20 00 clr %o0
2007678: 92 10 20 00 clr %o1
200767c: 40 00 01 dc call 2007dec <_Internal_error_Occurred>
2007680: 94 10 20 12 mov 0x12, %o2
2007684: 7f ff ea e2 call 200220c <sparc_enable_interrupts>
2007688: d0 07 a0 54 ld [ %fp + 0x54 ], %o0
200768c: 03 00 80 77 sethi %hi(0x201dc00), %g1
2007690: c2 00 62 d4 ld [ %g1 + 0x2d4 ], %g1 ! 201ded4 <_Per_CPU_Information+0xc>
2007694: 84 10 20 01 mov 1, %g2
2007698: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
200769c: 81 c7 e0 08 ret
20076a0: 81 e8 00 00 restore
02007818 <_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
)
{
2007818: 9d e3 bf a0 save %sp, -96, %sp
200781c: ba 10 00 18 mov %i0, %i5
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007820: b0 10 20 00 clr %i0
if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) {
2007824: 40 00 07 c4 call 2009734 <_Thread_queue_Dequeue>
2007828: 90 10 00 1d mov %i5, %o0
200782c: 80 a2 20 00 cmp %o0, 0
2007830: 02 80 00 04 be 2007840 <_CORE_semaphore_Surrender+0x28>
2007834: 01 00 00 00 nop
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
}
return status;
}
2007838: 81 c7 e0 08 ret
200783c: 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 );
2007840: 7f ff ea 6f call 20021fc <sparc_disable_interrupts>
2007844: 01 00 00 00 nop
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
2007848: c2 07 60 48 ld [ %i5 + 0x48 ], %g1
200784c: c4 07 60 40 ld [ %i5 + 0x40 ], %g2
2007850: 80 a0 40 02 cmp %g1, %g2
2007854: 1a 80 00 05 bcc 2007868 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN
2007858: b0 10 20 04 mov 4, %i0
the_semaphore->count += 1;
200785c: 82 00 60 01 inc %g1
{
Thread_Control *the_thread;
ISR_Level level;
CORE_semaphore_Status status;
status = CORE_SEMAPHORE_STATUS_SUCCESSFUL;
2007860: b0 10 20 00 clr %i0
#endif
} else {
_ISR_Disable( level );
if ( the_semaphore->count < the_semaphore->Attributes.maximum_count )
the_semaphore->count += 1;
2007864: c2 27 60 48 st %g1, [ %i5 + 0x48 ]
else
status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED;
_ISR_Enable( level );
2007868: 7f ff ea 69 call 200220c <sparc_enable_interrupts>
200786c: 01 00 00 00 nop
}
return status;
}
2007870: 81 c7 e0 08 ret
2007874: 81 e8 00 00 restore
0200d1f4 <_Chain_Initialize>:
Chain_Control *the_chain,
void *starting_address,
size_t number_nodes,
size_t node_size
)
{
200d1f4: 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;
200d1f8: 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 );
200d1fc: ba 06 20 04 add %i0, 4, %i5
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d200: 80 a6 a0 00 cmp %i2, 0
200d204: 02 80 00 12 be 200d24c <_Chain_Initialize+0x58> <== NEVER TAKEN
200d208: 90 10 00 18 mov %i0, %o0
200d20c: 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;
200d210: 82 10 00 19 mov %i1, %g1
head->previous = NULL;
while ( count-- ) {
200d214: 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;
200d218: 10 80 00 05 b 200d22c <_Chain_Initialize+0x38>
200d21c: 84 10 00 18 mov %i0, %g2
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d220: 84 10 00 01 mov %g1, %g2
200d224: b4 06 bf ff add %i2, -1, %i2
current->next = next;
next->previous = current;
current = next;
next = (Chain_Node *)
200d228: 82 10 00 03 mov %g3, %g1
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
current->next = next;
200d22c: c2 20 80 00 st %g1, [ %g2 ]
next->previous = current;
200d230: c4 20 60 04 st %g2, [ %g1 + 4 ]
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d234: 80 a6 a0 00 cmp %i2, 0
200d238: 12 bf ff fa bne 200d220 <_Chain_Initialize+0x2c>
200d23c: 86 00 40 1b add %g1, %i3, %g3
* node_size - size of node in bytes
*
* Output parameters: NONE
*/
void _Chain_Initialize(
200d240: 40 00 2d 0b call 201866c <.umul>
200d244: 90 10 00 1b mov %i3, %o0
Chain_Node *current = head;
Chain_Node *next = starting_address;
head->previous = NULL;
while ( count-- ) {
200d248: 90 06 40 08 add %i1, %o0, %o0
current = next;
next = (Chain_Node *)
_Addresses_Add_offset( (void *) next, node_size );
}
current->next = tail;
200d24c: fa 22 00 00 st %i5, [ %o0 ]
tail->previous = current;
200d250: d0 26 20 08 st %o0, [ %i0 + 8 ]
}
200d254: 81 c7 e0 08 ret
200d258: 81 e8 00 00 restore
020064b8 <_Event_Surrender>:
*/
void _Event_Surrender(
Thread_Control *the_thread
)
{
20064b8: 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 ];
20064bc: fa 06 21 58 ld [ %i0 + 0x158 ], %i5
option_set = (rtems_option) the_thread->Wait.option;
_ISR_Disable( level );
20064c0: 7f ff ef 4f call 20021fc <sparc_disable_interrupts>
20064c4: f8 06 20 30 ld [ %i0 + 0x30 ], %i4
pending_events = api->pending_events;
20064c8: c4 07 40 00 ld [ %i5 ], %g2
event_condition = (rtems_event_set) the_thread->Wait.count;
20064cc: 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 ) ) {
20064d0: 86 88 40 02 andcc %g1, %g2, %g3
20064d4: 02 80 00 39 be 20065b8 <_Event_Surrender+0x100>
20064d8: 09 00 80 77 sethi %hi(0x201dc00), %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() &&
20064dc: 88 11 22 c8 or %g4, 0x2c8, %g4 ! 201dec8 <_Per_CPU_Information>
20064e0: f2 01 20 08 ld [ %g4 + 8 ], %i1
20064e4: 80 a6 60 00 cmp %i1, 0
20064e8: 32 80 00 1c bne,a 2006558 <_Event_Surrender+0xa0>
20064ec: 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);
20064f0: 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 ) ) {
20064f4: 80 89 21 00 btst 0x100, %g4
20064f8: 02 80 00 30 be 20065b8 <_Event_Surrender+0x100>
20064fc: 80 a0 40 03 cmp %g1, %g3
if ( seized_events == event_condition || _Options_Is_any( option_set ) ) {
2006500: 02 80 00 04 be 2006510 <_Event_Surrender+0x58>
2006504: 80 8f 20 02 btst 2, %i4
2006508: 02 80 00 2c be 20065b8 <_Event_Surrender+0x100> <== NEVER TAKEN
200650c: 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;
2006510: 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) );
2006514: 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 );
2006518: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
200651c: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
2006520: c6 20 40 00 st %g3, [ %g1 ]
_ISR_Flash( level );
2006524: 7f ff ef 3a call 200220c <sparc_enable_interrupts>
2006528: 01 00 00 00 nop
200652c: 7f ff ef 34 call 20021fc <sparc_disable_interrupts>
2006530: 01 00 00 00 nop
if ( !_Watchdog_Is_active( &the_thread->Timer ) ) {
2006534: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
2006538: 80 a0 60 02 cmp %g1, 2
200653c: 02 80 00 21 be 20065c0 <_Event_Surrender+0x108>
2006540: 82 10 20 03 mov 3, %g1
_ISR_Enable( level );
2006544: 7f ff ef 32 call 200220c <sparc_enable_interrupts>
2006548: 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 );
200654c: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 <RAM_END+0xdc3fff8>
2006550: 40 00 0a a4 call 2008fe0 <_Thread_Clear_state>
2006554: 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() &&
2006558: 80 a6 00 04 cmp %i0, %g4
200655c: 32 bf ff e6 bne,a 20064f4 <_Event_Surrender+0x3c>
2006560: c8 06 20 10 ld [ %i0 + 0x10 ], %g4
_Thread_Is_executing( the_thread ) &&
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
2006564: 09 00 80 78 sethi %hi(0x201e000), %g4
2006568: f2 01 22 c0 ld [ %g4 + 0x2c0 ], %i1 ! 201e2c0 <_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 ) &&
200656c: 80 a6 60 02 cmp %i1, 2
2006570: 02 80 00 07 be 200658c <_Event_Surrender+0xd4> <== NEVER TAKEN
2006574: 80 a0 40 03 cmp %g1, %g3
((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) ||
(_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) {
2006578: f2 01 22 c0 ld [ %g4 + 0x2c0 ], %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) ||
200657c: 80 a6 60 01 cmp %i1, 1
2006580: 32 bf ff dd bne,a 20064f4 <_Event_Surrender+0x3c>
2006584: 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) ) {
2006588: 80 a0 40 03 cmp %g1, %g3
200658c: 02 80 00 04 be 200659c <_Event_Surrender+0xe4>
2006590: 80 8f 20 02 btst 2, %i4
2006594: 02 80 00 09 be 20065b8 <_Event_Surrender+0x100> <== NEVER TAKEN
2006598: 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;
200659c: c2 06 20 28 ld [ %i0 + 0x28 ], %g1
20065a0: 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 );
20065a4: c4 27 40 00 st %g2, [ %i5 ]
the_thread->Wait.count = 0;
20065a8: c0 26 20 24 clr [ %i0 + 0x24 ]
*(rtems_event_set *)the_thread->Wait.return_argument = seized_events;
20065ac: c6 20 40 00 st %g3, [ %g1 ]
_Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED;
20065b0: 82 10 20 03 mov 3, %g1
20065b4: c2 21 22 c0 st %g1, [ %g4 + 0x2c0 ]
_Thread_Unblock( the_thread );
}
return;
}
}
_ISR_Enable( level );
20065b8: 7f ff ef 15 call 200220c <sparc_enable_interrupts>
20065bc: 91 e8 00 08 restore %g0, %o0, %o0
RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_REMOVE_IT;
20065c0: 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 );
20065c4: 7f ff ef 12 call 200220c <sparc_enable_interrupts>
20065c8: 33 04 00 ff sethi %hi(0x1003fc00), %i1
(void) _Watchdog_Remove( &the_thread->Timer );
20065cc: 40 00 0f 97 call 200a428 <_Watchdog_Remove>
20065d0: 90 06 20 48 add %i0, 0x48, %o0
20065d4: b2 16 63 f8 or %i1, 0x3f8, %i1
20065d8: 40 00 0a 82 call 2008fe0 <_Thread_Clear_state>
20065dc: 81 e8 00 00 restore
020065e0 <_Event_Timeout>:
void _Event_Timeout(
Objects_Id id,
void *ignored
)
{
20065e0: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
ISR_Level level;
the_thread = _Thread_Get( id, &location );
20065e4: 90 10 00 18 mov %i0, %o0
20065e8: 40 00 0b 7c call 20093d8 <_Thread_Get>
20065ec: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20065f0: c2 07 bf fc ld [ %fp + -4 ], %g1
20065f4: 80 a0 60 00 cmp %g1, 0
20065f8: 12 80 00 16 bne 2006650 <_Event_Timeout+0x70> <== NEVER TAKEN
20065fc: 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 );
2006600: 7f ff ee ff call 20021fc <sparc_disable_interrupts>
2006604: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE bool _Thread_Is_executing (
const Thread_Control *the_thread
)
{
return ( the_thread == _Thread_Executing );
2006608: 03 00 80 77 sethi %hi(0x201dc00), %g1
return;
}
#endif
the_thread->Wait.count = 0;
if ( _Thread_Is_executing( the_thread ) ) {
200660c: c2 00 62 d4 ld [ %g1 + 0x2d4 ], %g1 ! 201ded4 <_Per_CPU_Information+0xc>
2006610: 80 a7 40 01 cmp %i5, %g1
2006614: 02 80 00 11 be 2006658 <_Event_Timeout+0x78>
2006618: 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;
200661c: 82 10 20 06 mov 6, %g1
2006620: c2 27 60 34 st %g1, [ %i5 + 0x34 ]
_ISR_Enable( level );
2006624: 7f ff ee fa call 200220c <sparc_enable_interrupts>
2006628: 01 00 00 00 nop
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
200662c: 90 10 00 1d mov %i5, %o0
2006630: 13 04 00 ff sethi %hi(0x1003fc00), %o1
2006634: 40 00 0a 6b call 2008fe0 <_Thread_Clear_state>
2006638: 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--;
200663c: 03 00 80 76 sethi %hi(0x201d800), %g1
2006640: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 201d990 <_Thread_Dispatch_disable_level>
2006644: 84 00 bf ff add %g2, -1, %g2
2006648: c4 20 61 90 st %g2, [ %g1 + 0x190 ]
return _Thread_Dispatch_disable_level;
200664c: c2 00 61 90 ld [ %g1 + 0x190 ], %g1
2006650: 81 c7 e0 08 ret
2006654: 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 )
2006658: 03 00 80 78 sethi %hi(0x201e000), %g1
200665c: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201e2c0 <_Event_Sync_state>
2006660: 80 a0 a0 01 cmp %g2, 1
2006664: 32 bf ff ef bne,a 2006620 <_Event_Timeout+0x40>
2006668: 82 10 20 06 mov 6, %g1
_Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT;
200666c: 84 10 20 02 mov 2, %g2
2006670: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ]
}
the_thread->Wait.return_code = RTEMS_TIMEOUT;
2006674: 10 bf ff eb b 2006620 <_Event_Timeout+0x40>
2006678: 82 10 20 06 mov 6, %g1
0200d42c <_Heap_Allocate_aligned_with_boundary>:
Heap_Control *heap,
uintptr_t alloc_size,
uintptr_t alignment,
uintptr_t boundary
)
{
200d42c: 9d e3 bf 98 save %sp, -104, %sp
200d430: 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
200d434: a0 06 60 04 add %i1, 4, %l0
- HEAP_ALLOC_BONUS;
uintptr_t const page_size = heap->page_size;
200d438: 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 ) {
200d43c: 80 a6 40 10 cmp %i1, %l0
200d440: 18 80 00 23 bgu 200d4cc <_Heap_Allocate_aligned_with_boundary+0xa0>
200d444: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
200d448: 80 a6 e0 00 cmp %i3, 0
200d44c: 12 80 00 7d bne 200d640 <_Heap_Allocate_aligned_with_boundary+0x214>
200d450: 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;
200d454: 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 ) {
200d458: 80 a7 40 11 cmp %i5, %l1
200d45c: 02 80 00 18 be 200d4bc <_Heap_Allocate_aligned_with_boundary+0x90>
200d460: 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
200d464: 82 05 a0 07 add %l6, 7, %g1
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200d468: 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
200d46c: c2 27 bf fc st %g1, [ %fp + -4 ]
+ HEAP_BLOCK_HEADER_SIZE + page_size - 1;
uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS;
200d470: 10 80 00 0b b 200d49c <_Heap_Allocate_aligned_with_boundary+0x70>
200d474: 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 ) {
200d478: 12 80 00 17 bne 200d4d4 <_Heap_Allocate_aligned_with_boundary+0xa8>
200d47c: b0 04 60 08 add %l1, 8, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d480: 80 a6 20 00 cmp %i0, 0
200d484: 12 80 00 5b bne 200d5f0 <_Heap_Allocate_aligned_with_boundary+0x1c4>
200d488: b8 07 20 01 inc %i4
break;
}
block = block->next;
200d48c: 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 ) {
200d490: 80 a7 40 11 cmp %i5, %l1
200d494: 22 80 00 0b be,a 200d4c0 <_Heap_Allocate_aligned_with_boundary+0x94>
200d498: 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 ) {
200d49c: e4 04 60 04 ld [ %l1 + 4 ], %l2
200d4a0: 80 a4 00 12 cmp %l0, %l2
200d4a4: 0a bf ff f5 bcs 200d478 <_Heap_Allocate_aligned_with_boundary+0x4c>
200d4a8: 80 a6 a0 00 cmp %i2, 0
if ( alloc_begin != 0 ) {
break;
}
block = block->next;
200d4ac: 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 ) {
200d4b0: 80 a7 40 11 cmp %i5, %l1
200d4b4: 12 bf ff fa bne 200d49c <_Heap_Allocate_aligned_with_boundary+0x70>
200d4b8: b8 07 20 01 inc %i4
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d4bc: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200d4c0: 80 a0 40 1c cmp %g1, %i4
200d4c4: 0a 80 00 5a bcs 200d62c <_Heap_Allocate_aligned_with_boundary+0x200>
200d4c8: b0 10 20 00 clr %i0
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200d4cc: 81 c7 e0 08 ret
200d4d0: 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;
200d4d4: c4 07 bf fc ld [ %fp + -4 ], %g2
if ( stats->max_search < search_count ) {
stats->max_search = search_count;
}
return (void *) alloc_begin;
}
200d4d8: 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;
200d4dc: 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;
200d4e0: 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;
200d4e4: 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);
200d4e8: 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;
200d4ec: 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
200d4f0: a4 00 40 12 add %g1, %l2, %l2
200d4f4: 40 00 2d 44 call 2018a04 <.urem>
200d4f8: 90 10 00 18 mov %i0, %o0
200d4fc: 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 ) {
200d500: 80 a4 80 18 cmp %l2, %i0
200d504: 1a 80 00 06 bcc 200d51c <_Heap_Allocate_aligned_with_boundary+0xf0>
200d508: a8 04 60 08 add %l1, 8, %l4
200d50c: 90 10 00 12 mov %l2, %o0
200d510: 40 00 2d 3d call 2018a04 <.urem>
200d514: 92 10 00 1a mov %i2, %o1
200d518: b0 24 80 08 sub %l2, %o0, %i0
}
alloc_end = alloc_begin + alloc_size;
/* Ensure boundary constaint */
if ( boundary != 0 ) {
200d51c: 80 a6 e0 00 cmp %i3, 0
200d520: 02 80 00 24 be 200d5b0 <_Heap_Allocate_aligned_with_boundary+0x184>
200d524: 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;
200d528: a4 06 00 19 add %i0, %i1, %l2
200d52c: 92 10 00 1b mov %i3, %o1
200d530: 40 00 2d 35 call 2018a04 <.urem>
200d534: 90 10 00 12 mov %l2, %o0
200d538: 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 ) {
200d53c: 80 a6 00 08 cmp %i0, %o0
200d540: 1a 80 00 1b bcc 200d5ac <_Heap_Allocate_aligned_with_boundary+0x180>
200d544: 80 a2 00 12 cmp %o0, %l2
200d548: 1a 80 00 1a bcc 200d5b0 <_Heap_Allocate_aligned_with_boundary+0x184>
200d54c: 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;
200d550: 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 ) {
200d554: 80 a4 c0 08 cmp %l3, %o0
200d558: 08 80 00 08 bleu 200d578 <_Heap_Allocate_aligned_with_boundary+0x14c>
200d55c: b0 10 20 00 clr %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d560: 10 bf ff c9 b 200d484 <_Heap_Allocate_aligned_with_boundary+0x58>
200d564: 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 ) {
200d568: 1a 80 00 11 bcc 200d5ac <_Heap_Allocate_aligned_with_boundary+0x180>
200d56c: 80 a4 c0 08 cmp %l3, %o0
if ( boundary_line < boundary_floor ) {
200d570: 18 bf ff c4 bgu 200d480 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN
200d574: b0 10 20 00 clr %i0
return 0;
}
alloc_begin = boundary_line - alloc_size;
200d578: b0 22 00 19 sub %o0, %i1, %i0
200d57c: 92 10 00 1a mov %i2, %o1
200d580: 40 00 2d 21 call 2018a04 <.urem>
200d584: 90 10 00 18 mov %i0, %o0
200d588: 92 10 00 1b mov %i3, %o1
200d58c: b0 26 00 08 sub %i0, %o0, %i0
alloc_begin = _Heap_Align_down( alloc_begin, alignment );
alloc_end = alloc_begin + alloc_size;
200d590: a4 06 00 19 add %i0, %i1, %l2
200d594: 40 00 2d 1c call 2018a04 <.urem>
200d598: 90 10 00 12 mov %l2, %o0
200d59c: 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 ) {
200d5a0: 80 a2 00 12 cmp %o0, %l2
200d5a4: 0a bf ff f1 bcs 200d568 <_Heap_Allocate_aligned_with_boundary+0x13c>
200d5a8: 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 ) {
200d5ac: 80 a5 00 18 cmp %l4, %i0
200d5b0: 18 80 00 22 bgu 200d638 <_Heap_Allocate_aligned_with_boundary+0x20c>
200d5b4: 82 10 3f f8 mov -8, %g1
200d5b8: 90 10 00 18 mov %i0, %o0
200d5bc: a4 20 40 11 sub %g1, %l1, %l2
200d5c0: 92 10 00 16 mov %l6, %o1
200d5c4: 40 00 2d 10 call 2018a04 <.urem>
200d5c8: 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 ) {
200d5cc: 90 a4 80 08 subcc %l2, %o0, %o0
200d5d0: 02 bf ff ad be 200d484 <_Heap_Allocate_aligned_with_boundary+0x58>
200d5d4: 80 a6 20 00 cmp %i0, 0
200d5d8: 80 a2 00 15 cmp %o0, %l5
return alloc_begin;
}
}
return 0;
200d5dc: 82 40 3f ff addx %g0, -1, %g1
200d5e0: b0 0e 00 01 and %i0, %g1, %i0
}
/* Statistics */
++search_count;
if ( alloc_begin != 0 ) {
200d5e4: 80 a6 20 00 cmp %i0, 0
200d5e8: 02 bf ff a9 be 200d48c <_Heap_Allocate_aligned_with_boundary+0x60>
200d5ec: 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;
200d5f0: c4 07 60 48 ld [ %i5 + 0x48 ], %g2
stats->searches += search_count;
200d5f4: 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;
200d5f8: 84 00 a0 01 inc %g2
stats->searches += search_count;
200d5fc: 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;
200d600: c4 27 60 48 st %g2, [ %i5 + 0x48 ]
stats->searches += search_count;
200d604: c2 27 60 4c st %g1, [ %i5 + 0x4c ]
block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size );
200d608: 90 10 00 1d mov %i5, %o0
200d60c: 92 10 00 11 mov %l1, %o1
200d610: 94 10 00 18 mov %i0, %o2
200d614: 7f ff e9 a6 call 2007cac <_Heap_Block_allocate>
200d618: 96 10 00 19 mov %i1, %o3
boundary
);
}
/* Statistics */
if ( stats->max_search < search_count ) {
200d61c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1
200d620: 80 a0 40 1c cmp %g1, %i4
200d624: 1a 80 00 03 bcc 200d630 <_Heap_Allocate_aligned_with_boundary+0x204>
200d628: 01 00 00 00 nop
stats->max_search = search_count;
200d62c: f8 27 60 44 st %i4, [ %i5 + 0x44 ]
}
return (void *) alloc_begin;
}
200d630: 81 c7 e0 08 ret
200d634: 81 e8 00 00 restore
if ( free_size >= min_block_size || free_size == 0 ) {
return alloc_begin;
}
}
return 0;
200d638: 10 bf ff 92 b 200d480 <_Heap_Allocate_aligned_with_boundary+0x54>
200d63c: b0 10 20 00 clr %i0
/* Integer overflow occured */
return NULL;
}
if ( boundary != 0 ) {
if ( boundary < alloc_size ) {
200d640: 18 bf ff a3 bgu 200d4cc <_Heap_Allocate_aligned_with_boundary+0xa0>
200d644: 80 a6 a0 00 cmp %i2, 0
return NULL;
}
if ( alignment == 0 ) {
200d648: 22 bf ff 83 be,a 200d454 <_Heap_Allocate_aligned_with_boundary+0x28>
200d64c: 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;
200d650: 10 bf ff 82 b 200d458 <_Heap_Allocate_aligned_with_boundary+0x2c>
200d654: e2 07 60 08 ld [ %i5 + 8 ], %l1
0200d438 <_Heap_Extend>:
Heap_Control *heap,
void *extend_area_begin_ptr,
uintptr_t extend_area_size,
uintptr_t *extended_size_ptr
)
{
200d438: 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;
200d43c: c0 27 bf f8 clr [ %fp + -8 ]
Heap_Block *extend_last_block = NULL;
200d440: 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;
200d444: 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;
200d448: 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;
200d44c: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
200d450: 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;
200d454: 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 ) {
200d458: 80 a6 40 1d cmp %i1, %i5
200d45c: 08 80 00 05 bleu 200d470 <_Heap_Extend+0x38>
200d460: a2 10 20 00 clr %l1
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d464: b0 0c 60 01 and %l1, 1, %i0
200d468: 81 c7 e0 08 ret
200d46c: 81 e8 00 00 restore
if ( extend_area_end < extend_area_begin ) {
return false;
}
extend_area_ok = _Heap_Get_first_and_last_block(
200d470: 90 10 00 19 mov %i1, %o0
200d474: 92 10 00 1a mov %i2, %o1
200d478: 94 10 00 10 mov %l0, %o2
200d47c: 98 07 bf f8 add %fp, -8, %o4
200d480: 7f ff e9 53 call 20079cc <_Heap_Get_first_and_last_block>
200d484: 9a 07 bf fc add %fp, -4, %o5
page_size,
min_block_size,
&extend_first_block,
&extend_last_block
);
if (!extend_area_ok ) {
200d488: 80 8a 20 ff btst 0xff, %o0
200d48c: 02 bf ff f6 be 200d464 <_Heap_Extend+0x2c>
200d490: aa 10 20 00 clr %l5
200d494: a2 10 00 1c mov %i4, %l1
200d498: ac 10 20 00 clr %l6
200d49c: a6 10 20 00 clr %l3
200d4a0: 10 80 00 14 b 200d4f0 <_Heap_Extend+0xb8>
200d4a4: 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 ) {
200d4a8: 2a 80 00 02 bcs,a 200d4b0 <_Heap_Extend+0x78>
200d4ac: 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);
200d4b0: 90 10 00 1a mov %i2, %o0
200d4b4: 40 00 17 fc call 20134a4 <.urem>
200d4b8: 92 10 00 10 mov %l0, %o1
200d4bc: 82 06 bf f8 add %i2, -8, %g1
link_below_block = start_block;
}
if ( sub_area_end == extend_area_begin ) {
200d4c0: 80 a6 80 19 cmp %i2, %i1
200d4c4: 02 80 00 1c be 200d534 <_Heap_Extend+0xfc>
200d4c8: 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 ) {
200d4cc: 80 a6 40 1a cmp %i1, %i2
200d4d0: 38 80 00 02 bgu,a 200d4d8 <_Heap_Extend+0xa0>
200d4d4: 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;
200d4d8: e2 00 60 04 ld [ %g1 + 4 ], %l1
200d4dc: 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);
200d4e0: 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 );
200d4e4: 80 a7 00 11 cmp %i4, %l1
200d4e8: 22 80 00 1b be,a 200d554 <_Heap_Extend+0x11c>
200d4ec: 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;
200d4f0: 80 a4 40 1c cmp %l1, %i4
200d4f4: 02 80 00 66 be 200d68c <_Heap_Extend+0x254>
200d4f8: 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 (
200d4fc: 80 a0 40 1d cmp %g1, %i5
200d500: 0a 80 00 70 bcs 200d6c0 <_Heap_Extend+0x288>
200d504: 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 ) {
200d508: 80 a0 40 1d cmp %g1, %i5
200d50c: 12 bf ff e7 bne 200d4a8 <_Heap_Extend+0x70>
200d510: 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);
200d514: 90 10 00 1a mov %i2, %o0
200d518: 40 00 17 e3 call 20134a4 <.urem>
200d51c: 92 10 00 10 mov %l0, %o1
200d520: 82 06 bf f8 add %i2, -8, %g1
200d524: 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 ) {
200d528: 80 a6 80 19 cmp %i2, %i1
200d52c: 12 bf ff e8 bne 200d4cc <_Heap_Extend+0x94> <== ALWAYS TAKEN
200d530: 82 20 40 08 sub %g1, %o0, %g1
start_block->prev_size = extend_area_end;
200d534: 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;
200d538: e2 00 60 04 ld [ %g1 + 4 ], %l1
200d53c: 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);
200d540: 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 );
200d544: 80 a7 00 11 cmp %i4, %l1
200d548: 12 bf ff ea bne 200d4f0 <_Heap_Extend+0xb8> <== NEVER TAKEN
200d54c: a6 10 00 01 mov %g1, %l3
if ( extend_area_begin < heap->area_begin ) {
200d550: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200d554: 80 a6 40 01 cmp %i1, %g1
200d558: 3a 80 00 55 bcc,a 200d6ac <_Heap_Extend+0x274>
200d55c: c2 06 20 1c ld [ %i0 + 0x1c ], %g1
heap->area_begin = extend_area_begin;
200d560: 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;
200d564: c2 07 bf f8 ld [ %fp + -8 ], %g1
200d568: 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 ) {
200d56c: 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 =
200d570: 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;
200d574: fa 20 40 00 st %i5, [ %g1 ]
extend_first_block->size_and_flag =
extend_first_block_size | HEAP_PREV_BLOCK_USED;
200d578: 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 =
200d57c: 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;
200d580: 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 ) {
200d584: 80 a1 00 01 cmp %g4, %g1
200d588: 08 80 00 43 bleu 200d694 <_Heap_Extend+0x25c>
200d58c: c0 20 a0 04 clr [ %g2 + 4 ]
heap->first_block = extend_first_block;
200d590: 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 ) {
200d594: 80 a5 20 00 cmp %l4, 0
200d598: 02 80 00 63 be 200d724 <_Heap_Extend+0x2ec>
200d59c: 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;
200d5a0: 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;
200d5a4: 92 10 00 1c mov %i4, %o1
200d5a8: 40 00 17 bf call 20134a4 <.urem>
200d5ac: 90 10 00 19 mov %i1, %o0
if ( remainder != 0 ) {
200d5b0: 80 a2 20 00 cmp %o0, 0
200d5b4: 02 80 00 04 be 200d5c4 <_Heap_Extend+0x18c>
200d5b8: c4 05 00 00 ld [ %l4 ], %g2
return value - remainder + alignment;
200d5bc: b2 06 40 1c add %i1, %i4, %i1
200d5c0: 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 =
200d5c4: 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;
200d5c8: 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 =
200d5cc: 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;
200d5d0: 84 10 a0 01 or %g2, 1, %g2
_Heap_Free_block( heap, new_first_block );
200d5d4: 90 10 00 18 mov %i0, %o0
200d5d8: 92 10 00 01 mov %g1, %o1
200d5dc: 7f ff ff 8d call 200d410 <_Heap_Free_block>
200d5e0: c4 26 7f fc st %g2, [ %i1 + -4 ]
link_below_block,
extend_last_block
);
}
if ( merge_above_block != NULL ) {
200d5e4: 80 a4 e0 00 cmp %l3, 0
200d5e8: 02 80 00 3b be 200d6d4 <_Heap_Extend+0x29c>
200d5ec: 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);
200d5f0: 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(
200d5f4: ba 27 40 13 sub %i5, %l3, %i5
200d5f8: 40 00 17 ab call 20134a4 <.urem>
200d5fc: 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)
200d600: c2 04 e0 04 ld [ %l3 + 4 ], %g1
200d604: ba 27 40 08 sub %i5, %o0, %i5
200d608: 82 20 40 1d sub %g1, %i5, %g1
| HEAP_PREV_BLOCK_USED;
200d60c: 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 =
200d610: 84 07 40 13 add %i5, %l3, %g2
200d614: 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;
200d618: 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 );
200d61c: 90 10 00 18 mov %i0, %o0
200d620: 82 08 60 01 and %g1, 1, %g1
200d624: 92 10 00 13 mov %l3, %o1
block->size_and_flag = size | flag;
200d628: ba 17 40 01 or %i5, %g1, %i5
200d62c: 7f ff ff 79 call 200d410 <_Heap_Free_block>
200d630: fa 24 e0 04 st %i5, [ %l3 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200d634: 80 a4 e0 00 cmp %l3, 0
200d638: 02 80 00 34 be 200d708 <_Heap_Extend+0x2d0>
200d63c: 80 a5 20 00 cmp %l4, 0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d640: 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(
200d644: 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;
200d648: 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(
200d64c: 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;
200d650: 84 08 a0 01 and %g2, 1, %g2
block->size_and_flag = size | flag;
200d654: 84 10 80 03 or %g2, %g3, %g2
200d658: 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;
200d65c: 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;
200d660: c4 06 20 30 ld [ %i0 + 0x30 ], %g2
stats->size += extended_size;
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
200d664: 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;
200d668: a4 20 80 12 sub %g2, %l2, %l2
/* Statistics */
stats->size += extended_size;
200d66c: 82 00 40 12 add %g1, %l2, %g1
if ( extended_size_ptr != NULL )
200d670: 80 a6 e0 00 cmp %i3, 0
200d674: 02 bf ff 7c be 200d464 <_Heap_Extend+0x2c> <== NEVER TAKEN
200d678: c2 26 20 2c st %g1, [ %i0 + 0x2c ]
*extended_size_ptr = extended_size;
200d67c: e4 26 c0 00 st %l2, [ %i3 ]
return true;
}
200d680: b0 0c 60 01 and %l1, 1, %i0
200d684: 81 c7 e0 08 ret
200d688: 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;
200d68c: 10 bf ff 9c b 200d4fc <_Heap_Extend+0xc4>
200d690: 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 ) {
200d694: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
200d698: 80 a0 40 02 cmp %g1, %g2
200d69c: 2a bf ff be bcs,a 200d594 <_Heap_Extend+0x15c>
200d6a0: c4 26 20 24 st %g2, [ %i0 + 0x24 ]
heap->last_block = extend_last_block;
}
if ( merge_below_block != NULL ) {
200d6a4: 10 bf ff bd b 200d598 <_Heap_Extend+0x160>
200d6a8: 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 ) {
200d6ac: 80 a7 40 01 cmp %i5, %g1
200d6b0: 38 bf ff ad bgu,a 200d564 <_Heap_Extend+0x12c>
200d6b4: 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;
200d6b8: 10 bf ff ac b 200d568 <_Heap_Extend+0x130>
200d6bc: 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 (
200d6c0: 80 a6 40 1a cmp %i1, %i2
200d6c4: 1a bf ff 92 bcc 200d50c <_Heap_Extend+0xd4>
200d6c8: 80 a0 40 1d cmp %g1, %i5
sub_area_end > extend_area_begin && extend_area_end > sub_area_begin
) {
return false;
200d6cc: 10 bf ff 66 b 200d464 <_Heap_Extend+0x2c>
200d6d0: 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 ) {
200d6d4: 80 a5 60 00 cmp %l5, 0
200d6d8: 02 bf ff d7 be 200d634 <_Heap_Extend+0x1fc>
200d6dc: 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;
200d6e0: c6 05 60 04 ld [ %l5 + 4 ], %g3
_Heap_Link_above(
200d6e4: c2 07 bf fc ld [ %fp + -4 ], %g1
200d6e8: 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 );
200d6ec: 84 20 80 15 sub %g2, %l5, %g2
block->size_and_flag = size | flag;
200d6f0: 84 10 c0 02 or %g3, %g2, %g2
200d6f4: c4 25 60 04 st %g2, [ %l5 + 4 ]
last_block->size_and_flag |= HEAP_PREV_BLOCK_USED;
200d6f8: c4 00 60 04 ld [ %g1 + 4 ], %g2
200d6fc: 84 10 a0 01 or %g2, 1, %g2
200d700: 10 bf ff cd b 200d634 <_Heap_Extend+0x1fc>
200d704: c4 20 60 04 st %g2, [ %g1 + 4 ]
extend_first_block,
extend_last_block
);
}
if ( merge_below_block == NULL && merge_above_block == NULL ) {
200d708: 32 bf ff cf bne,a 200d644 <_Heap_Extend+0x20c>
200d70c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1
_Heap_Free_block( heap, extend_first_block );
200d710: d2 07 bf f8 ld [ %fp + -8 ], %o1
200d714: 7f ff ff 3f call 200d410 <_Heap_Free_block>
200d718: 90 10 00 18 mov %i0, %o0
if ( extended_size_ptr != NULL )
*extended_size_ptr = extended_size;
return true;
}
200d71c: 10 bf ff ca b 200d644 <_Heap_Extend+0x20c>
200d720: 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 ) {
200d724: 80 a5 a0 00 cmp %l6, 0
200d728: 02 bf ff b0 be 200d5e8 <_Heap_Extend+0x1b0>
200d72c: 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;
200d730: ac 25 80 02 sub %l6, %g2, %l6
200d734: 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 =
200d738: 10 bf ff ac b 200d5e8 <_Heap_Extend+0x1b0>
200d73c: ec 20 a0 04 st %l6, [ %g2 + 4 ]
0200d658 <_Heap_Free>:
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
{
200d658: 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 ) {
200d65c: 80 a6 60 00 cmp %i1, 0
200d660: 02 80 00 56 be 200d7b8 <_Heap_Free+0x160>
200d664: 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);
200d668: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
200d66c: 40 00 2c e6 call 2018a04 <.urem>
200d670: 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
200d674: 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);
200d678: 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);
200d67c: 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;
200d680: 80 a7 40 01 cmp %i5, %g1
200d684: 0a 80 00 4d bcs 200d7b8 <_Heap_Free+0x160>
200d688: 84 10 20 00 clr %g2
200d68c: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
200d690: 80 a7 40 04 cmp %i5, %g4
200d694: 38 80 00 4a bgu,a 200d7bc <_Heap_Free+0x164> <== NEVER TAKEN
200d698: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d69c: 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;
200d6a0: 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);
200d6a4: 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;
200d6a8: 80 a0 40 03 cmp %g1, %g3
200d6ac: 38 80 00 44 bgu,a 200d7bc <_Heap_Free+0x164> <== NEVER TAKEN
200d6b0: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200d6b4: 80 a1 00 03 cmp %g4, %g3
200d6b8: 2a 80 00 41 bcs,a 200d7bc <_Heap_Free+0x164> <== NEVER TAKEN
200d6bc: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED
200d6c0: da 00 e0 04 ld [ %g3 + 4 ], %o5
return false;
}
_Heap_Protection_block_check( heap, next_block );
if ( !_Heap_Is_prev_used( next_block ) ) {
200d6c4: 80 8b 60 01 btst 1, %o5
200d6c8: 02 80 00 3c be 200d7b8 <_Heap_Free+0x160> <== NEVER TAKEN
200d6cc: 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 ));
200d6d0: 80 a1 00 03 cmp %g4, %g3
200d6d4: 02 80 00 06 be 200d6ec <_Heap_Free+0x94>
200d6d8: 9a 10 20 00 clr %o5
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d6dc: 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;
200d6e0: da 00 a0 04 ld [ %g2 + 4 ], %o5
200d6e4: 9a 0b 60 01 and %o5, 1, %o5
return do_free;
}
#endif
bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr )
200d6e8: 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 ) ) {
200d6ec: 80 8b e0 01 btst 1, %o7
200d6f0: 12 80 00 1c bne 200d760 <_Heap_Free+0x108>
200d6f4: 80 8b 60 ff btst 0xff, %o5
uintptr_t const prev_size = block->prev_size;
200d6f8: 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);
200d6fc: 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;
200d700: 80 a0 40 0f cmp %g1, %o7
200d704: 18 80 00 2d bgu 200d7b8 <_Heap_Free+0x160> <== NEVER TAKEN
200d708: 84 10 20 00 clr %g2
200d70c: 80 a1 00 0f cmp %g4, %o7
200d710: 2a 80 00 2b bcs,a 200d7bc <_Heap_Free+0x164> <== NEVER TAKEN
200d714: 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;
200d718: 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) ) {
200d71c: 80 88 60 01 btst 1, %g1
200d720: 02 80 00 26 be 200d7b8 <_Heap_Free+0x160> <== NEVER TAKEN
200d724: 80 8b 60 ff btst 0xff, %o5
_HAssert( false );
return( false );
}
if ( next_is_free ) { /* coalesce both */
200d728: 02 80 00 39 be 200d80c <_Heap_Free+0x1b4>
200d72c: 96 06 40 0b add %i1, %o3, %o3
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d730: c2 00 e0 08 ld [ %g3 + 8 ], %g1
200d734: 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;
200d738: 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;
200d73c: c2 20 a0 08 st %g1, [ %g2 + 8 ]
next->prev = prev;
200d740: c4 20 60 0c st %g2, [ %g1 + 0xc ]
200d744: 82 00 ff ff add %g3, -1, %g1
200d748: 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;
200d74c: 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;
200d750: 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;
200d754: 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;
200d758: 10 80 00 0e b 200d790 <_Heap_Free+0x138>
200d75c: 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 */
200d760: 22 80 00 19 be,a 200d7c4 <_Heap_Free+0x16c>
200d764: c4 06 20 08 ld [ %i0 + 8 ], %g2
--stats->used_blocks;
++stats->frees;
stats->free_size += block_size;
return( true );
}
200d768: c4 00 e0 08 ld [ %g3 + 8 ], %g2
200d76c: c2 00 e0 0c ld [ %g3 + 0xc ], %g1
)
{
Heap_Block *next = old_block->next;
Heap_Block *prev = old_block->prev;
new_block->next = next;
200d770: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = prev;
200d774: 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;
200d778: 98 03 00 19 add %o4, %i1, %o4
next->prev = new_block;
200d77c: fa 20 a0 0c st %i5, [ %g2 + 0xc ]
prev->next = new_block;
200d780: fa 20 60 08 st %i5, [ %g1 + 8 ]
_Heap_Free_list_replace( next_block, block );
block->size_and_flag = size | HEAP_PREV_BLOCK_USED;
200d784: 84 13 20 01 or %o4, 1, %g2
next_block = _Heap_Block_at( block, size );
next_block->prev_size = size;
200d788: 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;
200d78c: c4 27 60 04 st %g2, [ %i5 + 4 ]
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d790: c4 06 20 40 ld [ %i0 + 0x40 ], %g2
++stats->frees;
200d794: c2 06 20 50 ld [ %i0 + 0x50 ], %g1
stats->free_size += block_size;
200d798: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d79c: 84 00 bf ff add %g2, -1, %g2
++stats->frees;
200d7a0: 82 00 60 01 inc %g1
stats->free_size += block_size;
200d7a4: b2 00 c0 19 add %g3, %i1, %i1
stats->max_free_blocks = stats->free_blocks;
}
}
/* Statistics */
--stats->used_blocks;
200d7a8: c4 26 20 40 st %g2, [ %i0 + 0x40 ]
++stats->frees;
200d7ac: c2 26 20 50 st %g1, [ %i0 + 0x50 ]
stats->free_size += block_size;
200d7b0: f2 26 20 30 st %i1, [ %i0 + 0x30 ]
return( true );
200d7b4: 84 10 20 01 mov 1, %g2
}
200d7b8: b0 08 a0 01 and %g2, 1, %i0
200d7bc: 81 c7 e0 08 ret
200d7c0: 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;
200d7c4: 82 16 60 01 or %i1, 1, %g1
200d7c8: c2 27 60 04 st %g1, [ %i5 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d7cc: c8 00 e0 04 ld [ %g3 + 4 ], %g4
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
new_block->prev = block_before;
200d7d0: f0 27 60 0c st %i0, [ %i5 + 0xc ]
next_block->prev_size = block_size;
/* Statistics */
++stats->free_blocks;
200d7d4: c2 06 20 38 ld [ %i0 + 0x38 ], %g1
Heap_Block *new_block
)
{
Heap_Block *next = block_before->next;
new_block->next = next;
200d7d8: c4 27 60 08 st %g2, [ %i5 + 8 ]
new_block->prev = block_before;
block_before->next = new_block;
next->prev = new_block;
200d7dc: 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;
200d7e0: 84 09 3f fe and %g4, -2, %g2
next_block->prev_size = block_size;
200d7e4: 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;
200d7e8: 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 ) {
200d7ec: 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;
200d7f0: 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;
200d7f4: fa 26 20 08 st %i5, [ %i0 + 8 ]
if ( stats->max_free_blocks < stats->free_blocks ) {
200d7f8: 80 a0 40 02 cmp %g1, %g2
200d7fc: 08 bf ff e5 bleu 200d790 <_Heap_Free+0x138>
200d800: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
stats->max_free_blocks = stats->free_blocks;
200d804: 10 bf ff e3 b 200d790 <_Heap_Free+0x138>
200d808: 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;
200d80c: 82 12 e0 01 or %o3, 1, %g1
200d810: c2 23 e0 04 st %g1, [ %o7 + 4 ]
next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED;
200d814: c2 00 e0 04 ld [ %g3 + 4 ], %g1
next_block->prev_size = size;
200d818: 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;
200d81c: 82 08 7f fe and %g1, -2, %g1
200d820: 10 bf ff dc b 200d790 <_Heap_Free+0x138>
200d824: c2 20 e0 04 st %g1, [ %g3 + 4 ]
0200dd4c <_Heap_Get_information>:
void _Heap_Get_information(
Heap_Control *the_heap,
Heap_Information_block *the_info
)
{
200dd4c: 9d e3 bf a0 save %sp, -96, %sp
Heap_Block *the_block = the_heap->first_block;
200dd50: fa 06 20 20 ld [ %i0 + 0x20 ], %i5
Heap_Block *const end = the_heap->last_block;
200dd54: f8 06 20 24 ld [ %i0 + 0x24 ], %i4
memset(the_info, 0, sizeof(*the_info));
200dd58: 92 10 20 00 clr %o1
200dd5c: 90 10 00 19 mov %i1, %o0
200dd60: 40 00 0a 63 call 20106ec <memset>
200dd64: 94 10 20 18 mov 0x18, %o2
while ( the_block != end ) {
200dd68: 80 a7 40 1c cmp %i5, %i4
200dd6c: 02 80 00 17 be 200ddc8 <_Heap_Get_information+0x7c> <== NEVER TAKEN
200dd70: 01 00 00 00 nop
200dd74: 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;
200dd78: 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);
200dd7c: ba 07 40 02 add %i5, %g2, %i5
if ( info->largest < the_size )
info->largest = the_size;
the_block = next_block;
}
}
200dd80: 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) )
200dd84: 80 88 e0 01 btst 1, %g3
200dd88: 02 80 00 03 be 200dd94 <_Heap_Get_information+0x48>
200dd8c: 82 10 00 19 mov %i1, %g1
info = &the_info->Used;
200dd90: 82 06 60 0c add %i1, 0xc, %g1
else
info = &the_info->Free;
info->number++;
200dd94: de 00 40 00 ld [ %g1 ], %o7
info->total += the_size;
200dd98: f0 00 60 08 ld [ %g1 + 8 ], %i0
if ( info->largest < the_size )
200dd9c: 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++;
200dda0: 9e 03 e0 01 inc %o7
info->total += the_size;
200dda4: 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++;
200dda8: de 20 40 00 st %o7, [ %g1 ]
info->total += the_size;
if ( info->largest < the_size )
200ddac: 80 a1 00 02 cmp %g4, %g2
200ddb0: 1a 80 00 03 bcc 200ddbc <_Heap_Get_information+0x70>
200ddb4: f0 20 60 08 st %i0, [ %g1 + 8 ]
info->largest = the_size;
200ddb8: 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 ) {
200ddbc: 80 a7 00 1d cmp %i4, %i5
200ddc0: 12 bf ff ef bne 200dd7c <_Heap_Get_information+0x30>
200ddc4: 84 08 ff fe and %g3, -2, %g2
200ddc8: 81 c7 e0 08 ret
200ddcc: 81 e8 00 00 restore
0201aab4 <_Heap_Size_of_alloc_area>:
bool _Heap_Size_of_alloc_area(
Heap_Control *heap,
void *alloc_begin_ptr,
uintptr_t *alloc_size
)
{
201aab4: 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);
201aab8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1
201aabc: 7f ff f7 d2 call 2018a04 <.urem>
201aac0: 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
201aac4: 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);
201aac8: 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);
201aacc: 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;
201aad0: 80 a0 80 01 cmp %g2, %g1
201aad4: 0a 80 00 16 bcs 201ab2c <_Heap_Size_of_alloc_area+0x78>
201aad8: 86 10 20 00 clr %g3
201aadc: c8 06 20 24 ld [ %i0 + 0x24 ], %g4
201aae0: 80 a0 80 04 cmp %g2, %g4
201aae4: 18 80 00 13 bgu 201ab30 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201aae8: 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;
201aaec: f0 00 a0 04 ld [ %g2 + 4 ], %i0
201aaf0: 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);
201aaf4: 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;
201aaf8: 80 a0 40 02 cmp %g1, %g2
201aafc: 18 80 00 0d bgu 201ab30 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ab00: b0 08 e0 01 and %g3, 1, %i0
201ab04: 80 a1 00 02 cmp %g4, %g2
201ab08: 0a 80 00 0a bcs 201ab30 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ab0c: 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;
201ab10: 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 )
201ab14: 80 88 60 01 btst 1, %g1
201ab18: 02 80 00 06 be 201ab30 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN
201ab1c: 84 20 80 19 sub %g2, %i1, %g2
return false;
}
*alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
return true;
201ab20: 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;
201ab24: 84 00 a0 04 add %g2, 4, %g2
201ab28: c4 26 80 00 st %g2, [ %i2 ]
return true;
}
201ab2c: b0 08 e0 01 and %g3, 1, %i0
201ab30: 81 c7 e0 08 ret
201ab34: 81 e8 00 00 restore
0200874c <_Heap_Walk>:
bool _Heap_Walk(
Heap_Control *heap,
int source,
bool dump
)
{
200874c: 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;
2008750: 3b 00 80 21 sethi %hi(0x2008400), %i5
Heap_Control *heap,
int source,
bool dump
)
{
uintptr_t const page_size = heap->page_size;
2008754: e0 06 20 10 ld [ %i0 + 0x10 ], %l0
uintptr_t const min_block_size = heap->min_block_size;
2008758: f6 06 20 14 ld [ %i0 + 0x14 ], %i3
Heap_Block *const first_block = heap->first_block;
200875c: f8 06 20 20 ld [ %i0 + 0x20 ], %i4
Heap_Block *const last_block = heap->last_block;
2008760: 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;
2008764: 80 a6 a0 00 cmp %i2, 0
2008768: 02 80 00 04 be 2008778 <_Heap_Walk+0x2c>
200876c: ba 17 62 e0 or %i5, 0x2e0, %i5
2008770: 3b 00 80 21 sethi %hi(0x2008400), %i5
2008774: ba 17 62 e8 or %i5, 0x2e8, %i5 ! 20086e8 <_Heap_Walk_print>
if ( !_System_state_Is_up( _System_state_Get() ) ) {
2008778: 03 00 80 65 sethi %hi(0x2019400), %g1
200877c: c4 00 60 a4 ld [ %g1 + 0xa4 ], %g2 ! 20194a4 <_System_state_Current>
2008780: 80 a0 a0 03 cmp %g2, 3
2008784: 02 80 00 05 be 2008798 <_Heap_Walk+0x4c>
2008788: 82 10 20 01 mov 1, %g1
block = next_block;
} while ( block != first_block );
return true;
}
200878c: b0 08 60 01 and %g1, 1, %i0
2008790: 81 c7 e0 08 ret
2008794: 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)(
2008798: da 06 20 18 ld [ %i0 + 0x18 ], %o5
200879c: c6 06 20 1c ld [ %i0 + 0x1c ], %g3
20087a0: c4 06 20 08 ld [ %i0 + 8 ], %g2
20087a4: c2 06 20 0c ld [ %i0 + 0xc ], %g1
20087a8: 90 10 00 19 mov %i1, %o0
20087ac: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
20087b0: f8 23 a0 60 st %i4, [ %sp + 0x60 ]
20087b4: e2 23 a0 64 st %l1, [ %sp + 0x64 ]
20087b8: c4 23 a0 68 st %g2, [ %sp + 0x68 ]
20087bc: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
20087c0: 92 10 20 00 clr %o1
20087c4: 96 10 00 10 mov %l0, %o3
20087c8: 15 00 80 5a sethi %hi(0x2016800), %o2
20087cc: 98 10 00 1b mov %i3, %o4
20087d0: 9f c7 40 00 call %i5
20087d4: 94 12 a0 10 or %o2, 0x10, %o2
heap->area_begin, heap->area_end,
first_block, last_block,
first_free_block, last_free_block
);
if ( page_size == 0 ) {
20087d8: 80 a4 20 00 cmp %l0, 0
20087dc: 02 80 00 28 be 200887c <_Heap_Walk+0x130>
20087e0: 80 8c 20 07 btst 7, %l0
(*printer)( source, true, "page size is zero\n" );
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
20087e4: 12 80 00 2d bne 2008898 <_Heap_Walk+0x14c>
20087e8: 90 10 00 1b mov %i3, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
20087ec: 7f ff e4 b8 call 2001acc <.urem>
20087f0: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
20087f4: 80 a2 20 00 cmp %o0, 0
20087f8: 12 80 00 30 bne 20088b8 <_Heap_Walk+0x16c>
20087fc: 90 07 20 08 add %i4, 8, %o0
2008800: 7f ff e4 b3 call 2001acc <.urem>
2008804: 92 10 00 10 mov %l0, %o1
);
return false;
}
if (
2008808: 80 a2 20 00 cmp %o0, 0
200880c: 32 80 00 33 bne,a 20088d8 <_Heap_Walk+0x18c>
2008810: 90 10 00 19 mov %i1, %o0
block = next_block;
} while ( block != first_block );
return true;
}
2008814: e8 07 20 04 ld [ %i4 + 4 ], %l4
);
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
2008818: 80 8d 20 01 btst 1, %l4
200881c: 22 80 00 36 be,a 20088f4 <_Heap_Walk+0x1a8>
2008820: 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;
2008824: c2 04 60 04 ld [ %l1 + 4 ], %g1
2008828: 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);
200882c: 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;
2008830: c4 00 60 04 ld [ %g1 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_free( last_block ) ) {
2008834: 80 88 a0 01 btst 1, %g2
2008838: 02 80 00 0a be 2008860 <_Heap_Walk+0x114>
200883c: 80 a7 00 01 cmp %i4, %g1
);
return false;
}
if (
2008840: 02 80 00 33 be 200890c <_Heap_Walk+0x1c0>
2008844: 90 10 00 19 mov %i1, %o0
_Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block
) {
(*printer)(
2008848: 92 10 20 01 mov 1, %o1
200884c: 15 00 80 5a sethi %hi(0x2016800), %o2
2008850: 9f c7 40 00 call %i5
2008854: 94 12 a1 88 or %o2, 0x188, %o2 ! 2016988 <_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;
2008858: 10 bf ff cd b 200878c <_Heap_Walk+0x40>
200885c: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_free( last_block ) ) {
(*printer)(
2008860: 90 10 00 19 mov %i1, %o0
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 a1 70 or %o2, 0x170, %o2 ! 2016970 <_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;
2008874: 10 bf ff c6 b 200878c <_Heap_Walk+0x40>
2008878: 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" );
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 a0 a8 or %o2, 0xa8, %o2 ! 20168a8 <_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;
2008890: 10 bf ff bf b 200878c <_Heap_Walk+0x40>
2008894: 82 10 20 00 clr %g1
return false;
}
if ( !_Addresses_Is_aligned( (void *) page_size ) ) {
(*printer)(
2008898: 90 10 00 19 mov %i1, %o0
200889c: 92 10 20 01 mov 1, %o1
20088a0: 96 10 00 10 mov %l0, %o3
20088a4: 15 00 80 5a sethi %hi(0x2016800), %o2
20088a8: 9f c7 40 00 call %i5
20088ac: 94 12 a0 c0 or %o2, 0xc0, %o2 ! 20168c0 <_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;
20088b0: 10 bf ff b7 b 200878c <_Heap_Walk+0x40>
20088b4: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( min_block_size, page_size ) ) {
(*printer)(
20088b8: 90 10 00 19 mov %i1, %o0
20088bc: 92 10 20 01 mov 1, %o1
20088c0: 96 10 00 1b mov %i3, %o3
20088c4: 15 00 80 5a sethi %hi(0x2016800), %o2
20088c8: 9f c7 40 00 call %i5
20088cc: 94 12 a0 e0 or %o2, 0xe0, %o2 ! 20168e0 <_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;
20088d0: 10 bf ff af b 200878c <_Heap_Walk+0x40>
20088d4: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size )
) {
(*printer)(
20088d8: 92 10 20 01 mov 1, %o1
20088dc: 96 10 00 1c mov %i4, %o3
20088e0: 15 00 80 5a sethi %hi(0x2016800), %o2
20088e4: 9f c7 40 00 call %i5
20088e8: 94 12 a1 08 or %o2, 0x108, %o2 ! 2016908 <_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;
20088ec: 10 bf ff a8 b 200878c <_Heap_Walk+0x40>
20088f0: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_prev_used( first_block ) ) {
(*printer)(
20088f4: 92 10 20 01 mov 1, %o1
20088f8: 15 00 80 5a sethi %hi(0x2016800), %o2
20088fc: 9f c7 40 00 call %i5
2008900: 94 12 a1 40 or %o2, 0x140, %o2 ! 2016940 <_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;
2008904: 10 bf ff a2 b 200878c <_Heap_Walk+0x40>
2008908: 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;
200890c: 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;
2008910: 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 ) {
2008914: 80 a6 00 1a cmp %i0, %i2
2008918: 02 80 00 0d be 200894c <_Heap_Walk+0x200>
200891c: 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;
2008920: 80 a0 40 1a cmp %g1, %i2
2008924: 28 80 00 bc bleu,a 2008c14 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN
2008928: e6 06 20 24 ld [ %i0 + 0x24 ], %l3
if ( !_Heap_Is_block_in_heap( heap, free_block ) ) {
(*printer)(
200892c: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
2008930: 92 10 20 01 mov 1, %o1
2008934: 96 10 00 1a mov %i2, %o3
2008938: 15 00 80 5a sethi %hi(0x2016800), %o2
200893c: 9f c7 40 00 call %i5
2008940: 94 12 a1 b8 or %o2, 0x1b8, %o2 ! 20169b8 <_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;
2008944: 10 bf ff 92 b 200878c <_Heap_Walk+0x40>
2008948: 82 10 20 00 clr %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
200894c: 2d 00 80 5a sethi %hi(0x2016800), %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)(
2008950: 2f 00 80 5a sethi %hi(0x2016800), %l7
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008954: a4 10 00 1c mov %i4, %l2
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008958: ac 15 a3 e8 or %l6, 0x3e8, %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)(
200895c: ae 15 e3 d0 or %l7, 0x3d0, %l7
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008960: 2b 00 80 5a sethi %hi(0x2016800), %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;
2008964: 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);
2008968: 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;
200896c: 80 a0 40 1a cmp %g1, %i2
2008970: 28 80 00 0b bleu,a 200899c <_Heap_Walk+0x250> <== ALWAYS TAKEN
2008974: 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)(
2008978: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED
200897c: 92 10 20 01 mov 1, %o1
2008980: 96 10 00 12 mov %l2, %o3
2008984: 15 00 80 5a sethi %hi(0x2016800), %o2
2008988: 98 10 00 1a mov %i2, %o4
200898c: 9f c7 40 00 call %i5
2008990: 94 12 a2 60 or %o2, 0x260, %o2
"block 0x%08x: next block 0x%08x not in heap\n",
block,
next_block
);
return false;
2008994: 10 bf ff 7e b 200878c <_Heap_Walk+0x40>
2008998: 82 10 20 00 clr %g1
200899c: 80 a0 40 1a cmp %g1, %i2
20089a0: 0a bf ff f7 bcs 200897c <_Heap_Walk+0x230>
20089a4: 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;
20089a8: 82 1c 80 11 xor %l2, %l1, %g1
20089ac: 80 a0 00 01 cmp %g0, %g1
20089b0: 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;
20089b4: 90 10 00 13 mov %l3, %o0
20089b8: c2 27 bf fc st %g1, [ %fp + -4 ]
20089bc: 7f ff e4 44 call 2001acc <.urem>
20089c0: 92 10 00 10 mov %l0, %o1
);
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
20089c4: 80 a2 20 00 cmp %o0, 0
20089c8: 02 80 00 05 be 20089dc <_Heap_Walk+0x290>
20089cc: c2 07 bf fc ld [ %fp + -4 ], %g1
20089d0: 80 88 60 ff btst 0xff, %g1
20089d4: 12 80 00 76 bne 2008bac <_Heap_Walk+0x460>
20089d8: 90 10 00 19 mov %i1, %o0
);
return false;
}
if ( block_size < min_block_size && is_not_last_block ) {
20089dc: 80 a6 c0 13 cmp %i3, %l3
20089e0: 08 80 00 05 bleu 20089f4 <_Heap_Walk+0x2a8>
20089e4: 80 a4 80 1a cmp %l2, %i2
20089e8: 80 88 60 ff btst 0xff, %g1
20089ec: 12 80 00 78 bne 2008bcc <_Heap_Walk+0x480> <== ALWAYS TAKEN
20089f0: 80 a4 80 1a cmp %l2, %i2
);
return false;
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
20089f4: 2a 80 00 06 bcs,a 2008a0c <_Heap_Walk+0x2c0>
20089f8: c2 06 a0 04 ld [ %i2 + 4 ], %g1
20089fc: 80 88 60 ff btst 0xff, %g1
2008a00: 12 80 00 7d bne 2008bf4 <_Heap_Walk+0x4a8>
2008a04: 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;
2008a08: c2 06 a0 04 ld [ %i2 + 4 ], %g1
);
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
2008a0c: 80 88 60 01 btst 1, %g1
2008a10: 02 80 00 19 be 2008a74 <_Heap_Walk+0x328>
2008a14: a8 0d 20 01 and %l4, 1, %l4
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
}
} else if (prev_used) {
2008a18: 80 a5 20 00 cmp %l4, 0
2008a1c: 22 80 00 0e be,a 2008a54 <_Heap_Walk+0x308>
2008a20: da 04 80 00 ld [ %l2 ], %o5
(*printer)(
2008a24: 90 10 00 19 mov %i1, %o0
2008a28: 92 10 20 00 clr %o1
2008a2c: 94 10 00 17 mov %l7, %o2
2008a30: 96 10 00 12 mov %l2, %o3
2008a34: 9f c7 40 00 call %i5
2008a38: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
2008a3c: 80 a7 00 1a cmp %i4, %i2
2008a40: 02 80 00 42 be 2008b48 <_Heap_Walk+0x3fc>
2008a44: a4 10 00 1a mov %i2, %l2
2008a48: e8 06 a0 04 ld [ %i2 + 4 ], %l4
2008a4c: 10 bf ff c6 b 2008964 <_Heap_Walk+0x218>
2008a50: c2 06 20 20 ld [ %i0 + 0x20 ], %g1
"block 0x%08x: size %u\n",
block,
block_size
);
} else {
(*printer)(
2008a54: 96 10 00 12 mov %l2, %o3
2008a58: 90 10 00 19 mov %i1, %o0
2008a5c: 92 10 20 00 clr %o1
2008a60: 94 10 00 16 mov %l6, %o2
2008a64: 9f c7 40 00 call %i5
2008a68: 98 10 00 13 mov %l3, %o4
block->prev_size
);
}
block = next_block;
} while ( block != first_block );
2008a6c: 10 bf ff f5 b 2008a40 <_Heap_Walk+0x2f4>
2008a70: 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 ?
2008a74: 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)(
2008a78: c2 06 20 08 ld [ %i0 + 8 ], %g1
2008a7c: 05 00 80 59 sethi %hi(0x2016400), %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;
2008a80: c8 06 20 0c ld [ %i0 + 0xc ], %g4
2008a84: 80 a0 40 0d cmp %g1, %o5
2008a88: 02 80 00 05 be 2008a9c <_Heap_Walk+0x350>
2008a8c: 86 10 a3 d0 or %g2, 0x3d0, %g3
block,
block_size,
block->prev,
block->prev == first_free_block ?
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
2008a90: 80 a6 00 0d cmp %i0, %o5
2008a94: 02 80 00 3c be 2008b84 <_Heap_Walk+0x438>
2008a98: 86 15 63 98 or %l5, 0x398, %g3
block->next,
block->next == last_free_block ?
2008a9c: 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)(
2008aa0: 1f 00 80 59 sethi %hi(0x2016400), %o7
2008aa4: 80 a1 00 01 cmp %g4, %g1
2008aa8: 02 80 00 05 be 2008abc <_Heap_Walk+0x370>
2008aac: 84 13 e3 f0 or %o7, 0x3f0, %g2
" (= first free)"
: (block->prev == free_list_head ? " (= head)" : ""),
block->next,
block->next == last_free_block ?
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
2008ab0: 80 a6 00 01 cmp %i0, %g1
2008ab4: 02 80 00 31 be 2008b78 <_Heap_Walk+0x42c>
2008ab8: 84 15 63 98 or %l5, 0x398, %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)(
2008abc: c6 23 a0 5c st %g3, [ %sp + 0x5c ]
2008ac0: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2008ac4: c4 23 a0 64 st %g2, [ %sp + 0x64 ]
2008ac8: 90 10 00 19 mov %i1, %o0
2008acc: 92 10 20 00 clr %o1
2008ad0: 15 00 80 5a sethi %hi(0x2016800), %o2
2008ad4: 96 10 00 12 mov %l2, %o3
2008ad8: 94 12 a3 28 or %o2, 0x328, %o2
2008adc: 9f c7 40 00 call %i5
2008ae0: 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 ) {
2008ae4: da 06 80 00 ld [ %i2 ], %o5
2008ae8: 80 a4 c0 0d cmp %l3, %o5
2008aec: 12 80 00 19 bne 2008b50 <_Heap_Walk+0x404>
2008af0: 80 a5 20 00 cmp %l4, 0
);
return false;
}
if ( !prev_used ) {
2008af4: 02 80 00 27 be 2008b90 <_Heap_Walk+0x444>
2008af8: 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;
2008afc: 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 ) {
2008b00: 80 a6 00 01 cmp %i0, %g1
2008b04: 02 80 00 0b be 2008b30 <_Heap_Walk+0x3e4> <== NEVER TAKEN
2008b08: 92 10 20 01 mov 1, %o1
if ( free_block == block ) {
2008b0c: 80 a4 80 01 cmp %l2, %g1
2008b10: 02 bf ff cc be 2008a40 <_Heap_Walk+0x2f4>
2008b14: 80 a7 00 1a cmp %i4, %i2
return true;
}
free_block = free_block->next;
2008b18: 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 ) {
2008b1c: 80 a6 00 01 cmp %i0, %g1
2008b20: 12 bf ff fc bne 2008b10 <_Heap_Walk+0x3c4>
2008b24: 80 a4 80 01 cmp %l2, %g1
return false;
}
if ( !_Heap_Walk_is_in_free_list( heap, block ) ) {
(*printer)(
2008b28: 90 10 00 19 mov %i1, %o0
2008b2c: 92 10 20 01 mov 1, %o1
2008b30: 96 10 00 12 mov %l2, %o3
2008b34: 15 00 80 5b sethi %hi(0x2016c00), %o2
2008b38: 9f c7 40 00 call %i5
2008b3c: 94 12 a0 10 or %o2, 0x10, %o2 ! 2016c10 <_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;
2008b40: 10 bf ff 13 b 200878c <_Heap_Walk+0x40>
2008b44: 82 10 20 00 clr %g1
}
block = next_block;
} while ( block != first_block );
return true;
2008b48: 10 bf ff 11 b 200878c <_Heap_Walk+0x40>
2008b4c: 82 10 20 01 mov 1, %g1
" (= last free)"
: (block->next == free_list_tail ? " (= tail)" : "")
);
if ( block_size != next_block->prev_size ) {
(*printer)(
2008b50: f4 23 a0 5c st %i2, [ %sp + 0x5c ]
2008b54: 90 10 00 19 mov %i1, %o0
2008b58: 92 10 20 01 mov 1, %o1
2008b5c: 96 10 00 12 mov %l2, %o3
2008b60: 15 00 80 5a sethi %hi(0x2016800), %o2
2008b64: 98 10 00 13 mov %l3, %o4
2008b68: 9f c7 40 00 call %i5
2008b6c: 94 12 a3 60 or %o2, 0x360, %o2
return false;
}
if ( !_Heap_Is_prev_used( next_block ) ) {
if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) {
return false;
2008b70: 10 bf ff 07 b 200878c <_Heap_Walk+0x40>
2008b74: 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)" : "")
2008b78: 05 00 80 5a sethi %hi(0x2016800), %g2
2008b7c: 10 bf ff d0 b 2008abc <_Heap_Walk+0x370>
2008b80: 84 10 a0 00 mov %g2, %g2 ! 2016800 <_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)" : ""),
2008b84: 07 00 80 59 sethi %hi(0x2016400), %g3
2008b88: 10 bf ff c5 b 2008a9c <_Heap_Walk+0x350>
2008b8c: 86 10 e3 e0 or %g3, 0x3e0, %g3 ! 20167e0 <_Status_Object_name_errors_to_status+0x48>
return false;
}
if ( !prev_used ) {
(*printer)(
2008b90: 92 10 20 01 mov 1, %o1
2008b94: 96 10 00 12 mov %l2, %o3
2008b98: 15 00 80 5a sethi %hi(0x2016800), %o2
2008b9c: 9f c7 40 00 call %i5
2008ba0: 94 12 a3 a0 or %o2, 0x3a0, %o2 ! 2016ba0 <_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;
2008ba4: 10 bf fe fa b 200878c <_Heap_Walk+0x40>
2008ba8: 82 10 20 00 clr %g1
return false;
}
if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) {
(*printer)(
2008bac: 92 10 20 01 mov 1, %o1
2008bb0: 96 10 00 12 mov %l2, %o3
2008bb4: 15 00 80 5a sethi %hi(0x2016800), %o2
2008bb8: 98 10 00 13 mov %l3, %o4
2008bbc: 9f c7 40 00 call %i5
2008bc0: 94 12 a2 90 or %o2, 0x290, %o2
"block 0x%08x: block size %u not page aligned\n",
block,
block_size
);
return false;
2008bc4: 10 bf fe f2 b 200878c <_Heap_Walk+0x40>
2008bc8: 82 10 20 00 clr %g1
}
if ( block_size < min_block_size && is_not_last_block ) {
(*printer)(
2008bcc: 90 10 00 19 mov %i1, %o0
2008bd0: 92 10 20 01 mov 1, %o1
2008bd4: 96 10 00 12 mov %l2, %o3
2008bd8: 15 00 80 5a sethi %hi(0x2016800), %o2
2008bdc: 98 10 00 13 mov %l3, %o4
2008be0: 94 12 a2 c0 or %o2, 0x2c0, %o2
2008be4: 9f c7 40 00 call %i5
2008be8: 9a 10 00 1b mov %i3, %o5
block,
block_size,
min_block_size
);
return false;
2008bec: 10 bf fe e8 b 200878c <_Heap_Walk+0x40>
2008bf0: 82 10 20 00 clr %g1
}
if ( next_block_begin <= block_begin && is_not_last_block ) {
(*printer)(
2008bf4: 92 10 20 01 mov 1, %o1
2008bf8: 96 10 00 12 mov %l2, %o3
2008bfc: 15 00 80 5a sethi %hi(0x2016800), %o2
2008c00: 98 10 00 1a mov %i2, %o4
2008c04: 9f c7 40 00 call %i5
2008c08: 94 12 a2 f0 or %o2, 0x2f0, %o2
"block 0x%08x: next block 0x%08x is not a successor\n",
block,
next_block
);
return false;
2008c0c: 10 bf fe e0 b 200878c <_Heap_Walk+0x40>
2008c10: 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;
2008c14: 80 a6 80 13 cmp %i2, %l3
2008c18: 18 bf ff 46 bgu 2008930 <_Heap_Walk+0x1e4> <== NEVER TAKEN
2008c1c: 90 10 00 19 mov %i1, %o0
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008c20: c2 27 bf fc st %g1, [ %fp + -4 ]
2008c24: 90 06 a0 08 add %i2, 8, %o0
2008c28: 7f ff e3 a9 call 2001acc <.urem>
2008c2c: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008c30: 80 a2 20 00 cmp %o0, 0
2008c34: 12 80 00 36 bne 2008d0c <_Heap_Walk+0x5c0> <== NEVER TAKEN
2008c38: 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;
2008c3c: c4 06 a0 04 ld [ %i2 + 4 ], %g2
2008c40: 84 08 bf fe and %g2, -2, %g2
block = next_block;
} while ( block != first_block );
return true;
}
2008c44: 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;
2008c48: c4 00 a0 04 ld [ %g2 + 4 ], %g2
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008c4c: 80 88 a0 01 btst 1, %g2
2008c50: 12 80 00 27 bne 2008cec <_Heap_Walk+0x5a0> <== NEVER TAKEN
2008c54: 84 10 00 18 mov %i0, %g2
2008c58: 10 80 00 19 b 2008cbc <_Heap_Walk+0x570>
2008c5c: 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 ) {
2008c60: 80 a6 00 1a cmp %i0, %i2
2008c64: 02 bf ff 3a be 200894c <_Heap_Walk+0x200>
2008c68: 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;
2008c6c: 0a bf ff 31 bcs 2008930 <_Heap_Walk+0x1e4>
2008c70: 90 10 00 19 mov %i1, %o0
2008c74: 80 a6 80 13 cmp %i2, %l3
2008c78: 18 bf ff 2f bgu 2008934 <_Heap_Walk+0x1e8> <== NEVER TAKEN
2008c7c: 92 10 20 01 mov 1, %o1
RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned(
uintptr_t value,
uintptr_t alignment
)
{
return (value % alignment) == 0;
2008c80: c2 27 bf fc st %g1, [ %fp + -4 ]
2008c84: 90 06 a0 08 add %i2, 8, %o0
2008c88: 7f ff e3 91 call 2001acc <.urem>
2008c8c: 92 10 00 15 mov %l5, %o1
);
return false;
}
if (
2008c90: 80 a2 20 00 cmp %o0, 0
2008c94: 12 80 00 1e bne 2008d0c <_Heap_Walk+0x5c0>
2008c98: 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;
2008c9c: c6 06 a0 04 ld [ %i2 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008ca0: 84 10 00 12 mov %l2, %g2
2008ca4: 86 08 ff fe and %g3, -2, %g3
block = next_block;
} while ( block != first_block );
return true;
}
2008ca8: 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;
2008cac: c6 00 e0 04 ld [ %g3 + 4 ], %g3
);
return false;
}
if ( _Heap_Is_used( free_block ) ) {
2008cb0: 80 88 e0 01 btst 1, %g3
2008cb4: 12 80 00 0e bne 2008cec <_Heap_Walk+0x5a0>
2008cb8: a4 10 00 1a mov %i2, %l2
);
return false;
}
if ( free_block->prev != prev_block ) {
2008cbc: d8 06 a0 0c ld [ %i2 + 0xc ], %o4
2008cc0: 80 a3 00 02 cmp %o4, %g2
2008cc4: 22 bf ff e7 be,a 2008c60 <_Heap_Walk+0x514>
2008cc8: f4 06 a0 08 ld [ %i2 + 8 ], %i2
(*printer)(
2008ccc: 90 10 00 19 mov %i1, %o0
2008cd0: 92 10 20 01 mov 1, %o1
2008cd4: 96 10 00 1a mov %i2, %o3
2008cd8: 15 00 80 5a sethi %hi(0x2016800), %o2
2008cdc: 9f c7 40 00 call %i5
2008ce0: 94 12 a2 28 or %o2, 0x228, %o2 ! 2016a28 <_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;
2008ce4: 10 bf fe aa b 200878c <_Heap_Walk+0x40>
2008ce8: 82 10 20 00 clr %g1
return false;
}
if ( _Heap_Is_used( free_block ) ) {
(*printer)(
2008cec: 90 10 00 19 mov %i1, %o0
2008cf0: 92 10 20 01 mov 1, %o1
2008cf4: 96 10 00 1a mov %i2, %o3
2008cf8: 15 00 80 5a sethi %hi(0x2016800), %o2
2008cfc: 9f c7 40 00 call %i5
2008d00: 94 12 a2 08 or %o2, 0x208, %o2 ! 2016a08 <_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;
2008d04: 10 bf fe a2 b 200878c <_Heap_Walk+0x40>
2008d08: 82 10 20 00 clr %g1
}
if (
!_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size )
) {
(*printer)(
2008d0c: 90 10 00 19 mov %i1, %o0
2008d10: 92 10 20 01 mov 1, %o1
2008d14: 96 10 00 1a mov %i2, %o3
2008d18: 15 00 80 5a sethi %hi(0x2016800), %o2
2008d1c: 9f c7 40 00 call %i5
2008d20: 94 12 a1 d8 or %o2, 0x1d8, %o2 ! 20169d8 <_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;
2008d24: 10 bf fe 9a b 200878c <_Heap_Walk+0x40>
2008d28: 82 10 20 00 clr %g1
0200713c <_IO_Initialize_all_drivers>:
*
* Output Parameters: NONE
*/
void _IO_Initialize_all_drivers( void )
{
200713c: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major;
for ( major=0 ; major < _IO_Number_of_drivers ; major ++ )
2007140: 39 00 80 78 sethi %hi(0x201e000), %i4
2007144: c2 07 23 04 ld [ %i4 + 0x304 ], %g1 ! 201e304 <_IO_Number_of_drivers>
2007148: 80 a0 60 00 cmp %g1, 0
200714c: 02 80 00 0c be 200717c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN
2007150: ba 10 20 00 clr %i5
2007154: b8 17 23 04 or %i4, 0x304, %i4
(void) rtems_io_initialize( major, 0, NULL );
2007158: 90 10 00 1d mov %i5, %o0
200715c: 92 10 20 00 clr %o1
2007160: 40 00 18 0d call 200d194 <rtems_io_initialize>
2007164: 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 ++ )
2007168: c2 07 00 00 ld [ %i4 ], %g1
200716c: ba 07 60 01 inc %i5
2007170: 80 a0 40 1d cmp %g1, %i5
2007174: 18 bf ff fa bgu 200715c <_IO_Initialize_all_drivers+0x20>
2007178: 90 10 00 1d mov %i5, %o0
200717c: 81 c7 e0 08 ret
2007180: 81 e8 00 00 restore
02007070 <_IO_Manager_initialization>:
* workspace.
*
*/
void _IO_Manager_initialization(void)
{
2007070: 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;
2007074: 03 00 80 73 sethi %hi(0x201cc00), %g1
2007078: 82 10 60 2c or %g1, 0x2c, %g1 ! 201cc2c <Configuration>
drivers_in_table = Configuration.number_of_device_drivers;
200707c: f8 00 60 30 ld [ %g1 + 0x30 ], %i4
number_of_drivers = Configuration.maximum_drivers;
2007080: 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 )
2007084: 80 a7 00 19 cmp %i4, %i1
2007088: 0a 80 00 08 bcs 20070a8 <_IO_Manager_initialization+0x38>
200708c: 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;
2007090: 03 00 80 78 sethi %hi(0x201e000), %g1
2007094: fa 20 63 08 st %i5, [ %g1 + 0x308 ] ! 201e308 <_IO_Driver_address_table>
_IO_Number_of_drivers = number_of_drivers;
2007098: 03 00 80 78 sethi %hi(0x201e000), %g1
200709c: f8 20 63 04 st %i4, [ %g1 + 0x304 ] ! 201e304 <_IO_Number_of_drivers>
return;
20070a0: 81 c7 e0 08 ret
20070a4: 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 )
20070a8: 83 2e 60 03 sll %i1, 3, %g1
20070ac: b5 2e 60 05 sll %i1, 5, %i2
20070b0: 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(
20070b4: 40 00 0d 67 call 200a650 <_Workspace_Allocate_or_fatal_error>
20070b8: 90 10 00 1a mov %i2, %o0
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
20070bc: 03 00 80 78 sethi %hi(0x201e000), %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 *)
20070c0: 37 00 80 78 sethi %hi(0x201e000), %i3
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
20070c4: f2 20 63 04 st %i1, [ %g1 + 0x304 ]
/*
* 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 *)
20070c8: d0 26 e3 08 st %o0, [ %i3 + 0x308 ]
_Workspace_Allocate_or_fatal_error(
sizeof( rtems_driver_address_table ) * ( number_of_drivers )
);
_IO_Number_of_drivers = number_of_drivers;
memset(
20070cc: 92 10 20 00 clr %o1
20070d0: 40 00 24 cc call 2010400 <memset>
20070d4: 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++ )
20070d8: 80 a7 20 00 cmp %i4, 0
20070dc: 02 bf ff f1 be 20070a0 <_IO_Manager_initialization+0x30> <== NEVER TAKEN
20070e0: f6 06 e3 08 ld [ %i3 + 0x308 ], %i3
20070e4: 82 10 20 00 clr %g1
20070e8: 88 10 20 00 clr %g4
_IO_Driver_address_table[index] = driver_table[index];
20070ec: c4 07 40 01 ld [ %i5 + %g1 ], %g2
20070f0: 86 07 40 01 add %i5, %g1, %g3
20070f4: c4 26 c0 01 st %g2, [ %i3 + %g1 ]
20070f8: f4 00 e0 04 ld [ %g3 + 4 ], %i2
20070fc: 84 06 c0 01 add %i3, %g1, %g2
2007100: f4 20 a0 04 st %i2, [ %g2 + 4 ]
2007104: 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++ )
2007108: 88 01 20 01 inc %g4
_IO_Driver_address_table[index] = driver_table[index];
200710c: f4 20 a0 08 st %i2, [ %g2 + 8 ]
2007110: 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++ )
2007114: 82 00 60 18 add %g1, 0x18, %g1
_IO_Driver_address_table[index] = driver_table[index];
2007118: f4 20 a0 0c st %i2, [ %g2 + 0xc ]
200711c: 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++ )
2007120: 80 a1 00 1c cmp %g4, %i4
_IO_Driver_address_table[index] = driver_table[index];
2007124: f4 20 a0 10 st %i2, [ %g2 + 0x10 ]
2007128: 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++ )
200712c: 12 bf ff f0 bne 20070ec <_IO_Manager_initialization+0x7c>
2007130: c6 20 a0 14 st %g3, [ %g2 + 0x14 ]
2007134: 81 c7 e0 08 ret
2007138: 81 e8 00 00 restore
02007ea0 <_Objects_Allocate>:
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2007ea0: 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 )
2007ea4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
*/
Objects_Control *_Objects_Allocate(
Objects_Information *information
)
{
2007ea8: 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 )
2007eac: 80 a0 60 00 cmp %g1, 0
2007eb0: 02 80 00 19 be 2007f14 <_Objects_Allocate+0x74> <== NEVER TAKEN
2007eb4: 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 );
2007eb8: b8 07 60 20 add %i5, 0x20, %i4
2007ebc: 7f ff fd 63 call 2007448 <_Chain_Get>
2007ec0: 90 10 00 1c mov %i4, %o0
if ( information->auto_extend ) {
2007ec4: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1
2007ec8: 80 a0 60 00 cmp %g1, 0
2007ecc: 02 80 00 12 be 2007f14 <_Objects_Allocate+0x74>
2007ed0: 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 ) {
2007ed4: 80 a2 20 00 cmp %o0, 0
2007ed8: 02 80 00 11 be 2007f1c <_Objects_Allocate+0x7c>
2007edc: 01 00 00 00 nop
}
if ( the_object ) {
uint32_t block;
block = (uint32_t) _Objects_Get_index( the_object->id ) -
2007ee0: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
2007ee4: d0 16 20 0a lduh [ %i0 + 0xa ], %o0
_Objects_Get_index( information->minimum_id );
block /= information->allocation_size;
2007ee8: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1
2007eec: 40 00 42 1a call 2018754 <.udiv>
2007ef0: 90 22 00 01 sub %o0, %g1, %o0
information->inactive_per_block[ block ]--;
2007ef4: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
2007ef8: 91 2a 20 02 sll %o0, 2, %o0
2007efc: c6 00 40 08 ld [ %g1 + %o0 ], %g3
information->inactive--;
2007f00: 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 ]--;
2007f04: 86 00 ff ff add %g3, -1, %g3
2007f08: c6 20 40 08 st %g3, [ %g1 + %o0 ]
information->inactive--;
2007f0c: 82 00 bf ff add %g2, -1, %g1
2007f10: c2 37 60 2c sth %g1, [ %i5 + 0x2c ]
);
}
#endif
return the_object;
}
2007f14: 81 c7 e0 08 ret
2007f18: 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 );
2007f1c: 40 00 00 10 call 2007f5c <_Objects_Extend_information>
2007f20: 90 10 00 1d mov %i5, %o0
the_object = (Objects_Control *) _Chain_Get( &information->Inactive );
2007f24: 7f ff fd 49 call 2007448 <_Chain_Get>
2007f28: 90 10 00 1c mov %i4, %o0
}
if ( the_object ) {
2007f2c: b0 92 20 00 orcc %o0, 0, %i0
2007f30: 32 bf ff ed bne,a 2007ee4 <_Objects_Allocate+0x44>
2007f34: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
);
}
#endif
return the_object;
}
2007f38: 81 c7 e0 08 ret
2007f3c: 81 e8 00 00 restore
02007f5c <_Objects_Extend_information>:
*/
void _Objects_Extend_information(
Objects_Information *information
)
{
2007f5c: 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 )
2007f60: 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 );
2007f64: f8 16 20 0a lduh [ %i0 + 0xa ], %i4
index_base = minimum_index;
block = 0;
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
2007f68: 80 a4 20 00 cmp %l0, 0
2007f6c: 02 80 00 a6 be 2008204 <_Objects_Extend_information+0x2a8>
2007f70: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1
block_count = 0;
else {
block_count = information->maximum / information->allocation_size;
2007f74: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2
2007f78: b3 2e 60 10 sll %i1, 0x10, %i1
2007f7c: 92 10 00 1a mov %i2, %o1
2007f80: 40 00 41 f5 call 2018754 <.udiv>
2007f84: 91 36 60 10 srl %i1, 0x10, %o0
2007f88: a7 2a 20 10 sll %o0, 0x10, %l3
2007f8c: a7 34 e0 10 srl %l3, 0x10, %l3
for ( ; block < block_count; block++ ) {
2007f90: 80 a4 e0 00 cmp %l3, 0
2007f94: 02 80 00 a3 be 2008220 <_Objects_Extend_information+0x2c4><== NEVER TAKEN
2007f98: 90 10 00 1a mov %i2, %o0
if ( information->object_blocks[ block ] == NULL ) {
2007f9c: 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 );
2007fa0: 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 ) {
2007fa4: 80 a0 60 00 cmp %g1, 0
2007fa8: 12 80 00 08 bne 2007fc8 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN
2007fac: b6 10 20 00 clr %i3
do_extend = false;
2007fb0: 10 80 00 a0 b 2008230 <_Objects_Extend_information+0x2d4> <== NOT EXECUTED
2007fb4: 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 ) {
2007fb8: c2 04 00 01 ld [ %l0 + %g1 ], %g1
2007fbc: 80 a0 60 00 cmp %g1, 0
2007fc0: 22 80 00 08 be,a 2007fe0 <_Objects_Extend_information+0x84>
2007fc4: 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++ ) {
2007fc8: b6 06 e0 01 inc %i3
if ( information->object_blocks[ block ] == NULL ) {
do_extend = false;
break;
} else
index_base += information->allocation_size;
2007fcc: 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++ ) {
2007fd0: 80 a4 c0 1b cmp %l3, %i3
2007fd4: 18 bf ff f9 bgu 2007fb8 <_Objects_Extend_information+0x5c>
2007fd8: 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;
2007fdc: b4 10 20 01 mov 1, %i2
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
2007fe0: 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 ) {
2007fe4: 03 00 00 3f sethi %hi(0xfc00), %g1
} else
index_base += information->allocation_size;
}
}
maximum = (uint32_t) information->maximum + information->allocation_size;
2007fe8: 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 ) {
2007fec: 82 10 63 ff or %g1, 0x3ff, %g1
2007ff0: 80 a6 40 01 cmp %i1, %g1
2007ff4: 18 80 00 93 bgu 2008240 <_Objects_Extend_information+0x2e4>
2007ff8: 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;
2007ffc: 40 00 41 9c call 201866c <.umul>
2008000: d2 06 20 18 ld [ %i0 + 0x18 ], %o1
if ( information->auto_extend ) {
2008004: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1
2008008: 80 a0 60 00 cmp %g1, 0
200800c: 02 80 00 6a be 20081b4 <_Objects_Extend_information+0x258>
2008010: 01 00 00 00 nop
new_object_block = _Workspace_Allocate( block_size );
2008014: 40 00 09 81 call 200a618 <_Workspace_Allocate>
2008018: 01 00 00 00 nop
if ( !new_object_block )
200801c: a0 92 20 00 orcc %o0, 0, %l0
2008020: 02 80 00 88 be 2008240 <_Objects_Extend_information+0x2e4>
2008024: 01 00 00 00 nop
}
/*
* Do we need to grow the tables?
*/
if ( do_extend ) {
2008028: 80 8e a0 ff btst 0xff, %i2
200802c: 22 80 00 3f be,a 2008128 <_Objects_Extend_information+0x1cc>
2008030: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
*/
/*
* Up the block count and maximum
*/
block_count++;
2008034: 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 *)) +
2008038: 91 2e a0 01 sll %i2, 1, %o0
200803c: 90 02 00 1a add %o0, %i2, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
2008040: 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 *)) +
2008044: 90 02 00 1c add %o0, %i4, %o0
((maximum + minimum_index) * sizeof(Objects_Control *));
object_blocks = (void**) _Workspace_Allocate( block_size );
2008048: 40 00 09 74 call 200a618 <_Workspace_Allocate>
200804c: 91 2a 20 02 sll %o0, 2, %o0
if ( !object_blocks ) {
2008050: a2 92 20 00 orcc %o0, 0, %l1
2008054: 02 80 00 79 be 2008238 <_Objects_Extend_information+0x2dc>
2008058: 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 ) {
200805c: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1
2008060: 80 a7 00 01 cmp %i4, %g1
2008064: a4 04 40 1a add %l1, %i2, %l2
2008068: 0a 80 00 57 bcs 20081c4 <_Objects_Extend_information+0x268>
200806c: 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++ ) {
2008070: 80 a7 20 00 cmp %i4, 0
2008074: 02 80 00 07 be 2008090 <_Objects_Extend_information+0x134><== NEVER TAKEN
2008078: 82 10 20 00 clr %g1
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
200807c: 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++ ) {
2008080: 82 00 60 01 inc %g1
2008084: 80 a7 00 01 cmp %i4, %g1
2008088: 18 bf ff fd bgu 200807c <_Objects_Extend_information+0x120><== NEVER TAKEN
200808c: c0 20 80 1a clr [ %g2 + %i2 ]
2008090: 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 );
2008094: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3
}
/*
* Initialise the new entries in the table.
*/
object_blocks[block_count] = NULL;
2008098: c0 24 40 13 clr [ %l1 + %l3 ]
inactive_per_block[block_count] = 0;
for ( index=index_base ;
index < ( information->allocation_size + index_base );
200809c: 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 ;
20080a0: 80 a7 40 03 cmp %i5, %g3
20080a4: 1a 80 00 0a bcc 20080cc <_Objects_Extend_information+0x170><== NEVER TAKEN
20080a8: c0 24 80 13 clr [ %l2 + %l3 ]
* information - object information table
*
* Output parameters: NONE
*/
void _Objects_Extend_information(
20080ac: 83 2f 60 02 sll %i5, 2, %g1
20080b0: 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 ;
20080b4: 82 06 80 01 add %i2, %g1, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
20080b8: 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++ ) {
20080bc: 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 ;
20080c0: 80 a0 c0 02 cmp %g3, %g2
20080c4: 18 bf ff fd bgu 20080b8 <_Objects_Extend_information+0x15c>
20080c8: 82 00 60 04 add %g1, 4, %g1
index < ( information->allocation_size + index_base );
index++ ) {
local_table[ index ] = NULL;
}
_ISR_Disable( level );
20080cc: 7f ff e8 4c call 20021fc <sparc_disable_interrupts>
20080d0: 01 00 00 00 nop
uint32_t the_class,
uint32_t node,
uint32_t index
)
{
return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) |
20080d4: 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(
20080d8: c4 16 20 04 lduh [ %i0 + 4 ], %g2
local_table[ index ] = NULL;
}
_ISR_Disable( level );
old_tables = information->object_blocks;
20080dc: 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;
20080e0: f2 36 20 10 sth %i1, [ %i0 + 0x10 ]
20080e4: 87 28 e0 18 sll %g3, 0x18, %g3
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
20080e8: 85 28 a0 1b sll %g2, 0x1b, %g2
_ISR_Disable( level );
old_tables = information->object_blocks;
information->object_blocks = object_blocks;
20080ec: e2 26 20 34 st %l1, [ %i0 + 0x34 ]
information->inactive_per_block = inactive_per_block;
20080f0: e4 26 20 30 st %l2, [ %i0 + 0x30 ]
information->local_table = local_table;
20080f4: f4 26 20 1c st %i2, [ %i0 + 0x1c ]
information->maximum = (Objects_Maximum) maximum;
information->maximum_id = _Objects_Build_id(
20080f8: 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) |
20080fc: 03 00 00 40 sethi %hi(0x10000), %g1
2008100: b3 36 60 10 srl %i1, 0x10, %i1
2008104: 82 10 c0 01 or %g3, %g1, %g1
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2008108: 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) |
200810c: 82 10 40 19 or %g1, %i1, %g1
2008110: c2 26 20 0c st %g1, [ %i0 + 0xc ]
information->the_class,
_Objects_Local_node,
information->maximum
);
_ISR_Enable( level );
2008114: 7f ff e8 3e call 200220c <sparc_enable_interrupts>
2008118: 01 00 00 00 nop
_Workspace_Free( old_tables );
200811c: 40 00 09 47 call 200a638 <_Workspace_Free>
2008120: 90 10 00 1c mov %i4, %o0
}
/*
* Assign the new object block to the object block table.
*/
information->object_blocks[ block ] = new_object_block;
2008124: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2008128: b7 2e e0 02 sll %i3, 2, %i3
200812c: e0 20 40 1b st %l0, [ %g1 + %i3 ]
/*
* Initialize objects .. add to a local chain first.
*/
_Chain_Initialize(
2008130: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
2008134: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2
2008138: d2 00 40 1b ld [ %g1 + %i3 ], %o1
200813c: d6 06 20 18 ld [ %i0 + 0x18 ], %o3
2008140: 90 07 bf f4 add %fp, -12, %o0
2008144: 40 00 14 2c call 200d1f4 <_Chain_Initialize>
2008148: 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 ) {
200814c: 10 80 00 0d b 2008180 <_Objects_Extend_information+0x224>
2008150: b4 06 20 20 add %i0, 0x20, %i2
the_object->id = _Objects_Build_id(
2008154: c6 16 20 04 lduh [ %i0 + 4 ], %g3
2008158: 85 28 a0 18 sll %g2, 0x18, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
200815c: 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) |
2008160: 84 10 80 1c or %g2, %i4, %g2
(( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) |
2008164: 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) |
2008168: 84 10 80 1d or %g2, %i5, %g2
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
200816c: 90 10 00 1a mov %i2, %o0
2008170: 92 10 00 01 mov %g1, %o1
index++;
2008174: ba 07 60 01 inc %i5
information->the_class,
_Objects_Local_node,
index
);
_Chain_Append( &information->Inactive, &the_object->Node );
2008178: 7f ff fc a0 call 20073f8 <_Chain_Append>
200817c: 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 ) {
2008180: 7f ff fc b2 call 2007448 <_Chain_Get>
2008184: 90 07 bf f4 add %fp, -12, %o0
2008188: 82 92 20 00 orcc %o0, 0, %g1
200818c: 32 bf ff f2 bne,a 2008154 <_Objects_Extend_information+0x1f8>
2008190: c4 06 00 00 ld [ %i0 ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
2008194: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4
2008198: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
200819c: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2
_Chain_Append( &information->Inactive, &the_object->Node );
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
20081a0: c8 20 c0 1b st %g4, [ %g3 + %i3 ]
information->inactive =
(Objects_Maximum)(information->inactive + information->allocation_size);
20081a4: 82 00 80 04 add %g2, %g4, %g1
index++;
}
information->inactive_per_block[ block ] = information->allocation_size;
information->inactive =
20081a8: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
20081ac: 81 c7 e0 08 ret
20081b0: 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 );
20081b4: 40 00 09 27 call 200a650 <_Workspace_Allocate_or_fatal_error>
20081b8: 01 00 00 00 nop
20081bc: 10 bf ff 9b b 2008028 <_Objects_Extend_information+0xcc>
20081c0: 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,
20081c4: d2 06 20 34 ld [ %i0 + 0x34 ], %o1
information->object_blocks,
block_count * sizeof(void*) );
20081c8: 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,
20081cc: 40 00 20 51 call 2010310 <memcpy>
20081d0: 94 10 00 13 mov %l3, %o2
information->object_blocks,
block_count * sizeof(void*) );
memcpy( inactive_per_block,
20081d4: d2 06 20 30 ld [ %i0 + 0x30 ], %o1
20081d8: 94 10 00 13 mov %l3, %o2
20081dc: 40 00 20 4d call 2010310 <memcpy>
20081e0: 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 *) );
20081e4: 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,
20081e8: d2 06 20 1c ld [ %i0 + 0x1c ], %o1
information->local_table,
(information->maximum + minimum_index) * sizeof(Objects_Control *) );
20081ec: 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,
20081f0: 90 10 00 1a mov %i2, %o0
20081f4: 40 00 20 47 call 2010310 <memcpy>
20081f8: 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 );
20081fc: 10 bf ff a7 b 2008098 <_Objects_Extend_information+0x13c>
2008200: 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 )
2008204: 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 );
2008208: 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;
200820c: b4 10 20 01 mov 1, %i2
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2008210: b6 10 20 00 clr %i3
/* if ( information->maximum < minimum_index ) */
if ( information->object_blocks == NULL )
block_count = 0;
2008214: a6 10 20 00 clr %l3
2008218: 10 bf ff 72 b 2007fe0 <_Objects_Extend_information+0x84>
200821c: 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 );
2008220: 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;
2008224: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED
minimum_index = _Objects_Get_index( information->minimum_id );
index_base = minimum_index;
block = 0;
2008228: 10 bf ff 6e b 2007fe0 <_Objects_Extend_information+0x84> <== NOT EXECUTED
200822c: b6 10 20 00 clr %i3 <== NOT EXECUTED
2008230: 10 bf ff 6c b 2007fe0 <_Objects_Extend_information+0x84> <== NOT EXECUTED
2008234: 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 );
2008238: 40 00 09 00 call 200a638 <_Workspace_Free>
200823c: 90 10 00 10 mov %l0, %o0
return;
2008240: 81 c7 e0 08 ret
2008244: 81 e8 00 00 restore
020082ec <_Objects_Get_information>:
Objects_Information *_Objects_Get_information(
Objects_APIs the_api,
uint16_t the_class
)
{
20082ec: 9d e3 bf a0 save %sp, -96, %sp
Objects_Information *info;
int the_class_api_maximum;
if ( !the_class )
20082f0: 80 a6 60 00 cmp %i1, 0
20082f4: 02 80 00 17 be 2008350 <_Objects_Get_information+0x64>
20082f8: 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 );
20082fc: 40 00 15 4b call 200d828 <_Objects_API_maximum_class>
2008300: 90 10 00 18 mov %i0, %o0
if ( the_class_api_maximum == 0 )
2008304: 80 a2 20 00 cmp %o0, 0
2008308: 02 80 00 12 be 2008350 <_Objects_Get_information+0x64>
200830c: 80 a2 00 19 cmp %o0, %i1
return NULL;
if ( the_class > (uint32_t) the_class_api_maximum )
2008310: 0a 80 00 10 bcs 2008350 <_Objects_Get_information+0x64>
2008314: 03 00 80 76 sethi %hi(0x201d800), %g1
return NULL;
if ( !_Objects_Information_table[ the_api ] )
2008318: b1 2e 20 02 sll %i0, 2, %i0
200831c: 82 10 60 f8 or %g1, 0xf8, %g1
2008320: c2 00 40 18 ld [ %g1 + %i0 ], %g1
2008324: 80 a0 60 00 cmp %g1, 0
2008328: 02 80 00 0a be 2008350 <_Objects_Get_information+0x64> <== NEVER TAKEN
200832c: b3 2e 60 02 sll %i1, 2, %i1
return NULL;
info = _Objects_Information_table[ the_api ][ the_class ];
2008330: fa 00 40 19 ld [ %g1 + %i1 ], %i5
if ( !info )
2008334: 80 a7 60 00 cmp %i5, 0
2008338: 02 80 00 06 be 2008350 <_Objects_Get_information+0x64> <== NEVER TAKEN
200833c: 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 )
2008340: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1
return NULL;
2008344: 80 a0 00 01 cmp %g0, %g1
2008348: 82 60 20 00 subx %g0, 0, %g1
200834c: ba 0f 40 01 and %i5, %g1, %i5
#endif
return info;
}
2008350: 81 c7 e0 08 ret
2008354: 91 e8 00 1d restore %g0, %i5, %o0
02009b30 <_Objects_Get_name_as_string>:
char *_Objects_Get_name_as_string(
Objects_Id id,
size_t length,
char *name
)
{
2009b30: 9d e3 bf 90 save %sp, -112, %sp
char lname[5];
Objects_Control *the_object;
Objects_Locations location;
Objects_Id tmpId;
if ( length == 0 )
2009b34: 80 a6 60 00 cmp %i1, 0
2009b38: 02 80 00 41 be 2009c3c <_Objects_Get_name_as_string+0x10c>
2009b3c: 80 a6 a0 00 cmp %i2, 0
return NULL;
if ( name == NULL )
2009b40: 02 80 00 3a be 2009c28 <_Objects_Get_name_as_string+0xf8>
2009b44: 80 a6 20 00 cmp %i0, 0
return NULL;
tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id;
2009b48: 02 80 00 3a be 2009c30 <_Objects_Get_name_as_string+0x100>
2009b4c: 03 00 80 82 sethi %hi(0x2020800), %g1
information = _Objects_Get_information_id( tmpId );
2009b50: 7f ff ff ba call 2009a38 <_Objects_Get_information_id>
2009b54: 90 10 00 18 mov %i0, %o0
if ( !information )
2009b58: ba 92 20 00 orcc %o0, 0, %i5
2009b5c: 02 80 00 38 be 2009c3c <_Objects_Get_name_as_string+0x10c>
2009b60: 92 10 00 18 mov %i0, %o1
return NULL;
the_object = _Objects_Get( information, tmpId, &location );
2009b64: 40 00 00 3f call 2009c60 <_Objects_Get>
2009b68: 94 07 bf fc add %fp, -4, %o2
switch ( location ) {
2009b6c: c2 07 bf fc ld [ %fp + -4 ], %g1
2009b70: 80 a0 60 00 cmp %g1, 0
2009b74: 32 80 00 33 bne,a 2009c40 <_Objects_Get_name_as_string+0x110>
2009b78: b4 10 20 00 clr %i2
return NULL;
case OBJECTS_LOCAL:
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string ) {
2009b7c: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1
2009b80: 80 a0 60 00 cmp %g1, 0
2009b84: 32 80 00 31 bne,a 2009c48 <_Objects_Get_name_as_string+0x118>
2009b88: 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;
2009b8c: 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';
2009b90: 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;
2009b94: 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;
2009b98: 89 30 60 18 srl %g1, 0x18, %g4
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009b9c: 87 30 60 10 srl %g1, 0x10, %g3
lname[ 2 ] = (u32_name >> 8) & 0xff;
2009ba0: 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;
2009ba4: c8 2f bf f0 stb %g4, [ %fp + -16 ]
lname[ 1 ] = (u32_name >> 16) & 0xff;
2009ba8: c6 2f bf f1 stb %g3, [ %fp + -15 ]
lname[ 2 ] = (u32_name >> 8) & 0xff;
lname[ 3 ] = (u32_name >> 0) & 0xff;
2009bac: c2 2f bf f3 stb %g1, [ %fp + -13 ]
lname[ 4 ] = '\0';
s = lname;
2009bb0: 84 07 bf f0 add %fp, -16, %g2
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009bb4: b2 86 7f ff addcc %i1, -1, %i1
2009bb8: 02 80 00 1a be 2009c20 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN
2009bbc: 82 10 00 1a mov %i2, %g1
2009bc0: c8 48 80 00 ldsb [ %g2 ], %g4
2009bc4: 80 a1 20 00 cmp %g4, 0
2009bc8: 02 80 00 16 be 2009c20 <_Objects_Get_name_as_string+0xf0>
2009bcc: c6 08 80 00 ldub [ %g2 ], %g3
2009bd0: 31 00 80 7d sethi %hi(0x201f400), %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(
2009bd4: b2 06 80 19 add %i2, %i1, %i1
2009bd8: 10 80 00 05 b 2009bec <_Objects_Get_name_as_string+0xbc>
2009bdc: b0 16 23 04 or %i0, 0x304, %i0
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009be0: 80 a1 20 00 cmp %g4, 0
2009be4: 02 80 00 0f be 2009c20 <_Objects_Get_name_as_string+0xf0>
2009be8: c6 08 80 00 ldub [ %g2 ], %g3
*d = (isprint((unsigned char)*s)) ? *s : '*';
2009bec: fa 06 00 00 ld [ %i0 ], %i5
2009bf0: 88 08 e0 ff and %g3, 0xff, %g4
2009bf4: 88 07 40 04 add %i5, %g4, %g4
2009bf8: c8 49 20 01 ldsb [ %g4 + 1 ], %g4
2009bfc: 80 89 20 97 btst 0x97, %g4
2009c00: 12 80 00 03 bne 2009c0c <_Objects_Get_name_as_string+0xdc>
2009c04: 84 00 a0 01 inc %g2
2009c08: 86 10 20 2a mov 0x2a, %g3
2009c0c: c6 28 40 00 stb %g3, [ %g1 ]
s = lname;
}
d = name;
if ( s ) {
for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) {
2009c10: 82 00 60 01 inc %g1
2009c14: 80 a0 40 19 cmp %g1, %i1
2009c18: 32 bf ff f2 bne,a 2009be0 <_Objects_Get_name_as_string+0xb0>
2009c1c: c8 48 80 00 ldsb [ %g2 ], %g4
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2009c20: 40 00 03 db call 200ab8c <_Thread_Enable_dispatch>
2009c24: c0 28 40 00 clrb [ %g1 ]
return name;
}
return NULL; /* unreachable path */
}
2009c28: 81 c7 e0 08 ret
2009c2c: 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;
2009c30: c2 00 61 f4 ld [ %g1 + 0x1f4 ], %g1
2009c34: 10 bf ff c7 b 2009b50 <_Objects_Get_name_as_string+0x20>
2009c38: f0 00 60 08 ld [ %g1 + 8 ], %i0
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE:
/* not supported */
#endif
case OBJECTS_ERROR:
return NULL;
2009c3c: b4 10 20 00 clr %i2
_Thread_Enable_dispatch();
return name;
}
return NULL; /* unreachable path */
}
2009c40: 81 c7 e0 08 ret
2009c44: 91 e8 00 1a restore %g0, %i2, %o0
lname[ 4 ] = '\0';
s = lname;
}
d = name;
if ( s ) {
2009c48: 80 a0 a0 00 cmp %g2, 0
2009c4c: 12 bf ff da bne 2009bb4 <_Objects_Get_name_as_string+0x84>
2009c50: 82 10 00 1a mov %i2, %g1
*d = (isprint((unsigned char)*s)) ? *s : '*';
}
}
*d = '\0';
_Thread_Enable_dispatch();
2009c54: 40 00 03 ce call 200ab8c <_Thread_Enable_dispatch>
2009c58: c0 28 40 00 clrb [ %g1 ]
2009c5c: 30 bf ff f3 b,a 2009c28 <_Objects_Get_name_as_string+0xf8>
02007fec <_Objects_Get_next>:
Objects_Information *information,
Objects_Id id,
Objects_Locations *location_p,
Objects_Id *next_id_p
)
{
2007fec: 9d e3 bf a0 save %sp, -96, %sp
Objects_Control *object;
Objects_Id next_id;
if ( !information )
return NULL;
2007ff0: 90 10 20 00 clr %o0
)
{
Objects_Control *object;
Objects_Id next_id;
if ( !information )
2007ff4: 80 a6 20 00 cmp %i0, 0
2007ff8: 02 80 00 19 be 200805c <_Objects_Get_next+0x70>
2007ffc: ba 10 00 18 mov %i0, %i5
return NULL;
if ( !location_p )
2008000: 80 a6 a0 00 cmp %i2, 0
2008004: 02 80 00 16 be 200805c <_Objects_Get_next+0x70>
2008008: 80 a6 e0 00 cmp %i3, 0
return NULL;
if ( !next_id_p )
200800c: 02 80 00 14 be 200805c <_Objects_Get_next+0x70>
2008010: 83 2e 60 10 sll %i1, 0x10, %g1
return NULL;
if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
2008014: 80 a0 60 00 cmp %g1, 0
2008018: 22 80 00 13 be,a 2008064 <_Objects_Get_next+0x78>
200801c: 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)
2008020: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2008024: 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);
2008028: 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)
200802c: 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);
2008030: 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)
2008034: 80 a0 80 01 cmp %g2, %g1
2008038: 0a 80 00 13 bcs 2008084 <_Objects_Get_next+0x98>
200803c: 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);
2008040: 40 00 00 18 call 20080a0 <_Objects_Get>
2008044: b2 06 60 01 inc %i1
next_id++;
} while (*location_p != OBJECTS_LOCAL);
2008048: c2 06 80 00 ld [ %i2 ], %g1
200804c: 80 a0 60 00 cmp %g1, 0
2008050: 32 bf ff f5 bne,a 2008024 <_Objects_Get_next+0x38>
2008054: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
*next_id_p = next_id;
2008058: f2 26 c0 00 st %i1, [ %i3 ]
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
}
200805c: 81 c7 e0 08 ret
2008060: 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)
2008064: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2
2008068: 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);
200806c: 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)
2008070: 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);
2008074: 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)
2008078: 80 a0 80 01 cmp %g2, %g1
200807c: 1a bf ff f1 bcc 2008040 <_Objects_Get_next+0x54> <== ALWAYS TAKEN
2008080: 94 10 00 1a mov %i2, %o2
{
*location_p = OBJECTS_ERROR;
2008084: 82 10 20 01 mov 1, %g1
2008088: c2 26 80 00 st %g1, [ %i2 ]
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
return 0;
200808c: 90 10 20 00 clr %o0
*next_id_p = next_id;
return object;
final:
*next_id_p = OBJECTS_ID_FINAL;
2008090: 82 10 3f ff mov -1, %g1
2008094: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
2008098: 81 c7 e0 08 ret
200809c: 91 e8 00 08 restore %g0, %o0, %o0
02008d94 <_Objects_Id_to_name>:
*/
Objects_Name_or_id_lookup_errors _Objects_Id_to_name (
Objects_Id id,
Objects_Name *name
)
{
2008d94: 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;
2008d98: 80 a6 20 00 cmp %i0, 0
2008d9c: 12 80 00 06 bne 2008db4 <_Objects_Id_to_name+0x20>
2008da0: 83 36 20 18 srl %i0, 0x18, %g1
2008da4: 03 00 80 7c sethi %hi(0x201f000), %g1
2008da8: c2 00 62 54 ld [ %g1 + 0x254 ], %g1 ! 201f254 <_Per_CPU_Information+0xc>
2008dac: f0 00 60 08 ld [ %g1 + 8 ], %i0
2008db0: 83 36 20 18 srl %i0, 0x18, %g1
2008db4: 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 )
2008db8: 84 00 7f ff add %g1, -1, %g2
2008dbc: 80 a0 a0 02 cmp %g2, 2
2008dc0: 18 80 00 12 bgu 2008e08 <_Objects_Id_to_name+0x74>
2008dc4: 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 ] )
2008dc8: 83 28 60 02 sll %g1, 2, %g1
2008dcc: 05 00 80 7b sethi %hi(0x201ec00), %g2
2008dd0: 84 10 a0 78 or %g2, 0x78, %g2 ! 201ec78 <_Objects_Information_table>
2008dd4: c2 00 80 01 ld [ %g2 + %g1 ], %g1
2008dd8: 80 a0 60 00 cmp %g1, 0
2008ddc: 02 80 00 0b be 2008e08 <_Objects_Id_to_name+0x74>
2008de0: 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 ];
2008de4: 85 28 a0 02 sll %g2, 2, %g2
2008de8: d0 00 40 02 ld [ %g1 + %g2 ], %o0
if ( !information )
2008dec: 80 a2 20 00 cmp %o0, 0
2008df0: 02 80 00 06 be 2008e08 <_Objects_Id_to_name+0x74> <== NEVER TAKEN
2008df4: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
#if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES)
if ( information->is_string )
2008df8: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1
2008dfc: 80 a0 60 00 cmp %g1, 0
2008e00: 02 80 00 04 be 2008e10 <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN
2008e04: 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;
}
2008e08: 81 c7 e0 08 ret
2008e0c: 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 );
2008e10: 7f ff ff c3 call 2008d1c <_Objects_Get>
2008e14: 94 07 bf fc add %fp, -4, %o2
if ( !the_object )
2008e18: 80 a2 20 00 cmp %o0, 0
2008e1c: 02 bf ff fb be 2008e08 <_Objects_Id_to_name+0x74>
2008e20: 01 00 00 00 nop
return OBJECTS_INVALID_ID;
*name = the_object->name;
2008e24: c2 02 20 0c ld [ %o0 + 0xc ], %g1
_Thread_Enable_dispatch();
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2008e28: 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();
2008e2c: 40 00 03 b0 call 2009cec <_Thread_Enable_dispatch>
2008e30: c2 26 40 00 st %g1, [ %i1 ]
return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL;
2008e34: 30 bf ff f5 b,a 2008e08 <_Objects_Id_to_name+0x74>
02008628 <_Objects_Shrink_information>:
*/
void _Objects_Shrink_information(
Objects_Information *information
)
{
2008628: 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 );
200862c: fa 16 20 0a lduh [ %i0 + 0xa ], %i5
block_count = (information->maximum - index_base) /
2008630: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4
2008634: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0
2008638: 92 10 00 1c mov %i4, %o1
200863c: 40 00 40 46 call 2018754 <.udiv>
2008640: 90 22 00 1d sub %o0, %i5, %o0
information->allocation_size;
for ( block = 0; block < block_count; block++ ) {
2008644: 80 a2 20 00 cmp %o0, 0
2008648: 02 80 00 34 be 2008718 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN
200864c: 01 00 00 00 nop
if ( information->inactive_per_block[ block ] ==
2008650: c8 06 20 30 ld [ %i0 + 0x30 ], %g4
2008654: c2 01 00 00 ld [ %g4 ], %g1
2008658: 80 a7 00 01 cmp %i4, %g1
200865c: 02 80 00 0f be 2008698 <_Objects_Shrink_information+0x70> <== NEVER TAKEN
2008660: 82 10 20 00 clr %g1
2008664: 10 80 00 07 b 2008680 <_Objects_Shrink_information+0x58>
2008668: b6 10 20 04 mov 4, %i3
* the_block - the block to remove
*
* Output parameters: NONE
*/
void _Objects_Shrink_information(
200866c: 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 ] ==
2008670: 80 a7 00 02 cmp %i4, %g2
2008674: 02 80 00 0a be 200869c <_Objects_Shrink_information+0x74>
2008678: ba 07 40 1c add %i5, %i4, %i5
200867c: 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++ ) {
2008680: 82 00 60 01 inc %g1
2008684: 80 a0 40 08 cmp %g1, %o0
2008688: 32 bf ff f9 bne,a 200866c <_Objects_Shrink_information+0x44>
200868c: c4 01 00 1b ld [ %g4 + %i3 ], %g2
2008690: 81 c7 e0 08 ret
2008694: 81 e8 00 00 restore
if ( information->inactive_per_block[ block ] ==
2008698: 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;
200869c: 10 80 00 06 b 20086b4 <_Objects_Shrink_information+0x8c>
20086a0: 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 );
20086a4: 80 a7 20 00 cmp %i4, 0
20086a8: 22 80 00 12 be,a 20086f0 <_Objects_Shrink_information+0xc8>
20086ac: 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;
20086b0: 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 );
20086b4: 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) &&
20086b8: 80 a0 40 1d cmp %g1, %i5
20086bc: 0a bf ff fa bcs 20086a4 <_Objects_Shrink_information+0x7c>
20086c0: f8 02 00 00 ld [ %o0 ], %i4
(index < (index_base + information->allocation_size))) {
20086c4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2
20086c8: 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) &&
20086cc: 80 a0 40 02 cmp %g1, %g2
20086d0: 1a bf ff f6 bcc 20086a8 <_Objects_Shrink_information+0x80>
20086d4: 80 a7 20 00 cmp %i4, 0
(index < (index_base + information->allocation_size))) {
_Chain_Extract( &extract_me->Node );
20086d8: 7f ff fb 53 call 2007424 <_Chain_Extract>
20086dc: 01 00 00 00 nop
}
}
while ( the_object );
20086e0: 80 a7 20 00 cmp %i4, 0
20086e4: 12 bf ff f4 bne 20086b4 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN
20086e8: 90 10 00 1c mov %i4, %o0
/*
* Free the memory and reset the structures in the object' information
*/
_Workspace_Free( information->object_blocks[ block ] );
20086ec: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED
20086f0: 40 00 07 d2 call 200a638 <_Workspace_Free>
20086f4: d0 00 40 1b ld [ %g1 + %i3 ], %o0
information->object_blocks[ block ] = NULL;
20086f8: c2 06 20 34 ld [ %i0 + 0x34 ], %g1
information->inactive_per_block[ block ] = 0;
information->inactive -= information->allocation_size;
20086fc: 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;
2008700: c0 20 40 1b clr [ %g1 + %i3 ]
information->inactive_per_block[ block ] = 0;
2008704: c6 06 20 30 ld [ %i0 + 0x30 ], %g3
information->inactive -= information->allocation_size;
2008708: 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;
200870c: c0 20 c0 1b clr [ %g3 + %i3 ]
information->inactive -= information->allocation_size;
2008710: 82 20 80 01 sub %g2, %g1, %g1
2008714: c2 36 20 2c sth %g1, [ %i0 + 0x2c ]
return;
2008718: 81 c7 e0 08 ret
200871c: 81 e8 00 00 restore
0200b630 <_POSIX_Message_queue_Receive_support>:
size_t msg_len,
unsigned int *msg_prio,
bool wait,
Watchdog_Interval timeout
)
{
200b630: 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(
200b634: 11 00 80 9f sethi %hi(0x2027c00), %o0
200b638: 92 10 00 18 mov %i0, %o1
200b63c: 90 12 20 3c or %o0, 0x3c, %o0
200b640: 40 00 0d 15 call 200ea94 <_Objects_Get>
200b644: 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 ) {
200b648: c2 07 bf f8 ld [ %fp + -8 ], %g1
200b64c: 80 a0 60 00 cmp %g1, 0
200b650: 22 80 00 08 be,a 200b670 <_POSIX_Message_queue_Receive_support+0x40>
200b654: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EBADF );
200b658: 40 00 2c f3 call 2016a24 <__errno>
200b65c: b0 10 3f ff mov -1, %i0
200b660: 82 10 20 09 mov 9, %g1
200b664: c2 22 00 00 st %g1, [ %o0 ]
}
200b668: 81 c7 e0 08 ret
200b66c: 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 ) {
200b670: 84 08 60 03 and %g1, 3, %g2
200b674: 80 a0 a0 01 cmp %g2, 1
200b678: 02 80 00 37 be 200b754 <_POSIX_Message_queue_Receive_support+0x124>
200b67c: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EBADF );
}
the_mq = the_mq_fd->Queue;
200b680: d0 02 20 10 ld [ %o0 + 0x10 ], %o0
if ( msg_len < the_mq->Message_queue.maximum_message_size ) {
200b684: c4 02 20 68 ld [ %o0 + 0x68 ], %g2
200b688: 80 a0 80 1a cmp %g2, %i2
200b68c: 18 80 00 21 bgu 200b710 <_POSIX_Message_queue_Receive_support+0xe0>
200b690: 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;
200b694: c4 27 bf fc st %g2, [ %fp + -4 ]
/*
* A timed receive with a bad time will do a poll regardless.
*/
if ( wait )
200b698: 80 a7 20 00 cmp %i4, 0
200b69c: 12 80 00 18 bne 200b6fc <_POSIX_Message_queue_Receive_support+0xcc><== ALWAYS TAKEN
200b6a0: 98 10 20 00 clr %o4
do_wait = wait;
/*
* Now perform the actual message receive
*/
_CORE_message_queue_Seize(
200b6a4: 9a 10 00 1d mov %i5, %o5
200b6a8: 90 02 20 1c add %o0, 0x1c, %o0
200b6ac: 92 10 00 18 mov %i0, %o1
200b6b0: 94 10 00 19 mov %i1, %o2
200b6b4: 96 07 bf fc add %fp, -4, %o3
200b6b8: 40 00 08 92 call 200d900 <_CORE_message_queue_Seize>
200b6bc: 98 0b 20 01 and %o4, 1, %o4
&length_out,
do_wait,
timeout
);
_Thread_Enable_dispatch();
200b6c0: 40 00 10 df call 200fa3c <_Thread_Enable_dispatch>
200b6c4: 3b 00 80 9f sethi %hi(0x2027c00), %i5
*msg_prio =
_POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count);
200b6c8: ba 17 60 a8 or %i5, 0xa8, %i5 ! 2027ca8 <_Per_CPU_Information>
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: c4 00 60 24 ld [ %g1 + 0x24 ], %g2
if ( !_Thread_Executing->Wait.return_code )
200b6d4: c6 00 60 34 ld [ %g1 + 0x34 ], %g3
200b6d8: 83 38 a0 1f sra %g2, 0x1f, %g1
200b6dc: 84 18 40 02 xor %g1, %g2, %g2
200b6e0: 82 20 80 01 sub %g2, %g1, %g1
200b6e4: 80 a0 e0 00 cmp %g3, 0
200b6e8: 12 80 00 12 bne 200b730 <_POSIX_Message_queue_Receive_support+0x100>
200b6ec: c2 26 c0 00 st %g1, [ %i3 ]
return length_out;
200b6f0: f0 07 bf fc ld [ %fp + -4 ], %i0
200b6f4: 81 c7 e0 08 ret
200b6f8: 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;
200b6fc: 05 00 00 10 sethi %hi(0x4000), %g2
200b700: 82 08 40 02 and %g1, %g2, %g1
200b704: 80 a0 00 01 cmp %g0, %g1
200b708: 10 bf ff e7 b 200b6a4 <_POSIX_Message_queue_Receive_support+0x74>
200b70c: 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();
200b710: 40 00 10 cb call 200fa3c <_Thread_Enable_dispatch>
200b714: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EMSGSIZE );
200b718: 40 00 2c c3 call 2016a24 <__errno>
200b71c: 01 00 00 00 nop
200b720: 82 10 20 7a mov 0x7a, %g1 ! 7a <PROM_START+0x7a>
200b724: c2 22 00 00 st %g1, [ %o0 ]
200b728: 81 c7 e0 08 ret
200b72c: 81 e8 00 00 restore
_POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count);
if ( !_Thread_Executing->Wait.return_code )
return length_out;
rtems_set_errno_and_return_minus_one(
200b730: 40 00 2c bd call 2016a24 <__errno>
200b734: b0 10 3f ff mov -1, %i0
200b738: c2 07 60 0c ld [ %i5 + 0xc ], %g1
200b73c: b6 10 00 08 mov %o0, %i3
200b740: 40 00 00 a3 call 200b9cc <_POSIX_Message_queue_Translate_core_message_queue_return_code>
200b744: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
200b748: d0 26 c0 00 st %o0, [ %i3 ]
200b74c: 81 c7 e0 08 ret
200b750: 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();
200b754: 40 00 10 ba call 200fa3c <_Thread_Enable_dispatch>
200b758: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EBADF );
200b75c: 40 00 2c b2 call 2016a24 <__errno>
200b760: 01 00 00 00 nop
200b764: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
200b768: c2 22 00 00 st %g1, [ %o0 ]
200b76c: 81 c7 e0 08 ret
200b770: 81 e8 00 00 restore
0200c244 <_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 ];
200c244: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
200c248: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2
200c24c: 80 a0 a0 00 cmp %g2, 0
200c250: 12 80 00 06 bne 200c268 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN
200c254: 01 00 00 00 nop
200c258: c4 00 60 dc ld [ %g1 + 0xdc ], %g2
200c25c: 80 a0 a0 01 cmp %g2, 1
200c260: 22 80 00 05 be,a 200c274 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30>
200c264: 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();
200c268: 82 13 c0 00 mov %o7, %g1
200c26c: 7f ff f3 d0 call 20091ac <_Thread_Enable_dispatch>
200c270: 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 &&
200c274: 80 a0 60 00 cmp %g1, 0
200c278: 02 bf ff fc be 200c268 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24>
200c27c: 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--;
200c280: 03 00 80 60 sethi %hi(0x2018000), %g1
200c284: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 2018060 <_Thread_Dispatch_disable_level>
thread_support->cancelation_requested ) {
_Thread_Unnest_dispatch();
_POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED );
200c288: 92 10 3f ff mov -1, %o1
200c28c: 84 00 bf ff add %g2, -1, %g2
200c290: c4 20 60 60 st %g2, [ %g1 + 0x60 ]
return _Thread_Dispatch_disable_level;
200c294: c2 00 60 60 ld [ %g1 + 0x60 ], %g1
200c298: 82 13 c0 00 mov %o7, %g1
200c29c: 40 00 01 d7 call 200c9f8 <_POSIX_Thread_Exit>
200c2a0: 9e 10 40 00 mov %g1, %o7
0200d6a4 <_POSIX_Thread_Translate_sched_param>:
int policy,
struct sched_param *param,
Thread_CPU_budget_algorithms *budget_algorithm,
Thread_CPU_budget_algorithm_callout *budget_callout
)
{
200d6a4: 9d e3 bf a0 save %sp, -96, %sp
if ( !_POSIX_Priority_Is_valid( param->sched_priority ) )
200d6a8: d0 06 40 00 ld [ %i1 ], %o0
200d6ac: 7f ff ff f1 call 200d670 <_POSIX_Priority_Is_valid>
200d6b0: ba 10 00 18 mov %i0, %i5
200d6b4: 80 8a 20 ff btst 0xff, %o0
200d6b8: 02 80 00 34 be 200d788 <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN
200d6bc: b0 10 20 16 mov 0x16, %i0
return EINVAL;
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
200d6c0: c0 26 80 00 clr [ %i2 ]
*budget_callout = NULL;
200d6c4: c0 26 c0 00 clr [ %i3 ]
if ( policy == SCHED_OTHER ) {
200d6c8: 80 a7 60 00 cmp %i5, 0
200d6cc: 02 80 00 2d be 200d780 <_POSIX_Thread_Translate_sched_param+0xdc>
200d6d0: b0 10 20 00 clr %i0
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
return 0;
}
if ( policy == SCHED_FIFO ) {
200d6d4: 80 a7 60 01 cmp %i5, 1
200d6d8: 02 80 00 2c be 200d788 <_POSIX_Thread_Translate_sched_param+0xe4>
200d6dc: 80 a7 60 02 cmp %i5, 2
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE;
return 0;
}
if ( policy == SCHED_RR ) {
200d6e0: 02 80 00 2c be 200d790 <_POSIX_Thread_Translate_sched_param+0xec>
200d6e4: 80 a7 60 04 cmp %i5, 4
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE;
return 0;
}
if ( policy == SCHED_SPORADIC ) {
200d6e8: 12 80 00 28 bne 200d788 <_POSIX_Thread_Translate_sched_param+0xe4>
200d6ec: b0 10 20 16 mov 0x16, %i0
if ( (param->sched_ss_repl_period.tv_sec == 0) &&
200d6f0: c2 06 60 08 ld [ %i1 + 8 ], %g1
200d6f4: 80 a0 60 00 cmp %g1, 0
200d6f8: 32 80 00 07 bne,a 200d714 <_POSIX_Thread_Translate_sched_param+0x70>
200d6fc: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200d700: c2 06 60 0c ld [ %i1 + 0xc ], %g1
200d704: 80 a0 60 00 cmp %g1, 0
200d708: 02 80 00 23 be 200d794 <_POSIX_Thread_Translate_sched_param+0xf0>
200d70c: 01 00 00 00 nop
(param->sched_ss_repl_period.tv_nsec == 0) )
return EINVAL;
if ( (param->sched_ss_init_budget.tv_sec == 0) &&
200d710: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
200d714: 80 a0 60 00 cmp %g1, 0
200d718: 12 80 00 06 bne 200d730 <_POSIX_Thread_Translate_sched_param+0x8c>
200d71c: 01 00 00 00 nop
200d720: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200d724: 80 a0 60 00 cmp %g1, 0
200d728: 02 80 00 18 be 200d788 <_POSIX_Thread_Translate_sched_param+0xe4>
200d72c: 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 ) <
200d730: 7f ff f5 2a call 200abd8 <_Timespec_To_ticks>
200d734: 90 06 60 08 add %i1, 8, %o0
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
return EINVAL;
200d738: 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 ) <
200d73c: ba 10 00 08 mov %o0, %i5
_Timespec_To_ticks( ¶m->sched_ss_init_budget ) )
200d740: 7f ff f5 26 call 200abd8 <_Timespec_To_ticks>
200d744: 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 ) <
200d748: 80 a7 40 08 cmp %i5, %o0
200d74c: 0a 80 00 12 bcs 200d794 <_POSIX_Thread_Translate_sched_param+0xf0>
200d750: 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 ) )
200d754: 7f ff ff c7 call 200d670 <_POSIX_Priority_Is_valid>
200d758: d0 06 60 04 ld [ %i1 + 4 ], %o0
200d75c: 80 8a 20 ff btst 0xff, %o0
200d760: 02 80 00 0a be 200d788 <_POSIX_Thread_Translate_sched_param+0xe4>
200d764: 82 10 20 03 mov 3, %g1
return EINVAL;
*budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT;
200d768: c2 26 80 00 st %g1, [ %i2 ]
*budget_callout = _POSIX_Threads_Sporadic_budget_callout;
200d76c: 03 00 80 1a sethi %hi(0x2006800), %g1
200d770: 82 10 63 d8 or %g1, 0x3d8, %g1 ! 2006bd8 <_POSIX_Threads_Sporadic_budget_callout>
200d774: c2 26 c0 00 st %g1, [ %i3 ]
return 0;
}
return EINVAL;
}
200d778: 81 c7 e0 08 ret
200d77c: 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;
200d780: 82 10 20 01 mov 1, %g1
200d784: c2 26 80 00 st %g1, [ %i2 ]
return 0;
200d788: 81 c7 e0 08 ret
200d78c: 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;
200d790: fa 26 80 00 st %i5, [ %i2 ]
return 0;
200d794: 81 c7 e0 08 ret
200d798: 81 e8 00 00 restore
020068d8 <_POSIX_Threads_Initialize_user_threads_body>:
*
* Output parameters: NONE
*/
void _POSIX_Threads_Initialize_user_threads_body(void)
{
20068d8: 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;
20068dc: 03 00 80 75 sethi %hi(0x201d400), %g1
20068e0: 82 10 62 f4 or %g1, 0x2f4, %g1 ! 201d6f4 <Configuration_POSIX_API>
maximum = Configuration_POSIX_API.number_of_initialization_threads;
20068e4: f6 00 60 30 ld [ %g1 + 0x30 ], %i3
if ( !user_threads || maximum == 0 )
20068e8: 80 a6 e0 00 cmp %i3, 0
20068ec: 02 80 00 18 be 200694c <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
20068f0: fa 00 60 34 ld [ %g1 + 0x34 ], %i5
20068f4: 80 a7 60 00 cmp %i5, 0
20068f8: 02 80 00 15 be 200694c <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN
20068fc: 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 );
2006900: 40 00 1b a7 call 200d79c <pthread_attr_init>
2006904: 90 07 bf bc add %fp, -68, %o0
(void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED );
2006908: 92 10 20 02 mov 2, %o1
200690c: 40 00 1b b0 call 200d7cc <pthread_attr_setinheritsched>
2006910: 90 07 bf bc add %fp, -68, %o0
(void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size);
2006914: d2 07 60 04 ld [ %i5 + 4 ], %o1
2006918: 40 00 1b bd call 200d80c <pthread_attr_setstacksize>
200691c: 90 07 bf bc add %fp, -68, %o0
status = pthread_create(
2006920: d4 07 40 00 ld [ %i5 ], %o2
2006924: 90 07 bf fc add %fp, -4, %o0
2006928: 92 07 bf bc add %fp, -68, %o1
200692c: 7f ff ff 28 call 20065cc <pthread_create>
2006930: 96 10 20 00 clr %o3
&thread_id,
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
2006934: 94 92 20 00 orcc %o0, 0, %o2
2006938: 12 80 00 07 bne 2006954 <_POSIX_Threads_Initialize_user_threads_body+0x7c>
200693c: 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++ ) {
2006940: 80 a6 c0 1c cmp %i3, %i4
2006944: 18 bf ff ef bgu 2006900 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN
2006948: ba 07 60 08 add %i5, 8, %i5
200694c: 81 c7 e0 08 ret
2006950: 81 e8 00 00 restore
&attr,
user_threads[ index ].thread_entry,
NULL
);
if ( status )
_Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status );
2006954: 90 10 20 02 mov 2, %o0
2006958: 40 00 08 4c call 2008a88 <_Internal_error_Occurred>
200695c: 92 10 20 01 mov 1, %o1
0200cb10 <_POSIX_Threads_Sporadic_budget_TSR>:
*/
void _POSIX_Threads_Sporadic_budget_TSR(
Objects_Id id __attribute__((unused)),
void *argument
)
{
200cb10: 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 ];
200cb14: 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 );
200cb18: 40 00 04 09 call 200db3c <_Timespec_To_ticks>
200cb1c: 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);
200cb20: c4 07 60 88 ld [ %i5 + 0x88 ], %g2
200cb24: 03 00 80 73 sethi %hi(0x201cc00), %g1
200cb28: d2 08 60 6c ldub [ %g1 + 0x6c ], %o1 ! 201cc6c <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 ) {
200cb2c: c2 06 60 1c ld [ %i1 + 0x1c ], %g1
200cb30: 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;
200cb34: 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 ) {
200cb38: 80 a0 60 00 cmp %g1, 0
200cb3c: 12 80 00 06 bne 200cb54 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN
200cb40: 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 ) {
200cb44: c2 06 60 14 ld [ %i1 + 0x14 ], %g1
200cb48: 80 a0 40 09 cmp %g1, %o1
200cb4c: 38 80 00 09 bgu,a 200cb70 <_POSIX_Threads_Sporadic_budget_TSR+0x60>
200cb50: 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 );
200cb54: 40 00 03 fa call 200db3c <_Timespec_To_ticks>
200cb58: 90 07 60 90 add %i5, 0x90, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cb5c: 31 00 80 76 sethi %hi(0x201d800), %i0
200cb60: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200cb64: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cb68: 7f ff f5 ce call 200a2a0 <_Watchdog_Insert>
200cb6c: 91 ee 22 4c restore %i0, 0x24c, %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 );
200cb70: 7f ff f0 d1 call 2008eb4 <_Thread_Change_priority>
200cb74: 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 );
200cb78: 40 00 03 f1 call 200db3c <_Timespec_To_ticks>
200cb7c: 90 07 60 90 add %i5, 0x90, %o0
200cb80: 31 00 80 76 sethi %hi(0x201d800), %i0
200cb84: b2 07 60 a8 add %i5, 0xa8, %i1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
200cb88: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200cb8c: 7f ff f5 c5 call 200a2a0 <_Watchdog_Insert>
200cb90: 91 ee 22 4c restore %i0, 0x24c, %o0
0200cb94 <_POSIX_Threads_Sporadic_budget_callout>:
)
{
POSIX_API_Control *api;
uint32_t new_priority;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200cb94: c4 02 21 5c ld [ %o0 + 0x15c ], %g2
200cb98: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3
200cb9c: 05 00 80 73 sethi %hi(0x201cc00), %g2
200cba0: d2 08 a0 6c ldub [ %g2 + 0x6c ], %o1 ! 201cc6c <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 ) {
200cba4: c4 02 20 1c ld [ %o0 + 0x1c ], %g2
200cba8: 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 */
200cbac: 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;
200cbb0: 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 ) {
200cbb4: 80 a0 a0 00 cmp %g2, 0
200cbb8: 12 80 00 06 bne 200cbd0 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN
200cbbc: 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 ) {
200cbc0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200cbc4: 80 a0 40 09 cmp %g1, %o1
200cbc8: 0a 80 00 04 bcs 200cbd8 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN
200cbcc: 94 10 20 01 mov 1, %o2
200cbd0: 81 c3 e0 08 retl <== NOT EXECUTED
200cbd4: 01 00 00 00 nop <== NOT EXECUTED
_Thread_Change_priority( the_thread, new_priority, true );
200cbd8: 82 13 c0 00 mov %o7, %g1
200cbdc: 7f ff f0 b6 call 2008eb4 <_Thread_Change_priority>
200cbe0: 9e 10 40 00 mov %g1, %o7
0200efc4 <_POSIX_Threads_cancel_run>:
#include <rtems/posix/threadsup.h>
void _POSIX_Threads_cancel_run(
Thread_Control *the_thread
)
{
200efc4: 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 ];
200efc8: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
handler_stack = &thread_support->Cancellation_Handlers;
thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE;
200efcc: 84 10 20 01 mov 1, %g2
while ( !_Chain_Is_empty( handler_stack ) ) {
200efd0: 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 );
200efd4: b6 07 20 e8 add %i4, 0xe8, %i3
200efd8: 80 a0 40 1b cmp %g1, %i3
200efdc: 02 80 00 14 be 200f02c <_POSIX_Threads_cancel_run+0x68>
200efe0: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ]
_ISR_Disable( level );
200efe4: 7f ff cc 86 call 20021fc <sparc_disable_interrupts>
200efe8: 01 00 00 00 nop
handler = (POSIX_Cancel_Handler_control *)
200efec: fa 07 20 ec ld [ %i4 + 0xec ], %i5
)
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
200eff0: c4 07 40 00 ld [ %i5 ], %g2
previous = the_node->previous;
200eff4: c2 07 60 04 ld [ %i5 + 4 ], %g1
next->previous = previous;
200eff8: c2 20 a0 04 st %g1, [ %g2 + 4 ]
previous->next = next;
200effc: c4 20 40 00 st %g2, [ %g1 ]
_Chain_Tail( handler_stack )->previous;
_Chain_Extract_unprotected( &handler->Node );
_ISR_Enable( level );
200f000: 7f ff cc 83 call 200220c <sparc_enable_interrupts>
200f004: 01 00 00 00 nop
(*handler->routine)( handler->arg );
200f008: c2 07 60 08 ld [ %i5 + 8 ], %g1
200f00c: 9f c0 40 00 call %g1
200f010: d0 07 60 0c ld [ %i5 + 0xc ], %o0
_Workspace_Free( handler );
200f014: 7f ff ed 89 call 200a638 <_Workspace_Free>
200f018: 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 ) ) {
200f01c: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1
200f020: 80 a0 40 1b cmp %g1, %i3
200f024: 12 bf ff f0 bne 200efe4 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN
200f028: 01 00 00 00 nop
200f02c: 81 c7 e0 08 ret
200f030: 81 e8 00 00 restore
020066ac <_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)
{
20066ac: 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;
20066b0: c4 06 60 68 ld [ %i1 + 0x68 ], %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
20066b4: 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;
20066b8: 84 00 a0 01 inc %g2
/* The timer must be reprogrammed */
if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) ||
20066bc: 80 a0 60 00 cmp %g1, 0
20066c0: 12 80 00 0e bne 20066f8 <_POSIX_Timer_TSR+0x4c>
20066c4: c4 26 60 68 st %g2, [ %i1 + 0x68 ]
20066c8: c2 06 60 58 ld [ %i1 + 0x58 ], %g1
20066cc: 80 a0 60 00 cmp %g1, 0
20066d0: 32 80 00 0b bne,a 20066fc <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN
20066d4: 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;
20066d8: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED
20066dc: 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 ) ) {
20066e0: d0 06 60 38 ld [ %i1 + 0x38 ], %o0
20066e4: 40 00 1a 2e call 200cf9c <pthread_kill>
20066e8: 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;
20066ec: c0 26 60 68 clr [ %i1 + 0x68 ]
20066f0: 81 c7 e0 08 ret
20066f4: 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(
20066f8: d2 06 60 64 ld [ %i1 + 0x64 ], %o1
20066fc: d4 06 60 08 ld [ %i1 + 8 ], %o2
2006700: 90 06 60 10 add %i1, 0x10, %o0
2006704: 98 10 00 19 mov %i1, %o4
2006708: 17 00 80 19 sethi %hi(0x2006400), %o3
200670c: 40 00 1b 4b call 200d438 <_POSIX_Timer_Insert_helper>
2006710: 96 12 e2 ac or %o3, 0x2ac, %o3 ! 20066ac <_POSIX_Timer_TSR>
ptimer->ticks,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated )
2006714: 80 8a 20 ff btst 0xff, %o0
2006718: 02 bf ff f6 be 20066f0 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN
200671c: 01 00 00 00 nop
return;
/* Store the time when the timer was started again */
_TOD_Get( &ptimer->time );
2006720: 40 00 05 e0 call 2007ea0 <_TOD_Get>
2006724: 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;
2006728: 82 10 20 03 mov 3, %g1
200672c: 10 bf ff ed b 20066e0 <_POSIX_Timer_TSR+0x34>
2006730: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ]
0200f0ec <_POSIX_signals_Check_signal>:
bool _POSIX_signals_Check_signal(
POSIX_API_Control *api,
int signo,
bool is_global
)
{
200f0ec: 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,
200f0f0: 98 10 20 01 mov 1, %o4
200f0f4: 90 10 00 18 mov %i0, %o0
200f0f8: 92 10 00 19 mov %i1, %o1
200f0fc: 94 07 bf f4 add %fp, -12, %o2
200f100: 40 00 00 2e call 200f1b8 <_POSIX_signals_Clear_signals>
200f104: 96 10 00 1a mov %i2, %o3
200f108: 80 8a 20 ff btst 0xff, %o0
200f10c: 02 80 00 23 be 200f198 <_POSIX_signals_Check_signal+0xac>
200f110: 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 )
200f114: 85 2e 60 02 sll %i1, 2, %g2
200f118: 37 00 80 77 sethi %hi(0x201dc00), %i3
200f11c: b9 2e 60 04 sll %i1, 4, %i4
200f120: b6 16 e3 20 or %i3, 0x320, %i3
200f124: b8 27 00 02 sub %i4, %g2, %i4
200f128: 84 06 c0 1c add %i3, %i4, %g2
200f12c: fa 00 a0 08 ld [ %g2 + 8 ], %i5
200f130: 80 a7 60 01 cmp %i5, 1
200f134: 02 80 00 19 be 200f198 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN
200f138: 21 00 80 77 sethi %hi(0x201dc00), %l0
return false;
/*
* Block the signals requested in sa_mask
*/
saved_signals_blocked = api->signals_blocked;
200f13c: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2
api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask;
200f140: 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,
200f144: a0 14 22 c8 or %l0, 0x2c8, %l0
200f148: 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;
200f14c: 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,
200f150: 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;
200f154: 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,
200f158: 92 02 60 20 add %o1, 0x20, %o1
200f15c: 40 00 04 6d call 2010310 <memcpy>
200f160: 94 10 20 28 mov 0x28, %o2
sizeof( Thread_Wait_information ));
/*
* Here, the signal handler function executes
*/
switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) {
200f164: c2 06 c0 1c ld [ %i3 + %i4 ], %g1
200f168: 80 a0 60 02 cmp %g1, 2
200f16c: 02 80 00 0e be 200f1a4 <_POSIX_signals_Check_signal+0xb8>
200f170: 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 );
200f174: 9f c7 40 00 call %i5
200f178: 01 00 00 00 nop
}
/*
* Restore the blocking information
*/
memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information,
200f17c: d0 04 20 0c ld [ %l0 + 0xc ], %o0
200f180: 92 07 bf cc add %fp, -52, %o1
200f184: 90 02 20 20 add %o0, 0x20, %o0
200f188: 40 00 04 62 call 2010310 <memcpy>
200f18c: 94 10 20 28 mov 0x28, %o2
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
return true;
200f190: 82 10 20 01 mov 1, %g1
sizeof( Thread_Wait_information ));
/*
* Restore the previous set of blocked signals
*/
api->signals_blocked = saved_signals_blocked;
200f194: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ]
return true;
}
200f198: b0 08 60 01 and %g1, 1, %i0
200f19c: 81 c7 e0 08 ret
200f1a0: 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)(
200f1a4: 92 07 bf f4 add %fp, -12, %o1
200f1a8: 9f c7 40 00 call %i5
200f1ac: 94 10 20 00 clr %o2
signo,
&siginfo_struct,
NULL /* context is undefined per 1003.1b-1993, p. 66 */
);
break;
200f1b0: 10 bf ff f4 b 200f180 <_POSIX_signals_Check_signal+0x94>
200f1b4: d0 04 20 0c ld [ %l0 + 0xc ], %o0
0200f8f4 <_POSIX_signals_Clear_process_signals>:
*/
void _POSIX_signals_Clear_process_signals(
int signo
)
{
200f8f4: 9d e3 bf a0 save %sp, -96, %sp
clear_signal = true;
mask = signo_to_mask( signo );
ISR_Level level;
_ISR_Disable( level );
200f8f8: 7f ff ca 41 call 20021fc <sparc_disable_interrupts>
200f8fc: 01 00 00 00 nop
if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) {
200f900: 85 2e 20 04 sll %i0, 4, %g2
200f904: 83 2e 20 02 sll %i0, 2, %g1
200f908: 82 20 80 01 sub %g2, %g1, %g1
200f90c: 05 00 80 77 sethi %hi(0x201dc00), %g2
200f910: 84 10 a3 20 or %g2, 0x320, %g2 ! 201df20 <_POSIX_signals_Vectors>
200f914: c4 00 80 01 ld [ %g2 + %g1 ], %g2
200f918: 80 a0 a0 02 cmp %g2, 2
200f91c: 02 80 00 0b be 200f948 <_POSIX_signals_Clear_process_signals+0x54>
200f920: 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;
200f924: 03 00 80 78 sethi %hi(0x201e000), %g1
200f928: c4 00 61 14 ld [ %g1 + 0x114 ], %g2 ! 201e114 <_POSIX_signals_Pending>
200f92c: 86 10 20 01 mov 1, %g3
200f930: b0 06 3f ff add %i0, -1, %i0
200f934: b1 28 c0 18 sll %g3, %i0, %i0
200f938: b0 28 80 18 andn %g2, %i0, %i0
200f93c: f0 20 61 14 st %i0, [ %g1 + 0x114 ]
}
_ISR_Enable( level );
200f940: 7f ff ca 33 call 200220c <sparc_enable_interrupts>
200f944: 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 ] ) )
200f948: 84 10 a1 18 or %g2, 0x118, %g2
200f94c: c6 00 40 02 ld [ %g1 + %g2 ], %g3
200f950: 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 );
200f954: 82 00 60 04 add %g1, 4, %g1
200f958: 80 a0 c0 01 cmp %g3, %g1
200f95c: 02 bf ff f3 be 200f928 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN
200f960: 03 00 80 78 sethi %hi(0x201e000), %g1
clear_signal = false;
}
if ( clear_signal ) {
_POSIX_signals_Pending &= ~mask;
}
_ISR_Enable( level );
200f964: 7f ff ca 2a call 200220c <sparc_enable_interrupts> <== NOT EXECUTED
200f968: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
02007104 <_POSIX_signals_Get_lowest>:
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
2007104: 82 10 20 1b mov 0x1b, %g1
2007108: 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(
200710c: 84 00 7f ff add %g1, -1, %g2
2007110: 85 28 c0 02 sll %g3, %g2, %g2
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
if ( set & signo_to_mask( signo ) ) {
2007114: 80 88 80 08 btst %g2, %o0
2007118: 12 80 00 11 bne 200715c <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
200711c: 01 00 00 00 nop
sigset_t set
)
{
int signo;
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
2007120: 82 00 60 01 inc %g1
2007124: 80 a0 60 20 cmp %g1, 0x20
2007128: 12 bf ff fa bne 2007110 <_POSIX_signals_Get_lowest+0xc>
200712c: 84 00 7f ff add %g1, -1, %g2
2007130: 82 10 20 01 mov 1, %g1
2007134: 10 80 00 05 b 2007148 <_POSIX_signals_Get_lowest+0x44>
2007138: 86 10 20 01 mov 1, %g3
*/
#if (SIGHUP != 1)
#error "Assumption that SIGHUP==1 violated!!"
#endif
for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) {
200713c: 80 a0 60 1b cmp %g1, 0x1b
2007140: 02 80 00 07 be 200715c <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN
2007144: 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(
2007148: 84 00 7f ff add %g1, -1, %g2
200714c: 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 ) ) {
2007150: 80 88 80 08 btst %g2, %o0
2007154: 22 bf ff fa be,a 200713c <_POSIX_signals_Get_lowest+0x38>
2007158: 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;
}
200715c: 81 c3 e0 08 retl
2007160: 90 10 00 01 mov %g1, %o0
0200c6cc <_POSIX_signals_Post_switch_extension>:
*/
void _POSIX_signals_Post_switch_extension(
Thread_Control *the_thread
)
{
200c6cc: 9d e3 bf a0 save %sp, -96, %sp
POSIX_API_Control *api;
int signo;
ISR_Level level;
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
200c6d0: f8 06 21 5c ld [ %i0 + 0x15c ], %i4
/*
* api may be NULL in case of a thread close in progress
*/
if ( !api )
200c6d4: 80 a7 20 00 cmp %i4, 0
200c6d8: 02 80 00 34 be 200c7a8 <_POSIX_signals_Post_switch_extension+0xdc>
200c6dc: 01 00 00 00 nop
*
* 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 );
200c6e0: 7f ff d6 c7 call 20021fc <sparc_disable_interrupts>
200c6e4: 37 00 80 78 sethi %hi(0x201e000), %i3
200c6e8: b0 10 00 08 mov %o0, %i0
200c6ec: b6 16 e1 14 or %i3, 0x114, %i3
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c6f0: c6 06 c0 00 ld [ %i3 ], %g3
200c6f4: 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 &
200c6f8: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c6fc: 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 &
200c700: 80 a8 40 02 andncc %g1, %g2, %g0
200c704: 02 80 00 27 be 200c7a0 <_POSIX_signals_Post_switch_extension+0xd4>
200c708: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
200c70c: 7f ff d6 c0 call 200220c <sparc_enable_interrupts>
200c710: ba 10 20 1b mov 0x1b, %i5 ! 1b <PROM_START+0x1b>
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
_POSIX_signals_Check_signal( api, signo, false );
200c714: 92 10 00 1d mov %i5, %o1
200c718: 94 10 20 00 clr %o2
200c71c: 40 00 0a 74 call 200f0ec <_POSIX_signals_Check_signal>
200c720: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200c724: 92 10 00 1d mov %i5, %o1
200c728: 90 10 00 1c mov %i4, %o0
200c72c: 40 00 0a 70 call 200f0ec <_POSIX_signals_Check_signal>
200c730: 94 10 20 01 mov 1, %o2
_ISR_Enable( level );
break;
}
_ISR_Enable( level );
for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) {
200c734: ba 07 60 01 inc %i5
200c738: 80 a7 60 20 cmp %i5, 0x20
200c73c: 12 bf ff f7 bne 200c718 <_POSIX_signals_Post_switch_extension+0x4c>
200c740: 92 10 00 1d mov %i5, %o1
200c744: 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 );
200c748: 92 10 00 1d mov %i5, %o1
200c74c: 94 10 20 00 clr %o2
200c750: 40 00 0a 67 call 200f0ec <_POSIX_signals_Check_signal>
200c754: 90 10 00 1c mov %i4, %o0
_POSIX_signals_Check_signal( api, signo, true );
200c758: 92 10 00 1d mov %i5, %o1
200c75c: 90 10 00 1c mov %i4, %o0
200c760: 40 00 0a 63 call 200f0ec <_POSIX_signals_Check_signal>
200c764: 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++ ) {
200c768: ba 07 60 01 inc %i5
200c76c: 80 a7 60 1b cmp %i5, 0x1b
200c770: 12 bf ff f7 bne 200c74c <_POSIX_signals_Post_switch_extension+0x80>
200c774: 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 );
200c778: 7f ff d6 a1 call 20021fc <sparc_disable_interrupts>
200c77c: 01 00 00 00 nop
200c780: b0 10 00 08 mov %o0, %i0
if ( !(~api->signals_blocked &
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c784: c6 06 c0 00 ld [ %i3 ], %g3
200c788: 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 &
200c78c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2
(api->signals_pending | _POSIX_signals_Pending)) ) {
200c790: 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 &
200c794: 80 a8 40 02 andncc %g1, %g2, %g0
200c798: 12 bf ff dd bne 200c70c <_POSIX_signals_Post_switch_extension+0x40><== NEVER TAKEN
200c79c: 01 00 00 00 nop
(api->signals_pending | _POSIX_signals_Pending)) ) {
_ISR_Enable( level );
200c7a0: 7f ff d6 9b call 200220c <sparc_enable_interrupts>
200c7a4: 81 e8 00 00 restore
200c7a8: 81 c7 e0 08 ret
200c7ac: 81 e8 00 00 restore
0201a6c4 <_POSIX_signals_Unblock_thread>:
bool _POSIX_signals_Unblock_thread(
Thread_Control *the_thread,
int signo,
siginfo_t *info
)
{
201a6c4: 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 ) ) {
201a6c8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
201a6cc: 05 04 00 20 sethi %hi(0x10008000), %g2
201a6d0: 86 10 20 01 mov 1, %g3
201a6d4: ba 06 7f ff add %i1, -1, %i5
201a6d8: 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 ];
201a6dc: 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 ) ) {
201a6e0: 80 a1 00 02 cmp %g4, %g2
201a6e4: 02 80 00 1c be 201a754 <_POSIX_signals_Unblock_thread+0x90>
201a6e8: 9f 28 c0 1d sll %g3, %i5, %o7
}
/*
* Thread is not waiting due to a sigwait.
*/
if ( ~api->signals_blocked & mask ) {
201a6ec: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2
201a6f0: 80 ab c0 02 andncc %o7, %g2, %g0
201a6f4: 02 80 00 15 be 201a748 <_POSIX_signals_Unblock_thread+0x84>
201a6f8: ba 10 20 00 clr %i5
201a6fc: 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 ) ) {
201a700: 80 88 40 02 btst %g1, %g2
201a704: 02 80 00 29 be 201a7a8 <_POSIX_signals_Unblock_thread+0xe4>
201a708: 80 a0 60 00 cmp %g1, 0
the_thread->Wait.return_code = EINTR;
201a70c: 84 10 20 04 mov 4, %g2
201a710: 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);
201a714: 05 00 00 ef sethi %hi(0x3bc00), %g2
201a718: 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) )
201a71c: 80 88 40 02 btst %g1, %g2
201a720: 12 80 00 36 bne 201a7f8 <_POSIX_signals_Unblock_thread+0x134>
201a724: 80 88 60 08 btst 8, %g1
_Thread_queue_Extract_with_proxy( the_thread );
else if ( _States_Is_delaying(the_thread->current_state) ) {
201a728: 22 80 00 09 be,a 201a74c <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN
201a72c: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED
(void) _Watchdog_Remove( &the_thread->Timer );
201a730: 7f ff bf 3e call 200a428 <_Watchdog_Remove>
201a734: 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 );
201a738: 13 04 00 ff sethi %hi(0x1003fc00), %o1
201a73c: 90 10 00 18 mov %i0, %o0
201a740: 7f ff ba 28 call 2008fe0 <_Thread_Clear_state>
201a744: 92 12 63 f8 or %o1, 0x3f8, %o1
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
}
201a748: b0 0f 60 01 and %i5, 1, %i0
201a74c: 81 c7 e0 08 ret
201a750: 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) ) {
201a754: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
201a758: 80 8b c0 01 btst %o7, %g1
201a75c: 22 80 00 21 be,a 201a7e0 <_POSIX_signals_Unblock_thread+0x11c>
201a760: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1
the_thread->Wait.return_code = EINTR;
201a764: 82 10 20 04 mov 4, %g1
201a768: c2 26 20 34 st %g1, [ %i0 + 0x34 ]
the_info = (siginfo_t *) the_thread->Wait.return_argument;
if ( !info ) {
201a76c: 80 a6 a0 00 cmp %i2, 0
201a770: 02 80 00 27 be 201a80c <_POSIX_signals_Unblock_thread+0x148>
201a774: 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;
201a778: c4 06 80 00 ld [ %i2 ], %g2
201a77c: c4 20 40 00 st %g2, [ %g1 ]
201a780: c4 06 a0 04 ld [ %i2 + 4 ], %g2
201a784: c4 20 60 04 st %g2, [ %g1 + 4 ]
201a788: c4 06 a0 08 ld [ %i2 + 8 ], %g2
201a78c: c4 20 60 08 st %g2, [ %g1 + 8 ]
}
_Thread_queue_Extract_with_proxy( the_thread );
201a790: 90 10 00 18 mov %i0, %o0
201a794: 7f ff bc f8 call 2009b74 <_Thread_queue_Extract_with_proxy>
201a798: ba 10 20 01 mov 1, %i5
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
_Thread_Dispatch_necessary = true;
}
}
return false;
}
201a79c: b0 0f 60 01 and %i5, 1, %i0
201a7a0: 81 c7 e0 08 ret
201a7a4: 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 ) {
201a7a8: 12 bf ff e8 bne 201a748 <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN
201a7ac: 03 00 80 77 sethi %hi(0x201dc00), %g1
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201a7b0: 82 10 62 c8 or %g1, 0x2c8, %g1 ! 201dec8 <_Per_CPU_Information>
201a7b4: c4 00 60 08 ld [ %g1 + 8 ], %g2
201a7b8: 80 a0 a0 00 cmp %g2, 0
201a7bc: 22 bf ff e4 be,a 201a74c <_POSIX_signals_Unblock_thread+0x88>
201a7c0: b0 0f 60 01 and %i5, 1, %i0
201a7c4: c4 00 60 0c ld [ %g1 + 0xc ], %g2
201a7c8: 80 a6 00 02 cmp %i0, %g2
201a7cc: 22 bf ff df be,a 201a748 <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN
201a7d0: c6 28 60 18 stb %g3, [ %g1 + 0x18 ]
201a7d4: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED
201a7d8: 81 c7 e0 08 ret <== NOT EXECUTED
201a7dc: 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) ) {
201a7e0: 80 ab c0 01 andncc %o7, %g1, %g0
201a7e4: 12 bf ff e0 bne 201a764 <_POSIX_signals_Unblock_thread+0xa0>
201a7e8: ba 10 20 00 clr %i5
201a7ec: b0 0f 60 01 and %i5, 1, %i0
201a7f0: 81 c7 e0 08 ret
201a7f4: 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 );
201a7f8: 7f ff bc df call 2009b74 <_Thread_queue_Extract_with_proxy>
201a7fc: 90 10 00 18 mov %i0, %o0
201a800: b0 0f 60 01 and %i5, 1, %i0
201a804: 81 c7 e0 08 ret
201a808: 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;
201a80c: 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;
201a810: f2 20 40 00 st %i1, [ %g1 ]
the_info->si_code = SI_USER;
201a814: c4 20 60 04 st %g2, [ %g1 + 4 ]
the_info->si_value.sival_int = 0;
201a818: 10 bf ff de b 201a790 <_POSIX_signals_Unblock_thread+0xcc>
201a81c: c0 20 60 08 clr [ %g1 + 8 ]
02008e94 <_RBTree_Extract_unprotected>:
*/
void _RBTree_Extract_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
2008e94: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *leaf, *target;
RBTree_Color victim_color;
RBTree_Direction dir;
if(!the_node) return;
2008e98: 80 a6 60 00 cmp %i1, 0
2008e9c: 02 80 00 4e be 2008fd4 <_RBTree_Extract_unprotected+0x140>
2008ea0: 01 00 00 00 nop
/* check if min needs to be updated */
if (the_node == the_rbtree->first[RBT_LEFT]) {
2008ea4: c2 06 20 08 ld [ %i0 + 8 ], %g1
2008ea8: 80 a0 40 19 cmp %g1, %i1
2008eac: 22 80 00 5b be,a 2009018 <_RBTree_Extract_unprotected+0x184>
2008eb0: 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]) {
2008eb4: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2008eb8: 80 a0 40 19 cmp %g1, %i1
2008ebc: 22 80 00 48 be,a 2008fdc <_RBTree_Extract_unprotected+0x148>
2008ec0: 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]) {
2008ec4: fa 06 60 04 ld [ %i1 + 4 ], %i5
2008ec8: 80 a7 60 00 cmp %i5, 0
2008ecc: 22 80 00 4c be,a 2008ffc <_RBTree_Extract_unprotected+0x168><== ALWAYS TAKEN
2008ed0: f8 06 60 08 ld [ %i1 + 8 ], %i4
2008ed4: c2 06 60 08 ld [ %i1 + 8 ], %g1
2008ed8: 80 a0 60 00 cmp %g1, 0
2008edc: 32 80 00 05 bne,a 2008ef0 <_RBTree_Extract_unprotected+0x5c><== NEVER TAKEN
2008ee0: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2008ee4: 10 80 00 52 b 200902c <_RBTree_Extract_unprotected+0x198>
2008ee8: 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];
2008eec: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED
2008ef0: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED
2008ef4: 32 bf ff fe bne,a 2008eec <_RBTree_Extract_unprotected+0x58><== NOT EXECUTED
2008ef8: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED
* target's position (target is the right child of target->parent)
* when target vacates it. if there is no child, then target->parent
* should become NULL. This may cause the coloring to be violated.
* For now we store the color of the node being deleted in victim_color.
*/
leaf = target->child[RBT_LEFT];
2008efc: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED
if(leaf) {
2008f00: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED
2008f04: 02 80 00 56 be 200905c <_RBTree_Extract_unprotected+0x1c8><== NOT EXECUTED
2008f08: 01 00 00 00 nop <== NOT EXECUTED
leaf->parent = target->parent;
2008f0c: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED
2008f10: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008f14: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED
target->parent->child[dir] = leaf;
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008f18: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008f1c: c8 00 a0 04 ld [ %g2 + 4 ], %g4 <== NOT EXECUTED
* replaced the_node, and target's child has moved up the tree if needed.
* the_node is no longer part of the tree, although it has valid pointers
* still.
*/
target->parent = the_node->parent;
target->color = the_node->color;
2008f20: c6 06 60 10 ld [ %i1 + 0x10 ], %g3 <== NOT EXECUTED
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
dir = target != target->parent->child[0];
2008f24: 88 19 00 1d xor %g4, %i5, %g4 <== NOT EXECUTED
2008f28: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED
2008f2c: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED
target->parent->child[dir] = leaf;
2008f30: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED
2008f34: 84 00 80 04 add %g2, %g4, %g2 <== NOT EXECUTED
2008f38: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008f3c: c8 00 60 04 ld [ %g1 + 4 ], %g4 <== NOT EXECUTED
leaf->parent = target->parent;
} else {
/* fix the tree here if the child is a null leaf. */
_RBTree_Extract_validate_unprotected(target);
}
victim_color = target->color;
2008f40: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 <== NOT EXECUTED
dir = target != target->parent->child[0];
target->parent->child[dir] = leaf;
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
2008f44: 88 19 00 19 xor %g4, %i1, %g4 <== NOT EXECUTED
2008f48: 80 a0 00 04 cmp %g0, %g4 <== NOT EXECUTED
2008f4c: 88 40 20 00 addx %g0, 0, %g4 <== NOT EXECUTED
the_node->parent->child[dir] = target;
2008f50: 89 29 20 02 sll %g4, 2, %g4 <== NOT EXECUTED
2008f54: 82 00 40 04 add %g1, %g4, %g1 <== NOT EXECUTED
2008f58: fa 20 60 04 st %i5, [ %g1 + 4 ] <== NOT EXECUTED
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
2008f5c: c2 06 60 08 ld [ %i1 + 8 ], %g1 <== NOT EXECUTED
* replaced the_node, and target's child has moved up the tree if needed.
* the_node is no longer part of the tree, although it has valid pointers
* still.
*/
target->parent = the_node->parent;
target->color = the_node->color;
2008f60: c6 27 60 10 st %g3, [ %i5 + 0x10 ] <== NOT EXECUTED
/* now replace the_node with target */
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
2008f64: c2 27 60 08 st %g1, [ %i5 + 8 ] <== NOT EXECUTED
the_node->child[RBT_RIGHT]->parent = target;
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
2008f68: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
the_node->child[RBT_RIGHT]->parent = target;
2008f6c: c6 06 60 08 ld [ %i1 + 8 ], %g3 <== NOT EXECUTED
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
2008f70: c2 27 60 04 st %g1, [ %i5 + 4 ] <== NOT EXECUTED
the_node->child[RBT_LEFT]->parent = target;
2008f74: c2 06 60 04 ld [ %i1 + 4 ], %g1 <== NOT EXECUTED
dir = the_node != the_node->parent->child[0];
the_node->parent->child[dir] = target;
/* set target's new children to the original node's children */
target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT];
the_node->child[RBT_RIGHT]->parent = target;
2008f78: fa 20 c0 00 st %i5, [ %g3 ] <== NOT EXECUTED
target->child[RBT_LEFT] = the_node->child[RBT_LEFT];
the_node->child[RBT_LEFT]->parent = target;
2008f7c: fa 20 40 00 st %i5, [ %g1 ] <== NOT EXECUTED
/* finally, update the parent node and recolor. target has completely
* replaced the_node, and target's child has moved up the tree if needed.
* the_node is no longer part of the tree, although it has valid pointers
* still.
*/
target->parent = the_node->parent;
2008f80: c2 06 40 00 ld [ %i1 ], %g1 <== NOT EXECUTED
2008f84: c2 27 40 00 st %g1, [ %i5 ] <== NOT EXECUTED
* 1. Deleted a red node, its child must be black. Nothing must be done.
* 2. Deleted a black node and the child is red. Paint child black.
* 3. Deleted a black node and its child is black. This requires some
* care and rotations.
*/
if (victim_color == RBT_BLACK) { /* eliminate case 1 */
2008f88: 80 a0 a0 00 cmp %g2, 0
2008f8c: 32 80 00 0c bne,a 2008fbc <_RBTree_Extract_unprotected+0x128>
2008f90: c2 06 20 04 ld [ %i0 + 4 ], %g1
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008f94: 80 a7 20 00 cmp %i4, 0
2008f98: 22 80 00 09 be,a 2008fbc <_RBTree_Extract_unprotected+0x128>
2008f9c: c2 06 20 04 ld [ %i0 + 4 ], %g1
2008fa0: c2 07 20 10 ld [ %i4 + 0x10 ], %g1
2008fa4: 80 a0 60 01 cmp %g1, 1
2008fa8: 22 80 00 04 be,a 2008fb8 <_RBTree_Extract_unprotected+0x124><== ALWAYS TAKEN
2008fac: c0 27 20 10 clr [ %i4 + 0x10 ]
if (_RBTree_Is_red(leaf))
leaf->color = RBT_BLACK; /* case 2 */
else if(leaf)
_RBTree_Extract_validate_unprotected(leaf); /* case 3 */
2008fb0: 7f ff fe e6 call 2008b48 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2008fb4: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
/* Wipe the_node */
_RBTree_Set_off_rbtree(the_node);
/* set root to black, if it exists */
if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK;
2008fb8: 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;
2008fbc: c0 26 60 08 clr [ %i1 + 8 ]
2008fc0: c0 26 60 04 clr [ %i1 + 4 ]
2008fc4: 80 a0 60 00 cmp %g1, 0
2008fc8: 02 80 00 03 be 2008fd4 <_RBTree_Extract_unprotected+0x140>
2008fcc: c0 26 40 00 clr [ %i1 ]
2008fd0: c0 20 60 10 clr [ %g1 + 0x10 ]
2008fd4: 81 c7 e0 08 ret
2008fd8: 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])
2008fdc: 80 a0 60 00 cmp %g1, 0
2008fe0: 22 80 00 28 be,a 2009080 <_RBTree_Extract_unprotected+0x1ec>
2008fe4: 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]) {
2008fe8: fa 06 60 04 ld [ %i1 + 4 ], %i5
2008fec: 80 a7 60 00 cmp %i5, 0
2008ff0: 12 bf ff b9 bne 2008ed4 <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN
2008ff4: 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];
2008ff8: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED
if( leaf ) {
2008ffc: 80 a7 20 00 cmp %i4, 0
2009000: 32 80 00 0c bne,a 2009030 <_RBTree_Extract_unprotected+0x19c>
2009004: 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);
2009008: 7f ff fe d0 call 2008b48 <_RBTree_Extract_validate_unprotected>
200900c: 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];
2009010: 10 80 00 0a b 2009038 <_RBTree_Extract_unprotected+0x1a4>
2009014: 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])
2009018: 80 a0 60 00 cmp %g1, 0
200901c: 22 80 00 14 be,a 200906c <_RBTree_Extract_unprotected+0x1d8>
2009020: c2 06 40 00 ld [ %i1 ], %g1
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
2009024: 10 bf ff a4 b 2008eb4 <_RBTree_Extract_unprotected+0x20>
2009028: 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;
200902c: c2 06 40 00 ld [ %i1 ], %g1
2009030: 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];
2009034: 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;
2009038: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
/* remove the_node from the tree */
dir = the_node != the_node->parent->child[0];
200903c: c6 00 60 04 ld [ %g1 + 4 ], %g3
2009040: 86 18 c0 19 xor %g3, %i1, %g3
2009044: 80 a0 00 03 cmp %g0, %g3
2009048: 86 40 20 00 addx %g0, 0, %g3
the_node->parent->child[dir] = leaf;
200904c: 87 28 e0 02 sll %g3, 2, %g3
2009050: 82 00 40 03 add %g1, %g3, %g1
2009054: 10 bf ff cd b 2008f88 <_RBTree_Extract_unprotected+0xf4>
2009058: 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);
200905c: 7f ff fe bb call 2008b48 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED
2009060: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED
}
victim_color = target->color;
dir = target != target->parent->child[0];
2009064: 10 bf ff ad b 2008f18 <_RBTree_Extract_unprotected+0x84> <== NOT EXECUTED
2009068: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED
if (the_node == the_rbtree->first[RBT_LEFT]) {
if (the_node->child[RBT_RIGHT])
the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT];
else {
the_rbtree->first[RBT_LEFT] = the_node->parent;
if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree,
200906c: 80 a6 00 01 cmp %i0, %g1
2009070: 12 bf ff 91 bne 2008eb4 <_RBTree_Extract_unprotected+0x20>
2009074: c2 26 20 08 st %g1, [ %i0 + 8 ]
the_rbtree->first[RBT_LEFT]))
the_rbtree->first[RBT_LEFT] = NULL;
2009078: 10 bf ff 8f b 2008eb4 <_RBTree_Extract_unprotected+0x20>
200907c: 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,
2009080: 80 a6 00 01 cmp %i0, %g1
2009084: 12 bf ff 90 bne 2008ec4 <_RBTree_Extract_unprotected+0x30>
2009088: c2 26 20 0c st %g1, [ %i0 + 0xc ]
the_rbtree->first[RBT_RIGHT]))
the_rbtree->first[RBT_RIGHT] = NULL;
200908c: 10 bf ff 8e b 2008ec4 <_RBTree_Extract_unprotected+0x30>
2009090: c0 26 20 0c clr [ %i0 + 0xc ]
02008b48 <_RBTree_Extract_validate_unprotected>:
* of the extract operation.
*/
void _RBTree_Extract_validate_unprotected(
RBTree_Node *the_node
)
{
2008b48: 9d e3 bf a0 save %sp, -96, %sp
RBTree_Node *parent, *sibling;
RBTree_Direction dir;
parent = the_node->parent;
2008b4c: c4 06 00 00 ld [ %i0 ], %g2
if(!parent->parent) return;
2008b50: c2 00 80 00 ld [ %g2 ], %g1
2008b54: 80 a0 60 00 cmp %g1, 0
2008b58: 02 80 00 cd be 2008e8c <_RBTree_Extract_validate_unprotected+0x344>
2008b5c: 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])
2008b60: c2 00 a0 04 ld [ %g2 + 4 ], %g1
2008b64: 80 a6 00 01 cmp %i0, %g1
2008b68: 22 80 00 02 be,a 2008b70 <_RBTree_Extract_validate_unprotected+0x28>
2008b6c: c2 00 a0 08 ld [ %g2 + 8 ], %g1
/* sibling is black, see if both of its children are also black. */
if (sibling &&
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
sibling->color = RBT_RED;
2008b70: 96 10 20 01 mov 1, %o3
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008b74: 80 a6 20 00 cmp %i0, 0
2008b78: 22 80 00 07 be,a 2008b94 <_RBTree_Extract_validate_unprotected+0x4c><== NEVER TAKEN
2008b7c: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED
2008b80: c6 06 20 10 ld [ %i0 + 0x10 ], %g3
2008b84: 80 a0 e0 01 cmp %g3, 1
2008b88: 22 80 00 5b be,a 2008cf4 <_RBTree_Extract_validate_unprotected+0x1ac>
2008b8c: 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) {
2008b90: c6 00 80 00 ld [ %g2 ], %g3
2008b94: 80 a0 e0 00 cmp %g3, 0
2008b98: 02 80 00 56 be 2008cf0 <_RBTree_Extract_validate_unprotected+0x1a8>
2008b9c: 80 a0 60 00 cmp %g1, 0
2008ba0: 02 bf ff f6 be 2008b78 <_RBTree_Extract_validate_unprotected+0x30><== NEVER TAKEN
2008ba4: 80 a6 20 00 cmp %i0, 0
2008ba8: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
2008bac: 80 a1 20 01 cmp %g4, 1
2008bb0: 22 80 00 27 be,a 2008c4c <_RBTree_Extract_validate_unprotected+0x104>
2008bb4: de 00 a0 04 ld [ %g2 + 4 ], %o7
sibling = parent->child[!dir];
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
!_RBTree_Is_red(sibling->child[RBT_RIGHT]) &&
2008bb8: c6 00 60 08 ld [ %g1 + 8 ], %g3
2008bbc: 80 a0 e0 00 cmp %g3, 0
2008bc0: 22 80 00 07 be,a 2008bdc <_RBTree_Extract_validate_unprotected+0x94>
2008bc4: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008bc8: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
2008bcc: 80 a0 e0 01 cmp %g3, 1
2008bd0: 22 80 00 57 be,a 2008d2c <_RBTree_Extract_validate_unprotected+0x1e4>
2008bd4: c6 00 a0 04 ld [ %g2 + 4 ], %g3
!_RBTree_Is_red(sibling->child[RBT_LEFT])) {
2008bd8: c6 00 60 04 ld [ %g1 + 4 ], %g3
2008bdc: 80 a0 e0 00 cmp %g3, 0
2008be0: 22 80 00 07 be,a 2008bfc <_RBTree_Extract_validate_unprotected+0xb4>
2008be4: d6 20 60 10 st %o3, [ %g1 + 0x10 ]
2008be8: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3
2008bec: 80 a0 e0 01 cmp %g3, 1
2008bf0: 22 80 00 4f be,a 2008d2c <_RBTree_Extract_validate_unprotected+0x1e4>
2008bf4: c6 00 a0 04 ld [ %g2 + 4 ], %g3
sibling->color = RBT_RED;
2008bf8: d6 20 60 10 st %o3, [ %g1 + 0x10 ]
2008bfc: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1
2008c00: 80 a0 60 01 cmp %g1, 1
2008c04: 22 80 00 3b be,a 2008cf0 <_RBTree_Extract_validate_unprotected+0x1a8>
2008c08: c0 20 a0 10 clr [ %g2 + 0x10 ]
if (_RBTree_Is_red(parent)) {
parent->color = RBT_BLACK;
break;
}
the_node = parent; /* done if parent is red */
parent = the_node->parent;
2008c0c: c6 00 80 00 ld [ %g2 ], %g3
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
2008c10: 80 a0 e0 00 cmp %g3, 0
2008c14: 02 80 00 3e be 2008d0c <_RBTree_Extract_validate_unprotected+0x1c4><== NEVER TAKEN
2008c18: b0 10 00 02 mov %g2, %i0
if(!(the_node->parent->parent)) return NULL;
2008c1c: c2 00 c0 00 ld [ %g3 ], %g1
2008c20: 80 a0 60 00 cmp %g1, 0
2008c24: 02 80 00 3d be 2008d18 <_RBTree_Extract_validate_unprotected+0x1d0>
2008c28: 82 10 20 00 clr %g1
if(the_node == the_node->parent->child[RBT_LEFT])
2008c2c: c2 00 e0 04 ld [ %g3 + 4 ], %g1
2008c30: 80 a0 80 01 cmp %g2, %g1
2008c34: 02 80 00 3b be 2008d20 <_RBTree_Extract_validate_unprotected+0x1d8>
2008c38: 80 a6 20 00 cmp %i0, 0
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008c3c: 12 bf ff d1 bne 2008b80 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN
2008c40: 84 10 00 03 mov %g3, %g2
if(!parent->parent) return;
sibling = _RBTree_Sibling(the_node);
/* continue to correct tree as long as the_node is black and not the root */
while (!_RBTree_Is_red(the_node) && parent->parent) {
2008c44: 10 bf ff d4 b 2008b94 <_RBTree_Extract_validate_unprotected+0x4c><== NOT EXECUTED
2008c48: c6 00 80 00 ld [ %g2 ], %g3 <== NOT EXECUTED
* then rotate parent left, making the sibling be the_node's grandparent.
* Now the_node has a black sibling and red parent. After rotation,
* update sibling pointer.
*/
if (_RBTree_Is_red(sibling)) {
parent->color = RBT_RED;
2008c4c: c8 20 a0 10 st %g4, [ %g2 + 0x10 ]
sibling->color = RBT_BLACK;
dir = the_node != parent->child[0];
2008c50: 9e 1b c0 18 xor %o7, %i0, %o7
2008c54: 80 a0 00 0f cmp %g0, %o7
2008c58: 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;
2008c5c: 88 21 00 0d sub %g4, %o5, %g4
2008c60: 89 29 20 02 sll %g4, 2, %g4
2008c64: 88 00 80 04 add %g2, %g4, %g4
2008c68: de 01 20 04 ld [ %g4 + 4 ], %o7
2008c6c: 80 a3 e0 00 cmp %o7, 0
2008c70: 02 80 00 16 be 2008cc8 <_RBTree_Extract_validate_unprotected+0x180><== NEVER TAKEN
2008c74: c0 20 60 10 clr [ %g1 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008c78: 83 2b 60 02 sll %o5, 2, %g1
2008c7c: 98 03 c0 01 add %o7, %g1, %o4
2008c80: d4 03 20 04 ld [ %o4 + 4 ], %o2
2008c84: d4 21 20 04 st %o2, [ %g4 + 4 ]
if (c->child[dir])
2008c88: c8 03 20 04 ld [ %o4 + 4 ], %g4
2008c8c: 80 a1 20 00 cmp %g4, 0
2008c90: 02 80 00 04 be 2008ca0 <_RBTree_Extract_validate_unprotected+0x158><== NEVER TAKEN
2008c94: 82 03 c0 01 add %o7, %g1, %g1
c->child[dir]->parent = the_node;
2008c98: c4 21 00 00 st %g2, [ %g4 ]
2008c9c: c6 00 80 00 ld [ %g2 ], %g3
c->child[dir] = the_node;
2008ca0: c4 20 60 04 st %g2, [ %g1 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008ca4: c2 00 e0 04 ld [ %g3 + 4 ], %g1
c->parent = the_node->parent;
2008ca8: 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;
2008cac: 82 18 80 01 xor %g2, %g1, %g1
c->parent = the_node->parent;
the_node->parent = c;
2008cb0: de 20 80 00 st %o7, [ %g2 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008cb4: 80 a0 00 01 cmp %g0, %g1
2008cb8: 82 40 20 00 addx %g0, 0, %g1
2008cbc: 83 28 60 02 sll %g1, 2, %g1
2008cc0: 86 00 c0 01 add %g3, %g1, %g3
2008cc4: de 20 e0 04 st %o7, [ %g3 + 4 ]
_RBTree_Rotate(parent, dir);
sibling = parent->child[!dir];
2008cc8: 80 a0 00 0d cmp %g0, %o5
2008ccc: 82 60 3f ff subx %g0, -1, %g1
2008cd0: 83 28 60 02 sll %g1, 2, %g1
2008cd4: 82 00 80 01 add %g2, %g1, %g1
2008cd8: c2 00 60 04 ld [ %g1 + 4 ], %g1
}
/* sibling is black, see if both of its children are also black. */
if (sibling &&
2008cdc: 80 a0 60 00 cmp %g1, 0
2008ce0: 32 bf ff b7 bne,a 2008bbc <_RBTree_Extract_validate_unprotected+0x74><== ALWAYS TAKEN
2008ce4: c6 00 60 08 ld [ %g1 + 8 ], %g3
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
2008ce8: 10 bf ff a4 b 2008b78 <_RBTree_Extract_validate_unprotected+0x30><== NOT EXECUTED
2008cec: 80 a6 20 00 cmp %i0, 0 <== NOT EXECUTED
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2008cf0: c2 06 00 00 ld [ %i0 ], %g1
2008cf4: c2 00 40 00 ld [ %g1 ], %g1
2008cf8: 80 a0 60 00 cmp %g1, 0
2008cfc: 22 80 00 02 be,a 2008d04 <_RBTree_Extract_validate_unprotected+0x1bc>
2008d00: c0 26 20 10 clr [ %i0 + 0x10 ]
2008d04: 81 c7 e0 08 ret
2008d08: 81 e8 00 00 restore
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
if(!(the_node->parent)) return NULL;
2008d0c: 82 10 20 00 clr %g1 <== NOT EXECUTED
2008d10: 10 bf ff 99 b 2008b74 <_RBTree_Extract_validate_unprotected+0x2c><== NOT EXECUTED
2008d14: 84 10 20 00 clr %g2 <== NOT EXECUTED
if(!(the_node->parent->parent)) return NULL;
2008d18: 10 bf ff 97 b 2008b74 <_RBTree_Extract_validate_unprotected+0x2c>
2008d1c: 84 10 00 03 mov %g3, %g2
if(the_node == the_node->parent->child[RBT_LEFT])
return the_node->parent->child[RBT_RIGHT];
2008d20: c2 00 e0 08 ld [ %g3 + 8 ], %g1
2008d24: 10 bf ff 94 b 2008b74 <_RBTree_Extract_validate_unprotected+0x2c>
2008d28: 84 10 00 03 mov %g3, %g2
* cases, either the_node is to the left or the right of the parent.
* In both cases, first check if one of sibling's children is black,
* and if so rotate in the proper direction and update sibling pointer.
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
2008d2c: 86 18 c0 18 xor %g3, %i0, %g3
2008d30: 80 a0 00 03 cmp %g0, %g3
2008d34: 86 40 20 00 addx %g0, 0, %g3
if (!_RBTree_Is_red(sibling->child[!dir])) {
2008d38: 80 a0 00 03 cmp %g0, %g3
2008d3c: 9e 60 3f ff subx %g0, -1, %o7
2008d40: 9f 2b e0 02 sll %o7, 2, %o7
2008d44: 88 00 40 0f add %g1, %o7, %g4
2008d48: 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);
2008d4c: 80 a1 20 00 cmp %g4, 0
2008d50: 22 80 00 07 be,a 2008d6c <_RBTree_Extract_validate_unprotected+0x224>
2008d54: 89 28 e0 02 sll %g3, 2, %g4
2008d58: da 01 20 10 ld [ %g4 + 0x10 ], %o5
2008d5c: 80 a3 60 01 cmp %o5, 1
2008d60: 22 80 00 28 be,a 2008e00 <_RBTree_Extract_validate_unprotected+0x2b8>
2008d64: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
2008d68: 89 28 e0 02 sll %g3, 2, %g4
2008d6c: 88 00 40 04 add %g1, %g4, %g4
_RBTree_Rotate(sibling, !dir);
2008d70: 98 18 e0 01 xor %g3, 1, %o4
* Then switch the sibling and parent colors, and rotate through parent.
*/
dir = the_node != parent->child[0];
if (!_RBTree_Is_red(sibling->child[!dir])) {
sibling->color = RBT_RED;
sibling->child[dir]->color = RBT_BLACK;
2008d74: 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;
2008d78: 88 10 20 01 mov 1, %g4
2008d7c: c8 20 60 10 st %g4, [ %g1 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2008d80: 88 21 00 0c sub %g4, %o4, %g4
2008d84: 9b 29 20 02 sll %g4, 2, %o5
2008d88: 9a 00 40 0d add %g1, %o5, %o5
2008d8c: c8 03 60 04 ld [ %o5 + 4 ], %g4
2008d90: 80 a1 20 00 cmp %g4, 0
2008d94: 02 80 00 16 be 2008dec <_RBTree_Extract_validate_unprotected+0x2a4><== NEVER TAKEN
2008d98: c0 22 e0 10 clr [ %o3 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008d9c: 99 2b 20 02 sll %o4, 2, %o4
2008da0: 96 01 00 0c add %g4, %o4, %o3
2008da4: d4 02 e0 04 ld [ %o3 + 4 ], %o2
2008da8: d4 23 60 04 st %o2, [ %o5 + 4 ]
if (c->child[dir])
2008dac: da 02 e0 04 ld [ %o3 + 4 ], %o5
2008db0: 80 a3 60 00 cmp %o5, 0
2008db4: 32 80 00 02 bne,a 2008dbc <_RBTree_Extract_validate_unprotected+0x274>
2008db8: c2 23 40 00 st %g1, [ %o5 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008dbc: da 00 40 00 ld [ %g1 ], %o5
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
2008dc0: 98 01 00 0c add %g4, %o4, %o4
2008dc4: c2 23 20 04 st %g1, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008dc8: d8 03 60 04 ld [ %o5 + 4 ], %o4
c->parent = the_node->parent;
2008dcc: 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;
2008dd0: 98 18 40 0c xor %g1, %o4, %o4
c->parent = the_node->parent;
the_node->parent = c;
2008dd4: c8 20 40 00 st %g4, [ %g1 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008dd8: 80 a0 00 0c cmp %g0, %o4
2008ddc: 82 40 20 00 addx %g0, 0, %g1
2008de0: 83 28 60 02 sll %g1, 2, %g1
2008de4: 9a 03 40 01 add %o5, %g1, %o5
2008de8: c8 23 60 04 st %g4, [ %o5 + 4 ]
sibling->child[dir]->color = RBT_BLACK;
_RBTree_Rotate(sibling, !dir);
sibling = parent->child[!dir];
2008dec: 82 00 80 0f add %g2, %o7, %g1
2008df0: c2 00 60 04 ld [ %g1 + 4 ], %g1
2008df4: 9e 00 40 0f add %g1, %o7, %o7
2008df8: c8 03 e0 04 ld [ %o7 + 4 ], %g4
}
sibling->color = parent->color;
2008dfc: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
2008e00: de 20 60 10 st %o7, [ %g1 + 0x10 ]
parent->color = RBT_BLACK;
2008e04: c0 20 a0 10 clr [ %g2 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
2008e08: 9e 10 20 01 mov 1, %o7
2008e0c: 9e 23 c0 03 sub %o7, %g3, %o7
2008e10: 9f 2b e0 02 sll %o7, 2, %o7
2008e14: 9e 00 80 0f add %g2, %o7, %o7
2008e18: c2 03 e0 04 ld [ %o7 + 4 ], %g1
2008e1c: 80 a0 60 00 cmp %g1, 0
2008e20: 02 bf ff b4 be 2008cf0 <_RBTree_Extract_validate_unprotected+0x1a8><== NEVER TAKEN
2008e24: c0 21 20 10 clr [ %g4 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
2008e28: 87 28 e0 02 sll %g3, 2, %g3
2008e2c: 88 00 40 03 add %g1, %g3, %g4
2008e30: da 01 20 04 ld [ %g4 + 4 ], %o5
2008e34: da 23 e0 04 st %o5, [ %o7 + 4 ]
if (c->child[dir])
2008e38: c8 01 20 04 ld [ %g4 + 4 ], %g4
2008e3c: 80 a1 20 00 cmp %g4, 0
2008e40: 32 80 00 02 bne,a 2008e48 <_RBTree_Extract_validate_unprotected+0x300>
2008e44: c4 21 00 00 st %g2, [ %g4 ]
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008e48: c8 00 80 00 ld [ %g2 ], %g4
the_node->child[(1-dir)] = c->child[dir];
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
2008e4c: 86 00 40 03 add %g1, %g3, %g3
2008e50: c4 20 e0 04 st %g2, [ %g3 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008e54: c6 01 20 04 ld [ %g4 + 4 ], %g3
c->parent = the_node->parent;
2008e58: c8 20 40 00 st %g4, [ %g1 ]
the_node->parent = c;
2008e5c: c2 20 80 00 st %g1, [ %g2 ]
if (c->child[dir])
c->child[dir]->parent = the_node;
c->child[dir] = the_node;
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2008e60: 86 18 c0 02 xor %g3, %g2, %g3
2008e64: 80 a0 00 03 cmp %g0, %g3
2008e68: 84 40 20 00 addx %g0, 0, %g2
2008e6c: 85 28 a0 02 sll %g2, 2, %g2
2008e70: 88 01 00 02 add %g4, %g2, %g4
2008e74: c2 21 20 04 st %g1, [ %g4 + 4 ]
sibling->child[!dir]->color = RBT_BLACK;
_RBTree_Rotate(parent, dir);
break; /* done */
}
} /* while */
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2008e78: c2 06 00 00 ld [ %i0 ], %g1
2008e7c: c2 00 40 00 ld [ %g1 ], %g1
2008e80: 80 a0 60 00 cmp %g1, 0
2008e84: 22 bf ff a0 be,a 2008d04 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN
2008e88: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED
2008e8c: 81 c7 e0 08 ret
2008e90: 81 e8 00 00 restore
02009108 <_RBTree_Find>:
RBTree_Node *_RBTree_Find(
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
2009108: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
200910c: 7f ff e6 56 call 2002a64 <sparc_disable_interrupts>
2009110: 01 00 00 00 nop
return_node = _RBTree_Find_unprotected( the_rbtree, the_value );
_ISR_Enable( level );
return return_node;
}
2009114: f0 06 20 04 ld [ %i0 + 4 ], %i0
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
RBTree_Node* iter_node = the_rbtree->root;
while (iter_node) {
2009118: 80 a6 20 00 cmp %i0, 0
200911c: 32 80 00 0b bne,a 2009148 <_RBTree_Find+0x40> <== ALWAYS TAKEN
2009120: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2009124: 30 80 00 0c b,a 2009154 <_RBTree_Find+0x4c> <== NOT EXECUTED
if (the_value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_value > iter_node->value;
2009128: 82 40 20 00 addx %g0, 0, %g1
iter_node = iter_node->child[dir];
200912c: 83 28 60 02 sll %g1, 2, %g1
2009130: b0 06 00 01 add %i0, %g1, %i0
2009134: f0 06 20 04 ld [ %i0 + 4 ], %i0
RBTree_Control *the_rbtree,
unsigned int the_value
)
{
RBTree_Node* iter_node = the_rbtree->root;
while (iter_node) {
2009138: 80 a6 20 00 cmp %i0, 0
200913c: 02 80 00 06 be 2009154 <_RBTree_Find+0x4c> <== NEVER TAKEN
2009140: 01 00 00 00 nop
if (the_value == iter_node->value) return(iter_node);
2009144: c2 06 20 0c ld [ %i0 + 0xc ], %g1
2009148: 80 a6 40 01 cmp %i1, %g1
200914c: 12 bf ff f7 bne 2009128 <_RBTree_Find+0x20>
2009150: 80 a0 40 19 cmp %g1, %i1
RBTree_Node *return_node;
return_node = NULL;
_ISR_Disable( level );
return_node = _RBTree_Find_unprotected( the_rbtree, the_value );
_ISR_Enable( level );
2009154: 7f ff e6 48 call 2002a74 <sparc_enable_interrupts>
2009158: 01 00 00 00 nop
return return_node;
}
200915c: 81 c7 e0 08 ret
2009160: 81 e8 00 00 restore
020090bc <_RBTree_Find_header>:
*/
RBTree_Control *_RBTree_Find_header(
RBTree_Node *the_node
)
{
20090bc: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
RBTree_Control *return_header;
return_header = NULL;
_ISR_Disable( level );
20090c0: 7f ff e6 69 call 2002a64 <sparc_disable_interrupts>
20090c4: 01 00 00 00 nop
*/
RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected(
RBTree_Node *the_node
)
{
if(!the_node) return NULL;
20090c8: 80 a6 20 00 cmp %i0, 0
20090cc: 02 80 00 0b be 20090f8 <_RBTree_Find_header+0x3c> <== NEVER TAKEN
20090d0: ba 10 20 00 clr %i5
if(!(the_node->parent)) return NULL;
20090d4: fa 06 00 00 ld [ %i0 ], %i5
20090d8: 80 a7 60 00 cmp %i5, 0
20090dc: 32 80 00 04 bne,a 20090ec <_RBTree_Find_header+0x30> <== ALWAYS TAKEN
20090e0: c2 07 40 00 ld [ %i5 ], %g1
20090e4: 30 80 00 05 b,a 20090f8 <_RBTree_Find_header+0x3c> <== NOT EXECUTED
20090e8: c2 07 40 00 ld [ %i5 ], %g1
while(the_node->parent) the_node = the_node->parent;
20090ec: 80 a0 60 00 cmp %g1, 0
20090f0: 32 bf ff fe bne,a 20090e8 <_RBTree_Find_header+0x2c>
20090f4: ba 10 00 01 mov %g1, %i5
return_header = _RBTree_Find_header_unprotected( the_node );
_ISR_Enable( level );
20090f8: 7f ff e6 5f call 2002a74 <sparc_enable_interrupts>
20090fc: b0 10 00 1d mov %i5, %i0
return return_header;
}
2009100: 81 c7 e0 08 ret
2009104: 81 e8 00 00 restore
02009350 <_RBTree_Insert_unprotected>:
*/
RBTree_Node *_RBTree_Insert_unprotected(
RBTree_Control *the_rbtree,
RBTree_Node *the_node
)
{
2009350: 9d e3 bf a0 save %sp, -96, %sp
if(!the_node) return (RBTree_Node*)-1;
2009354: 80 a6 60 00 cmp %i1, 0
2009358: 02 80 00 14 be 20093a8 <_RBTree_Insert_unprotected+0x58> <== NEVER TAKEN
200935c: 82 10 3f ff mov -1, %g1
RBTree_Node *iter_node = the_rbtree->root;
2009360: c2 06 20 04 ld [ %i0 + 4 ], %g1
if (!iter_node) { /* special case: first node inserted */
2009364: 80 a0 60 00 cmp %g1, 0
2009368: 22 80 00 23 be,a 20093f4 <_RBTree_Insert_unprotected+0xa4>
200936c: c0 26 60 10 clr [ %i1 + 0x10 ]
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
the_rbtree->first[dir] = the_node;
2009370: 10 80 00 0a b 2009398 <_RBTree_Insert_unprotected+0x48>
2009374: c6 06 60 0c ld [ %i1 + 0xc ], %g3
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
} else {
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
2009378: 9e 40 20 00 addx %g0, 0, %o7
if (!iter_node->child[dir]) {
200937c: 89 2b e0 02 sll %o7, 2, %g4
2009380: 88 00 40 04 add %g1, %g4, %g4
2009384: c4 01 20 04 ld [ %g4 + 4 ], %g2
2009388: 80 a0 a0 00 cmp %g2, 0
200938c: 22 80 00 09 be,a 20093b0 <_RBTree_Insert_unprotected+0x60>
2009390: c0 26 60 08 clr [ %i1 + 8 ]
2009394: 82 10 00 02 mov %g2, %g1
the_node->parent = (RBTree_Node *) the_rbtree;
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
} else {
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
2009398: c4 00 60 0c ld [ %g1 + 0xc ], %g2
200939c: 80 a0 c0 02 cmp %g3, %g2
20093a0: 12 bf ff f6 bne 2009378 <_RBTree_Insert_unprotected+0x28>
20093a4: 80 a0 80 03 cmp %g2, %g3
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
}
return (RBTree_Node*)0;
}
20093a8: 81 c7 e0 08 ret
20093ac: 91 e8 00 01 restore %g0, %g1, %o0
/* typical binary search tree insert, descend tree to leaf and insert */
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
20093b0: c0 26 60 04 clr [ %i1 + 4 ]
RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First(
RBTree_Control *the_rbtree,
RBTree_Direction dir
)
{
return the_rbtree->first[dir];
20093b4: 9e 03 e0 02 add %o7, 2, %o7
20093b8: 9f 2b e0 02 sll %o7, 2, %o7
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
20093bc: c4 06 00 0f ld [ %i0 + %o7 ], %g2
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
20093c0: 86 10 20 01 mov 1, %g3
iter_node->child[dir] = the_node;
20093c4: f2 21 20 04 st %i1, [ %g4 + 4 ]
while (iter_node) {
if(the_node->value == iter_node->value) return(iter_node);
RBTree_Direction dir = the_node->value > iter_node->value;
if (!iter_node->child[dir]) {
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
the_node->color = RBT_RED;
20093c8: c6 26 60 10 st %g3, [ %i1 + 0x10 ]
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
20093cc: 80 a0 40 02 cmp %g1, %g2
20093d0: 02 80 00 07 be 20093ec <_RBTree_Insert_unprotected+0x9c>
20093d4: c2 26 40 00 st %g1, [ %i1 ]
}
} /* while(iter_node) */
/* verify red-black properties */
_RBTree_Validate_insert_unprotected(the_node);
20093d8: 7f ff ff 72 call 20091a0 <_RBTree_Validate_insert_unprotected>
20093dc: 90 10 00 19 mov %i1, %o0
}
return (RBTree_Node*)0;
20093e0: 82 10 20 00 clr %g1
}
20093e4: 81 c7 e0 08 ret
20093e8: 91 e8 00 01 restore %g0, %g1, %o0
the_node->color = RBT_RED;
iter_node->child[dir] = the_node;
the_node->parent = iter_node;
/* update min/max */
if (_RBTree_Is_first(the_rbtree, iter_node, dir)) {
the_rbtree->first[dir] = the_node;
20093ec: 10 bf ff fb b 20093d8 <_RBTree_Insert_unprotected+0x88>
20093f0: f2 26 00 0f st %i1, [ %i0 + %o7 ]
RBTree_Node *iter_node = the_rbtree->root;
if (!iter_node) { /* special case: first node inserted */
the_node->color = RBT_BLACK;
the_rbtree->root = the_node;
20093f4: f2 26 20 04 st %i1, [ %i0 + 4 ]
the_rbtree->first[0] = the_rbtree->first[1] = the_node;
20093f8: f2 26 20 0c st %i1, [ %i0 + 0xc ]
20093fc: f2 26 20 08 st %i1, [ %i0 + 8 ]
the_node->parent = (RBTree_Node *) the_rbtree;
2009400: f0 26 40 00 st %i0, [ %i1 ]
the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL;
2009404: c0 26 60 08 clr [ %i1 + 8 ]
2009408: 10 bf ff e8 b 20093a8 <_RBTree_Insert_unprotected+0x58>
200940c: c0 26 60 04 clr [ %i1 + 4 ]
020091a0 <_RBTree_Validate_insert_unprotected>:
* append operation.
*/
void _RBTree_Validate_insert_unprotected(
RBTree_Node *the_node
)
{
20091a0: 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) {
20091a4: 96 10 20 01 mov 1, %o3
ISR_Level level;
_ISR_Disable( level );
_RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
20091a8: 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;
20091ac: c4 00 40 00 ld [ %g1 ], %g2
20091b0: 86 90 a0 00 orcc %g2, 0, %g3
20091b4: 22 80 00 06 be,a 20091cc <_RBTree_Validate_insert_unprotected+0x2c>
20091b8: c0 26 20 10 clr [ %i0 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE bool _RBTree_Is_red(
const RBTree_Node *the_node
)
{
return (the_node && the_node->color == RBT_RED);
20091bc: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
20091c0: 80 a1 20 01 cmp %g4, 1
20091c4: 22 80 00 04 be,a 20091d4 <_RBTree_Validate_insert_unprotected+0x34>
20091c8: c8 00 80 00 ld [ %g2 ], %g4
20091cc: 81 c7 e0 08 ret
20091d0: 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;
20091d4: 80 a1 20 00 cmp %g4, 0
20091d8: 02 80 00 0c be 2009208 <_RBTree_Validate_insert_unprotected+0x68><== NEVER TAKEN
20091dc: 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])
20091e0: 80 a0 40 0f cmp %g1, %o7
20091e4: 02 80 00 59 be 2009348 <_RBTree_Validate_insert_unprotected+0x1a8>
20091e8: 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);
20091ec: 80 a1 20 00 cmp %g4, 0
20091f0: 22 80 00 07 be,a 200920c <_RBTree_Validate_insert_unprotected+0x6c>
20091f4: c8 00 60 04 ld [ %g1 + 4 ], %g4
20091f8: da 01 20 10 ld [ %g4 + 0x10 ], %o5
20091fc: 80 a3 60 01 cmp %o5, 1
2009200: 22 80 00 4c be,a 2009330 <_RBTree_Validate_insert_unprotected+0x190>
2009204: c0 20 60 10 clr [ %g1 + 0x10 ]
the_node->parent->color = RBT_BLACK;
u->color = RBT_BLACK;
g->color = RBT_RED;
the_node = g;
} else { /* if uncle is black */
RBTree_Direction dir = the_node != the_node->parent->child[0];
2009208: c8 00 60 04 ld [ %g1 + 4 ], %g4
RBTree_Direction pdir = the_node->parent != g->child[0];
200920c: 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];
2009210: 88 19 00 18 xor %g4, %i0, %g4
2009214: 80 a0 00 04 cmp %g0, %g4
2009218: 9a 40 20 00 addx %g0, 0, %o5
RBTree_Direction pdir = the_node->parent != g->child[0];
200921c: 80 a0 00 0f cmp %g0, %o7
2009220: 88 40 20 00 addx %g0, 0, %g4
/* ensure node is on the same branch direction as parent */
if (dir != pdir) {
2009224: 80 a3 40 04 cmp %o5, %g4
2009228: 02 80 00 46 be 2009340 <_RBTree_Validate_insert_unprotected+0x1a0>
200922c: 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;
2009230: 98 22 c0 04 sub %o3, %g4, %o4
2009234: 9b 2b 20 02 sll %o4, 2, %o5
2009238: 9a 00 40 0d add %g1, %o5, %o5
200923c: de 03 60 04 ld [ %o5 + 4 ], %o7
2009240: 80 a3 e0 00 cmp %o7, 0
2009244: 02 80 00 16 be 200929c <_RBTree_Validate_insert_unprotected+0xfc><== NEVER TAKEN
2009248: 89 29 20 02 sll %g4, 2, %g4
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
200924c: 94 03 c0 04 add %o7, %g4, %o2
2009250: d2 02 a0 04 ld [ %o2 + 4 ], %o1
2009254: d2 23 60 04 st %o1, [ %o5 + 4 ]
if (c->child[dir])
2009258: da 02 a0 04 ld [ %o2 + 4 ], %o5
200925c: 80 a3 60 00 cmp %o5, 0
2009260: 22 80 00 05 be,a 2009274 <_RBTree_Validate_insert_unprotected+0xd4>
2009264: 9a 03 c0 04 add %o7, %g4, %o5
c->child[dir]->parent = the_node;
2009268: c2 23 40 00 st %g1, [ %o5 ]
200926c: c4 00 40 00 ld [ %g1 ], %g2
c->child[dir] = the_node;
2009270: 9a 03 c0 04 add %o7, %g4, %o5
2009274: c2 23 60 04 st %g1, [ %o5 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
2009278: da 00 a0 04 ld [ %g2 + 4 ], %o5
c->parent = the_node->parent;
200927c: 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;
2009280: 9a 18 40 0d xor %g1, %o5, %o5
c->parent = the_node->parent;
the_node->parent = c;
2009284: 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;
2009288: 80 a0 00 0d cmp %g0, %o5
200928c: 82 40 20 00 addx %g0, 0, %g1
2009290: 83 28 60 02 sll %g1, 2, %g1
2009294: 84 00 80 01 add %g2, %g1, %g2
2009298: de 20 a0 04 st %o7, [ %g2 + 4 ]
_RBTree_Rotate(the_node->parent, pdir);
the_node = the_node->child[pdir];
200929c: b0 06 00 04 add %i0, %g4, %i0
20092a0: f0 06 20 04 ld [ %i0 + 4 ], %i0
20092a4: c2 06 00 00 ld [ %i0 ], %g1
}
the_node->parent->color = RBT_BLACK;
20092a8: c0 20 60 10 clr [ %g1 + 0x10 ]
RBTree_Direction dir
)
{
RBTree_Node *c;
if (the_node == NULL) return;
if (the_node->child[(1-dir)] == NULL) return;
20092ac: 88 00 c0 04 add %g3, %g4, %g4
20092b0: c2 01 20 04 ld [ %g4 + 4 ], %g1
20092b4: 80 a0 60 00 cmp %g1, 0
20092b8: 02 bf ff bc be 20091a8 <_RBTree_Validate_insert_unprotected+0x8><== NEVER TAKEN
20092bc: d6 20 e0 10 st %o3, [ %g3 + 0x10 ]
c = the_node->child[(1-dir)];
the_node->child[(1-dir)] = c->child[dir];
20092c0: 99 2b 20 02 sll %o4, 2, %o4
20092c4: 84 00 40 0c add %g1, %o4, %g2
20092c8: de 00 a0 04 ld [ %g2 + 4 ], %o7
20092cc: de 21 20 04 st %o7, [ %g4 + 4 ]
if (c->child[dir])
20092d0: c4 00 a0 04 ld [ %g2 + 4 ], %g2
20092d4: 80 a0 a0 00 cmp %g2, 0
20092d8: 32 80 00 02 bne,a 20092e0 <_RBTree_Validate_insert_unprotected+0x140>
20092dc: 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;
20092e0: 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;
20092e4: 98 00 40 0c add %g1, %o4, %o4
20092e8: c6 23 20 04 st %g3, [ %o4 + 4 ]
the_node->parent->child[the_node != the_node->parent->child[0]] = c;
20092ec: c8 00 a0 04 ld [ %g2 + 4 ], %g4
c->parent = the_node->parent;
20092f0: c4 20 40 00 st %g2, [ %g1 ]
the_node->parent = c;
20092f4: 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;
20092f8: 88 19 00 03 xor %g4, %g3, %g4
20092fc: 80 a0 00 04 cmp %g0, %g4
2009300: 86 40 20 00 addx %g0, 0, %g3
2009304: 87 28 e0 02 sll %g3, 2, %g3
2009308: 84 00 80 03 add %g2, %g3, %g2
200930c: c2 20 a0 04 st %g1, [ %g2 + 4 ]
ISR_Level level;
_ISR_Disable( level );
_RBTree_Insert_unprotected( tree, node );
_ISR_Enable( level );
}
2009310: 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;
2009314: c4 00 40 00 ld [ %g1 ], %g2
2009318: 86 90 a0 00 orcc %g2, 0, %g3
200931c: 32 bf ff a9 bne,a 20091c0 <_RBTree_Validate_insert_unprotected+0x20><== ALWAYS TAKEN
2009320: c8 00 60 10 ld [ %g1 + 0x10 ], %g4
/* now rotate grandparent in the other branch direction (toward uncle) */
_RBTree_Rotate(g, (1-pdir));
}
}
if(!the_node->parent->parent) the_node->color = RBT_BLACK;
2009324: c0 26 20 10 clr [ %i0 + 0x10 ] <== NOT EXECUTED
2009328: 81 c7 e0 08 ret <== NOT EXECUTED
200932c: 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;
2009330: c0 21 20 10 clr [ %g4 + 0x10 ]
g->color = RBT_RED;
2009334: da 20 a0 10 st %o5, [ %g2 + 0x10 ]
2009338: 10 bf ff 9c b 20091a8 <_RBTree_Validate_insert_unprotected+0x8>
200933c: b0 10 00 02 mov %g2, %i0
2009340: 10 bf ff da b 20092a8 <_RBTree_Validate_insert_unprotected+0x108>
2009344: 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];
2009348: 10 bf ff a9 b 20091ec <_RBTree_Validate_insert_unprotected+0x4c>
200934c: c8 00 a0 08 ld [ %g2 + 8 ], %g4
02006d30 <_RTEMS_tasks_Initialize_user_tasks_body>:
*
* Output parameters: NONE
*/
void _RTEMS_tasks_Initialize_user_tasks_body( void )
{
2006d30: 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;
2006d34: 03 00 80 73 sethi %hi(0x201cc00), %g1
2006d38: 82 10 60 74 or %g1, 0x74, %g1 ! 201cc74 <Configuration_RTEMS_API>
2006d3c: 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 )
2006d40: 80 a7 60 00 cmp %i5, 0
2006d44: 02 80 00 18 be 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x74>
2006d48: 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++ ) {
2006d4c: 80 a6 e0 00 cmp %i3, 0
2006d50: 02 80 00 15 be 2006da4 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN
2006d54: b8 10 20 00 clr %i4
return_value = rtems_task_create(
2006d58: d4 07 60 04 ld [ %i5 + 4 ], %o2
2006d5c: d0 07 40 00 ld [ %i5 ], %o0
2006d60: d2 07 60 08 ld [ %i5 + 8 ], %o1
2006d64: d6 07 60 14 ld [ %i5 + 0x14 ], %o3
2006d68: d8 07 60 0c ld [ %i5 + 0xc ], %o4
2006d6c: 7f ff ff 70 call 2006b2c <rtems_task_create>
2006d70: 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 ) )
2006d74: 94 92 20 00 orcc %o0, 0, %o2
2006d78: 12 80 00 0d bne 2006dac <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2006d7c: d0 07 bf fc ld [ %fp + -4 ], %o0
_Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value );
return_value = rtems_task_start(
2006d80: d4 07 60 18 ld [ %i5 + 0x18 ], %o2
2006d84: 40 00 00 0e call 2006dbc <rtems_task_start>
2006d88: 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 ) )
2006d8c: 94 92 20 00 orcc %o0, 0, %o2
2006d90: 12 80 00 07 bne 2006dac <_RTEMS_tasks_Initialize_user_tasks_body+0x7c>
2006d94: b8 07 20 01 inc %i4
return;
/*
* Now iterate over the initialization tasks and create/start them.
*/
for ( index=0 ; index < maximum ; index++ ) {
2006d98: 80 a7 00 1b cmp %i4, %i3
2006d9c: 12 bf ff ef bne 2006d58 <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN
2006da0: ba 07 60 1c add %i5, 0x1c, %i5
2006da4: 81 c7 e0 08 ret
2006da8: 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 );
2006dac: 90 10 20 01 mov 1, %o0
2006db0: 40 00 04 0f call 2007dec <_Internal_error_Occurred>
2006db4: 92 10 20 01 mov 1, %o1
0200cebc <_RTEMS_tasks_Switch_extension>:
/*
* Per Task Variables
*/
tvp = executing->task_variables;
200cebc: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200cec0: 80 a0 60 00 cmp %g1, 0
200cec4: 22 80 00 0c be,a 200cef4 <_RTEMS_tasks_Switch_extension+0x38>
200cec8: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
tvp->tval = *tvp->ptr;
200cecc: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->gval;
200ced0: c6 00 60 08 ld [ %g1 + 8 ], %g3
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
tvp->tval = *tvp->ptr;
200ced4: c8 00 80 00 ld [ %g2 ], %g4
200ced8: c8 20 60 0c st %g4, [ %g1 + 0xc ]
*tvp->ptr = tvp->gval;
200cedc: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200cee0: c2 00 40 00 ld [ %g1 ], %g1
/*
* Per Task Variables
*/
tvp = executing->task_variables;
while (tvp) {
200cee4: 80 a0 60 00 cmp %g1, 0
200cee8: 32 bf ff fa bne,a 200ced0 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN
200ceec: 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;
200cef0: c2 02 61 64 ld [ %o1 + 0x164 ], %g1
while (tvp) {
200cef4: 80 a0 60 00 cmp %g1, 0
200cef8: 02 80 00 0b be 200cf24 <_RTEMS_tasks_Switch_extension+0x68>
200cefc: 01 00 00 00 nop
tvp->gval = *tvp->ptr;
200cf00: c4 00 60 04 ld [ %g1 + 4 ], %g2
*tvp->ptr = tvp->tval;
200cf04: 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;
200cf08: c8 00 80 00 ld [ %g2 ], %g4
200cf0c: c8 20 60 08 st %g4, [ %g1 + 8 ]
*tvp->ptr = tvp->tval;
200cf10: c6 20 80 00 st %g3, [ %g2 ]
tvp = (rtems_task_variable_t *)tvp->next;
200cf14: c2 00 40 00 ld [ %g1 ], %g1
*tvp->ptr = tvp->gval;
tvp = (rtems_task_variable_t *)tvp->next;
}
tvp = heir->task_variables;
while (tvp) {
200cf18: 80 a0 60 00 cmp %g1, 0
200cf1c: 32 bf ff fa bne,a 200cf04 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN
200cf20: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED
200cf24: 81 c3 e0 08 retl
02007ab0 <_Rate_monotonic_Timeout>:
void _Rate_monotonic_Timeout(
Objects_Id id,
void *ignored
)
{
2007ab0: 9d e3 bf 98 save %sp, -104, %sp
2007ab4: 11 00 80 7d sethi %hi(0x201f400), %o0
2007ab8: 92 10 00 18 mov %i0, %o1
2007abc: 90 12 22 84 or %o0, 0x284, %o0
2007ac0: 40 00 08 47 call 2009bdc <_Objects_Get>
2007ac4: 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 ) {
2007ac8: c2 07 bf fc ld [ %fp + -4 ], %g1
2007acc: 80 a0 60 00 cmp %g1, 0
2007ad0: 12 80 00 17 bne 2007b2c <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN
2007ad4: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
the_thread = the_period->owner;
2007ad8: d0 02 20 40 ld [ %o0 + 0x40 ], %o0
if ( _States_Is_waiting_for_period( the_thread->current_state ) &&
2007adc: 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);
2007ae0: c4 02 20 10 ld [ %o0 + 0x10 ], %g2
2007ae4: 80 88 80 01 btst %g2, %g1
2007ae8: 22 80 00 08 be,a 2007b08 <_Rate_monotonic_Timeout+0x58>
2007aec: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007af0: c4 02 20 20 ld [ %o0 + 0x20 ], %g2
2007af4: c2 07 60 08 ld [ %i5 + 8 ], %g1
2007af8: 80 a0 80 01 cmp %g2, %g1
2007afc: 02 80 00 1a be 2007b64 <_Rate_monotonic_Timeout+0xb4>
2007b00: 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 ) {
2007b04: c2 07 60 38 ld [ %i5 + 0x38 ], %g1
2007b08: 80 a0 60 01 cmp %g1, 1
2007b0c: 02 80 00 0a be 2007b34 <_Rate_monotonic_Timeout+0x84>
2007b10: 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;
2007b14: 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--;
2007b18: 03 00 80 7d sethi %hi(0x201f400), %g1
2007b1c: c4 00 63 f0 ld [ %g1 + 0x3f0 ], %g2 ! 201f7f0 <_Thread_Dispatch_disable_level>
2007b20: 84 00 bf ff add %g2, -1, %g2
2007b24: c4 20 63 f0 st %g2, [ %g1 + 0x3f0 ]
return _Thread_Dispatch_disable_level;
2007b28: c2 00 63 f0 ld [ %g1 + 0x3f0 ], %g1
2007b2c: 81 c7 e0 08 ret
2007b30: 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;
2007b34: 82 10 20 03 mov 3, %g1
_Rate_monotonic_Initiate_statistics( the_period );
2007b38: 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;
2007b3c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
_Rate_monotonic_Initiate_statistics( the_period );
2007b40: 7f ff fe 5a call 20074a8 <_Rate_monotonic_Initiate_statistics>
2007b44: 01 00 00 00 nop
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b48: c2 07 60 3c ld [ %i5 + 0x3c ], %g1
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b4c: 11 00 80 7e sethi %hi(0x201f800), %o0
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007b50: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007b54: 90 12 20 ac or %o0, 0xac, %o0
2007b58: 40 00 10 3c call 200bc48 <_Watchdog_Insert>
2007b5c: 92 07 60 10 add %i5, 0x10, %o1
2007b60: 30 bf ff ee b,a 2007b18 <_Rate_monotonic_Timeout+0x68>
RTEMS_INLINE_ROUTINE void _Thread_Unblock (
Thread_Control *the_thread
)
{
_Thread_Clear_state( the_thread, STATES_BLOCKED );
2007b64: 40 00 0b 23 call 200a7f0 <_Thread_Clear_state>
2007b68: 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 );
2007b6c: 10 bf ff f5 b 2007b40 <_Rate_monotonic_Timeout+0x90>
2007b70: 90 10 00 1d mov %i5, %o0
02008bdc <_Scheduler_priority_Tick>:
#include <rtems/system.h>
#include <rtems/score/schedulerpriority.h>
void _Scheduler_priority_Tick( void )
{
2008bdc: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *executing;
executing = _Thread_Executing;
2008be0: 03 00 80 77 sethi %hi(0x201dc00), %g1
2008be4: d0 00 62 d4 ld [ %g1 + 0x2d4 ], %o0 ! 201ded4 <_Per_CPU_Information+0xc>
/*
* If the thread is not preemptible or is not ready, then
* just return.
*/
if ( !executing->is_preemptible )
2008be8: c2 0a 20 74 ldub [ %o0 + 0x74 ], %g1
2008bec: 80 a0 60 00 cmp %g1, 0
2008bf0: 02 80 00 26 be 2008c88 <_Scheduler_priority_Tick+0xac>
2008bf4: 01 00 00 00 nop
return;
if ( !_States_Is_ready( executing->current_state ) )
2008bf8: c2 02 20 10 ld [ %o0 + 0x10 ], %g1
2008bfc: 80 a0 60 00 cmp %g1, 0
2008c00: 12 80 00 22 bne 2008c88 <_Scheduler_priority_Tick+0xac>
2008c04: 01 00 00 00 nop
/*
* The cpu budget algorithm determines what happens next.
*/
switch ( executing->budget_algorithm ) {
2008c08: c2 02 20 7c ld [ %o0 + 0x7c ], %g1
2008c0c: 80 a0 60 01 cmp %g1, 1
2008c10: 0a 80 00 07 bcs 2008c2c <_Scheduler_priority_Tick+0x50>
2008c14: 80 a0 60 02 cmp %g1, 2
2008c18: 28 80 00 10 bleu,a 2008c58 <_Scheduler_priority_Tick+0x7c>
2008c1c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1
2008c20: 80 a0 60 03 cmp %g1, 3
2008c24: 22 80 00 04 be,a 2008c34 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN
2008c28: c2 02 20 78 ld [ %o0 + 0x78 ], %g1
2008c2c: 81 c7 e0 08 ret
2008c30: 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 )
2008c34: 82 00 7f ff add %g1, -1, %g1
2008c38: 80 a0 60 00 cmp %g1, 0
2008c3c: 12 bf ff fc bne 2008c2c <_Scheduler_priority_Tick+0x50>
2008c40: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
(*executing->budget_callout)( executing );
2008c44: c2 02 20 80 ld [ %o0 + 0x80 ], %g1
2008c48: 9f c0 40 00 call %g1
2008c4c: 01 00 00 00 nop
2008c50: 81 c7 e0 08 ret
2008c54: 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 ) {
2008c58: 82 00 7f ff add %g1, -1, %g1
2008c5c: 80 a0 60 00 cmp %g1, 0
2008c60: 14 bf ff f3 bg 2008c2c <_Scheduler_priority_Tick+0x50>
2008c64: 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();
2008c68: 03 00 80 73 sethi %hi(0x201cc00), %g1
2008c6c: c2 00 61 20 ld [ %g1 + 0x120 ], %g1 ! 201cd20 <_Scheduler+0xc>
2008c70: 9f c0 40 00 call %g1
2008c74: 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;
2008c78: 03 00 80 76 sethi %hi(0x201d800), %g1
2008c7c: d0 07 bf fc ld [ %fp + -4 ], %o0
2008c80: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1
2008c84: c2 22 20 78 st %g1, [ %o0 + 0x78 ]
2008c88: 81 c7 e0 08 ret
2008c8c: 81 e8 00 00 restore
0200934c <_Scheduler_simple_Ready_queue_enqueue_first>:
{
Chain_Control *ready;
Chain_Node *the_node;
Thread_Control *current;
ready = (Chain_Control *)_Scheduler.information;
200934c: 03 00 80 76 sethi %hi(0x201d800), %g1
*/
RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First(
Chain_Control *the_chain
)
{
return _Chain_Head( the_chain )->next;
2009350: c2 00 63 f4 ld [ %g1 + 0x3f4 ], %g1 ! 201dbf4 <_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 ) {
2009354: c6 02 20 14 ld [ %o0 + 0x14 ], %g3
2009358: c2 00 40 00 ld [ %g1 ], %g1
200935c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
2009360: 80 a0 80 03 cmp %g2, %g3
2009364: 3a 80 00 08 bcc,a 2009384 <_Scheduler_simple_Ready_queue_enqueue_first+0x38>
2009368: 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 ) {
200936c: 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 ) {
2009370: c4 00 60 14 ld [ %g1 + 0x14 ], %g2
2009374: 80 a0 80 03 cmp %g2, %g3
2009378: 2a bf ff fe bcs,a 2009370 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN
200937c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED
current = (Thread_Control *)current->Object.Node.previous;
2009380: c2 00 60 04 ld [ %g1 + 4 ], %g1
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
2009384: c4 00 40 00 ld [ %g1 ], %g2
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
2009388: c2 22 20 04 st %g1, [ %o0 + 4 ]
before_node = after_node->next;
after_node->next = the_node;
200938c: d0 20 40 00 st %o0, [ %g1 ]
the_node->next = before_node;
2009390: c4 22 00 00 st %g2, [ %o0 ]
}
}
/* enqueue */
_Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node );
}
2009394: 81 c3 e0 08 retl
2009398: d0 20 a0 04 st %o0, [ %g2 + 4 ]
020074f4 <_TOD_Validate>:
*/
bool _TOD_Validate(
const rtems_time_of_day *the_tod
)
{
20074f4: 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();
20074f8: 03 00 80 7c sethi %hi(0x201f000), %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;
20074fc: 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) ||
2007500: 80 a6 20 00 cmp %i0, 0
2007504: 02 80 00 2c be 20075b4 <_TOD_Validate+0xc0> <== NEVER TAKEN
2007508: d2 00 63 48 ld [ %g1 + 0x348 ], %o1
)
{
uint32_t days_in_month;
uint32_t ticks_per_second;
ticks_per_second = TOD_MICROSECONDS_PER_SECOND /
200750c: 11 00 03 d0 sethi %hi(0xf4000), %o0
2007510: 40 00 4c a5 call 201a7a4 <.udiv>
2007514: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
rtems_configuration_get_microseconds_per_tick();
if ((!the_tod) ||
2007518: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
200751c: 80 a2 00 01 cmp %o0, %g1
2007520: 28 80 00 26 bleu,a 20075b8 <_TOD_Validate+0xc4>
2007524: b0 0f 60 01 and %i5, 1, %i0
(the_tod->ticks >= ticks_per_second) ||
2007528: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
200752c: 80 a0 60 3b cmp %g1, 0x3b
2007530: 38 80 00 22 bgu,a 20075b8 <_TOD_Validate+0xc4>
2007534: b0 0f 60 01 and %i5, 1, %i0
(the_tod->second >= TOD_SECONDS_PER_MINUTE) ||
2007538: c2 06 20 10 ld [ %i0 + 0x10 ], %g1
200753c: 80 a0 60 3b cmp %g1, 0x3b
2007540: 38 80 00 1e bgu,a 20075b8 <_TOD_Validate+0xc4>
2007544: b0 0f 60 01 and %i5, 1, %i0
(the_tod->minute >= TOD_MINUTES_PER_HOUR) ||
2007548: c2 06 20 0c ld [ %i0 + 0xc ], %g1
200754c: 80 a0 60 17 cmp %g1, 0x17
2007550: 38 80 00 1a bgu,a 20075b8 <_TOD_Validate+0xc4>
2007554: b0 0f 60 01 and %i5, 1, %i0
(the_tod->hour >= TOD_HOURS_PER_DAY) ||
(the_tod->month == 0) ||
2007558: 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) ||
200755c: 80 a0 60 00 cmp %g1, 0
2007560: 02 80 00 15 be 20075b4 <_TOD_Validate+0xc0> <== NEVER TAKEN
2007564: 80 a0 60 0c cmp %g1, 0xc
(the_tod->month == 0) ||
2007568: 38 80 00 14 bgu,a 20075b8 <_TOD_Validate+0xc4>
200756c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->month > TOD_MONTHS_PER_YEAR) ||
(the_tod->year < TOD_BASE_YEAR) ||
2007570: 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) ||
2007574: 80 a0 a7 c3 cmp %g2, 0x7c3
2007578: 28 80 00 10 bleu,a 20075b8 <_TOD_Validate+0xc4>
200757c: b0 0f 60 01 and %i5, 1, %i0
(the_tod->year < TOD_BASE_YEAR) ||
(the_tod->day == 0) )
2007580: 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) ||
2007584: 80 a0 e0 00 cmp %g3, 0
2007588: 02 80 00 0b be 20075b4 <_TOD_Validate+0xc0> <== NEVER TAKEN
200758c: 80 88 a0 03 btst 3, %g2
(the_tod->day == 0) )
return false;
if ( (the_tod->year % 4) == 0 )
2007590: 32 80 00 0c bne,a 20075c0 <_TOD_Validate+0xcc>
2007594: 83 28 60 02 sll %g1, 2, %g1
days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ];
2007598: 82 00 60 0d add %g1, 0xd, %g1
200759c: 05 00 80 77 sethi %hi(0x201dc00), %g2
20075a0: 83 28 60 02 sll %g1, 2, %g1
20075a4: 84 10 a2 a8 or %g2, 0x2a8, %g2
20075a8: 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(
20075ac: 80 a0 40 03 cmp %g1, %g3
20075b0: ba 60 3f ff subx %g0, -1, %i5
if ( the_tod->day > days_in_month )
return false;
return true;
}
20075b4: b0 0f 60 01 and %i5, 1, %i0
20075b8: 81 c7 e0 08 ret
20075bc: 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 ];
20075c0: 05 00 80 77 sethi %hi(0x201dc00), %g2
20075c4: 84 10 a2 a8 or %g2, 0x2a8, %g2 ! 201dea8 <_TOD_Days_per_month>
20075c8: 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(
20075cc: 80 a0 40 03 cmp %g1, %g3
20075d0: 10 bf ff f9 b 20075b4 <_TOD_Validate+0xc0>
20075d4: ba 60 3f ff subx %g0, -1, %i5
02008eb4 <_Thread_Change_priority>:
void _Thread_Change_priority(
Thread_Control *the_thread,
Priority_Control new_priority,
bool prepend_it
)
{
2008eb4: 9d e3 bf a0 save %sp, -96, %sp
States_Control state, original_state;
/*
* Save original state
*/
original_state = the_thread->current_state;
2008eb8: 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 );
2008ebc: 40 00 03 a8 call 2009d5c <_Thread_Set_transient>
2008ec0: 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 )
2008ec4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
2008ec8: 80 a0 40 19 cmp %g1, %i1
2008ecc: 02 80 00 05 be 2008ee0 <_Thread_Change_priority+0x2c>
2008ed0: ba 10 00 18 mov %i0, %i5
_Thread_Set_priority( the_thread, new_priority );
2008ed4: 90 10 00 18 mov %i0, %o0
2008ed8: 40 00 03 87 call 2009cf4 <_Thread_Set_priority>
2008edc: 92 10 00 19 mov %i1, %o1
_ISR_Disable( level );
2008ee0: 7f ff e4 c7 call 20021fc <sparc_disable_interrupts>
2008ee4: 01 00 00 00 nop
2008ee8: 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;
2008eec: f6 07 60 10 ld [ %i5 + 0x10 ], %i3
if ( state != STATES_TRANSIENT ) {
2008ef0: 80 a6 e0 04 cmp %i3, 4
2008ef4: 02 80 00 18 be 2008f54 <_Thread_Change_priority+0xa0>
2008ef8: 80 8f 20 04 btst 4, %i4
/* Only clear the transient state if it wasn't set already */
if ( ! _States_Is_transient( original_state ) )
2008efc: 02 80 00 0b be 2008f28 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN
2008f00: 82 0e ff fb and %i3, -5, %g1
the_thread->current_state = _States_Clear( STATES_TRANSIENT, state );
_ISR_Enable( level );
2008f04: 7f ff e4 c2 call 200220c <sparc_enable_interrupts> <== NOT EXECUTED
2008f08: 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);
2008f0c: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED
2008f10: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0><== NOT EXECUTED
if ( _States_Is_waiting_on_thread_queue( state ) ) {
2008f14: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED
2008f18: 32 80 00 0d bne,a 2008f4c <_Thread_Change_priority+0x98> <== NOT EXECUTED
2008f1c: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED
2008f20: 81 c7 e0 08 ret
2008f24: 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 );
2008f28: c2 27 60 10 st %g1, [ %i5 + 0x10 ]
_ISR_Enable( level );
2008f2c: 7f ff e4 b8 call 200220c <sparc_enable_interrupts>
2008f30: 90 10 00 19 mov %i1, %o0
2008f34: 03 00 00 ef sethi %hi(0x3bc00), %g1
2008f38: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( state ) ) {
2008f3c: 80 8e c0 01 btst %i3, %g1
2008f40: 02 bf ff f8 be 2008f20 <_Thread_Change_priority+0x6c>
2008f44: 01 00 00 00 nop
_Thread_queue_Requeue( the_thread->Wait.queue, the_thread );
2008f48: f0 07 60 44 ld [ %i5 + 0x44 ], %i0
2008f4c: 40 00 03 39 call 2009c30 <_Thread_queue_Requeue>
2008f50: 93 e8 00 1d restore %g0, %i5, %o1
2008f54: 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 ) ) {
2008f58: 12 80 00 08 bne 2008f78 <_Thread_Change_priority+0xc4> <== NEVER TAKEN
2008f5c: b8 17 21 14 or %i4, 0x114, %i4 ! 201cd14 <_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 )
2008f60: 80 a6 a0 00 cmp %i2, 0
2008f64: 02 80 00 1b be 2008fd0 <_Thread_Change_priority+0x11c>
2008f68: c0 27 60 10 clr [ %i5 + 0x10 ]
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue_first( the_thread );
2008f6c: c2 07 20 28 ld [ %i4 + 0x28 ], %g1
2008f70: 9f c0 40 00 call %g1
2008f74: 90 10 00 1d mov %i5, %o0
_Scheduler_Enqueue_first( the_thread );
else
_Scheduler_Enqueue( the_thread );
}
_ISR_Flash( level );
2008f78: 7f ff e4 a5 call 200220c <sparc_enable_interrupts>
2008f7c: 90 10 00 19 mov %i1, %o0
2008f80: 7f ff e4 9f call 20021fc <sparc_disable_interrupts>
2008f84: 01 00 00 00 nop
2008f88: 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();
2008f8c: c2 07 20 08 ld [ %i4 + 8 ], %g1
2008f90: 9f c0 40 00 call %g1
2008f94: 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 );
2008f98: 03 00 80 77 sethi %hi(0x201dc00), %g1
2008f9c: 82 10 62 c8 or %g1, 0x2c8, %g1 ! 201dec8 <_Per_CPU_Information>
2008fa0: 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() &&
2008fa4: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
2008fa8: 80 a0 80 03 cmp %g2, %g3
2008fac: 02 80 00 07 be 2008fc8 <_Thread_Change_priority+0x114>
2008fb0: 01 00 00 00 nop
2008fb4: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
2008fb8: 80 a0 a0 00 cmp %g2, 0
2008fbc: 02 80 00 03 be 2008fc8 <_Thread_Change_priority+0x114>
2008fc0: 84 10 20 01 mov 1, %g2
_Thread_Executing->is_preemptible )
_Thread_Dispatch_necessary = true;
2008fc4: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
_ISR_Enable( level );
2008fc8: 7f ff e4 91 call 200220c <sparc_enable_interrupts>
2008fcc: 81 e8 00 00 restore
*/
RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue(
Thread_Control *the_thread
)
{
_Scheduler.Operations.enqueue( the_thread );
2008fd0: c2 07 20 24 ld [ %i4 + 0x24 ], %g1
2008fd4: 9f c0 40 00 call %g1
2008fd8: 90 10 00 1d mov %i5, %o0
2008fdc: 30 bf ff e7 b,a 2008f78 <_Thread_Change_priority+0xc4>
020091f8 <_Thread_Delay_ended>:
void _Thread_Delay_ended(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
20091f8: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
20091fc: 90 10 00 18 mov %i0, %o0
2009200: 40 00 00 76 call 20093d8 <_Thread_Get>
2009204: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009208: c2 07 bf fc ld [ %fp + -4 ], %g1
200920c: 80 a0 60 00 cmp %g1, 0
2009210: 12 80 00 09 bne 2009234 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN
2009214: 13 04 00 00 sethi %hi(0x10000000), %o1
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_Clear_state(
2009218: 7f ff ff 72 call 2008fe0 <_Thread_Clear_state>
200921c: 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--;
2009220: 03 00 80 76 sethi %hi(0x201d800), %g1
2009224: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 201d990 <_Thread_Dispatch_disable_level>
2009228: 84 00 bf ff add %g2, -1, %g2
200922c: c4 20 61 90 st %g2, [ %g1 + 0x190 ]
return _Thread_Dispatch_disable_level;
2009230: c2 00 61 90 ld [ %g1 + 0x190 ], %g1
2009234: 81 c7 e0 08 ret
2009238: 81 e8 00 00 restore
0200923c <_Thread_Dispatch>:
* INTERRUPT LATENCY:
* dispatch thread
* no dispatch thread
*/
void _Thread_Dispatch( void )
{
200923c: 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++;
2009240: 21 00 80 76 sethi %hi(0x201d800), %l0
2009244: c2 04 21 90 ld [ %l0 + 0x190 ], %g1 ! 201d990 <_Thread_Dispatch_disable_level>
2009248: 82 00 60 01 inc %g1
200924c: c2 24 21 90 st %g1, [ %l0 + 0x190 ]
return _Thread_Dispatch_disable_level;
2009250: c2 04 21 90 ld [ %l0 + 0x190 ], %g1
#endif
/*
* Now determine if we need to perform a dispatch on the current CPU.
*/
executing = _Thread_Executing;
2009254: 39 00 80 77 sethi %hi(0x201dc00), %i4
2009258: b8 17 22 c8 or %i4, 0x2c8, %i4 ! 201dec8 <_Per_CPU_Information>
_ISR_Disable( level );
200925c: 7f ff e3 e8 call 20021fc <sparc_disable_interrupts>
2009260: fa 07 20 0c ld [ %i4 + 0xc ], %i5
while ( _Thread_Dispatch_necessary == true ) {
2009264: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1
2009268: 80 a0 60 00 cmp %g1, 0
200926c: 02 80 00 48 be 200938c <_Thread_Dispatch+0x150>
2009270: 01 00 00 00 nop
heir = _Thread_Heir;
2009274: f6 07 20 10 ld [ %i4 + 0x10 ], %i3
_Thread_Dispatch_necessary = false;
2009278: 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 )
200927c: 80 a7 40 1b cmp %i5, %i3
2009280: 02 80 00 43 be 200938c <_Thread_Dispatch+0x150>
2009284: f6 27 20 0c st %i3, [ %i4 + 0xc ]
2009288: 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;
200928c: 23 00 80 76 sethi %hi(0x201d800), %l1
2009290: b0 16 22 18 or %i0, 0x218, %i0
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
_Timestamp_Subtract(
2009294: 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 );
2009298: 10 80 00 37 b 2009374 <_Thread_Dispatch+0x138>
200929c: 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 );
20092a0: 7f ff e3 db call 200220c <sparc_enable_interrupts>
20092a4: 01 00 00 00 nop
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
{
Timestamp_Control uptime, ran;
_TOD_Get_uptime( &uptime );
20092a8: 40 00 10 46 call 200d3c0 <_TOD_Get_uptime>
20092ac: 90 07 bf f0 add %fp, -16, %o0
_Timestamp_Subtract(
20092b0: 90 10 00 19 mov %i1, %o0
20092b4: 92 07 bf f0 add %fp, -16, %o1
20092b8: 40 00 03 24 call 2009f48 <_Timespec_Subtract>
20092bc: 94 07 bf f8 add %fp, -8, %o2
&_Thread_Time_of_last_context_switch,
&uptime,
&ran
);
_Timestamp_Add_to( &executing->cpu_time_used, &ran );
20092c0: 90 07 60 84 add %i5, 0x84, %o0
20092c4: 40 00 03 08 call 2009ee4 <_Timespec_Add_to>
20092c8: 92 07 bf f8 add %fp, -8, %o1
_Thread_Time_of_last_context_switch = uptime;
20092cc: c4 07 bf f0 ld [ %fp + -16 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
20092d0: 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;
20092d4: c4 27 20 1c st %g2, [ %i4 + 0x1c ]
20092d8: c4 07 bf f4 ld [ %fp + -12 ], %g2
#endif
/*
* Switch libc's task specific data.
*/
if ( _Thread_libc_reent ) {
20092dc: 80 a0 60 00 cmp %g1, 0
20092e0: 02 80 00 06 be 20092f8 <_Thread_Dispatch+0xbc> <== NEVER TAKEN
20092e4: c4 27 20 20 st %g2, [ %i4 + 0x20 ]
executing->libc_reent = *_Thread_libc_reent;
20092e8: c4 00 40 00 ld [ %g1 ], %g2
20092ec: c4 27 61 54 st %g2, [ %i5 + 0x154 ]
*_Thread_libc_reent = heir->libc_reent;
20092f0: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2
20092f4: c4 20 40 00 st %g2, [ %g1 ]
}
_User_extensions_Thread_switch( executing, heir );
20092f8: 90 10 00 1d mov %i5, %o0
20092fc: 40 00 03 d7 call 200a258 <_User_extensions_Thread_switch>
2009300: 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 );
2009304: 90 07 60 c8 add %i5, 0xc8, %o0
2009308: 40 00 05 1b call 200a774 <_CPU_Context_switch>
200930c: 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) &&
2009310: c2 07 61 50 ld [ %i5 + 0x150 ], %g1
2009314: 80 a0 60 00 cmp %g1, 0
2009318: 02 80 00 0c be 2009348 <_Thread_Dispatch+0x10c>
200931c: d0 06 a2 14 ld [ %i2 + 0x214 ], %o0
2009320: 80 a7 40 08 cmp %i5, %o0
2009324: 02 80 00 09 be 2009348 <_Thread_Dispatch+0x10c>
2009328: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200932c: 02 80 00 04 be 200933c <_Thread_Dispatch+0x100>
2009330: 01 00 00 00 nop
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
2009334: 40 00 04 d6 call 200a68c <_CPU_Context_save_fp>
2009338: 90 02 21 50 add %o0, 0x150, %o0
_Context_Restore_fp( &executing->fp_context );
200933c: 40 00 04 f1 call 200a700 <_CPU_Context_restore_fp>
2009340: 90 07 61 50 add %i5, 0x150, %o0
_Thread_Allocated_fp = executing;
2009344: fa 26 a2 14 st %i5, [ %i2 + 0x214 ]
#endif
#endif
executing = _Thread_Executing;
_ISR_Disable( level );
2009348: 7f ff e3 ad call 20021fc <sparc_disable_interrupts>
200934c: 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 ) {
2009350: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1
2009354: 80 a0 60 00 cmp %g1, 0
2009358: 02 80 00 0d be 200938c <_Thread_Dispatch+0x150>
200935c: 01 00 00 00 nop
heir = _Thread_Heir;
2009360: f6 07 20 10 ld [ %i4 + 0x10 ], %i3
_Thread_Dispatch_necessary = false;
2009364: 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 )
2009368: 80 a6 c0 1d cmp %i3, %i5
200936c: 02 80 00 08 be 200938c <_Thread_Dispatch+0x150> <== NEVER TAKEN
2009370: 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 )
2009374: c2 06 e0 7c ld [ %i3 + 0x7c ], %g1
2009378: 80 a0 60 01 cmp %g1, 1
200937c: 12 bf ff c9 bne 20092a0 <_Thread_Dispatch+0x64>
2009380: c2 04 60 f4 ld [ %l1 + 0xf4 ], %g1
heir->cpu_time_budget = _Thread_Ticks_per_timeslice;
2009384: 10 bf ff c7 b 20092a0 <_Thread_Dispatch+0x64>
2009388: c2 26 e0 78 st %g1, [ %i3 + 0x78 ]
* This routine sets thread dispatch level to the
* value passed in.
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value)
{
_Thread_Dispatch_disable_level = value;
200938c: c0 24 21 90 clr [ %l0 + 0x190 ]
}
post_switch:
_Thread_Dispatch_set_disable_level( 0 );
_ISR_Enable( level );
2009390: 7f ff e3 9f call 200220c <sparc_enable_interrupts>
2009394: 01 00 00 00 nop
_API_extensions_Run_postswitch();
2009398: 7f ff f7 cd call 20072cc <_API_extensions_Run_postswitch>
200939c: 01 00 00 00 nop
}
20093a0: 81 c7 e0 08 ret
20093a4: 81 e8 00 00 restore
0200f738 <_Thread_Handler>:
*
* Output parameters: NONE
*/
void _Thread_Handler( void )
{
200f738: 9d e3 bf a0 save %sp, -96, %sp
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
static char doneConstructors;
char doneCons;
#endif
executing = _Thread_Executing;
200f73c: 03 00 80 77 sethi %hi(0x201dc00), %g1
200f740: fa 00 62 d4 ld [ %g1 + 0x2d4 ], %i5 ! 201ded4 <_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();
200f744: 3f 00 80 3d sethi %hi(0x200f400), %i7
200f748: be 17 e3 38 or %i7, 0x338, %i7 ! 200f738 <_Thread_Handler>
/*
* have to put level into a register for those cpu's that use
* inline asm here
*/
level = executing->Start.isr_level;
200f74c: d0 07 60 ac ld [ %i5 + 0xac ], %o0
_ISR_Set_level(level);
200f750: 7f ff ca af call 200220c <sparc_enable_interrupts>
200f754: 91 2a 20 08 sll %o0, 8, %o0
doneConstructors = 1;
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200f758: c4 07 61 50 ld [ %i5 + 0x150 ], %g2
level = executing->Start.isr_level;
_ISR_Set_level(level);
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200f75c: 03 00 80 75 sethi %hi(0x201d400), %g1
doneConstructors = 1;
200f760: 86 10 20 01 mov 1, %g3
level = executing->Start.isr_level;
_ISR_Set_level(level);
#if defined(EXECUTE_GLOBAL_CONSTRUCTORS)
doneCons = doneConstructors;
200f764: f6 08 62 4c ldub [ %g1 + 0x24c ], %i3
doneConstructors = 1;
#endif
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
#if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE )
if ( (executing->fp_context != NULL) &&
200f768: 80 a0 a0 00 cmp %g2, 0
200f76c: 02 80 00 0c be 200f79c <_Thread_Handler+0x64>
200f770: c6 28 62 4c stb %g3, [ %g1 + 0x24c ]
#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 );
200f774: 39 00 80 76 sethi %hi(0x201d800), %i4
200f778: d0 07 22 14 ld [ %i4 + 0x214 ], %o0 ! 201da14 <_Thread_Allocated_fp>
200f77c: 80 a7 40 08 cmp %i5, %o0
200f780: 02 80 00 07 be 200f79c <_Thread_Handler+0x64>
200f784: 80 a2 20 00 cmp %o0, 0
!_Thread_Is_allocated_fp( executing ) ) {
if ( _Thread_Allocated_fp != NULL )
200f788: 22 80 00 05 be,a 200f79c <_Thread_Handler+0x64>
200f78c: fa 27 22 14 st %i5, [ %i4 + 0x214 ]
_Context_Save_fp( &_Thread_Allocated_fp->fp_context );
200f790: 7f ff eb bf call 200a68c <_CPU_Context_save_fp>
200f794: 90 02 21 50 add %o0, 0x150, %o0
_Thread_Allocated_fp = executing;
200f798: fa 27 22 14 st %i5, [ %i4 + 0x214 ]
/*
* 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 );
200f79c: 7f ff ea 2d call 200a050 <_User_extensions_Thread_begin>
200f7a0: 90 10 00 1d mov %i5, %o0
/*
* At this point, the dispatch disable level BETTER be 1.
*/
_Thread_Enable_dispatch();
200f7a4: 7f ff e7 01 call 20093a8 <_Thread_Enable_dispatch>
200f7a8: b7 2e e0 18 sll %i3, 0x18, %i3
/*
* _init could be a weak symbol and we SHOULD test it but it isn't
* in any configuration I know of and it generates a warning on every
* RTEMS target configuration. --joel (12 May 2007)
*/
if (!doneCons) /* && (volatile void *)_init) */ {
200f7ac: 80 a6 e0 00 cmp %i3, 0
200f7b0: 02 80 00 0e be 200f7e8 <_Thread_Handler+0xb0>
200f7b4: 01 00 00 00 nop
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f7b8: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
200f7bc: 80 a0 60 00 cmp %g1, 0
200f7c0: 02 80 00 0e be 200f7f8 <_Thread_Handler+0xc0>
200f7c4: 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 ) {
200f7c8: 22 80 00 11 be,a 200f80c <_Thread_Handler+0xd4> <== ALWAYS TAKEN
200f7cc: 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 );
200f7d0: 7f ff ea 34 call 200a0a0 <_User_extensions_Thread_exitted>
200f7d4: 90 10 00 1d mov %i5, %o0
_Internal_error_Occurred(
200f7d8: 90 10 20 00 clr %o0
200f7dc: 92 10 20 01 mov 1, %o1
200f7e0: 7f ff e1 83 call 2007dec <_Internal_error_Occurred>
200f7e4: 94 10 20 05 mov 5, %o2
* _init could be a weak symbol and we SHOULD test it but it isn't
* in any configuration I know of and it generates a warning on every
* RTEMS target configuration. --joel (12 May 2007)
*/
if (!doneCons) /* && (volatile void *)_init) */ {
INIT_NAME ();
200f7e8: 40 00 35 00 call 201cbe8 <_init>
200f7ec: 01 00 00 00 nop
#endif
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
200f7f0: 10 bf ff f3 b 200f7bc <_Thread_Handler+0x84>
200f7f4: c2 07 60 94 ld [ %i5 + 0x94 ], %g1
executing->Wait.return_argument =
(*(Thread_Entry_numeric) executing->Start.entry_point)(
200f7f8: c2 07 60 90 ld [ %i5 + 0x90 ], %g1
200f7fc: 9f c0 40 00 call %g1
200f800: d0 07 60 9c ld [ %i5 + 0x9c ], %o0
}
#endif
if ( executing->Start.prototype == THREAD_START_NUMERIC ) {
executing->Wait.return_argument =
200f804: 10 bf ff f3 b 200f7d0 <_Thread_Handler+0x98>
200f808: 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)(
200f80c: 9f c0 40 00 call %g1
200f810: 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 =
200f814: 10 bf ff ef b 200f7d0 <_Thread_Handler+0x98>
200f818: d0 27 60 28 st %o0, [ %i5 + 0x28 ]
02009488 <_Thread_Initialize>:
Thread_CPU_budget_algorithms budget_algorithm,
Thread_CPU_budget_algorithm_callout budget_callout,
uint32_t isr_level,
Objects_Name name
)
{
2009488: 9d e3 bf a0 save %sp, -96, %sp
200948c: 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;
2009490: c0 26 61 58 clr [ %i1 + 0x158 ]
2009494: c0 26 61 5c clr [ %i1 + 0x15c ]
extensions_area = NULL;
the_thread->libc_reent = NULL;
2009498: 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
)
{
200949c: e0 07 a0 60 ld [ %fp + 0x60 ], %l0
20094a0: 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 ) {
20094a4: 80 a6 a0 00 cmp %i2, 0
20094a8: 02 80 00 6b be 2009654 <_Thread_Initialize+0x1cc>
20094ac: 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;
20094b0: c0 2e 60 b4 clrb [ %i1 + 0xb4 ]
20094b4: 90 10 00 1b mov %i3, %o0
Stack_Control *the_stack,
void *starting_address,
size_t size
)
{
the_stack->area = starting_address;
20094b8: f4 26 60 bc st %i2, [ %i1 + 0xbc ]
the_stack->size = size;
20094bc: 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 ) {
20094c0: 80 a7 20 00 cmp %i4, 0
20094c4: 12 80 00 48 bne 20095e4 <_Thread_Initialize+0x15c>
20094c8: b6 10 20 00 clr %i3
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
20094cc: 39 00 80 76 sethi %hi(0x201d800), %i4
20094d0: c2 07 22 24 ld [ %i4 + 0x224 ], %g1 ! 201da24 <_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;
20094d4: f6 26 61 50 st %i3, [ %i1 + 0x150 ]
the_thread->Start.fp_context = fp_area;
20094d8: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20094dc: c0 26 60 50 clr [ %i1 + 0x50 ]
the_watchdog->routine = routine;
20094e0: c0 26 60 64 clr [ %i1 + 0x64 ]
the_watchdog->id = id;
20094e4: c0 26 60 68 clr [ %i1 + 0x68 ]
#endif
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
20094e8: 80 a0 60 00 cmp %g1, 0
20094ec: 12 80 00 46 bne 2009604 <_Thread_Initialize+0x17c>
20094f0: c0 26 60 6c clr [ %i1 + 0x6c ]
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
20094f4: 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;
20094f8: 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;
20094fc: c2 07 a0 64 ld [ %fp + 0x64 ], %g1
/*
* General initialization
*/
the_thread->Start.is_preemptible = is_preemptible;
2009500: e2 2e 60 a0 stb %l1, [ %i1 + 0xa0 ]
the_thread->Start.budget_algorithm = budget_algorithm;
2009504: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ]
the_thread->Start.budget_callout = budget_callout;
switch ( budget_algorithm ) {
2009508: 80 a4 20 02 cmp %l0, 2
200950c: 12 80 00 05 bne 2009520 <_Thread_Initialize+0x98>
2009510: 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;
2009514: 03 00 80 76 sethi %hi(0x201d800), %g1
2009518: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201d8f4 <_Thread_Ticks_per_timeslice>
200951c: c2 26 60 78 st %g1, [ %i1 + 0x78 ]
case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT:
break;
#endif
}
the_thread->Start.isr_level = isr_level;
2009520: c4 07 a0 68 ld [ %fp + 0x68 ], %g2
*/
RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate(
Thread_Control *the_thread
)
{
return _Scheduler.Operations.allocate( the_thread );
2009524: 03 00 80 73 sethi %hi(0x201cc00), %g1
2009528: c2 00 61 2c ld [ %g1 + 0x12c ], %g1 ! 201cd2c <_Scheduler+0x18>
200952c: c4 26 60 ac st %g2, [ %i1 + 0xac ]
the_thread->current_state = STATES_DORMANT;
2009530: 84 10 20 01 mov 1, %g2
the_thread->Wait.queue = NULL;
2009534: c0 26 60 44 clr [ %i1 + 0x44 ]
#endif
}
the_thread->Start.isr_level = isr_level;
the_thread->current_state = STATES_DORMANT;
2009538: c4 26 60 10 st %g2, [ %i1 + 0x10 ]
the_thread->Wait.queue = NULL;
the_thread->resource_count = 0;
200953c: c0 26 60 1c clr [ %i1 + 0x1c ]
the_thread->real_priority = priority;
2009540: fa 26 60 18 st %i5, [ %i1 + 0x18 ]
the_thread->Start.initial_priority = priority;
2009544: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ]
2009548: 9f c0 40 00 call %g1
200954c: 90 10 00 19 mov %i1, %o0
sched =_Scheduler_Allocate( the_thread );
if ( !sched )
2009550: b8 92 20 00 orcc %o0, 0, %i4
2009554: 22 80 00 13 be,a 20095a0 <_Thread_Initialize+0x118>
2009558: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
goto failed;
_Thread_Set_priority( the_thread, priority );
200955c: 90 10 00 19 mov %i1, %o0
2009560: 40 00 01 e5 call 2009cf4 <_Thread_Set_priority>
2009564: 92 10 00 1d mov %i5, %o1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2009568: c4 06 20 1c ld [ %i0 + 0x1c ], %g2
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
200956c: 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 );
2009570: c0 26 60 84 clr [ %i1 + 0x84 ]
2009574: c0 26 60 88 clr [ %i1 + 0x88 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2009578: 83 28 60 02 sll %g1, 2, %g1
200957c: f2 20 80 01 st %i1, [ %g2 + %g1 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2009580: 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 );
2009584: 90 10 00 19 mov %i1, %o0
2009588: 40 00 02 ed call 200a13c <_User_extensions_Thread_create>
200958c: b0 10 20 01 mov 1, %i0
if ( extension_status )
2009590: 80 8a 20 ff btst 0xff, %o0
2009594: 32 80 00 12 bne,a 20095dc <_Thread_Initialize+0x154>
2009598: b0 0e 20 01 and %i0, 1, %i0
return true;
failed:
_Workspace_Free( the_thread->libc_reent );
200959c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0
20095a0: 40 00 04 26 call 200a638 <_Workspace_Free>
20095a4: b0 10 20 00 clr %i0
for ( i=0 ; i <= THREAD_API_LAST ; i++ )
_Workspace_Free( the_thread->API_Extensions[i] );
20095a8: 40 00 04 24 call 200a638 <_Workspace_Free>
20095ac: d0 06 61 58 ld [ %i1 + 0x158 ], %o0
20095b0: 40 00 04 22 call 200a638 <_Workspace_Free>
20095b4: d0 06 61 5c ld [ %i1 + 0x15c ], %o0
_Workspace_Free( extensions_area );
20095b8: 40 00 04 20 call 200a638 <_Workspace_Free>
20095bc: 90 10 00 1a mov %i2, %o0
#if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE )
_Workspace_Free( fp_area );
20095c0: 40 00 04 1e call 200a638 <_Workspace_Free>
20095c4: 90 10 00 1b mov %i3, %o0
#endif
_Workspace_Free( sched );
20095c8: 40 00 04 1c call 200a638 <_Workspace_Free>
20095cc: 90 10 00 1c mov %i4, %o0
_Thread_Stack_Free( the_thread );
20095d0: 40 00 02 0d call 2009e04 <_Thread_Stack_Free>
20095d4: 90 10 00 19 mov %i1, %o0
return false;
}
20095d8: b0 0e 20 01 and %i0, 1, %i0
20095dc: 81 c7 e0 08 ret
20095e0: 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 );
20095e4: 40 00 04 0d call 200a618 <_Workspace_Allocate>
20095e8: 90 10 20 88 mov 0x88, %o0
if ( !fp_area )
20095ec: b6 92 20 00 orcc %o0, 0, %i3
20095f0: 32 bf ff b8 bne,a 20094d0 <_Thread_Initialize+0x48>
20095f4: 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;
20095f8: 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;
20095fc: 10 bf ff e8 b 200959c <_Thread_Initialize+0x114>
2009600: b8 10 20 00 clr %i4
/*
* Allocate the extensions area for this thread
*/
if ( _Thread_Maximum_extensions ) {
extensions_area = _Workspace_Allocate(
2009604: 82 00 60 01 inc %g1
2009608: 40 00 04 04 call 200a618 <_Workspace_Allocate>
200960c: 91 28 60 02 sll %g1, 2, %o0
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
2009610: b4 92 20 00 orcc %o0, 0, %i2
2009614: 02 80 00 1d be 2009688 <_Thread_Initialize+0x200>
2009618: 86 10 00 1a mov %i2, %g3
goto failed;
}
the_thread->extensions = (void **) extensions_area;
200961c: f4 26 61 60 st %i2, [ %i1 + 0x160 ]
2009620: c8 07 22 24 ld [ %i4 + 0x224 ], %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++ )
2009624: 84 10 20 00 clr %g2
(_Thread_Maximum_extensions + 1) * sizeof( void * )
);
if ( !extensions_area )
goto failed;
}
the_thread->extensions = (void **) extensions_area;
2009628: 10 80 00 03 b 2009634 <_Thread_Initialize+0x1ac>
200962c: 82 10 20 00 clr %g1
2009630: 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;
2009634: 85 28 a0 02 sll %g2, 2, %g2
2009638: 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++ )
200963c: 82 00 60 01 inc %g1
2009640: 80 a0 40 04 cmp %g1, %g4
2009644: 08 bf ff fb bleu 2009630 <_Thread_Initialize+0x1a8>
2009648: 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;
200964c: 10 bf ff ad b 2009500 <_Thread_Initialize+0x78>
2009650: 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 );
2009654: 90 10 00 19 mov %i1, %o0
2009658: 40 00 01 d0 call 2009d98 <_Thread_Stack_Allocate>
200965c: 92 10 00 1b mov %i3, %o1
if ( !actual_stack_size || actual_stack_size < stack_size )
2009660: 80 a2 00 1b cmp %o0, %i3
2009664: 0a 80 00 07 bcs 2009680 <_Thread_Initialize+0x1f8>
2009668: 80 a2 20 00 cmp %o0, 0
200966c: 02 80 00 05 be 2009680 <_Thread_Initialize+0x1f8> <== NEVER TAKEN
2009670: 82 10 20 01 mov 1, %g1
return false; /* stack allocation failed */
stack = the_thread->Start.stack;
2009674: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2
the_thread->Start.core_allocated_stack = true;
2009678: 10 bf ff 90 b 20094b8 <_Thread_Initialize+0x30>
200967c: 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 */
2009680: 10 bf ff d6 b 20095d8 <_Thread_Initialize+0x150>
2009684: 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;
2009688: 10 bf ff c5 b 200959c <_Thread_Initialize+0x114>
200968c: b8 10 20 00 clr %i4
02009c30 <_Thread_queue_Requeue>:
void _Thread_queue_Requeue(
Thread_queue_Control *the_thread_queue,
Thread_Control *the_thread
)
{
2009c30: 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 )
2009c34: 80 a6 20 00 cmp %i0, 0
2009c38: 02 80 00 13 be 2009c84 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN
2009c3c: 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 ) {
2009c40: f8 06 20 34 ld [ %i0 + 0x34 ], %i4
2009c44: 80 a7 20 01 cmp %i4, 1
2009c48: 02 80 00 04 be 2009c58 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN
2009c4c: 01 00 00 00 nop
2009c50: 81 c7 e0 08 ret <== NOT EXECUTED
2009c54: 81 e8 00 00 restore <== NOT EXECUTED
Thread_queue_Control *tq = the_thread_queue;
ISR_Level level;
ISR_Level level_ignored;
_ISR_Disable( level );
2009c58: 7f ff e1 69 call 20021fc <sparc_disable_interrupts>
2009c5c: 01 00 00 00 nop
2009c60: ba 10 00 08 mov %o0, %i5
2009c64: c4 06 60 10 ld [ %i1 + 0x10 ], %g2
2009c68: 03 00 00 ef sethi %hi(0x3bc00), %g1
2009c6c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <PROM_START+0x3bee0>
if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) {
2009c70: 80 88 80 01 btst %g2, %g1
2009c74: 12 80 00 06 bne 2009c8c <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN
2009c78: 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 );
2009c7c: 7f ff e1 64 call 200220c <sparc_enable_interrupts>
2009c80: 90 10 00 1d mov %i5, %o0
2009c84: 81 c7 e0 08 ret
2009c88: 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 );
2009c8c: 92 10 00 19 mov %i1, %o1
2009c90: 94 10 20 01 mov 1, %o2
2009c94: 40 00 0f 4e call 200d9cc <_Thread_queue_Extract_priority_helper>
2009c98: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
(void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored );
2009c9c: 90 10 00 18 mov %i0, %o0
2009ca0: 92 10 00 19 mov %i1, %o1
2009ca4: 7f ff ff 35 call 2009978 <_Thread_queue_Enqueue_priority>
2009ca8: 94 07 bf fc add %fp, -4, %o2
2009cac: 30 bf ff f4 b,a 2009c7c <_Thread_queue_Requeue+0x4c>
02009cb0 <_Thread_queue_Timeout>:
void _Thread_queue_Timeout(
Objects_Id id,
void *ignored __attribute__((unused))
)
{
2009cb0: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
the_thread = _Thread_Get( id, &location );
2009cb4: 90 10 00 18 mov %i0, %o0
2009cb8: 7f ff fd c8 call 20093d8 <_Thread_Get>
2009cbc: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2009cc0: c2 07 bf fc ld [ %fp + -4 ], %g1
2009cc4: 80 a0 60 00 cmp %g1, 0
2009cc8: 12 80 00 09 bne 2009cec <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN
2009ccc: 01 00 00 00 nop
#if defined(RTEMS_MULTIPROCESSING)
case OBJECTS_REMOTE: /* impossible */
#endif
break;
case OBJECTS_LOCAL:
_Thread_queue_Process_timeout( the_thread );
2009cd0: 40 00 0f 78 call 200dab0 <_Thread_queue_Process_timeout>
2009cd4: 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--;
2009cd8: 03 00 80 76 sethi %hi(0x201d800), %g1
2009cdc: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 201d990 <_Thread_Dispatch_disable_level>
2009ce0: 84 00 bf ff add %g2, -1, %g2
2009ce4: c4 20 61 90 st %g2, [ %g1 + 0x190 ]
return _Thread_Dispatch_disable_level;
2009ce8: c2 00 61 90 ld [ %g1 + 0x190 ], %g1
2009cec: 81 c7 e0 08 ret
2009cf0: 81 e8 00 00 restore
020163c8 <_Timer_server_Body>:
* @a arg points to the corresponding timer server control block.
*/
static rtems_task _Timer_server_Body(
rtems_task_argument arg
)
{
20163c8: 9d e3 bf 88 save %sp, -120, %sp
20163cc: 23 00 80 f7 sethi %hi(0x203dc00), %l1
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
20163d0: a6 07 bf e8 add %fp, -24, %l3
20163d4: b2 07 bf ec add %fp, -20, %i1
20163d8: b6 07 bf f4 add %fp, -12, %i3
20163dc: a4 07 bf f8 add %fp, -8, %l2
20163e0: 21 00 80 f6 sethi %hi(0x203d800), %l0
20163e4: 29 00 80 f6 sethi %hi(0x203d800), %l4
20163e8: f2 27 bf e8 st %i1, [ %fp + -24 ]
head->previous = NULL;
20163ec: c0 27 bf ec clr [ %fp + -20 ]
tail->previous = head;
20163f0: 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;
20163f4: e4 27 bf f4 st %l2, [ %fp + -12 ]
head->previous = NULL;
20163f8: c0 27 bf f8 clr [ %fp + -8 ]
tail->previous = head;
20163fc: f6 27 bf fc st %i3, [ %fp + -4 ]
2016400: a2 14 60 3c or %l1, 0x3c, %l1
2016404: b8 06 20 30 add %i0, 0x30, %i4
2016408: a0 14 23 bc or %l0, 0x3bc, %l0
201640c: b4 06 20 68 add %i0, 0x68, %i2
2016410: a8 15 23 30 or %l4, 0x330, %l4
2016414: ae 06 20 08 add %i0, 8, %l7
2016418: 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;
201641c: 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;
2016420: 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;
2016424: c2 04 40 00 ld [ %l1 ], %g1
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
2016428: d2 06 20 3c ld [ %i0 + 0x3c ], %o1
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
201642c: 94 10 00 1b mov %i3, %o2
2016430: 90 10 00 1c mov %i4, %o0
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
watchdogs->last_snapshot = snapshot;
2016434: c2 26 20 3c st %g1, [ %i0 + 0x3c ]
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
2016438: 40 00 13 37 call 201b114 <_Watchdog_Adjust_to_chain>
201643c: 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;
2016440: 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();
2016444: 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 ) {
2016448: 80 a7 40 0a cmp %i5, %o2
201644c: 18 80 00 2e bgu 2016504 <_Timer_server_Body+0x13c>
2016450: 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 ) {
2016454: 80 a7 40 0a cmp %i5, %o2
2016458: 0a 80 00 2f bcs 2016514 <_Timer_server_Body+0x14c>
201645c: 90 10 00 1a mov %i2, %o0
*/
delta = last_snapshot - snapshot;
_Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta );
}
watchdogs->last_snapshot = snapshot;
2016460: 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 );
2016464: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
2016468: 40 00 03 1b call 20170d4 <_Chain_Get>
201646c: 01 00 00 00 nop
if ( timer == NULL ) {
2016470: 92 92 20 00 orcc %o0, 0, %o1
2016474: 02 80 00 10 be 20164b4 <_Timer_server_Body+0xec>
2016478: 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 ) {
201647c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1
2016480: 80 a0 60 01 cmp %g1, 1
2016484: 02 80 00 28 be 2016524 <_Timer_server_Body+0x15c>
2016488: 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 ) {
201648c: 12 bf ff f6 bne 2016464 <_Timer_server_Body+0x9c> <== NEVER TAKEN
2016490: 92 02 60 10 add %o1, 0x10, %o1
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
2016494: 40 00 13 51 call 201b1d8 <_Watchdog_Insert>
2016498: 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 );
201649c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0
20164a0: 40 00 03 0d call 20170d4 <_Chain_Get>
20164a4: 01 00 00 00 nop
if ( timer == NULL ) {
20164a8: 92 92 20 00 orcc %o0, 0, %o1
20164ac: 32 bf ff f5 bne,a 2016480 <_Timer_server_Body+0xb8> <== NEVER TAKEN
20164b0: 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 );
20164b4: 7f ff e2 55 call 200ee08 <sparc_disable_interrupts>
20164b8: 01 00 00 00 nop
if ( _Chain_Is_empty( insert_chain ) ) {
20164bc: c2 07 bf e8 ld [ %fp + -24 ], %g1
20164c0: 80 a0 40 19 cmp %g1, %i1
20164c4: 02 80 00 1c be 2016534 <_Timer_server_Body+0x16c> <== ALWAYS TAKEN
20164c8: 01 00 00 00 nop
ts->insert_chain = NULL;
_ISR_Enable( level );
break;
} else {
_ISR_Enable( level );
20164cc: 7f ff e2 53 call 200ee18 <sparc_enable_interrupts> <== NOT EXECUTED
20164d0: 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;
20164d4: c2 04 40 00 ld [ %l1 ], %g1 <== NOT EXECUTED
/*
* We assume adequate unsigned arithmetic here.
*/
Watchdog_Interval delta = snapshot - watchdogs->last_snapshot;
20164d8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 <== NOT EXECUTED
watchdogs->last_snapshot = snapshot;
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
20164dc: 94 10 00 1b mov %i3, %o2 <== NOT EXECUTED
20164e0: 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;
20164e4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] <== NOT EXECUTED
_Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain );
20164e8: 40 00 13 0b call 201b114 <_Watchdog_Adjust_to_chain> <== NOT EXECUTED
20164ec: 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;
20164f0: 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();
20164f4: 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 ) {
20164f8: 80 a7 40 0a cmp %i5, %o2 <== NOT EXECUTED
20164fc: 08 bf ff d7 bleu 2016458 <_Timer_server_Body+0x90> <== NOT EXECUTED
2016500: 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 );
2016504: 90 10 00 1a mov %i2, %o0
2016508: 40 00 13 03 call 201b114 <_Watchdog_Adjust_to_chain>
201650c: 94 10 00 1b mov %i3, %o2
2016510: 30 bf ff d4 b,a 2016460 <_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 );
2016514: 92 10 20 01 mov 1, %o1
2016518: 40 00 12 d0 call 201b058 <_Watchdog_Adjust>
201651c: 94 22 80 1d sub %o2, %i5, %o2
2016520: 30 bf ff d0 b,a 2016460 <_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 );
2016524: 90 10 00 1c mov %i4, %o0
2016528: 40 00 13 2c call 201b1d8 <_Watchdog_Insert>
201652c: 92 02 60 10 add %o1, 0x10, %o1
2016530: 30 bf ff cd b,a 2016464 <_Timer_server_Body+0x9c>
*/
_Timer_server_Process_insertions( ts );
_ISR_Disable( level );
if ( _Chain_Is_empty( insert_chain ) ) {
ts->insert_chain = NULL;
2016534: c0 26 20 78 clr [ %i0 + 0x78 ]
_ISR_Enable( level );
2016538: 7f ff e2 38 call 200ee18 <sparc_enable_interrupts>
201653c: 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 ) ) {
2016540: c2 07 bf f4 ld [ %fp + -12 ], %g1
2016544: 80 a0 40 12 cmp %g1, %l2
2016548: 12 80 00 0c bne 2016578 <_Timer_server_Body+0x1b0>
201654c: 01 00 00 00 nop
2016550: 30 80 00 13 b,a 201659c <_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;
2016554: 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;
2016558: 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;
201655c: c0 27 60 08 clr [ %i5 + 8 ]
_ISR_Enable( level );
2016560: 7f ff e2 2e call 200ee18 <sparc_enable_interrupts>
2016564: 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 );
2016568: d0 07 60 20 ld [ %i5 + 0x20 ], %o0
201656c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
2016570: 9f c0 40 00 call %g1
2016574: 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 );
2016578: 7f ff e2 24 call 200ee08 <sparc_disable_interrupts>
201657c: 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;
2016580: 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))
2016584: 80 a7 40 12 cmp %i5, %l2
2016588: 32 bf ff f3 bne,a 2016554 <_Timer_server_Body+0x18c>
201658c: 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 );
2016590: 7f ff e2 22 call 200ee18 <sparc_enable_interrupts>
2016594: 01 00 00 00 nop
2016598: 30 bf ff a2 b,a 2016420 <_Timer_server_Body+0x58>
* the active flag of the timer server is true.
*/
(*watchdog->routine)( watchdog->id, watchdog->user_data );
}
} else {
ts->active = false;
201659c: 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++;
20165a0: c2 05 00 00 ld [ %l4 ], %g1
20165a4: 82 00 60 01 inc %g1
20165a8: c2 25 00 00 st %g1, [ %l4 ]
return _Thread_Dispatch_disable_level;
20165ac: c2 05 00 00 ld [ %l4 ], %g1
/*
* Block until there is something to do.
*/
_Thread_Disable_dispatch();
_Thread_Set_state( ts->thread, STATES_DELAYING );
20165b0: d0 06 00 00 ld [ %i0 ], %o0
20165b4: 40 00 11 0d call 201a9e8 <_Thread_Set_state>
20165b8: 92 10 20 08 mov 8, %o1
_Timer_server_Reset_interval_system_watchdog( ts );
20165bc: 7f ff ff 5b call 2016328 <_Timer_server_Reset_interval_system_watchdog>
20165c0: 90 10 00 18 mov %i0, %o0
_Timer_server_Reset_tod_system_watchdog( ts );
20165c4: 7f ff ff 6d call 2016378 <_Timer_server_Reset_tod_system_watchdog>
20165c8: 90 10 00 18 mov %i0, %o0
_Thread_Enable_dispatch();
20165cc: 40 00 0e 88 call 2019fec <_Thread_Enable_dispatch>
20165d0: 01 00 00 00 nop
static void _Timer_server_Stop_interval_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog );
20165d4: 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;
20165d8: 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 );
20165dc: 40 00 13 61 call 201b360 <_Watchdog_Remove>
20165e0: 01 00 00 00 nop
static void _Timer_server_Stop_tod_system_watchdog(
Timer_server_Control *ts
)
{
_Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog );
20165e4: 40 00 13 5f call 201b360 <_Watchdog_Remove>
20165e8: 90 10 00 16 mov %l6, %o0
20165ec: 30 bf ff 8d b,a 2016420 <_Timer_server_Body+0x58>
020165f0 <_Timer_server_Schedule_operation_method>:
static void _Timer_server_Schedule_operation_method(
Timer_server_Control *ts,
Timer_Control *timer
)
{
20165f0: 9d e3 bf a0 save %sp, -96, %sp
if ( ts->insert_chain == NULL ) {
20165f4: c2 06 20 78 ld [ %i0 + 0x78 ], %g1
20165f8: 80 a0 60 00 cmp %g1, 0
20165fc: 02 80 00 05 be 2016610 <_Timer_server_Schedule_operation_method+0x20>
2016600: 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 );
2016604: f0 06 20 78 ld [ %i0 + 0x78 ], %i0
2016608: 40 00 02 9f call 2017084 <_Chain_Append>
201660c: 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++;
2016610: 03 00 80 f6 sethi %hi(0x203d800), %g1
2016614: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 203db30 <_Thread_Dispatch_disable_level>
2016618: 84 00 a0 01 inc %g2
201661c: c4 20 63 30 st %g2, [ %g1 + 0x330 ]
return _Thread_Dispatch_disable_level;
2016620: c2 00 63 30 ld [ %g1 + 0x330 ], %g1
* being inserted. This could result in an integer overflow.
*/
_Thread_Disable_dispatch();
if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) {
2016624: c2 06 60 38 ld [ %i1 + 0x38 ], %g1
2016628: 80 a0 60 01 cmp %g1, 1
201662c: 02 80 00 28 be 20166cc <_Timer_server_Schedule_operation_method+0xdc>
2016630: 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 ) {
2016634: 02 80 00 04 be 2016644 <_Timer_server_Schedule_operation_method+0x54><== ALWAYS TAKEN
2016638: 01 00 00 00 nop
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
201663c: 40 00 0e 6c call 2019fec <_Thread_Enable_dispatch>
2016640: 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 );
2016644: 7f ff e1 f1 call 200ee08 <sparc_disable_interrupts>
2016648: 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;
201664c: c4 06 20 68 ld [ %i0 + 0x68 ], %g2
snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch();
last_snapshot = ts->TOD_watchdogs.last_snapshot;
2016650: 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 );
2016654: 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();
2016658: 03 00 80 f6 sethi %hi(0x203d800), %g1
last_snapshot = ts->TOD_watchdogs.last_snapshot;
if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) {
201665c: 80 a0 80 04 cmp %g2, %g4
2016660: 02 80 00 0d be 2016694 <_Timer_server_Schedule_operation_method+0xa4>
2016664: c2 00 63 bc ld [ %g1 + 0x3bc ], %g1
first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain );
delta_interval = first_watchdog->delta_interval;
2016668: de 00 a0 10 ld [ %g2 + 0x10 ], %o7
if ( snapshot > last_snapshot ) {
201666c: 80 a0 40 03 cmp %g1, %g3
}
} else {
/*
* Someone put us in the past.
*/
delta = last_snapshot - snapshot;
2016670: 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 ) {
2016674: 08 80 00 07 bleu 2016690 <_Timer_server_Schedule_operation_method+0xa0>
2016678: 88 21 00 01 sub %g4, %g1, %g4
/*
* We advanced in time.
*/
delta = snapshot - last_snapshot;
201667c: 86 20 40 03 sub %g1, %g3, %g3
if (delta_interval > delta) {
2016680: 80 a3 c0 03 cmp %o7, %g3
2016684: 08 80 00 03 bleu 2016690 <_Timer_server_Schedule_operation_method+0xa0><== NEVER TAKEN
2016688: 88 10 20 00 clr %g4
delta_interval -= delta;
201668c: 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;
2016690: c8 20 a0 10 st %g4, [ %g2 + 0x10 ]
}
ts->TOD_watchdogs.last_snapshot = snapshot;
2016694: c2 26 20 74 st %g1, [ %i0 + 0x74 ]
_ISR_Enable( level );
2016698: 7f ff e1 e0 call 200ee18 <sparc_enable_interrupts>
201669c: 01 00 00 00 nop
_Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker );
20166a0: 90 06 20 68 add %i0, 0x68, %o0
20166a4: 40 00 12 cd call 201b1d8 <_Watchdog_Insert>
20166a8: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
20166ac: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
20166b0: 80 a0 60 00 cmp %g1, 0
20166b4: 12 bf ff e2 bne 201663c <_Timer_server_Schedule_operation_method+0x4c>
20166b8: 01 00 00 00 nop
_Timer_server_Reset_tod_system_watchdog( ts );
20166bc: 7f ff ff 2f call 2016378 <_Timer_server_Reset_tod_system_watchdog>
20166c0: 90 10 00 18 mov %i0, %o0
}
}
_Thread_Enable_dispatch();
20166c4: 40 00 0e 4a call 2019fec <_Thread_Enable_dispatch>
20166c8: 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 );
20166cc: 7f ff e1 cf call 200ee08 <sparc_disable_interrupts>
20166d0: 01 00 00 00 nop
snapshot = _Watchdog_Ticks_since_boot;
20166d4: 05 00 80 f7 sethi %hi(0x203dc00), %g2
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
20166d8: c2 06 20 30 ld [ %i0 + 0x30 ], %g1
20166dc: c4 00 a0 3c ld [ %g2 + 0x3c ], %g2
last_snapshot = ts->Interval_watchdogs.last_snapshot;
20166e0: 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 );
20166e4: 86 06 20 34 add %i0, 0x34, %g3
if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) {
20166e8: 80 a0 40 03 cmp %g1, %g3
20166ec: 02 80 00 08 be 201670c <_Timer_server_Schedule_operation_method+0x11c>
20166f0: 88 20 80 04 sub %g2, %g4, %g4
/*
* We assume adequate unsigned arithmetic here.
*/
delta = snapshot - last_snapshot;
delta_interval = first_watchdog->delta_interval;
20166f4: de 00 60 10 ld [ %g1 + 0x10 ], %o7
if (delta_interval > delta) {
20166f8: 80 a1 00 0f cmp %g4, %o7
20166fc: 1a 80 00 03 bcc 2016708 <_Timer_server_Schedule_operation_method+0x118>
2016700: 86 10 20 00 clr %g3
delta_interval -= delta;
2016704: 86 23 c0 04 sub %o7, %g4, %g3
} else {
delta_interval = 0;
}
first_watchdog->delta_interval = delta_interval;
2016708: c6 20 60 10 st %g3, [ %g1 + 0x10 ]
}
ts->Interval_watchdogs.last_snapshot = snapshot;
201670c: c4 26 20 3c st %g2, [ %i0 + 0x3c ]
_ISR_Enable( level );
2016710: 7f ff e1 c2 call 200ee18 <sparc_enable_interrupts>
2016714: 01 00 00 00 nop
_Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker );
2016718: 90 06 20 30 add %i0, 0x30, %o0
201671c: 40 00 12 af call 201b1d8 <_Watchdog_Insert>
2016720: 92 07 60 10 add %i5, 0x10, %o1
if ( !ts->active ) {
2016724: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1
2016728: 80 a0 60 00 cmp %g1, 0
201672c: 12 bf ff c4 bne 201663c <_Timer_server_Schedule_operation_method+0x4c>
2016730: 01 00 00 00 nop
_Timer_server_Reset_interval_system_watchdog( ts );
2016734: 7f ff fe fd call 2016328 <_Timer_server_Reset_interval_system_watchdog>
2016738: 90 10 00 18 mov %i0, %o0
if ( !ts->active ) {
_Timer_server_Reset_tod_system_watchdog( ts );
}
}
_Thread_Enable_dispatch();
201673c: 40 00 0e 2c call 2019fec <_Thread_Enable_dispatch>
2016740: 81 e8 00 00 restore
0200a0ec <_User_extensions_Fatal>:
void _User_extensions_Fatal (
Internal_errors_Source the_source,
bool is_internal,
Internal_errors_t the_error
)
{
200a0ec: 9d e3 bf a0 save %sp, -96, %sp
200a0f0: 39 00 80 76 sethi %hi(0x201d800), %i4
200a0f4: b8 17 23 78 or %i4, 0x378, %i4 ! 201db78 <_User_extensions_List>
200a0f8: 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 );
200a0fc: 80 a7 40 1c cmp %i5, %i4
200a100: 02 80 00 0d be 200a134 <_User_extensions_Fatal+0x48> <== NEVER TAKEN
200a104: 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 )
200a108: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200a10c: 80 a0 60 00 cmp %g1, 0
200a110: 02 80 00 05 be 200a124 <_User_extensions_Fatal+0x38>
200a114: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.fatal)( the_source, is_internal, the_error );
200a118: 92 10 00 19 mov %i1, %o1
200a11c: 9f c0 40 00 call %g1
200a120: 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 ) {
200a124: 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 );
200a128: 80 a7 40 1c cmp %i5, %i4
200a12c: 32 bf ff f8 bne,a 200a10c <_User_extensions_Fatal+0x20>
200a130: c2 07 60 30 ld [ %i5 + 0x30 ], %g1
200a134: 81 c7 e0 08 ret
200a138: 81 e8 00 00 restore
02009f98 <_User_extensions_Handler_initialization>:
#include <rtems/score/userext.h>
#include <rtems/score/wkspace.h>
#include <string.h>
void _User_extensions_Handler_initialization(void)
{
2009f98: 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;
2009f9c: 07 00 80 73 sethi %hi(0x201cc00), %g3
2009fa0: 86 10 e0 2c or %g3, 0x2c, %g3 ! 201cc2c <Configuration>
initial_extensions = Configuration.User_extension_table;
2009fa4: f6 00 e0 3c ld [ %g3 + 0x3c ], %i3
2009fa8: 3b 00 80 76 sethi %hi(0x201d800), %i5
2009fac: 09 00 80 76 sethi %hi(0x201d800), %g4
2009fb0: 84 17 63 78 or %i5, 0x378, %g2
2009fb4: 82 11 21 94 or %g4, 0x194, %g1
2009fb8: b4 00 a0 04 add %g2, 4, %i2
2009fbc: b8 00 60 04 add %g1, 4, %i4
2009fc0: f4 27 63 78 st %i2, [ %i5 + 0x378 ]
head->previous = NULL;
2009fc4: c0 20 a0 04 clr [ %g2 + 4 ]
tail->previous = head;
2009fc8: 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;
2009fcc: f8 21 21 94 st %i4, [ %g4 + 0x194 ]
head->previous = NULL;
2009fd0: c0 20 60 04 clr [ %g1 + 4 ]
tail->previous = head;
2009fd4: c2 20 60 08 st %g1, [ %g1 + 8 ]
_Chain_Initialize_empty( &_User_extensions_List );
_Chain_Initialize_empty( &_User_extensions_Switches_list );
if ( initial_extensions ) {
2009fd8: 80 a6 e0 00 cmp %i3, 0
2009fdc: 02 80 00 1b be 200a048 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
2009fe0: f4 00 e0 38 ld [ %g3 + 0x38 ], %i2
extension = (User_extensions_Control *)
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
2009fe4: 83 2e a0 02 sll %i2, 2, %g1
2009fe8: b9 2e a0 04 sll %i2, 4, %i4
2009fec: b8 27 00 01 sub %i4, %g1, %i4
2009ff0: b8 07 00 1a add %i4, %i2, %i4
2009ff4: 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 *)
2009ff8: 40 00 01 96 call 200a650 <_Workspace_Allocate_or_fatal_error>
2009ffc: 90 10 00 1c mov %i4, %o0
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200a000: 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 *)
200a004: ba 10 00 08 mov %o0, %i5
_Workspace_Allocate_or_fatal_error(
number_of_extensions * sizeof( User_extensions_Control )
);
memset (
200a008: 40 00 18 fe call 2010400 <memset>
200a00c: 94 10 00 1c mov %i4, %o2
extension,
0,
number_of_extensions * sizeof( User_extensions_Control )
);
for ( i = 0 ; i < number_of_extensions ; i++ ) {
200a010: 80 a6 a0 00 cmp %i2, 0
200a014: 02 80 00 0d be 200a048 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN
200a018: 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;
200a01c: 92 10 00 1b mov %i3, %o1
200a020: 94 10 20 20 mov 0x20, %o2
200a024: 40 00 18 bb call 2010310 <memcpy>
200a028: 90 07 60 14 add %i5, 0x14, %o0
_User_extensions_Add_set( extension );
200a02c: 40 00 0e e2 call 200dbb4 <_User_extensions_Add_set>
200a030: 90 10 00 1d mov %i5, %o0
200a034: b8 07 20 01 inc %i4
_User_extensions_Add_set_with_table (extension, &initial_extensions[i]);
extension++;
200a038: 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++ ) {
200a03c: 80 a7 00 1a cmp %i4, %i2
200a040: 12 bf ff f7 bne 200a01c <_User_extensions_Handler_initialization+0x84>
200a044: b6 06 e0 20 add %i3, 0x20, %i3
200a048: 81 c7 e0 08 ret
200a04c: 81 e8 00 00 restore
0200a050 <_User_extensions_Thread_begin>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_begin (
Thread_Control *executing
)
{
200a050: 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;
200a054: 39 00 80 76 sethi %hi(0x201d800), %i4
200a058: fa 07 23 78 ld [ %i4 + 0x378 ], %i5 ! 201db78 <_User_extensions_List>
200a05c: b8 17 23 78 or %i4, 0x378, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a060: b8 07 20 04 add %i4, 4, %i4
200a064: 80 a7 40 1c cmp %i5, %i4
200a068: 02 80 00 0c be 200a098 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN
200a06c: 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 )
200a070: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200a074: 80 a0 60 00 cmp %g1, 0
200a078: 02 80 00 04 be 200a088 <_User_extensions_Thread_begin+0x38>
200a07c: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_begin)( executing );
200a080: 9f c0 40 00 call %g1
200a084: 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 ) {
200a088: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a08c: 80 a7 40 1c cmp %i5, %i4
200a090: 32 bf ff f9 bne,a 200a074 <_User_extensions_Thread_begin+0x24>
200a094: c2 07 60 28 ld [ %i5 + 0x28 ], %g1
200a098: 81 c7 e0 08 ret
200a09c: 81 e8 00 00 restore
0200a13c <_User_extensions_Thread_create>:
#include <rtems/score/userext.h>
bool _User_extensions_Thread_create (
Thread_Control *the_thread
)
{
200a13c: 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;
200a140: 39 00 80 76 sethi %hi(0x201d800), %i4
200a144: fa 07 23 78 ld [ %i4 + 0x378 ], %i5 ! 201db78 <_User_extensions_List>
200a148: b8 17 23 78 or %i4, 0x378, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
bool status;
for ( the_node = _Chain_First( &_User_extensions_List );
200a14c: b8 07 20 04 add %i4, 4, %i4
200a150: 80 a7 40 1c cmp %i5, %i4
200a154: 02 80 00 12 be 200a19c <_User_extensions_Thread_create+0x60><== NEVER TAKEN
200a158: 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)(
200a15c: 37 00 80 77 sethi %hi(0x201dc00), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_create != NULL ) {
200a160: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
200a164: 80 a0 60 00 cmp %g1, 0
200a168: 02 80 00 08 be 200a188 <_User_extensions_Thread_create+0x4c>
200a16c: 84 16 e2 c8 or %i3, 0x2c8, %g2
status = (*the_extension->Callouts.thread_create)(
200a170: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a174: 9f c0 40 00 call %g1
200a178: 92 10 00 18 mov %i0, %o1
_Thread_Executing,
the_thread
);
if ( !status )
200a17c: 80 8a 20 ff btst 0xff, %o0
200a180: 02 80 00 0a be 200a1a8 <_User_extensions_Thread_create+0x6c>
200a184: 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 ) {
200a188: 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 );
200a18c: 80 a7 40 1c cmp %i5, %i4
200a190: 32 bf ff f5 bne,a 200a164 <_User_extensions_Thread_create+0x28>
200a194: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
if ( !status )
return false;
}
}
return true;
200a198: 82 10 20 01 mov 1, %g1
}
200a19c: b0 08 60 01 and %g1, 1, %i0
200a1a0: 81 c7 e0 08 ret
200a1a4: 81 e8 00 00 restore
200a1a8: b0 08 60 01 and %g1, 1, %i0
200a1ac: 81 c7 e0 08 ret
200a1b0: 81 e8 00 00 restore
0200a1b4 <_User_extensions_Thread_delete>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_delete (
Thread_Control *the_thread
)
{
200a1b4: 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;
200a1b8: 39 00 80 76 sethi %hi(0x201d800), %i4
200a1bc: b8 17 23 78 or %i4, 0x378, %i4 ! 201db78 <_User_extensions_List>
200a1c0: 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 );
200a1c4: 80 a7 40 1c cmp %i5, %i4
200a1c8: 02 80 00 0d be 200a1fc <_User_extensions_Thread_delete+0x48><== NEVER TAKEN
200a1cc: 37 00 80 77 sethi %hi(0x201dc00), %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 )
200a1d0: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200a1d4: 80 a0 60 00 cmp %g1, 0
200a1d8: 02 80 00 05 be 200a1ec <_User_extensions_Thread_delete+0x38>
200a1dc: 84 16 e2 c8 or %i3, 0x2c8, %g2
(*the_extension->Callouts.thread_delete)(
200a1e0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a1e4: 9f c0 40 00 call %g1
200a1e8: 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 ) {
200a1ec: 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 );
200a1f0: 80 a7 40 1c cmp %i5, %i4
200a1f4: 32 bf ff f8 bne,a 200a1d4 <_User_extensions_Thread_delete+0x20>
200a1f8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1
200a1fc: 81 c7 e0 08 ret
200a200: 81 e8 00 00 restore
0200a0a0 <_User_extensions_Thread_exitted>:
}
void _User_extensions_Thread_exitted (
Thread_Control *executing
)
{
200a0a0: 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;
200a0a4: 39 00 80 76 sethi %hi(0x201d800), %i4
200a0a8: b8 17 23 78 or %i4, 0x378, %i4 ! 201db78 <_User_extensions_List>
200a0ac: 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 );
200a0b0: 80 a7 40 1c cmp %i5, %i4
200a0b4: 02 80 00 0c be 200a0e4 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN
200a0b8: 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 )
200a0bc: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200a0c0: 80 a0 60 00 cmp %g1, 0
200a0c4: 02 80 00 04 be 200a0d4 <_User_extensions_Thread_exitted+0x34>
200a0c8: 90 10 00 18 mov %i0, %o0
(*the_extension->Callouts.thread_exitted)( executing );
200a0cc: 9f c0 40 00 call %g1
200a0d0: 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 ) {
200a0d4: 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 );
200a0d8: 80 a7 40 1c cmp %i5, %i4
200a0dc: 32 bf ff f9 bne,a 200a0c0 <_User_extensions_Thread_exitted+0x20>
200a0e0: c2 07 60 2c ld [ %i5 + 0x2c ], %g1
200a0e4: 81 c7 e0 08 ret
200a0e8: 81 e8 00 00 restore
0200aa44 <_User_extensions_Thread_restart>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_restart (
Thread_Control *the_thread
)
{
200aa44: 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;
200aa48: 39 00 80 79 sethi %hi(0x201e400), %i4
200aa4c: fa 07 22 98 ld [ %i4 + 0x298 ], %i5 ! 201e698 <_User_extensions_List>
200aa50: b8 17 22 98 or %i4, 0x298, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200aa54: b8 07 20 04 add %i4, 4, %i4
200aa58: 80 a7 40 1c cmp %i5, %i4
200aa5c: 02 80 00 0d be 200aa90 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN
200aa60: 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 )
200aa64: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200aa68: 80 a0 60 00 cmp %g1, 0
200aa6c: 02 80 00 05 be 200aa80 <_User_extensions_Thread_restart+0x3c>
200aa70: 84 16 e1 e8 or %i3, 0x1e8, %g2
(*the_extension->Callouts.thread_restart)(
200aa74: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200aa78: 9f c0 40 00 call %g1
200aa7c: 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 ) {
200aa80: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200aa84: 80 a7 40 1c cmp %i5, %i4
200aa88: 32 bf ff f8 bne,a 200aa68 <_User_extensions_Thread_restart+0x24>
200aa8c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
200aa90: 81 c7 e0 08 ret
200aa94: 81 e8 00 00 restore
0200a204 <_User_extensions_Thread_start>:
#include <rtems/score/userext.h>
void _User_extensions_Thread_start (
Thread_Control *the_thread
)
{
200a204: 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;
200a208: 39 00 80 76 sethi %hi(0x201d800), %i4
200a20c: fa 07 23 78 ld [ %i4 + 0x378 ], %i5 ! 201db78 <_User_extensions_List>
200a210: b8 17 23 78 or %i4, 0x378, %i4
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a214: b8 07 20 04 add %i4, 4, %i4
200a218: 80 a7 40 1c cmp %i5, %i4
200a21c: 02 80 00 0d be 200a250 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN
200a220: 37 00 80 77 sethi %hi(0x201dc00), %i3
!_Chain_Is_tail( &_User_extensions_List, the_node ) ;
the_node = the_node->next ) {
the_extension = (User_extensions_Control *) the_node;
if ( the_extension->Callouts.thread_start != NULL )
200a224: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200a228: 80 a0 60 00 cmp %g1, 0
200a22c: 02 80 00 05 be 200a240 <_User_extensions_Thread_start+0x3c>
200a230: 84 16 e2 c8 or %i3, 0x2c8, %g2
(*the_extension->Callouts.thread_start)(
200a234: d0 00 a0 0c ld [ %g2 + 0xc ], %o0
200a238: 9f c0 40 00 call %g1
200a23c: 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 ) {
200a240: fa 07 40 00 ld [ %i5 ], %i5
)
{
Chain_Node *the_node;
User_extensions_Control *the_extension;
for ( the_node = _Chain_First( &_User_extensions_List );
200a244: 80 a7 40 1c cmp %i5, %i4
200a248: 32 bf ff f8 bne,a 200a228 <_User_extensions_Thread_start+0x24>
200a24c: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
200a250: 81 c7 e0 08 ret
200a254: 81 e8 00 00 restore
0200a258 <_User_extensions_Thread_switch>:
void _User_extensions_Thread_switch (
Thread_Control *executing,
Thread_Control *heir
)
{
200a258: 9d e3 bf a0 save %sp, -96, %sp
200a25c: 39 00 80 76 sethi %hi(0x201d800), %i4
200a260: fa 07 21 94 ld [ %i4 + 0x194 ], %i5 ! 201d994 <_User_extensions_Switches_list>
200a264: b8 17 21 94 or %i4, 0x194, %i4
Chain_Node *the_node;
User_extensions_Switch_control *the_extension_switch;
for ( the_node = _Chain_First( &_User_extensions_Switches_list );
200a268: b8 07 20 04 add %i4, 4, %i4
200a26c: 80 a7 40 1c cmp %i5, %i4
200a270: 02 80 00 0a be 200a298 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN
200a274: 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 );
200a278: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a27c: 90 10 00 18 mov %i0, %o0
200a280: 9f c0 40 00 call %g1
200a284: 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 ) {
200a288: 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 );
200a28c: 80 a7 40 1c cmp %i5, %i4
200a290: 32 bf ff fb bne,a 200a27c <_User_extensions_Thread_switch+0x24>
200a294: c2 07 60 08 ld [ %i5 + 8 ], %g1
200a298: 81 c7 e0 08 ret
200a29c: 81 e8 00 00 restore
0200bd28 <_Watchdog_Adjust>:
void _Watchdog_Adjust(
Chain_Control *header,
Watchdog_Adjust_directions direction,
Watchdog_Interval units
)
{
200bd28: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
_ISR_Disable( level );
200bd2c: 7f ff dc 87 call 2002f48 <sparc_disable_interrupts>
200bd30: 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;
200bd34: 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 );
200bd38: 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 ) ) {
200bd3c: 80 a0 40 1b cmp %g1, %i3
200bd40: 02 80 00 1e be 200bdb8 <_Watchdog_Adjust+0x90>
200bd44: 80 a6 60 00 cmp %i1, 0
switch ( direction ) {
200bd48: 12 80 00 1e bne 200bdc0 <_Watchdog_Adjust+0x98>
200bd4c: 80 a6 60 01 cmp %i1, 1
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
break;
case WATCHDOG_FORWARD:
while ( units ) {
200bd50: 80 a6 a0 00 cmp %i2, 0
200bd54: 02 80 00 19 be 200bdb8 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bd58: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bd5c: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bd60: 80 a6 80 1c cmp %i2, %i4
200bd64: 1a 80 00 0a bcc 200bd8c <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN
200bd68: b2 10 20 01 mov 1, %i1
_Watchdog_First( header )->delta_interval -= units;
200bd6c: 10 80 00 1c b 200bddc <_Watchdog_Adjust+0xb4> <== NOT EXECUTED
200bd70: 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 ) {
200bd74: 02 80 00 11 be 200bdb8 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bd78: 01 00 00 00 nop
if ( units < _Watchdog_First( header )->delta_interval ) {
200bd7c: f8 00 60 10 ld [ %g1 + 0x10 ], %i4
200bd80: 80 a7 00 1a cmp %i4, %i2
200bd84: 38 80 00 16 bgu,a 200bddc <_Watchdog_Adjust+0xb4>
200bd88: 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;
200bd8c: f2 20 60 10 st %i1, [ %g1 + 0x10 ]
_ISR_Enable( level );
200bd90: 7f ff dc 72 call 2002f58 <sparc_enable_interrupts>
200bd94: 01 00 00 00 nop
_Watchdog_Tickle( header );
200bd98: 40 00 00 ab call 200c044 <_Watchdog_Tickle>
200bd9c: 90 10 00 1d mov %i5, %o0
_ISR_Disable( level );
200bda0: 7f ff dc 6a call 2002f48 <sparc_disable_interrupts>
200bda4: 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;
200bda8: c2 07 40 00 ld [ %i5 ], %g1
if ( _Chain_Is_empty( header ) )
200bdac: 80 a6 c0 01 cmp %i3, %g1
200bdb0: 32 bf ff f1 bne,a 200bd74 <_Watchdog_Adjust+0x4c>
200bdb4: b4 a6 80 1c subcc %i2, %i4, %i2
}
break;
}
}
_ISR_Enable( level );
200bdb8: 7f ff dc 68 call 2002f58 <sparc_enable_interrupts>
200bdbc: 91 e8 00 08 restore %g0, %o0, %o0
* unmodified across that call.
*
* Till Straumann, 7/2003
*/
if ( !_Chain_Is_empty( header ) ) {
switch ( direction ) {
200bdc0: 12 bf ff fe bne 200bdb8 <_Watchdog_Adjust+0x90> <== NEVER TAKEN
200bdc4: 01 00 00 00 nop
case WATCHDOG_BACKWARD:
_Watchdog_First( header )->delta_interval += units;
200bdc8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2
200bdcc: b4 00 80 1a add %g2, %i2, %i2
200bdd0: f4 20 60 10 st %i2, [ %g1 + 0x10 ]
}
break;
}
}
_ISR_Enable( level );
200bdd4: 7f ff dc 61 call 2002f58 <sparc_enable_interrupts>
200bdd8: 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;
200bddc: 10 bf ff f7 b 200bdb8 <_Watchdog_Adjust+0x90>
200bde0: f8 20 60 10 st %i4, [ %g1 + 0x10 ]
0200a2a0 <_Watchdog_Insert>:
void _Watchdog_Insert(
Chain_Control *header,
Watchdog_Control *the_watchdog
)
{
200a2a0: 9d e3 bf a0 save %sp, -96, %sp
Watchdog_Control *after;
uint32_t insert_isr_nest_level;
Watchdog_Interval delta_interval;
insert_isr_nest_level = _ISR_Nest_level;
200a2a4: 03 00 80 77 sethi %hi(0x201dc00), %g1
void _Watchdog_Insert(
Chain_Control *header,
Watchdog_Control *the_watchdog
)
{
200a2a8: b8 10 00 18 mov %i0, %i4
Watchdog_Interval delta_interval;
insert_isr_nest_level = _ISR_Nest_level;
_ISR_Disable( level );
200a2ac: 7f ff df d4 call 20021fc <sparc_disable_interrupts>
200a2b0: fa 00 62 d0 ld [ %g1 + 0x2d0 ], %i5
/*
* Check to see if the watchdog has just been inserted by a
* higher priority interrupt. If so, abandon this insert.
*/
if ( the_watchdog->state != WATCHDOG_INACTIVE ) {
200a2b4: c2 06 60 08 ld [ %i1 + 8 ], %g1
200a2b8: 80 a0 60 00 cmp %g1, 0
200a2bc: 12 80 00 31 bne 200a380 <_Watchdog_Insert+0xe0> <== NEVER TAKEN
200a2c0: 25 00 80 76 sethi %hi(0x201d800), %l2
_ISR_Enable( level );
return;
}
the_watchdog->state = WATCHDOG_BEING_INSERTED;
_Watchdog_Sync_count++;
200a2c4: c2 04 a2 98 ld [ %l2 + 0x298 ], %g1 ! 201da98 <_Watchdog_Sync_count>
if ( the_watchdog->state != WATCHDOG_INACTIVE ) {
_ISR_Enable( level );
return;
}
the_watchdog->state = WATCHDOG_BEING_INSERTED;
200a2c8: 84 10 20 01 mov 1, %g2
_Watchdog_Sync_count++;
200a2cc: 82 00 60 01 inc %g1
if ( the_watchdog->state != WATCHDOG_INACTIVE ) {
_ISR_Enable( level );
return;
}
the_watchdog->state = WATCHDOG_BEING_INSERTED;
200a2d0: c4 26 60 08 st %g2, [ %i1 + 8 ]
_Watchdog_Sync_count++;
200a2d4: c2 24 a2 98 st %g1, [ %l2 + 0x298 ]
200a2d8: 23 00 80 76 sethi %hi(0x201d800), %l1
restart:
delta_interval = the_watchdog->initial;
200a2dc: f6 06 60 0c ld [ %i1 + 0xc ], %i3
for ( after = _Watchdog_First( header ) ;
;
after = _Watchdog_Next( after ) ) {
if ( delta_interval == 0 || !_Watchdog_Next( after ) )
200a2e0: 80 a6 e0 00 cmp %i3, 0
200a2e4: 02 80 00 2a be 200a38c <_Watchdog_Insert+0xec>
200a2e8: f4 07 00 00 ld [ %i4 ], %i2
200a2ec: c2 06 80 00 ld [ %i2 ], %g1
200a2f0: 80 a0 60 00 cmp %g1, 0
200a2f4: 22 80 00 27 be,a 200a390 <_Watchdog_Insert+0xf0>
200a2f8: c2 06 a0 04 ld [ %i2 + 4 ], %g1
break;
if ( delta_interval < after->delta_interval ) {
200a2fc: e0 06 a0 10 ld [ %i2 + 0x10 ], %l0
200a300: 80 a6 c0 10 cmp %i3, %l0
200a304: 1a 80 00 13 bcc 200a350 <_Watchdog_Insert+0xb0>
200a308: 01 00 00 00 nop
after->delta_interval -= delta_interval;
200a30c: 10 80 00 1f b 200a388 <_Watchdog_Insert+0xe8>
200a310: a0 24 00 1b sub %l0, %i3, %l0
if ( the_watchdog->state != WATCHDOG_BEING_INSERTED ) {
goto exit_insert;
}
if ( _Watchdog_Sync_level > insert_isr_nest_level ) {
200a314: c2 04 62 38 ld [ %l1 + 0x238 ], %g1
200a318: 80 a7 40 01 cmp %i5, %g1
200a31c: 0a 80 00 29 bcs 200a3c0 <_Watchdog_Insert+0x120>
200a320: 01 00 00 00 nop
for ( after = _Watchdog_First( header ) ;
;
after = _Watchdog_Next( after ) ) {
if ( delta_interval == 0 || !_Watchdog_Next( after ) )
200a324: b6 a6 c0 10 subcc %i3, %l0, %i3
200a328: 02 80 00 19 be 200a38c <_Watchdog_Insert+0xec>
200a32c: f4 06 80 00 ld [ %i2 ], %i2
200a330: c2 06 80 00 ld [ %i2 ], %g1
200a334: 80 a0 60 00 cmp %g1, 0
200a338: 22 80 00 16 be,a 200a390 <_Watchdog_Insert+0xf0>
200a33c: c2 06 a0 04 ld [ %i2 + 4 ], %g1
break;
if ( delta_interval < after->delta_interval ) {
200a340: e0 06 a0 10 ld [ %i2 + 0x10 ], %l0
200a344: 80 a4 00 1b cmp %l0, %i3
200a348: 38 80 00 10 bgu,a 200a388 <_Watchdog_Insert+0xe8>
200a34c: a0 24 00 1b sub %l0, %i3, %l0
break;
}
delta_interval -= after->delta_interval;
_ISR_Flash( level );
200a350: 7f ff df af call 200220c <sparc_enable_interrupts>
200a354: 01 00 00 00 nop
200a358: 7f ff df a9 call 20021fc <sparc_disable_interrupts>
200a35c: 01 00 00 00 nop
if ( the_watchdog->state != WATCHDOG_BEING_INSERTED ) {
200a360: c2 06 60 08 ld [ %i1 + 8 ], %g1
200a364: 80 a0 60 01 cmp %g1, 1
200a368: 02 bf ff eb be 200a314 <_Watchdog_Insert+0x74>
200a36c: 84 14 62 38 or %l1, 0x238, %g2
_Chain_Insert_unprotected( after->Node.previous, &the_watchdog->Node );
the_watchdog->start_time = _Watchdog_Ticks_since_boot;
exit_insert:
_Watchdog_Sync_level = insert_isr_nest_level;
200a370: fa 24 62 38 st %i5, [ %l1 + 0x238 ]
_Watchdog_Sync_count--;
200a374: c2 04 a2 98 ld [ %l2 + 0x298 ], %g1
200a378: 82 00 7f ff add %g1, -1, %g1
200a37c: c2 24 a2 98 st %g1, [ %l2 + 0x298 ]
_ISR_Enable( level );
200a380: 7f ff df a3 call 200220c <sparc_enable_interrupts>
200a384: 91 e8 00 08 restore %g0, %o0, %o0
if ( delta_interval == 0 || !_Watchdog_Next( after ) )
break;
if ( delta_interval < after->delta_interval ) {
after->delta_interval -= delta_interval;
200a388: e0 26 a0 10 st %l0, [ %i2 + 0x10 ]
_Watchdog_Activate( the_watchdog );
the_watchdog->delta_interval = delta_interval;
_Chain_Insert_unprotected( after->Node.previous, &the_watchdog->Node );
200a38c: c2 06 a0 04 ld [ %i2 + 4 ], %g1
RTEMS_INLINE_ROUTINE void _Watchdog_Activate(
Watchdog_Control *the_watchdog
)
{
the_watchdog->state = WATCHDOG_ACTIVE;
200a390: 86 10 20 02 mov 2, %g3
)
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
200a394: c4 00 40 00 ld [ %g1 ], %g2
}
}
_Watchdog_Activate( the_watchdog );
the_watchdog->delta_interval = delta_interval;
200a398: f6 26 60 10 st %i3, [ %i1 + 0x10 ]
200a39c: c6 26 60 08 st %g3, [ %i1 + 8 ]
Chain_Node *the_node
)
{
Chain_Node *before_node;
the_node->previous = after_node;
200a3a0: c2 26 60 04 st %g1, [ %i1 + 4 ]
_Chain_Insert_unprotected( after->Node.previous, &the_watchdog->Node );
the_watchdog->start_time = _Watchdog_Ticks_since_boot;
200a3a4: 07 00 80 76 sethi %hi(0x201d800), %g3
200a3a8: c6 00 e2 9c ld [ %g3 + 0x29c ], %g3 ! 201da9c <_Watchdog_Ticks_since_boot>
before_node = after_node->next;
after_node->next = the_node;
the_node->next = before_node;
before_node->previous = the_node;
200a3ac: f2 20 a0 04 st %i1, [ %g2 + 4 ]
{
Chain_Node *before_node;
the_node->previous = after_node;
before_node = after_node->next;
after_node->next = the_node;
200a3b0: f2 20 40 00 st %i1, [ %g1 ]
the_node->next = before_node;
200a3b4: c4 26 40 00 st %g2, [ %i1 ]
200a3b8: 10 bf ff ee b 200a370 <_Watchdog_Insert+0xd0>
200a3bc: c6 26 60 14 st %g3, [ %i1 + 0x14 ]
if ( the_watchdog->state != WATCHDOG_BEING_INSERTED ) {
goto exit_insert;
}
if ( _Watchdog_Sync_level > insert_isr_nest_level ) {
_Watchdog_Sync_level = insert_isr_nest_level;
200a3c0: fa 20 80 00 st %i5, [ %g2 ]
goto restart;
200a3c4: 10 bf ff c7 b 200a2e0 <_Watchdog_Insert+0x40>
200a3c8: f6 06 60 0c ld [ %i1 + 0xc ], %i3
0200a428 <_Watchdog_Remove>:
*/
Watchdog_States _Watchdog_Remove(
Watchdog_Control *the_watchdog
)
{
200a428: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
200a42c: 7f ff df 74 call 20021fc <sparc_disable_interrupts>
200a430: 01 00 00 00 nop
previous_state = the_watchdog->state;
200a434: fa 06 20 08 ld [ %i0 + 8 ], %i5
switch ( previous_state ) {
200a438: 80 a7 60 01 cmp %i5, 1
200a43c: 02 80 00 2a be 200a4e4 <_Watchdog_Remove+0xbc>
200a440: 03 00 80 76 sethi %hi(0x201d800), %g1
200a444: 1a 80 00 09 bcc 200a468 <_Watchdog_Remove+0x40>
200a448: 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;
200a44c: 03 00 80 76 sethi %hi(0x201d800), %g1
200a450: c2 00 62 9c ld [ %g1 + 0x29c ], %g1 ! 201da9c <_Watchdog_Ticks_since_boot>
200a454: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a458: 7f ff df 6d call 200220c <sparc_enable_interrupts>
200a45c: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a460: 81 c7 e0 08 ret
200a464: 81 e8 00 00 restore
Watchdog_States previous_state;
Watchdog_Control *next_watchdog;
_ISR_Disable( level );
previous_state = the_watchdog->state;
switch ( previous_state ) {
200a468: 18 bf ff fa bgu 200a450 <_Watchdog_Remove+0x28> <== NEVER TAKEN
200a46c: 03 00 80 76 sethi %hi(0x201d800), %g1
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
_ISR_Enable( level );
return( previous_state );
}
200a470: c2 06 00 00 ld [ %i0 ], %g1
break;
case WATCHDOG_ACTIVE:
case WATCHDOG_REMOVE_IT:
the_watchdog->state = WATCHDOG_INACTIVE;
200a474: c0 26 20 08 clr [ %i0 + 8 ]
next_watchdog = _Watchdog_Next( the_watchdog );
if ( _Watchdog_Next(next_watchdog) )
200a478: c4 00 40 00 ld [ %g1 ], %g2
200a47c: 80 a0 a0 00 cmp %g2, 0
200a480: 02 80 00 07 be 200a49c <_Watchdog_Remove+0x74>
200a484: 05 00 80 76 sethi %hi(0x201d800), %g2
next_watchdog->delta_interval += the_watchdog->delta_interval;
200a488: c6 00 60 10 ld [ %g1 + 0x10 ], %g3
200a48c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2
200a490: 84 00 c0 02 add %g3, %g2, %g2
200a494: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
if ( _Watchdog_Sync_count )
200a498: 05 00 80 76 sethi %hi(0x201d800), %g2
200a49c: c4 00 a2 98 ld [ %g2 + 0x298 ], %g2 ! 201da98 <_Watchdog_Sync_count>
200a4a0: 80 a0 a0 00 cmp %g2, 0
200a4a4: 22 80 00 07 be,a 200a4c0 <_Watchdog_Remove+0x98>
200a4a8: c4 06 20 04 ld [ %i0 + 4 ], %g2
_Watchdog_Sync_level = _ISR_Nest_level;
200a4ac: 05 00 80 77 sethi %hi(0x201dc00), %g2
200a4b0: c6 00 a2 d0 ld [ %g2 + 0x2d0 ], %g3 ! 201ded0 <_Per_CPU_Information+0x8>
200a4b4: 05 00 80 76 sethi %hi(0x201d800), %g2
200a4b8: c6 20 a2 38 st %g3, [ %g2 + 0x238 ] ! 201da38 <_Watchdog_Sync_level>
{
Chain_Node *next;
Chain_Node *previous;
next = the_node->next;
previous = the_node->previous;
200a4bc: c4 06 20 04 ld [ %i0 + 4 ], %g2
next->previous = previous;
200a4c0: c4 20 60 04 st %g2, [ %g1 + 4 ]
previous->next = next;
200a4c4: c2 20 80 00 st %g1, [ %g2 ]
_Chain_Extract_unprotected( &the_watchdog->Node );
break;
}
the_watchdog->stop_time = _Watchdog_Ticks_since_boot;
200a4c8: 03 00 80 76 sethi %hi(0x201d800), %g1
200a4cc: c2 00 62 9c ld [ %g1 + 0x29c ], %g1 ! 201da9c <_Watchdog_Ticks_since_boot>
200a4d0: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a4d4: 7f ff df 4e call 200220c <sparc_enable_interrupts>
200a4d8: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a4dc: 81 c7 e0 08 ret
200a4e0: 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;
200a4e4: c2 00 62 9c ld [ %g1 + 0x29c ], %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;
200a4e8: 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;
200a4ec: c2 26 20 18 st %g1, [ %i0 + 0x18 ]
_ISR_Enable( level );
200a4f0: 7f ff df 47 call 200220c <sparc_enable_interrupts>
200a4f4: b0 10 00 1d mov %i5, %i0
return( previous_state );
}
200a4f8: 81 c7 e0 08 ret
200a4fc: 81 e8 00 00 restore
0200b544 <_Watchdog_Report_chain>:
void _Watchdog_Report_chain(
const char *name,
Chain_Control *header
)
{
200b544: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
Chain_Node *node;
_ISR_Disable( level );
200b548: 7f ff dd 61 call 2002acc <sparc_disable_interrupts>
200b54c: 01 00 00 00 nop
200b550: ba 10 00 08 mov %o0, %i5
printk( "Watchdog Chain: %s %p\n", name, header );
200b554: 11 00 80 75 sethi %hi(0x201d400), %o0
200b558: 94 10 00 19 mov %i1, %o2
200b55c: 92 10 00 18 mov %i0, %o1
200b560: 7f ff e4 75 call 2004734 <printk>
200b564: 90 12 23 80 or %o0, 0x380, %o0
*/
RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first(
const Chain_Control *the_chain
)
{
return _Chain_Immutable_head( the_chain )->next;
200b568: 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 );
200b56c: b2 06 60 04 add %i1, 4, %i1
if ( !_Chain_Is_empty( header ) ) {
200b570: 80 a7 00 19 cmp %i4, %i1
200b574: 02 80 00 0f be 200b5b0 <_Watchdog_Report_chain+0x6c>
200b578: 11 00 80 75 sethi %hi(0x201d400), %o0
node != _Chain_Tail(header) ;
node = node->next )
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
200b57c: 92 10 00 1c mov %i4, %o1
200b580: 40 00 00 0f call 200b5bc <_Watchdog_Report>
200b584: 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 )
200b588: 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 ) ;
200b58c: 80 a7 00 19 cmp %i4, %i1
200b590: 12 bf ff fc bne 200b580 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN
200b594: 92 10 00 1c mov %i4, %o1
{
Watchdog_Control *watch = (Watchdog_Control *) node;
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
200b598: 11 00 80 75 sethi %hi(0x201d400), %o0
200b59c: 92 10 00 18 mov %i0, %o1
200b5a0: 7f ff e4 65 call 2004734 <printk>
200b5a4: 90 12 23 98 or %o0, 0x398, %o0
} else {
printk( "Chain is empty\n" );
}
_ISR_Enable( level );
200b5a8: 7f ff dd 4d call 2002adc <sparc_enable_interrupts>
200b5ac: 91 e8 00 1d restore %g0, %i5, %o0
_Watchdog_Report( NULL, watch );
}
printk( "== end of %s \n", name );
} else {
printk( "Chain is empty\n" );
200b5b0: 7f ff e4 61 call 2004734 <printk>
200b5b4: 90 12 23 a8 or %o0, 0x3a8, %o0
200b5b8: 30 bf ff fc b,a 200b5a8 <_Watchdog_Report_chain+0x64>
02006474 <adjtime>:
int adjtime(
struct timeval *delta,
struct timeval *olddelta
)
{
2006474: 9d e3 bf 98 save %sp, -104, %sp
long adjustment;
/*
* Simple validations
*/
if ( !delta )
2006478: ba 96 20 00 orcc %i0, 0, %i5
200647c: 02 80 00 54 be 20065cc <adjtime+0x158>
2006480: 03 00 03 d0 sethi %hi(0xf4000), %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND )
2006484: c4 07 60 04 ld [ %i5 + 4 ], %g2
2006488: 82 10 62 3f or %g1, 0x23f, %g1
200648c: 80 a0 80 01 cmp %g2, %g1
2006490: 18 80 00 4f bgu 20065cc <adjtime+0x158>
2006494: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( olddelta ) {
2006498: 22 80 00 06 be,a 20064b0 <adjtime+0x3c>
200649c: c2 07 40 00 ld [ %i5 ], %g1
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
20064a0: c0 26 60 04 clr [ %i1 + 4 ]
20064a4: 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;
20064a8: c0 26 40 00 clr [ %i1 ]
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20064ac: c2 07 40 00 ld [ %i5 ], %g1
adjustment += delta->tv_usec;
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20064b0: 07 00 80 76 sethi %hi(0x201d800), %g3
20064b4: c8 00 e2 68 ld [ %g3 + 0x268 ], %g4 ! 201da68 <Configuration+0xc>
olddelta->tv_sec = 0;
olddelta->tv_usec = 0;
}
/* convert delta to microseconds */
adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND);
20064b8: 9f 28 60 08 sll %g1, 8, %o7
20064bc: 87 28 60 03 sll %g1, 3, %g3
20064c0: 86 23 c0 03 sub %o7, %g3, %g3
20064c4: 9f 28 e0 06 sll %g3, 6, %o7
20064c8: 86 23 c0 03 sub %o7, %g3, %g3
20064cc: 82 00 c0 01 add %g3, %g1, %g1
20064d0: 83 28 60 06 sll %g1, 6, %g1
adjustment += delta->tv_usec;
20064d4: 84 00 40 02 add %g1, %g2, %g2
/* too small to account for */
if ( adjustment < rtems_configuration_get_microseconds_per_tick() )
20064d8: 80 a0 80 04 cmp %g2, %g4
20064dc: 0a 80 00 3a bcs 20065c4 <adjtime+0x150>
20064e0: 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++;
20064e4: 03 00 80 7a sethi %hi(0x201e800), %g1
20064e8: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201e8c0 <_Thread_Dispatch_disable_level>
20064ec: 84 00 a0 01 inc %g2
20064f0: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ]
return _Thread_Dispatch_disable_level;
20064f4: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1
* This prevents context switches while we are adjusting the TOD
*/
_Thread_Disable_dispatch();
_TOD_Get( &ts );
20064f8: 40 00 06 6c call 2007ea8 <_TOD_Get>
20064fc: 90 07 bf f8 add %fp, -8, %o0
ts.tv_sec += delta->tv_sec;
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2006500: c2 07 60 04 ld [ %i5 + 4 ], %g1
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2006504: c8 07 bf f8 ld [ %fp + -8 ], %g4
2006508: c4 07 40 00 ld [ %i5 ], %g2
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
200650c: 87 28 60 02 sll %g1, 2, %g3
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2006510: 84 01 00 02 add %g4, %g2, %g2
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
2006514: 89 28 60 07 sll %g1, 7, %g4
2006518: 86 21 00 03 sub %g4, %g3, %g3
200651c: 82 00 c0 01 add %g3, %g1, %g1
2006520: c6 07 bf fc ld [ %fp + -4 ], %g3
2006524: 83 28 60 03 sll %g1, 3, %g1
_Thread_Disable_dispatch();
_TOD_Get( &ts );
ts.tv_sec += delta->tv_sec;
2006528: c4 27 bf f8 st %g2, [ %fp + -8 ]
ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND;
200652c: 82 00 40 03 add %g1, %g3, %g1
/* if adjustment is too much positive */
while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) {
2006530: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3
2006534: 86 10 e1 ff or %g3, 0x1ff, %g3 ! 3b9ac9ff <RAM_END+0x395ac9ff>
2006538: 80 a0 40 03 cmp %g1, %g3
200653c: 08 80 00 0a bleu 2006564 <adjtime+0xf0>
2006540: c2 27 bf fc st %g1, [ %fp + -4 ]
ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND;
2006544: 09 31 19 4d sethi %hi(0xc4653400), %g4
2006548: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 <RAM_END+0xc2253600>
200654c: 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 ) {
2006550: 80 a0 40 03 cmp %g1, %g3
2006554: 18 bf ff fe bgu 200654c <adjtime+0xd8> <== NEVER TAKEN
2006558: 84 00 a0 01 inc %g2
200655c: c2 27 bf fc st %g1, [ %fp + -4 ]
2006560: 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) ) {
2006564: 09 31 19 4d sethi %hi(0xc4653400), %g4
2006568: 88 11 22 00 or %g4, 0x200, %g4 ! c4653600 <RAM_END+0xc2253600>
200656c: 80 a0 40 04 cmp %g1, %g4
2006570: 18 80 00 0a bgu 2006598 <adjtime+0x124> <== NEVER TAKEN
2006574: c4 07 bf f8 ld [ %fp + -8 ], %g2
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
2006578: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3
200657c: 86 10 e2 00 or %g3, 0x200, %g3 ! 3b9aca00 <RAM_END+0x395aca00>
2006580: 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) ) {
2006584: 80 a0 40 04 cmp %g1, %g4
2006588: 08 bf ff fe bleu 2006580 <adjtime+0x10c>
200658c: 84 00 bf ff add %g2, -1, %g2
2006590: c2 27 bf fc st %g1, [ %fp + -4 ]
2006594: c4 27 bf f8 st %g2, [ %fp + -8 ]
ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND;
ts.tv_sec--;
}
_TOD_Set( &ts );
2006598: 40 00 06 6e call 2007f50 <_TOD_Set>
200659c: 90 07 bf f8 add %fp, -8, %o0
_Thread_Enable_dispatch();
20065a0: 40 00 0d 0b call 20099cc <_Thread_Enable_dispatch>
20065a4: b0 10 20 00 clr %i0
/* set the user's output */
if ( olddelta )
20065a8: 80 a6 60 00 cmp %i1, 0
20065ac: 02 80 00 0c be 20065dc <adjtime+0x168>
20065b0: 01 00 00 00 nop
*olddelta = *delta;
20065b4: c2 07 40 00 ld [ %i5 ], %g1
20065b8: c2 26 40 00 st %g1, [ %i1 ]
20065bc: c2 07 60 04 ld [ %i5 + 4 ], %g1
20065c0: c2 26 60 04 st %g1, [ %i1 + 4 ]
return 0;
}
20065c4: 81 c7 e0 08 ret
20065c8: 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 );
20065cc: 40 00 26 c0 call 20100cc <__errno>
20065d0: b0 10 3f ff mov -1, %i0
20065d4: 82 10 20 16 mov 0x16, %g1
20065d8: c2 22 00 00 st %g1, [ %o0 ]
20065dc: 81 c7 e0 08 ret
20065e0: 81 e8 00 00 restore
02006ce0 <aio_cancel>:
* operation(s) cannot be canceled
*/
int aio_cancel(int fildes, struct aiocb *aiocbp)
{
2006ce0: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request_chain *r_chain;
int result;
pthread_mutex_lock (&aio_request_queue.mutex);
2006ce4: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2006ce8: 40 00 04 91 call 2007f2c <pthread_mutex_lock>
2006cec: 90 17 60 2c or %i5, 0x2c, %o0 ! 2019c2c <aio_request_queue>
if (fcntl (fildes, F_GETFD) < 0) {
2006cf0: 90 10 00 18 mov %i0, %o0
2006cf4: 40 00 1e 97 call 200e750 <fcntl>
2006cf8: 92 10 20 01 mov 1, %o1
2006cfc: 80 a2 20 00 cmp %o0, 0
2006d00: 06 80 00 6c bl 2006eb0 <aio_cancel+0x1d0>
2006d04: 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) {
2006d08: 02 80 00 3b be 2006df4 <aio_cancel+0x114>
2006d0c: 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) {
2006d10: f8 06 40 00 ld [ %i1 ], %i4
2006d14: 80 a7 00 18 cmp %i4, %i0
2006d18: 12 80 00 2f bne 2006dd4 <aio_cancel+0xf4>
2006d1c: 90 17 60 2c or %i5, 0x2c, %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);
2006d20: 92 10 00 1c mov %i4, %o1
2006d24: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006d28: 94 10 20 00 clr %o2
2006d2c: 40 00 00 cc call 200705c <rtems_aio_search_fd>
2006d30: 90 12 20 74 or %o0, 0x74, %o0
if (r_chain == NULL) {
2006d34: b0 92 20 00 orcc %o0, 0, %i0
2006d38: 22 80 00 0f be,a 2006d74 <aio_cancel+0x94>
2006d3c: ba 17 60 2c or %i5, 0x2c, %i5
return AIO_ALLDONE;
}
}
AIO_printf ("Request on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2006d40: b8 06 20 1c add %i0, 0x1c, %i4
2006d44: 40 00 04 7a call 2007f2c <pthread_mutex_lock>
2006d48: 90 10 00 1c mov %i4, %o0
result = rtems_aio_remove_req (&r_chain->perfd, aiocbp);
2006d4c: 92 10 00 19 mov %i1, %o1
2006d50: 40 00 01 e4 call 20074e0 <rtems_aio_remove_req>
2006d54: 90 06 20 08 add %i0, 8, %o0
2006d58: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&r_chain->mutex);
2006d5c: 40 00 04 94 call 2007fac <pthread_mutex_unlock>
2006d60: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006d64: 40 00 04 92 call 2007fac <pthread_mutex_unlock>
2006d68: 90 17 60 2c or %i5, 0x2c, %o0
return result;
}
return AIO_ALLDONE;
}
2006d6c: 81 c7 e0 08 ret
2006d70: 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)) {
2006d74: c4 07 60 54 ld [ %i5 + 0x54 ], %g2
2006d78: 82 07 60 58 add %i5, 0x58, %g1
2006d7c: 80 a0 80 01 cmp %g2, %g1
2006d80: 02 80 00 0f be 2006dbc <aio_cancel+0xdc> <== NEVER TAKEN
2006d84: 90 07 60 54 add %i5, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2006d88: 92 10 00 1c mov %i4, %o1
2006d8c: 40 00 00 b4 call 200705c <rtems_aio_search_fd>
2006d90: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2006d94: 80 a2 20 00 cmp %o0, 0
2006d98: 02 80 00 0e be 2006dd0 <aio_cancel+0xf0>
2006d9c: 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);
2006da0: 40 00 01 d0 call 20074e0 <rtems_aio_remove_req>
2006da4: 90 02 20 08 add %o0, 8, %o0
2006da8: b0 10 00 08 mov %o0, %i0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006dac: 40 00 04 80 call 2007fac <pthread_mutex_unlock>
2006db0: 90 10 00 1d mov %i5, %o0
return result;
2006db4: 81 c7 e0 08 ret
2006db8: 81 e8 00 00 restore
} else {
pthread_mutex_unlock (&aio_request_queue.mutex);
2006dbc: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED
2006dc0: 40 00 04 7b call 2007fac <pthread_mutex_unlock>
2006dc4: b0 10 20 02 mov 2, %i0
return AIO_ALLDONE;
2006dc8: 81 c7 e0 08 ret
2006dcc: 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);
2006dd0: 90 10 00 1d mov %i5, %o0
2006dd4: 40 00 04 76 call 2007fac <pthread_mutex_unlock>
2006dd8: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one (EINVAL);
2006ddc: 40 00 2c b1 call 20120a0 <__errno>
2006de0: 01 00 00 00 nop
2006de4: 82 10 20 16 mov 0x16, %g1 ! 16 <PROM_START+0x16>
2006de8: c2 22 00 00 st %g1, [ %o0 ]
2006dec: 81 c7 e0 08 ret
2006df0: 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);
2006df4: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006df8: 94 10 20 00 clr %o2
2006dfc: 40 00 00 98 call 200705c <rtems_aio_search_fd>
2006e00: 90 12 20 74 or %o0, 0x74, %o0
if (r_chain == NULL) {
2006e04: b8 92 20 00 orcc %o0, 0, %i4
2006e08: 02 80 00 0f be 2006e44 <aio_cancel+0x164>
2006e0c: b2 07 20 1c add %i4, 0x1c, %i1
return AIO_ALLDONE;
}
AIO_printf ("Request chain on [WQ]\n");
pthread_mutex_lock (&r_chain->mutex);
2006e10: 40 00 04 47 call 2007f2c <pthread_mutex_lock>
2006e14: 90 10 00 19 mov %i1, %o0
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2006e18: 40 00 0b 04 call 2009a28 <_Chain_Extract>
2006e1c: 90 10 00 1c mov %i4, %o0
rtems_chain_extract (&r_chain->next_fd);
rtems_aio_remove_fd (r_chain);
2006e20: 40 00 01 9c call 2007490 <rtems_aio_remove_fd>
2006e24: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&r_chain->mutex);
2006e28: 40 00 04 61 call 2007fac <pthread_mutex_unlock>
2006e2c: 90 10 00 19 mov %i1, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
2006e30: 90 17 60 2c or %i5, 0x2c, %o0
2006e34: 40 00 04 5e call 2007fac <pthread_mutex_unlock>
2006e38: b0 10 20 00 clr %i0
return AIO_CANCELED;
2006e3c: 81 c7 e0 08 ret
2006e40: 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;
2006e44: ba 17 60 2c or %i5, 0x2c, %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)) {
2006e48: c4 07 60 54 ld [ %i5 + 0x54 ], %g2
2006e4c: 82 07 60 58 add %i5, 0x58, %g1
2006e50: 80 a0 80 01 cmp %g2, %g1
2006e54: 02 bf ff da be 2006dbc <aio_cancel+0xdc> <== NEVER TAKEN
2006e58: 90 07 60 54 add %i5, 0x54, %o0
r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0);
2006e5c: 92 10 00 18 mov %i0, %o1
2006e60: 40 00 00 7f call 200705c <rtems_aio_search_fd>
2006e64: 94 10 20 00 clr %o2
if (r_chain == NULL) {
2006e68: b8 92 20 00 orcc %o0, 0, %i4
2006e6c: 22 bf ff d5 be,a 2006dc0 <aio_cancel+0xe0>
2006e70: 90 10 00 1d mov %i5, %o0
2006e74: 40 00 0a ed call 2009a28 <_Chain_Extract>
2006e78: 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);
2006e7c: 40 00 01 85 call 2007490 <rtems_aio_remove_fd>
2006e80: 90 10 00 1c mov %i4, %o0
pthread_mutex_destroy (&r_chain->mutex);
2006e84: 40 00 03 7f call 2007c80 <pthread_mutex_destroy>
2006e88: 90 10 00 19 mov %i1, %o0
pthread_cond_destroy (&r_chain->mutex);
2006e8c: 40 00 02 9e call 2007904 <pthread_cond_destroy>
2006e90: 90 10 00 19 mov %i1, %o0
free (r_chain);
2006e94: 7f ff f2 0a call 20036bc <free>
2006e98: 90 10 00 1c mov %i4, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return AIO_CANCELED;
2006e9c: 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);
2006ea0: 40 00 04 43 call 2007fac <pthread_mutex_unlock>
2006ea4: 90 10 00 1d mov %i5, %o0
return AIO_CANCELED;
2006ea8: 81 c7 e0 08 ret
2006eac: 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);
2006eb0: 40 00 04 3f call 2007fac <pthread_mutex_unlock>
2006eb4: 90 17 60 2c or %i5, 0x2c, %o0
rtems_set_errno_and_return_minus_one (EBADF);
2006eb8: 40 00 2c 7a call 20120a0 <__errno>
2006ebc: b0 10 3f ff mov -1, %i0
2006ec0: 82 10 20 09 mov 9, %g1
2006ec4: c2 22 00 00 st %g1, [ %o0 ]
2006ec8: 81 c7 e0 08 ret
2006ecc: 81 e8 00 00 restore
02006ed8 <aio_fsync>:
int aio_fsync(
int op,
struct aiocb *aiocbp
)
{
2006ed8: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
if (op != O_SYNC)
2006edc: 03 00 00 08 sethi %hi(0x2000), %g1
2006ee0: 80 a6 00 01 cmp %i0, %g1
2006ee4: 12 80 00 14 bne 2006f34 <aio_fsync+0x5c>
2006ee8: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2006eec: d0 06 40 00 ld [ %i1 ], %o0
2006ef0: 40 00 1e 18 call 200e750 <fcntl>
2006ef4: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
2006ef8: 90 0a 20 03 and %o0, 3, %o0
2006efc: 90 02 3f ff add %o0, -1, %o0
2006f00: 80 a2 20 01 cmp %o0, 1
2006f04: 18 80 00 0c bgu 2006f34 <aio_fsync+0x5c>
2006f08: ba 10 20 09 mov 9, %i5
rtems_aio_set_errno_return_minus_one (EBADF, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2006f0c: 7f ff f3 76 call 2003ce4 <malloc>
2006f10: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2006f14: 80 a2 20 00 cmp %o0, 0
2006f18: 02 80 00 06 be 2006f30 <aio_fsync+0x58> <== NEVER TAKEN
2006f1c: 82 10 20 03 mov 3, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2006f20: f2 22 20 14 st %i1, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_SYNC;
2006f24: c2 26 60 30 st %g1, [ %i1 + 0x30 ]
return rtems_aio_enqueue (req);
2006f28: 40 00 01 8a call 2007550 <rtems_aio_enqueue>
2006f2c: 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);
2006f30: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
2006f34: 82 10 3f ff mov -1, %g1
2006f38: fa 26 60 34 st %i5, [ %i1 + 0x34 ]
2006f3c: c2 26 60 38 st %g1, [ %i1 + 0x38 ]
2006f40: 40 00 2c 58 call 20120a0 <__errno>
2006f44: b0 10 3f ff mov -1, %i0
2006f48: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_SYNC;
return rtems_aio_enqueue (req);
}
2006f4c: 81 c7 e0 08 ret
2006f50: 81 e8 00 00 restore
02007734 <aio_read>:
* 0 - otherwise
*/
int
aio_read (struct aiocb *aiocbp)
{
2007734: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
2007738: d0 06 00 00 ld [ %i0 ], %o0
200773c: 40 00 1c 05 call 200e750 <fcntl>
2007740: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR)))
2007744: 90 0a 20 03 and %o0, 3, %o0
2007748: 80 a2 20 02 cmp %o0, 2
200774c: 12 80 00 1b bne 20077b8 <aio_read+0x84>
2007750: 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)
2007754: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2007758: 80 a0 60 00 cmp %g1, 0
200775c: 12 80 00 0f bne 2007798 <aio_read+0x64>
2007760: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
2007764: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007768: 80 a0 60 00 cmp %g1, 0
200776c: 06 80 00 0c bl 200779c <aio_read+0x68>
2007770: 82 10 3f ff mov -1, %g1
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
2007774: 7f ff f1 5c call 2003ce4 <malloc>
2007778: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
200777c: 80 a2 20 00 cmp %o0, 0
2007780: 02 80 00 12 be 20077c8 <aio_read+0x94> <== NEVER TAKEN
2007784: 82 10 20 01 mov 1, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2007788: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_READ;
200778c: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
2007790: 7f ff ff 70 call 2007550 <rtems_aio_enqueue>
2007794: 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);
2007798: 82 10 3f ff mov -1, %g1
200779c: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
20077a0: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
20077a4: 40 00 2a 3f call 20120a0 <__errno>
20077a8: b0 10 3f ff mov -1, %i0
20077ac: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_READ;
return rtems_aio_enqueue (req);
}
20077b0: 81 c7 e0 08 ret
20077b4: 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)))
20077b8: 02 bf ff e7 be 2007754 <aio_read+0x20> <== NEVER TAKEN
20077bc: 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);
20077c0: 10 bf ff f7 b 200779c <aio_read+0x68>
20077c4: 82 10 3f ff mov -1, %g1
20077c8: 10 bf ff f4 b 2007798 <aio_read+0x64> <== NOT EXECUTED
20077cc: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
020077d8 <aio_write>:
* 0 - otherwise
*/
int
aio_write (struct aiocb *aiocbp)
{
20077d8: 9d e3 bf a0 save %sp, -96, %sp
rtems_aio_request *req;
int mode;
mode = fcntl (aiocbp->aio_fildes, F_GETFL);
20077dc: d0 06 00 00 ld [ %i0 ], %o0
20077e0: 40 00 1b dc call 200e750 <fcntl>
20077e4: 92 10 20 03 mov 3, %o1
if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR)))
20077e8: 90 0a 20 03 and %o0, 3, %o0
20077ec: 90 02 3f ff add %o0, -1, %o0
20077f0: 80 a2 20 01 cmp %o0, 1
20077f4: 18 80 00 14 bgu 2007844 <aio_write+0x6c>
20077f8: 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)
20077fc: c2 06 20 18 ld [ %i0 + 0x18 ], %g1
2007800: 80 a0 60 00 cmp %g1, 0
2007804: 12 80 00 10 bne 2007844 <aio_write+0x6c>
2007808: ba 10 20 16 mov 0x16, %i5
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
if (aiocbp->aio_offset < 0)
200780c: c2 06 20 08 ld [ %i0 + 8 ], %g1
2007810: 80 a0 60 00 cmp %g1, 0
2007814: 06 80 00 0d bl 2007848 <aio_write+0x70>
2007818: 82 10 3f ff mov -1, %g1
rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp);
req = malloc (sizeof (rtems_aio_request));
200781c: 7f ff f1 32 call 2003ce4 <malloc>
2007820: 90 10 20 18 mov 0x18, %o0
if (req == NULL)
2007824: 80 a2 20 00 cmp %o0, 0
2007828: 02 80 00 06 be 2007840 <aio_write+0x68> <== NEVER TAKEN
200782c: 82 10 20 02 mov 2, %g1
rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp);
req->aiocbp = aiocbp;
2007830: f0 22 20 14 st %i0, [ %o0 + 0x14 ]
req->aiocbp->aio_lio_opcode = LIO_WRITE;
2007834: c2 26 20 30 st %g1, [ %i0 + 0x30 ]
return rtems_aio_enqueue (req);
2007838: 7f ff ff 46 call 2007550 <rtems_aio_enqueue>
200783c: 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);
2007840: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED
2007844: 82 10 3f ff mov -1, %g1
2007848: fa 26 20 34 st %i5, [ %i0 + 0x34 ]
200784c: c2 26 20 38 st %g1, [ %i0 + 0x38 ]
2007850: 40 00 2a 14 call 20120a0 <__errno>
2007854: b0 10 3f ff mov -1, %i0
2007858: fa 22 00 00 st %i5, [ %o0 ]
req->aiocbp = aiocbp;
req->aiocbp->aio_lio_opcode = LIO_WRITE;
return rtems_aio_enqueue (req);
}
200785c: 81 c7 e0 08 ret
2007860: 81 e8 00 00 restore
020062dc <clock_gettime>:
int clock_gettime(
clockid_t clock_id,
struct timespec *tp
)
{
20062dc: 9d e3 bf a0 save %sp, -96, %sp
if ( !tp )
20062e0: 80 a6 60 00 cmp %i1, 0
20062e4: 02 80 00 20 be 2006364 <clock_gettime+0x88>
20062e8: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
20062ec: 02 80 00 19 be 2006350 <clock_gettime+0x74>
20062f0: 80 a6 20 04 cmp %i0, 4
_TOD_Get(tp);
return 0;
}
#ifdef CLOCK_MONOTONIC
if ( clock_id == CLOCK_MONOTONIC ) {
20062f4: 02 80 00 12 be 200633c <clock_gettime+0x60> <== NEVER TAKEN
20062f8: 80 a6 20 02 cmp %i0, 2
return 0;
}
#endif
#ifdef _POSIX_CPUTIME
if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) {
20062fc: 02 80 00 10 be 200633c <clock_gettime+0x60>
2006300: 80 a6 20 03 cmp %i0, 3
return 0;
}
#endif
#ifdef _POSIX_THREAD_CPUTIME
if ( clock_id == CLOCK_THREAD_CPUTIME_ID )
2006304: 02 80 00 08 be 2006324 <clock_gettime+0x48>
2006308: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
200630c: 40 00 28 f9 call 20106f0 <__errno>
2006310: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
2006314: 82 10 20 16 mov 0x16, %g1
2006318: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
200631c: 81 c7 e0 08 ret
2006320: 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 );
2006324: 40 00 28 f3 call 20106f0 <__errno>
2006328: b0 10 3f ff mov -1, %i0
200632c: 82 10 20 58 mov 0x58, %g1
2006330: c2 22 00 00 st %g1, [ %o0 ]
2006334: 81 c7 e0 08 ret
2006338: 81 e8 00 00 restore
}
#endif
#ifdef _POSIX_CPUTIME
if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) {
_TOD_Get_uptime_as_timespec( tp );
200633c: 90 10 00 19 mov %i1, %o0
2006340: 40 00 08 37 call 200841c <_TOD_Get_uptime_as_timespec>
2006344: b0 10 20 00 clr %i0
return 0;
2006348: 81 c7 e0 08 ret
200634c: 81 e8 00 00 restore
{
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
_TOD_Get(tp);
2006350: 90 10 00 19 mov %i1, %o0
2006354: 40 00 08 17 call 20083b0 <_TOD_Get>
2006358: b0 10 20 00 clr %i0
return 0;
200635c: 81 c7 e0 08 ret
2006360: 81 e8 00 00 restore
clockid_t clock_id,
struct timespec *tp
)
{
if ( !tp )
rtems_set_errno_and_return_minus_one( EINVAL );
2006364: 40 00 28 e3 call 20106f0 <__errno>
2006368: b0 10 3f ff mov -1, %i0
200636c: 82 10 20 16 mov 0x16, %g1
2006370: c2 22 00 00 st %g1, [ %o0 ]
2006374: 81 c7 e0 08 ret
2006378: 81 e8 00 00 restore
0200637c <clock_settime>:
int clock_settime(
clockid_t clock_id,
const struct timespec *tp
)
{
200637c: 9d e3 bf a0 save %sp, -96, %sp
if ( !tp )
2006380: 80 a6 60 00 cmp %i1, 0
2006384: 02 80 00 25 be 2006418 <clock_settime+0x9c> <== NEVER TAKEN
2006388: 80 a6 20 01 cmp %i0, 1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( clock_id == CLOCK_REALTIME ) {
200638c: 02 80 00 0c be 20063bc <clock_settime+0x40>
2006390: 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 )
2006394: 02 80 00 1b be 2006400 <clock_settime+0x84>
2006398: 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 )
200639c: 02 80 00 19 be 2006400 <clock_settime+0x84>
20063a0: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( ENOSYS );
#endif
else
rtems_set_errno_and_return_minus_one( EINVAL );
20063a4: 40 00 28 d3 call 20106f0 <__errno>
20063a8: b0 10 3f ff mov -1, %i0 ! ffffffff <RAM_END+0xfdbfffff>
20063ac: 82 10 20 16 mov 0x16, %g1
20063b0: c2 22 00 00 st %g1, [ %o0 ]
return 0;
}
20063b4: 81 c7 e0 08 ret
20063b8: 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 )
20063bc: c4 06 40 00 ld [ %i1 ], %g2
20063c0: 03 08 76 b9 sethi %hi(0x21dae400), %g1
20063c4: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff <RAM_END+0x1f9ae4ff>
20063c8: 80 a0 80 01 cmp %g2, %g1
20063cc: 08 80 00 13 bleu 2006418 <clock_settime+0x9c>
20063d0: 03 00 80 7d sethi %hi(0x201f400), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20063d4: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 ! 201f460 <_Thread_Dispatch_disable_level>
20063d8: 84 00 a0 01 inc %g2
20063dc: c4 20 60 60 st %g2, [ %g1 + 0x60 ]
return _Thread_Dispatch_disable_level;
20063e0: c2 00 60 60 ld [ %g1 + 0x60 ], %g1
rtems_set_errno_and_return_minus_one( EINVAL );
_Thread_Disable_dispatch();
_TOD_Set( tp );
20063e4: 90 10 00 19 mov %i1, %o0
20063e8: 40 00 08 25 call 200847c <_TOD_Set>
20063ec: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
20063f0: 40 00 0e c2 call 2009ef8 <_Thread_Enable_dispatch>
20063f4: 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;
20063f8: 81 c7 e0 08 ret
20063fc: 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 );
2006400: 40 00 28 bc call 20106f0 <__errno>
2006404: b0 10 3f ff mov -1, %i0
2006408: 82 10 20 58 mov 0x58, %g1
200640c: c2 22 00 00 st %g1, [ %o0 ]
2006410: 81 c7 e0 08 ret
2006414: 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 );
2006418: 40 00 28 b6 call 20106f0 <__errno>
200641c: b0 10 3f ff mov -1, %i0
2006420: 82 10 20 16 mov 0x16, %g1
2006424: c2 22 00 00 st %g1, [ %o0 ]
2006428: 81 c7 e0 08 ret
200642c: 81 e8 00 00 restore
0201a384 <killinfo>:
int killinfo(
pid_t pid,
int sig,
const union sigval *value
)
{
201a384: 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() )
201a388: 7f ff fe e2 call 2019f10 <getpid>
201a38c: 01 00 00 00 nop
201a390: 80 a2 00 18 cmp %o0, %i0
201a394: 12 80 00 af bne 201a650 <killinfo+0x2cc>
201a398: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
/*
* Validate the signal passed.
*/
if ( !sig )
201a39c: 02 80 00 b3 be 201a668 <killinfo+0x2e4>
201a3a0: 82 06 7f ff add %i1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201a3a4: 80 a0 60 1f cmp %g1, 0x1f
201a3a8: 18 80 00 b0 bgu 201a668 <killinfo+0x2e4>
201a3ac: 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 )
201a3b0: 39 00 80 77 sethi %hi(0x201dc00), %i4
201a3b4: a1 2e 60 04 sll %i1, 4, %l0
201a3b8: b8 17 23 20 or %i4, 0x320, %i4
201a3bc: 84 24 00 1b sub %l0, %i3, %g2
201a3c0: 84 07 00 02 add %i4, %g2, %g2
201a3c4: c4 00 a0 08 ld [ %g2 + 8 ], %g2
201a3c8: 80 a0 a0 01 cmp %g2, 1
201a3cc: 02 80 00 3f be 201a4c8 <killinfo+0x144>
201a3d0: 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 ) )
201a3d4: 80 a6 60 04 cmp %i1, 4
201a3d8: 02 80 00 3e be 201a4d0 <killinfo+0x14c>
201a3dc: 80 a6 60 08 cmp %i1, 8
201a3e0: 02 80 00 3c be 201a4d0 <killinfo+0x14c>
201a3e4: 80 a6 60 0b cmp %i1, 0xb
201a3e8: 02 80 00 3a be 201a4d0 <killinfo+0x14c>
201a3ec: ba 10 20 01 mov 1, %i5
/*
* Build up a siginfo structure
*/
siginfo = &siginfo_struct;
siginfo->si_signo = sig;
201a3f0: f2 27 bf f4 st %i1, [ %fp + -12 ]
siginfo->si_code = SI_USER;
201a3f4: fa 27 bf f8 st %i5, [ %fp + -8 ]
if ( !value ) {
201a3f8: 80 a6 a0 00 cmp %i2, 0
201a3fc: 02 80 00 3b be 201a4e8 <killinfo+0x164>
201a400: bb 2f 40 01 sll %i5, %g1, %i5
siginfo->si_value.sival_int = 0;
} else {
siginfo->si_value = *value;
201a404: c2 06 80 00 ld [ %i2 ], %g1
201a408: 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++;
201a40c: 03 00 80 76 sethi %hi(0x201d800), %g1
201a410: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 201d990 <_Thread_Dispatch_disable_level>
201a414: 84 00 a0 01 inc %g2
201a418: c4 20 61 90 st %g2, [ %g1 + 0x190 ]
return _Thread_Dispatch_disable_level;
201a41c: c2 00 61 90 ld [ %g1 + 0x190 ], %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;
201a420: 03 00 80 77 sethi %hi(0x201dc00), %g1
201a424: d0 00 62 d4 ld [ %g1 + 0x2d4 ], %o0 ! 201ded4 <_Per_CPU_Information+0xc>
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
if ( _POSIX_signals_Is_interested( api, mask ) ) {
201a428: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
201a42c: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1
201a430: 80 af 40 01 andncc %i5, %g1, %g0
201a434: 12 80 00 16 bne 201a48c <killinfo+0x108>
201a438: 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;
201a43c: d0 00 e0 ac ld [ %g3 + 0xac ], %o0 ! 201e0ac <_POSIX_signals_Wait_queue>
201a440: 86 10 e0 ac or %g3, 0xac, %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 );
201a444: 86 00 e0 04 add %g3, 4, %g3
201a448: 80 a2 00 03 cmp %o0, %g3
201a44c: 32 80 00 0d bne,a 201a480 <killinfo+0xfc>
201a450: c2 02 20 30 ld [ %o0 + 0x30 ], %g1
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201a454: 10 80 00 27 b 201a4f0 <killinfo+0x16c>
201a458: 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)
201a45c: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1
201a460: 80 af 40 01 andncc %i5, %g1, %g0
201a464: 12 80 00 0b bne 201a490 <killinfo+0x10c>
201a468: 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 ) {
201a46c: 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 );
201a470: 80 a2 00 03 cmp %o0, %g3
201a474: 02 80 00 1f be 201a4f0 <killinfo+0x16c> <== ALWAYS TAKEN
201a478: 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)
201a47c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED
201a480: 80 8f 40 01 btst %i5, %g1
201a484: 02 bf ff f6 be 201a45c <killinfo+0xd8>
201a488: 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 ) ) {
201a48c: 92 10 00 19 mov %i1, %o1
201a490: 40 00 00 8d call 201a6c4 <_POSIX_signals_Unblock_thread>
201a494: 94 07 bf f4 add %fp, -12, %o2
201a498: 80 8a 20 ff btst 0xff, %o0
201a49c: 12 80 00 5a bne 201a604 <killinfo+0x280>
201a4a0: 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 );
201a4a4: 40 00 00 7f call 201a6a0 <_POSIX_signals_Set_process_signals>
201a4a8: 90 10 00 1d mov %i5, %o0
if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) {
201a4ac: b6 24 00 1b sub %l0, %i3, %i3
201a4b0: c2 07 00 1b ld [ %i4 + %i3 ], %g1
201a4b4: 80 a0 60 02 cmp %g1, 2
201a4b8: 02 80 00 57 be 201a614 <killinfo+0x290>
201a4bc: 11 00 80 78 sethi %hi(0x201e000), %o0
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
}
DEBUG_STEP("\n");
_Thread_Enable_dispatch();
201a4c0: 7f ff bb ba call 20093a8 <_Thread_Enable_dispatch>
201a4c4: b0 10 20 00 clr %i0
return 0;
}
201a4c8: 81 c7 e0 08 ret
201a4cc: 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 );
201a4d0: 40 00 01 0f call 201a90c <pthread_self>
201a4d4: 01 00 00 00 nop
201a4d8: 40 00 00 d2 call 201a820 <pthread_kill>
201a4dc: 92 10 00 19 mov %i1, %o1
201a4e0: 81 c7 e0 08 ret
201a4e4: 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;
201a4e8: 10 bf ff c9 b 201a40c <killinfo+0x88>
201a4ec: c0 27 bf fc clr [ %fp + -4 ]
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
interested_priority = PRIORITY_MAXIMUM + 1;
201a4f0: c8 08 60 6c ldub [ %g1 + 0x6c ], %g4
201a4f4: 1b 00 80 76 sethi %hi(0x201d800), %o5
201a4f8: 88 01 20 01 inc %g4
201a4fc: 9a 13 61 00 or %o5, 0x100, %o5
*
* NOTES:
*
* + rtems internal threads do not receive signals.
*/
interested = NULL;
201a500: 90 10 20 00 clr %o0
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201a504: 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);
201a508: 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 ] )
201a50c: c2 03 40 00 ld [ %o5 ], %g1
201a510: 80 a0 60 00 cmp %g1, 0
201a514: 22 80 00 31 be,a 201a5d8 <killinfo+0x254> <== NEVER TAKEN
201a518: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED
continue;
the_info = _Objects_Information_table[ the_api ][ 1 ];
201a51c: c2 00 60 04 ld [ %g1 + 4 ], %g1
*/
if ( !the_info )
continue;
#endif
maximum = the_info->maximum;
201a520: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201a524: 80 a6 a0 00 cmp %i2, 0
201a528: 02 80 00 2b be 201a5d4 <killinfo+0x250>
201a52c: f0 00 60 1c ld [ %g1 + 0x1c ], %i0
201a530: 82 10 20 01 mov 1, %g1
*/
#define _POSIX_signals_Is_interested( _api, _mask ) \
( ~(_api)->signals_blocked & (_mask) )
int killinfo(
201a534: 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 ];
201a538: c4 06 00 02 ld [ %i0 + %g2 ], %g2
if ( !the_thread )
201a53c: 80 a0 a0 00 cmp %g2, 0
201a540: 22 80 00 22 be,a 201a5c8 <killinfo+0x244>
201a544: 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 )
201a548: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3
201a54c: 80 a0 c0 04 cmp %g3, %g4
201a550: 38 80 00 1e bgu,a 201a5c8 <killinfo+0x244>
201a554: 82 00 60 01 inc %g1
#if defined(RTEMS_DEBUG)
if ( !api )
continue;
#endif
if ( !_POSIX_signals_Is_interested( api, mask ) )
201a558: de 00 a1 5c ld [ %g2 + 0x15c ], %o7
201a55c: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7
201a560: 80 af 40 0f andncc %i5, %o7, %g0
201a564: 22 80 00 19 be,a 201a5c8 <killinfo+0x244>
201a568: 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 ) {
201a56c: 80 a0 c0 04 cmp %g3, %g4
201a570: 2a 80 00 14 bcs,a 201a5c0 <killinfo+0x23c>
201a574: 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 ) ) {
201a578: 80 a2 20 00 cmp %o0, 0
201a57c: 22 80 00 13 be,a 201a5c8 <killinfo+0x244> <== NEVER TAKEN
201a580: 82 00 60 01 inc %g1 <== NOT EXECUTED
201a584: de 02 20 10 ld [ %o0 + 0x10 ], %o7
201a588: 80 a3 e0 00 cmp %o7, 0
201a58c: 22 80 00 0f be,a 201a5c8 <killinfo+0x244> <== NEVER TAKEN
201a590: 82 00 60 01 inc %g1 <== NOT EXECUTED
/* preferred ready over blocked */
DEBUG_STEP("5");
if ( _States_Is_ready( the_thread->current_state ) ) {
201a594: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3
201a598: 80 a2 e0 00 cmp %o3, 0
201a59c: 22 80 00 09 be,a 201a5c0 <killinfo+0x23c>
201a5a0: 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) ) {
201a5a4: 80 8b c0 0a btst %o7, %o2
201a5a8: 32 80 00 08 bne,a 201a5c8 <killinfo+0x244>
201a5ac: 82 00 60 01 inc %g1
DEBUG_STEP("7");
if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) {
201a5b0: 80 8a c0 0a btst %o3, %o2
201a5b4: 22 80 00 05 be,a 201a5c8 <killinfo+0x244>
201a5b8: 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 ) ) {
201a5bc: 88 10 00 03 mov %g3, %g4
201a5c0: 90 10 00 02 mov %g2, %o0
#endif
maximum = the_info->maximum;
object_table = the_info->local_table;
for ( index = 1 ; index <= maximum ; index++ ) {
201a5c4: 82 00 60 01 inc %g1
201a5c8: 80 a6 80 01 cmp %i2, %g1
201a5cc: 1a bf ff db bcc 201a538 <killinfo+0x1b4>
201a5d0: 85 28 60 02 sll %g1, 2, %g2
201a5d4: 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++) {
201a5d8: 80 a3 40 0c cmp %o5, %o4
201a5dc: 32 bf ff cd bne,a 201a510 <killinfo+0x18c>
201a5e0: c2 03 40 00 ld [ %o5 ], %g1
}
}
}
}
if ( interested ) {
201a5e4: 80 a2 20 00 cmp %o0, 0
201a5e8: 02 bf ff af be 201a4a4 <killinfo+0x120>
201a5ec: 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 ) ) {
201a5f0: 40 00 00 35 call 201a6c4 <_POSIX_signals_Unblock_thread>
201a5f4: 94 07 bf f4 add %fp, -12, %o2
201a5f8: 80 8a 20 ff btst 0xff, %o0
201a5fc: 02 bf ff aa be 201a4a4 <killinfo+0x120> <== ALWAYS TAKEN
201a600: 01 00 00 00 nop
_Thread_Enable_dispatch();
201a604: 7f ff bb 69 call 20093a8 <_Thread_Enable_dispatch>
201a608: b0 10 20 00 clr %i0 ! 0 <PROM_START>
return 0;
201a60c: 81 c7 e0 08 ret
201a610: 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 *)
201a614: 7f ff b3 8d call 2007448 <_Chain_Get>
201a618: 90 12 20 a0 or %o0, 0xa0, %o0
_Chain_Get( &_POSIX_signals_Inactive_siginfo );
if ( !psiginfo ) {
201a61c: 92 92 20 00 orcc %o0, 0, %o1
201a620: 02 80 00 18 be 201a680 <killinfo+0x2fc>
201a624: 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 );
201a628: 11 00 80 78 sethi %hi(0x201e000), %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201a62c: c2 22 60 08 st %g1, [ %o1 + 8 ]
201a630: c2 07 bf f8 ld [ %fp + -8 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201a634: 90 12 21 18 or %o0, 0x118, %o0
if ( !psiginfo ) {
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( EAGAIN );
}
psiginfo->Info = *siginfo;
201a638: c2 22 60 0c st %g1, [ %o1 + 0xc ]
201a63c: c2 07 bf fc ld [ %fp + -4 ], %g1
_Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node );
201a640: 90 02 00 1b add %o0, %i3, %o0
201a644: 7f ff b3 6d call 20073f8 <_Chain_Append>
201a648: c2 22 60 10 st %g1, [ %o1 + 0x10 ]
201a64c: 30 bf ff 9d b,a 201a4c0 <killinfo+0x13c>
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid != getpid() )
rtems_set_errno_and_return_minus_one( ESRCH );
201a650: 7f ff d4 d4 call 200f9a0 <__errno>
201a654: b0 10 3f ff mov -1, %i0
201a658: 82 10 20 03 mov 3, %g1
201a65c: c2 22 00 00 st %g1, [ %o0 ]
201a660: 81 c7 e0 08 ret
201a664: 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 );
201a668: 7f ff d4 ce call 200f9a0 <__errno>
201a66c: b0 10 3f ff mov -1, %i0
201a670: 82 10 20 16 mov 0x16, %g1
201a674: c2 22 00 00 st %g1, [ %o0 ]
201a678: 81 c7 e0 08 ret
201a67c: 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();
201a680: 7f ff bb 4a call 20093a8 <_Thread_Enable_dispatch>
201a684: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
201a688: 7f ff d4 c6 call 200f9a0 <__errno>
201a68c: 01 00 00 00 nop
201a690: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
201a694: c2 22 00 00 st %g1, [ %o0 ]
201a698: 81 c7 e0 08 ret
201a69c: 81 e8 00 00 restore
0200b43c <mq_open>:
int oflag,
...
/* mode_t mode, */
/* struct mq_attr attr */
)
{
200b43c: 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++;
200b440: 03 00 80 9d sethi %hi(0x2027400), %g1
200b444: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 2027770 <_Thread_Dispatch_disable_level>
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
200b448: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
200b44c: 84 00 a0 01 inc %g2
200b450: c4 20 63 70 st %g2, [ %g1 + 0x370 ]
return _Thread_Dispatch_disable_level;
200b454: c2 00 63 70 ld [ %g1 + 0x370 ], %g1
200b458: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
200b45c: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
200b460: 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 ) {
200b464: a0 8e 62 00 andcc %i1, 0x200, %l0
200b468: 12 80 00 34 bne 200b538 <mq_open+0xfc>
200b46c: 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 *)
200b470: 39 00 80 9f sethi %hi(0x2027c00), %i4
200b474: 40 00 0c 3d call 200e568 <_Objects_Allocate>
200b478: 90 17 20 3c or %i4, 0x3c, %o0 ! 2027c3c <_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 ) {
200b47c: ba 92 20 00 orcc %o0, 0, %i5
200b480: 02 80 00 37 be 200b55c <mq_open+0x120> <== NEVER TAKEN
200b484: 01 00 00 00 nop
_Thread_Enable_dispatch();
rtems_set_errno_and_return_minus_one( ENFILE );
}
the_mq_fd->oflag = oflag;
200b488: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
status = _POSIX_Message_queue_Name_to_id( name, &the_mq_id );
200b48c: 90 10 00 18 mov %i0, %o0
200b490: 40 00 1e b5 call 2012f64 <_POSIX_Message_queue_Name_to_id>
200b494: 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 ) {
200b498: b6 92 20 00 orcc %o0, 0, %i3
200b49c: 22 80 00 0f be,a 200b4d8 <mq_open+0x9c>
200b4a0: 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) ) ) {
200b4a4: 80 a6 e0 02 cmp %i3, 2
200b4a8: 02 80 00 40 be 200b5a8 <mq_open+0x16c>
200b4ac: 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 );
200b4b0: 90 17 20 3c or %i4, 0x3c, %o0
200b4b4: 40 00 0d 17 call 200e910 <_Objects_Free>
200b4b8: 92 10 00 1d mov %i5, %o1
_POSIX_Message_queue_Free_fd( the_mq_fd );
_Thread_Enable_dispatch();
200b4bc: 40 00 11 60 call 200fa3c <_Thread_Enable_dispatch>
200b4c0: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, mqd_t );
200b4c4: 40 00 2d 58 call 2016a24 <__errno>
200b4c8: 01 00 00 00 nop
200b4cc: f6 22 00 00 st %i3, [ %o0 ]
200b4d0: 81 c7 e0 08 ret
200b4d4: 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) ) {
200b4d8: 80 a6 6a 00 cmp %i1, 0xa00
200b4dc: 02 80 00 28 be 200b57c <mq_open+0x140>
200b4e0: 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 *)
200b4e4: 94 07 bf fc add %fp, -4, %o2
200b4e8: 11 00 80 9e sethi %hi(0x2027800), %o0
200b4ec: 40 00 0d 6a call 200ea94 <_Objects_Get>
200b4f0: 90 12 22 b0 or %o0, 0x2b0, %o0 ! 2027ab0 <_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;
200b4f4: c4 02 20 18 ld [ %o0 + 0x18 ], %g2
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
200b4f8: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
200b4fc: 84 00 a0 01 inc %g2
);
_Thread_Enable_dispatch();
return (mqd_t) the_mq_fd->Object.id;
}
200b500: b8 17 20 3c or %i4, 0x3c, %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;
200b504: c4 22 20 18 st %g2, [ %o0 + 0x18 ]
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200b508: 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 );
200b50c: d0 27 bf f8 st %o0, [ %fp + -8 ]
the_mq->open_count += 1;
the_mq_fd->Queue = the_mq;
200b510: d0 27 60 10 st %o0, [ %i5 + 0x10 ]
200b514: 83 28 60 02 sll %g1, 2, %g1
200b518: fa 20 80 01 st %i5, [ %g2 + %g1 ]
_Objects_Open_string(
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
200b51c: 40 00 11 48 call 200fa3c <_Thread_Enable_dispatch>
200b520: c0 27 60 0c clr [ %i5 + 0xc ]
_Thread_Enable_dispatch();
200b524: 40 00 11 46 call 200fa3c <_Thread_Enable_dispatch>
200b528: 01 00 00 00 nop
return (mqd_t)the_mq_fd->Object.id;
200b52c: f0 07 60 08 ld [ %i5 + 8 ], %i0
200b530: 81 c7 e0 08 ret
200b534: 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 * );
200b538: 82 07 a0 54 add %fp, 0x54, %g1
200b53c: f4 07 a0 50 ld [ %fp + 0x50 ], %i2
200b540: 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 *)
200b544: 39 00 80 9f sethi %hi(0x2027c00), %i4
200b548: 40 00 0c 08 call 200e568 <_Objects_Allocate>
200b54c: 90 17 20 3c or %i4, 0x3c, %o0 ! 2027c3c <_POSIX_Message_queue_Information_fds>
va_end(arg);
}
the_mq_fd = _POSIX_Message_queue_Allocate_fd();
if ( !the_mq_fd ) {
200b550: ba 92 20 00 orcc %o0, 0, %i5
200b554: 32 bf ff ce bne,a 200b48c <mq_open+0x50>
200b558: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_Thread_Enable_dispatch();
200b55c: 40 00 11 38 call 200fa3c <_Thread_Enable_dispatch>
200b560: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( ENFILE );
200b564: 40 00 2d 30 call 2016a24 <__errno>
200b568: 01 00 00 00 nop
200b56c: 82 10 20 17 mov 0x17, %g1 ! 17 <PROM_START+0x17>
200b570: c2 22 00 00 st %g1, [ %o0 ]
200b574: 81 c7 e0 08 ret
200b578: 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 );
200b57c: 90 17 20 3c or %i4, 0x3c, %o0
200b580: 40 00 0c e4 call 200e910 <_Objects_Free>
200b584: 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();
200b588: 40 00 11 2d call 200fa3c <_Thread_Enable_dispatch>
200b58c: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t );
200b590: 40 00 2d 25 call 2016a24 <__errno>
200b594: 01 00 00 00 nop
200b598: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
200b59c: c2 22 00 00 st %g1, [ %o0 ]
200b5a0: 81 c7 e0 08 ret
200b5a4: 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) ) ) {
200b5a8: 02 bf ff c3 be 200b4b4 <mq_open+0x78>
200b5ac: 90 17 20 3c or %i4, 0x3c, %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(
200b5b0: 90 10 00 18 mov %i0, %o0
200b5b4: 92 10 20 01 mov 1, %o1
200b5b8: 94 10 00 1a mov %i2, %o2
200b5bc: 40 00 1e 05 call 2012dd0 <_POSIX_Message_queue_Create_support>
200b5c0: 96 07 bf f8 add %fp, -8, %o3
);
/*
* errno was set by Create_support, so don't set it again.
*/
if ( status == -1 ) {
200b5c4: 80 a2 3f ff cmp %o0, -1
200b5c8: 02 80 00 0d be 200b5fc <mq_open+0x1c0>
200b5cc: c6 07 bf f8 ld [ %fp + -8 ], %g3
Objects_Information *information,
Objects_Control *the_object,
const char *name
)
{
_Objects_Set_local_object(
200b5d0: c2 17 60 0a lduh [ %i5 + 0xa ], %g1
);
_Thread_Enable_dispatch();
return (mqd_t) the_mq_fd->Object.id;
}
200b5d4: b8 17 20 3c or %i4, 0x3c, %i4
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200b5d8: 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;
200b5dc: c6 27 60 10 st %g3, [ %i5 + 0x10 ]
200b5e0: 83 28 60 02 sll %g1, 2, %g1
200b5e4: fa 20 80 01 st %i5, [ %g2 + %g1 ]
&_POSIX_Message_queue_Information_fds,
&the_mq_fd->Object,
NULL
);
_Thread_Enable_dispatch();
200b5e8: 40 00 11 15 call 200fa3c <_Thread_Enable_dispatch>
200b5ec: c0 27 60 0c clr [ %i5 + 0xc ]
return (mqd_t) the_mq_fd->Object.id;
200b5f0: f0 07 60 08 ld [ %i5 + 8 ], %i0
}
200b5f4: 81 c7 e0 08 ret
200b5f8: 81 e8 00 00 restore
200b5fc: 90 17 20 3c or %i4, 0x3c, %o0
200b600: 92 10 00 1d mov %i5, %o1
200b604: 40 00 0c c3 call 200e910 <_Objects_Free>
200b608: 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();
200b60c: 40 00 11 0c call 200fa3c <_Thread_Enable_dispatch>
200b610: 01 00 00 00 nop
return (mqd_t) -1;
200b614: 81 c7 e0 08 ret
200b618: 81 e8 00 00 restore
0200baa4 <pthread_attr_setschedpolicy>:
int pthread_attr_setschedpolicy(
pthread_attr_t *attr,
int policy
)
{
200baa4: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
200baa8: 80 a0 60 00 cmp %g1, 0
200baac: 02 80 00 06 be 200bac4 <pthread_attr_setschedpolicy+0x20>
200bab0: 90 10 20 16 mov 0x16, %o0
200bab4: c4 00 40 00 ld [ %g1 ], %g2
200bab8: 80 a0 a0 00 cmp %g2, 0
200babc: 12 80 00 04 bne 200bacc <pthread_attr_setschedpolicy+0x28>
200bac0: 80 a2 60 04 cmp %o1, 4
return 0;
default:
return ENOTSUP;
}
}
200bac4: 81 c3 e0 08 retl
200bac8: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( policy ) {
200bacc: 18 80 00 09 bgu 200baf0 <pthread_attr_setschedpolicy+0x4c>
200bad0: 84 10 20 01 mov 1, %g2 ! 1 <PROM_START+0x1>
200bad4: 85 28 80 09 sll %g2, %o1, %g2
200bad8: 80 88 a0 17 btst 0x17, %g2
200badc: 02 80 00 05 be 200baf0 <pthread_attr_setschedpolicy+0x4c> <== NEVER TAKEN
200bae0: 01 00 00 00 nop
case SCHED_OTHER:
case SCHED_FIFO:
case SCHED_RR:
case SCHED_SPORADIC:
attr->schedpolicy = policy;
200bae4: d2 20 60 14 st %o1, [ %g1 + 0x14 ]
return 0;
200bae8: 81 c3 e0 08 retl
200baec: 90 10 20 00 clr %o0
default:
return ENOTSUP;
}
}
200baf0: 81 c3 e0 08 retl
200baf4: 90 10 20 86 mov 0x86, %o0
02006888 <pthread_barrier_init>:
int pthread_barrier_init(
pthread_barrier_t *barrier,
const pthread_barrierattr_t *attr,
unsigned int count
)
{
2006888: 9d e3 bf 90 save %sp, -112, %sp
200688c: ba 10 00 18 mov %i0, %i5
const pthread_barrierattr_t *the_attr;
/*
* Error check parameters
*/
if ( !barrier )
2006890: 80 a7 60 00 cmp %i5, 0
2006894: 02 80 00 27 be 2006930 <pthread_barrier_init+0xa8>
2006898: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( count == 0 )
200689c: 80 a6 a0 00 cmp %i2, 0
20068a0: 02 80 00 24 be 2006930 <pthread_barrier_init+0xa8>
20068a4: 80 a6 60 00 cmp %i1, 0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
20068a8: 02 80 00 24 be 2006938 <pthread_barrier_init+0xb0>
20068ac: 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 )
20068b0: c2 06 40 00 ld [ %i1 ], %g1
20068b4: 80 a0 60 00 cmp %g1, 0
20068b8: 02 80 00 1e be 2006930 <pthread_barrier_init+0xa8>
20068bc: b0 10 20 16 mov 0x16, %i0
return EINVAL;
switch ( the_attr->process_shared ) {
20068c0: c2 06 60 04 ld [ %i1 + 4 ], %g1
20068c4: 80 a0 60 00 cmp %g1, 0
20068c8: 12 80 00 1a bne 2006930 <pthread_barrier_init+0xa8> <== NEVER TAKEN
20068cc: 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++;
20068d0: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 2018490 <_Thread_Dispatch_disable_level>
}
/*
* Convert from POSIX attributes to Core Barrier attributes
*/
the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE;
20068d4: c0 27 bf f0 clr [ %fp + -16 ]
20068d8: 84 00 a0 01 inc %g2
the_attributes.maximum_count = count;
20068dc: f4 27 bf f4 st %i2, [ %fp + -12 ]
20068e0: c4 20 60 90 st %g2, [ %g1 + 0x90 ]
return _Thread_Dispatch_disable_level;
20068e4: c2 00 60 90 ld [ %g1 + 0x90 ], %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 *)
20068e8: 37 00 80 62 sethi %hi(0x2018800), %i3
20068ec: 40 00 08 bf call 2008be8 <_Objects_Allocate>
20068f0: 90 16 e0 50 or %i3, 0x50, %o0 ! 2018850 <_POSIX_Barrier_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
20068f4: b8 92 20 00 orcc %o0, 0, %i4
20068f8: 02 80 00 14 be 2006948 <pthread_barrier_init+0xc0>
20068fc: 90 07 20 10 add %i4, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes );
2006900: 40 00 06 06 call 2008118 <_CORE_barrier_Initialize>
2006904: 92 07 bf f0 add %fp, -16, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2006908: 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;
}
200690c: b6 16 e0 50 or %i3, 0x50, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2006910: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2006914: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2006918: 85 28 a0 02 sll %g2, 2, %g2
200691c: 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;
2006920: c0 27 20 0c clr [ %i4 + 0xc ]
);
/*
* Exit the critical section and return the user an operational barrier
*/
*barrier = the_barrier->Object.id;
2006924: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
2006928: 40 00 0d c6 call 200a040 <_Thread_Enable_dispatch>
200692c: b0 10 20 00 clr %i0
return 0;
}
2006930: 81 c7 e0 08 ret
2006934: 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 );
2006938: 7f ff ff 9c call 20067a8 <pthread_barrierattr_init>
200693c: 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 )
2006940: 10 bf ff dd b 20068b4 <pthread_barrier_init+0x2c>
2006944: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_barrier = _POSIX_Barrier_Allocate();
if ( !the_barrier ) {
_Thread_Enable_dispatch();
2006948: 40 00 0d be call 200a040 <_Thread_Enable_dispatch>
200694c: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
2006950: 81 c7 e0 08 ret
2006954: 81 e8 00 00 restore
02006124 <pthread_cleanup_push>:
void pthread_cleanup_push(
void (*routine)( void * ),
void *arg
)
{
2006124: 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 )
2006128: 80 a6 20 00 cmp %i0, 0
200612c: 02 80 00 16 be 2006184 <pthread_cleanup_push+0x60>
2006130: 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++;
2006134: 03 00 80 62 sethi %hi(0x2018800), %g1
2006138: c4 00 61 30 ld [ %g1 + 0x130 ], %g2 ! 2018930 <_Thread_Dispatch_disable_level>
200613c: 84 00 a0 01 inc %g2
2006140: c4 20 61 30 st %g2, [ %g1 + 0x130 ]
return _Thread_Dispatch_disable_level;
2006144: c2 00 61 30 ld [ %g1 + 0x130 ], %g1
return;
_Thread_Disable_dispatch();
handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) );
2006148: 40 00 12 cd call 200ac7c <_Workspace_Allocate>
200614c: 90 10 20 10 mov 0x10, %o0
if ( handler ) {
2006150: 80 a2 20 00 cmp %o0, 0
2006154: 02 80 00 0a be 200617c <pthread_cleanup_push+0x58> <== NEVER TAKEN
2006158: 01 00 00 00 nop
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
200615c: 03 00 80 63 sethi %hi(0x2018c00), %g1
2006160: c2 00 62 74 ld [ %g1 + 0x274 ], %g1 ! 2018e74 <_Per_CPU_Information+0xc>
handler_stack = &thread_support->Cancellation_Handlers;
handler->routine = routine;
handler->arg = arg;
_Chain_Append( handler_stack, &handler->Node );
2006164: 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;
2006168: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
handler->routine = routine;
200616c: f0 22 20 08 st %i0, [ %o0 + 8 ]
handler->arg = arg;
2006170: f2 22 20 0c st %i1, [ %o0 + 0xc ]
_Chain_Append( handler_stack, &handler->Node );
2006174: 40 00 06 38 call 2007a54 <_Chain_Append>
2006178: 90 00 60 e4 add %g1, 0xe4, %o0
}
_Thread_Enable_dispatch();
200617c: 40 00 0d f6 call 2009954 <_Thread_Enable_dispatch>
2006180: 81 e8 00 00 restore
2006184: 81 c7 e0 08 ret
2006188: 81 e8 00 00 restore
02007090 <pthread_cond_init>:
int pthread_cond_init(
pthread_cond_t *cond,
const pthread_condattr_t *attr
)
{
2007090: 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;
2007094: 80 a6 60 00 cmp %i1, 0
2007098: 02 80 00 27 be 2007134 <pthread_cond_init+0xa4>
200709c: 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 )
20070a0: c2 06 60 04 ld [ %i1 + 4 ], %g1
20070a4: 80 a0 60 01 cmp %g1, 1
20070a8: 02 80 00 21 be 200712c <pthread_cond_init+0x9c> <== NEVER TAKEN
20070ac: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( !the_attr->is_initialized )
20070b0: c2 06 40 00 ld [ %i1 ], %g1
20070b4: 80 a0 60 00 cmp %g1, 0
20070b8: 02 80 00 1d be 200712c <pthread_cond_init+0x9c>
20070bc: 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++;
20070c0: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 20195d0 <_Thread_Dispatch_disable_level>
20070c4: 84 00 a0 01 inc %g2
20070c8: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ]
return _Thread_Dispatch_disable_level;
20070cc: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1
*/
RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control
*_POSIX_Condition_variables_Allocate( void )
{
return (POSIX_Condition_variables_Control *)
20070d0: 37 00 80 66 sethi %hi(0x2019800), %i3
20070d4: 40 00 0a 2d call 2009988 <_Objects_Allocate>
20070d8: 90 16 e2 28 or %i3, 0x228, %o0 ! 2019a28 <_POSIX_Condition_variables_Information>
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
20070dc: b8 92 20 00 orcc %o0, 0, %i4
20070e0: 02 80 00 18 be 2007140 <pthread_cond_init+0xb0>
20070e4: 90 07 20 18 add %i4, 0x18, %o0
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
20070e8: c2 06 60 04 ld [ %i1 + 4 ], %g1
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
20070ec: 92 10 20 00 clr %o1
20070f0: 15 04 00 02 sethi %hi(0x10000800), %o2
20070f4: 96 10 20 74 mov 0x74, %o3
if ( !the_cond ) {
_Thread_Enable_dispatch();
return ENOMEM;
}
the_cond->process_shared = the_attr->process_shared;
20070f8: c2 27 20 10 st %g1, [ %i4 + 0x10 ]
the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX;
_Thread_queue_Initialize(
20070fc: 40 00 11 63 call 200b688 <_Thread_queue_Initialize>
2007100: c0 27 20 14 clr [ %i4 + 0x14 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007104: c4 17 20 0a lduh [ %i4 + 0xa ], %g2
*cond = the_cond->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2007108: b6 16 e2 28 or %i3, 0x228, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200710c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007110: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007114: 85 28 a0 02 sll %g2, 2, %g2
2007118: 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;
200711c: c0 27 20 0c clr [ %i4 + 0xc ]
&_POSIX_Condition_variables_Information,
&the_cond->Object,
0
);
*cond = the_cond->Object.id;
2007120: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
2007124: 40 00 0f 2f call 200ade0 <_Thread_Enable_dispatch>
2007128: b0 10 20 00 clr %i0
return 0;
}
200712c: 81 c7 e0 08 ret
2007130: 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;
2007134: 33 00 80 5f sethi %hi(0x2017c00), %i1
2007138: 10 bf ff da b 20070a0 <pthread_cond_init+0x10>
200713c: b2 16 61 94 or %i1, 0x194, %i1 ! 2017d94 <_POSIX_Condition_variables_Default_attributes>
_Thread_Disable_dispatch();
the_cond = _POSIX_Condition_variables_Allocate();
if ( !the_cond ) {
_Thread_Enable_dispatch();
2007140: 40 00 0f 28 call 200ade0 <_Thread_Enable_dispatch>
2007144: b0 10 20 0c mov 0xc, %i0
return ENOMEM;
2007148: 81 c7 e0 08 ret
200714c: 81 e8 00 00 restore
02006ef4 <pthread_condattr_destroy>:
*/
int pthread_condattr_destroy(
pthread_condattr_t *attr
)
{
2006ef4: 82 10 00 08 mov %o0, %g1
if ( !attr || attr->is_initialized == false )
2006ef8: 80 a0 60 00 cmp %g1, 0
2006efc: 02 80 00 06 be 2006f14 <pthread_condattr_destroy+0x20>
2006f00: 90 10 20 16 mov 0x16, %o0
2006f04: c4 00 40 00 ld [ %g1 ], %g2
2006f08: 80 a0 a0 00 cmp %g2, 0
2006f0c: 32 80 00 04 bne,a 2006f1c <pthread_condattr_destroy+0x28><== ALWAYS TAKEN
2006f10: c0 20 40 00 clr [ %g1 ]
return EINVAL;
attr->is_initialized = false;
return 0;
}
2006f14: 81 c3 e0 08 retl
2006f18: 01 00 00 00 nop
2006f1c: 81 c3 e0 08 retl
2006f20: 90 10 20 00 clr %o0 ! 0 <PROM_START>
020065cc <pthread_create>:
pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine)( void * ),
void *arg
)
{
20065cc: 9d e3 bf 58 save %sp, -168, %sp
20065d0: ba 10 00 18 mov %i0, %i5
int schedpolicy = SCHED_RR;
struct sched_param schedparam;
Objects_Name name;
int rc;
if ( !start_routine )
20065d4: 80 a6 a0 00 cmp %i2, 0
20065d8: 02 80 00 63 be 2006764 <pthread_create+0x198>
20065dc: b0 10 20 0e mov 0xe, %i0
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
20065e0: 80 a6 60 00 cmp %i1, 0
20065e4: 22 80 00 62 be,a 200676c <pthread_create+0x1a0>
20065e8: 33 00 80 72 sethi %hi(0x201c800), %i1
if ( !the_attr->is_initialized )
20065ec: c2 06 40 00 ld [ %i1 ], %g1
20065f0: 80 a0 60 00 cmp %g1, 0
20065f4: 02 80 00 5c be 2006764 <pthread_create+0x198>
20065f8: 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) )
20065fc: c2 06 60 04 ld [ %i1 + 4 ], %g1
2006600: 80 a0 60 00 cmp %g1, 0
2006604: 02 80 00 07 be 2006620 <pthread_create+0x54>
2006608: 03 00 80 75 sethi %hi(0x201d400), %g1
200660c: c4 06 60 08 ld [ %i1 + 8 ], %g2
2006610: c2 00 62 f0 ld [ %g1 + 0x2f0 ], %g1
2006614: 80 a0 80 01 cmp %g2, %g1
2006618: 0a 80 00 83 bcs 2006824 <pthread_create+0x258>
200661c: 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 ) {
2006620: c2 06 60 10 ld [ %i1 + 0x10 ], %g1
2006624: 80 a0 60 01 cmp %g1, 1
2006628: 02 80 00 53 be 2006774 <pthread_create+0x1a8>
200662c: 80 a0 60 02 cmp %g1, 2
2006630: 12 80 00 4d bne 2006764 <pthread_create+0x198>
2006634: b0 10 20 16 mov 0x16, %i0
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
schedparam = the_attr->schedparam;
2006638: da 06 60 18 ld [ %i1 + 0x18 ], %o5
200663c: de 06 60 1c ld [ %i1 + 0x1c ], %o7
2006640: f0 06 60 20 ld [ %i1 + 0x20 ], %i0
2006644: c8 06 60 24 ld [ %i1 + 0x24 ], %g4
2006648: c6 06 60 28 ld [ %i1 + 0x28 ], %g3
200664c: c4 06 60 2c ld [ %i1 + 0x2c ], %g2
2006650: c2 06 60 30 ld [ %i1 + 0x30 ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
break;
case PTHREAD_EXPLICIT_SCHED:
schedpolicy = the_attr->schedpolicy;
2006654: f8 06 60 14 ld [ %i1 + 0x14 ], %i4
schedparam = the_attr->schedparam;
2006658: da 27 bf dc st %o5, [ %fp + -36 ]
200665c: de 27 bf e0 st %o7, [ %fp + -32 ]
2006660: f0 27 bf e4 st %i0, [ %fp + -28 ]
2006664: c8 27 bf e8 st %g4, [ %fp + -24 ]
2006668: c6 27 bf ec st %g3, [ %fp + -20 ]
200666c: c4 27 bf f0 st %g2, [ %fp + -16 ]
2006670: 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 )
2006674: c2 06 60 0c ld [ %i1 + 0xc ], %g1
2006678: 80 a0 60 00 cmp %g1, 0
200667c: 12 80 00 3a bne 2006764 <pthread_create+0x198>
2006680: b0 10 20 86 mov 0x86, %i0
return ENOTSUP;
/*
* Interpret the scheduling parameters.
*/
if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) )
2006684: d0 07 bf dc ld [ %fp + -36 ], %o0
2006688: 40 00 1b fa call 200d670 <_POSIX_Priority_Is_valid>
200668c: b0 10 20 16 mov 0x16, %i0
2006690: 80 8a 20 ff btst 0xff, %o0
2006694: 02 80 00 34 be 2006764 <pthread_create+0x198> <== NEVER TAKEN
2006698: 03 00 80 75 sethi %hi(0x201d400), %g1
return EINVAL;
core_priority = _POSIX_Priority_To_core( schedparam.sched_priority );
200669c: 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);
20066a0: e6 08 62 ec ldub [ %g1 + 0x2ec ], %l3
/*
* Set the core scheduling policy information.
*/
rc = _POSIX_Thread_Translate_sched_param(
20066a4: 90 10 00 1c mov %i4, %o0
20066a8: 92 07 bf dc add %fp, -36, %o1
20066ac: 94 07 bf f8 add %fp, -8, %o2
20066b0: 40 00 1b fd call 200d6a4 <_POSIX_Thread_Translate_sched_param>
20066b4: 96 07 bf fc add %fp, -4, %o3
schedpolicy,
&schedparam,
&budget_algorithm,
&budget_callout
);
if ( rc )
20066b8: b0 92 20 00 orcc %o0, 0, %i0
20066bc: 12 80 00 2a bne 2006764 <pthread_create+0x198>
20066c0: 23 00 80 79 sethi %hi(0x201e400), %l1
#endif
/*
* Lock the allocator mutex for protection
*/
_RTEMS_Lock_allocator();
20066c4: d0 04 60 74 ld [ %l1 + 0x74 ], %o0 ! 201e474 <_RTEMS_Allocator_Mutex>
20066c8: 40 00 06 52 call 2008010 <_API_Mutex_Lock>
20066cc: 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 );
20066d0: 40 00 09 1b call 2008b3c <_Objects_Allocate>
20066d4: 90 15 22 10 or %l4, 0x210, %o0 ! 201e610 <_POSIX_Threads_Information>
* Allocate the thread control block.
*
* NOTE: Global threads are not currently supported.
*/
the_thread = _POSIX_Threads_Allocate();
if ( !the_thread ) {
20066d8: a0 92 20 00 orcc %o0, 0, %l0
20066dc: 02 80 00 1f be 2006758 <pthread_create+0x18c>
20066e0: 05 00 80 75 sethi %hi(0x201d400), %g2
/*
* Initialize the core thread for this task.
*/
name.name_p = NULL; /* posix threads don't have a name by default */
status = _Thread_Initialize(
20066e4: 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 )
20066e8: d6 00 a2 f0 ld [ %g2 + 0x2f0 ], %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: 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 )
20066f0: 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(
20066f4: 80 a2 c0 01 cmp %o3, %g1
20066f8: 1a 80 00 03 bcc 2006704 <pthread_create+0x138>
20066fc: d4 06 60 04 ld [ %i1 + 4 ], %o2
2006700: 96 10 00 01 mov %g1, %o3
2006704: c2 07 bf f8 ld [ %fp + -8 ], %g1
2006708: 9a 0c e0 ff and %l3, 0xff, %o5
200670c: c2 23 a0 60 st %g1, [ %sp + 0x60 ]
2006710: 82 10 20 01 mov 1, %g1
2006714: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
2006718: c2 07 bf fc ld [ %fp + -4 ], %g1
200671c: c0 23 a0 68 clr [ %sp + 0x68 ]
2006720: c2 23 a0 64 st %g1, [ %sp + 0x64 ]
2006724: 82 07 bf d4 add %fp, -44, %g1
2006728: 90 15 22 10 or %l4, 0x210, %o0
200672c: c2 23 a0 6c st %g1, [ %sp + 0x6c ]
2006730: 92 10 00 10 mov %l0, %o1
2006734: 98 10 20 01 mov 1, %o4
2006738: 40 00 0e 4f call 200a074 <_Thread_Initialize>
200673c: 9a 23 40 12 sub %o5, %l2, %o5
budget_callout,
0, /* isr level */
name /* posix threads don't have a name */
);
if ( !status ) {
2006740: 80 8a 20 ff btst 0xff, %o0
2006744: 12 80 00 1f bne 20067c0 <pthread_create+0x1f4>
2006748: 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 );
200674c: 92 10 00 10 mov %l0, %o1
2006750: 40 00 09 e5 call 2008ee4 <_Objects_Free>
2006754: 90 12 22 10 or %o0, 0x210, %o0
_POSIX_Threads_Free( the_thread );
_RTEMS_Unlock_allocator();
2006758: d0 04 60 74 ld [ %l1 + 0x74 ], %o0
200675c: 40 00 06 42 call 2008064 <_API_Mutex_Unlock>
2006760: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
2006764: 81 c7 e0 08 ret
2006768: 81 e8 00 00 restore
int rc;
if ( !start_routine )
return EFAULT;
the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes;
200676c: 10 bf ff a0 b 20065ec <pthread_create+0x20>
2006770: b2 16 61 bc or %i1, 0x1bc, %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 ];
2006774: 03 00 80 7a sethi %hi(0x201e800), %g1
2006778: c2 00 61 14 ld [ %g1 + 0x114 ], %g1 ! 201e914 <_Per_CPU_Information+0xc>
200677c: c2 00 61 5c ld [ %g1 + 0x15c ], %g1
schedpolicy = api->schedpolicy;
schedparam = api->schedparam;
2006780: d8 00 60 88 ld [ %g1 + 0x88 ], %o4
2006784: da 00 60 8c ld [ %g1 + 0x8c ], %o5
2006788: de 00 60 90 ld [ %g1 + 0x90 ], %o7
200678c: f0 00 60 94 ld [ %g1 + 0x94 ], %i0
2006790: c8 00 60 98 ld [ %g1 + 0x98 ], %g4
2006794: c6 00 60 9c ld [ %g1 + 0x9c ], %g3
2006798: 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;
200679c: f8 00 60 84 ld [ %g1 + 0x84 ], %i4
schedparam = api->schedparam;
20067a0: d8 27 bf dc st %o4, [ %fp + -36 ]
20067a4: da 27 bf e0 st %o5, [ %fp + -32 ]
20067a8: de 27 bf e4 st %o7, [ %fp + -28 ]
20067ac: f0 27 bf e8 st %i0, [ %fp + -24 ]
20067b0: c8 27 bf ec st %g4, [ %fp + -20 ]
20067b4: c6 27 bf f0 st %g3, [ %fp + -16 ]
break;
20067b8: 10 bf ff af b 2006674 <pthread_create+0xa8>
20067bc: c4 27 bf f4 st %g2, [ %fp + -12 ]
}
/*
* finish initializing the per API structure
*/
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
20067c0: e4 04 21 5c ld [ %l0 + 0x15c ], %l2
api->Attributes = *the_attr;
20067c4: 92 10 00 19 mov %i1, %o1
20067c8: 94 10 20 40 mov 0x40, %o2
20067cc: 40 00 28 e0 call 2010b4c <memcpy>
20067d0: 90 10 00 12 mov %l2, %o0
api->detachstate = the_attr->detachstate;
20067d4: c2 06 60 3c ld [ %i1 + 0x3c ], %g1
api->schedpolicy = schedpolicy;
api->schedparam = schedparam;
20067d8: 92 07 bf dc add %fp, -36, %o1
20067dc: 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;
20067e0: c2 24 a0 40 st %g1, [ %l2 + 0x40 ]
api->schedpolicy = schedpolicy;
20067e4: f8 24 a0 84 st %i4, [ %l2 + 0x84 ]
api->schedparam = schedparam;
20067e8: 40 00 28 d9 call 2010b4c <memcpy>
20067ec: 90 04 a0 88 add %l2, 0x88, %o0
/*
* POSIX threads are allocated and started in one operation.
*/
status = _Thread_Start(
20067f0: 90 10 00 10 mov %l0, %o0
20067f4: 92 10 20 01 mov 1, %o1
20067f8: 94 10 00 1a mov %i2, %o2
20067fc: 96 10 00 1b mov %i3, %o3
2006800: 40 00 10 a1 call 200aa84 <_Thread_Start>
2006804: 98 10 20 00 clr %o4
_RTEMS_Unlock_allocator();
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
2006808: 80 a7 20 04 cmp %i4, 4
200680c: 02 80 00 08 be 200682c <pthread_create+0x260>
2006810: 01 00 00 00 nop
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
2006814: c2 04 20 08 ld [ %l0 + 8 ], %g1
_RTEMS_Unlock_allocator();
2006818: d0 04 60 74 ld [ %l1 + 0x74 ], %o0
200681c: 40 00 06 12 call 2008064 <_API_Mutex_Unlock>
2006820: c2 27 40 00 st %g1, [ %i5 ]
return 0;
2006824: 81 c7 e0 08 ret
2006828: 81 e8 00 00 restore
return EINVAL;
}
#endif
if ( schedpolicy == SCHED_SPORADIC ) {
_Watchdog_Insert_ticks(
200682c: 40 00 10 eb call 200abd8 <_Timespec_To_ticks>
2006830: 90 04 a0 90 add %l2, 0x90, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006834: 92 04 a0 a8 add %l2, 0xa8, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2006838: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
200683c: 11 00 80 79 sethi %hi(0x201e400), %o0
2006840: 40 00 11 d6 call 200af98 <_Watchdog_Insert>
2006844: 90 12 20 8c or %o0, 0x8c, %o0 ! 201e48c <_Watchdog_Ticks_chain>
}
/*
* Return the id and indicate we successfully created the thread
*/
*thread = the_thread->Object.id;
2006848: 10 bf ff f4 b 2006818 <pthread_create+0x24c>
200684c: c2 04 20 08 ld [ %l0 + 8 ], %g1
0201a820 <pthread_kill>:
int pthread_kill(
pthread_t thread,
int sig
)
{
201a820: 9d e3 bf 98 save %sp, -104, %sp
POSIX_API_Control *api;
Thread_Control *the_thread;
Objects_Locations location;
if ( !sig )
201a824: 80 a6 60 00 cmp %i1, 0
201a828: 02 80 00 2d be 201a8dc <pthread_kill+0xbc>
201a82c: b6 06 7f ff add %i1, -1, %i3
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
201a830: 80 a6 e0 1f cmp %i3, 0x1f
201a834: 18 80 00 2a bgu 201a8dc <pthread_kill+0xbc>
201a838: 90 10 00 18 mov %i0, %o0
rtems_set_errno_and_return_minus_one( EINVAL );
the_thread = _Thread_Get( thread, &location );
201a83c: 7f ff ba e7 call 20093d8 <_Thread_Get>
201a840: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
201a844: c2 07 bf fc ld [ %fp + -4 ], %g1
201a848: 80 a0 60 00 cmp %g1, 0
201a84c: 12 80 00 2a bne 201a8f4 <pthread_kill+0xd4> <== NEVER TAKEN
201a850: 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 ) {
201a854: 83 2e 60 02 sll %i1, 2, %g1
201a858: 85 2e 60 04 sll %i1, 4, %g2
201a85c: 84 20 80 01 sub %g2, %g1, %g2
201a860: 03 00 80 77 sethi %hi(0x201dc00), %g1
201a864: 82 10 63 20 or %g1, 0x320, %g1 ! 201df20 <_POSIX_signals_Vectors>
201a868: 82 00 40 02 add %g1, %g2, %g1
201a86c: c4 00 60 08 ld [ %g1 + 8 ], %g2
201a870: 80 a0 a0 01 cmp %g2, 1
201a874: 02 80 00 14 be 201a8c4 <pthread_kill+0xa4>
201a878: c2 02 21 5c ld [ %o0 + 0x15c ], %g1
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201a87c: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2
201a880: b8 10 20 01 mov 1, %i4
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201a884: 92 10 00 19 mov %i1, %o1
201a888: b7 2f 00 1b sll %i4, %i3, %i3
201a88c: 94 10 20 00 clr %o2
return 0;
}
/* XXX critical section */
api->signals_pending |= signo_to_mask( sig );
201a890: b6 10 80 1b or %g2, %i3, %i3
(void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL );
201a894: 7f ff ff 8c call 201a6c4 <_POSIX_signals_Unblock_thread>
201a898: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ]
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
201a89c: 03 00 80 77 sethi %hi(0x201dc00), %g1
201a8a0: 82 10 62 c8 or %g1, 0x2c8, %g1 ! 201dec8 <_Per_CPU_Information>
201a8a4: c4 00 60 08 ld [ %g1 + 8 ], %g2
201a8a8: 80 a0 a0 00 cmp %g2, 0
201a8ac: 02 80 00 06 be 201a8c4 <pthread_kill+0xa4>
201a8b0: 01 00 00 00 nop
201a8b4: c4 00 60 0c ld [ %g1 + 0xc ], %g2
201a8b8: 80 a7 40 02 cmp %i5, %g2
201a8bc: 02 80 00 06 be 201a8d4 <pthread_kill+0xb4>
201a8c0: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
}
_Thread_Enable_dispatch();
201a8c4: 7f ff ba b9 call 20093a8 <_Thread_Enable_dispatch>
201a8c8: b0 10 20 00 clr %i0 ! 0 <PROM_START>
return 0;
201a8cc: 81 c7 e0 08 ret
201a8d0: 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;
201a8d4: f8 28 60 18 stb %i4, [ %g1 + 0x18 ]
201a8d8: 30 bf ff fb b,a 201a8c4 <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 );
201a8dc: 7f ff d4 31 call 200f9a0 <__errno>
201a8e0: b0 10 3f ff mov -1, %i0
201a8e4: 82 10 20 16 mov 0x16, %g1
201a8e8: c2 22 00 00 st %g1, [ %o0 ]
201a8ec: 81 c7 e0 08 ret
201a8f0: 81 e8 00 00 restore
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( ESRCH );
201a8f4: 7f ff d4 2b call 200f9a0 <__errno> <== NOT EXECUTED
201a8f8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED
201a8fc: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED
201a900: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED
}
201a904: 81 c7 e0 08 ret <== NOT EXECUTED
201a908: 81 e8 00 00 restore <== NOT EXECUTED
02008558 <pthread_mutex_timedlock>:
int pthread_mutex_timedlock(
pthread_mutex_t *mutex,
const struct timespec *abstime
)
{
2008558: 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 );
200855c: 90 10 00 19 mov %i1, %o0
2008560: 40 00 00 37 call 200863c <_POSIX_Absolute_timeout_to_ticks>
2008564: 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 );
2008568: 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 );
200856c: ba 10 00 08 mov %o0, %i5
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
2008570: 80 a7 60 03 cmp %i5, 3
2008574: 02 80 00 09 be 2008598 <pthread_mutex_timedlock+0x40>
2008578: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks );
200857c: 7f ff ff be call 2008474 <_POSIX_Mutex_Lock_support>
2008580: 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) ) {
2008584: 80 a2 20 10 cmp %o0, 0x10
2008588: 02 80 00 08 be 20085a8 <pthread_mutex_timedlock+0x50> <== ALWAYS TAKEN
200858c: 80 a7 60 00 cmp %i5, 0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return lock_status;
}
2008590: 81 c7 e0 08 ret
2008594: 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 );
2008598: 7f ff ff b7 call 2008474 <_POSIX_Mutex_Lock_support>
200859c: 92 10 20 01 mov 1, %o1
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
return lock_status;
}
20085a0: 81 c7 e0 08 ret
20085a4: 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 )
20085a8: 32 80 00 04 bne,a 20085b8 <pthread_mutex_timedlock+0x60> <== ALWAYS TAKEN
20085ac: ba 07 7f ff add %i5, -1, %i5
return EINVAL;
20085b0: 10 bf ff f8 b 2008590 <pthread_mutex_timedlock+0x38> <== NOT EXECUTED
20085b4: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
20085b8: 80 a7 60 01 cmp %i5, 1
20085bc: 28 bf ff f5 bleu,a 2008590 <pthread_mutex_timedlock+0x38><== ALWAYS TAKEN
20085c0: 90 10 20 74 mov 0x74, %o0
20085c4: 30 bf ff f3 b,a 2008590 <pthread_mutex_timedlock+0x38> <== NOT EXECUTED
02005e4c <pthread_mutexattr_gettype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_gettype(
const pthread_mutexattr_t *attr,
int *type
)
{
2005e4c: 82 10 00 08 mov %o0, %g1
if ( !attr )
2005e50: 80 a0 60 00 cmp %g1, 0
2005e54: 02 80 00 06 be 2005e6c <pthread_mutexattr_gettype+0x20>
2005e58: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2005e5c: c4 00 40 00 ld [ %g1 ], %g2
2005e60: 80 a0 a0 00 cmp %g2, 0
2005e64: 12 80 00 04 bne 2005e74 <pthread_mutexattr_gettype+0x28>
2005e68: 80 a2 60 00 cmp %o1, 0
if ( !type )
return EINVAL;
*type = attr->type;
return 0;
}
2005e6c: 81 c3 e0 08 retl
2005e70: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
if ( !type )
2005e74: 02 bf ff fe be 2005e6c <pthread_mutexattr_gettype+0x20> <== NEVER TAKEN
2005e78: 01 00 00 00 nop
return EINVAL;
*type = attr->type;
2005e7c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1
return 0;
2005e80: 90 10 20 00 clr %o0
}
2005e84: 81 c3 e0 08 retl
2005e88: c2 22 40 00 st %g1, [ %o1 ]
0200812c <pthread_mutexattr_setpshared>:
int pthread_mutexattr_setpshared(
pthread_mutexattr_t *attr,
int pshared
)
{
200812c: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
2008130: 80 a0 60 00 cmp %g1, 0
2008134: 02 80 00 06 be 200814c <pthread_mutexattr_setpshared+0x20>
2008138: 90 10 20 16 mov 0x16, %o0
200813c: c4 00 40 00 ld [ %g1 ], %g2
2008140: 80 a0 a0 00 cmp %g2, 0
2008144: 12 80 00 04 bne 2008154 <pthread_mutexattr_setpshared+0x28>
2008148: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
200814c: 81 c3 e0 08 retl
2008150: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
2008154: 18 bf ff fe bgu 200814c <pthread_mutexattr_setpshared+0x20><== NEVER TAKEN
2008158: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
200815c: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2008160: 81 c3 e0 08 retl
2008164: 90 10 20 00 clr %o0
02005ee0 <pthread_mutexattr_settype>:
#if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES)
int pthread_mutexattr_settype(
pthread_mutexattr_t *attr,
int type
)
{
2005ee0: 82 10 00 08 mov %o0, %g1
if ( !attr || !attr->is_initialized )
2005ee4: 80 a0 60 00 cmp %g1, 0
2005ee8: 02 80 00 06 be 2005f00 <pthread_mutexattr_settype+0x20>
2005eec: 90 10 20 16 mov 0x16, %o0
2005ef0: c4 00 40 00 ld [ %g1 ], %g2
2005ef4: 80 a0 a0 00 cmp %g2, 0
2005ef8: 12 80 00 04 bne 2005f08 <pthread_mutexattr_settype+0x28> <== ALWAYS TAKEN
2005efc: 80 a2 60 03 cmp %o1, 3
return 0;
default:
return EINVAL;
}
}
2005f00: 81 c3 e0 08 retl
2005f04: 01 00 00 00 nop
)
{
if ( !attr || !attr->is_initialized )
return EINVAL;
switch ( type ) {
2005f08: 18 bf ff fe bgu 2005f00 <pthread_mutexattr_settype+0x20>
2005f0c: 01 00 00 00 nop
case PTHREAD_MUTEX_NORMAL:
case PTHREAD_MUTEX_RECURSIVE:
case PTHREAD_MUTEX_ERRORCHECK:
case PTHREAD_MUTEX_DEFAULT:
attr->type = type;
2005f10: d2 20 60 10 st %o1, [ %g1 + 0x10 ]
return 0;
default:
return EINVAL;
}
}
2005f14: 81 c3 e0 08 retl
2005f18: 90 10 20 00 clr %o0
02006c70 <pthread_once>:
int pthread_once(
pthread_once_t *once_control,
void (*init_routine)(void)
)
{
2006c70: 9d e3 bf 98 save %sp, -104, %sp
if ( !once_control || !init_routine )
2006c74: 80 a6 60 00 cmp %i1, 0
2006c78: 12 80 00 04 bne 2006c88 <pthread_once+0x18>
2006c7c: ba 10 00 18 mov %i0, %i5
(*init_routine)();
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
}
return 0;
}
2006c80: 81 c7 e0 08 ret
2006c84: 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 )
2006c88: 80 a6 20 00 cmp %i0, 0
2006c8c: 22 80 00 13 be,a 2006cd8 <pthread_once+0x68>
2006c90: b0 10 20 16 mov 0x16, %i0
return EINVAL;
if ( !once_control->init_executed ) {
2006c94: c2 06 20 04 ld [ %i0 + 4 ], %g1
2006c98: 80 a0 60 00 cmp %g1, 0
2006c9c: 12 80 00 0f bne 2006cd8 <pthread_once+0x68>
2006ca0: b0 10 20 00 clr %i0
rtems_mode saveMode;
rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode);
2006ca4: 90 10 21 00 mov 0x100, %o0
2006ca8: 92 10 21 00 mov 0x100, %o1
2006cac: 40 00 03 0e call 20078e4 <rtems_task_mode>
2006cb0: 94 07 bf fc add %fp, -4, %o2
if ( !once_control->init_executed ) {
2006cb4: c2 07 60 04 ld [ %i5 + 4 ], %g1
2006cb8: 80 a0 60 00 cmp %g1, 0
2006cbc: 02 80 00 09 be 2006ce0 <pthread_once+0x70> <== ALWAYS TAKEN
2006cc0: 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);
2006cc4: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED
2006cc8: 92 10 21 00 mov 0x100, %o1
2006ccc: 94 07 bf fc add %fp, -4, %o2
2006cd0: 40 00 03 05 call 20078e4 <rtems_task_mode>
2006cd4: b0 10 20 00 clr %i0
2006cd8: 81 c7 e0 08 ret
2006cdc: 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;
2006ce0: c2 27 40 00 st %g1, [ %i5 ]
once_control->init_executed = true;
(*init_routine)();
2006ce4: 9f c6 40 00 call %i1
2006ce8: c2 27 60 04 st %g1, [ %i5 + 4 ]
}
rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode);
2006cec: 10 bf ff f7 b 2006cc8 <pthread_once+0x58>
2006cf0: d0 07 bf fc ld [ %fp + -4 ], %o0
020073e8 <pthread_rwlock_init>:
int pthread_rwlock_init(
pthread_rwlock_t *rwlock,
const pthread_rwlockattr_t *attr
)
{
20073e8: 9d e3 bf 90 save %sp, -112, %sp
20073ec: ba 10 00 18 mov %i0, %i5
const pthread_rwlockattr_t *the_attr;
/*
* Error check parameters
*/
if ( !rwlock )
20073f0: 80 a7 60 00 cmp %i5, 0
20073f4: 02 80 00 24 be 2007484 <pthread_rwlock_init+0x9c>
20073f8: b0 10 20 16 mov 0x16, %i0
return EINVAL;
/*
* If the user passed in NULL, use the default attributes
*/
if ( attr ) {
20073fc: 80 a6 60 00 cmp %i1, 0
2007400: 02 80 00 23 be 200748c <pthread_rwlock_init+0xa4>
2007404: 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 )
2007408: c2 06 40 00 ld [ %i1 ], %g1
200740c: 80 a0 60 00 cmp %g1, 0
2007410: 02 80 00 1d be 2007484 <pthread_rwlock_init+0x9c> <== NEVER TAKEN
2007414: b0 10 20 16 mov 0x16, %i0
return EINVAL;
switch ( the_attr->process_shared ) {
2007418: c2 06 60 04 ld [ %i1 + 4 ], %g1
200741c: 80 a0 60 00 cmp %g1, 0
2007420: 12 80 00 19 bne 2007484 <pthread_rwlock_init+0x9c> <== NEVER TAKEN
2007424: 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++;
2007428: c4 00 61 f0 ld [ %g1 + 0x1f0 ], %g2 ! 201a9f0 <_Thread_Dispatch_disable_level>
*/
RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes(
CORE_RWLock_Attributes *the_attributes
)
{
the_attributes->XXX = 0;
200742c: c0 27 bf fc clr [ %fp + -4 ]
2007430: 84 00 a0 01 inc %g2
2007434: c4 20 61 f0 st %g2, [ %g1 + 0x1f0 ]
return _Thread_Dispatch_disable_level;
2007438: c2 00 61 f0 ld [ %g1 + 0x1f0 ], %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 *)
200743c: 37 00 80 6a sethi %hi(0x201a800), %i3
2007440: 40 00 0a 48 call 2009d60 <_Objects_Allocate>
2007444: 90 16 e3 f0 or %i3, 0x3f0, %o0 ! 201abf0 <_POSIX_RWLock_Information>
*/
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
2007448: b8 92 20 00 orcc %o0, 0, %i4
200744c: 02 80 00 14 be 200749c <pthread_rwlock_init+0xb4>
2007450: 90 07 20 10 add %i4, 0x10, %o0
_Thread_Enable_dispatch();
return EAGAIN;
}
_CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes );
2007454: 40 00 07 d8 call 20093b4 <_CORE_RWLock_Initialize>
2007458: 92 07 bf fc add %fp, -4, %o1
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
200745c: c4 17 20 0a lduh [ %i4 + 0xa ], %g2
*rwlock = the_rwlock->Object.id;
_Thread_Enable_dispatch();
return 0;
}
2007460: b6 16 e3 f0 or %i3, 0x3f0, %i3
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2007464: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2007468: c2 07 20 08 ld [ %i4 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
200746c: 85 28 a0 02 sll %g2, 2, %g2
2007470: 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;
2007474: c0 27 20 0c clr [ %i4 + 0xc ]
&_POSIX_RWLock_Information,
&the_rwlock->Object,
0
);
*rwlock = the_rwlock->Object.id;
2007478: c2 27 40 00 st %g1, [ %i5 ]
_Thread_Enable_dispatch();
200747c: 40 00 0f 4f call 200b1b8 <_Thread_Enable_dispatch>
2007480: b0 10 20 00 clr %i0
return 0;
}
2007484: 81 c7 e0 08 ret
2007488: 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 );
200748c: 40 00 02 6c call 2007e3c <pthread_rwlockattr_init>
2007490: 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 )
2007494: 10 bf ff de b 200740c <pthread_rwlock_init+0x24>
2007498: c2 06 40 00 ld [ %i1 ], %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_rwlock = _POSIX_RWLock_Allocate();
if ( !the_rwlock ) {
_Thread_Enable_dispatch();
200749c: 40 00 0f 47 call 200b1b8 <_Thread_Enable_dispatch>
20074a0: b0 10 20 0b mov 0xb, %i0
return EAGAIN;
20074a4: 81 c7 e0 08 ret
20074a8: 81 e8 00 00 restore
0200751c <pthread_rwlock_timedrdlock>:
int pthread_rwlock_timedrdlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
200751c: 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 )
2007520: 80 a6 20 00 cmp %i0, 0
2007524: 02 80 00 24 be 20075b4 <pthread_rwlock_timedrdlock+0x98>
2007528: 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 );
200752c: 92 07 bf fc add %fp, -4, %o1
2007530: 40 00 1c 99 call 200e794 <_POSIX_Absolute_timeout_to_ticks>
2007534: 90 10 00 19 mov %i1, %o0
2007538: d2 06 00 00 ld [ %i0 ], %o1
200753c: b8 10 00 08 mov %o0, %i4
2007540: 94 07 bf f8 add %fp, -8, %o2
2007544: 11 00 80 6a sethi %hi(0x201a800), %o0
2007548: 40 00 0b 51 call 200a28c <_Objects_Get>
200754c: 90 12 23 f0 or %o0, 0x3f0, %o0 ! 201abf0 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2007550: c2 07 bf f8 ld [ %fp + -8 ], %g1
2007554: 80 a0 60 00 cmp %g1, 0
2007558: 12 80 00 17 bne 20075b4 <pthread_rwlock_timedrdlock+0x98>
200755c: d6 07 bf fc ld [ %fp + -4 ], %o3
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_reading(
2007560: 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,
2007564: 82 1f 20 03 xor %i4, 3, %g1
2007568: 90 02 20 10 add %o0, 0x10, %o0
200756c: 80 a0 00 01 cmp %g0, %g1
2007570: 98 10 20 00 clr %o4
2007574: b6 60 3f ff subx %g0, -1, %i3
2007578: 40 00 07 99 call 20093dc <_CORE_RWLock_Obtain_for_reading>
200757c: 94 10 00 1b mov %i3, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2007580: 40 00 0f 0e call 200b1b8 <_Thread_Enable_dispatch>
2007584: 01 00 00 00 nop
if ( !do_wait ) {
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
2007588: 03 00 80 6b sethi %hi(0x201ac00), %g1
200758c: c2 00 63 34 ld [ %g1 + 0x334 ], %g1 ! 201af34 <_Per_CPU_Information+0xc>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait ) {
2007590: 80 a6 e0 00 cmp %i3, 0
2007594: 12 80 00 05 bne 20075a8 <pthread_rwlock_timedrdlock+0x8c>
2007598: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) {
200759c: 80 a2 20 02 cmp %o0, 2
20075a0: 02 80 00 07 be 20075bc <pthread_rwlock_timedrdlock+0xa0>
20075a4: 80 a7 20 00 cmp %i4, 0
status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW )
return ETIMEDOUT;
}
}
return _POSIX_RWLock_Translate_core_RWLock_return_code(
20075a8: 40 00 00 39 call 200768c <_POSIX_RWLock_Translate_core_RWLock_return_code>
20075ac: 01 00 00 00 nop
20075b0: ba 10 00 08 mov %o0, %i5
case OBJECTS_ERROR:
break;
}
return EINVAL;
}
20075b4: 81 c7 e0 08 ret
20075b8: 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 )
20075bc: 02 bf ff fe be 20075b4 <pthread_rwlock_timedrdlock+0x98> <== NEVER TAKEN
20075c0: b8 07 3f ff add %i4, -1, %i4
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
20075c4: 80 a7 20 01 cmp %i4, 1
20075c8: 18 bf ff f8 bgu 20075a8 <pthread_rwlock_timedrdlock+0x8c> <== NEVER TAKEN
20075cc: ba 10 20 74 mov 0x74, %i5
20075d0: 30 bf ff f9 b,a 20075b4 <pthread_rwlock_timedrdlock+0x98>
020075d4 <pthread_rwlock_timedwrlock>:
int pthread_rwlock_timedwrlock(
pthread_rwlock_t *rwlock,
const struct timespec *abstime
)
{
20075d4: 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 )
20075d8: 80 a6 20 00 cmp %i0, 0
20075dc: 02 80 00 24 be 200766c <pthread_rwlock_timedwrlock+0x98>
20075e0: 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 );
20075e4: 92 07 bf fc add %fp, -4, %o1
20075e8: 40 00 1c 6b call 200e794 <_POSIX_Absolute_timeout_to_ticks>
20075ec: 90 10 00 19 mov %i1, %o0
20075f0: d2 06 00 00 ld [ %i0 ], %o1
20075f4: b8 10 00 08 mov %o0, %i4
20075f8: 94 07 bf f8 add %fp, -8, %o2
20075fc: 11 00 80 6a sethi %hi(0x201a800), %o0
2007600: 40 00 0b 23 call 200a28c <_Objects_Get>
2007604: 90 12 23 f0 or %o0, 0x3f0, %o0 ! 201abf0 <_POSIX_RWLock_Information>
if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE )
do_wait = false;
the_rwlock = _POSIX_RWLock_Get( rwlock, &location );
switch ( location ) {
2007608: c2 07 bf f8 ld [ %fp + -8 ], %g1
200760c: 80 a0 60 00 cmp %g1, 0
2007610: 12 80 00 17 bne 200766c <pthread_rwlock_timedwrlock+0x98>
2007614: d6 07 bf fc ld [ %fp + -4 ], %o3
case OBJECTS_LOCAL:
_CORE_RWLock_Obtain_for_writing(
2007618: 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,
200761c: 82 1f 20 03 xor %i4, 3, %g1
2007620: 90 02 20 10 add %o0, 0x10, %o0
2007624: 80 a0 00 01 cmp %g0, %g1
2007628: 98 10 20 00 clr %o4
200762c: b6 60 3f ff subx %g0, -1, %i3
2007630: 40 00 07 a1 call 20094b4 <_CORE_RWLock_Obtain_for_writing>
2007634: 94 10 00 1b mov %i3, %o2
do_wait,
ticks,
NULL
);
_Thread_Enable_dispatch();
2007638: 40 00 0e e0 call 200b1b8 <_Thread_Enable_dispatch>
200763c: 01 00 00 00 nop
if ( !do_wait &&
(_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) {
2007640: 03 00 80 6b sethi %hi(0x201ac00), %g1
2007644: c2 00 63 34 ld [ %g1 + 0x334 ], %g1 ! 201af34 <_Per_CPU_Information+0xc>
ticks,
NULL
);
_Thread_Enable_dispatch();
if ( !do_wait &&
2007648: 80 a6 e0 00 cmp %i3, 0
200764c: 12 80 00 05 bne 2007660 <pthread_rwlock_timedwrlock+0x8c>
2007650: d0 00 60 34 ld [ %g1 + 0x34 ], %o0
2007654: 80 a2 20 02 cmp %o0, 2
2007658: 02 80 00 07 be 2007674 <pthread_rwlock_timedwrlock+0xa0>
200765c: 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(
2007660: 40 00 00 0b call 200768c <_POSIX_RWLock_Translate_core_RWLock_return_code>
2007664: 01 00 00 00 nop
2007668: ba 10 00 08 mov %o0, %i5
case OBJECTS_ERROR:
break;
}
return EINVAL;
}
200766c: 81 c7 e0 08 ret
2007670: 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 )
2007674: 02 bf ff fe be 200766c <pthread_rwlock_timedwrlock+0x98> <== NEVER TAKEN
2007678: b8 07 3f ff add %i4, -1, %i4
return EINVAL;
if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST ||
200767c: 80 a7 20 01 cmp %i4, 1
2007680: 18 bf ff f8 bgu 2007660 <pthread_rwlock_timedwrlock+0x8c> <== NEVER TAKEN
2007684: ba 10 20 74 mov 0x74, %i5
2007688: 30 bf ff f9 b,a 200766c <pthread_rwlock_timedwrlock+0x98>
02007e64 <pthread_rwlockattr_setpshared>:
int pthread_rwlockattr_setpshared(
pthread_rwlockattr_t *attr,
int pshared
)
{
2007e64: 82 10 00 08 mov %o0, %g1
if ( !attr )
2007e68: 80 a0 60 00 cmp %g1, 0
2007e6c: 02 80 00 06 be 2007e84 <pthread_rwlockattr_setpshared+0x20>
2007e70: 90 10 20 16 mov 0x16, %o0
return EINVAL;
if ( !attr->is_initialized )
2007e74: c4 00 40 00 ld [ %g1 ], %g2
2007e78: 80 a0 a0 00 cmp %g2, 0
2007e7c: 12 80 00 04 bne 2007e8c <pthread_rwlockattr_setpshared+0x28>
2007e80: 80 a2 60 01 cmp %o1, 1
return 0;
default:
return EINVAL;
}
}
2007e84: 81 c3 e0 08 retl
2007e88: 01 00 00 00 nop
return EINVAL;
if ( !attr->is_initialized )
return EINVAL;
switch ( pshared ) {
2007e8c: 18 bf ff fe bgu 2007e84 <pthread_rwlockattr_setpshared+0x20><== NEVER TAKEN
2007e90: 01 00 00 00 nop
case PTHREAD_PROCESS_SHARED:
case PTHREAD_PROCESS_PRIVATE:
attr->process_shared = pshared;
2007e94: d2 20 60 04 st %o1, [ %g1 + 4 ]
return 0;
default:
return EINVAL;
}
}
2007e98: 81 c3 e0 08 retl
2007e9c: 90 10 20 00 clr %o0
02008e30 <pthread_setschedparam>:
int pthread_setschedparam(
pthread_t thread,
int policy,
struct sched_param *param
)
{
2008e30: 9d e3 bf 90 save %sp, -112, %sp
2008e34: ba 10 00 18 mov %i0, %i5
int rc;
/*
* Check all the parameters
*/
if ( !param )
2008e38: 80 a6 a0 00 cmp %i2, 0
2008e3c: 02 80 00 38 be 2008f1c <pthread_setschedparam+0xec>
2008e40: b0 10 20 16 mov 0x16, %i0
return EINVAL;
rc = _POSIX_Thread_Translate_sched_param(
2008e44: 90 10 00 19 mov %i1, %o0
2008e48: 92 10 00 1a mov %i2, %o1
2008e4c: 94 07 bf f4 add %fp, -12, %o2
2008e50: 40 00 1a 5e call 200f7c8 <_POSIX_Thread_Translate_sched_param>
2008e54: 96 07 bf f8 add %fp, -8, %o3
policy,
param,
&budget_algorithm,
&budget_callout
);
if ( rc )
2008e58: b0 92 20 00 orcc %o0, 0, %i0
2008e5c: 12 80 00 30 bne 2008f1c <pthread_setschedparam+0xec>
2008e60: 90 10 00 1d mov %i5, %o0
return rc;
/*
* Actually change the scheduling policy and parameters
*/
the_thread = _Thread_Get( thread, &location );
2008e64: 40 00 0c 71 call 200c028 <_Thread_Get>
2008e68: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
2008e6c: c2 07 bf fc ld [ %fp + -4 ], %g1
2008e70: 80 a0 60 00 cmp %g1, 0
2008e74: 12 80 00 2c bne 2008f24 <pthread_setschedparam+0xf4>
2008e78: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_POSIX ];
2008e7c: fa 02 21 5c ld [ %o0 + 0x15c ], %i5
if ( api->schedpolicy == SCHED_SPORADIC )
2008e80: c2 07 60 84 ld [ %i5 + 0x84 ], %g1
2008e84: 80 a0 60 04 cmp %g1, 4
2008e88: 02 80 00 33 be 2008f54 <pthread_setschedparam+0x124>
2008e8c: 01 00 00 00 nop
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
2008e90: f2 27 60 84 st %i1, [ %i5 + 0x84 ]
api->schedparam = *param;
2008e94: c2 06 80 00 ld [ %i2 ], %g1
the_thread->budget_algorithm = budget_algorithm;
the_thread->budget_callout = budget_callout;
switch ( api->schedpolicy ) {
2008e98: 80 a6 60 00 cmp %i1, 0
if ( api->schedpolicy == SCHED_SPORADIC )
(void) _Watchdog_Remove( &api->Sporadic_timer );
api->schedpolicy = policy;
api->schedparam = *param;
2008e9c: c2 27 60 88 st %g1, [ %i5 + 0x88 ]
2008ea0: c4 06 a0 04 ld [ %i2 + 4 ], %g2
2008ea4: c4 27 60 8c st %g2, [ %i5 + 0x8c ]
2008ea8: c4 06 a0 08 ld [ %i2 + 8 ], %g2
2008eac: c4 27 60 90 st %g2, [ %i5 + 0x90 ]
2008eb0: c4 06 a0 0c ld [ %i2 + 0xc ], %g2
2008eb4: c4 27 60 94 st %g2, [ %i5 + 0x94 ]
2008eb8: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2
2008ebc: c4 27 60 98 st %g2, [ %i5 + 0x98 ]
2008ec0: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2
2008ec4: c4 27 60 9c st %g2, [ %i5 + 0x9c ]
2008ec8: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2
2008ecc: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ]
the_thread->budget_algorithm = budget_algorithm;
2008ed0: c4 07 bf f4 ld [ %fp + -12 ], %g2
2008ed4: c4 27 20 7c st %g2, [ %i4 + 0x7c ]
the_thread->budget_callout = budget_callout;
2008ed8: c4 07 bf f8 ld [ %fp + -8 ], %g2
switch ( api->schedpolicy ) {
2008edc: 06 80 00 0e bl 2008f14 <pthread_setschedparam+0xe4> <== NEVER TAKEN
2008ee0: c4 27 20 80 st %g2, [ %i4 + 0x80 ]
2008ee4: 80 a6 60 02 cmp %i1, 2
2008ee8: 04 80 00 11 ble 2008f2c <pthread_setschedparam+0xfc>
2008eec: 07 00 80 6d sethi %hi(0x201b400), %g3
2008ef0: 80 a6 60 04 cmp %i1, 4
2008ef4: 12 80 00 08 bne 2008f14 <pthread_setschedparam+0xe4> <== NEVER TAKEN
2008ef8: 01 00 00 00 nop
true
);
break;
case SCHED_SPORADIC:
api->ss_high_priority = api->schedparam.sched_priority;
2008efc: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ]
_Watchdog_Remove( &api->Sporadic_timer );
2008f00: 40 00 10 de call 200d278 <_Watchdog_Remove>
2008f04: 90 07 60 a8 add %i5, 0xa8, %o0
_POSIX_Threads_Sporadic_budget_TSR( 0, the_thread );
2008f08: 90 10 20 00 clr %o0
2008f0c: 7f ff ff 7e call 2008d04 <_POSIX_Threads_Sporadic_budget_TSR>
2008f10: 92 10 00 1c mov %i4, %o1
break;
}
_Thread_Enable_dispatch();
2008f14: 40 00 0c 39 call 200bff8 <_Thread_Enable_dispatch>
2008f18: 01 00 00 00 nop
return 0;
2008f1c: 81 c7 e0 08 ret
2008f20: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return ESRCH;
}
2008f24: 81 c7 e0 08 ret
2008f28: 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;
2008f2c: 05 00 80 70 sethi %hi(0x201c000), %g2
2008f30: d2 08 e0 2c ldub [ %g3 + 0x2c ], %o1
2008f34: c4 00 a0 e4 ld [ %g2 + 0xe4 ], %g2
2008f38: 92 22 40 01 sub %o1, %g1, %o1
2008f3c: c4 27 20 78 st %g2, [ %i4 + 0x78 ]
the_thread->real_priority =
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
2008f40: 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 =
2008f44: d2 27 20 18 st %o1, [ %i4 + 0x18 ]
_POSIX_Priority_To_core( api->schedparam.sched_priority );
_Thread_Change_priority(
2008f48: 40 00 0a ef call 200bb04 <_Thread_Change_priority>
2008f4c: 94 10 20 01 mov 1, %o2
the_thread,
the_thread->real_priority,
true
);
break;
2008f50: 30 bf ff f1 b,a 2008f14 <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 );
2008f54: 40 00 10 c9 call 200d278 <_Watchdog_Remove>
2008f58: 90 07 60 a8 add %i5, 0xa8, %o0
api->schedpolicy = policy;
2008f5c: 10 bf ff ce b 2008e94 <pthread_setschedparam+0x64>
2008f60: f2 27 60 84 st %i1, [ %i5 + 0x84 ]
0200692c <pthread_testcancel>:
*
* 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183
*/
void pthread_testcancel( void )
{
200692c: 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() )
2006930: 3b 00 80 63 sethi %hi(0x2018c00), %i5
2006934: ba 17 62 68 or %i5, 0x268, %i5 ! 2018e68 <_Per_CPU_Information>
2006938: c2 07 60 08 ld [ %i5 + 8 ], %g1
200693c: 80 a0 60 00 cmp %g1, 0
2006940: 12 80 00 16 bne 2006998 <pthread_testcancel+0x6c> <== NEVER TAKEN
2006944: 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++;
2006948: 03 00 80 62 sethi %hi(0x2018800), %g1
return;
thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ];
200694c: c4 07 60 0c ld [ %i5 + 0xc ], %g2
2006950: c6 00 61 30 ld [ %g1 + 0x130 ], %g3
2006954: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2
2006958: 86 00 e0 01 inc %g3
200695c: c6 20 61 30 st %g3, [ %g1 + 0x130 ]
return _Thread_Dispatch_disable_level;
2006960: c2 00 61 30 ld [ %g1 + 0x130 ], %g1
_Thread_Disable_dispatch();
if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE &&
2006964: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1
2006968: 80 a0 60 00 cmp %g1, 0
200696c: 12 80 00 0d bne 20069a0 <pthread_testcancel+0x74> <== NEVER TAKEN
2006970: 01 00 00 00 nop
2006974: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1
2006978: 80 a0 60 00 cmp %g1, 0
200697c: 02 80 00 09 be 20069a0 <pthread_testcancel+0x74>
2006980: 01 00 00 00 nop
thread_support->cancelation_requested )
cancel = true;
_Thread_Enable_dispatch();
2006984: 40 00 0b f4 call 2009954 <_Thread_Enable_dispatch>
2006988: b2 10 3f ff mov -1, %i1 ! ffffffff <RAM_END+0xfdbfffff>
if ( cancel )
_POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED );
200698c: f0 07 60 0c ld [ %i5 + 0xc ], %i0
2006990: 40 00 1a 26 call 200d228 <_POSIX_Thread_Exit>
2006994: 81 e8 00 00 restore
2006998: 81 c7 e0 08 ret <== NOT EXECUTED
200699c: 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();
20069a0: 40 00 0b ed call 2009954 <_Thread_Enable_dispatch>
20069a4: 81 e8 00 00 restore
02007550 <rtems_aio_enqueue>:
* errno - otherwise
*/
int
rtems_aio_enqueue (rtems_aio_request *req)
{
2007550: 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);
2007554: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2007558: 40 00 02 75 call 2007f2c <pthread_mutex_lock>
200755c: 90 17 60 2c or %i5, 0x2c, %o0 ! 2019c2c <aio_request_queue>
if (result != 0) {
2007560: b8 92 20 00 orcc %o0, 0, %i4
2007564: 12 80 00 31 bne 2007628 <rtems_aio_enqueue+0xd8> <== NEVER TAKEN
2007568: 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);
200756c: 40 00 04 a5 call 2008800 <pthread_self>
2007570: b6 17 60 2c or %i5, 0x2c, %i3
2007574: 92 07 bf fc add %fp, -4, %o1
2007578: 40 00 03 93 call 20083c4 <pthread_getschedparam>
200757c: 94 07 bf dc add %fp, -36, %o2
req->caller_thread = pthread_self ();
2007580: 40 00 04 a0 call 2008800 <pthread_self>
2007584: 01 00 00 00 nop
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
2007588: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
req->policy = policy;
200758c: 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;
2007590: c4 00 60 18 ld [ %g1 + 0x18 ], %g2
req->policy = policy;
2007594: 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;
2007598: 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 ();
200759c: d0 26 20 10 st %o0, [ %i0 + 0x10 ]
req->priority = param.sched_priority - req->aiocbp->aio_reqprio;
20075a0: 84 20 c0 02 sub %g3, %g2, %g2
20075a4: 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) &&
20075a8: 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;
20075ac: 86 10 20 77 mov 0x77, %g3
req->aiocbp->return_value = 0;
20075b0: 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;
20075b4: c6 20 60 34 st %g3, [ %g1 + 0x34 ]
req->aiocbp->return_value = 0;
if ((aio_request_queue.idle_threads == 0) &&
20075b8: 80 a0 a0 00 cmp %g2, 0
20075bc: 12 80 00 06 bne 20075d4 <rtems_aio_enqueue+0x84> <== NEVER TAKEN
20075c0: d2 00 40 00 ld [ %g1 ], %o1
20075c4: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2
20075c8: 80 a0 a0 04 cmp %g2, 4
20075cc: 24 80 00 1b ble,a 2007638 <rtems_aio_enqueue+0xe8>
20075d0: 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,
20075d4: 94 10 20 00 clr %o2
20075d8: 11 00 80 67 sethi %hi(0x2019c00), %o0
20075dc: 7f ff fe a0 call 200705c <rtems_aio_search_fd>
20075e0: 90 12 20 74 or %o0, 0x74, %o0 ! 2019c74 <aio_request_queue+0x48>
req->aiocbp->aio_fildes, 0);
if (r_chain != NULL)
20075e4: b4 92 20 00 orcc %o0, 0, %i2
20075e8: 22 80 00 31 be,a 20076ac <rtems_aio_enqueue+0x15c>
20075ec: c2 06 20 14 ld [ %i0 + 0x14 ], %g1
{
pthread_mutex_lock (&r_chain->mutex);
20075f0: b6 06 a0 1c add %i2, 0x1c, %i3
20075f4: 40 00 02 4e call 2007f2c <pthread_mutex_lock>
20075f8: 90 10 00 1b mov %i3, %o0
rtems_aio_insert_prio (&r_chain->perfd, req);
20075fc: 90 06 a0 08 add %i2, 8, %o0
2007600: 7f ff ff 89 call 2007424 <rtems_aio_insert_prio>
2007604: 92 10 00 18 mov %i0, %o1
pthread_cond_signal (&r_chain->cond);
2007608: 40 00 01 25 call 2007a9c <pthread_cond_signal>
200760c: 90 06 a0 20 add %i2, 0x20, %o0
pthread_mutex_unlock (&r_chain->mutex);
2007610: 40 00 02 67 call 2007fac <pthread_mutex_unlock>
2007614: 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);
2007618: 40 00 02 65 call 2007fac <pthread_mutex_unlock>
200761c: 90 17 60 2c or %i5, 0x2c, %o0
return 0;
}
2007620: 81 c7 e0 08 ret
2007624: 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);
2007628: 7f ff f0 25 call 20036bc <free> <== NOT EXECUTED
200762c: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED
}
}
pthread_mutex_unlock (&aio_request_queue.mutex);
return 0;
}
2007630: 81 c7 e0 08 ret <== NOT EXECUTED
2007634: 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);
2007638: 7f ff fe 89 call 200705c <rtems_aio_search_fd>
200763c: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
2007640: c2 02 20 18 ld [ %o0 + 0x18 ], %g1
2007644: 80 a0 60 01 cmp %g1, 1
2007648: 12 bf ff ea bne 20075f0 <rtems_aio_enqueue+0xa0>
200764c: 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);
2007650: 90 02 20 08 add %o0, 8, %o0
2007654: 40 00 09 0d call 2009a88 <_Chain_Insert>
2007658: 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);
200765c: 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;
2007660: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
2007664: 40 00 01 da call 2007dcc <pthread_mutex_init>
2007668: 90 06 a0 1c add %i2, 0x1c, %o0
pthread_cond_init (&r_chain->cond, NULL);
200766c: 92 10 20 00 clr %o1
2007670: 40 00 00 db call 20079dc <pthread_cond_init>
2007674: 90 06 a0 20 add %i2, 0x20, %o0
AIO_printf ("New thread \n");
result = pthread_create (&thid, &aio_request_queue.attr,
2007678: 90 07 bf f8 add %fp, -8, %o0
200767c: 92 06 e0 08 add %i3, 8, %o1
2007680: 96 10 00 1a mov %i2, %o3
2007684: 15 00 80 1c sethi %hi(0x2007000), %o2
2007688: 40 00 02 ae call 2008140 <pthread_create>
200768c: 94 12 a1 b8 or %o2, 0x1b8, %o2 ! 20071b8 <rtems_aio_handle>
rtems_aio_handle, (void *) r_chain);
if (result != 0) {
2007690: 82 92 20 00 orcc %o0, 0, %g1
2007694: 12 80 00 25 bne 2007728 <rtems_aio_enqueue+0x1d8> <== NEVER TAKEN
2007698: 90 10 00 1b mov %i3, %o0
pthread_mutex_unlock (&aio_request_queue.mutex);
return result;
}
++aio_request_queue.active_threads;
200769c: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1
20076a0: 82 00 60 01 inc %g1
20076a4: 10 bf ff dd b 2007618 <rtems_aio_enqueue+0xc8>
20076a8: 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);
20076ac: 11 00 80 67 sethi %hi(0x2019c00), %o0
20076b0: d2 00 40 00 ld [ %g1 ], %o1
20076b4: 90 12 20 80 or %o0, 0x80, %o0
20076b8: 7f ff fe 69 call 200705c <rtems_aio_search_fd>
20076bc: 94 10 20 01 mov 1, %o2
if (r_chain->new_fd == 1) {
20076c0: 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);
20076c4: b4 10 00 08 mov %o0, %i2
20076c8: 92 10 00 18 mov %i0, %o1
if (r_chain->new_fd == 1) {
20076cc: 80 a0 60 01 cmp %g1, 1
20076d0: 02 80 00 0b be 20076fc <rtems_aio_enqueue+0x1ac>
20076d4: 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);
20076d8: 7f ff ff 53 call 2007424 <rtems_aio_insert_prio>
20076dc: 01 00 00 00 nop
if (aio_request_queue.idle_threads > 0)
20076e0: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1
20076e4: 80 a0 60 00 cmp %g1, 0
20076e8: 04 bf ff cc ble 2007618 <rtems_aio_enqueue+0xc8> <== ALWAYS TAKEN
20076ec: 01 00 00 00 nop
pthread_cond_signal (&aio_request_queue.new_req);
20076f0: 40 00 00 eb call 2007a9c <pthread_cond_signal> <== NOT EXECUTED
20076f4: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED
20076f8: 30 bf ff c8 b,a 2007618 <rtems_aio_enqueue+0xc8> <== NOT EXECUTED
20076fc: 40 00 08 e3 call 2009a88 <_Chain_Insert>
2007700: 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);
2007704: 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;
2007708: c0 26 a0 18 clr [ %i2 + 0x18 ]
pthread_mutex_init (&r_chain->mutex, NULL);
200770c: 40 00 01 b0 call 2007dcc <pthread_mutex_init>
2007710: 92 10 20 00 clr %o1
pthread_cond_init (&r_chain->cond, NULL);
2007714: 90 06 a0 20 add %i2, 0x20, %o0
2007718: 40 00 00 b1 call 20079dc <pthread_cond_init>
200771c: 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)
2007720: 10 bf ff f1 b 20076e4 <rtems_aio_enqueue+0x194>
2007724: 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);
2007728: 40 00 02 21 call 2007fac <pthread_mutex_unlock> <== NOT EXECUTED
200772c: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED
return result;
2007730: 30 bf ff bc b,a 2007620 <rtems_aio_enqueue+0xd0> <== NOT EXECUTED
020071b8 <rtems_aio_handle>:
* NULL - if error
*/
static void *
rtems_aio_handle (void *arg)
{
20071b8: 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);
20071bc: 37 00 80 67 sethi %hi(0x2019c00), %i3
20071c0: b8 06 20 1c add %i0, 0x1c, %i4
20071c4: b6 16 e0 2c or %i3, 0x2c, %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,
20071c8: 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)) {
20071cc: 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,
20071d0: 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);
20071d4: 40 00 03 56 call 2007f2c <pthread_mutex_lock>
20071d8: 90 10 00 1c mov %i4, %o0
if (result != 0)
20071dc: 80 a2 20 00 cmp %o0, 0
20071e0: 12 80 00 2b bne 200728c <rtems_aio_handle+0xd4> <== NEVER TAKEN
20071e4: 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;
20071e8: 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 );
20071ec: 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)) {
20071f0: 80 a7 40 01 cmp %i5, %g1
20071f4: 02 80 00 41 be 20072f8 <rtems_aio_handle+0x140>
20071f8: 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);
20071fc: 40 00 05 81 call 2008800 <pthread_self>
2007200: 01 00 00 00 nop
2007204: 92 07 bf fc add %fp, -4, %o1
2007208: 40 00 04 6f call 20083c4 <pthread_getschedparam>
200720c: 94 07 bf d8 add %fp, -40, %o2
param.sched_priority = req->priority;
2007210: c2 07 60 0c ld [ %i5 + 0xc ], %g1
pthread_setschedparam (pthread_self(), req->policy, ¶m);
2007214: 40 00 05 7b call 2008800 <pthread_self>
2007218: c2 27 bf d8 st %g1, [ %fp + -40 ]
200721c: d2 07 60 08 ld [ %i5 + 8 ], %o1
2007220: 40 00 05 7c call 2008810 <pthread_setschedparam>
2007224: 94 07 bf d8 add %fp, -40, %o2
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
2007228: 40 00 0a 00 call 2009a28 <_Chain_Extract>
200722c: 90 10 00 1d mov %i5, %o0
rtems_chain_extract (node);
pthread_mutex_unlock (&r_chain->mutex);
2007230: 40 00 03 5f call 2007fac <pthread_mutex_unlock>
2007234: 90 10 00 1c mov %i4, %o0
switch (req->aiocbp->aio_lio_opcode) {
2007238: e2 07 60 14 ld [ %i5 + 0x14 ], %l1
200723c: c2 04 60 30 ld [ %l1 + 0x30 ], %g1
2007240: 80 a0 60 02 cmp %g1, 2
2007244: 22 80 00 25 be,a 20072d8 <rtems_aio_handle+0x120>
2007248: c4 1c 60 08 ldd [ %l1 + 8 ], %g2
200724c: 80 a0 60 03 cmp %g1, 3
2007250: 02 80 00 1e be 20072c8 <rtems_aio_handle+0x110> <== NEVER TAKEN
2007254: 01 00 00 00 nop
2007258: 80 a0 60 01 cmp %g1, 1
200725c: 22 80 00 0e be,a 2007294 <rtems_aio_handle+0xdc> <== ALWAYS TAKEN
2007260: c4 1c 60 08 ldd [ %l1 + 8 ], %g2
default:
result = -1;
}
if (result == -1) {
req->aiocbp->return_value = -1;
2007264: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED
req->aiocbp->error_code = errno;
2007268: 40 00 2b 8e call 20120a0 <__errno> <== NOT EXECUTED
200726c: c2 24 60 38 st %g1, [ %l1 + 0x38 ] <== NOT EXECUTED
2007270: 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);
2007274: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED
2007278: 40 00 03 2d call 2007f2c <pthread_mutex_lock> <== NOT EXECUTED
200727c: c2 24 60 34 st %g1, [ %l1 + 0x34 ] <== NOT EXECUTED
if (result != 0)
2007280: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
2007284: 22 bf ff da be,a 20071ec <rtems_aio_handle+0x34> <== NOT EXECUTED
2007288: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
200728c: 81 c7 e0 08 ret
2007290: 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,
2007294: d0 04 40 00 ld [ %l1 ], %o0
2007298: d2 04 60 10 ld [ %l1 + 0x10 ], %o1
200729c: d4 04 60 14 ld [ %l1 + 0x14 ], %o2
20072a0: 96 10 00 02 mov %g2, %o3
20072a4: 40 00 2e a2 call 2012d2c <pread>
20072a8: 98 10 00 03 mov %g3, %o4
break;
default:
result = -1;
}
if (result == -1) {
20072ac: 80 a2 3f ff cmp %o0, -1
20072b0: 22 bf ff ed be,a 2007264 <rtems_aio_handle+0xac> <== NEVER TAKEN
20072b4: 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;
20072b8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
20072bc: d0 20 60 38 st %o0, [ %g1 + 0x38 ]
req->aiocbp->error_code = 0;
20072c0: 10 bf ff c5 b 20071d4 <rtems_aio_handle+0x1c>
20072c4: 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);
20072c8: 40 00 1d a5 call 200e95c <fsync> <== NOT EXECUTED
20072cc: d0 04 40 00 ld [ %l1 ], %o0 <== NOT EXECUTED
break;
20072d0: 10 bf ff f8 b 20072b0 <rtems_aio_handle+0xf8> <== NOT EXECUTED
20072d4: 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,
20072d8: d0 04 40 00 ld [ %l1 ], %o0
20072dc: d2 04 60 10 ld [ %l1 + 0x10 ], %o1
20072e0: d4 04 60 14 ld [ %l1 + 0x14 ], %o2
20072e4: 96 10 00 02 mov %g2, %o3
20072e8: 40 00 2e cf call 2012e24 <pwrite>
20072ec: 98 10 00 03 mov %g3, %o4
(void *) req->aiocbp->aio_buf,
req->aiocbp->aio_nbytes, req->aiocbp->aio_offset);
break;
20072f0: 10 bf ff f0 b 20072b0 <rtems_aio_handle+0xf8>
20072f4: 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);
20072f8: 40 00 03 2d call 2007fac <pthread_mutex_unlock>
20072fc: 90 10 00 1c mov %i4, %o0
pthread_mutex_lock (&aio_request_queue.mutex);
2007300: 40 00 03 0b call 2007f2c <pthread_mutex_lock>
2007304: 90 10 00 1b mov %i3, %o0
if (rtems_chain_is_empty (chain))
2007308: c2 06 20 08 ld [ %i0 + 8 ], %g1
200730c: 80 a7 40 01 cmp %i5, %g1
2007310: 02 80 00 05 be 2007324 <rtems_aio_handle+0x16c> <== ALWAYS TAKEN
2007314: 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);
2007318: 40 00 03 25 call 2007fac <pthread_mutex_unlock>
200731c: 90 10 00 1b mov %i3, %o0
2007320: 30 bf ff ad b,a 20071d4 <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);
2007324: 40 00 01 50 call 2007864 <clock_gettime>
2007328: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
200732c: c2 07 bf f4 ld [ %fp + -12 ], %g1
timeout.tv_nsec = 0;
2007330: 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;
2007334: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007338: 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;
200733c: c2 27 bf f4 st %g1, [ %fp + -12 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&r_chain->cond,
2007340: 90 10 00 1d mov %i5, %o0
2007344: 92 10 00 1a mov %i2, %o1
2007348: 40 00 01 f4 call 2007b18 <pthread_cond_timedwait>
200734c: 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) {
2007350: 80 a2 20 74 cmp %o0, 0x74
2007354: 12 bf ff f1 bne 2007318 <rtems_aio_handle+0x160> <== NEVER TAKEN
2007358: 01 00 00 00 nop
200735c: 40 00 09 b3 call 2009a28 <_Chain_Extract>
2007360: 90 10 00 18 mov %i0, %o0
rtems_chain_extract (&r_chain->next_fd);
pthread_mutex_destroy (&r_chain->mutex);
2007364: 40 00 02 47 call 2007c80 <pthread_mutex_destroy>
2007368: 90 10 00 1c mov %i4, %o0
pthread_cond_destroy (&r_chain->cond);
200736c: 40 00 01 66 call 2007904 <pthread_cond_destroy>
2007370: 90 10 00 1d mov %i5, %o0
free (r_chain);
2007374: 7f ff f0 d2 call 20036bc <free>
2007378: 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;
200737c: 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)) {
2007380: 80 a6 00 19 cmp %i0, %i1
2007384: 22 80 00 0e be,a 20073bc <rtems_aio_handle+0x204>
2007388: 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;
200738c: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2
++aio_request_queue.active_threads;
2007390: 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;
2007394: 84 00 bf ff add %g2, -1, %g2
++aio_request_queue.active_threads;
2007398: 82 00 60 01 inc %g1
200739c: 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;
20073a0: c4 26 a0 68 st %g2, [ %i2 + 0x68 ]
20073a4: 40 00 09 a1 call 2009a28 <_Chain_Extract>
20073a8: c2 26 a0 64 st %g1, [ %i2 + 0x64 ]
20073ac: 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);
20073b0: 7f ff ff 64 call 2007140 <rtems_aio_move_to_work>
20073b4: 90 10 00 18 mov %i0, %o0
20073b8: 30 bf ff d8 b,a 2007318 <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;
20073bc: 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;
20073c0: 84 00 a0 01 inc %g2
--aio_request_queue.active_threads;
20073c4: 82 00 7f ff add %g1, -1, %g1
clock_gettime (CLOCK_REALTIME, &timeout);
20073c8: 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;
20073cc: c4 26 e0 68 st %g2, [ %i3 + 0x68 ]
--aio_request_queue.active_threads;
20073d0: c2 26 e0 64 st %g1, [ %i3 + 0x64 ]
clock_gettime (CLOCK_REALTIME, &timeout);
20073d4: 40 00 01 24 call 2007864 <clock_gettime>
20073d8: 90 10 20 01 mov 1, %o0
timeout.tv_sec += 3;
20073dc: c2 07 bf f4 ld [ %fp + -12 ], %g1
timeout.tv_nsec = 0;
20073e0: 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;
20073e4: 82 00 60 03 add %g1, 3, %g1
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
20073e8: 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;
20073ec: c2 27 bf f4 st %g1, [ %fp + -12 ]
timeout.tv_nsec = 0;
result = pthread_cond_timedwait (&aio_request_queue.new_req,
20073f0: 92 10 00 1b mov %i3, %o1
20073f4: 40 00 01 c9 call 2007b18 <pthread_cond_timedwait>
20073f8: 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) {
20073fc: 80 a2 20 74 cmp %o0, 0x74
2007400: 22 80 00 04 be,a 2007410 <rtems_aio_handle+0x258> <== ALWAYS TAKEN
2007404: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1
2007408: 10 bf ff e1 b 200738c <rtems_aio_handle+0x1d4> <== NOT EXECUTED
200740c: 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);
2007410: 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;
2007414: 82 00 7f ff add %g1, -1, %g1
pthread_mutex_unlock (&aio_request_queue.mutex);
2007418: 40 00 02 e5 call 2007fac <pthread_mutex_unlock>
200741c: c2 26 e0 68 st %g1, [ %i3 + 0x68 ]
return NULL;
2007420: 30 bf ff 9b b,a 200728c <rtems_aio_handle+0xd4>
02006f54 <rtems_aio_init>:
* 0 - if initialization succeeded
*/
int
rtems_aio_init (void)
{
2006f54: 9d e3 bf a0 save %sp, -96, %sp
int result = 0;
result = pthread_attr_init (&aio_request_queue.attr);
2006f58: 3b 00 80 67 sethi %hi(0x2019c00), %i5
2006f5c: 40 00 04 5e call 20080d4 <pthread_attr_init>
2006f60: 90 17 60 34 or %i5, 0x34, %o0 ! 2019c34 <aio_request_queue+0x8>
if (result != 0)
2006f64: b0 92 20 00 orcc %o0, 0, %i0
2006f68: 12 80 00 23 bne 2006ff4 <rtems_aio_init+0xa0> <== NEVER TAKEN
2006f6c: 90 17 60 34 or %i5, 0x34, %o0
return result;
result =
2006f70: 40 00 04 65 call 2008104 <pthread_attr_setdetachstate>
2006f74: 92 10 20 00 clr %o1
pthread_attr_setdetachstate (&aio_request_queue.attr,
PTHREAD_CREATE_DETACHED);
if (result != 0)
2006f78: 80 a2 20 00 cmp %o0, 0
2006f7c: 12 80 00 20 bne 2006ffc <rtems_aio_init+0xa8> <== NEVER TAKEN
2006f80: 39 00 80 67 sethi %hi(0x2019c00), %i4
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
2006f84: 92 10 20 00 clr %o1
2006f88: 40 00 03 91 call 2007dcc <pthread_mutex_init>
2006f8c: 90 17 20 2c or %i4, 0x2c, %o0
if (result != 0)
2006f90: 80 a2 20 00 cmp %o0, 0
2006f94: 12 80 00 23 bne 2007020 <rtems_aio_init+0xcc> <== NEVER TAKEN
2006f98: 92 10 20 00 clr %o1
pthread_attr_destroy (&aio_request_queue.attr);
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
2006f9c: 11 00 80 67 sethi %hi(0x2019c00), %o0
2006fa0: 40 00 02 8f call 20079dc <pthread_cond_init>
2006fa4: 90 12 20 30 or %o0, 0x30, %o0 ! 2019c30 <aio_request_queue+0x4>
if (result != 0) {
2006fa8: b0 92 20 00 orcc %o0, 0, %i0
2006fac: 12 80 00 26 bne 2007044 <rtems_aio_init+0xf0> <== NEVER TAKEN
2006fb0: 01 00 00 00 nop
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2006fb4: b8 17 20 2c or %i4, 0x2c, %i4
head->previous = NULL;
tail->previous = head;
2006fb8: 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;
2006fbc: 88 07 20 4c add %i4, 0x4c, %g4
head->previous = NULL;
tail->previous = head;
2006fc0: 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;
2006fc4: 84 07 20 58 add %i4, 0x58, %g2
head->previous = NULL;
tail->previous = head;
2006fc8: 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;
2006fcc: c8 27 20 48 st %g4, [ %i4 + 0x48 ]
head->previous = NULL;
2006fd0: c0 27 20 4c clr [ %i4 + 0x4c ]
tail->previous = head;
2006fd4: 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;
2006fd8: c4 27 20 54 st %g2, [ %i4 + 0x54 ]
head->previous = NULL;
2006fdc: 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;
2006fe0: c0 27 20 64 clr [ %i4 + 0x64 ]
aio_request_queue.idle_threads = 0;
2006fe4: c0 27 20 68 clr [ %i4 + 0x68 ]
aio_request_queue.initialized = AIO_QUEUE_INITIALIZED;
2006fe8: 03 00 00 2c sethi %hi(0xb000), %g1
2006fec: 82 10 60 0b or %g1, 0xb, %g1 ! b00b <PROM_START+0xb00b>
2006ff0: c2 27 20 60 st %g1, [ %i4 + 0x60 ]
return result;
}
2006ff4: 81 c7 e0 08 ret
2006ff8: 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);
2006ffc: 40 00 04 2a call 20080a4 <pthread_attr_destroy> <== NOT EXECUTED
2007000: 90 17 60 34 or %i5, 0x34, %o0 <== NOT EXECUTED
result = pthread_mutex_init (&aio_request_queue.mutex, NULL);
2007004: 39 00 80 67 sethi %hi(0x2019c00), %i4 <== NOT EXECUTED
2007008: 92 10 20 00 clr %o1 <== NOT EXECUTED
200700c: 40 00 03 70 call 2007dcc <pthread_mutex_init> <== NOT EXECUTED
2007010: 90 17 20 2c or %i4, 0x2c, %o0 <== NOT EXECUTED
if (result != 0)
2007014: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED
2007018: 02 bf ff e1 be 2006f9c <rtems_aio_init+0x48> <== NOT EXECUTED
200701c: 92 10 20 00 clr %o1 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
2007020: 40 00 04 21 call 20080a4 <pthread_attr_destroy> <== NOT EXECUTED
2007024: 90 17 60 34 or %i5, 0x34, %o0 <== NOT EXECUTED
result = pthread_cond_init (&aio_request_queue.new_req, NULL);
2007028: 92 10 20 00 clr %o1 <== NOT EXECUTED
200702c: 11 00 80 67 sethi %hi(0x2019c00), %o0 <== NOT EXECUTED
2007030: 40 00 02 6b call 20079dc <pthread_cond_init> <== NOT EXECUTED
2007034: 90 12 20 30 or %o0, 0x30, %o0 ! 2019c30 <aio_request_queue+0x4><== NOT EXECUTED
if (result != 0) {
2007038: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED
200703c: 22 bf ff df be,a 2006fb8 <rtems_aio_init+0x64> <== NOT EXECUTED
2007040: b8 17 20 2c or %i4, 0x2c, %i4 <== NOT EXECUTED
pthread_mutex_destroy (&aio_request_queue.mutex);
2007044: 40 00 03 0f call 2007c80 <pthread_mutex_destroy> <== NOT EXECUTED
2007048: 90 17 20 2c or %i4, 0x2c, %o0 <== NOT EXECUTED
pthread_attr_destroy (&aio_request_queue.attr);
200704c: 40 00 04 16 call 20080a4 <pthread_attr_destroy> <== NOT EXECUTED
2007050: 90 17 60 34 or %i5, 0x34, %o0 <== NOT EXECUTED
)
{
Chain_Node *head = _Chain_Head( the_chain );
Chain_Node *tail = _Chain_Tail( the_chain );
head->next = tail;
2007054: 10 bf ff d9 b 2006fb8 <rtems_aio_init+0x64> <== NOT EXECUTED
2007058: b8 17 20 2c or %i4, 0x2c, %i4 <== NOT EXECUTED
02007424 <rtems_aio_insert_prio>:
* NONE
*/
void
rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req)
{
2007424: 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;
2007428: 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 );
200742c: 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)) {
2007430: 80 a0 40 02 cmp %g1, %g2
2007434: 02 80 00 15 be 2007488 <rtems_aio_insert_prio+0x64> <== NEVER TAKEN
2007438: 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 &&
200743c: 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;
2007440: c8 00 60 14 ld [ %g1 + 0x14 ], %g4
while (req->aiocbp->aio_reqprio > prio &&
2007444: de 03 e0 18 ld [ %o7 + 0x18 ], %o7
2007448: c8 01 20 18 ld [ %g4 + 0x18 ], %g4
200744c: 80 a1 00 0f cmp %g4, %o7
2007450: 26 80 00 07 bl,a 200746c <rtems_aio_insert_prio+0x48> <== NEVER TAKEN
2007454: 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 );
2007458: 10 80 00 0b b 2007484 <rtems_aio_insert_prio+0x60>
200745c: f0 00 60 04 ld [ %g1 + 4 ], %i0
2007460: 22 80 00 09 be,a 2007484 <rtems_aio_insert_prio+0x60> <== NOT EXECUTED
2007464: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
2007468: 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;
200746c: 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 &&
2007470: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED
2007474: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED
2007478: 06 bf ff fa bl 2007460 <rtems_aio_insert_prio+0x3c> <== NOT EXECUTED
200747c: 80 a0 40 02 cmp %g1, %g2 <== NOT EXECUTED
2007480: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED
2007484: b2 10 00 03 mov %g3, %i1
2007488: 40 00 09 80 call 2009a88 <_Chain_Insert>
200748c: 81 e8 00 00 restore
02007140 <rtems_aio_move_to_work>:
* NONE
*/
void
rtems_aio_move_to_work (rtems_aio_request_chain *r_chain)
{
2007140: 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;
2007144: 05 00 80 67 sethi %hi(0x2019c00), %g2
2007148: 84 10 a0 2c or %g2, 0x2c, %g2 ! 2019c2c <aio_request_queue>
200714c: 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 &&
2007150: de 06 20 14 ld [ %i0 + 0x14 ], %o7
2007154: c8 00 60 14 ld [ %g1 + 0x14 ], %g4
* NONE
*/
void
rtems_aio_move_to_work (rtems_aio_request_chain *r_chain)
{
2007158: 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 &&
200715c: 80 a1 00 0f cmp %g4, %o7
2007160: 16 80 00 10 bge 20071a0 <rtems_aio_move_to_work+0x60> <== NEVER TAKEN
2007164: 86 10 00 01 mov %g1, %g3
2007168: 84 00 a0 4c add %g2, 0x4c, %g2
200716c: 80 a0 40 02 cmp %g1, %g2
2007170: 32 80 00 08 bne,a 2007190 <rtems_aio_move_to_work+0x50> <== ALWAYS TAKEN
2007174: c6 00 40 00 ld [ %g1 ], %g3
2007178: 10 80 00 0b b 20071a4 <rtems_aio_move_to_work+0x64> <== NOT EXECUTED
200717c: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED
2007180: 80 a0 c0 02 cmp %g3, %g2
2007184: 02 80 00 0a be 20071ac <rtems_aio_move_to_work+0x6c> <== NEVER TAKEN
2007188: 86 10 00 02 mov %g2, %g3
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
200718c: 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 &&
2007190: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4
2007194: 80 a1 00 0f cmp %g4, %o7
2007198: 06 bf ff fa bl 2007180 <rtems_aio_move_to_work+0x40>
200719c: 82 10 00 03 mov %g3, %g1
20071a0: f0 00 e0 04 ld [ %g3 + 4 ], %i0
20071a4: 40 00 0a 39 call 2009a88 <_Chain_Insert>
20071a8: 81 e8 00 00 restore
20071ac: f0 00 e0 04 ld [ %g3 + 4 ], %i0 <== NOT EXECUTED
20071b0: 40 00 0a 36 call 2009a88 <_Chain_Insert> <== NOT EXECUTED
20071b4: 81 e8 00 00 restore <== NOT EXECUTED
02007490 <rtems_aio_remove_fd>:
* Output parameters:
* NONE
*/
void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain)
{
2007490: 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;
2007494: 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;
2007498: 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));
200749c: 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))
20074a0: 80 a7 40 18 cmp %i5, %i0
20074a4: 02 80 00 0d be 20074d8 <rtems_aio_remove_fd+0x48> <== NEVER TAKEN
20074a8: b6 10 3f ff mov -1, %i3
*/
RTEMS_INLINE_ROUTINE void rtems_chain_extract(
rtems_chain_node *the_node
)
{
_Chain_Extract( the_node );
20074ac: 40 00 09 5f call 2009a28 <_Chain_Extract>
20074b0: 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;
20074b4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
}
}
AIO_printf ("Thread finished\n");
return NULL;
}
20074b8: 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);
20074bc: 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;
20074c0: f4 20 60 34 st %i2, [ %g1 + 0x34 ]
req->aiocbp->return_value = -1;
free (req);
20074c4: 7f ff f0 7e call 20036bc <free>
20074c8: 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))
20074cc: 80 a7 00 18 cmp %i4, %i0
20074d0: 12 bf ff f7 bne 20074ac <rtems_aio_remove_fd+0x1c>
20074d4: ba 10 00 1c mov %i4, %i5
20074d8: 81 c7 e0 08 ret
20074dc: 81 e8 00 00 restore
020074e0 <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)
{
20074e0: 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;
20074e4: 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 );
20074e8: 82 06 20 04 add %i0, 4, %g1
if (rtems_chain_is_empty (chain))
20074ec: 80 a7 40 01 cmp %i5, %g1
20074f0: 12 80 00 06 bne 2007508 <rtems_aio_remove_req+0x28>
20074f4: b0 10 20 02 mov 2, %i0
20074f8: 30 80 00 14 b,a 2007548 <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) {
20074fc: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED
2007500: 02 80 00 10 be 2007540 <rtems_aio_remove_req+0x60> <== NOT EXECUTED
2007504: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED
2007508: c4 07 60 14 ld [ %i5 + 0x14 ], %g2
200750c: 80 a0 80 19 cmp %g2, %i1
2007510: 32 bf ff fb bne,a 20074fc <rtems_aio_remove_req+0x1c> <== NEVER TAKEN
2007514: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED
2007518: 40 00 09 44 call 2009a28 <_Chain_Extract>
200751c: 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;
2007520: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2007524: 84 10 20 8c mov 0x8c, %g2
2007528: c4 20 60 34 st %g2, [ %g1 + 0x34 ]
current->aiocbp->return_value = -1;
200752c: 84 10 3f ff mov -1, %g2
free (current);
2007530: 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;
2007534: c4 20 60 38 st %g2, [ %g1 + 0x38 ]
free (current);
2007538: 7f ff f0 61 call 20036bc <free>
200753c: b0 10 20 00 clr %i0
}
return AIO_CANCELED;
2007540: 81 c7 e0 08 ret
2007544: 81 e8 00 00 restore
}
2007548: 81 c7 e0 08 ret
200754c: 81 e8 00 00 restore
0200718c <rtems_chain_get_with_wait>:
rtems_chain_control *chain,
rtems_event_set events,
rtems_interval timeout,
rtems_chain_node **node_ptr
)
{
200718c: 9d e3 bf 98 save %sp, -104, %sp
2007190: 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 );
2007194: 40 00 01 9c call 2007804 <_Chain_Get>
2007198: 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(
200719c: 92 10 20 00 clr %o1
20071a0: b8 10 00 08 mov %o0, %i4
20071a4: 94 10 00 1a mov %i2, %o2
20071a8: 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
20071ac: 80 a7 20 00 cmp %i4, 0
20071b0: 12 80 00 0a bne 20071d8 <rtems_chain_get_with_wait+0x4c>
20071b4: 96 07 bf fc add %fp, -4, %o3
) {
rtems_event_set out;
sc = rtems_event_receive(
20071b8: 7f ff fc f4 call 2006588 <rtems_event_receive>
20071bc: 01 00 00 00 nop
)
{
rtems_status_code sc = RTEMS_SUCCESSFUL;
rtems_chain_node *node = NULL;
while (
20071c0: 80 a2 20 00 cmp %o0, 0
20071c4: 02 bf ff f4 be 2007194 <rtems_chain_get_with_wait+0x8> <== NEVER TAKEN
20071c8: b0 10 00 08 mov %o0, %i0
timeout,
&out
);
}
*node_ptr = node;
20071cc: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
20071d0: 81 c7 e0 08 ret
20071d4: 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
20071d8: 90 10 20 00 clr %o0
timeout,
&out
);
}
*node_ptr = node;
20071dc: f8 26 c0 00 st %i4, [ %i3 ]
return sc;
}
20071e0: 81 c7 e0 08 ret
20071e4: 91 e8 00 08 restore %g0, %o0, %o0
02007e08 <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
)
{
2007e08: 9d e3 bf a0 save %sp, -96, %sp
rtems_device_major_number major_limit = _IO_Number_of_drivers;
if ( rtems_interrupt_is_in_progress() )
2007e0c: 03 00 80 6c sethi %hi(0x201b000), %g1
2007e10: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 201b2c0 <_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
)
{
2007e14: 86 10 00 19 mov %i1, %g3
rtems_device_major_number major_limit = _IO_Number_of_drivers;
2007e18: 03 00 80 6d sethi %hi(0x201b400), %g1
if ( rtems_interrupt_is_in_progress() )
return RTEMS_CALLED_FROM_ISR;
2007e1c: 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() )
2007e20: 80 a0 a0 00 cmp %g2, 0
2007e24: 02 80 00 04 be 2007e34 <rtems_io_register_driver+0x2c>
2007e28: de 00 62 f4 ld [ %g1 + 0x2f4 ], %o7
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007e2c: 81 c7 e0 08 ret
2007e30: 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 )
2007e34: 80 a6 a0 00 cmp %i2, 0
2007e38: 02 80 00 40 be 2007f38 <rtems_io_register_driver+0x130>
2007e3c: 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 )
2007e40: 02 80 00 3e be 2007f38 <rtems_io_register_driver+0x130>
2007e44: 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;
2007e48: c4 06 40 00 ld [ %i1 ], %g2
2007e4c: 80 a0 a0 00 cmp %g2, 0
2007e50: 22 80 00 37 be,a 2007f2c <rtems_io_register_driver+0x124>
2007e54: 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 )
2007e58: 80 a3 c0 18 cmp %o7, %i0
2007e5c: 08 bf ff f4 bleu 2007e2c <rtems_io_register_driver+0x24>
2007e60: 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++;
2007e64: 05 00 80 6b sethi %hi(0x201ac00), %g2
2007e68: c8 00 a1 80 ld [ %g2 + 0x180 ], %g4 ! 201ad80 <_Thread_Dispatch_disable_level>
2007e6c: 88 01 20 01 inc %g4
2007e70: c8 20 a1 80 st %g4, [ %g2 + 0x180 ]
return _Thread_Dispatch_disable_level;
2007e74: c4 00 a1 80 ld [ %g2 + 0x180 ], %g2
return RTEMS_INVALID_NUMBER;
_Thread_Disable_dispatch();
if ( major == 0 ) {
2007e78: 80 a6 20 00 cmp %i0, 0
2007e7c: 12 80 00 32 bne 2007f44 <rtems_io_register_driver+0x13c>
2007e80: 1f 00 80 6d sethi %hi(0x201b400), %o7
static rtems_status_code rtems_io_obtain_major_number(
rtems_device_major_number *major
)
{
rtems_device_major_number n = _IO_Number_of_drivers;
2007e84: c8 00 62 f4 ld [ %g1 + 0x2f4 ], %g4
rtems_device_major_number m = 0;
/* major is error checked by caller */
for ( m = 0; m < n; ++m ) {
2007e88: 80 a1 20 00 cmp %g4, 0
2007e8c: 02 80 00 45 be 2007fa0 <rtems_io_register_driver+0x198> <== NEVER TAKEN
2007e90: c2 03 e2 f8 ld [ %o7 + 0x2f8 ], %g1
static inline bool rtems_io_is_empty_table(
const rtems_driver_address_table *table
)
{
return table->initialization_entry == NULL && table->open_entry == NULL;
2007e94: 10 80 00 06 b 2007eac <rtems_io_register_driver+0xa4>
2007e98: 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 ) {
2007e9c: 80 a6 00 04 cmp %i0, %g4
2007ea0: 02 80 00 35 be 2007f74 <rtems_io_register_driver+0x16c>
2007ea4: 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;
2007ea8: c4 00 40 00 ld [ %g1 ], %g2
2007eac: 80 a0 a0 00 cmp %g2, 0
2007eb0: 32 bf ff fb bne,a 2007e9c <rtems_io_register_driver+0x94>
2007eb4: b0 06 20 01 inc %i0
2007eb8: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007ebc: 80 a0 a0 00 cmp %g2, 0
2007ec0: 32 bf ff f7 bne,a 2007e9c <rtems_io_register_driver+0x94>
2007ec4: b0 06 20 01 inc %i0
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007ec8: f0 26 80 00 st %i0, [ %i2 ]
2007ecc: 83 2e 20 03 sll %i0, 3, %g1
if ( m != n )
2007ed0: 80 a1 00 18 cmp %g4, %i0
2007ed4: 02 80 00 29 be 2007f78 <rtems_io_register_driver+0x170> <== NEVER TAKEN
2007ed8: 9b 2e 20 05 sll %i0, 5, %o5
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007edc: c8 00 c0 00 ld [ %g3 ], %g4
2007ee0: c4 03 e2 f8 ld [ %o7 + 0x2f8 ], %g2
2007ee4: 82 23 40 01 sub %o5, %g1, %g1
2007ee8: c8 20 80 01 st %g4, [ %g2 + %g1 ]
2007eec: c8 00 e0 04 ld [ %g3 + 4 ], %g4
2007ef0: 82 00 80 01 add %g2, %g1, %g1
2007ef4: c8 20 60 04 st %g4, [ %g1 + 4 ]
2007ef8: c4 00 e0 08 ld [ %g3 + 8 ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007efc: b2 10 20 00 clr %i1
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007f00: c4 20 60 08 st %g2, [ %g1 + 8 ]
2007f04: c4 00 e0 0c ld [ %g3 + 0xc ], %g2
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
2007f08: b4 10 20 00 clr %i2
}
*registered_major = major;
}
_IO_Driver_address_table [major] = *driver_table;
2007f0c: c4 20 60 0c st %g2, [ %g1 + 0xc ]
2007f10: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2
2007f14: c4 20 60 10 st %g2, [ %g1 + 0x10 ]
2007f18: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2
_Thread_Enable_dispatch();
2007f1c: 40 00 08 42 call 200a024 <_Thread_Enable_dispatch>
2007f20: c4 20 60 14 st %g2, [ %g1 + 0x14 ]
return rtems_io_initialize( major, 0, NULL );
2007f24: 40 00 23 96 call 2010d7c <rtems_io_initialize>
2007f28: 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;
2007f2c: 80 a0 a0 00 cmp %g2, 0
2007f30: 12 bf ff cb bne 2007e5c <rtems_io_register_driver+0x54>
2007f34: 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;
2007f38: 88 10 20 09 mov 9, %g4
_IO_Driver_address_table [major] = *driver_table;
_Thread_Enable_dispatch();
return rtems_io_initialize( major, 0, NULL );
}
2007f3c: 81 c7 e0 08 ret
2007f40: 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;
2007f44: c8 03 e2 f8 ld [ %o7 + 0x2f8 ], %g4
2007f48: 83 2e 20 03 sll %i0, 3, %g1
2007f4c: 9b 2e 20 05 sll %i0, 5, %o5
2007f50: 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;
2007f54: d8 01 00 02 ld [ %g4 + %g2 ], %o4
2007f58: 80 a3 20 00 cmp %o4, 0
2007f5c: 02 80 00 0b be 2007f88 <rtems_io_register_driver+0x180>
2007f60: 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();
2007f64: 40 00 08 30 call 200a024 <_Thread_Enable_dispatch>
2007f68: 01 00 00 00 nop
return RTEMS_RESOURCE_IN_USE;
2007f6c: 10 bf ff b0 b 2007e2c <rtems_io_register_driver+0x24>
2007f70: 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;
2007f74: 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();
2007f78: 40 00 08 2b call 200a024 <_Thread_Enable_dispatch>
2007f7c: 01 00 00 00 nop
return sc;
2007f80: 10 bf ff ab b 2007e2c <rtems_io_register_driver+0x24>
2007f84: 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;
2007f88: c4 00 a0 04 ld [ %g2 + 4 ], %g2
2007f8c: 80 a0 a0 00 cmp %g2, 0
2007f90: 12 bf ff f5 bne 2007f64 <rtems_io_register_driver+0x15c>
2007f94: 01 00 00 00 nop
if ( !rtems_io_is_empty_table( table ) ) {
_Thread_Enable_dispatch();
return RTEMS_RESOURCE_IN_USE;
}
*registered_major = major;
2007f98: 10 bf ff d1 b 2007edc <rtems_io_register_driver+0xd4>
2007f9c: f0 26 80 00 st %i0, [ %i2 ]
if ( rtems_io_is_empty_table( table ) )
break;
}
/* Assigns invalid value in case of failure */
*major = m;
2007fa0: 10 bf ff f6 b 2007f78 <rtems_io_register_driver+0x170> <== NOT EXECUTED
2007fa4: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED
02009574 <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)
{
2009574: 9d e3 bf a0 save %sp, -96, %sp
uint32_t i;
uint32_t api_index;
Thread_Control *the_thread;
Objects_Information *information;
if ( !routine )
2009578: 80 a6 20 00 cmp %i0, 0
200957c: 02 80 00 20 be 20095fc <rtems_iterate_over_all_threads+0x88><== NEVER TAKEN
2009580: 37 00 80 80 sethi %hi(0x2020000), %i3
2009584: b6 16 e3 dc or %i3, 0x3dc, %i3 ! 20203dc <_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)
2009588: 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 ];
200958c: c2 06 c0 00 ld [ %i3 ], %g1
2009590: f8 00 60 04 ld [ %g1 + 4 ], %i4
if ( !information )
2009594: 80 a7 20 00 cmp %i4, 0
2009598: 22 80 00 16 be,a 20095f0 <rtems_iterate_over_all_threads+0x7c>
200959c: b6 06 e0 04 add %i3, 4, %i3
continue;
for ( i=1 ; i <= information->maximum ; i++ ) {
20095a0: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1
20095a4: 84 90 60 00 orcc %g1, 0, %g2
20095a8: 22 80 00 12 be,a 20095f0 <rtems_iterate_over_all_threads+0x7c>
20095ac: b6 06 e0 04 add %i3, 4, %i3
20095b0: ba 10 20 01 mov 1, %i5
the_thread = (Thread_Control *)information->local_table[ i ];
20095b4: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
20095b8: 83 2f 60 02 sll %i5, 2, %g1
20095bc: c2 00 c0 01 ld [ %g3 + %g1 ], %g1
if ( !the_thread )
20095c0: 90 90 60 00 orcc %g1, 0, %o0
20095c4: 02 80 00 05 be 20095d8 <rtems_iterate_over_all_threads+0x64>
20095c8: ba 07 60 01 inc %i5
continue;
(*routine)(the_thread);
20095cc: 9f c6 00 00 call %i0
20095d0: 01 00 00 00 nop
20095d4: 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++ ) {
20095d8: 83 28 a0 10 sll %g2, 0x10, %g1
20095dc: 83 30 60 10 srl %g1, 0x10, %g1
20095e0: 80 a0 40 1d cmp %g1, %i5
20095e4: 3a bf ff f5 bcc,a 20095b8 <rtems_iterate_over_all_threads+0x44>
20095e8: c6 07 20 1c ld [ %i4 + 0x1c ], %g3
20095ec: 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++ ) {
20095f0: 80 a6 c0 1a cmp %i3, %i2
20095f4: 32 bf ff e7 bne,a 2009590 <rtems_iterate_over_all_threads+0x1c>
20095f8: c2 06 c0 00 ld [ %i3 ], %g1
20095fc: 81 c7 e0 08 ret
2009600: 81 e8 00 00 restore
020081d0 <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
)
{
20081d0: 9d e3 bf a0 save %sp, -96, %sp
20081d4: 90 10 00 18 mov %i0, %o0
int i;
/*
* Validate parameters and look up information structure.
*/
if ( !info )
20081d8: 80 a6 a0 00 cmp %i2, 0
20081dc: 02 80 00 21 be 2008260 <rtems_object_get_class_information+0x90>
20081e0: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
obj_info = _Objects_Get_information( the_api, the_class );
20081e4: 93 2e 60 10 sll %i1, 0x10, %o1
if ( !obj_info )
return RTEMS_INVALID_NUMBER;
20081e8: 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 );
20081ec: 40 00 07 76 call 2009fc4 <_Objects_Get_information>
20081f0: 93 32 60 10 srl %o1, 0x10, %o1
if ( !obj_info )
20081f4: 80 a2 20 00 cmp %o0, 0
20081f8: 02 80 00 1a be 2008260 <rtems_object_get_class_information+0x90>
20081fc: 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;
2008200: c4 02 20 0c ld [ %o0 + 0xc ], %g2
info->auto_extend = obj_info->auto_extend;
info->maximum = obj_info->maximum;
2008204: 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;
2008208: c6 02 20 08 ld [ %o0 + 8 ], %g3
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
200820c: 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;
2008210: 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;
2008214: c6 26 80 00 st %g3, [ %i2 ]
info->maximum_id = obj_info->maximum_id;
info->auto_extend = obj_info->auto_extend;
2008218: c2 2e a0 0c stb %g1, [ %i2 + 0xc ]
info->maximum = obj_info->maximum;
200821c: c8 26 a0 08 st %g4, [ %i2 + 8 ]
for ( unallocated=0, i=1 ; i <= info->maximum ; i++ )
2008220: 80 a1 20 00 cmp %g4, 0
2008224: 02 80 00 0d be 2008258 <rtems_object_get_class_information+0x88><== NEVER TAKEN
2008228: 84 10 20 00 clr %g2
200822c: de 02 20 1c ld [ %o0 + 0x1c ], %o7
2008230: 86 10 20 01 mov 1, %g3
2008234: 82 10 20 01 mov 1, %g1
if ( !obj_info->local_table[i] )
2008238: 87 28 e0 02 sll %g3, 2, %g3
200823c: 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++ )
2008240: 82 00 60 01 inc %g1
if ( !obj_info->local_table[i] )
unallocated++;
2008244: 80 a0 00 03 cmp %g0, %g3
2008248: 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++ )
200824c: 80 a1 00 01 cmp %g4, %g1
2008250: 1a bf ff fa bcc 2008238 <rtems_object_get_class_information+0x68>
2008254: 86 10 00 01 mov %g1, %g3
if ( !obj_info->local_table[i] )
unallocated++;
info->unallocated = unallocated;
2008258: c4 26 a0 10 st %g2, [ %i2 + 0x10 ]
return RTEMS_SUCCESSFUL;
200825c: b0 10 20 00 clr %i0
}
2008260: 81 c7 e0 08 ret
2008264: 81 e8 00 00 restore
02013cf8 <rtems_partition_create>:
uint32_t length,
uint32_t buffer_size,
rtems_attribute attribute_set,
rtems_id *id
)
{
2013cf8: 9d e3 bf a0 save %sp, -96, %sp
register Partition_Control *the_partition;
if ( !rtems_is_name_valid( name ) )
2013cfc: 80 a6 20 00 cmp %i0, 0
2013d00: 12 80 00 04 bne 2013d10 <rtems_partition_create+0x18>
2013d04: 82 10 20 03 mov 3, %g1
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013d08: 81 c7 e0 08 ret
2013d0c: 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 )
2013d10: 80 a6 60 00 cmp %i1, 0
2013d14: 02 bf ff fd be 2013d08 <rtems_partition_create+0x10>
2013d18: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
if ( !id )
2013d1c: 80 a7 60 00 cmp %i5, 0
2013d20: 02 bf ff fa be 2013d08 <rtems_partition_create+0x10> <== NEVER TAKEN
2013d24: 80 a6 e0 00 cmp %i3, 0
return RTEMS_INVALID_ADDRESS;
if ( length == 0 || buffer_size == 0 || length < buffer_size ||
2013d28: 02 bf ff f8 be 2013d08 <rtems_partition_create+0x10>
2013d2c: 82 10 20 08 mov 8, %g1
2013d30: 80 a6 a0 00 cmp %i2, 0
2013d34: 02 bf ff f5 be 2013d08 <rtems_partition_create+0x10>
2013d38: 80 a6 80 1b cmp %i2, %i3
2013d3c: 0a bf ff f3 bcs 2013d08 <rtems_partition_create+0x10>
2013d40: 80 8e e0 07 btst 7, %i3
2013d44: 12 bf ff f1 bne 2013d08 <rtems_partition_create+0x10>
2013d48: 80 8e 60 07 btst 7, %i1
!_Partition_Is_buffer_size_aligned( buffer_size ) )
return RTEMS_INVALID_SIZE;
if ( !_Addresses_Is_aligned( starting_address ) )
2013d4c: 12 bf ff ef bne 2013d08 <rtems_partition_create+0x10>
2013d50: 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++;
2013d54: 03 00 80 f6 sethi %hi(0x203d800), %g1
2013d58: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 203db30 <_Thread_Dispatch_disable_level>
2013d5c: 84 00 a0 01 inc %g2
2013d60: c4 20 63 30 st %g2, [ %g1 + 0x330 ]
return _Thread_Dispatch_disable_level;
2013d64: c2 00 63 30 ld [ %g1 + 0x330 ], %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 );
2013d68: 23 00 80 f6 sethi %hi(0x203d800), %l1
2013d6c: 40 00 13 4e call 2018aa4 <_Objects_Allocate>
2013d70: 90 14 61 44 or %l1, 0x144, %o0 ! 203d944 <_Partition_Information>
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
2013d74: a0 92 20 00 orcc %o0, 0, %l0
2013d78: 02 80 00 1a be 2013de0 <rtems_partition_create+0xe8>
2013d7c: 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;
2013d80: f8 24 20 1c st %i4, [ %l0 + 0x1c ]
_Thread_Enable_dispatch();
return RTEMS_TOO_MANY;
}
#endif
the_partition->starting_address = starting_address;
2013d84: f2 24 20 10 st %i1, [ %l0 + 0x10 ]
the_partition->length = length;
2013d88: f4 24 20 14 st %i2, [ %l0 + 0x14 ]
the_partition->buffer_size = buffer_size;
2013d8c: f6 24 20 18 st %i3, [ %l0 + 0x18 ]
the_partition->attribute_set = attribute_set;
the_partition->number_of_used_blocks = 0;
2013d90: c0 24 20 20 clr [ %l0 + 0x20 ]
_Chain_Initialize( &the_partition->Memory, starting_address,
length / buffer_size, buffer_size );
2013d94: 40 00 65 a7 call 202d430 <.udiv>
2013d98: 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,
2013d9c: 92 10 00 19 mov %i1, %o1
length / buffer_size, buffer_size );
2013da0: 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,
2013da4: 96 10 00 1b mov %i3, %o3
2013da8: b8 04 20 24 add %l0, 0x24, %i4
2013dac: 40 00 0c d9 call 2017110 <_Chain_Initialize>
2013db0: 90 10 00 1c mov %i4, %o0
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013db4: c4 14 20 0a lduh [ %l0 + 0xa ], %g2
);
#endif
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
2013db8: a2 14 61 44 or %l1, 0x144, %l1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013dbc: c6 04 60 1c ld [ %l1 + 0x1c ], %g3
Objects_Information *information,
Objects_Control *the_object,
Objects_Name name
)
{
_Objects_Set_local_object(
2013dc0: c2 04 20 08 ld [ %l0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2013dc4: 85 28 a0 02 sll %g2, 2, %g2
2013dc8: e0 20 c0 02 st %l0, [ %g3 + %g2 ]
information,
_Objects_Get_index( the_object->id ),
the_object
);
the_object->name = name;
2013dcc: f0 24 20 0c st %i0, [ %l0 + 0xc ]
name,
0 /* Not used */
);
#endif
_Thread_Enable_dispatch();
2013dd0: 40 00 18 87 call 2019fec <_Thread_Enable_dispatch>
2013dd4: c2 27 40 00 st %g1, [ %i5 ]
return RTEMS_SUCCESSFUL;
2013dd8: 10 bf ff cc b 2013d08 <rtems_partition_create+0x10>
2013ddc: 82 10 20 00 clr %g1
_Thread_Disable_dispatch(); /* prevents deletion */
the_partition = _Partition_Allocate();
if ( !the_partition ) {
_Thread_Enable_dispatch();
2013de0: 40 00 18 83 call 2019fec <_Thread_Enable_dispatch>
2013de4: 01 00 00 00 nop
return RTEMS_TOO_MANY;
2013de8: 10 bf ff c8 b 2013d08 <rtems_partition_create+0x10>
2013dec: 82 10 20 05 mov 5, %g1 ! 5 <PROM_START+0x5>
02007608 <rtems_rate_monotonic_period>:
rtems_status_code rtems_rate_monotonic_period(
rtems_id id,
rtems_interval length
)
{
2007608: 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 *)
200760c: 11 00 80 7d sethi %hi(0x201f400), %o0
2007610: 92 10 00 18 mov %i0, %o1
2007614: 90 12 22 84 or %o0, 0x284, %o0
2007618: 40 00 09 71 call 2009bdc <_Objects_Get>
200761c: 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 ) {
2007620: c2 07 bf fc ld [ %fp + -4 ], %g1
2007624: 80 a0 60 00 cmp %g1, 0
2007628: 12 80 00 0d bne 200765c <rtems_rate_monotonic_period+0x54>
200762c: ba 10 00 08 mov %o0, %i5
case OBJECTS_LOCAL:
if ( !_Thread_Is_executing( the_period->owner ) ) {
2007630: 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 );
2007634: 39 00 80 7f sethi %hi(0x201fc00), %i4
2007638: b8 17 21 28 or %i4, 0x128, %i4 ! 201fd28 <_Per_CPU_Information>
200763c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007640: 80 a0 80 01 cmp %g2, %g1
2007644: 02 80 00 08 be 2007664 <rtems_rate_monotonic_period+0x5c>
2007648: 80 a6 60 00 cmp %i1, 0
_Thread_Enable_dispatch();
200764c: 40 00 0d 5b call 200abb8 <_Thread_Enable_dispatch>
2007650: b0 10 20 17 mov 0x17, %i0
return RTEMS_NOT_OWNER_OF_RESOURCE;
2007654: 81 c7 e0 08 ret
2007658: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
200765c: 81 c7 e0 08 ret
2007660: 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 ) {
2007664: 12 80 00 0e bne 200769c <rtems_rate_monotonic_period+0x94>
2007668: 01 00 00 00 nop
switch ( the_period->state ) {
200766c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2007670: 80 a0 60 04 cmp %g1, 4
2007674: 18 80 00 06 bgu 200768c <rtems_rate_monotonic_period+0x84><== NEVER TAKEN
2007678: b0 10 20 00 clr %i0
200767c: 83 28 60 02 sll %g1, 2, %g1
2007680: 05 00 80 75 sethi %hi(0x201d400), %g2
2007684: 84 10 a0 84 or %g2, 0x84, %g2 ! 201d484 <CSWTCH.2>
2007688: f0 00 80 01 ld [ %g2 + %g1 ], %i0
the_period->state = RATE_MONOTONIC_ACTIVE;
the_period->next_length = length;
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
200768c: 40 00 0d 4b call 200abb8 <_Thread_Enable_dispatch>
2007690: 01 00 00 00 nop
return RTEMS_TIMEOUT;
2007694: 81 c7 e0 08 ret
2007698: 81 e8 00 00 restore
}
_Thread_Enable_dispatch();
return( return_value );
}
_ISR_Disable( level );
200769c: 7f ff ed e8 call 2002e3c <sparc_disable_interrupts>
20076a0: 01 00 00 00 nop
20076a4: b4 10 00 08 mov %o0, %i2
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
20076a8: f6 07 60 38 ld [ %i5 + 0x38 ], %i3
20076ac: 80 a6 e0 00 cmp %i3, 0
20076b0: 02 80 00 14 be 2007700 <rtems_rate_monotonic_period+0xf8>
20076b4: 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 ) {
20076b8: 02 80 00 29 be 200775c <rtems_rate_monotonic_period+0x154>
20076bc: 80 a6 e0 04 cmp %i3, 4
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
}
if ( the_period->state == RATE_MONOTONIC_EXPIRED ) {
20076c0: 12 bf ff e5 bne 2007654 <rtems_rate_monotonic_period+0x4c><== NEVER TAKEN
20076c4: b0 10 20 04 mov 4, %i0
/*
* Update statistics from the concluding period
*/
_Rate_monotonic_Update_statistics( the_period );
20076c8: 7f ff ff 92 call 2007510 <_Rate_monotonic_Update_statistics>
20076cc: 90 10 00 1d mov %i5, %o0
_ISR_Enable( level );
20076d0: 7f ff ed df call 2002e4c <sparc_enable_interrupts>
20076d4: 90 10 00 1a mov %i2, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
20076d8: 82 10 20 02 mov 2, %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076dc: 92 07 60 10 add %i5, 0x10, %o1
20076e0: 11 00 80 7e sethi %hi(0x201f800), %o0
the_period->next_length = length;
20076e4: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
20076e8: 90 12 20 ac or %o0, 0xac, %o0
*/
_Rate_monotonic_Update_statistics( the_period );
_ISR_Enable( level );
the_period->state = RATE_MONOTONIC_ACTIVE;
20076ec: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
20076f0: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
20076f4: 40 00 11 55 call 200bc48 <_Watchdog_Insert>
20076f8: b0 10 20 06 mov 6, %i0
20076fc: 30 bf ff e4 b,a 200768c <rtems_rate_monotonic_period+0x84>
return( return_value );
}
_ISR_Disable( level );
if ( the_period->state == RATE_MONOTONIC_INACTIVE ) {
_ISR_Enable( level );
2007700: 7f ff ed d3 call 2002e4c <sparc_enable_interrupts>
2007704: 01 00 00 00 nop
/*
* Baseline statistics information for the beginning of a period.
*/
_Rate_monotonic_Initiate_statistics( the_period );
2007708: 7f ff ff 68 call 20074a8 <_Rate_monotonic_Initiate_statistics>
200770c: 90 10 00 1d mov %i5, %o0
the_period->state = RATE_MONOTONIC_ACTIVE;
2007710: 82 10 20 02 mov 2, %g1
2007714: 92 07 60 10 add %i5, 0x10, %o1
2007718: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
200771c: 11 00 80 7e sethi %hi(0x201f800), %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007720: 03 00 80 1e sethi %hi(0x2007800), %g1
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007724: 90 12 20 ac or %o0, 0xac, %o0
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007728: 82 10 62 b0 or %g1, 0x2b0, %g1
the_watchdog->id = id;
200772c: f0 27 60 30 st %i0, [ %i5 + 0x30 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
2007730: c2 27 60 2c st %g1, [ %i5 + 0x2c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2007734: c0 27 60 18 clr [ %i5 + 0x18 ]
the_watchdog->routine = routine;
the_watchdog->id = id;
the_watchdog->user_data = user_data;
2007738: c0 27 60 34 clr [ %i5 + 0x34 ]
_Rate_monotonic_Timeout,
id,
NULL
);
the_period->next_length = length;
200773c: f2 27 60 3c st %i1, [ %i5 + 0x3c ]
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2007740: f2 27 60 1c st %i1, [ %i5 + 0x1c ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2007744: 40 00 11 41 call 200bc48 <_Watchdog_Insert>
2007748: b0 10 20 00 clr %i0
_Watchdog_Insert_ticks( &the_period->Timer, length );
_Thread_Enable_dispatch();
200774c: 40 00 0d 1b call 200abb8 <_Thread_Enable_dispatch>
2007750: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2007754: 81 c7 e0 08 ret
2007758: 81 e8 00 00 restore
if ( the_period->state == RATE_MONOTONIC_ACTIVE ) {
/*
* Update statistics from the concluding period.
*/
_Rate_monotonic_Update_statistics( the_period );
200775c: 7f ff ff 6d call 2007510 <_Rate_monotonic_Update_statistics>
2007760: 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;
2007764: 82 10 20 01 mov 1, %g1
the_period->next_length = length;
2007768: 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;
200776c: c2 27 60 38 st %g1, [ %i5 + 0x38 ]
the_period->next_length = length;
_ISR_Enable( level );
2007770: 7f ff ed b7 call 2002e4c <sparc_enable_interrupts>
2007774: 90 10 00 1a mov %i2, %o0
_Thread_Executing->Wait.id = the_period->Object.id;
2007778: c2 07 20 0c ld [ %i4 + 0xc ], %g1
200777c: c4 07 60 08 ld [ %i5 + 8 ], %g2
_Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
2007780: 90 10 00 01 mov %g1, %o0
2007784: 13 00 00 10 sethi %hi(0x4000), %o1
2007788: 40 00 0f 67 call 200b524 <_Thread_Set_state>
200778c: c4 20 60 20 st %g2, [ %g1 + 0x20 ]
/*
* Did the watchdog timer expire while we were actually blocking
* on it?
*/
_ISR_Disable( level );
2007790: 7f ff ed ab call 2002e3c <sparc_disable_interrupts>
2007794: 01 00 00 00 nop
local_state = the_period->state;
2007798: f4 07 60 38 ld [ %i5 + 0x38 ], %i2
the_period->state = RATE_MONOTONIC_ACTIVE;
200779c: f6 27 60 38 st %i3, [ %i5 + 0x38 ]
_ISR_Enable( level );
20077a0: 7f ff ed ab call 2002e4c <sparc_enable_interrupts>
20077a4: 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 )
20077a8: 80 a6 a0 03 cmp %i2, 3
20077ac: 22 80 00 06 be,a 20077c4 <rtems_rate_monotonic_period+0x1bc>
20077b0: d0 07 20 0c ld [ %i4 + 0xc ], %o0
_Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD );
_Thread_Enable_dispatch();
20077b4: 40 00 0d 01 call 200abb8 <_Thread_Enable_dispatch>
20077b8: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
20077bc: 81 c7 e0 08 ret
20077c0: 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 );
20077c4: 40 00 0c 0b call 200a7f0 <_Thread_Clear_state>
20077c8: 13 00 00 10 sethi %hi(0x4000), %o1
20077cc: 30 bf ff fa b,a 20077b4 <rtems_rate_monotonic_period+0x1ac>
020077d0 <rtems_rate_monotonic_report_statistics_with_plugin>:
*/
void rtems_rate_monotonic_report_statistics_with_plugin(
void *context,
rtems_printk_plugin_t print
)
{
20077d0: 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 )
20077d4: 80 a6 60 00 cmp %i1, 0
20077d8: 02 80 00 48 be 20078f8 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
20077dc: 90 10 00 18 mov %i0, %o0
return;
(*print)( context, "Period information by period\n" );
20077e0: 13 00 80 75 sethi %hi(0x201d400), %o1
20077e4: 9f c6 40 00 call %i1
20077e8: 92 12 60 98 or %o1, 0x98, %o1 ! 201d498 <CSWTCH.2+0x14>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
(*print)( context, "--- CPU times are in seconds ---\n" );
20077ec: 90 10 00 18 mov %i0, %o0
20077f0: 13 00 80 75 sethi %hi(0x201d400), %o1
20077f4: 9f c6 40 00 call %i1
20077f8: 92 12 60 b8 or %o1, 0xb8, %o1 ! 201d4b8 <CSWTCH.2+0x34>
(*print)( context, "--- Wall times are in seconds ---\n" );
20077fc: 90 10 00 18 mov %i0, %o0
2007800: 13 00 80 75 sethi %hi(0x201d400), %o1
2007804: 9f c6 40 00 call %i1
2007808: 92 12 60 e0 or %o1, 0xe0, %o1 ! 201d4e0 <CSWTCH.2+0x5c>
Be sure to test the various cases.
(*print)( context,"\
1234567890123456789012345678901234567890123456789012345678901234567890123456789\
\n");
*/
(*print)( context, " ID OWNER COUNT MISSED "
200780c: 90 10 00 18 mov %i0, %o0
2007810: 13 00 80 75 sethi %hi(0x201d400), %o1
2007814: 9f c6 40 00 call %i1
2007818: 92 12 61 08 or %o1, 0x108, %o1 ! 201d508 <CSWTCH.2+0x84>
#ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__
" "
#endif
" WALL TIME\n"
);
(*print)( context, " "
200781c: 90 10 00 18 mov %i0, %o0
2007820: 13 00 80 75 sethi %hi(0x201d400), %o1
2007824: 9f c6 40 00 call %i1
2007828: 92 12 61 58 or %o1, 0x158, %o1 ! 201d558 <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 ;
200782c: 39 00 80 7d sethi %hi(0x201f400), %i4
2007830: b8 17 22 84 or %i4, 0x284, %i4 ! 201f684 <_Rate_monotonic_Information>
2007834: fa 07 20 08 ld [ %i4 + 8 ], %i5
2007838: c2 07 20 0c ld [ %i4 + 0xc ], %g1
200783c: 80 a7 40 01 cmp %i5, %g1
2007840: 18 80 00 2e bgu 20078f8 <rtems_rate_monotonic_report_statistics_with_plugin+0x128><== NEVER TAKEN
2007844: 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,
2007848: 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,
200784c: 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" );
2007850: 37 00 80 71 sethi %hi(0x201c400), %i3
rtems_object_get_name( the_status.owner, sizeof(name), name );
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
2007854: b4 16 a1 a8 or %i2, 0x1a8, %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,
2007858: a2 14 61 c0 or %l1, 0x1c0, %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,
200785c: a0 14 21 e0 or %l0, 0x1e0, %l0
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
(*print)( context, "\n" );
2007860: 10 80 00 06 b 2007878 <rtems_rate_monotonic_report_statistics_with_plugin+0xa8>
2007864: b6 16 e3 18 or %i3, 0x318, %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++ ) {
2007868: 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 ;
200786c: 80 a0 40 1d cmp %g1, %i5
2007870: 0a 80 00 22 bcs 20078f8 <rtems_rate_monotonic_report_statistics_with_plugin+0x128>
2007874: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
status = rtems_rate_monotonic_get_statistics( id, &the_stats );
2007878: 90 10 00 1d mov %i5, %o0
200787c: 40 00 1b c7 call 200e798 <rtems_rate_monotonic_get_statistics>
2007880: 92 07 bf a0 add %fp, -96, %o1
if ( status != RTEMS_SUCCESSFUL )
2007884: 80 a2 20 00 cmp %o0, 0
2007888: 32 bf ff f8 bne,a 2007868 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
200788c: 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 );
2007890: 92 07 bf d8 add %fp, -40, %o1
2007894: 40 00 1b f0 call 200e854 <rtems_rate_monotonic_get_status>
2007898: 90 10 00 1d mov %i5, %o0
#endif
rtems_object_get_name( the_status.owner, sizeof(name), name );
200789c: d0 07 bf d8 ld [ %fp + -40 ], %o0
20078a0: 92 10 20 05 mov 5, %o1
20078a4: 40 00 00 b4 call 2007b74 <rtems_object_get_name>
20078a8: 94 07 bf f8 add %fp, -8, %o2
/*
* Print part of report line that is not dependent on granularity
*/
(*print)( context,
20078ac: d8 1f bf a0 ldd [ %fp + -96 ], %o4
20078b0: 92 10 00 1a mov %i2, %o1
20078b4: 94 10 00 1d mov %i5, %o2
20078b8: 90 10 00 18 mov %i0, %o0
20078bc: 9f c6 40 00 call %i1
20078c0: 96 07 bf f8 add %fp, -8, %o3
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
20078c4: 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 );
20078c8: 94 07 bf f0 add %fp, -16, %o2
20078cc: 90 07 bf b8 add %fp, -72, %o0
);
/*
* If the count is zero, don't print statistics
*/
if (the_stats.count == 0) {
20078d0: 80 a0 60 00 cmp %g1, 0
20078d4: 12 80 00 0b bne 2007900 <rtems_rate_monotonic_report_statistics_with_plugin+0x130>
20078d8: 92 10 00 1b mov %i3, %o1
(*print)( context, "\n" );
20078dc: 9f c6 40 00 call %i1
20078e0: 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 ;
20078e4: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
20078e8: 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 ;
20078ec: 80 a0 40 1d cmp %g1, %i5
20078f0: 1a bf ff e3 bcc 200787c <rtems_rate_monotonic_report_statistics_with_plugin+0xac><== ALWAYS TAKEN
20078f4: 90 10 00 1d mov %i5, %o0
20078f8: 81 c7 e0 08 ret
20078fc: 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 );
2007900: 40 00 0f 96 call 200b758 <_Timespec_Divide_by_integer>
2007904: 92 10 00 01 mov %g1, %o1
(*print)( context,
2007908: d0 07 bf ac ld [ %fp + -84 ], %o0
200790c: 40 00 49 e4 call 201a09c <.div>
2007910: 92 10 23 e8 mov 0x3e8, %o1
2007914: aa 10 00 08 mov %o0, %l5
2007918: d0 07 bf b4 ld [ %fp + -76 ], %o0
200791c: 40 00 49 e0 call 201a09c <.div>
2007920: 92 10 23 e8 mov 0x3e8, %o1
2007924: c2 07 bf f0 ld [ %fp + -16 ], %g1
2007928: a6 10 00 08 mov %o0, %l3
200792c: d0 07 bf f4 ld [ %fp + -12 ], %o0
2007930: e4 07 bf a8 ld [ %fp + -88 ], %l2
2007934: e8 07 bf b0 ld [ %fp + -80 ], %l4
2007938: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
200793c: 40 00 49 d8 call 201a09c <.div>
2007940: 92 10 23 e8 mov 0x3e8, %o1
2007944: 96 10 00 15 mov %l5, %o3
2007948: 98 10 00 14 mov %l4, %o4
200794c: 9a 10 00 13 mov %l3, %o5
2007950: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
2007954: 92 10 00 11 mov %l1, %o1
2007958: 94 10 00 12 mov %l2, %o2
200795c: 9f c6 40 00 call %i1
2007960: 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);
2007964: d2 07 bf a0 ld [ %fp + -96 ], %o1
2007968: 94 07 bf f0 add %fp, -16, %o2
200796c: 40 00 0f 7b call 200b758 <_Timespec_Divide_by_integer>
2007970: 90 07 bf d0 add %fp, -48, %o0
(*print)( context,
2007974: d0 07 bf c4 ld [ %fp + -60 ], %o0
2007978: 40 00 49 c9 call 201a09c <.div>
200797c: 92 10 23 e8 mov 0x3e8, %o1
2007980: a8 10 00 08 mov %o0, %l4
2007984: d0 07 bf cc ld [ %fp + -52 ], %o0
2007988: 40 00 49 c5 call 201a09c <.div>
200798c: 92 10 23 e8 mov 0x3e8, %o1
2007990: c2 07 bf f0 ld [ %fp + -16 ], %g1
2007994: a4 10 00 08 mov %o0, %l2
2007998: d0 07 bf f4 ld [ %fp + -12 ], %o0
200799c: ea 07 bf c0 ld [ %fp + -64 ], %l5
20079a0: e6 07 bf c8 ld [ %fp + -56 ], %l3
20079a4: 92 10 23 e8 mov 0x3e8, %o1
20079a8: 40 00 49 bd call 201a09c <.div>
20079ac: c2 23 a0 5c st %g1, [ %sp + 0x5c ]
20079b0: 92 10 00 10 mov %l0, %o1
20079b4: d0 23 a0 60 st %o0, [ %sp + 0x60 ]
20079b8: 94 10 00 15 mov %l5, %o2
20079bc: 90 10 00 18 mov %i0, %o0
20079c0: 96 10 00 14 mov %l4, %o3
20079c4: 98 10 00 13 mov %l3, %o4
20079c8: 9f c6 40 00 call %i1
20079cc: 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 ;
20079d0: 10 bf ff a6 b 2007868 <rtems_rate_monotonic_report_statistics_with_plugin+0x98>
20079d4: c2 07 20 0c ld [ %i4 + 0xc ], %g1
020079f0 <rtems_rate_monotonic_reset_all_statistics>:
/*
* rtems_rate_monotonic_reset_all_statistics
*/
void rtems_rate_monotonic_reset_all_statistics( void )
{
20079f0: 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++;
20079f4: 03 00 80 7d sethi %hi(0x201f400), %g1
20079f8: c4 00 63 f0 ld [ %g1 + 0x3f0 ], %g2 ! 201f7f0 <_Thread_Dispatch_disable_level>
20079fc: 84 00 a0 01 inc %g2
2007a00: c4 20 63 f0 st %g2, [ %g1 + 0x3f0 ]
return _Thread_Dispatch_disable_level;
2007a04: c2 00 63 f0 ld [ %g1 + 0x3f0 ], %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 ;
2007a08: 39 00 80 7d sethi %hi(0x201f400), %i4
2007a0c: b8 17 22 84 or %i4, 0x284, %i4 ! 201f684 <_Rate_monotonic_Information>
2007a10: fa 07 20 08 ld [ %i4 + 8 ], %i5
2007a14: c2 07 20 0c ld [ %i4 + 0xc ], %g1
2007a18: 80 a7 40 01 cmp %i5, %g1
2007a1c: 18 80 00 09 bgu 2007a40 <rtems_rate_monotonic_reset_all_statistics+0x50><== NEVER TAKEN
2007a20: 01 00 00 00 nop
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
(void) rtems_rate_monotonic_reset_statistics( id );
2007a24: 40 00 00 09 call 2007a48 <rtems_rate_monotonic_reset_statistics>
2007a28: 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 ;
2007a2c: c2 07 20 0c ld [ %i4 + 0xc ], %g1
id <= _Rate_monotonic_Information.maximum_id ;
id++ ) {
2007a30: 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 ;
2007a34: 80 a0 40 1d cmp %g1, %i5
2007a38: 1a bf ff fb bcc 2007a24 <rtems_rate_monotonic_reset_all_statistics+0x34>
2007a3c: 01 00 00 00 nop
}
/*
* Done so exit thread dispatching disabled critical section.
*/
_Thread_Enable_dispatch();
2007a40: 40 00 0c 5e call 200abb8 <_Thread_Enable_dispatch>
2007a44: 81 e8 00 00 restore
020152b4 <rtems_signal_send>:
rtems_status_code rtems_signal_send(
rtems_id id,
rtems_signal_set signal_set
)
{
20152b4: 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 )
20152b8: 80 a6 60 00 cmp %i1, 0
20152bc: 12 80 00 04 bne 20152cc <rtems_signal_send+0x18>
20152c0: 82 10 20 0a mov 0xa, %g1
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20152c4: 81 c7 e0 08 ret
20152c8: 91 e8 00 01 restore %g0, %g1, %o0
ASR_Information *asr;
if ( !signal_set )
return RTEMS_INVALID_NUMBER;
the_thread = _Thread_Get( id, &location );
20152cc: 90 10 00 18 mov %i0, %o0
20152d0: 40 00 13 53 call 201a01c <_Thread_Get>
20152d4: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
20152d8: c2 07 bf fc ld [ %fp + -4 ], %g1
20152dc: 80 a0 60 00 cmp %g1, 0
20152e0: 12 80 00 20 bne 2015360 <rtems_signal_send+0xac>
20152e4: b8 10 00 08 mov %o0, %i4
case OBJECTS_LOCAL:
api = the_thread->API_Extensions[ THREAD_API_RTEMS ];
20152e8: fa 02 21 58 ld [ %o0 + 0x158 ], %i5
asr = &api->Signal;
if ( ! _ASR_Is_null_handler( asr->handler ) ) {
20152ec: c2 07 60 0c ld [ %i5 + 0xc ], %g1
20152f0: 80 a0 60 00 cmp %g1, 0
20152f4: 02 80 00 1e be 201536c <rtems_signal_send+0xb8>
20152f8: 01 00 00 00 nop
if ( asr->is_enabled ) {
20152fc: c2 0f 60 08 ldub [ %i5 + 8 ], %g1
2015300: 80 a0 60 00 cmp %g1, 0
2015304: 02 80 00 1e be 201537c <rtems_signal_send+0xc8>
2015308: 01 00 00 00 nop
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
201530c: 7f ff e6 bf call 200ee08 <sparc_disable_interrupts>
2015310: 01 00 00 00 nop
*signal_set |= signals;
2015314: c2 07 60 14 ld [ %i5 + 0x14 ], %g1
2015318: b2 10 40 19 or %g1, %i1, %i1
201531c: f2 27 60 14 st %i1, [ %i5 + 0x14 ]
_ISR_Enable( _level );
2015320: 7f ff e6 be call 200ee18 <sparc_enable_interrupts>
2015324: 01 00 00 00 nop
_ASR_Post_signals( signal_set, &asr->signals_posted );
if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) )
2015328: 03 00 80 f8 sethi %hi(0x203e000), %g1
201532c: 82 10 60 70 or %g1, 0x70, %g1 ! 203e070 <_Per_CPU_Information>
2015330: c4 00 60 08 ld [ %g1 + 8 ], %g2
2015334: 80 a0 a0 00 cmp %g2, 0
2015338: 02 80 00 06 be 2015350 <rtems_signal_send+0x9c>
201533c: 01 00 00 00 nop
2015340: c4 00 60 0c ld [ %g1 + 0xc ], %g2
2015344: 80 a7 00 02 cmp %i4, %g2
2015348: 02 80 00 15 be 201539c <rtems_signal_send+0xe8> <== ALWAYS TAKEN
201534c: 84 10 20 01 mov 1, %g2
_Thread_Dispatch_necessary = true;
} else {
_ASR_Post_signals( signal_set, &asr->signals_pending );
}
_Thread_Enable_dispatch();
2015350: 40 00 13 27 call 2019fec <_Thread_Enable_dispatch>
2015354: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2015358: 10 bf ff db b 20152c4 <rtems_signal_send+0x10>
201535c: 82 10 20 00 clr %g1 ! 0 <PROM_START>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
2015360: 82 10 20 04 mov 4, %g1
}
2015364: 81 c7 e0 08 ret
2015368: 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();
201536c: 40 00 13 20 call 2019fec <_Thread_Enable_dispatch>
2015370: 01 00 00 00 nop
return RTEMS_NOT_DEFINED;
2015374: 10 bf ff d4 b 20152c4 <rtems_signal_send+0x10>
2015378: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
rtems_signal_set *signal_set
)
{
ISR_Level _level;
_ISR_Disable( _level );
201537c: 7f ff e6 a3 call 200ee08 <sparc_disable_interrupts>
2015380: 01 00 00 00 nop
*signal_set |= signals;
2015384: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
2015388: b2 10 40 19 or %g1, %i1, %i1
201538c: f2 27 60 18 st %i1, [ %i5 + 0x18 ]
_ISR_Enable( _level );
2015390: 7f ff e6 a2 call 200ee18 <sparc_enable_interrupts>
2015394: 01 00 00 00 nop
2015398: 30 bf ff ee b,a 2015350 <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;
201539c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ]
20153a0: 30 bf ff ec b,a 2015350 <rtems_signal_send+0x9c>
0200f374 <rtems_task_mode>:
rtems_status_code rtems_task_mode(
rtems_mode mode_set,
rtems_mode mask,
rtems_mode *previous_mode_set
)
{
200f374: 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 )
200f378: 80 a6 a0 00 cmp %i2, 0
200f37c: 02 80 00 3b be 200f468 <rtems_task_mode+0xf4>
200f380: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
executing = _Thread_Executing;
200f384: 21 00 80 77 sethi %hi(0x201dc00), %l0
200f388: a0 14 22 c8 or %l0, 0x2c8, %l0 ! 201dec8 <_Per_CPU_Information>
200f38c: 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;
200f390: c4 0f 60 74 ldub [ %i5 + 0x74 ], %g2
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f394: 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;
200f398: 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 ];
200f39c: f8 07 61 58 ld [ %i5 + 0x158 ], %i4
asr = &api->Signal;
old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT;
200f3a0: b6 60 3f ff subx %g0, -1, %i3
if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE )
200f3a4: 80 a0 60 00 cmp %g1, 0
200f3a8: 12 80 00 40 bne 200f4a8 <rtems_task_mode+0x134>
200f3ac: 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;
200f3b0: c2 0f 20 08 ldub [ %i4 + 8 ], %g1
200f3b4: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f3b8: 7f ff ed 4a call 200a8e0 <_CPU_ISR_Get_level>
200f3bc: 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;
200f3c0: a3 2c 60 0a sll %l1, 0xa, %l1
200f3c4: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200f3c8: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f3cc: 80 8e 61 00 btst 0x100, %i1
200f3d0: 02 80 00 06 be 200f3e8 <rtems_task_mode+0x74>
200f3d4: 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;
200f3d8: 82 0e 21 00 and %i0, 0x100, %g1
executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false;
200f3dc: 80 a0 00 01 cmp %g0, %g1
200f3e0: 82 60 3f ff subx %g0, -1, %g1
200f3e4: c2 2f 60 74 stb %g1, [ %i5 + 0x74 ]
if ( mask & RTEMS_TIMESLICE_MASK ) {
200f3e8: 80 8e 62 00 btst 0x200, %i1
200f3ec: 12 80 00 21 bne 200f470 <rtems_task_mode+0xfc>
200f3f0: 80 8e 22 00 btst 0x200, %i0
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f3f4: 80 8e 60 0f btst 0xf, %i1
200f3f8: 12 80 00 27 bne 200f494 <rtems_task_mode+0x120>
200f3fc: 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 ) {
200f400: 80 8e 64 00 btst 0x400, %i1
200f404: 02 80 00 14 be 200f454 <rtems_task_mode+0xe0>
200f408: 86 10 20 00 clr %g3
is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true;
if ( is_asr_enabled != asr->is_enabled ) {
200f40c: 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;
200f410: 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(
200f414: 80 a0 00 18 cmp %g0, %i0
200f418: 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 ) {
200f41c: 80 a0 80 01 cmp %g2, %g1
200f420: 22 80 00 0e be,a 200f458 <rtems_task_mode+0xe4>
200f424: 03 00 80 76 sethi %hi(0x201d800), %g1
)
{
rtems_signal_set _signals;
ISR_Level _level;
_ISR_Disable( _level );
200f428: 7f ff cb 75 call 20021fc <sparc_disable_interrupts>
200f42c: c2 2f 20 08 stb %g1, [ %i4 + 8 ]
_signals = information->signals_pending;
200f430: c4 07 20 18 ld [ %i4 + 0x18 ], %g2
information->signals_pending = information->signals_posted;
200f434: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
information->signals_posted = _signals;
200f438: 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;
200f43c: c2 27 20 18 st %g1, [ %i4 + 0x18 ]
information->signals_posted = _signals;
_ISR_Enable( _level );
200f440: 7f ff cb 73 call 200220c <sparc_enable_interrupts>
200f444: 01 00 00 00 nop
asr->is_enabled = is_asr_enabled;
_ASR_Swap_signals( asr );
if ( _ASR_Are_signals_pending( asr ) ) {
200f448: c2 07 20 14 ld [ %i4 + 0x14 ], %g1
/*
* This is specific to the RTEMS API
*/
is_asr_enabled = false;
needs_asr_dispatching = false;
200f44c: 80 a0 00 01 cmp %g0, %g1
200f450: 86 40 20 00 addx %g0, 0, %g3
needs_asr_dispatching = true;
}
}
}
if ( _System_state_Is_up( _System_state_Get() ) ) {
200f454: 03 00 80 76 sethi %hi(0x201d800), %g1
200f458: c4 00 62 e4 ld [ %g1 + 0x2e4 ], %g2 ! 201dae4 <_System_state_Current>
200f45c: 80 a0 a0 03 cmp %g2, 3
200f460: 02 80 00 1f be 200f4dc <rtems_task_mode+0x168>
200f464: 82 10 20 00 clr %g1
if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) )
_Thread_Dispatch();
}
return RTEMS_SUCCESSFUL;
}
200f468: 81 c7 e0 08 ret
200f46c: 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) ) {
200f470: 22 bf ff e1 be,a 200f3f4 <rtems_task_mode+0x80>
200f474: c0 27 60 7c clr [ %i5 + 0x7c ]
executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE;
executing->cpu_time_budget = _Thread_Ticks_per_timeslice;
200f478: 03 00 80 76 sethi %hi(0x201d800), %g1
200f47c: c2 00 60 f4 ld [ %g1 + 0xf4 ], %g1 ! 201d8f4 <_Thread_Ticks_per_timeslice>
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f480: 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;
200f484: 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;
200f488: 82 10 20 01 mov 1, %g1
}
/*
* Set the new interrupt level
*/
if ( mask & RTEMS_INTERRUPT_MASK )
200f48c: 02 bf ff dd be 200f400 <rtems_task_mode+0x8c>
200f490: 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 );
200f494: 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 ) );
200f498: 7f ff cb 5d call 200220c <sparc_enable_interrupts>
200f49c: 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 ) {
200f4a0: 10 bf ff d9 b 200f404 <rtems_task_mode+0x90>
200f4a4: 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;
200f4a8: 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;
200f4ac: b6 16 e2 00 or %i3, 0x200, %i3
old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR;
200f4b0: 80 a0 00 01 cmp %g0, %g1
old_mode |= _ISR_Get_level();
200f4b4: 7f ff ed 0b call 200a8e0 <_CPU_ISR_Get_level>
200f4b8: 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;
200f4bc: a3 2c 60 0a sll %l1, 0xa, %l1
200f4c0: a2 14 40 08 or %l1, %o0, %l1
old_mode |= _ISR_Get_level();
200f4c4: b6 14 40 1b or %l1, %i3, %i3
*previous_mode_set = old_mode;
/*
* These are generic thread scheduling characteristics.
*/
if ( mask & RTEMS_PREEMPT_MASK )
200f4c8: 80 8e 61 00 btst 0x100, %i1
200f4cc: 02 bf ff c7 be 200f3e8 <rtems_task_mode+0x74>
200f4d0: 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;
200f4d4: 10 bf ff c2 b 200f3dc <rtems_task_mode+0x68>
200f4d8: 82 0e 21 00 and %i0, 0x100, %g1
{
Thread_Control *executing;
executing = _Thread_Executing;
if ( are_signals_pending ||
200f4dc: 80 88 e0 ff btst 0xff, %g3
200f4e0: 12 80 00 0a bne 200f508 <rtems_task_mode+0x194>
200f4e4: c4 04 20 0c ld [ %l0 + 0xc ], %g2
200f4e8: c6 04 20 10 ld [ %l0 + 0x10 ], %g3
200f4ec: 80 a0 80 03 cmp %g2, %g3
200f4f0: 02 bf ff de be 200f468 <rtems_task_mode+0xf4>
200f4f4: 01 00 00 00 nop
(!_Thread_Is_heir( executing ) && executing->is_preemptible) ) {
200f4f8: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2
200f4fc: 80 a0 a0 00 cmp %g2, 0
200f500: 02 bf ff da be 200f468 <rtems_task_mode+0xf4> <== NEVER TAKEN
200f504: 01 00 00 00 nop
_Thread_Dispatch_necessary = true;
200f508: 82 10 20 01 mov 1, %g1 ! 1 <PROM_START+0x1>
200f50c: 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();
200f510: 7f ff e7 4b call 200923c <_Thread_Dispatch>
200f514: 01 00 00 00 nop
}
return RTEMS_SUCCESSFUL;
200f518: 82 10 20 00 clr %g1 ! 0 <PROM_START>
}
200f51c: 81 c7 e0 08 ret
200f520: 91 e8 00 01 restore %g0, %g1, %o0
0200b1fc <rtems_task_set_priority>:
rtems_status_code rtems_task_set_priority(
rtems_id id,
rtems_task_priority new_priority,
rtems_task_priority *old_priority
)
{
200b1fc: 9d e3 bf 98 save %sp, -104, %sp
register Thread_Control *the_thread;
Objects_Locations location;
if ( new_priority != RTEMS_CURRENT_PRIORITY &&
200b200: 80 a6 60 00 cmp %i1, 0
200b204: 02 80 00 07 be 200b220 <rtems_task_set_priority+0x24>
200b208: 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 ) );
200b20c: 03 00 80 6a sethi %hi(0x201a800), %g1
200b210: c2 08 60 9c ldub [ %g1 + 0x9c ], %g1 ! 201a89c <rtems_maximum_priority>
*/
RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid (
rtems_task_priority the_priority
)
{
return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) &&
200b214: 80 a6 40 01 cmp %i1, %g1
200b218: 18 80 00 1c bgu 200b288 <rtems_task_set_priority+0x8c>
200b21c: b0 10 20 13 mov 0x13, %i0
!_RTEMS_tasks_Priority_is_valid( new_priority ) )
return RTEMS_INVALID_PRIORITY;
if ( !old_priority )
200b220: 80 a6 a0 00 cmp %i2, 0
200b224: 02 80 00 19 be 200b288 <rtems_task_set_priority+0x8c>
200b228: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get( id, &location );
200b22c: 40 00 0a 0e call 200da64 <_Thread_Get>
200b230: 92 07 bf fc add %fp, -4, %o1
switch ( location ) {
200b234: c2 07 bf fc ld [ %fp + -4 ], %g1
200b238: 80 a0 60 00 cmp %g1, 0
200b23c: 12 80 00 13 bne 200b288 <rtems_task_set_priority+0x8c>
200b240: b0 10 20 04 mov 4, %i0
case OBJECTS_LOCAL:
/* XXX need helper to "convert" from core priority */
*old_priority = the_thread->current_priority;
200b244: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
if ( new_priority != RTEMS_CURRENT_PRIORITY ) {
200b248: 80 a6 60 00 cmp %i1, 0
200b24c: 02 80 00 0d be 200b280 <rtems_task_set_priority+0x84>
200b250: c2 26 80 00 st %g1, [ %i2 ]
the_thread->real_priority = new_priority;
if ( the_thread->resource_count == 0 ||
200b254: c2 02 20 1c ld [ %o0 + 0x1c ], %g1
200b258: 80 a0 60 00 cmp %g1, 0
200b25c: 02 80 00 06 be 200b274 <rtems_task_set_priority+0x78>
200b260: f2 22 20 18 st %i1, [ %o0 + 0x18 ]
200b264: c2 02 20 14 ld [ %o0 + 0x14 ], %g1
200b268: 80 a6 40 01 cmp %i1, %g1
200b26c: 1a 80 00 05 bcc 200b280 <rtems_task_set_priority+0x84> <== ALWAYS TAKEN
200b270: 01 00 00 00 nop
the_thread->current_priority > new_priority )
_Thread_Change_priority( the_thread, new_priority, false );
200b274: 92 10 00 19 mov %i1, %o1
200b278: 40 00 08 b2 call 200d540 <_Thread_Change_priority>
200b27c: 94 10 20 00 clr %o2
}
_Thread_Enable_dispatch();
200b280: 40 00 09 ed call 200da34 <_Thread_Enable_dispatch>
200b284: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
200b288: 81 c7 e0 08 ret
200b28c: 81 e8 00 00 restore
0200764c <rtems_task_variable_delete>:
rtems_status_code rtems_task_variable_delete(
rtems_id tid,
void **ptr
)
{
200764c: 9d e3 bf 98 save %sp, -104, %sp
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp, *prev;
if ( !ptr )
2007650: 80 a6 60 00 cmp %i1, 0
2007654: 02 80 00 1e be 20076cc <rtems_task_variable_delete+0x80>
2007658: 82 10 20 09 mov 9, %g1
return RTEMS_INVALID_ADDRESS;
prev = NULL;
the_thread = _Thread_Get (tid, &location);
200765c: 90 10 00 18 mov %i0, %o0
2007660: 40 00 09 91 call 2009ca4 <_Thread_Get>
2007664: 92 07 bf fc add %fp, -4, %o1
switch (location) {
2007668: c2 07 bf fc ld [ %fp + -4 ], %g1
200766c: 80 a0 60 00 cmp %g1, 0
2007670: 12 80 00 19 bne 20076d4 <rtems_task_variable_delete+0x88>
2007674: 82 10 20 04 mov 4, %g1
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
2007678: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
200767c: 80 a0 60 00 cmp %g1, 0
2007680: 02 80 00 10 be 20076c0 <rtems_task_variable_delete+0x74>
2007684: 01 00 00 00 nop
if (tvp->ptr == ptr) {
2007688: c4 00 60 04 ld [ %g1 + 4 ], %g2
200768c: 80 a0 80 19 cmp %g2, %i1
2007690: 32 80 00 09 bne,a 20076b4 <rtems_task_variable_delete+0x68>
2007694: d2 00 40 00 ld [ %g1 ], %o1
if (prev)
prev->next = tvp->next;
else
the_thread->task_variables = (rtems_task_variable_t *)tvp->next;
2007698: 10 80 00 18 b 20076f8 <rtems_task_variable_delete+0xac>
200769c: c4 00 40 00 ld [ %g1 ], %g2
switch (location) {
case OBJECTS_LOCAL:
tvp = the_thread->task_variables;
while (tvp) {
if (tvp->ptr == ptr) {
20076a0: 80 a0 80 19 cmp %g2, %i1
20076a4: 22 80 00 0e be,a 20076dc <rtems_task_variable_delete+0x90>
20076a8: c4 02 40 00 ld [ %o1 ], %g2
20076ac: 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;
20076b0: 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) {
20076b4: 80 a2 60 00 cmp %o1, 0
20076b8: 32 bf ff fa bne,a 20076a0 <rtems_task_variable_delete+0x54><== ALWAYS TAKEN
20076bc: c4 02 60 04 ld [ %o1 + 4 ], %g2
return RTEMS_SUCCESSFUL;
}
prev = tvp;
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
20076c0: 40 00 09 6d call 2009c74 <_Thread_Enable_dispatch>
20076c4: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
20076c8: 82 10 20 09 mov 9, %g1 ! 9 <PROM_START+0x9>
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
20076cc: 81 c7 e0 08 ret
20076d0: 91 e8 00 01 restore %g0, %g1, %o0
20076d4: 81 c7 e0 08 ret
20076d8: 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;
20076dc: 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 );
20076e0: 40 00 00 2d call 2007794 <_RTEMS_Tasks_Invoke_task_variable_dtor>
20076e4: 01 00 00 00 nop
_Thread_Enable_dispatch();
20076e8: 40 00 09 63 call 2009c74 <_Thread_Enable_dispatch>
20076ec: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
20076f0: 10 bf ff f7 b 20076cc <rtems_task_variable_delete+0x80>
20076f4: 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;
20076f8: 92 10 00 01 mov %g1, %o1
20076fc: 10 bf ff f9 b 20076e0 <rtems_task_variable_delete+0x94>
2007700: c4 22 21 64 st %g2, [ %o0 + 0x164 ]
02007704 <rtems_task_variable_get>:
rtems_status_code rtems_task_variable_get(
rtems_id tid,
void **ptr,
void **result
)
{
2007704: 9d e3 bf 98 save %sp, -104, %sp
2007708: 90 10 00 18 mov %i0, %o0
Thread_Control *the_thread;
Objects_Locations location;
rtems_task_variable_t *tvp;
if ( !ptr )
200770c: 80 a6 60 00 cmp %i1, 0
2007710: 02 80 00 1b be 200777c <rtems_task_variable_get+0x78>
2007714: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !result )
2007718: 80 a6 a0 00 cmp %i2, 0
200771c: 02 80 00 1c be 200778c <rtems_task_variable_get+0x88>
2007720: 01 00 00 00 nop
return RTEMS_INVALID_ADDRESS;
the_thread = _Thread_Get (tid, &location);
2007724: 40 00 09 60 call 2009ca4 <_Thread_Get>
2007728: 92 07 bf fc add %fp, -4, %o1
switch (location) {
200772c: c2 07 bf fc ld [ %fp + -4 ], %g1
2007730: 80 a0 60 00 cmp %g1, 0
2007734: 12 80 00 12 bne 200777c <rtems_task_variable_get+0x78>
2007738: 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;
200773c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1
while (tvp) {
2007740: 80 a0 60 00 cmp %g1, 0
2007744: 32 80 00 07 bne,a 2007760 <rtems_task_variable_get+0x5c>
2007748: c4 00 60 04 ld [ %g1 + 4 ], %g2
200774c: 30 80 00 0e b,a 2007784 <rtems_task_variable_get+0x80>
2007750: 80 a0 60 00 cmp %g1, 0
2007754: 02 80 00 0c be 2007784 <rtems_task_variable_get+0x80> <== NEVER TAKEN
2007758: 01 00 00 00 nop
if (tvp->ptr == ptr) {
200775c: c4 00 60 04 ld [ %g1 + 4 ], %g2
2007760: 80 a0 80 19 cmp %g2, %i1
2007764: 32 bf ff fb bne,a 2007750 <rtems_task_variable_get+0x4c>
2007768: 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;
200776c: c2 00 60 0c ld [ %g1 + 0xc ], %g1
_Thread_Enable_dispatch();
return RTEMS_SUCCESSFUL;
2007770: 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();
2007774: 40 00 09 40 call 2009c74 <_Thread_Enable_dispatch>
2007778: c2 26 80 00 st %g1, [ %i2 ]
return RTEMS_SUCCESSFUL;
200777c: 81 c7 e0 08 ret
2007780: 81 e8 00 00 restore
}
tvp = (rtems_task_variable_t *)tvp->next;
}
_Thread_Enable_dispatch();
2007784: 40 00 09 3c call 2009c74 <_Thread_Enable_dispatch>
2007788: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
200778c: 81 c7 e0 08 ret
2007790: 81 e8 00 00 restore
02015d14 <rtems_timer_cancel>:
*/
rtems_status_code rtems_timer_cancel(
rtems_id id
)
{
2015d14: 9d e3 bf 98 save %sp, -104, %sp
RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get (
Objects_Id id,
Objects_Locations *location
)
{
return (Timer_Control *)
2015d18: 11 00 80 f9 sethi %hi(0x203e400), %o0
2015d1c: 92 10 00 18 mov %i0, %o1
2015d20: 90 12 20 b4 or %o0, 0xb4, %o0
2015d24: 40 00 0c bb call 2019010 <_Objects_Get>
2015d28: 94 07 bf fc add %fp, -4, %o2
Timer_Control *the_timer;
Objects_Locations location;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
2015d2c: c2 07 bf fc ld [ %fp + -4 ], %g1
2015d30: 80 a0 60 00 cmp %g1, 0
2015d34: 12 80 00 0c bne 2015d64 <rtems_timer_cancel+0x50>
2015d38: 01 00 00 00 nop
case OBJECTS_LOCAL:
if ( !_Timer_Is_dormant_class( the_timer->the_class ) )
2015d3c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1
2015d40: 80 a0 60 04 cmp %g1, 4
2015d44: 02 80 00 04 be 2015d54 <rtems_timer_cancel+0x40> <== NEVER TAKEN
2015d48: 01 00 00 00 nop
(void) _Watchdog_Remove( &the_timer->Ticker );
2015d4c: 40 00 15 85 call 201b360 <_Watchdog_Remove>
2015d50: 90 02 20 10 add %o0, 0x10, %o0
_Thread_Enable_dispatch();
2015d54: 40 00 10 a6 call 2019fec <_Thread_Enable_dispatch>
2015d58: b0 10 20 00 clr %i0
return RTEMS_SUCCESSFUL;
2015d5c: 81 c7 e0 08 ret
2015d60: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2015d64: 81 c7 e0 08 ret
2015d68: 91 e8 20 04 restore %g0, 4, %o0
0201623c <rtems_timer_server_fire_when>:
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
201623c: 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;
2016240: 03 00 80 f9 sethi %hi(0x203e400), %g1
2016244: fa 00 60 f4 ld [ %g1 + 0xf4 ], %i5 ! 203e4f4 <_Timer_server>
rtems_id id,
rtems_time_of_day *wall_time,
rtems_timer_service_routine_entry routine,
void *user_data
)
{
2016248: 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 )
201624c: 80 a7 60 00 cmp %i5, 0
2016250: 02 80 00 32 be 2016318 <rtems_timer_server_fire_when+0xdc>
2016254: b0 10 20 0e mov 0xe, %i0
return RTEMS_INCORRECT_STATE;
if ( !_TOD_Is_set )
2016258: 03 00 80 f6 sethi %hi(0x203d800), %g1
201625c: c2 08 63 40 ldub [ %g1 + 0x340 ], %g1 ! 203db40 <_TOD_Is_set>
2016260: 80 a0 60 00 cmp %g1, 0
2016264: 02 80 00 2d be 2016318 <rtems_timer_server_fire_when+0xdc><== NEVER TAKEN
2016268: b0 10 20 0b mov 0xb, %i0
return RTEMS_NOT_DEFINED;
if ( !routine )
201626c: 80 a6 a0 00 cmp %i2, 0
2016270: 02 80 00 2a be 2016318 <rtems_timer_server_fire_when+0xdc>
2016274: b0 10 20 09 mov 9, %i0
return RTEMS_INVALID_ADDRESS;
if ( !_TOD_Validate( wall_time ) )
2016278: 90 10 00 19 mov %i1, %o0
201627c: 7f ff f3 d5 call 20131d0 <_TOD_Validate>
2016280: b0 10 20 14 mov 0x14, %i0
2016284: 80 8a 20 ff btst 0xff, %o0
2016288: 02 80 00 24 be 2016318 <rtems_timer_server_fire_when+0xdc>
201628c: 01 00 00 00 nop
return RTEMS_INVALID_CLOCK;
seconds = _TOD_To_seconds( wall_time );
2016290: 7f ff f3 9c call 2013100 <_TOD_To_seconds>
2016294: 90 10 00 19 mov %i1, %o0
if ( seconds <= _TOD_Seconds_since_epoch() )
2016298: 21 00 80 f6 sethi %hi(0x203d800), %l0
201629c: c2 04 23 bc ld [ %l0 + 0x3bc ], %g1 ! 203dbbc <_TOD_Now>
20162a0: 80 a2 00 01 cmp %o0, %g1
20162a4: 08 80 00 1d bleu 2016318 <rtems_timer_server_fire_when+0xdc>
20162a8: b2 10 00 08 mov %o0, %i1
20162ac: 92 10 00 1c mov %i4, %o1
20162b0: 11 00 80 f9 sethi %hi(0x203e400), %o0
20162b4: 94 07 bf fc add %fp, -4, %o2
20162b8: 40 00 0b 56 call 2019010 <_Objects_Get>
20162bc: 90 12 20 b4 or %o0, 0xb4, %o0
return RTEMS_INVALID_CLOCK;
the_timer = _Timer_Get( id, &location );
switch ( location ) {
20162c0: c2 07 bf fc ld [ %fp + -4 ], %g1
20162c4: 80 a0 60 00 cmp %g1, 0
20162c8: 12 80 00 16 bne 2016320 <rtems_timer_server_fire_when+0xe4>
20162cc: b0 10 00 08 mov %o0, %i0
case OBJECTS_LOCAL:
(void) _Watchdog_Remove( &the_timer->Ticker );
20162d0: 40 00 14 24 call 201b360 <_Watchdog_Remove>
20162d4: 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();
20162d8: c4 04 23 bc ld [ %l0 + 0x3bc ], %g2
(*timer_server->schedule_operation)( timer_server, the_timer );
20162dc: c2 07 60 04 ld [ %i5 + 4 ], %g1
20162e0: 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();
20162e4: b2 26 40 02 sub %i1, %g2, %i1
(*timer_server->schedule_operation)( timer_server, the_timer );
20162e8: 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;
20162ec: 84 10 20 03 mov 3, %g2
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20162f0: f4 26 20 2c st %i2, [ %i0 + 0x2c ]
20162f4: c4 26 20 38 st %g2, [ %i0 + 0x38 ]
the_watchdog->id = id;
20162f8: f8 26 20 30 st %i4, [ %i0 + 0x30 ]
the_watchdog->user_data = user_data;
20162fc: 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();
2016300: f2 26 20 1c st %i1, [ %i0 + 0x1c ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2016304: c0 26 20 18 clr [ %i0 + 0x18 ]
(*timer_server->schedule_operation)( timer_server, the_timer );
2016308: 9f c0 40 00 call %g1
201630c: b0 10 20 00 clr %i0
_Thread_Enable_dispatch();
2016310: 40 00 0f 37 call 2019fec <_Thread_Enable_dispatch>
2016314: 01 00 00 00 nop
return RTEMS_SUCCESSFUL;
2016318: 81 c7 e0 08 ret
201631c: 81 e8 00 00 restore
case OBJECTS_ERROR:
break;
}
return RTEMS_INVALID_ID;
}
2016320: 81 c7 e0 08 ret
2016324: 91 e8 20 04 restore %g0, 4, %o0
02006d04 <sched_get_priority_max>:
#include <rtems/posix/priority.h>
int sched_get_priority_max(
int policy
)
{
2006d04: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
2006d08: 80 a6 20 04 cmp %i0, 4
2006d0c: 08 80 00 08 bleu 2006d2c <sched_get_priority_max+0x28>
2006d10: 82 10 20 01 mov 1, %g1
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
2006d14: 40 00 25 4c call 2010244 <__errno>
2006d18: b0 10 3f ff mov -1, %i0
2006d1c: 82 10 20 16 mov 0x16, %g1
2006d20: c2 22 00 00 st %g1, [ %o0 ]
2006d24: 81 c7 e0 08 ret
2006d28: 81 e8 00 00 restore
int sched_get_priority_max(
int policy
)
{
switch ( policy ) {
2006d2c: b1 28 40 18 sll %g1, %i0, %i0
2006d30: 80 8e 20 17 btst 0x17, %i0
2006d34: 02 bf ff f8 be 2006d14 <sched_get_priority_max+0x10> <== NEVER TAKEN
2006d38: 03 00 80 75 sethi %hi(0x201d400), %g1
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MAXIMUM_PRIORITY;
2006d3c: f0 08 62 ec ldub [ %g1 + 0x2ec ], %i0 ! 201d6ec <rtems_maximum_priority>
}
2006d40: 81 c7 e0 08 ret
2006d44: 91 ee 3f ff restore %i0, -1, %o0
02006d48 <sched_get_priority_min>:
#include <rtems/posix/priority.h>
int sched_get_priority_min(
int policy
)
{
2006d48: 9d e3 bf a0 save %sp, -96, %sp
switch ( policy ) {
2006d4c: 80 a6 20 04 cmp %i0, 4
2006d50: 08 80 00 09 bleu 2006d74 <sched_get_priority_min+0x2c>
2006d54: 84 10 20 01 mov 1, %g2
case SCHED_RR:
case SCHED_SPORADIC:
break;
default:
rtems_set_errno_and_return_minus_one( EINVAL );
2006d58: 40 00 25 3b call 2010244 <__errno>
2006d5c: 01 00 00 00 nop
2006d60: 82 10 3f ff mov -1, %g1 ! ffffffff <RAM_END+0xfdbfffff>
2006d64: 84 10 20 16 mov 0x16, %g2
2006d68: c4 22 00 00 st %g2, [ %o0 ]
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2006d6c: 81 c7 e0 08 ret
2006d70: 91 e8 00 01 restore %g0, %g1, %o0
int sched_get_priority_min(
int policy
)
{
switch ( policy ) {
2006d74: b1 28 80 18 sll %g2, %i0, %i0
2006d78: 80 8e 20 17 btst 0x17, %i0
2006d7c: 02 bf ff f7 be 2006d58 <sched_get_priority_min+0x10> <== NEVER TAKEN
2006d80: 82 10 20 01 mov 1, %g1
default:
rtems_set_errno_and_return_minus_one( EINVAL );
}
return POSIX_SCHEDULER_MINIMUM_PRIORITY;
}
2006d84: 81 c7 e0 08 ret
2006d88: 91 e8 00 01 restore %g0, %g1, %o0
02006d8c <sched_rr_get_interval>:
int sched_rr_get_interval(
pid_t pid,
struct timespec *interval
)
{
2006d8c: 9d e3 bf a0 save %sp, -96, %sp
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
2006d90: 80 a6 20 00 cmp %i0, 0
2006d94: 12 80 00 0a bne 2006dbc <sched_rr_get_interval+0x30> <== ALWAYS TAKEN
2006d98: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
if ( !interval )
2006d9c: 02 80 00 13 be 2006de8 <sched_rr_get_interval+0x5c>
2006da0: 03 00 80 78 sethi %hi(0x201e000), %g1
rtems_set_errno_and_return_minus_one( EINVAL );
_Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval );
2006da4: d0 00 63 34 ld [ %g1 + 0x334 ], %o0 ! 201e334 <_Thread_Ticks_per_timeslice>
2006da8: 92 10 00 19 mov %i1, %o1
2006dac: 40 00 0f 62 call 200ab34 <_Timespec_From_ticks>
2006db0: b0 10 20 00 clr %i0
return 0;
}
2006db4: 81 c7 e0 08 ret
2006db8: 81 e8 00 00 restore
{
/*
* Only supported for the "calling process" (i.e. this node).
*/
if ( pid && pid != getpid() )
2006dbc: 7f ff f1 63 call 2003348 <getpid>
2006dc0: 01 00 00 00 nop
2006dc4: 80 a2 00 18 cmp %o0, %i0
2006dc8: 02 bf ff f5 be 2006d9c <sched_rr_get_interval+0x10>
2006dcc: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( ESRCH );
2006dd0: 40 00 25 1d call 2010244 <__errno>
2006dd4: b0 10 3f ff mov -1, %i0
2006dd8: 82 10 20 03 mov 3, %g1
2006ddc: c2 22 00 00 st %g1, [ %o0 ]
2006de0: 81 c7 e0 08 ret
2006de4: 81 e8 00 00 restore
if ( !interval )
rtems_set_errno_and_return_minus_one( EINVAL );
2006de8: 40 00 25 17 call 2010244 <__errno>
2006dec: b0 10 3f ff mov -1, %i0
2006df0: 82 10 20 16 mov 0x16, %g1
2006df4: c2 22 00 00 st %g1, [ %o0 ]
2006df8: 81 c7 e0 08 ret
2006dfc: 81 e8 00 00 restore
020097f4 <sem_open>:
int oflag,
...
/* mode_t mode, */
/* unsigned int value */
)
{
20097f4: 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++;
20097f8: 03 00 80 8d sethi %hi(0x2023400), %g1
20097fc: c4 00 61 10 ld [ %g1 + 0x110 ], %g2 ! 2023510 <_Thread_Dispatch_disable_level>
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
va_start(arg, oflag);
2009800: f4 27 a0 4c st %i2, [ %fp + 0x4c ]
2009804: 84 00 a0 01 inc %g2
2009808: c4 20 61 10 st %g2, [ %g1 + 0x110 ]
return _Thread_Dispatch_disable_level;
200980c: c2 00 61 10 ld [ %g1 + 0x110 ], %g1
2009810: f6 27 a0 50 st %i3, [ %fp + 0x50 ]
2009814: f8 27 a0 54 st %i4, [ %fp + 0x54 ]
2009818: fa 27 a0 58 st %i5, [ %fp + 0x58 ]
POSIX_Semaphore_Control *the_semaphore;
Objects_Locations location;
_Thread_Disable_dispatch();
if ( oflag & O_CREAT ) {
200981c: b8 8e 62 00 andcc %i1, 0x200, %i4
2009820: 12 80 00 25 bne 20098b4 <sem_open+0xc0>
2009824: 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 );
2009828: 90 10 00 18 mov %i0, %o0
200982c: 40 00 1c 04 call 201083c <_POSIX_Semaphore_Name_to_id>
2009830: 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 ) {
2009834: b6 92 20 00 orcc %o0, 0, %i3
2009838: 22 80 00 0e be,a 2009870 <sem_open+0x7c>
200983c: 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) ) ) {
2009840: 80 a6 e0 02 cmp %i3, 2
2009844: 12 80 00 04 bne 2009854 <sem_open+0x60> <== NEVER TAKEN
2009848: 80 a7 20 00 cmp %i4, 0
200984c: 12 80 00 1e bne 20098c4 <sem_open+0xd0>
2009850: 94 10 00 1d mov %i5, %o2
_Thread_Enable_dispatch();
2009854: 40 00 0c b4 call 200cb24 <_Thread_Enable_dispatch>
2009858: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( status, sem_t * );
200985c: 40 00 28 90 call 2013a9c <__errno>
2009860: 01 00 00 00 nop
2009864: f6 22 00 00 st %i3, [ %o0 ]
2009868: 81 c7 e0 08 ret
200986c: 81 e8 00 00 restore
/*
* Check for existence with creation.
*/
if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) {
2009870: 80 a6 6a 00 cmp %i1, 0xa00
2009874: 02 80 00 20 be 20098f4 <sem_open+0x100>
2009878: d2 07 bf f4 ld [ %fp + -12 ], %o1
200987c: 94 07 bf fc add %fp, -4, %o2
2009880: 11 00 80 8d sethi %hi(0x2023400), %o0
2009884: 40 00 08 be call 200bb7c <_Objects_Get>
2009888: 90 12 23 d0 or %o0, 0x3d0, %o0 ! 20237d0 <_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;
200988c: 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 );
2009890: d0 27 bf f8 st %o0, [ %fp + -8 ]
the_semaphore->open_count += 1;
2009894: 82 00 60 01 inc %g1
_Thread_Enable_dispatch();
2009898: 40 00 0c a3 call 200cb24 <_Thread_Enable_dispatch>
200989c: c2 22 20 18 st %g1, [ %o0 + 0x18 ]
_Thread_Enable_dispatch();
20098a0: 40 00 0c a1 call 200cb24 <_Thread_Enable_dispatch>
20098a4: 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;
20098a8: f0 07 bf f8 ld [ %fp + -8 ], %i0
}
20098ac: 81 c7 e0 08 ret
20098b0: 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 );
20098b4: 82 07 a0 54 add %fp, 0x54, %g1
20098b8: fa 07 a0 50 ld [ %fp + 0x50 ], %i5
20098bc: 10 bf ff db b 2009828 <sem_open+0x34>
20098c0: 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(
20098c4: 92 10 20 00 clr %o1
20098c8: 96 07 bf f8 add %fp, -8, %o3
20098cc: 40 00 1b 80 call 20106cc <_POSIX_Semaphore_Create_support>
20098d0: 90 10 00 18 mov %i0, %o0
/*
* errno was set by Create_support, so don't set it again.
*/
_Thread_Enable_dispatch();
20098d4: 40 00 0c 94 call 200cb24 <_Thread_Enable_dispatch>
20098d8: ba 10 00 08 mov %o0, %i5
if ( status == -1 )
20098dc: 80 a7 7f ff cmp %i5, -1
20098e0: 02 bf ff e2 be 2009868 <sem_open+0x74>
20098e4: 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;
20098e8: f0 07 bf f8 ld [ %fp + -8 ], %i0
20098ec: 81 c7 e0 08 ret
20098f0: 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();
20098f4: 40 00 0c 8c call 200cb24 <_Thread_Enable_dispatch>
20098f8: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * );
20098fc: 40 00 28 68 call 2013a9c <__errno>
2009900: 01 00 00 00 nop
2009904: 82 10 20 11 mov 0x11, %g1 ! 11 <PROM_START+0x11>
2009908: c2 22 00 00 st %g1, [ %o0 ]
200990c: 81 c7 e0 08 ret
2009910: 81 e8 00 00 restore
02009970 <sem_timedwait>:
int sem_timedwait(
sem_t *sem,
const struct timespec *abstime
)
{
2009970: 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 );
2009974: 90 10 00 19 mov %i1, %o0
2009978: 40 00 18 ee call 200fd30 <_POSIX_Absolute_timeout_to_ticks>
200997c: 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 );
2009980: 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 )
2009984: 80 a2 20 03 cmp %o0, 3
2009988: 02 80 00 06 be 20099a0 <sem_timedwait+0x30> <== ALWAYS TAKEN
200998c: 90 10 00 18 mov %i0, %o0
do_wait = false;
lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks );
2009990: 40 00 1b cd call 20108c4 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED
2009994: 92 10 20 00 clr %o1 <== NOT EXECUTED
2009998: 81 c7 e0 08 ret <== NOT EXECUTED
200999c: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED
20099a0: 40 00 1b c9 call 20108c4 <_POSIX_Semaphore_Wait_support>
20099a4: 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;
}
20099a8: 81 c7 e0 08 ret
20099ac: 91 e8 00 08 restore %g0, %o0, %o0
02006c7c <sigaction>:
int sigaction(
int sig,
const struct sigaction *act,
struct sigaction *oact
)
{
2006c7c: 9d e3 bf a0 save %sp, -96, %sp
ISR_Level level;
if ( oact )
2006c80: 80 a6 a0 00 cmp %i2, 0
2006c84: 02 80 00 0d be 2006cb8 <sigaction+0x3c>
2006c88: 87 2e 20 02 sll %i0, 2, %g3
*oact = _POSIX_signals_Vectors[ sig ];
2006c8c: 05 00 80 7e sethi %hi(0x201f800), %g2
2006c90: 83 2e 20 04 sll %i0, 4, %g1
2006c94: 84 10 a1 f0 or %g2, 0x1f0, %g2
2006c98: 82 20 40 03 sub %g1, %g3, %g1
2006c9c: c6 00 80 01 ld [ %g2 + %g1 ], %g3
2006ca0: 82 00 80 01 add %g2, %g1, %g1
2006ca4: c6 26 80 00 st %g3, [ %i2 ]
2006ca8: c4 00 60 04 ld [ %g1 + 4 ], %g2
2006cac: c4 26 a0 04 st %g2, [ %i2 + 4 ]
2006cb0: c2 00 60 08 ld [ %g1 + 8 ], %g1
2006cb4: c2 26 a0 08 st %g1, [ %i2 + 8 ]
if ( !sig )
2006cb8: 80 a6 20 00 cmp %i0, 0
2006cbc: 02 80 00 33 be 2006d88 <sigaction+0x10c>
2006cc0: 01 00 00 00 nop
static inline bool is_valid_signo(
int signo
)
{
return ((signo) >= 1 && (signo) <= 32 );
2006cc4: 82 06 3f ff add %i0, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(sig) )
2006cc8: 80 a0 60 1f cmp %g1, 0x1f
2006ccc: 18 80 00 2f bgu 2006d88 <sigaction+0x10c>
2006cd0: 80 a6 20 09 cmp %i0, 9
*
* NOTE: Solaris documentation claims to "silently enforce" this which
* contradicts the POSIX specification.
*/
if ( sig == SIGKILL )
2006cd4: 02 80 00 2d be 2006d88 <sigaction+0x10c>
2006cd8: 80 a6 60 00 cmp %i1, 0
/*
* Evaluate the new action structure and set the global signal vector
* appropriately.
*/
if ( act ) {
2006cdc: 02 80 00 1a be 2006d44 <sigaction+0xc8> <== NEVER TAKEN
2006ce0: 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 );
2006ce4: 7f ff ee 30 call 20025a4 <sparc_disable_interrupts>
2006ce8: 01 00 00 00 nop
2006cec: b4 10 00 08 mov %o0, %i2
if ( act->sa_handler == SIG_DFL ) {
2006cf0: c2 06 60 08 ld [ %i1 + 8 ], %g1
2006cf4: 80 a0 60 00 cmp %g1, 0
2006cf8: 02 80 00 15 be 2006d4c <sigaction+0xd0>
2006cfc: 83 2e 20 02 sll %i0, 2, %g1
_POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ];
} else {
_POSIX_signals_Clear_process_signals( sig );
2006d00: 40 00 19 dc call 200d470 <_POSIX_signals_Clear_process_signals>
2006d04: 90 10 00 18 mov %i0, %o0
_POSIX_signals_Vectors[ sig ] = *act;
2006d08: c4 06 40 00 ld [ %i1 ], %g2
2006d0c: 87 2e 20 02 sll %i0, 2, %g3
2006d10: 03 00 80 7e sethi %hi(0x201f800), %g1
2006d14: b1 2e 20 04 sll %i0, 4, %i0
2006d18: 82 10 61 f0 or %g1, 0x1f0, %g1
2006d1c: b0 26 00 03 sub %i0, %g3, %i0
2006d20: c4 20 40 18 st %g2, [ %g1 + %i0 ]
2006d24: c4 06 60 04 ld [ %i1 + 4 ], %g2
2006d28: b0 00 40 18 add %g1, %i0, %i0
2006d2c: c4 26 20 04 st %g2, [ %i0 + 4 ]
2006d30: c2 06 60 08 ld [ %i1 + 8 ], %g1
2006d34: c2 26 20 08 st %g1, [ %i0 + 8 ]
}
_ISR_Enable( level );
2006d38: 7f ff ee 1f call 20025b4 <sparc_enable_interrupts>
2006d3c: 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;
2006d40: 82 10 20 00 clr %g1
}
2006d44: 81 c7 e0 08 ret
2006d48: 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 ];
2006d4c: b1 2e 20 04 sll %i0, 4, %i0
2006d50: b0 26 00 01 sub %i0, %g1, %i0
2006d54: 03 00 80 77 sethi %hi(0x201dc00), %g1
2006d58: 82 10 60 9c or %g1, 0x9c, %g1 ! 201dc9c <_POSIX_signals_Default_vectors>
2006d5c: c8 00 40 18 ld [ %g1 + %i0 ], %g4
2006d60: 82 00 40 18 add %g1, %i0, %g1
2006d64: c6 00 60 04 ld [ %g1 + 4 ], %g3
2006d68: c4 00 60 08 ld [ %g1 + 8 ], %g2
2006d6c: 03 00 80 7e sethi %hi(0x201f800), %g1
2006d70: 82 10 61 f0 or %g1, 0x1f0, %g1 ! 201f9f0 <_POSIX_signals_Vectors>
2006d74: c8 20 40 18 st %g4, [ %g1 + %i0 ]
2006d78: b0 00 40 18 add %g1, %i0, %i0
2006d7c: c6 26 20 04 st %g3, [ %i0 + 4 ]
2006d80: 10 bf ff ee b 2006d38 <sigaction+0xbc>
2006d84: 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 );
2006d88: 40 00 26 5a call 20106f0 <__errno>
2006d8c: 01 00 00 00 nop
2006d90: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
2006d94: 82 10 3f ff mov -1, %g1
2006d98: 10 bf ff eb b 2006d44 <sigaction+0xc8>
2006d9c: c4 22 00 00 st %g2, [ %o0 ]
02007164 <sigtimedwait>:
int sigtimedwait(
const sigset_t *set,
siginfo_t *info,
const struct timespec *timeout
)
{
2007164: 9d e3 bf 90 save %sp, -112, %sp
ISR_Level level;
/*
* Error check parameters before disabling interrupts.
*/
if ( !set )
2007168: ba 96 20 00 orcc %i0, 0, %i5
200716c: 02 80 00 84 be 200737c <sigtimedwait+0x218>
2007170: 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 ) {
2007174: 02 80 00 5c be 20072e4 <sigtimedwait+0x180>
2007178: 80 a6 60 00 cmp %i1, 0
if ( !_Timespec_Is_valid( timeout ) )
200717c: 40 00 0f 8b call 200afa8 <_Timespec_Is_valid>
2007180: 90 10 00 1a mov %i2, %o0
2007184: 80 8a 20 ff btst 0xff, %o0
2007188: 02 80 00 7d be 200737c <sigtimedwait+0x218>
200718c: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
interval = _Timespec_To_ticks( timeout );
2007190: 40 00 0f ab call 200b03c <_Timespec_To_ticks>
2007194: 90 10 00 1a mov %i2, %o0
if ( !interval )
2007198: a0 92 20 00 orcc %o0, 0, %l0
200719c: 02 80 00 78 be 200737c <sigtimedwait+0x218> <== NEVER TAKEN
20071a0: 80 a6 60 00 cmp %i1, 0
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
20071a4: 02 80 00 53 be 20072f0 <sigtimedwait+0x18c> <== NEVER TAKEN
20071a8: 39 00 80 80 sethi %hi(0x2020000), %i4
the_thread = _Thread_Executing;
20071ac: 39 00 80 80 sethi %hi(0x2020000), %i4
20071b0: b8 17 22 08 or %i4, 0x208, %i4 ! 2020208 <_Per_CPU_Information>
20071b4: f0 07 20 0c ld [ %i4 + 0xc ], %i0
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
20071b8: 7f ff ed d6 call 2002910 <sparc_disable_interrupts>
20071bc: f4 06 21 5c ld [ %i0 + 0x15c ], %i2
20071c0: b6 10 00 08 mov %o0, %i3
if ( *set & api->signals_pending ) {
20071c4: c2 07 40 00 ld [ %i5 ], %g1
20071c8: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2
20071cc: 80 88 40 02 btst %g1, %g2
20071d0: 12 80 00 53 bne 200731c <sigtimedwait+0x1b8>
20071d4: 01 00 00 00 nop
return the_info->si_signo;
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
20071d8: 05 00 80 81 sethi %hi(0x2020400), %g2
20071dc: c4 00 a0 54 ld [ %g2 + 0x54 ], %g2 ! 2020454 <_POSIX_signals_Pending>
20071e0: 80 88 40 02 btst %g1, %g2
20071e4: 12 80 00 2f bne 20072a0 <sigtimedwait+0x13c>
20071e8: 03 00 80 7f sethi %hi(0x201fc00), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
20071ec: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201fcd0 <_Thread_Dispatch_disable_level>
the_info->si_code = SI_USER;
the_info->si_value.sival_int = 0;
return signo;
}
the_info->si_signo = -1;
20071f0: 86 10 3f ff mov -1, %g3
20071f4: c6 26 40 00 st %g3, [ %i1 ]
20071f8: 84 00 a0 01 inc %g2
20071fc: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ]
return _Thread_Dispatch_disable_level;
2007200: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
the_thread->Wait.return_code = EINTR;
2007204: 82 10 20 04 mov 4, %g1
2007208: c2 26 20 34 st %g1, [ %i0 + 0x34 ]
the_thread->Wait.option = *set;
200720c: c2 07 40 00 ld [ %i5 ], %g1
the_thread->Wait.return_argument = the_info;
2007210: 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;
2007214: 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;
2007218: b6 10 20 01 mov 1, %i3
}
the_info->si_signo = -1;
_Thread_Disable_dispatch();
the_thread->Wait.queue = &_POSIX_signals_Wait_queue;
200721c: 23 00 80 80 sethi %hi(0x2020000), %l1
2007220: a2 14 63 ec or %l1, 0x3ec, %l1 ! 20203ec <_POSIX_signals_Wait_queue>
2007224: e2 26 20 44 st %l1, [ %i0 + 0x44 ]
2007228: 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 );
200722c: 7f ff ed bd call 2002920 <sparc_enable_interrupts>
2007230: 01 00 00 00 nop
_Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval );
2007234: 90 10 00 11 mov %l1, %o0
2007238: 92 10 00 10 mov %l0, %o1
200723c: 15 00 80 2b sethi %hi(0x200ac00), %o2
2007240: 40 00 0d bc call 200a930 <_Thread_queue_Enqueue_with_handler>
2007244: 94 12 a1 10 or %o2, 0x110, %o2 ! 200ad10 <_Thread_queue_Timeout>
_Thread_Enable_dispatch();
2007248: 40 00 0c 70 call 200a408 <_Thread_Enable_dispatch>
200724c: 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 );
2007250: d2 06 40 00 ld [ %i1 ], %o1
2007254: 90 10 00 1a mov %i2, %o0
2007258: 94 10 00 19 mov %i1, %o2
200725c: 96 10 20 00 clr %o3
2007260: 40 00 1a 98 call 200dcc0 <_POSIX_signals_Clear_signals>
2007264: 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)
2007268: c2 07 20 0c ld [ %i4 + 0xc ], %g1
200726c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
2007270: 80 a0 60 04 cmp %g1, 4
2007274: 12 80 00 3b bne 2007360 <sigtimedwait+0x1fc>
2007278: 01 00 00 00 nop
|| !(*set & signo_to_mask( the_info->si_signo )) ) {
200727c: f0 06 40 00 ld [ %i1 ], %i0
2007280: c2 07 40 00 ld [ %i5 ], %g1
2007284: 84 06 3f ff add %i0, -1, %g2
2007288: b7 2e c0 02 sll %i3, %g2, %i3
200728c: 80 8e c0 01 btst %i3, %g1
2007290: 02 80 00 34 be 2007360 <sigtimedwait+0x1fc>
2007294: 01 00 00 00 nop
errno = _Thread_Executing->Wait.return_code;
return -1;
}
return the_info->si_signo;
}
2007298: 81 c7 e0 08 ret
200729c: 81 e8 00 00 restore
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
20072a0: 7f ff ff 99 call 2007104 <_POSIX_signals_Get_lowest>
20072a4: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
20072a8: 94 10 00 19 mov %i1, %o2
}
/* Process pending signals? */
if ( *set & _POSIX_signals_Pending ) {
signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending );
20072ac: b0 10 00 08 mov %o0, %i0
_POSIX_signals_Clear_signals( api, signo, the_info, true, false );
20072b0: 96 10 20 01 mov 1, %o3
20072b4: 90 10 00 1a mov %i2, %o0
20072b8: 92 10 00 18 mov %i0, %o1
20072bc: 40 00 1a 81 call 200dcc0 <_POSIX_signals_Clear_signals>
20072c0: 98 10 20 00 clr %o4
_ISR_Enable( level );
20072c4: 7f ff ed 97 call 2002920 <sparc_enable_interrupts>
20072c8: 90 10 00 1b mov %i3, %o0
the_info->si_signo = signo;
the_info->si_code = SI_USER;
20072cc: 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;
20072d0: f0 26 40 00 st %i0, [ %i1 ]
the_info->si_code = SI_USER;
20072d4: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
20072d8: c0 26 60 08 clr [ %i1 + 8 ]
return signo;
20072dc: 81 c7 e0 08 ret
20072e0: 81 e8 00 00 restore
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
20072e4: 12 bf ff b2 bne 20071ac <sigtimedwait+0x48>
20072e8: a0 10 20 00 clr %l0
the_thread = _Thread_Executing;
20072ec: 39 00 80 80 sethi %hi(0x2020000), %i4
20072f0: b8 17 22 08 or %i4, 0x208, %i4 ! 2020208 <_Per_CPU_Information>
20072f4: f0 07 20 0c ld [ %i4 + 0xc ], %i0
/*
* Initialize local variables.
*/
the_info = ( info ) ? info : &signal_information;
20072f8: b2 07 bf f4 add %fp, -12, %i1
* What if they are already pending?
*/
/* API signals pending? */
_ISR_Disable( level );
20072fc: 7f ff ed 85 call 2002910 <sparc_disable_interrupts>
2007300: f4 06 21 5c ld [ %i0 + 0x15c ], %i2
2007304: b6 10 00 08 mov %o0, %i3
if ( *set & api->signals_pending ) {
2007308: c2 07 40 00 ld [ %i5 ], %g1
200730c: c4 06 a0 d4 ld [ %i2 + 0xd4 ], %g2
2007310: 80 88 40 02 btst %g1, %g2
2007314: 22 bf ff b2 be,a 20071dc <sigtimedwait+0x78>
2007318: 05 00 80 81 sethi %hi(0x2020400), %g2
/* XXX real info later */
the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending );
200731c: 7f ff ff 7a call 2007104 <_POSIX_signals_Get_lowest>
2007320: 90 10 00 02 mov %g2, %o0
_POSIX_signals_Clear_signals(
2007324: 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 );
2007328: 92 10 00 08 mov %o0, %o1
200732c: d0 26 40 00 st %o0, [ %i1 ]
_POSIX_signals_Clear_signals(
2007330: 96 10 20 00 clr %o3
2007334: 90 10 00 1a mov %i2, %o0
2007338: 40 00 1a 62 call 200dcc0 <_POSIX_signals_Clear_signals>
200733c: 98 10 20 00 clr %o4
the_info->si_signo,
the_info,
false,
false
);
_ISR_Enable( level );
2007340: 7f ff ed 78 call 2002920 <sparc_enable_interrupts>
2007344: 90 10 00 1b mov %i3, %o0
the_info->si_code = SI_USER;
2007348: 82 10 20 01 mov 1, %g1
the_info->si_value.sival_int = 0;
200734c: c0 26 60 08 clr [ %i1 + 8 ]
false,
false
);
_ISR_Enable( level );
the_info->si_code = SI_USER;
2007350: c2 26 60 04 st %g1, [ %i1 + 4 ]
the_info->si_value.sival_int = 0;
return the_info->si_signo;
2007354: f0 06 40 00 ld [ %i1 ], %i0
2007358: 81 c7 e0 08 ret
200735c: 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;
2007360: 40 00 26 c5 call 2010e74 <__errno>
2007364: b0 10 3f ff mov -1, %i0
2007368: c2 07 20 0c ld [ %i4 + 0xc ], %g1
200736c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1
2007370: c2 22 00 00 st %g1, [ %o0 ]
return -1;
}
return the_info->si_signo;
}
2007374: 81 c7 e0 08 ret
2007378: 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 );
200737c: 40 00 26 be call 2010e74 <__errno>
2007380: b0 10 3f ff mov -1, %i0
2007384: 82 10 20 16 mov 0x16, %g1
2007388: c2 22 00 00 st %g1, [ %o0 ]
200738c: 81 c7 e0 08 ret
2007390: 81 e8 00 00 restore
02008fc8 <sigwait>:
int sigwait(
const sigset_t *set,
int *sig
)
{
2008fc8: 9d e3 bf a0 save %sp, -96, %sp
int status;
status = sigtimedwait( set, NULL, NULL );
2008fcc: 92 10 20 00 clr %o1
2008fd0: 90 10 00 18 mov %i0, %o0
2008fd4: 7f ff ff 6d call 2008d88 <sigtimedwait>
2008fd8: 94 10 20 00 clr %o2
if ( status != -1 ) {
2008fdc: 80 a2 3f ff cmp %o0, -1
2008fe0: 02 80 00 07 be 2008ffc <sigwait+0x34>
2008fe4: 80 a6 60 00 cmp %i1, 0
if ( sig )
2008fe8: 02 80 00 03 be 2008ff4 <sigwait+0x2c> <== NEVER TAKEN
2008fec: b0 10 20 00 clr %i0
*sig = status;
2008ff0: d0 26 40 00 st %o0, [ %i1 ]
2008ff4: 81 c7 e0 08 ret
2008ff8: 81 e8 00 00 restore
return 0;
}
return errno;
2008ffc: 40 00 25 eb call 20127a8 <__errno>
2009000: 01 00 00 00 nop
2009004: f0 02 00 00 ld [ %o0 ], %i0
}
2009008: 81 c7 e0 08 ret
200900c: 81 e8 00 00 restore
02005f80 <sysconf>:
*/
long sysconf(
int name
)
{
2005f80: 9d e3 bf a0 save %sp, -96, %sp
if ( name == _SC_CLK_TCK )
2005f84: 80 a6 20 02 cmp %i0, 2
2005f88: 02 80 00 10 be 2005fc8 <sysconf+0x48>
2005f8c: 03 00 80 5c sethi %hi(0x2017000), %g1
return (TOD_MICROSECONDS_PER_SECOND /
rtems_configuration_get_microseconds_per_tick());
if ( name == _SC_OPEN_MAX )
2005f90: 80 a6 20 04 cmp %i0, 4
2005f94: 02 80 00 0b be 2005fc0 <sysconf+0x40>
2005f98: c2 00 63 04 ld [ %g1 + 0x304 ], %g1
return rtems_libio_number_iops;
if ( name == _SC_GETPW_R_SIZE_MAX )
2005f9c: 80 a6 20 33 cmp %i0, 0x33
2005fa0: 02 80 00 08 be 2005fc0 <sysconf+0x40>
2005fa4: 82 10 24 00 mov 0x400, %g1
return 1024;
if ( name == _SC_PAGESIZE )
2005fa8: 80 a6 20 08 cmp %i0, 8
2005fac: 02 80 00 05 be 2005fc0 <sysconf+0x40>
2005fb0: 03 00 00 04 sethi %hi(0x1000), %g1
return PAGE_SIZE;
#if defined(__sparc__)
if ( name == 515 ) /* Solaris _SC_STACK_PROT */
2005fb4: 80 a6 22 03 cmp %i0, 0x203
2005fb8: 12 80 00 0c bne 2005fe8 <sysconf+0x68> <== ALWAYS TAKEN
2005fbc: 82 10 20 00 clr %g1
return 0;
#endif
rtems_set_errno_and_return_minus_one( EINVAL );
}
2005fc0: 81 c7 e0 08 ret
2005fc4: 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());
2005fc8: 03 00 80 5c sethi %hi(0x2017000), %g1
long sysconf(
int name
)
{
if ( name == _SC_CLK_TCK )
return (TOD_MICROSECONDS_PER_SECOND /
2005fcc: d2 00 61 c8 ld [ %g1 + 0x1c8 ], %o1 ! 20171c8 <Configuration+0xc>
2005fd0: 11 00 03 d0 sethi %hi(0xf4000), %o0
2005fd4: 40 00 35 b5 call 20136a8 <.udiv>
2005fd8: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 <PROM_START+0xf4240>
2005fdc: 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 );
}
2005fe0: 81 c7 e0 08 ret
2005fe4: 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 );
2005fe8: 40 00 26 76 call 200f9c0 <__errno>
2005fec: 01 00 00 00 nop
2005ff0: 84 10 20 16 mov 0x16, %g2 ! 16 <PROM_START+0x16>
2005ff4: 82 10 3f ff mov -1, %g1
2005ff8: 10 bf ff f2 b 2005fc0 <sysconf+0x40>
2005ffc: c4 22 00 00 st %g2, [ %o0 ]
02006334 <timer_create>:
int timer_create(
clockid_t clock_id,
struct sigevent *evp,
timer_t *timerid
)
{
2006334: 9d e3 bf a0 save %sp, -96, %sp
POSIX_Timer_Control *ptimer;
if ( clock_id != CLOCK_REALTIME )
2006338: 80 a6 20 01 cmp %i0, 1
200633c: 12 80 00 3e bne 2006434 <timer_create+0x100>
2006340: 80 a6 a0 00 cmp %i2, 0
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !timerid )
2006344: 02 80 00 3c be 2006434 <timer_create+0x100>
2006348: 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) {
200634c: 02 80 00 0e be 2006384 <timer_create+0x50>
2006350: 03 00 80 78 sethi %hi(0x201e000), %g1
/* The structure has data */
if ( ( evp->sigev_notify != SIGEV_NONE ) &&
2006354: c2 06 40 00 ld [ %i1 ], %g1
2006358: 82 00 7f ff add %g1, -1, %g1
200635c: 80 a0 60 01 cmp %g1, 1
2006360: 18 80 00 35 bgu 2006434 <timer_create+0x100> <== NEVER TAKEN
2006364: 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 )
2006368: c2 06 60 04 ld [ %i1 + 4 ], %g1
200636c: 80 a0 60 00 cmp %g1, 0
2006370: 02 80 00 31 be 2006434 <timer_create+0x100> <== NEVER TAKEN
2006374: 82 00 7f ff add %g1, -1, %g1
rtems_set_errno_and_return_minus_one( EINVAL );
if ( !is_valid_signo(evp->sigev_signo) )
2006378: 80 a0 60 1f cmp %g1, 0x1f
200637c: 18 80 00 2e bgu 2006434 <timer_create+0x100> <== NEVER TAKEN
2006380: 03 00 80 78 sethi %hi(0x201e000), %g1
*
* This rountine increments the thread dispatch level
*/
RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void)
{
_Thread_Dispatch_disable_level++;
2006384: c4 00 63 f0 ld [ %g1 + 0x3f0 ], %g2 ! 201e3f0 <_Thread_Dispatch_disable_level>
2006388: 84 00 a0 01 inc %g2
200638c: c4 20 63 f0 st %g2, [ %g1 + 0x3f0 ]
return _Thread_Dispatch_disable_level;
2006390: c2 00 63 f0 ld [ %g1 + 0x3f0 ], %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 );
2006394: 3b 00 80 79 sethi %hi(0x201e400), %i5
2006398: 40 00 08 4c call 20084c8 <_Objects_Allocate>
200639c: 90 17 62 f0 or %i5, 0x2f0, %o0 ! 201e6f0 <_POSIX_Timer_Information>
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
20063a0: 80 a2 20 00 cmp %o0, 0
20063a4: 02 80 00 2a be 200644c <timer_create+0x118>
20063a8: 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;
20063ac: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ]
ptimer->thread_id = _Thread_Executing->Object.id;
20063b0: 03 00 80 7a sethi %hi(0x201e800), %g1
20063b4: c2 00 61 34 ld [ %g1 + 0x134 ], %g1 ! 201e934 <_Per_CPU_Information+0xc>
if ( evp != NULL ) {
20063b8: 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;
20063bc: c2 00 60 08 ld [ %g1 + 8 ], %g1
if ( evp != NULL ) {
20063c0: 02 80 00 08 be 20063e0 <timer_create+0xac>
20063c4: c2 22 20 38 st %g1, [ %o0 + 0x38 ]
ptimer->inf.sigev_notify = evp->sigev_notify;
20063c8: c6 06 40 00 ld [ %i1 ], %g3
ptimer->inf.sigev_signo = evp->sigev_signo;
20063cc: c4 06 60 04 ld [ %i1 + 4 ], %g2
ptimer->inf.sigev_value = evp->sigev_value;
20063d0: 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;
20063d4: c6 22 20 40 st %g3, [ %o0 + 0x40 ]
ptimer->inf.sigev_signo = evp->sigev_signo;
20063d8: c4 22 20 44 st %g2, [ %o0 + 0x44 ]
ptimer->inf.sigev_value = evp->sigev_value;
20063dc: c2 22 20 48 st %g1, [ %o0 + 0x48 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
20063e0: 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;
}
20063e4: ba 17 62 f0 or %i5, 0x2f0, %i5
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
20063e8: 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;
20063ec: c0 22 20 68 clr [ %o0 + 0x68 ]
ptimer->timer_data.it_value.tv_sec = 0;
20063f0: c0 22 20 5c clr [ %o0 + 0x5c ]
ptimer->timer_data.it_value.tv_nsec = 0;
20063f4: c0 22 20 60 clr [ %o0 + 0x60 ]
ptimer->timer_data.it_interval.tv_sec = 0;
20063f8: c0 22 20 54 clr [ %o0 + 0x54 ]
ptimer->timer_data.it_interval.tv_nsec = 0;
20063fc: c0 22 20 58 clr [ %o0 + 0x58 ]
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
2006400: c0 22 20 18 clr [ %o0 + 0x18 ]
the_watchdog->routine = routine;
2006404: c0 22 20 2c clr [ %o0 + 0x2c ]
the_watchdog->id = id;
2006408: c0 22 20 30 clr [ %o0 + 0x30 ]
the_watchdog->user_data = user_data;
200640c: c0 22 20 34 clr [ %o0 + 0x34 ]
Objects_Information *information,
Objects_Control *the_object,
uint32_t name
)
{
_Objects_Set_local_object(
2006410: c2 02 20 08 ld [ %o0 + 8 ], %g1
#if defined(RTEMS_DEBUG)
if ( index > information->maximum )
return;
#endif
information->local_table[ index ] = the_object;
2006414: 85 28 a0 02 sll %g2, 2, %g2
2006418: 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;
200641c: 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;
2006420: c2 26 80 00 st %g1, [ %i2 ]
_Thread_Enable_dispatch();
2006424: 40 00 0d 3f call 2009920 <_Thread_Enable_dispatch>
2006428: b0 10 20 00 clr %i0
return 0;
}
200642c: 81 c7 e0 08 ret
2006430: 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 );
2006434: 40 00 27 8b call 2010260 <__errno>
2006438: b0 10 3f ff mov -1, %i0
200643c: 82 10 20 16 mov 0x16, %g1
2006440: c2 22 00 00 st %g1, [ %o0 ]
2006444: 81 c7 e0 08 ret
2006448: 81 e8 00 00 restore
/*
* Allocate a timer
*/
ptimer = _POSIX_Timer_Allocate();
if ( !ptimer ) {
_Thread_Enable_dispatch();
200644c: 40 00 0d 35 call 2009920 <_Thread_Enable_dispatch>
2006450: b0 10 3f ff mov -1, %i0
rtems_set_errno_and_return_minus_one( EAGAIN );
2006454: 40 00 27 83 call 2010260 <__errno>
2006458: 01 00 00 00 nop
200645c: 82 10 20 0b mov 0xb, %g1 ! b <PROM_START+0xb>
2006460: c2 22 00 00 st %g1, [ %o0 ]
2006464: 81 c7 e0 08 ret
2006468: 81 e8 00 00 restore
0200646c <timer_settime>:
timer_t timerid,
int flags,
const struct itimerspec *value,
struct itimerspec *ovalue
)
{
200646c: 9d e3 bf 80 save %sp, -128, %sp
Objects_Locations location;
bool activated;
uint32_t initial_period;
struct itimerspec normalize;
if ( !value )
2006470: 80 a6 a0 00 cmp %i2, 0
2006474: 02 80 00 88 be 2006694 <timer_settime+0x228> <== NEVER TAKEN
2006478: 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) ) ) {
200647c: 40 00 10 23 call 200a508 <_Timespec_Is_valid>
2006480: 90 06 a0 08 add %i2, 8, %o0
2006484: 80 8a 20 ff btst 0xff, %o0
2006488: 02 80 00 83 be 2006694 <timer_settime+0x228>
200648c: 01 00 00 00 nop
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( !_Timespec_Is_valid( &(value->it_interval) ) ) {
2006490: 40 00 10 1e call 200a508 <_Timespec_Is_valid>
2006494: 90 10 00 1a mov %i2, %o0
2006498: 80 8a 20 ff btst 0xff, %o0
200649c: 02 80 00 7e be 2006694 <timer_settime+0x228> <== NEVER TAKEN
20064a0: 80 a6 60 00 cmp %i1, 0
rtems_set_errno_and_return_minus_one( EINVAL );
}
if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) {
20064a4: 12 80 00 7a bne 200668c <timer_settime+0x220>
20064a8: 80 a6 60 04 cmp %i1, 4
rtems_set_errno_and_return_minus_one( EINVAL );
}
normalize = *value;
20064ac: c8 06 80 00 ld [ %i2 ], %g4
20064b0: c6 06 a0 04 ld [ %i2 + 4 ], %g3
20064b4: c4 06 a0 08 ld [ %i2 + 8 ], %g2
20064b8: c2 06 a0 0c ld [ %i2 + 0xc ], %g1
20064bc: c8 27 bf e4 st %g4, [ %fp + -28 ]
20064c0: c6 27 bf e8 st %g3, [ %fp + -24 ]
20064c4: c4 27 bf ec st %g2, [ %fp + -20 ]
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
20064c8: 80 a6 60 04 cmp %i1, 4
20064cc: 02 80 00 3b be 20065b8 <timer_settime+0x14c>
20064d0: 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 *)
20064d4: 92 10 00 18 mov %i0, %o1
20064d8: 11 00 80 79 sethi %hi(0x201e400), %o0
20064dc: 94 07 bf fc add %fp, -4, %o2
20064e0: 40 00 09 45 call 20089f4 <_Objects_Get>
20064e4: 90 12 22 f0 or %o0, 0x2f0, %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 ) {
20064e8: c2 07 bf fc ld [ %fp + -4 ], %g1
20064ec: 80 a0 60 00 cmp %g1, 0
20064f0: 12 80 00 46 bne 2006608 <timer_settime+0x19c> <== NEVER TAKEN
20064f4: 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 ) {
20064f8: c2 07 bf ec ld [ %fp + -20 ], %g1
20064fc: 80 a0 60 00 cmp %g1, 0
2006500: 12 80 00 05 bne 2006514 <timer_settime+0xa8>
2006504: c2 07 bf f0 ld [ %fp + -16 ], %g1
2006508: 80 a0 60 00 cmp %g1, 0
200650c: 02 80 00 45 be 2006620 <timer_settime+0x1b4>
2006510: 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 );
2006514: 40 00 10 22 call 200a59c <_Timespec_To_ticks>
2006518: 90 10 00 1a mov %i2, %o0
200651c: d0 27 60 64 st %o0, [ %i5 + 0x64 ]
initial_period = _Timespec_To_ticks( &normalize.it_value );
2006520: 40 00 10 1f call 200a59c <_Timespec_To_ticks>
2006524: 90 07 bf ec add %fp, -20, %o0
activated = _POSIX_Timer_Insert_helper(
2006528: 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 );
200652c: 92 10 00 08 mov %o0, %o1
activated = _POSIX_Timer_Insert_helper(
2006530: 98 10 00 1d mov %i5, %o4
2006534: 90 07 60 10 add %i5, 0x10, %o0
2006538: 17 00 80 19 sethi %hi(0x2006400), %o3
200653c: 40 00 1b bf call 200d438 <_POSIX_Timer_Insert_helper>
2006540: 96 12 e2 ac or %o3, 0x2ac, %o3 ! 20066ac <_POSIX_Timer_TSR>
initial_period,
ptimer->Object.id,
_POSIX_Timer_TSR,
ptimer
);
if ( !activated ) {
2006544: 80 8a 20 ff btst 0xff, %o0
2006548: 02 80 00 18 be 20065a8 <timer_settime+0x13c>
200654c: 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 )
2006550: 02 80 00 0b be 200657c <timer_settime+0x110>
2006554: c2 07 bf e4 ld [ %fp + -28 ], %g1
*ovalue = ptimer->timer_data;
2006558: c2 07 60 54 ld [ %i5 + 0x54 ], %g1
200655c: c2 26 c0 00 st %g1, [ %i3 ]
2006560: c2 07 60 58 ld [ %i5 + 0x58 ], %g1
2006564: c2 26 e0 04 st %g1, [ %i3 + 4 ]
2006568: c2 07 60 5c ld [ %i5 + 0x5c ], %g1
200656c: c2 26 e0 08 st %g1, [ %i3 + 8 ]
2006570: c2 07 60 60 ld [ %i5 + 0x60 ], %g1
2006574: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
ptimer->timer_data = normalize;
2006578: 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 );
200657c: 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;
2006580: c2 27 60 54 st %g1, [ %i5 + 0x54 ]
2006584: c2 07 bf e8 ld [ %fp + -24 ], %g1
2006588: c2 27 60 58 st %g1, [ %i5 + 0x58 ]
200658c: c2 07 bf ec ld [ %fp + -20 ], %g1
2006590: c2 27 60 5c st %g1, [ %i5 + 0x5c ]
2006594: c2 07 bf f0 ld [ %fp + -16 ], %g1
2006598: c2 27 60 60 st %g1, [ %i5 + 0x60 ]
/* Indicate that the time is running */
ptimer->state = POSIX_TIMER_STATE_CREATE_RUN;
200659c: 82 10 20 03 mov 3, %g1
_TOD_Get( &ptimer->time );
20065a0: 40 00 06 40 call 2007ea0 <_TOD_Get>
20065a4: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ]
_Thread_Enable_dispatch();
20065a8: 40 00 0c de call 2009920 <_Thread_Enable_dispatch>
20065ac: b0 10 20 00 clr %i0
return 0;
20065b0: 81 c7 e0 08 ret
20065b4: 81 e8 00 00 restore
normalize = *value;
/* Convert absolute to relative time */
if (flags == TIMER_ABSTIME) {
struct timespec now;
_TOD_Get( &now );
20065b8: 40 00 06 3a call 2007ea0 <_TOD_Get>
20065bc: 90 07 bf f4 add %fp, -12, %o0
/* Check for seconds in the past */
if ( _Timespec_Greater_than( &now, &normalize.it_value ) )
20065c0: 90 07 bf f4 add %fp, -12, %o0
20065c4: 40 00 0f bf call 200a4c0 <_Timespec_Greater_than>
20065c8: 92 07 bf ec add %fp, -20, %o1
20065cc: 80 8a 20 ff btst 0xff, %o0
20065d0: 12 80 00 31 bne 2006694 <timer_settime+0x228>
20065d4: 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 );
20065d8: 90 07 bf f4 add %fp, -12, %o0
20065dc: 40 00 0f dc call 200a54c <_Timespec_Subtract>
20065e0: 94 10 00 09 mov %o1, %o2
20065e4: 92 10 00 18 mov %i0, %o1
20065e8: 11 00 80 79 sethi %hi(0x201e400), %o0
20065ec: 94 07 bf fc add %fp, -4, %o2
20065f0: 40 00 09 01 call 20089f4 <_Objects_Get>
20065f4: 90 12 22 f0 or %o0, 0x2f0, %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 ) {
20065f8: c2 07 bf fc ld [ %fp + -4 ], %g1
20065fc: 80 a0 60 00 cmp %g1, 0
2006600: 02 bf ff be be 20064f8 <timer_settime+0x8c>
2006604: ba 10 00 08 mov %o0, %i5
#endif
case OBJECTS_ERROR:
break;
}
rtems_set_errno_and_return_minus_one( EINVAL );
2006608: 40 00 27 16 call 2010260 <__errno>
200660c: b0 10 3f ff mov -1, %i0
2006610: 82 10 20 16 mov 0x16, %g1
2006614: c2 22 00 00 st %g1, [ %o0 ]
}
2006618: 81 c7 e0 08 ret
200661c: 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 );
2006620: 40 00 11 21 call 200aaa4 <_Watchdog_Remove>
2006624: 90 02 20 10 add %o0, 0x10, %o0
/* The old data of the timer are returned */
if ( ovalue )
2006628: 80 a6 e0 00 cmp %i3, 0
200662c: 02 80 00 0b be 2006658 <timer_settime+0x1ec>
2006630: c2 07 bf e4 ld [ %fp + -28 ], %g1
*ovalue = ptimer->timer_data;
2006634: c2 07 60 54 ld [ %i5 + 0x54 ], %g1
2006638: c2 26 c0 00 st %g1, [ %i3 ]
200663c: c2 07 60 58 ld [ %i5 + 0x58 ], %g1
2006640: c2 26 e0 04 st %g1, [ %i3 + 4 ]
2006644: c2 07 60 5c ld [ %i5 + 0x5c ], %g1
2006648: c2 26 e0 08 st %g1, [ %i3 + 8 ]
200664c: c2 07 60 60 ld [ %i5 + 0x60 ], %g1
2006650: c2 26 e0 0c st %g1, [ %i3 + 0xc ]
/* The new data are set */
ptimer->timer_data = normalize;
2006654: 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;
2006658: 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;
200665c: c2 27 60 54 st %g1, [ %i5 + 0x54 ]
2006660: c2 07 bf e8 ld [ %fp + -24 ], %g1
2006664: c2 27 60 58 st %g1, [ %i5 + 0x58 ]
2006668: c2 07 bf ec ld [ %fp + -20 ], %g1
200666c: c2 27 60 5c st %g1, [ %i5 + 0x5c ]
2006670: c2 07 bf f0 ld [ %fp + -16 ], %g1
2006674: c2 27 60 60 st %g1, [ %i5 + 0x60 ]
/* Indicates that the timer is created and stopped */
ptimer->state = POSIX_TIMER_STATE_CREATE_STOP;
2006678: 82 10 20 04 mov 4, %g1
/* Returns with success */
_Thread_Enable_dispatch();
200667c: 40 00 0c a9 call 2009920 <_Thread_Enable_dispatch>
2006680: c2 2f 60 3c stb %g1, [ %i5 + 0x3c ]
return 0;
2006684: 81 c7 e0 08 ret
2006688: 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 ) {
200668c: 22 bf ff 89 be,a 20064b0 <timer_settime+0x44>
2006690: 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 );
2006694: 40 00 26 f3 call 2010260 <__errno>
2006698: b0 10 3f ff mov -1, %i0
200669c: 82 10 20 16 mov 0x16, %g1
20066a0: c2 22 00 00 st %g1, [ %o0 ]
20066a4: 81 c7 e0 08 ret
20066a8: 81 e8 00 00 restore
02006308 <ualarm>:
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
2006308: 9d e3 bf 98 save %sp, -104, %sp
/*
* Initialize the timer used to implement alarm().
*/
if ( !the_timer->routine ) {
200630c: 3b 00 80 66 sethi %hi(0x2019800), %i5
2006310: ba 17 60 08 or %i5, 8, %i5 ! 2019808 <_POSIX_signals_Ualarm_timer>
2006314: c2 07 60 1c ld [ %i5 + 0x1c ], %g1
2006318: 80 a0 60 00 cmp %g1, 0
200631c: 02 80 00 24 be 20063ac <ualarm+0xa4>
2006320: 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 );
2006324: 40 00 10 d4 call 200a674 <_Watchdog_Remove>
2006328: 90 10 00 1d mov %i5, %o0
if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) {
200632c: 90 02 3f fe add %o0, -2, %o0
2006330: 80 a2 20 01 cmp %o0, 1
2006334: 08 80 00 26 bleu 20063cc <ualarm+0xc4> <== ALWAYS TAKEN
2006338: 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 ) {
200633c: 80 a7 20 00 cmp %i4, 0
2006340: 02 80 00 19 be 20063a4 <ualarm+0x9c>
2006344: 37 00 03 d0 sethi %hi(0xf4000), %i3
Watchdog_Interval ticks;
tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND;
2006348: 90 10 00 1c mov %i4, %o0
200634c: 40 00 3a 1c call 2014bbc <.udiv>
2006350: 92 16 e2 40 or %i3, 0x240, %o1
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
2006354: 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;
2006358: d0 27 bf f8 st %o0, [ %fp + -8 ]
tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000;
200635c: 40 00 3a c4 call 2014e6c <.urem>
2006360: 90 10 00 1c mov %i4, %o0
2006364: 87 2a 20 07 sll %o0, 7, %g3
2006368: 82 10 00 08 mov %o0, %g1
200636c: 85 2a 20 02 sll %o0, 2, %g2
2006370: 84 20 c0 02 sub %g3, %g2, %g2
2006374: 82 00 80 01 add %g2, %g1, %g1
2006378: 83 28 60 03 sll %g1, 3, %g1
ticks = _Timespec_To_ticks( &tp );
200637c: 90 07 bf f8 add %fp, -8, %o0
2006380: 40 00 0f 4c call 200a0b0 <_Timespec_To_ticks>
2006384: c2 27 bf fc st %g1, [ %fp + -4 ]
if ( ticks == 0 )
ticks = 1;
_Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) );
2006388: 40 00 0f 4a call 200a0b0 <_Timespec_To_ticks>
200638c: 90 07 bf f8 add %fp, -8, %o0
)
{
the_watchdog->initial = units;
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006390: 92 10 00 1d mov %i5, %o1
Watchdog_Control *the_watchdog,
Watchdog_Interval units
)
{
the_watchdog->initial = units;
2006394: d0 27 60 0c st %o0, [ %i5 + 0xc ]
_Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog );
2006398: 11 00 80 63 sethi %hi(0x2018c00), %o0
200639c: 40 00 10 54 call 200a4ec <_Watchdog_Insert>
20063a0: 90 12 23 bc or %o0, 0x3bc, %o0 ! 2018fbc <_Watchdog_Ticks_chain>
}
return remaining;
}
20063a4: 81 c7 e0 08 ret
20063a8: 81 e8 00 00 restore
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20063ac: 03 00 80 18 sethi %hi(0x2006000), %g1
Watchdog_Service_routine_entry routine,
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
20063b0: c0 27 60 08 clr [ %i5 + 8 ]
the_watchdog->routine = routine;
20063b4: 82 10 62 dc or %g1, 0x2dc, %g1
the_watchdog->id = id;
20063b8: c0 27 60 20 clr [ %i5 + 0x20 ]
Objects_Id id,
void *user_data
)
{
the_watchdog->state = WATCHDOG_INACTIVE;
the_watchdog->routine = routine;
20063bc: c2 27 60 1c st %g1, [ %i5 + 0x1c ]
the_watchdog->id = id;
the_watchdog->user_data = user_data;
20063c0: c0 27 60 24 clr [ %i5 + 0x24 ]
useconds_t ualarm(
useconds_t useconds,
useconds_t interval
)
{
useconds_t remaining = 0;
20063c4: 10 bf ff de b 200633c <ualarm+0x34>
20063c8: 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);
20063cc: c4 07 60 0c ld [ %i5 + 0xc ], %g2
20063d0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1
20063d4: d0 07 60 14 ld [ %i5 + 0x14 ], %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
20063d8: 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);
20063dc: 90 02 00 02 add %o0, %g2, %o0
/* remaining is now in ticks */
_Timespec_From_ticks( ticks, &tp );
20063e0: 40 00 0f 0b call 200a00c <_Timespec_From_ticks>
20063e4: 90 22 00 01 sub %o0, %g1, %o0
remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND;
20063e8: c2 07 bf f8 ld [ %fp + -8 ], %g1
remaining += tp.tv_nsec / 1000;
20063ec: 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;
20063f0: 85 28 60 03 sll %g1, 3, %g2
20063f4: 87 28 60 08 sll %g1, 8, %g3
20063f8: 84 20 c0 02 sub %g3, %g2, %g2
remaining += tp.tv_nsec / 1000;
20063fc: 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;
2006400: b1 28 a0 06 sll %g2, 6, %i0
2006404: b0 26 00 02 sub %i0, %g2, %i0
remaining += tp.tv_nsec / 1000;
2006408: 40 00 39 ef call 2014bc4 <.div>
200640c: 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;
2006410: b1 2e 20 06 sll %i0, 6, %i0
remaining += tp.tv_nsec / 1000;
2006414: 10 bf ff ca b 200633c <ualarm+0x34>
2006418: b0 02 00 18 add %o0, %i0, %i0