=============================================================================== 02008758 <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2008758: 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; 200875c: 39 00 80 7a sethi %hi(0x201e800), %i4 2008760: fa 07 22 b4 ld [ %i4 + 0x2b4 ], %i5 ! 201eab4 <_API_extensions_List> 2008764: b8 17 22 b4 or %i4, 0x2b4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2008768: b8 07 20 04 add %i4, 4, %i4 200876c: 80 a7 40 1c cmp %i5, %i4 2008770: 02 80 00 09 be 2008794 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2008774: 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)(); 2008778: c2 07 60 08 ld [ %i5 + 8 ], %g1 200877c: 9f c0 40 00 call %g1 2008780: 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 ) { 2008784: 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 ); 2008788: 80 a7 40 1c cmp %i5, %i4 200878c: 32 bf ff fc bne,a 200877c <_API_extensions_Run_postdriver+0x24> 2008790: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008794: 81 c7 e0 08 ret 2008798: 81 e8 00 00 restore =============================================================================== 0200879c <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 200879c: 9d e3 bf a0 save %sp, -96, %sp 20087a0: 39 00 80 7a sethi %hi(0x201e800), %i4 20087a4: fa 07 22 b4 ld [ %i4 + 0x2b4 ], %i5 ! 201eab4 <_API_extensions_List> 20087a8: 37 00 80 7b sethi %hi(0x201ec00), %i3 20087ac: b8 17 22 b4 or %i4, 0x2b4, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20087b0: b8 07 20 04 add %i4, 4, %i4 20087b4: 80 a7 40 1c cmp %i5, %i4 20087b8: 02 80 00 09 be 20087dc <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 20087bc: b6 16 e2 00 or %i3, 0x200, %i3 !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 20087c0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20087c4: 9f c0 40 00 call %g1 20087c8: 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 ) { 20087cc: 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 ); 20087d0: 80 a7 40 1c cmp %i5, %i4 20087d4: 32 bf ff fc bne,a 20087c4 <_API_extensions_Run_postswitch+0x28> 20087d8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20087dc: 81 c7 e0 08 ret 20087e0: 81 e8 00 00 restore =============================================================================== 0200ae4c <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200ae4c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 200ae50: 03 00 80 87 sethi %hi(0x2021c00), %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 ); 200ae54: 7f ff e3 2e call 2003b0c 200ae58: fa 00 62 2c ld [ %g1 + 0x22c ], %i5 ! 2021e2c <_Per_CPU_Information+0xc> 200ae5c: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 200ae60: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200ae64: 80 a0 60 00 cmp %g1, 0 200ae68: 02 80 00 2b be 200af14 <_CORE_RWLock_Release+0xc8> 200ae6c: 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 ) { 200ae70: 22 80 00 22 be,a 200aef8 <_CORE_RWLock_Release+0xac> 200ae74: 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; 200ae78: 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; 200ae7c: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200ae80: 7f ff e3 27 call 2003b1c 200ae84: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 200ae88: 40 00 08 0a call 200ceb0 <_Thread_queue_Dequeue> 200ae8c: 90 10 00 18 mov %i0, %o0 if ( next ) { 200ae90: 80 a2 20 00 cmp %o0, 0 200ae94: 22 80 00 24 be,a 200af24 <_CORE_RWLock_Release+0xd8> 200ae98: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200ae9c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200aea0: 80 a0 60 01 cmp %g1, 1 200aea4: 02 80 00 22 be 200af2c <_CORE_RWLock_Release+0xe0> 200aea8: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200aeac: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200aeb0: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200aeb4: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200aeb8: 10 80 00 09 b 200aedc <_CORE_RWLock_Release+0x90> 200aebc: 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 || 200aec0: 80 a0 60 01 cmp %g1, 1 200aec4: 02 80 00 0b be 200aef0 <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 200aec8: 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; 200aecc: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200aed0: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200aed4: 40 00 09 07 call 200d2f0 <_Thread_queue_Extract> 200aed8: 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 ); 200aedc: 40 00 09 56 call 200d434 <_Thread_queue_First> 200aee0: 90 10 00 18 mov %i0, %o0 if ( !next || 200aee4: 92 92 20 00 orcc %o0, 0, %o1 200aee8: 32 bf ff f6 bne,a 200aec0 <_CORE_RWLock_Release+0x74> 200aeec: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200aef0: 81 c7 e0 08 ret 200aef4: 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; 200aef8: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200aefc: 80 a0 60 00 cmp %g1, 0 200af00: 02 bf ff de be 200ae78 <_CORE_RWLock_Release+0x2c> 200af04: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 200af08: 7f ff e3 05 call 2003b1c 200af0c: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 200af10: 30 80 00 05 b,a 200af24 <_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 ); 200af14: 7f ff e3 02 call 2003b1c 200af18: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200af1c: 82 10 20 02 mov 2, %g1 200af20: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200af24: 81 c7 e0 08 ret 200af28: 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; 200af2c: 82 10 20 02 mov 2, %g1 200af30: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200af34: 81 c7 e0 08 ret 200af38: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200af3c <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200af3c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200af40: 90 10 00 18 mov %i0, %o0 200af44: 40 00 07 00 call 200cb44 <_Thread_Get> 200af48: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200af4c: c2 07 bf fc ld [ %fp + -4 ], %g1 200af50: 80 a0 60 00 cmp %g1, 0 200af54: 12 80 00 09 bne 200af78 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 200af58: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200af5c: 40 00 09 77 call 200d538 <_Thread_queue_Process_timeout> 200af60: 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--; 200af64: 03 00 80 86 sethi %hi(0x2021800), %g1 200af68: c4 00 60 f0 ld [ %g1 + 0xf0 ], %g2 ! 20218f0 <_Thread_Dispatch_disable_level> 200af6c: 84 00 bf ff add %g2, -1, %g2 200af70: c4 20 60 f0 st %g2, [ %g1 + 0xf0 ] return _Thread_Dispatch_disable_level; 200af74: c2 00 60 f0 ld [ %g1 + 0xf0 ], %g1 200af78: 81 c7 e0 08 ret 200af7c: 81 e8 00 00 restore =============================================================================== 02011dc4 <_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 ) { 2011dc4: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; the_message_queue->number_of_pending_messages = 0; 2011dc8: c0 26 20 48 clr [ %i0 + 0x48 ] ) { size_t message_buffering_required = 0; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 2011dcc: 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; 2011dd0: 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; 2011dd4: c0 26 20 60 clr [ %i0 + 0x60 ] /* * 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)) { 2011dd8: 80 8e e0 03 btst 3, %i3 2011ddc: 02 80 00 0b be 2011e08 <_CORE_message_queue_Initialize+0x44> 2011de0: c0 26 20 64 clr [ %i0 + 0x64 ] allocated_message_size += sizeof(uint32_t); 2011de4: 96 06 e0 04 add %i3, 4, %o3 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2011de8: 96 0a ff fc and %o3, -4, %o3 } if (allocated_message_size < maximum_message_size) 2011dec: 80 a6 c0 0b cmp %i3, %o3 2011df0: 08 80 00 08 bleu 2011e10 <_CORE_message_queue_Initialize+0x4c><== ALWAYS TAKEN 2011df4: ba 02 e0 14 add %o3, 0x14, %i5 return false; 2011df8: b0 10 20 00 clr %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011dfc: b0 0e 20 01 and %i0, 1, %i0 2011e00: 81 c7 e0 08 ret 2011e04: 81 e8 00 00 restore /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2011e08: 96 10 00 1b mov %i3, %o3 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2011e0c: ba 02 e0 14 add %o3, 0x14, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2011e10: 90 10 20 00 clr %o0 2011e14: 92 10 00 1a mov %i2, %o1 2011e18: 94 10 20 00 clr %o2 2011e1c: 40 00 45 77 call 20233f8 <__muldi3> 2011e20: 96 10 00 1d mov %i5, %o3 if ( x > SIZE_MAX ) 2011e24: 80 a2 20 00 cmp %o0, 0 2011e28: 34 bf ff f5 bg,a 2011dfc <_CORE_message_queue_Initialize+0x38> 2011e2c: b0 10 20 00 clr %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2011e30: 40 00 0c e5 call 20151c4 <_Workspace_Allocate> 2011e34: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2011e38: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2011e3c: 80 a2 20 00 cmp %o0, 0 2011e40: 02 bf ff ee be 2011df8 <_CORE_message_queue_Initialize+0x34> 2011e44: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2011e48: 90 06 20 68 add %i0, 0x68, %o0 2011e4c: 94 10 00 1a mov %i2, %o2 2011e50: 7f ff ff c4 call 2011d60 <_Chain_Initialize> 2011e54: 96 10 00 1d mov %i5, %o3 */ RTEMS_INLINE_ROUTINE bool _CORE_message_queue_Is_priority( CORE_message_queue_Attributes *the_attribute ) { return 2011e58: 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 ); 2011e5c: 82 06 20 50 add %i0, 0x50, %g1 2011e60: 84 18 a0 01 xor %g2, 1, %g2 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2011e64: 80 a0 00 02 cmp %g0, %g2 2011e68: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2011e6c: 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; 2011e70: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2011e74: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2011e78: c0 26 20 54 clr [ %i0 + 0x54 ] 2011e7c: 92 60 3f ff subx %g0, -1, %o1 2011e80: 94 10 20 80 mov 0x80, %o2 2011e84: 96 10 20 06 mov 6, %o3 2011e88: 40 00 0a 7a call 2014870 <_Thread_queue_Initialize> 2011e8c: b0 10 20 01 mov 1, %i0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011e90: b0 0e 20 01 and %i0, 1, %i0 2011e94: 81 c7 e0 08 ret 2011e98: 81 e8 00 00 restore =============================================================================== 02008b04 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2008b04: 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 ) 2008b08: 3b 00 80 7a sethi %hi(0x201e800), %i5 2008b0c: c2 07 60 d0 ld [ %i5 + 0xd0 ], %g1 ! 201e8d0 <_Thread_Dispatch_disable_level> 2008b10: 80 a0 60 00 cmp %g1, 0 2008b14: 02 80 00 20 be 2008b94 <_CORE_mutex_Seize+0x90> 2008b18: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 2008b1c: 80 a6 a0 00 cmp %i2, 0 2008b20: 02 80 00 2d be 2008bd4 <_CORE_mutex_Seize+0xd0> 2008b24: 90 10 00 18 mov %i0, %o0 2008b28: 03 00 80 7a sethi %hi(0x201e800), %g1 2008b2c: c2 00 62 10 ld [ %g1 + 0x210 ], %g1 ! 201ea10 <_System_state_Current> 2008b30: 80 a0 60 01 cmp %g1, 1 2008b34: 38 80 00 2f bgu,a 2008bf0 <_CORE_mutex_Seize+0xec> 2008b38: 90 10 20 00 clr %o0 2008b3c: 40 00 14 ff call 200df38 <_CORE_mutex_Seize_interrupt_trylock> 2008b40: 92 07 a0 54 add %fp, 0x54, %o1 2008b44: 80 a2 20 00 cmp %o0, 0 2008b48: 02 80 00 28 be 2008be8 <_CORE_mutex_Seize+0xe4> <== ALWAYS TAKEN 2008b4c: 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++; 2008b50: c4 07 60 d0 ld [ %i5 + 0xd0 ], %g2 2008b54: 03 00 80 7b sethi %hi(0x201ec00), %g1 2008b58: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201ee0c <_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; 2008b5c: 86 10 20 01 mov 1, %g3 2008b60: c6 26 20 30 st %g3, [ %i0 + 0x30 ] 2008b64: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2008b68: f2 20 60 20 st %i1, [ %g1 + 0x20 ] 2008b6c: 82 00 a0 01 add %g2, 1, %g1 2008b70: c2 27 60 d0 st %g1, [ %i5 + 0xd0 ] return _Thread_Dispatch_disable_level; 2008b74: c2 07 60 d0 ld [ %i5 + 0xd0 ], %g1 2008b78: 7f ff e6 ff call 2002774 2008b7c: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008b80: 90 10 00 18 mov %i0, %o0 2008b84: 7f ff ff b9 call 2008a68 <_CORE_mutex_Seize_interrupt_blocking> 2008b88: 92 10 00 1b mov %i3, %o1 2008b8c: 81 c7 e0 08 ret 2008b90: 81 e8 00 00 restore 2008b94: 90 10 00 18 mov %i0, %o0 2008b98: 40 00 14 e8 call 200df38 <_CORE_mutex_Seize_interrupt_trylock> 2008b9c: 92 07 a0 54 add %fp, 0x54, %o1 2008ba0: 80 a2 20 00 cmp %o0, 0 2008ba4: 02 bf ff fa be 2008b8c <_CORE_mutex_Seize+0x88> 2008ba8: 80 a6 a0 00 cmp %i2, 0 2008bac: 12 bf ff e9 bne 2008b50 <_CORE_mutex_Seize+0x4c> 2008bb0: 01 00 00 00 nop 2008bb4: 7f ff e6 f0 call 2002774 2008bb8: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 2008bbc: 03 00 80 7b sethi %hi(0x201ec00), %g1 2008bc0: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201ee0c <_Per_CPU_Information+0xc> 2008bc4: 84 10 20 01 mov 1, %g2 2008bc8: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 2008bcc: 81 c7 e0 08 ret 2008bd0: 81 e8 00 00 restore 2008bd4: 40 00 14 d9 call 200df38 <_CORE_mutex_Seize_interrupt_trylock> 2008bd8: 92 07 a0 54 add %fp, 0x54, %o1 2008bdc: 80 a2 20 00 cmp %o0, 0 2008be0: 12 bf ff f5 bne 2008bb4 <_CORE_mutex_Seize+0xb0> <== NEVER TAKEN 2008be4: 01 00 00 00 nop 2008be8: 81 c7 e0 08 ret 2008bec: 81 e8 00 00 restore 2008bf0: 92 10 20 00 clr %o1 2008bf4: 40 00 01 c2 call 20092fc <_Internal_error_Occurred> 2008bf8: 94 10 20 12 mov 0x12, %o2 =============================================================================== 02008d78 <_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 ) { 2008d78: 9d e3 bf a0 save %sp, -96, %sp 2008d7c: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008d80: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008d84: 40 00 07 d0 call 200acc4 <_Thread_queue_Dequeue> 2008d88: 90 10 00 1d mov %i5, %o0 2008d8c: 80 a2 20 00 cmp %o0, 0 2008d90: 02 80 00 04 be 2008da0 <_CORE_semaphore_Surrender+0x28> 2008d94: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2008d98: 81 c7 e0 08 ret 2008d9c: 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 ); 2008da0: 7f ff e6 71 call 2002764 2008da4: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2008da8: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008dac: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008db0: 80 a0 40 02 cmp %g1, %g2 2008db4: 1a 80 00 05 bcc 2008dc8 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2008db8: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008dbc: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008dc0: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008dc4: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2008dc8: 7f ff e6 6b call 2002774 2008dcc: 01 00 00 00 nop } return status; } 2008dd0: 81 c7 e0 08 ret 2008dd4: 81 e8 00 00 restore =============================================================================== 02008934 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 2008934: 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; 2008938: 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 ); 200893c: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 2008940: 80 a6 a0 00 cmp %i2, 0 2008944: 02 80 00 13 be 2008990 <_Chain_Initialize+0x5c> <== NEVER TAKEN 2008948: 92 06 bf ff add %i2, -1, %o1 200894c: 86 10 00 09 mov %o1, %g3 2008950: 82 10 00 19 mov %i1, %g1 2008954: 84 10 00 18 mov %i0, %g2 current->next = next; 2008958: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200895c: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 2008960: 86 00 ff ff add %g3, -1, %g3 2008964: 84 10 00 01 mov %g1, %g2 2008968: 80 a0 ff ff cmp %g3, -1 200896c: 12 bf ff fb bne 2008958 <_Chain_Initialize+0x24> 2008970: 82 00 40 1b add %g1, %i3, %g1 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 2008974: 40 00 42 ee call 201952c <.umul> 2008978: 90 10 00 1b mov %i3, %o0 200897c: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 2008980: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 2008984: d0 26 20 08 st %o0, [ %i0 + 8 ] 2008988: 81 c7 e0 08 ret 200898c: 81 e8 00 00 restore ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 2008990: 10 bf ff fc b 2008980 <_Chain_Initialize+0x4c> <== NOT EXECUTED 2008994: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED =============================================================================== 02007934 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2007934: 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 ]; 2007938: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 200793c: 7f ff eb 8a call 2002764 2007940: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 pending_events = api->pending_events; 2007944: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2007948: 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 ) ) { 200794c: 86 88 40 02 andcc %g1, %g2, %g3 2007950: 02 80 00 39 be 2007a34 <_Event_Surrender+0x100> 2007954: 09 00 80 7b sethi %hi(0x201ec00), %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() && 2007958: 88 11 22 00 or %g4, 0x200, %g4 ! 201ee00 <_Per_CPU_Information> 200795c: f8 01 20 08 ld [ %g4 + 8 ], %i4 2007960: 80 a7 20 00 cmp %i4, 0 2007964: 32 80 00 1c bne,a 20079d4 <_Event_Surrender+0xa0> 2007968: 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); 200796c: 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 ) ) { 2007970: 80 89 21 00 btst 0x100, %g4 2007974: 02 80 00 30 be 2007a34 <_Event_Surrender+0x100> 2007978: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 200797c: 02 80 00 04 be 200798c <_Event_Surrender+0x58> 2007980: 80 8e e0 02 btst 2, %i3 2007984: 02 80 00 2c be 2007a34 <_Event_Surrender+0x100> <== NEVER TAKEN 2007988: 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; 200798c: 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) ); 2007990: 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 ); 2007994: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2007998: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200799c: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 20079a0: 7f ff eb 75 call 2002774 20079a4: 01 00 00 00 nop 20079a8: 7f ff eb 6f call 2002764 20079ac: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 20079b0: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 20079b4: 80 a0 60 02 cmp %g1, 2 20079b8: 02 80 00 21 be 2007a3c <_Event_Surrender+0x108> 20079bc: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 20079c0: 7f ff eb 6d call 2002774 20079c4: 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 ); 20079c8: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 20079cc: 40 00 0a e3 call 200a558 <_Thread_Clear_state> 20079d0: 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() && 20079d4: 80 a6 00 04 cmp %i0, %g4 20079d8: 32 bf ff e6 bne,a 2007970 <_Event_Surrender+0x3c> 20079dc: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 20079e0: 09 00 80 7c sethi %hi(0x201f000), %g4 20079e4: f8 01 22 00 ld [ %g4 + 0x200 ], %i4 ! 201f200 <_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 ) && 20079e8: 80 a7 20 02 cmp %i4, 2 20079ec: 02 80 00 07 be 2007a08 <_Event_Surrender+0xd4> <== NEVER TAKEN 20079f0: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 20079f4: f8 01 22 00 ld [ %g4 + 0x200 ], %i4 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 20079f8: 80 a7 20 01 cmp %i4, 1 20079fc: 32 bf ff dd bne,a 2007970 <_Event_Surrender+0x3c> 2007a00: 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) ) { 2007a04: 80 a0 40 03 cmp %g1, %g3 2007a08: 02 80 00 04 be 2007a18 <_Event_Surrender+0xe4> 2007a0c: 80 8e e0 02 btst 2, %i3 2007a10: 02 80 00 09 be 2007a34 <_Event_Surrender+0x100> <== NEVER TAKEN 2007a14: 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; 2007a18: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2007a1c: 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 ); 2007a20: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 2007a24: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007a28: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2007a2c: 82 10 20 03 mov 3, %g1 2007a30: c2 21 22 00 st %g1, [ %g4 + 0x200 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2007a34: 7f ff eb 50 call 2002774 2007a38: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2007a3c: 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 ); 2007a40: 7f ff eb 4d call 2002774 2007a44: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 2007a48: 40 00 0f 98 call 200b8a8 <_Watchdog_Remove> 2007a4c: 90 06 20 48 add %i0, 0x48, %o0 2007a50: b2 16 63 f8 or %i1, 0x3f8, %i1 2007a54: 40 00 0a c1 call 200a558 <_Thread_Clear_state> 2007a58: 81 e8 00 00 restore =============================================================================== 02007a5c <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2007a5c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2007a60: 90 10 00 18 mov %i0, %o0 2007a64: 40 00 0b bd call 200a958 <_Thread_Get> 2007a68: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2007a6c: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a70: 80 a0 60 00 cmp %g1, 0 2007a74: 12 80 00 16 bne 2007acc <_Event_Timeout+0x70> <== NEVER TAKEN 2007a78: 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 ); 2007a7c: 7f ff eb 3a call 2002764 2007a80: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007a84: 03 00 80 7b sethi %hi(0x201ec00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 2007a88: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201ee0c <_Per_CPU_Information+0xc> 2007a8c: 80 a7 40 01 cmp %i5, %g1 2007a90: 02 80 00 11 be 2007ad4 <_Event_Timeout+0x78> 2007a94: 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; 2007a98: 82 10 20 06 mov 6, %g1 2007a9c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2007aa0: 7f ff eb 35 call 2002774 2007aa4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007aa8: 90 10 00 1d mov %i5, %o0 2007aac: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007ab0: 40 00 0a aa call 200a558 <_Thread_Clear_state> 2007ab4: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 2007ab8: 03 00 80 7a sethi %hi(0x201e800), %g1 2007abc: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e8d0 <_Thread_Dispatch_disable_level> 2007ac0: 84 00 bf ff add %g2, -1, %g2 2007ac4: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 2007ac8: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 2007acc: 81 c7 e0 08 ret 2007ad0: 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 ) 2007ad4: 03 00 80 7c sethi %hi(0x201f000), %g1 2007ad8: c4 00 62 00 ld [ %g1 + 0x200 ], %g2 ! 201f200 <_Event_Sync_state> 2007adc: 80 a0 a0 01 cmp %g2, 1 2007ae0: 32 bf ff ef bne,a 2007a9c <_Event_Timeout+0x40> 2007ae4: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2007ae8: 84 10 20 02 mov 2, %g2 2007aec: c4 20 62 00 st %g2, [ %g1 + 0x200 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2007af0: 10 bf ff eb b 2007a9c <_Event_Timeout+0x40> 2007af4: 82 10 20 06 mov 6, %g1 =============================================================================== 0200e0e4 <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200e0e4: 9d e3 bf 98 save %sp, -104, %sp Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200e0e8: a2 06 60 04 add %i1, 4, %l1 Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200e0ec: a0 10 00 18 mov %i0, %l0 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200e0f0: 80 a6 40 11 cmp %i1, %l1 200e0f4: 18 80 00 85 bgu 200e308 <_Heap_Allocate_aligned_with_boundary+0x224> 200e0f8: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200e0fc: 80 a6 e0 00 cmp %i3, 0 200e100: 12 80 00 7c bne 200e2f0 <_Heap_Allocate_aligned_with_boundary+0x20c> 200e104: 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; 200e108: fa 04 20 08 ld [ %l0 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e10c: 80 a4 00 1d cmp %l0, %i5 200e110: 02 80 00 18 be 200e170 <_Heap_Allocate_aligned_with_boundary+0x8c> 200e114: b8 10 20 00 clr %i4 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e118: ac 10 20 04 mov 4, %l6 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e11c: ae 05 60 07 add %l5, 7, %l7 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e120: ac 25 80 19 sub %l6, %i1, %l6 200e124: 10 80 00 0b b 200e150 <_Heap_Allocate_aligned_with_boundary+0x6c> 200e128: ec 27 bf fc st %l6, [ %fp + -4 ] * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { if ( alignment == 0 ) { 200e12c: 12 80 00 18 bne 200e18c <_Heap_Allocate_aligned_with_boundary+0xa8> 200e130: b0 07 60 08 add %i5, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e134: 80 a6 20 00 cmp %i0, 0 200e138: 12 80 00 4d bne 200e26c <_Heap_Allocate_aligned_with_boundary+0x188><== ALWAYS TAKEN 200e13c: b8 07 20 01 inc %i4 break; } block = block->next; 200e140: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e144: 80 a4 00 1d cmp %l0, %i5 200e148: 22 80 00 0b be,a 200e174 <_Heap_Allocate_aligned_with_boundary+0x90> 200e14c: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 200e150: c2 07 60 04 ld [ %i5 + 4 ], %g1 200e154: 80 a4 40 01 cmp %l1, %g1 200e158: 0a bf ff f5 bcs 200e12c <_Heap_Allocate_aligned_with_boundary+0x48> 200e15c: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200e160: fa 07 60 08 ld [ %i5 + 8 ], %i5 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e164: 80 a4 00 1d cmp %l0, %i5 200e168: 12 bf ff fa bne 200e150 <_Heap_Allocate_aligned_with_boundary+0x6c> 200e16c: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e170: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200e174: 80 a0 40 1c cmp %g1, %i4 200e178: 1a 80 00 03 bcc 200e184 <_Heap_Allocate_aligned_with_boundary+0xa0> 200e17c: b0 10 20 00 clr %i0 stats->max_search = search_count; 200e180: f8 24 20 44 st %i4, [ %l0 + 0x44 ] } return (void *) alloc_begin; 200e184: 81 c7 e0 08 ret 200e188: 81 e8 00 00 restore uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200e18c: e8 04 20 14 ld [ %l0 + 0x14 ], %l4 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e190: a4 08 7f fe and %g1, -2, %l2 uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; uintptr_t alloc_begin = alloc_end - alloc_size; 200e194: c2 07 bf fc ld [ %fp + -4 ], %g1 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200e198: 84 25 c0 14 sub %l7, %l4, %g2 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200e19c: a4 07 40 12 add %i5, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e1a0: 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; 200e1a4: b0 00 40 12 add %g1, %l2, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e1a8: a4 00 80 12 add %g2, %l2, %l2 200e1ac: 40 00 2d c6 call 20198c4 <.urem> 200e1b0: 90 10 00 18 mov %i0, %o0 200e1b4: 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 ) { 200e1b8: 80 a4 80 18 cmp %l2, %i0 200e1bc: 1a 80 00 06 bcc 200e1d4 <_Heap_Allocate_aligned_with_boundary+0xf0> 200e1c0: a6 07 60 08 add %i5, 8, %l3 200e1c4: 90 10 00 12 mov %l2, %o0 200e1c8: 40 00 2d bf call 20198c4 <.urem> 200e1cc: 92 10 00 1a mov %i2, %o1 200e1d0: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200e1d4: 80 a6 e0 00 cmp %i3, 0 200e1d8: 02 80 00 37 be 200e2b4 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200e1dc: 80 a4 c0 18 cmp %l3, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200e1e0: 86 06 00 19 add %i0, %i1, %g3 200e1e4: 92 10 00 1b mov %i3, %o1 200e1e8: 90 10 00 03 mov %g3, %o0 200e1ec: 40 00 2d b6 call 20198c4 <.urem> 200e1f0: c6 27 bf f8 st %g3, [ %fp + -8 ] 200e1f4: c6 07 bf f8 ld [ %fp + -8 ], %g3 200e1f8: 90 20 c0 08 sub %g3, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e1fc: 80 a6 00 08 cmp %i0, %o0 200e200: 1a 80 00 2c bcc 200e2b0 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200e204: a4 04 c0 19 add %l3, %i1, %l2 200e208: 80 a2 00 03 cmp %o0, %g3 200e20c: 2a 80 00 12 bcs,a 200e254 <_Heap_Allocate_aligned_with_boundary+0x170> 200e210: 80 a4 80 08 cmp %l2, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200e214: 10 80 00 28 b 200e2b4 <_Heap_Allocate_aligned_with_boundary+0x1d0> 200e218: 80 a4 c0 18 cmp %l3, %i0 200e21c: 92 10 00 1a mov %i2, %o1 200e220: 40 00 2d a9 call 20198c4 <.urem> 200e224: 90 10 00 18 mov %i0, %o0 200e228: 92 10 00 1b mov %i3, %o1 200e22c: b0 26 00 08 sub %i0, %o0, %i0 if ( boundary_line < boundary_floor ) { return 0; } alloc_begin = boundary_line - alloc_size; alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200e230: ac 06 00 19 add %i0, %i1, %l6 200e234: 40 00 2d a4 call 20198c4 <.urem> 200e238: 90 10 00 16 mov %l6, %o0 200e23c: 90 25 80 08 sub %l6, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e240: 80 a2 00 16 cmp %o0, %l6 200e244: 1a 80 00 1b bcc 200e2b0 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200e248: 80 a6 00 08 cmp %i0, %o0 200e24c: 1a 80 00 19 bcc 200e2b0 <_Heap_Allocate_aligned_with_boundary+0x1cc> 200e250: 80 a4 80 08 cmp %l2, %o0 if ( boundary_line < boundary_floor ) { 200e254: 08 bf ff f2 bleu 200e21c <_Heap_Allocate_aligned_with_boundary+0x138> 200e258: b0 22 00 19 sub %o0, %i1, %i0 return 0; 200e25c: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e260: 80 a6 20 00 cmp %i0, 0 200e264: 02 bf ff b7 be 200e140 <_Heap_Allocate_aligned_with_boundary+0x5c><== ALWAYS TAKEN 200e268: 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; 200e26c: c6 04 20 48 ld [ %l0 + 0x48 ], %g3 stats->searches += search_count; 200e270: c4 04 20 4c ld [ %l0 + 0x4c ], %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e274: 86 00 e0 01 inc %g3 stats->searches += search_count; 200e278: 84 00 80 1c add %g2, %i4, %g2 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e27c: c6 24 20 48 st %g3, [ %l0 + 0x48 ] stats->searches += search_count; 200e280: c4 24 20 4c st %g2, [ %l0 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200e284: 90 10 00 10 mov %l0, %o0 200e288: 92 10 00 1d mov %i5, %o1 200e28c: 94 10 00 18 mov %i0, %o2 200e290: 7f ff eb cf call 20091cc <_Heap_Block_allocate> 200e294: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e298: c2 04 20 44 ld [ %l0 + 0x44 ], %g1 200e29c: 80 a0 40 1c cmp %g1, %i4 200e2a0: 2a bf ff b9 bcs,a 200e184 <_Heap_Allocate_aligned_with_boundary+0xa0> 200e2a4: f8 24 20 44 st %i4, [ %l0 + 0x44 ] stats->max_search = search_count; } return (void *) alloc_begin; } 200e2a8: 81 c7 e0 08 ret 200e2ac: 81 e8 00 00 restore boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200e2b0: 80 a4 c0 18 cmp %l3, %i0 200e2b4: 18 bf ff ea bgu 200e25c <_Heap_Allocate_aligned_with_boundary+0x178> 200e2b8: 82 10 3f f8 mov -8, %g1 200e2bc: 90 10 00 18 mov %i0, %o0 200e2c0: a4 20 40 1d sub %g1, %i5, %l2 200e2c4: 92 10 00 15 mov %l5, %o1 200e2c8: 40 00 2d 7f call 20198c4 <.urem> 200e2cc: 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 ) { 200e2d0: 90 a4 80 08 subcc %l2, %o0, %o0 200e2d4: 02 bf ff 99 be 200e138 <_Heap_Allocate_aligned_with_boundary+0x54> 200e2d8: 80 a6 20 00 cmp %i0, 0 200e2dc: 80 a2 00 14 cmp %o0, %l4 200e2e0: 1a bf ff 96 bcc 200e138 <_Heap_Allocate_aligned_with_boundary+0x54> 200e2e4: 80 a6 20 00 cmp %i0, 0 uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { return 0; 200e2e8: 10 bf ff de b 200e260 <_Heap_Allocate_aligned_with_boundary+0x17c> 200e2ec: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200e2f0: 18 80 00 06 bgu 200e308 <_Heap_Allocate_aligned_with_boundary+0x224> 200e2f4: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200e2f8: 22 bf ff 84 be,a 200e108 <_Heap_Allocate_aligned_with_boundary+0x24> 200e2fc: b4 10 00 15 mov %l5, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200e300: 10 bf ff 83 b 200e10c <_Heap_Allocate_aligned_with_boundary+0x28> 200e304: fa 04 20 08 ld [ %l0 + 8 ], %i5 uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { /* Integer overflow occured */ return NULL; 200e308: 81 c7 e0 08 ret 200e30c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200e328 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200e328: 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; 200e32c: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200e330: 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; 200e334: a0 06 40 1a add %i1, %i2, %l0 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200e338: ee 06 20 20 ld [ %i0 + 0x20 ], %l7 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200e33c: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200e340: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const free_size = stats->free_size; uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200e344: 80 a6 40 10 cmp %i1, %l0 200e348: 08 80 00 06 bleu 200e360 <_Heap_Extend+0x38> 200e34c: e6 06 20 30 ld [ %i0 + 0x30 ], %l3 return false; 200e350: b0 10 20 00 clr %i0 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200e354: b0 0e 20 01 and %i0, 1, %i0 200e358: 81 c7 e0 08 ret 200e35c: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200e360: 90 10 00 19 mov %i1, %o0 200e364: 92 10 00 1a mov %i2, %o1 200e368: 94 10 00 11 mov %l1, %o2 200e36c: 98 07 bf f8 add %fp, -8, %o4 200e370: 7f ff eb 3c call 2009060 <_Heap_Get_first_and_last_block> 200e374: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200e378: 80 8a 20 ff btst 0xff, %o0 200e37c: 02 bf ff f5 be 200e350 <_Heap_Extend+0x28> 200e380: ba 10 00 17 mov %l7, %i5 200e384: aa 10 20 00 clr %l5 200e388: ac 10 20 00 clr %l6 200e38c: a4 10 20 00 clr %l2 200e390: 10 80 00 10 b 200e3d0 <_Heap_Extend+0xa8> 200e394: 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 ) { 200e398: 2a 80 00 02 bcs,a 200e3a0 <_Heap_Extend+0x78> 200e39c: ac 10 00 1d mov %i5, %l6 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e3a0: 80 a7 00 19 cmp %i4, %i1 200e3a4: 22 80 00 1e be,a 200e41c <_Heap_Extend+0xf4> 200e3a8: e0 27 40 00 st %l0, [ %i5 ] start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200e3ac: 80 a6 40 1c cmp %i1, %i4 200e3b0: 38 80 00 02 bgu,a 200e3b8 <_Heap_Extend+0x90> 200e3b4: aa 10 00 08 mov %o0, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e3b8: fa 02 20 04 ld [ %o0 + 4 ], %i5 200e3bc: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e3c0: ba 02 00 1d add %o0, %i5, %i5 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e3c4: 80 a5 c0 1d cmp %l7, %i5 200e3c8: 22 80 00 1c be,a 200e438 <_Heap_Extend+0x110> 200e3cc: 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; 200e3d0: 80 a7 40 17 cmp %i5, %l7 200e3d4: 22 80 00 03 be,a 200e3e0 <_Heap_Extend+0xb8> 200e3d8: f4 06 20 18 ld [ %i0 + 0x18 ], %i2 200e3dc: b4 10 00 1d mov %i5, %i2 uintptr_t const sub_area_end = start_block->prev_size; 200e3e0: f8 07 40 00 ld [ %i5 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e3e4: 92 10 00 11 mov %l1, %o1 200e3e8: 40 00 2d fc call 2019bd8 <.urem> 200e3ec: 90 10 00 1c mov %i4, %o0 200e3f0: 82 07 3f f8 add %i4, -8, %g1 Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200e3f4: 80 a6 80 10 cmp %i2, %l0 200e3f8: 0a 80 00 69 bcs 200e59c <_Heap_Extend+0x274> 200e3fc: 90 20 40 08 sub %g1, %o0, %o0 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200e400: 80 a6 80 10 cmp %i2, %l0 200e404: 12 bf ff e5 bne 200e398 <_Heap_Extend+0x70> 200e408: 80 a4 00 1c cmp %l0, %i4 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e40c: 80 a7 00 19 cmp %i4, %i1 200e410: 12 bf ff e7 bne 200e3ac <_Heap_Extend+0x84> <== ALWAYS TAKEN 200e414: a8 10 00 1d mov %i5, %l4 start_block->prev_size = extend_area_end; 200e418: e0 27 40 00 st %l0, [ %i5 ] <== NOT EXECUTED - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e41c: fa 02 20 04 ld [ %o0 + 4 ], %i5 200e420: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e424: ba 02 00 1d add %o0, %i5, %i5 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e428: 80 a5 c0 1d cmp %l7, %i5 200e42c: 12 bf ff e9 bne 200e3d0 <_Heap_Extend+0xa8> <== NEVER TAKEN 200e430: a4 10 00 08 mov %o0, %l2 if ( extend_area_begin < heap->area_begin ) { 200e434: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200e438: 80 a6 40 01 cmp %i1, %g1 200e43c: 3a 80 00 53 bcc,a 200e588 <_Heap_Extend+0x260> 200e440: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200e444: 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; 200e448: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e44c: 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 ) { 200e450: 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 = 200e454: 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; 200e458: e0 20 40 00 st %l0, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200e45c: ba 10 e0 01 or %g3, 1, %i5 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 200e460: fa 20 60 04 st %i5, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200e464: 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 ) { 200e468: 80 a1 00 01 cmp %g4, %g1 200e46c: 08 80 00 41 bleu 200e570 <_Heap_Extend+0x248> 200e470: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200e474: 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 ) { 200e478: 80 a5 20 00 cmp %l4, 0 200e47c: 02 80 00 4d be 200e5b0 <_Heap_Extend+0x288> 200e480: 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; 200e484: fa 06 20 10 ld [ %i0 + 0x10 ], %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200e488: 92 10 00 1d mov %i5, %o1 200e48c: 40 00 2d d3 call 2019bd8 <.urem> 200e490: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200e494: 80 a2 20 00 cmp %o0, 0 200e498: 02 80 00 04 be 200e4a8 <_Heap_Extend+0x180> 200e49c: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200e4a0: b2 06 40 1d add %i1, %i5, %i1 200e4a4: 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 = 200e4a8: 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; 200e4ac: 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 = 200e4b0: 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; 200e4b4: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200e4b8: 90 10 00 18 mov %i0, %o0 200e4bc: 92 10 00 01 mov %g1, %o1 200e4c0: 7f ff ff 90 call 200e300 <_Heap_Free_block> 200e4c4: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200e4c8: 80 a4 a0 00 cmp %l2, 0 200e4cc: 02 80 00 40 be 200e5cc <_Heap_Extend+0x2a4> 200e4d0: a0 04 3f f8 add %l0, -8, %l0 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e4d4: 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( 200e4d8: a0 24 00 12 sub %l0, %l2, %l0 200e4dc: 40 00 2d bf call 2019bd8 <.urem> 200e4e0: 90 10 00 10 mov %l0, %o0 ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = (last_block->size_and_flag - last_block_new_size) 200e4e4: c2 04 a0 04 ld [ %l2 + 4 ], %g1 200e4e8: a0 24 00 08 sub %l0, %o0, %l0 200e4ec: 82 20 40 10 sub %g1, %l0, %g1 | HEAP_PREV_BLOCK_USED; 200e4f0: 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 = 200e4f4: 84 04 00 12 add %l0, %l2, %g2 200e4f8: 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; 200e4fc: c2 04 a0 04 ld [ %l2 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 200e500: 90 10 00 18 mov %i0, %o0 200e504: 82 08 60 01 and %g1, 1, %g1 200e508: 92 10 00 12 mov %l2, %o1 block->size_and_flag = size | flag; 200e50c: a0 14 00 01 or %l0, %g1, %l0 200e510: 7f ff ff 7c call 200e300 <_Heap_Free_block> 200e514: e0 24 a0 04 st %l0, [ %l2 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e518: 80 a4 a0 00 cmp %l2, 0 200e51c: 02 80 00 39 be 200e600 <_Heap_Extend+0x2d8> 200e520: 80 a5 20 00 cmp %l4, 0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200e524: 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( 200e528: fa 06 20 20 ld [ %i0 + 0x20 ], %i5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e52c: c8 00 60 04 ld [ %g1 + 4 ], %g4 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200e530: c4 06 20 2c ld [ %i0 + 0x2c ], %g2 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200e534: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 * This feature will be used to terminate the scattered heap area list. See * also _Heap_Extend(). */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( 200e538: ba 27 40 01 sub %i5, %g1, %i5 RTEMS_INLINE_ROUTINE void _Heap_Block_set_size( Heap_Block *block, uintptr_t size ) { uintptr_t flag = block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e53c: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200e540: 88 17 40 04 or %i5, %g4, %g4 200e544: c8 20 60 04 st %g4, [ %g1 + 4 ] 200e548: a6 20 c0 13 sub %g3, %l3, %l3 /* Statistics */ stats->size += extended_size; 200e54c: 82 00 80 13 add %g2, %l3, %g1 if ( extended_size_ptr != NULL ) 200e550: 80 a6 e0 00 cmp %i3, 0 200e554: 02 80 00 32 be 200e61c <_Heap_Extend+0x2f4> <== NEVER TAKEN 200e558: c2 26 20 2c st %g1, [ %i0 + 0x2c ] *extended_size_ptr = extended_size; 200e55c: e6 26 c0 00 st %l3, [ %i3 ] return true; 200e560: b0 10 20 01 mov 1, %i0 } 200e564: b0 0e 20 01 and %i0, 1, %i0 200e568: 81 c7 e0 08 ret 200e56c: 81 e8 00 00 restore extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200e570: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200e574: 80 a0 40 02 cmp %g1, %g2 200e578: 2a bf ff c0 bcs,a 200e478 <_Heap_Extend+0x150> 200e57c: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200e580: 10 bf ff bf b 200e47c <_Heap_Extend+0x154> 200e584: 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 ) { 200e588: 80 a4 00 01 cmp %l0, %g1 200e58c: 38 bf ff af bgu,a 200e448 <_Heap_Extend+0x120> 200e590: e0 26 20 1c st %l0, [ %i0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200e594: 10 bf ff ae b 200e44c <_Heap_Extend+0x124> 200e598: 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 ( 200e59c: 80 a6 40 1c cmp %i1, %i4 200e5a0: 1a bf ff 99 bcc 200e404 <_Heap_Extend+0xdc> 200e5a4: 80 a6 80 10 cmp %i2, %l0 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { return false; 200e5a8: 10 bf ff 6b b 200e354 <_Heap_Extend+0x2c> 200e5ac: b0 10 20 00 clr %i0 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200e5b0: 80 a5 a0 00 cmp %l6, 0 200e5b4: 02 bf ff c6 be 200e4cc <_Heap_Extend+0x1a4> 200e5b8: 80 a4 a0 00 cmp %l2, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 200e5bc: ac 25 80 02 sub %l6, %g2, %l6 200e5c0: 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 = 200e5c4: 10 bf ff c2 b 200e4cc <_Heap_Extend+0x1a4> 200e5c8: ec 20 a0 04 st %l6, [ %g2 + 4 ] ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200e5cc: 80 a5 60 00 cmp %l5, 0 200e5d0: 02 bf ff d2 be 200e518 <_Heap_Extend+0x1f0> 200e5d4: 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; 200e5d8: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200e5dc: c2 07 bf fc ld [ %fp + -4 ], %g1 200e5e0: 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 ); 200e5e4: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200e5e8: 84 10 80 03 or %g2, %g3, %g2 200e5ec: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200e5f0: c4 00 60 04 ld [ %g1 + 4 ], %g2 200e5f4: 84 10 a0 01 or %g2, 1, %g2 200e5f8: 10 bf ff c8 b 200e518 <_Heap_Extend+0x1f0> 200e5fc: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e600: 32 bf ff ca bne,a 200e528 <_Heap_Extend+0x200> 200e604: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200e608: d2 07 bf f8 ld [ %fp + -8 ], %o1 200e60c: 7f ff ff 3d call 200e300 <_Heap_Free_block> 200e610: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE void _Heap_Set_last_block_size( Heap_Control *heap ) { _Heap_Block_set_size( heap->last_block, (uintptr_t) heap->first_block - (uintptr_t) heap->last_block 200e614: 10 bf ff c5 b 200e528 <_Heap_Extend+0x200> 200e618: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200e61c: 10 bf ff 4e b 200e354 <_Heap_Extend+0x2c> <== NOT EXECUTED 200e620: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED =============================================================================== 0200e310 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200e310: 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 ) { 200e314: 80 a6 60 00 cmp %i1, 0 200e318: 02 80 00 3c be 200e408 <_Heap_Free+0xf8> 200e31c: 82 10 20 01 mov 1, %g1 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e320: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e324: 40 00 2d 68 call 20198c4 <.urem> 200e328: 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 200e32c: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e330: 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); 200e334: 90 27 40 08 sub %i5, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e338: 80 a2 00 02 cmp %o0, %g2 200e33c: 0a 80 00 30 bcs 200e3fc <_Heap_Free+0xec> 200e340: 82 10 20 00 clr %g1 200e344: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200e348: 80 a2 00 04 cmp %o0, %g4 200e34c: 38 80 00 2d bgu,a 200e400 <_Heap_Free+0xf0> 200e350: b0 08 60 ff and %g1, 0xff, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e354: f6 02 20 04 ld [ %o0 + 4 ], %i3 200e358: ba 0e ff fe and %i3, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e35c: 86 02 00 1d add %o0, %i5, %g3 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e360: 80 a0 80 03 cmp %g2, %g3 200e364: 38 80 00 27 bgu,a 200e400 <_Heap_Free+0xf0> <== NEVER TAKEN 200e368: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED 200e36c: 80 a1 00 03 cmp %g4, %g3 200e370: 2a 80 00 24 bcs,a 200e400 <_Heap_Free+0xf0> <== NEVER TAKEN 200e374: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e378: f8 00 e0 04 ld [ %g3 + 4 ], %i4 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200e37c: 80 8f 20 01 btst 1, %i4 200e380: 02 80 00 1f be 200e3fc <_Heap_Free+0xec> <== NEVER TAKEN 200e384: 80 a1 00 03 cmp %g4, %g3 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200e388: 02 80 00 23 be 200e414 <_Heap_Free+0x104> 200e38c: b8 0f 3f fe and %i4, -2, %i4 200e390: 82 00 c0 1c add %g3, %i4, %g1 200e394: c2 00 60 04 ld [ %g1 + 4 ], %g1 200e398: 80 88 60 01 btst 1, %g1 200e39c: 12 80 00 1f bne 200e418 <_Heap_Free+0x108> 200e3a0: 80 8e e0 01 btst 1, %i3 if ( !_Heap_Is_prev_used( block ) ) { 200e3a4: 02 80 00 20 be 200e424 <_Heap_Free+0x114> 200e3a8: b2 10 20 01 mov 1, %i1 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200e3ac: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200e3b0: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200e3b4: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = prev; 200e3b8: c2 22 20 0c st %g1, [ %o0 + 0xc ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; 200e3bc: b8 07 00 1d add %i4, %i5, %i4 next->prev = new_block; 200e3c0: d0 20 a0 0c st %o0, [ %g2 + 0xc ] prev->next = new_block; 200e3c4: d0 20 60 08 st %o0, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e3c8: 84 17 20 01 or %i4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200e3cc: f8 22 00 1c st %i4, [ %o0 + %i4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e3d0: c4 22 20 04 st %g2, [ %o0 + 4 ] } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e3d4: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e3d8: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; stats->free_size += block_size; 200e3dc: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e3e0: 82 00 60 01 inc %g1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e3e4: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; stats->free_size += block_size; 200e3e8: ba 00 c0 1d add %g3, %i5, %i5 } } /* Statistics */ --stats->used_blocks; ++stats->frees; 200e3ec: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e3f0: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; stats->free_size += block_size; 200e3f4: fa 26 20 30 st %i5, [ %i0 + 0x30 ] return( true ); 200e3f8: 82 10 20 01 mov 1, %g1 200e3fc: b0 08 60 ff and %g1, 0xff, %i0 200e400: 81 c7 e0 08 ret 200e404: 81 e8 00 00 restore 200e408: b0 08 60 ff and %g1, 0xff, %i0 200e40c: 81 c7 e0 08 ret 200e410: 81 e8 00 00 restore next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200e414: 80 8e e0 01 btst 1, %i3 200e418: 32 80 00 1e bne,a 200e490 <_Heap_Free+0x180> 200e41c: c4 06 20 08 ld [ %i0 + 8 ], %g2 if ( !_Heap_Protection_determine_block_free( heap, block ) ) { return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 200e420: b2 10 20 00 clr %i1 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { uintptr_t const prev_size = block->prev_size; 200e424: f4 02 00 00 ld [ %o0 ], %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e428: b6 22 00 1a sub %o0, %i2, %i3 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e42c: 80 a0 80 1b cmp %g2, %i3 200e430: 18 bf ff f3 bgu 200e3fc <_Heap_Free+0xec> <== NEVER TAKEN 200e434: 82 10 20 00 clr %g1 200e438: 80 a1 00 1b cmp %g4, %i3 200e43c: 2a bf ff f1 bcs,a 200e400 <_Heap_Free+0xf0> <== NEVER TAKEN 200e440: b0 08 60 ff and %g1, 0xff, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e444: c4 06 e0 04 ld [ %i3 + 4 ], %g2 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200e448: 80 88 a0 01 btst 1, %g2 200e44c: 02 bf ff ec be 200e3fc <_Heap_Free+0xec> <== NEVER TAKEN 200e450: 80 8e 60 ff btst 0xff, %i1 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200e454: 22 80 00 21 be,a 200e4d8 <_Heap_Free+0x1c8> 200e458: b4 07 40 1a add %i5, %i2, %i2 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200e45c: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200e460: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200e464: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200e468: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200e46c: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200e470: 82 00 ff ff add %g3, -1, %g1 200e474: 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; 200e478: b8 07 40 1c add %i5, %i4, %i4 200e47c: b4 07 00 1a add %i4, %i2, %i2 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e480: 82 16 a0 01 or %i2, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200e484: f4 26 c0 1a st %i2, [ %i3 + %i2 ] if ( next_is_free ) { /* coalesce both */ uintptr_t const size = block_size + prev_size + next_block_size; _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e488: 10 bf ff d3 b 200e3d4 <_Heap_Free+0xc4> 200e48c: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200e490: 82 17 60 01 or %i5, 1, %g1 200e494: c2 22 20 04 st %g1, [ %o0 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e498: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200e49c: f0 22 20 0c st %i0, [ %o0 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200e4a0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200e4a4: c4 22 20 08 st %g2, [ %o0 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200e4a8: d0 20 a0 0c st %o0, [ %g2 + 0xc ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e4ac: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200e4b0: fa 22 00 1d st %i5, [ %o0 + %i5 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e4b4: 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 ) { 200e4b8: 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; 200e4bc: 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; 200e4c0: d0 26 20 08 st %o0, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200e4c4: 80 a0 40 02 cmp %g1, %g2 200e4c8: 08 bf ff c3 bleu 200e3d4 <_Heap_Free+0xc4> 200e4cc: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200e4d0: 10 bf ff c1 b 200e3d4 <_Heap_Free+0xc4> 200e4d4: 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; 200e4d8: 82 16 a0 01 or %i2, 1, %g1 200e4dc: c2 26 e0 04 st %g1, [ %i3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e4e0: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200e4e4: f4 22 00 1d st %i2, [ %o0 + %i5 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e4e8: 82 08 7f fe and %g1, -2, %g1 200e4ec: 10 bf ff ba b 200e3d4 <_Heap_Free+0xc4> 200e4f0: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 02012ecc <_Heap_Get_free_information>: return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 2012ecc: c2 02 20 08 ld [ %o0 + 8 ], %g1 ) { Heap_Block *the_block; Heap_Block *const tail = _Heap_Free_list_tail(the_heap); info->number = 0; 2012ed0: c0 22 40 00 clr [ %o1 ] info->largest = 0; 2012ed4: c0 22 60 04 clr [ %o1 + 4 ] info->total = 0; 2012ed8: c0 22 60 08 clr [ %o1 + 8 ] for(the_block = _Heap_Free_list_first(the_heap); 2012edc: 88 10 20 01 mov 1, %g4 2012ee0: 9a 10 20 00 clr %o5 2012ee4: 80 a2 00 01 cmp %o0, %g1 2012ee8: 12 80 00 04 bne 2012ef8 <_Heap_Get_free_information+0x2c> <== ALWAYS TAKEN 2012eec: 86 10 20 00 clr %g3 2012ef0: 30 80 00 10 b,a 2012f30 <_Heap_Get_free_information+0x64><== NOT EXECUTED 2012ef4: 88 10 00 0c mov %o4, %g4 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 2012ef8: c4 00 60 04 ld [ %g1 + 4 ], %g2 2012efc: 98 01 20 01 add %g4, 1, %o4 2012f00: 84 08 bf fe and %g2, -2, %g2 /* As we always coalesce free blocks, prev block must have been used. */ _HAssert(_Heap_Is_prev_used(the_block)); info->number++; info->total += the_size; if ( info->largest < the_size ) 2012f04: 80 a0 80 0d cmp %g2, %o5 2012f08: 08 80 00 03 bleu 2012f14 <_Heap_Get_free_information+0x48> 2012f0c: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 2012f10: c4 22 60 04 st %g2, [ %o1 + 4 ] info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); the_block != tail; the_block = the_block->next) 2012f14: c2 00 60 08 ld [ %g1 + 8 ], %g1 info->number = 0; info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); 2012f18: 80 a2 00 01 cmp %o0, %g1 2012f1c: 32 bf ff f6 bne,a 2012ef4 <_Heap_Get_free_information+0x28> 2012f20: da 02 60 04 ld [ %o1 + 4 ], %o5 2012f24: c8 22 40 00 st %g4, [ %o1 ] 2012f28: 81 c3 e0 08 retl 2012f2c: c6 22 60 08 st %g3, [ %o1 + 8 ] 2012f30: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 0200aefc <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, uintptr_t remaining_free_space ) { 200aefc: 9d e3 bf a0 save %sp, -96, %sp void *free_space = remaining_free_space > 0 ? _Heap_Allocate( heap, remaining_free_space ) : NULL; 200af00: b4 10 20 00 clr %i2 200af04: 80 a6 60 00 cmp %i1, 0 200af08: 12 80 00 1b bne 200af74 <_Heap_Greedy_allocate+0x78> 200af0c: b8 10 00 18 mov %i0, %i4 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200af10: fa 07 20 08 ld [ %i4 + 8 ], %i5 Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { 200af14: 80 a7 00 1d cmp %i4, %i5 200af18: 22 80 00 12 be,a 200af60 <_Heap_Greedy_allocate+0x64> <== NEVER TAKEN 200af1c: b0 10 20 00 clr %i0 <== NOT EXECUTED 200af20: 10 80 00 03 b 200af2c <_Heap_Greedy_allocate+0x30> 200af24: b6 10 20 00 clr %i3 _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); 200af28: ba 10 00 01 mov %g1, %i5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200af2c: d6 07 60 04 ld [ %i5 + 4 ], %o3 Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { _Heap_Block_allocate( 200af30: 92 10 00 1d mov %i5, %o1 200af34: 96 0a ff fe and %o3, -2, %o3 200af38: 94 07 60 08 add %i5, 8, %o2 200af3c: 90 10 00 1c mov %i4, %o0 200af40: 40 00 00 e0 call 200b2c0 <_Heap_Block_allocate> 200af44: 96 02 ff f8 add %o3, -8, %o3 current, _Heap_Alloc_area_of_block( current ), _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; 200af48: f6 27 60 08 st %i3, [ %i5 + 8 ] return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200af4c: c2 07 20 08 ld [ %i4 + 8 ], %g1 : NULL; Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); Heap_Block *current = _Heap_Free_list_first( heap ); Heap_Block *blocks = NULL; while ( current != free_list_tail ) { 200af50: 80 a7 00 01 cmp %i4, %g1 200af54: 12 bf ff f5 bne 200af28 <_Heap_Greedy_allocate+0x2c> 200af58: b6 10 00 1d mov %i5, %i3 200af5c: b0 10 00 1d mov %i5, %i0 current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); } _Heap_Free( heap, free_space ); 200af60: 90 10 00 1c mov %i4, %o0 200af64: 40 00 20 39 call 2013048 <_Heap_Free> 200af68: 92 10 00 1a mov %i2, %o1 return blocks; } 200af6c: 81 c7 e0 08 ret 200af70: 81 e8 00 00 restore * @brief See _Heap_Allocate_aligned_with_boundary() with alignment and * boundary equals zero. */ RTEMS_INLINE_ROUTINE void *_Heap_Allocate( Heap_Control *heap, uintptr_t size ) { return _Heap_Allocate_aligned_with_boundary( heap, size, 0, 0 ); 200af74: 90 10 00 18 mov %i0, %o0 200af78: 92 10 00 19 mov %i1, %o1 200af7c: 94 10 20 00 clr %o2 200af80: 40 00 1f a7 call 2012e1c <_Heap_Allocate_aligned_with_boundary> 200af84: 96 10 20 00 clr %o3 200af88: 10 bf ff e2 b 200af10 <_Heap_Greedy_allocate+0x14> 200af8c: b4 10 00 08 mov %o0, %i2 =============================================================================== 0200af90 <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 200af90: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 200af94: 80 a6 60 00 cmp %i1, 0 200af98: 02 80 00 09 be 200afbc <_Heap_Greedy_free+0x2c> <== NEVER TAKEN 200af9c: 01 00 00 00 nop Heap_Block *current = blocks; blocks = blocks->next; 200afa0: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200afa4: 92 06 60 08 add %i1, 8, %o1 200afa8: 40 00 20 28 call 2013048 <_Heap_Free> 200afac: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 200afb0: b2 97 60 00 orcc %i5, 0, %i1 200afb4: 32 bf ff fc bne,a 200afa4 <_Heap_Greedy_free+0x14> 200afb8: fa 06 60 08 ld [ %i1 + 8 ], %i5 200afbc: 81 c7 e0 08 ret 200afc0: 81 e8 00 00 restore =============================================================================== 02012f98 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 2012f98: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; 2012f9c: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 Heap_Block *end = heap->last_block; 2012fa0: f8 06 20 24 ld [ %i0 + 0x24 ], %i4 bool stop = false; while ( !stop && current != end ) { 2012fa4: 80 a0 40 1c cmp %g1, %i4 2012fa8: 32 80 00 08 bne,a 2012fc8 <_Heap_Iterate+0x30> <== ALWAYS TAKEN 2012fac: d2 00 60 04 ld [ %g1 + 4 ], %o1 2012fb0: 30 80 00 10 b,a 2012ff0 <_Heap_Iterate+0x58> <== NOT EXECUTED 2012fb4: 90 1a 20 01 xor %o0, 1, %o0 2012fb8: 80 8a 20 ff btst 0xff, %o0 2012fbc: 02 80 00 0d be 2012ff0 <_Heap_Iterate+0x58> <== NEVER TAKEN 2012fc0: 01 00 00 00 nop 2012fc4: d2 00 60 04 ld [ %g1 + 4 ], %o1 uintptr_t size = _Heap_Block_size( current ); Heap_Block *next = _Heap_Block_at( current, size ); bool used = _Heap_Is_prev_used( next ); stop = (*visitor)( current, size, used, visitor_arg ); 2012fc8: 90 10 00 01 mov %g1, %o0 2012fcc: 92 0a 7f fe and %o1, -2, %o1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2012fd0: ba 00 40 09 add %g1, %o1, %i5 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 2012fd4: d4 07 60 04 ld [ %i5 + 4 ], %o2 2012fd8: 96 10 00 1a mov %i2, %o3 2012fdc: 9f c6 40 00 call %i1 2012fe0: 94 0a a0 01 and %o2, 1, %o2 { Heap_Block *current = heap->first_block; Heap_Block *end = heap->last_block; bool stop = false; while ( !stop && current != end ) { 2012fe4: 80 a7 00 1d cmp %i4, %i5 2012fe8: 12 bf ff f3 bne 2012fb4 <_Heap_Iterate+0x1c> 2012fec: 82 10 00 1d mov %i5, %g1 2012ff0: 81 c7 e0 08 ret 2012ff4: 81 e8 00 00 restore =============================================================================== 0200e61c <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200e61c: 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); 200e620: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e624: 40 00 2c a8 call 20198c4 <.urem> 200e628: 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 200e62c: 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); 200e630: 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); 200e634: 90 20 80 08 sub %g2, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e638: 80 a2 00 01 cmp %o0, %g1 200e63c: 0a 80 00 16 bcs 200e694 <_Heap_Size_of_alloc_area+0x78> 200e640: 84 10 20 00 clr %g2 200e644: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200e648: 80 a2 00 03 cmp %o0, %g3 200e64c: 18 80 00 13 bgu 200e698 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e650: b0 08 a0 ff and %g2, 0xff, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e654: c8 02 20 04 ld [ %o0 + 4 ], %g4 200e658: 88 09 3f fe and %g4, -2, %g4 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e65c: 90 02 00 04 add %o0, %g4, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e660: 80 a0 40 08 cmp %g1, %o0 200e664: 18 80 00 0d bgu 200e698 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e668: 01 00 00 00 nop 200e66c: 80 a0 c0 08 cmp %g3, %o0 200e670: 0a 80 00 0a bcs 200e698 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e674: 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; 200e678: c2 02 20 04 ld [ %o0 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 200e67c: 80 88 60 01 btst 1, %g1 200e680: 02 80 00 06 be 200e698 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e684: 90 22 00 19 sub %o0, %i1, %o0 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200e688: 84 10 20 01 mov 1, %g2 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 200e68c: 90 02 20 04 add %o0, 4, %o0 200e690: d0 26 80 00 st %o0, [ %i2 ] 200e694: b0 08 a0 ff and %g2, 0xff, %i0 200e698: 81 c7 e0 08 ret 200e69c: 81 e8 00 00 restore =============================================================================== 02009f9c <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2009f9c: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const page_size = heap->page_size; 2009fa0: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 uintptr_t const min_block_size = heap->min_block_size; 2009fa4: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2009fa8: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2009fac: 80 a6 a0 00 cmp %i2, 0 2009fb0: 02 80 00 0c be 2009fe0 <_Heap_Walk+0x44> 2009fb4: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009fb8: 03 00 80 83 sethi %hi(0x2020c00), %g1 2009fbc: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 2020f20 <_System_state_Current> uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2009fc0: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009fc4: 82 10 20 01 mov 1, %g1 Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009fc8: 80 a0 a0 03 cmp %g2, 3 2009fcc: 02 80 00 0c be 2009ffc <_Heap_Walk+0x60> <== ALWAYS TAKEN 2009fd0: ae 10 e3 38 or %g3, 0x338, %l7 2009fd4: b0 08 60 ff and %g1, 0xff, %i0 2009fd8: 81 c7 e0 08 ret 2009fdc: 81 e8 00 00 restore 2009fe0: 03 00 80 83 sethi %hi(0x2020c00), %g1 2009fe4: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 2020f20 <_System_state_Current> uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2009fe8: 07 00 80 27 sethi %hi(0x2009c00), %g3 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; 2009fec: 82 10 20 01 mov 1, %g1 Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009ff0: 80 a0 a0 03 cmp %g2, 3 2009ff4: 12 bf ff f8 bne 2009fd4 <_Heap_Walk+0x38> 2009ff8: ae 10 e3 30 or %g3, 0x330, %l7 Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 2009ffc: da 06 20 18 ld [ %i0 + 0x18 ], %o5 200a000: c8 06 20 1c ld [ %i0 + 0x1c ], %g4 200a004: c4 06 20 08 ld [ %i0 + 8 ], %g2 200a008: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200a00c: 90 10 00 19 mov %i1, %o0 200a010: c8 23 a0 5c st %g4, [ %sp + 0x5c ] 200a014: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 200a018: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 200a01c: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 200a020: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 200a024: 92 10 20 00 clr %o1 200a028: 96 10 00 1b mov %i3, %o3 200a02c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a030: 98 10 00 10 mov %l0, %o4 200a034: 9f c5 c0 00 call %l7 200a038: 94 12 a0 08 or %o2, 8, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 200a03c: 80 a6 e0 00 cmp %i3, 0 200a040: 02 80 00 2a be 200a0e8 <_Heap_Walk+0x14c> 200a044: 80 8e e0 07 btst 7, %i3 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 200a048: 12 80 00 2f bne 200a104 <_Heap_Walk+0x168> 200a04c: 90 10 00 10 mov %l0, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a050: 7f ff de c8 call 2001b70 <.urem> 200a054: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 200a058: 80 a2 20 00 cmp %o0, 0 200a05c: 12 80 00 32 bne 200a124 <_Heap_Walk+0x188> 200a060: 90 07 20 08 add %i4, 8, %o0 200a064: 7f ff de c3 call 2001b70 <.urem> 200a068: 92 10 00 1b mov %i3, %o1 ); return false; } if ( 200a06c: 80 a2 20 00 cmp %o0, 0 200a070: 32 80 00 35 bne,a 200a144 <_Heap_Walk+0x1a8> 200a074: 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; 200a078: ec 07 20 04 ld [ %i4 + 4 ], %l6 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 200a07c: b4 8d a0 01 andcc %l6, 1, %i2 200a080: 22 80 00 38 be,a 200a160 <_Heap_Walk+0x1c4> 200a084: 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; 200a088: c2 04 60 04 ld [ %l1 + 4 ], %g1 200a08c: 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); 200a090: 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; 200a094: fa 00 60 04 ld [ %g1 + 4 ], %i5 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200a098: 80 8f 60 01 btst 1, %i5 200a09c: 02 80 00 0c be 200a0cc <_Heap_Walk+0x130> 200a0a0: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 200a0a4: 02 80 00 35 be 200a178 <_Heap_Walk+0x1dc> 200a0a8: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 200a0ac: 92 10 20 01 mov 1, %o1 200a0b0: 15 00 80 76 sethi %hi(0x201d800), %o2 200a0b4: 9f c5 c0 00 call %l7 200a0b8: 94 12 a1 80 or %o2, 0x180, %o2 ! 201d980 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0bc: 82 10 20 00 clr %g1 200a0c0: b0 08 60 ff and %g1, 0xff, %i0 200a0c4: 81 c7 e0 08 ret 200a0c8: 81 e8 00 00 restore return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 200a0cc: 90 10 00 19 mov %i1, %o0 200a0d0: 92 10 20 01 mov 1, %o1 200a0d4: 15 00 80 76 sethi %hi(0x201d800), %o2 200a0d8: 9f c5 c0 00 call %l7 200a0dc: 94 12 a1 68 or %o2, 0x168, %o2 ! 201d968 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0e0: 10 bf ff f8 b 200a0c0 <_Heap_Walk+0x124> 200a0e4: 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" ); 200a0e8: 90 10 00 19 mov %i1, %o0 200a0ec: 92 10 20 01 mov 1, %o1 200a0f0: 15 00 80 76 sethi %hi(0x201d800), %o2 200a0f4: 9f c5 c0 00 call %l7 200a0f8: 94 12 a0 a0 or %o2, 0xa0, %o2 ! 201d8a0 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0fc: 10 bf ff f1 b 200a0c0 <_Heap_Walk+0x124> 200a100: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 200a104: 90 10 00 19 mov %i1, %o0 200a108: 92 10 20 01 mov 1, %o1 200a10c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a110: 96 10 00 1b mov %i3, %o3 200a114: 9f c5 c0 00 call %l7 200a118: 94 12 a0 b8 or %o2, 0xb8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a11c: 10 bf ff e9 b 200a0c0 <_Heap_Walk+0x124> 200a120: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 200a124: 90 10 00 19 mov %i1, %o0 200a128: 92 10 20 01 mov 1, %o1 200a12c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a130: 96 10 00 10 mov %l0, %o3 200a134: 9f c5 c0 00 call %l7 200a138: 94 12 a0 d8 or %o2, 0xd8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a13c: 10 bf ff e1 b 200a0c0 <_Heap_Walk+0x124> 200a140: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 200a144: 92 10 20 01 mov 1, %o1 200a148: 15 00 80 76 sethi %hi(0x201d800), %o2 200a14c: 96 10 00 1c mov %i4, %o3 200a150: 9f c5 c0 00 call %l7 200a154: 94 12 a1 00 or %o2, 0x100, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a158: 10 bf ff da b 200a0c0 <_Heap_Walk+0x124> 200a15c: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 200a160: 92 10 20 01 mov 1, %o1 200a164: 15 00 80 76 sethi %hi(0x201d800), %o2 200a168: 9f c5 c0 00 call %l7 200a16c: 94 12 a1 38 or %o2, 0x138, %o2 ! 201d938 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a170: 10 bf ff d4 b 200a0c0 <_Heap_Walk+0x124> 200a174: 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; 200a178: fa 06 20 08 ld [ %i0 + 8 ], %i5 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 200a17c: e8 06 20 10 ld [ %i0 + 0x10 ], %l4 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 200a180: 80 a6 00 1d cmp %i0, %i5 200a184: 02 80 00 0d be 200a1b8 <_Heap_Walk+0x21c> 200a188: da 06 20 20 ld [ %i0 + 0x20 ], %o5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a18c: 80 a3 40 1d cmp %o5, %i5 200a190: 28 80 00 bf bleu,a 200a48c <_Heap_Walk+0x4f0> <== ALWAYS TAKEN 200a194: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 200a198: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a19c: 92 10 20 01 mov 1, %o1 200a1a0: 15 00 80 76 sethi %hi(0x201d800), %o2 200a1a4: 96 10 00 1d mov %i5, %o3 200a1a8: 9f c5 c0 00 call %l7 200a1ac: 94 12 a1 b0 or %o2, 0x1b0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a1b0: 10 bf ff c4 b 200a0c0 <_Heap_Walk+0x124> 200a1b4: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a1b8: 27 00 80 76 sethi %hi(0x201d800), %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 200a1bc: 25 00 80 76 sethi %hi(0x201d800), %l2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a1c0: aa 10 00 1c mov %i4, %l5 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a1c4: a6 14 e3 e0 or %l3, 0x3e0, %l3 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 200a1c8: a4 14 a3 c8 or %l2, 0x3c8, %l2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a1cc: 29 00 80 76 sethi %hi(0x201d800), %l4 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a1d0: ac 0d bf fe and %l6, -2, %l6 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200a1d4: ba 05 80 15 add %l6, %l5, %i5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a1d8: 80 a3 40 1d cmp %o5, %i5 200a1dc: 28 80 00 0b bleu,a 200a208 <_Heap_Walk+0x26c> <== ALWAYS TAKEN 200a1e0: de 06 20 24 ld [ %i0 + 0x24 ], %o7 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 200a1e4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a1e8: 92 10 20 01 mov 1, %o1 200a1ec: 96 10 00 15 mov %l5, %o3 200a1f0: 15 00 80 76 sethi %hi(0x201d800), %o2 200a1f4: 98 10 00 1d mov %i5, %o4 200a1f8: 9f c5 c0 00 call %l7 200a1fc: 94 12 a2 58 or %o2, 0x258, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 200a200: 10 bf ff 75 b 2009fd4 <_Heap_Walk+0x38> 200a204: 82 10 20 00 clr %g1 200a208: 80 a3 c0 1d cmp %o7, %i5 200a20c: 0a bf ff f7 bcs 200a1e8 <_Heap_Walk+0x24c> 200a210: 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; 200a214: 9e 1d 40 11 xor %l5, %l1, %o7 200a218: 80 a0 00 0f cmp %g0, %o7 200a21c: 9a 40 20 00 addx %g0, 0, %o5 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a220: 90 10 00 16 mov %l6, %o0 200a224: da 27 bf fc st %o5, [ %fp + -4 ] 200a228: 7f ff de 52 call 2001b70 <.urem> 200a22c: 92 10 00 1b mov %i3, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200a230: 80 a2 20 00 cmp %o0, 0 200a234: 02 80 00 18 be 200a294 <_Heap_Walk+0x2f8> 200a238: da 07 bf fc ld [ %fp + -4 ], %o5 200a23c: 80 8b 60 ff btst 0xff, %o5 200a240: 12 80 00 8b bne 200a46c <_Heap_Walk+0x4d0> 200a244: 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; 200a248: de 07 60 04 ld [ %i5 + 4 ], %o7 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200a24c: 80 8b e0 01 btst 1, %o7 200a250: 02 80 00 2b be 200a2fc <_Heap_Walk+0x360> 200a254: 80 a6 a0 00 cmp %i2, 0 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 200a258: 22 80 00 21 be,a 200a2dc <_Heap_Walk+0x340> 200a25c: da 05 40 00 ld [ %l5 ], %o5 (*printer)( 200a260: 90 10 00 19 mov %i1, %o0 200a264: 92 10 20 00 clr %o1 200a268: 94 10 00 12 mov %l2, %o2 200a26c: 96 10 00 15 mov %l5, %o3 200a270: 9f c5 c0 00 call %l7 200a274: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a278: 80 a7 00 1d cmp %i4, %i5 200a27c: 02 80 00 51 be 200a3c0 <_Heap_Walk+0x424> 200a280: aa 10 00 1d mov %i5, %l5 200a284: ec 07 60 04 ld [ %i5 + 4 ], %l6 200a288: da 06 20 20 ld [ %i0 + 0x20 ], %o5 200a28c: 10 bf ff d1 b 200a1d0 <_Heap_Walk+0x234> 200a290: b4 0d a0 01 and %l6, 1, %i2 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a294: 80 a5 80 10 cmp %l6, %l0 200a298: 0a 80 00 69 bcs 200a43c <_Heap_Walk+0x4a0> 200a29c: 80 8b 60 ff btst 0xff, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200a2a0: 80 a5 40 1d cmp %l5, %i5 200a2a4: 2a bf ff ea bcs,a 200a24c <_Heap_Walk+0x2b0> 200a2a8: de 07 60 04 ld [ %i5 + 4 ], %o7 200a2ac: 80 8b 60 ff btst 0xff, %o5 200a2b0: 22 bf ff e7 be,a 200a24c <_Heap_Walk+0x2b0> 200a2b4: de 07 60 04 ld [ %i5 + 4 ], %o7 (*printer)( 200a2b8: 90 10 00 19 mov %i1, %o0 200a2bc: 92 10 20 01 mov 1, %o1 200a2c0: 96 10 00 15 mov %l5, %o3 200a2c4: 15 00 80 76 sethi %hi(0x201d800), %o2 200a2c8: 98 10 00 1d mov %i5, %o4 200a2cc: 9f c5 c0 00 call %l7 200a2d0: 94 12 a2 e8 or %o2, 0x2e8, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200a2d4: 10 bf ff 40 b 2009fd4 <_Heap_Walk+0x38> 200a2d8: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a2dc: 96 10 00 15 mov %l5, %o3 200a2e0: 90 10 00 19 mov %i1, %o0 200a2e4: 92 10 20 00 clr %o1 200a2e8: 94 10 00 13 mov %l3, %o2 200a2ec: 9f c5 c0 00 call %l7 200a2f0: 98 10 00 16 mov %l6, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a2f4: 10 bf ff e2 b 200a27c <_Heap_Walk+0x2e0> 200a2f8: 80 a7 00 1d cmp %i4, %i5 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 200a2fc: da 05 60 0c ld [ %l5 + 0xc ], %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a300: de 06 20 08 ld [ %i0 + 8 ], %o7 200a304: 80 a3 c0 0d cmp %o7, %o5 200a308: 02 80 00 3d be 200a3fc <_Heap_Walk+0x460> 200a30c: d8 06 20 0c ld [ %i0 + 0xc ], %o4 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a310: 80 a6 00 0d cmp %i0, %o5 200a314: 02 80 00 40 be 200a414 <_Heap_Walk+0x478> 200a318: 96 15 23 90 or %l4, 0x390, %o3 block->next, block->next == last_free_block ? 200a31c: de 05 60 08 ld [ %l5 + 8 ], %o7 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a320: 80 a3 00 0f cmp %o4, %o7 200a324: 02 80 00 33 be 200a3f0 <_Heap_Walk+0x454> 200a328: 80 a6 00 0f cmp %i0, %o7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a32c: 02 80 00 37 be 200a408 <_Heap_Walk+0x46c> 200a330: 98 15 23 90 or %l4, 0x390, %o4 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a334: d6 23 a0 5c st %o3, [ %sp + 0x5c ] 200a338: d8 23 a0 64 st %o4, [ %sp + 0x64 ] 200a33c: de 23 a0 60 st %o7, [ %sp + 0x60 ] 200a340: 90 10 00 19 mov %i1, %o0 200a344: 92 10 20 00 clr %o1 200a348: 15 00 80 76 sethi %hi(0x201d800), %o2 200a34c: 96 10 00 15 mov %l5, %o3 200a350: 94 12 a3 20 or %o2, 0x320, %o2 200a354: 9f c5 c0 00 call %l7 200a358: 98 10 00 16 mov %l6, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 200a35c: da 07 40 00 ld [ %i5 ], %o5 200a360: 80 a5 80 0d cmp %l6, %o5 200a364: 12 80 00 19 bne 200a3c8 <_Heap_Walk+0x42c> 200a368: 80 a6 a0 00 cmp %i2, 0 ); return false; } if ( !prev_used ) { 200a36c: 02 80 00 2d be 200a420 <_Heap_Walk+0x484> 200a370: 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; 200a374: c4 06 20 08 ld [ %i0 + 8 ], %g2 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 200a378: 80 a6 00 02 cmp %i0, %g2 200a37c: 02 80 00 0b be 200a3a8 <_Heap_Walk+0x40c> <== NEVER TAKEN 200a380: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200a384: 80 a5 40 02 cmp %l5, %g2 200a388: 02 bf ff bd be 200a27c <_Heap_Walk+0x2e0> 200a38c: 80 a7 00 1d cmp %i4, %i5 return true; } free_block = free_block->next; 200a390: c4 00 a0 08 ld [ %g2 + 8 ], %g2 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 200a394: 80 a6 00 02 cmp %i0, %g2 200a398: 12 bf ff fc bne 200a388 <_Heap_Walk+0x3ec> 200a39c: 80 a5 40 02 cmp %l5, %g2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200a3a0: 90 10 00 19 mov %i1, %o0 200a3a4: 92 10 20 01 mov 1, %o1 200a3a8: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a3ac: 96 10 00 15 mov %l5, %o3 200a3b0: 9f c5 c0 00 call %l7 200a3b4: 94 12 a0 08 or %o2, 8, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a3b8: 10 bf ff 42 b 200a0c0 <_Heap_Walk+0x124> 200a3bc: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 200a3c0: 10 bf ff 05 b 2009fd4 <_Heap_Walk+0x38> 200a3c4: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 200a3c8: fa 23 a0 5c st %i5, [ %sp + 0x5c ] 200a3cc: 90 10 00 19 mov %i1, %o0 200a3d0: 92 10 20 01 mov 1, %o1 200a3d4: 15 00 80 76 sethi %hi(0x201d800), %o2 200a3d8: 96 10 00 15 mov %l5, %o3 200a3dc: 94 12 a3 58 or %o2, 0x358, %o2 200a3e0: 9f c5 c0 00 call %l7 200a3e4: 98 10 00 16 mov %l6, %o4 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a3e8: 10 bf ff 36 b 200a0c0 <_Heap_Walk+0x124> 200a3ec: 82 10 20 00 clr %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a3f0: 03 00 80 75 sethi %hi(0x201d400), %g1 200a3f4: 10 bf ff d0 b 200a334 <_Heap_Walk+0x398> 200a3f8: 98 10 63 e8 or %g1, 0x3e8, %o4 ! 201d7e8 <__log2table+0x140> 200a3fc: 03 00 80 75 sethi %hi(0x201d400), %g1 200a400: 10 bf ff c7 b 200a31c <_Heap_Walk+0x380> 200a404: 96 10 63 c8 or %g1, 0x3c8, %o3 ! 201d7c8 <__log2table+0x120> " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a408: 03 00 80 75 sethi %hi(0x201d400), %g1 200a40c: 10 bf ff ca b 200a334 <_Heap_Walk+0x398> 200a410: 98 10 63 f8 or %g1, 0x3f8, %o4 ! 201d7f8 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a414: 17 00 80 75 sethi %hi(0x201d400), %o3 200a418: 10 bf ff c1 b 200a31c <_Heap_Walk+0x380> 200a41c: 96 12 e3 d8 or %o3, 0x3d8, %o3 ! 201d7d8 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 200a420: 92 10 20 01 mov 1, %o1 200a424: 15 00 80 76 sethi %hi(0x201d800), %o2 200a428: 96 10 00 15 mov %l5, %o3 200a42c: 9f c5 c0 00 call %l7 200a430: 94 12 a3 98 or %o2, 0x398, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a434: 10 bf ff 23 b 200a0c0 <_Heap_Walk+0x124> 200a438: 82 10 20 00 clr %g1 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a43c: 02 bf ff 9a be 200a2a4 <_Heap_Walk+0x308> <== NEVER TAKEN 200a440: 80 a5 40 1d cmp %l5, %i5 (*printer)( 200a444: 90 10 00 19 mov %i1, %o0 200a448: 92 10 20 01 mov 1, %o1 200a44c: 96 10 00 15 mov %l5, %o3 200a450: 15 00 80 76 sethi %hi(0x201d800), %o2 200a454: 98 10 00 16 mov %l6, %o4 200a458: 94 12 a2 b8 or %o2, 0x2b8, %o2 200a45c: 9f c5 c0 00 call %l7 200a460: 9a 10 00 10 mov %l0, %o5 block, block_size, min_block_size ); return false; 200a464: 10 bf fe dc b 2009fd4 <_Heap_Walk+0x38> 200a468: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200a46c: 92 10 20 01 mov 1, %o1 200a470: 96 10 00 15 mov %l5, %o3 200a474: 15 00 80 76 sethi %hi(0x201d800), %o2 200a478: 98 10 00 16 mov %l6, %o4 200a47c: 9f c5 c0 00 call %l7 200a480: 94 12 a2 88 or %o2, 0x288, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 200a484: 10 bf fe d4 b 2009fd4 <_Heap_Walk+0x38> 200a488: 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; 200a48c: 80 a4 c0 1d cmp %l3, %i5 200a490: 0a bf ff 43 bcs 200a19c <_Heap_Walk+0x200> <== NEVER TAKEN 200a494: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a498: da 27 bf fc st %o5, [ %fp + -4 ] 200a49c: 90 07 60 08 add %i5, 8, %o0 200a4a0: 7f ff dd b4 call 2001b70 <.urem> 200a4a4: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a4a8: 80 a2 20 00 cmp %o0, 0 200a4ac: 12 80 00 36 bne 200a584 <_Heap_Walk+0x5e8> <== NEVER TAKEN 200a4b0: da 07 bf fc ld [ %fp + -4 ], %o5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a4b4: c2 07 60 04 ld [ %i5 + 4 ], %g1 200a4b8: 82 08 7f fe and %g1, -2, %g1 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200a4bc: 82 07 40 01 add %i5, %g1, %g1 200a4c0: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a4c4: 80 88 60 01 btst 1, %g1 200a4c8: 12 80 00 27 bne 200a564 <_Heap_Walk+0x5c8> <== NEVER TAKEN 200a4cc: a4 10 00 1d mov %i5, %l2 200a4d0: 10 80 00 19 b 200a534 <_Heap_Walk+0x598> 200a4d4: 82 10 00 18 mov %i0, %g1 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 200a4d8: 80 a6 00 1d cmp %i0, %i5 200a4dc: 02 bf ff 37 be 200a1b8 <_Heap_Walk+0x21c> 200a4e0: 80 a7 40 0d cmp %i5, %o5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a4e4: 0a bf ff 2e bcs 200a19c <_Heap_Walk+0x200> 200a4e8: 90 10 00 19 mov %i1, %o0 200a4ec: 80 a7 40 13 cmp %i5, %l3 200a4f0: 18 bf ff 2c bgu 200a1a0 <_Heap_Walk+0x204> <== NEVER TAKEN 200a4f4: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a4f8: da 27 bf fc st %o5, [ %fp + -4 ] 200a4fc: 90 07 60 08 add %i5, 8, %o0 200a500: 7f ff dd 9c call 2001b70 <.urem> 200a504: 92 10 00 14 mov %l4, %o1 ); return false; } if ( 200a508: 80 a2 20 00 cmp %o0, 0 200a50c: 12 80 00 1e bne 200a584 <_Heap_Walk+0x5e8> 200a510: da 07 bf fc ld [ %fp + -4 ], %o5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a514: de 07 60 04 ld [ %i5 + 4 ], %o7 200a518: 82 10 00 12 mov %l2, %g1 200a51c: 9e 0b ff fe and %o7, -2, %o7 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200a520: 9e 03 c0 1d add %o7, %i5, %o7 200a524: de 03 e0 04 ld [ %o7 + 4 ], %o7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a528: 80 8b e0 01 btst 1, %o7 200a52c: 12 80 00 0e bne 200a564 <_Heap_Walk+0x5c8> 200a530: a4 10 00 1d mov %i5, %l2 ); return false; } if ( free_block->prev != prev_block ) { 200a534: d8 07 60 0c ld [ %i5 + 0xc ], %o4 200a538: 80 a3 00 01 cmp %o4, %g1 200a53c: 22 bf ff e7 be,a 200a4d8 <_Heap_Walk+0x53c> 200a540: fa 07 60 08 ld [ %i5 + 8 ], %i5 (*printer)( 200a544: 90 10 00 19 mov %i1, %o0 200a548: 92 10 20 01 mov 1, %o1 200a54c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a550: 96 10 00 1d mov %i5, %o3 200a554: 9f c5 c0 00 call %l7 200a558: 94 12 a2 20 or %o2, 0x220, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a55c: 10 bf fe d9 b 200a0c0 <_Heap_Walk+0x124> 200a560: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200a564: 90 10 00 19 mov %i1, %o0 200a568: 92 10 20 01 mov 1, %o1 200a56c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a570: 96 10 00 1d mov %i5, %o3 200a574: 9f c5 c0 00 call %l7 200a578: 94 12 a2 00 or %o2, 0x200, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a57c: 10 bf fe d1 b 200a0c0 <_Heap_Walk+0x124> 200a580: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 200a584: 90 10 00 19 mov %i1, %o0 200a588: 92 10 20 01 mov 1, %o1 200a58c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a590: 96 10 00 1d mov %i5, %o3 200a594: 9f c5 c0 00 call %l7 200a598: 94 12 a1 d0 or %o2, 0x1d0, %o2 if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a59c: 10 bf fe c9 b 200a0c0 <_Heap_Walk+0x124> 200a5a0: 82 10 20 00 clr %g1 =============================================================================== 0200860c <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 200860c: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2008610: 39 00 80 7c sethi %hi(0x201f000), %i4 2008614: c2 07 22 44 ld [ %i4 + 0x244 ], %g1 ! 201f244 <_IO_Number_of_drivers> 2008618: ba 10 20 00 clr %i5 200861c: 80 a0 60 00 cmp %g1, 0 2008620: 02 80 00 0b be 200864c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2008624: b8 17 22 44 or %i4, 0x244, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2008628: 90 10 00 1d mov %i5, %o0 200862c: 92 10 20 00 clr %o1 2008630: 40 00 16 22 call 200deb8 2008634: 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 ++ ) 2008638: c2 07 00 00 ld [ %i4 ], %g1 200863c: ba 07 60 01 inc %i5 2008640: 80 a0 40 1d cmp %g1, %i5 2008644: 18 bf ff fa bgu 200862c <_IO_Initialize_all_drivers+0x20> 2008648: 90 10 00 1d mov %i5, %o0 200864c: 81 c7 e0 08 ret 2008650: 81 e8 00 00 restore =============================================================================== 0200853c <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 200853c: 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; 2008540: 03 00 80 76 sethi %hi(0x201d800), %g1 2008544: 82 10 62 ec or %g1, 0x2ec, %g1 ! 201daec drivers_in_table = Configuration.number_of_device_drivers; 2008548: f8 00 60 3c ld [ %g1 + 0x3c ], %i4 number_of_drivers = Configuration.maximum_drivers; 200854c: f6 00 60 38 ld [ %g1 + 0x38 ], %i3 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 2008550: 80 a7 00 1b cmp %i4, %i3 2008554: 0a 80 00 08 bcs 2008574 <_IO_Manager_initialization+0x38> 2008558: fa 00 60 40 ld [ %g1 + 0x40 ], %i5 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 200855c: 03 00 80 7c sethi %hi(0x201f000), %g1 2008560: fa 20 62 48 st %i5, [ %g1 + 0x248 ] ! 201f248 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2008564: 03 00 80 7c sethi %hi(0x201f000), %g1 2008568: f8 20 62 44 st %i4, [ %g1 + 0x244 ] ! 201f244 <_IO_Number_of_drivers> return; 200856c: 81 c7 e0 08 ret 2008570: 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 ) 2008574: 83 2e e0 03 sll %i3, 3, %g1 2008578: b5 2e e0 05 sll %i3, 5, %i2 200857c: 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( 2008580: 40 00 0d 5a call 200bae8 <_Workspace_Allocate_or_fatal_error> 2008584: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008588: 03 00 80 7c sethi %hi(0x201f000), %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 *) 200858c: 33 00 80 7c sethi %hi(0x201f000), %i1 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 2008590: f6 20 62 44 st %i3, [ %g1 + 0x244 ] /* * 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 *) 2008594: d0 26 62 48 st %o0, [ %i1 + 0x248 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 2008598: 92 10 20 00 clr %o1 200859c: 40 00 23 24 call 201122c 20085a0: 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++ ) 20085a4: 80 a7 20 00 cmp %i4, 0 20085a8: 02 bf ff f1 be 200856c <_IO_Manager_initialization+0x30> <== NEVER TAKEN 20085ac: c8 06 62 48 ld [ %i1 + 0x248 ], %g4 * registration. The driver table is now allocated in the * workspace. * */ void _IO_Manager_initialization(void) 20085b0: 85 2f 20 03 sll %i4, 3, %g2 20085b4: b7 2f 20 05 sll %i4, 5, %i3 20085b8: 82 10 20 00 clr %g1 20085bc: b6 26 c0 02 sub %i3, %g2, %i3 _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) _IO_Driver_address_table[index] = driver_table[index]; 20085c0: c4 07 40 01 ld [ %i5 + %g1 ], %g2 20085c4: 86 07 40 01 add %i5, %g1, %g3 20085c8: c4 21 00 01 st %g2, [ %g4 + %g1 ] 20085cc: f8 00 e0 04 ld [ %g3 + 4 ], %i4 20085d0: 84 01 00 01 add %g4, %g1, %g2 20085d4: f8 20 a0 04 st %i4, [ %g2 + 4 ] 20085d8: f8 00 e0 08 ld [ %g3 + 8 ], %i4 20085dc: 82 00 60 18 add %g1, 0x18, %g1 20085e0: f8 20 a0 08 st %i4, [ %g2 + 8 ] 20085e4: f8 00 e0 0c ld [ %g3 + 0xc ], %i4 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20085e8: 80 a0 40 1b cmp %g1, %i3 _IO_Driver_address_table[index] = driver_table[index]; 20085ec: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 20085f0: f8 00 e0 10 ld [ %g3 + 0x10 ], %i4 20085f4: f8 20 a0 10 st %i4, [ %g2 + 0x10 ] 20085f8: 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++ ) 20085fc: 12 bf ff f1 bne 20085c0 <_IO_Manager_initialization+0x84> 2008600: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2008604: 81 c7 e0 08 ret 2008608: 81 e8 00 00 restore =============================================================================== 020093b0 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20093b0: 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 ) 20093b4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20093b8: 80 a0 60 00 cmp %g1, 0 20093bc: 02 80 00 26 be 2009454 <_Objects_Allocate+0xa4> <== NEVER TAKEN 20093c0: ba 10 00 18 mov %i0, %i5 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20093c4: b8 06 20 20 add %i0, 0x20, %i4 20093c8: 7f ff fd 4b call 20088f4 <_Chain_Get> 20093cc: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 20093d0: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 20093d4: 80 a0 60 00 cmp %g1, 0 20093d8: 02 80 00 16 be 2009430 <_Objects_Allocate+0x80> 20093dc: 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 ) { 20093e0: 80 a2 20 00 cmp %o0, 0 20093e4: 02 80 00 15 be 2009438 <_Objects_Allocate+0x88> 20093e8: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 20093ec: c4 07 60 08 ld [ %i5 + 8 ], %g2 20093f0: d0 06 20 08 ld [ %i0 + 8 ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 20093f4: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 20093f8: 03 00 00 3f sethi %hi(0xfc00), %g1 20093fc: 82 10 63 ff or %g1, 0x3ff, %g1 ! ffff 2009400: 90 0a 00 01 and %o0, %g1, %o0 2009404: 82 08 80 01 and %g2, %g1, %g1 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2009408: 40 00 40 83 call 2019614 <.udiv> 200940c: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2009410: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009414: 91 2a 20 02 sll %o0, 2, %o0 2009418: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 200941c: 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 ]--; 2009420: 86 00 ff ff add %g3, -1, %g3 2009424: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2009428: 82 00 bf ff add %g2, -1, %g1 200942c: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2009430: 81 c7 e0 08 ret 2009434: 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 ); 2009438: 40 00 00 10 call 2009478 <_Objects_Extend_information> 200943c: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2009440: 7f ff fd 2d call 20088f4 <_Chain_Get> 2009444: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2009448: b0 92 20 00 orcc %o0, 0, %i0 200944c: 32 bf ff e9 bne,a 20093f0 <_Objects_Allocate+0x40> 2009450: c4 07 60 08 ld [ %i5 + 8 ], %g2 * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) return NULL; 2009454: 81 c7 e0 08 ret 2009458: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02009478 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2009478: 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 ) 200947c: f4 06 20 34 ld [ %i0 + 0x34 ], %i2 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2009480: e2 16 20 0a lduh [ %i0 + 0xa ], %l1 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2009484: 80 a6 a0 00 cmp %i2, 0 2009488: 02 80 00 a5 be 200971c <_Objects_Extend_information+0x2a4> 200948c: e0 16 20 10 lduh [ %i0 + 0x10 ], %l0 block_count = 0; else { block_count = information->maximum / information->allocation_size; 2009490: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 2009494: a1 2c 20 10 sll %l0, 0x10, %l0 2009498: 92 10 00 1b mov %i3, %o1 200949c: 40 00 40 5e call 2019614 <.udiv> 20094a0: 91 34 20 10 srl %l0, 0x10, %o0 20094a4: 91 2a 20 10 sll %o0, 0x10, %o0 20094a8: b3 32 20 10 srl %o0, 0x10, %i1 for ( ; block < block_count; block++ ) { 20094ac: 80 a6 60 00 cmp %i1, 0 20094b0: 02 80 00 a2 be 2009738 <_Objects_Extend_information+0x2c0><== NEVER TAKEN 20094b4: 90 10 00 1b mov %i3, %o0 if ( information->object_blocks[ block ] == NULL ) { 20094b8: c2 06 80 00 ld [ %i2 ], %g1 20094bc: 80 a0 60 00 cmp %g1, 0 20094c0: 02 80 00 a2 be 2009748 <_Objects_Extend_information+0x2d0><== NEVER TAKEN 20094c4: b8 10 00 11 mov %l1, %i4 * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 20094c8: 10 80 00 06 b 20094e0 <_Objects_Extend_information+0x68> 20094cc: ba 10 20 00 clr %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 20094d0: c2 06 80 01 ld [ %i2 + %g1 ], %g1 20094d4: 80 a0 60 00 cmp %g1, 0 20094d8: 22 80 00 08 be,a 20094f8 <_Objects_Extend_information+0x80> 20094dc: b6 10 20 00 clr %i3 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 20094e0: ba 07 60 01 inc %i5 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 20094e4: b8 07 00 1b add %i4, %i3, %i4 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 20094e8: 80 a6 40 1d cmp %i1, %i5 20094ec: 18 bf ff f9 bgu 20094d0 <_Objects_Extend_information+0x58> 20094f0: 83 2f 60 02 sll %i5, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 20094f4: b6 10 20 01 mov 1, %i3 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 20094f8: a1 34 20 10 srl %l0, 0x10, %l0 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 20094fc: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009500: a0 04 00 08 add %l0, %o0, %l0 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2009504: 82 10 63 ff or %g1, 0x3ff, %g1 2009508: 80 a4 00 01 cmp %l0, %g1 200950c: 18 80 00 94 bgu 200975c <_Objects_Extend_information+0x2e4> 2009510: 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; 2009514: 40 00 40 06 call 201952c <.umul> 2009518: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 200951c: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2009520: 80 a0 60 00 cmp %g1, 0 2009524: 02 80 00 6a be 20096cc <_Objects_Extend_information+0x254> 2009528: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 200952c: 40 00 09 61 call 200bab0 <_Workspace_Allocate> 2009530: 01 00 00 00 nop if ( !new_object_block ) 2009534: b4 92 20 00 orcc %o0, 0, %i2 2009538: 02 80 00 89 be 200975c <_Objects_Extend_information+0x2e4> 200953c: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2009540: 80 8e e0 ff btst 0xff, %i3 2009544: 22 80 00 3f be,a 2009640 <_Objects_Extend_information+0x1c8> 2009548: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 200954c: b6 06 60 01 add %i1, 1, %i3 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2009550: 91 2e e0 01 sll %i3, 1, %o0 2009554: 90 02 00 1b add %o0, %i3, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 2009558: 90 04 00 08 add %l0, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 200955c: 90 02 00 11 add %o0, %l1, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2009560: 40 00 09 54 call 200bab0 <_Workspace_Allocate> 2009564: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 2009568: a4 92 20 00 orcc %o0, 0, %l2 200956c: 02 80 00 7a be 2009754 <_Objects_Extend_information+0x2dc> 2009570: b7 2e e0 02 sll %i3, 2, %i3 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2009574: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 2009578: 80 a4 40 01 cmp %l1, %g1 200957c: a6 04 80 1b add %l2, %i3, %l3 2009580: 0a 80 00 57 bcs 20096dc <_Objects_Extend_information+0x264> 2009584: b6 04 c0 1b add %l3, %i3, %i3 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 2009588: 85 2c 60 02 sll %l1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 200958c: 80 a4 60 00 cmp %l1, 0 2009590: 02 80 00 07 be 20095ac <_Objects_Extend_information+0x134><== NEVER TAKEN 2009594: 82 10 20 00 clr %g1 local_table[ index ] = NULL; 2009598: c0 20 40 1b clr [ %g1 + %i3 ] 200959c: 82 00 60 04 add %g1, 4, %g1 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20095a0: 80 a0 40 02 cmp %g1, %g2 20095a4: 32 bf ff fe bne,a 200959c <_Objects_Extend_information+0x124><== NEVER TAKEN 20095a8: c0 20 40 1b clr [ %g1 + %i3 ] <== NOT EXECUTED 20095ac: b3 2e 60 02 sll %i1, 2, %i1 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20095b0: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20095b4: c0 24 80 19 clr [ %l2 + %i1 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20095b8: 82 07 00 03 add %i4, %g3, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 20095bc: 80 a7 00 01 cmp %i4, %g1 20095c0: 1a 80 00 0b bcc 20095ec <_Objects_Extend_information+0x174><== NEVER TAKEN 20095c4: c0 24 c0 19 clr [ %l3 + %i1 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 20095c8: 85 2f 20 02 sll %i4, 2, %g2 20095cc: 87 28 e0 02 sll %g3, 2, %g3 20095d0: 84 06 c0 02 add %i3, %g2, %g2 20095d4: 82 10 20 00 clr %g1 inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 20095d8: c0 20 80 01 clr [ %g2 + %g1 ] 20095dc: 82 00 60 04 add %g1, 4, %g1 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 20095e0: 80 a0 40 03 cmp %g1, %g3 20095e4: 32 bf ff fe bne,a 20095dc <_Objects_Extend_information+0x164> 20095e8: c0 20 80 01 clr [ %g2 + %g1 ] index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 20095ec: 7f ff e4 5e call 2002764 20095f0: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 20095f4: 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( 20095f8: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 20095fc: f2 06 20 34 ld [ %i0 + 0x34 ], %i1 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 2009600: e0 36 20 10 sth %l0, [ %i0 + 0x10 ] 2009604: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009608: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 200960c: e4 26 20 34 st %l2, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 2009610: e6 26 20 30 st %l3, [ %i0 + 0x30 ] information->local_table = local_table; 2009614: f6 26 20 1c st %i3, [ %i0 + 0x1c ] uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2009618: 03 00 00 40 sethi %hi(0x10000), %g1 200961c: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009620: 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) | 2009624: a0 10 40 10 or %g1, %l0, %l0 information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2009628: e0 26 20 0c st %l0, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 200962c: 7f ff e4 52 call 2002774 2009630: 01 00 00 00 nop _Workspace_Free( old_tables ); 2009634: 40 00 09 27 call 200bad0 <_Workspace_Free> 2009638: 90 10 00 19 mov %i1, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 200963c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2009640: bb 2f 60 02 sll %i5, 2, %i5 2009644: f4 20 40 1d st %i2, [ %g1 + %i5 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 2009648: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 200964c: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2009650: d2 00 40 1d ld [ %g1 + %i5 ], %o1 2009654: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 2009658: 90 07 bf f4 add %fp, -12, %o0 200965c: 7f ff fc b6 call 2008934 <_Chain_Initialize> 2009660: 35 00 00 40 sethi %hi(0x10000), %i2 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2009664: 10 80 00 0d b 2009698 <_Objects_Extend_information+0x220> 2009668: b6 06 20 20 add %i0, 0x20, %i3 the_object->id = _Objects_Build_id( 200966c: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2009670: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009674: 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) | 2009678: 84 10 80 1a or %g2, %i2, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 200967c: 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) | 2009680: 84 10 80 1c or %g2, %i4, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009684: 90 10 00 1b mov %i3, %o0 2009688: 92 10 00 01 mov %g1, %o1 index++; 200968c: b8 07 20 01 inc %i4 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 2009690: 7f ff fc 8e call 20088c8 <_Chain_Append> 2009694: 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 ) { 2009698: 7f ff fc 97 call 20088f4 <_Chain_Get> 200969c: 90 07 bf f4 add %fp, -12, %o0 20096a0: 82 92 20 00 orcc %o0, 0, %g1 20096a4: 32 bf ff f2 bne,a 200966c <_Objects_Extend_information+0x1f4> 20096a8: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20096ac: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20096b0: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20096b4: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20096b8: c8 20 c0 1d st %g4, [ %g3 + %i5 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20096bc: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20096c0: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 20096c4: 81 c7 e0 08 ret 20096c8: 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 ); 20096cc: 40 00 09 07 call 200bae8 <_Workspace_Allocate_or_fatal_error> 20096d0: 01 00 00 00 nop 20096d4: 10 bf ff 9b b 2009540 <_Objects_Extend_information+0xc8> 20096d8: b4 10 00 08 mov %o0, %i2 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 20096dc: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 20096e0: b3 2e 60 02 sll %i1, 2, %i1 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 20096e4: 40 00 1e 95 call 2011138 20096e8: 94 10 00 19 mov %i1, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 20096ec: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 20096f0: 94 10 00 19 mov %i1, %o2 20096f4: 40 00 1e 91 call 2011138 20096f8: 90 10 00 13 mov %l3, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 20096fc: d4 16 20 10 lduh [ %i0 + 0x10 ], %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2009700: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2009704: 94 02 80 11 add %o2, %l1, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2009708: 90 10 00 1b mov %i3, %o0 200970c: 40 00 1e 8b call 2011138 2009710: 95 2a a0 02 sll %o2, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2009714: 10 bf ff a8 b 20095b4 <_Objects_Extend_information+0x13c> 2009718: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 200971c: 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 ); 2009720: b8 10 00 11 mov %l1, %i4 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2009724: b6 10 20 01 mov 1, %i3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009728: ba 10 20 00 clr %i5 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 200972c: b2 10 20 00 clr %i1 2009730: 10 bf ff 72 b 20094f8 <_Objects_Extend_information+0x80> 2009734: a1 2c 20 10 sll %l0, 0x10, %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 2009738: b8 10 00 11 mov %l1, %i4 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 200973c: b6 10 20 01 mov 1, %i3 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009740: 10 bf ff 6e b 20094f8 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2009744: ba 10 20 00 clr %i5 <== NOT EXECUTED else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { do_extend = false; 2009748: b6 10 20 00 clr %i3 <== NOT EXECUTED * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 200974c: 10 bf ff 6b b 20094f8 <_Objects_Extend_information+0x80> <== NOT EXECUTED 2009750: ba 10 20 00 clr %i5 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 2009754: 40 00 08 df call 200bad0 <_Workspace_Free> 2009758: 90 10 00 1a mov %i2, %o0 200975c: 81 c7 e0 08 ret 2009760: 81 e8 00 00 restore =============================================================================== 02009814 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2009814: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2009818: 80 a6 60 00 cmp %i1, 0 200981c: 02 80 00 19 be 2009880 <_Objects_Get_information+0x6c> 2009820: 01 00 00 00 nop /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 2009824: 40 00 13 9f call 200e6a0 <_Objects_API_maximum_class> 2009828: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 200982c: 80 a2 20 00 cmp %o0, 0 2009830: 02 80 00 14 be 2009880 <_Objects_Get_information+0x6c> 2009834: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2009838: 0a 80 00 12 bcs 2009880 <_Objects_Get_information+0x6c> 200983c: 03 00 80 7a sethi %hi(0x201e800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2009840: b1 2e 20 02 sll %i0, 2, %i0 2009844: 82 10 60 34 or %g1, 0x34, %g1 2009848: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200984c: 80 a0 60 00 cmp %g1, 0 2009850: 02 80 00 0c be 2009880 <_Objects_Get_information+0x6c> <== NEVER TAKEN 2009854: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2009858: f0 00 40 19 ld [ %g1 + %i1 ], %i0 if ( !info ) 200985c: 80 a6 20 00 cmp %i0, 0 2009860: 02 80 00 08 be 2009880 <_Objects_Get_information+0x6c> <== NEVER TAKEN 2009864: 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 ) 2009868: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 200986c: 80 a0 60 00 cmp %g1, 0 2009870: 02 80 00 04 be 2009880 <_Objects_Get_information+0x6c> 2009874: 01 00 00 00 nop return NULL; #endif return info; } 2009878: 81 c7 e0 08 ret 200987c: 81 e8 00 00 restore { Objects_Information *info; int the_class_api_maximum; if ( !the_class ) return NULL; 2009880: 81 c7 e0 08 ret 2009884: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 02017ff4 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2017ff4: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2017ff8: 80 a6 60 00 cmp %i1, 0 2017ffc: 02 80 00 11 be 2018040 <_Objects_Get_name_as_string+0x4c> 2018000: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 2018004: 02 80 00 0f be 2018040 <_Objects_Get_name_as_string+0x4c> 2018008: ba 96 20 00 orcc %i0, 0, %i5 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 201800c: 02 80 00 3d be 2018100 <_Objects_Get_name_as_string+0x10c> 2018010: 03 00 80 c7 sethi %hi(0x2031c00), %g1 information = _Objects_Get_information_id( tmpId ); 2018014: 7f ff df c7 call 200ff30 <_Objects_Get_information_id> 2018018: 90 10 00 1d mov %i5, %o0 if ( !information ) 201801c: b8 92 20 00 orcc %o0, 0, %i4 2018020: 02 80 00 08 be 2018040 <_Objects_Get_name_as_string+0x4c> 2018024: 92 10 00 1d mov %i5, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 2018028: 7f ff e0 02 call 2010030 <_Objects_Get> 201802c: 94 07 bf f4 add %fp, -12, %o2 switch ( location ) { 2018030: c2 07 bf f4 ld [ %fp + -12 ], %g1 2018034: 80 a0 60 00 cmp %g1, 0 2018038: 22 80 00 05 be,a 201804c <_Objects_Get_name_as_string+0x58> 201803c: c2 0f 20 38 ldub [ %i4 + 0x38 ], %g1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 2018040: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 2018044: 81 c7 e0 08 ret 2018048: 91 e8 00 1a restore %g0, %i2, %o0 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 201804c: 80 a0 60 00 cmp %g1, 0 2018050: 12 80 00 2f bne 201810c <_Objects_Get_name_as_string+0x118> 2018054: c2 02 20 0c ld [ %o0 + 0xc ], %g1 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2018058: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 201805c: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2018060: 85 30 60 08 srl %g1, 8, %g2 lname[ 3 ] = (u32_name >> 0) & 0xff; 2018064: c2 2f bf fb stb %g1, [ %fp + -5 ] lname[ 4 ] = '\0'; 2018068: c0 2f bf fc clrb [ %fp + -4 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 201806c: c8 2f bf f8 stb %g4, [ %fp + -8 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 2018070: c6 2f bf f9 stb %g3, [ %fp + -7 ] lname[ 2 ] = (u32_name >> 8) & 0xff; 2018074: c4 2f bf fa stb %g2, [ %fp + -6 ] lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; s = lname; 2018078: 82 07 bf f8 add %fp, -8, %g1 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 201807c: 80 a6 60 01 cmp %i1, 1 2018080: 02 80 00 27 be 201811c <_Objects_Get_name_as_string+0x128><== NEVER TAKEN 2018084: 86 10 00 1a mov %i2, %g3 2018088: c6 48 40 00 ldsb [ %g1 ], %g3 201808c: 80 a0 e0 00 cmp %g3, 0 2018090: 02 80 00 22 be 2018118 <_Objects_Get_name_as_string+0x124> 2018094: c4 08 40 00 ldub [ %g1 ], %g2 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 2018098: b6 06 7f ff add %i1, -1, %i3 201809c: 39 00 80 c2 sethi %hi(0x2030800), %i4 20180a0: b6 00 40 1b add %g1, %i3, %i3 20180a4: 86 10 00 1a mov %i2, %g3 20180a8: 10 80 00 06 b 20180c0 <_Objects_Get_name_as_string+0xcc> 20180ac: b8 17 20 d8 or %i4, 0xd8, %i4 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 20180b0: c8 48 40 00 ldsb [ %g1 ], %g4 20180b4: 80 a1 20 00 cmp %g4, 0 20180b8: 02 80 00 0e be 20180f0 <_Objects_Get_name_as_string+0xfc> 20180bc: c4 08 40 00 ldub [ %g1 ], %g2 *d = (isprint((unsigned char)*s)) ? *s : '*'; 20180c0: fa 07 00 00 ld [ %i4 ], %i5 20180c4: 88 08 a0 ff and %g2, 0xff, %g4 20180c8: 88 07 40 04 add %i5, %g4, %g4 20180cc: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 20180d0: 80 89 20 97 btst 0x97, %g4 20180d4: 12 80 00 03 bne 20180e0 <_Objects_Get_name_as_string+0xec> 20180d8: 82 00 60 01 inc %g1 20180dc: 84 10 20 2a mov 0x2a, %g2 20180e0: c4 28 c0 00 stb %g2, [ %g3 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 20180e4: 80 a0 40 1b cmp %g1, %i3 20180e8: 12 bf ff f2 bne 20180b0 <_Objects_Get_name_as_string+0xbc> 20180ec: 86 00 e0 01 inc %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 20180f0: 7f ff e4 03 call 20110fc <_Thread_Enable_dispatch> 20180f4: c0 28 c0 00 clrb [ %g3 ] return name; } return NULL; /* unreachable path */ } 20180f8: 81 c7 e0 08 ret 20180fc: 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; 2018100: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 2018104: 10 bf ff c4 b 2018014 <_Objects_Get_name_as_string+0x20> 2018108: fa 00 60 08 ld [ %g1 + 8 ], %i5 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 201810c: 80 a0 60 00 cmp %g1, 0 2018110: 12 bf ff dc bne 2018080 <_Objects_Get_name_as_string+0x8c> 2018114: 80 a6 60 01 cmp %i1, 1 for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { *d = (isprint((unsigned char)*s)) ? *s : '*'; 2018118: 86 10 00 1a mov %i2, %g3 } } *d = '\0'; _Thread_Enable_dispatch(); 201811c: 7f ff e3 f8 call 20110fc <_Thread_Enable_dispatch> 2018120: c0 28 c0 00 clrb [ %g3 ] 2018124: 30 bf ff f5 b,a 20180f8 <_Objects_Get_name_as_string+0x104> =============================================================================== 0201ad84 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 201ad84: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) 201ad88: 80 a6 20 00 cmp %i0, 0 201ad8c: 02 80 00 29 be 201ae30 <_Objects_Get_next+0xac> 201ad90: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( !location_p ) 201ad94: 02 80 00 27 be 201ae30 <_Objects_Get_next+0xac> 201ad98: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 201ad9c: 02 80 00 25 be 201ae30 <_Objects_Get_next+0xac> 201ada0: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 201ada4: 80 a0 60 00 cmp %g1, 0 201ada8: 22 80 00 13 be,a 201adf4 <_Objects_Get_next+0x70> 201adac: 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) 201adb0: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 201adb4: 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); 201adb8: 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) 201adbc: 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); 201adc0: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 201adc4: 80 a0 80 01 cmp %g2, %g1 201adc8: 0a 80 00 13 bcs 201ae14 <_Objects_Get_next+0x90> 201adcc: 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); 201add0: 7f ff d4 98 call 2010030 <_Objects_Get> 201add4: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 201add8: c2 06 80 00 ld [ %i2 ], %g1 201addc: 80 a0 60 00 cmp %g1, 0 201ade0: 32 bf ff f5 bne,a 201adb4 <_Objects_Get_next+0x30> 201ade4: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 *next_id_p = next_id; 201ade8: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 201adec: 81 c7 e0 08 ret 201adf0: 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) 201adf4: c4 16 20 10 lduh [ %i0 + 0x10 ], %g2 201adf8: 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); 201adfc: 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) 201ae00: 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); 201ae04: 90 10 00 18 mov %i0, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 201ae08: 80 a0 80 01 cmp %g2, %g1 201ae0c: 1a bf ff f1 bcc 201add0 <_Objects_Get_next+0x4c> <== ALWAYS TAKEN 201ae10: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 201ae14: 82 10 20 01 mov 1, %g1 201ae18: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 201ae1c: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 201ae20: 82 10 3f ff mov -1, %g1 201ae24: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 201ae28: 81 c7 e0 08 ret 201ae2c: 91 e8 00 08 restore %g0, %o0, %o0 { Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 201ae30: 10 bf ff ef b 201adec <_Objects_Get_next+0x68> 201ae34: 90 10 20 00 clr %o0 =============================================================================== 0201ad94 <_Objects_Get_no_protection>: /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201ad94: c4 02 20 08 ld [ %o0 + 8 ], %g2 if ( information->maximum >= index ) { 201ad98: c2 12 20 10 lduh [ %o0 + 0x10 ], %g1 /* * You can't just extract the index portion or you can get tricked * by a value between 1 and maximum. */ index = id - information->minimum_id + 1; 201ad9c: 92 22 40 02 sub %o1, %g2, %o1 201ada0: 92 02 60 01 inc %o1 if ( information->maximum >= index ) { 201ada4: 80 a2 40 01 cmp %o1, %g1 201ada8: 18 80 00 09 bgu 201adcc <_Objects_Get_no_protection+0x38> 201adac: 93 2a 60 02 sll %o1, 2, %o1 if ( (the_object = information->local_table[ index ]) != NULL ) { 201adb0: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 201adb4: d0 00 40 09 ld [ %g1 + %o1 ], %o0 201adb8: 80 a2 20 00 cmp %o0, 0 201adbc: 02 80 00 05 be 201add0 <_Objects_Get_no_protection+0x3c> <== NEVER TAKEN 201adc0: 82 10 20 01 mov 1, %g1 *location = OBJECTS_LOCAL; return the_object; 201adc4: 81 c3 e0 08 retl 201adc8: c0 22 80 00 clr [ %o2 ] /* * This isn't supported or required yet for Global objects so * if it isn't local, we don't find it. */ *location = OBJECTS_ERROR; 201adcc: 82 10 20 01 mov 1, %g1 return NULL; 201add0: 90 10 20 00 clr %o0 } 201add4: 81 c3 e0 08 retl 201add8: c2 22 80 00 st %g1, [ %o2 ] =============================================================================== 020100a8 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 20100a8: 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; 20100ac: 80 a6 20 00 cmp %i0, 0 20100b0: 12 80 00 06 bne 20100c8 <_Objects_Id_to_name+0x20> 20100b4: 83 36 20 18 srl %i0, 0x18, %g1 20100b8: 03 00 80 c7 sethi %hi(0x2031c00), %g1 20100bc: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 2031fcc <_Per_CPU_Information+0xc> 20100c0: f0 00 60 08 ld [ %g1 + 8 ], %i0 20100c4: 83 36 20 18 srl %i0, 0x18, %g1 20100c8: 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 ) 20100cc: 84 00 7f ff add %g1, -1, %g2 20100d0: 80 a0 a0 02 cmp %g2, 2 20100d4: 18 80 00 11 bgu 2010118 <_Objects_Id_to_name+0x70> 20100d8: 83 28 60 02 sll %g1, 2, %g1 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 20100dc: 05 00 80 c6 sethi %hi(0x2031800), %g2 20100e0: 84 10 a1 b4 or %g2, 0x1b4, %g2 ! 20319b4 <_Objects_Information_table> 20100e4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 20100e8: 80 a0 60 00 cmp %g1, 0 20100ec: 02 80 00 0b be 2010118 <_Objects_Id_to_name+0x70> 20100f0: 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 ]; 20100f4: 85 28 a0 02 sll %g2, 2, %g2 20100f8: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 20100fc: 80 a2 20 00 cmp %o0, 0 2010100: 02 80 00 06 be 2010118 <_Objects_Id_to_name+0x70> <== NEVER TAKEN 2010104: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2010108: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 201010c: 80 a0 60 00 cmp %g1, 0 2010110: 02 80 00 04 be 2010120 <_Objects_Id_to_name+0x78> <== ALWAYS TAKEN 2010114: 92 10 00 18 mov %i0, %o1 tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; 2010118: 81 c7 e0 08 ret 201011c: 91 e8 20 03 restore %g0, 3, %o0 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2010120: 7f ff ff c4 call 2010030 <_Objects_Get> 2010124: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2010128: 80 a2 20 00 cmp %o0, 0 201012c: 02 bf ff fb be 2010118 <_Objects_Id_to_name+0x70> 2010130: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2010134: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2010138: b0 10 20 00 clr %i0 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 201013c: 40 00 03 f0 call 20110fc <_Thread_Enable_dispatch> 2010140: c2 26 40 00 st %g1, [ %i1 ] 2010144: 81 c7 e0 08 ret 2010148: 81 e8 00 00 restore =============================================================================== 02009b28 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2009b28: 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 ); 2009b2c: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 block_count = (information->maximum - index_base) / 2009b30: f6 16 20 14 lduh [ %i0 + 0x14 ], %i3 2009b34: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2009b38: 92 10 00 1b mov %i3, %o1 2009b3c: 40 00 3e b6 call 2019614 <.udiv> 2009b40: 90 22 00 1c sub %o0, %i4, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009b44: 80 a2 20 00 cmp %o0, 0 2009b48: 02 80 00 36 be 2009c20 <_Objects_Shrink_information+0xf8> <== NEVER TAKEN 2009b4c: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2009b50: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2009b54: c2 01 00 00 ld [ %g4 ], %g1 2009b58: 80 a6 c0 01 cmp %i3, %g1 2009b5c: 02 80 00 0f be 2009b98 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2009b60: 82 10 20 00 clr %g1 2009b64: 10 80 00 07 b 2009b80 <_Objects_Shrink_information+0x58> 2009b68: ba 10 20 04 mov 4, %i5 2009b6c: c4 01 00 1d ld [ %g4 + %i5 ], %g2 2009b70: 80 a6 c0 02 cmp %i3, %g2 2009b74: 02 80 00 0a be 2009b9c <_Objects_Shrink_information+0x74> 2009b78: 86 07 60 04 add %i5, 4, %g3 2009b7c: ba 10 00 03 mov %g3, %i5 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009b80: 82 00 60 01 inc %g1 2009b84: 80 a0 40 08 cmp %g1, %o0 2009b88: 12 bf ff f9 bne 2009b6c <_Objects_Shrink_information+0x44> 2009b8c: b8 07 00 1b add %i4, %i3, %i4 2009b90: 81 c7 e0 08 ret 2009b94: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2009b98: ba 10 20 00 clr %i5 <== NOT EXECUTED * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2009b9c: 35 00 00 3f sethi %hi(0xfc00), %i2 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009ba0: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 2009ba4: 10 80 00 05 b 2009bb8 <_Objects_Shrink_information+0x90> 2009ba8: b4 16 a3 ff or %i2, 0x3ff, %i2 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2009bac: 90 96 e0 00 orcc %i3, 0, %o0 2009bb0: 22 80 00 12 be,a 2009bf8 <_Objects_Shrink_information+0xd0> 2009bb4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2009bb8: c2 02 20 08 ld [ %o0 + 8 ], %g1 2009bbc: 82 08 40 1a and %g1, %i2, %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2009bc0: 80 a0 40 1c cmp %g1, %i4 2009bc4: 0a bf ff fa bcs 2009bac <_Objects_Shrink_information+0x84> 2009bc8: f6 02 00 00 ld [ %o0 ], %i3 (index < (index_base + information->allocation_size))) { 2009bcc: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2009bd0: 84 07 00 02 add %i4, %g2, %g2 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2009bd4: 80 a0 40 02 cmp %g1, %g2 2009bd8: 3a bf ff f6 bcc,a 2009bb0 <_Objects_Shrink_information+0x88> 2009bdc: 90 96 e0 00 orcc %i3, 0, %o0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 2009be0: 40 00 10 cd call 200df14 <_Chain_Extract> 2009be4: 01 00 00 00 nop } } while ( the_object ); 2009be8: 90 96 e0 00 orcc %i3, 0, %o0 2009bec: 32 bf ff f4 bne,a 2009bbc <_Objects_Shrink_information+0x94><== ALWAYS TAKEN 2009bf0: c2 02 20 08 ld [ %o0 + 8 ], %g1 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2009bf4: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2009bf8: 40 00 07 b6 call 200bad0 <_Workspace_Free> 2009bfc: d0 00 40 1d ld [ %g1 + %i5 ], %o0 information->object_blocks[ block ] = NULL; 2009c00: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2009c04: 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; 2009c08: c0 20 40 1d clr [ %g1 + %i5 ] information->inactive_per_block[ block ] = 0; 2009c0c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 2009c10: 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; 2009c14: c0 20 c0 1d clr [ %g3 + %i5 ] information->inactive -= information->allocation_size; 2009c18: 82 20 80 01 sub %g2, %g1, %g1 2009c1c: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2009c20: 81 c7 e0 08 ret 2009c24: 81 e8 00 00 restore =============================================================================== 0200fe14 <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200fe14: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200fe18: c2 06 20 08 ld [ %i0 + 8 ], %g1 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200fe1c: 35 00 00 3f sethi %hi(0xfc00), %i2 200fe20: b3 30 60 18 srl %g1, 0x18, %i1 200fe24: b4 16 a3 ff or %i2, 0x3ff, %i2 200fe28: b2 0e 60 07 and %i1, 7, %i1 200fe2c: b4 08 40 1a and %g1, %i2, %i2 200fe30: b2 06 60 04 add %i1, 4, %i1 200fe34: 3b 00 80 7b sethi %hi(0x201ec00), %i5 200fe38: b5 2e a0 02 sll %i2, 2, %i2 200fe3c: ba 17 60 d8 or %i5, 0xd8, %i5 200fe40: b3 2e 60 02 sll %i1, 2, %i1 Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200fe44: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 200fe48: 80 a0 60 00 cmp %g1, 0 200fe4c: 02 80 00 21 be 200fed0 <_POSIX_Keys_Run_destructors+0xbc> 200fe50: b8 10 20 01 mov 1, %i4 200fe54: 86 10 20 01 mov 1, %g3 200fe58: b6 10 00 01 mov %g1, %i3 POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fe5c: c8 07 60 1c ld [ %i5 + 0x1c ], %g4 _POSIX_Keys_Information.local_table [ index ]; 200fe60: 85 2f 20 10 sll %i4, 0x10, %g2 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fe64: 85 30 a0 0e srl %g2, 0xe, %g2 200fe68: c4 01 00 02 ld [ %g4 + %g2 ], %g2 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200fe6c: 80 a0 a0 00 cmp %g2, 0 200fe70: 02 80 00 10 be 200feb0 <_POSIX_Keys_Run_destructors+0x9c> 200fe74: 82 00 80 19 add %g2, %i1, %g1 200fe78: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 200fe7c: 80 a1 20 00 cmp %g4, 0 200fe80: 22 80 00 0d be,a 200feb4 <_POSIX_Keys_Run_destructors+0xa0> 200fe84: b8 07 20 01 inc %i4 void *value = key->Values [ thread_api ][ thread_index ]; 200fe88: c8 00 60 04 ld [ %g1 + 4 ], %g4 200fe8c: d0 01 00 1a ld [ %g4 + %i2 ], %o0 if ( value != NULL ) { 200fe90: 80 a2 20 00 cmp %o0, 0 200fe94: 22 80 00 08 be,a 200feb4 <_POSIX_Keys_Run_destructors+0xa0><== ALWAYS TAKEN 200fe98: b8 07 20 01 inc %i4 key->Values [ thread_api ][ thread_index ] = NULL; 200fe9c: c0 21 00 1a clr [ %g4 + %i2 ] <== NOT EXECUTED (*key->destructor)( value ); 200fea0: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 <== NOT EXECUTED 200fea4: 9f c0 40 00 call %g1 <== NOT EXECUTED 200fea8: 01 00 00 00 nop <== NOT EXECUTED done = false; 200feac: 86 10 20 00 clr %g3 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200feb0: b8 07 20 01 inc %i4 200feb4: 85 2f 20 10 sll %i4, 0x10, %g2 200feb8: 85 30 a0 10 srl %g2, 0x10, %g2 200febc: 80 a6 c0 02 cmp %i3, %g2 200fec0: 1a bf ff e7 bcc 200fe5c <_POSIX_Keys_Run_destructors+0x48> 200fec4: 80 88 e0 ff btst 0xff, %g3 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 200fec8: 22 bf ff e0 be,a 200fe48 <_POSIX_Keys_Run_destructors+0x34><== NEVER TAKEN 200fecc: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 <== NOT EXECUTED 200fed0: 81 c7 e0 08 ret 200fed4: 81 e8 00 00 restore =============================================================================== 0200cf48 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200cf48: 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( 200cf4c: 11 00 80 af sethi %hi(0x202bc00), %o0 200cf50: 92 10 00 18 mov %i0, %o1 200cf54: 90 12 20 9c or %o0, 0x9c, %o0 200cf58: 40 00 0d 84 call 2010568 <_Objects_Get> 200cf5c: 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 ) { 200cf60: c2 07 bf f8 ld [ %fp + -8 ], %g1 200cf64: 80 a0 60 00 cmp %g1, 0 200cf68: 22 80 00 08 be,a 200cf88 <_POSIX_Message_queue_Receive_support+0x40> 200cf6c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200cf70: 40 00 2b 49 call 2017c94 <__errno> 200cf74: b0 10 3f ff mov -1, %i0 200cf78: 82 10 20 09 mov 9, %g1 200cf7c: c2 22 00 00 st %g1, [ %o0 ] } 200cf80: 81 c7 e0 08 ret 200cf84: 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 ) { 200cf88: 84 08 60 03 and %g1, 3, %g2 200cf8c: 80 a0 a0 01 cmp %g2, 1 200cf90: 02 80 00 39 be 200d074 <_POSIX_Message_queue_Receive_support+0x12c> 200cf94: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200cf98: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200cf9c: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200cfa0: 80 a0 80 1a cmp %g2, %i2 200cfa4: 18 80 00 23 bgu 200d030 <_POSIX_Message_queue_Receive_support+0xe8> 200cfa8: 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; 200cfac: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200cfb0: 80 a7 20 00 cmp %i4, 0 200cfb4: 12 80 00 1b bne 200d020 <_POSIX_Message_queue_Receive_support+0xd8> 200cfb8: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200cfbc: 9a 10 00 1d mov %i5, %o5 200cfc0: 90 02 20 1c add %o0, 0x1c, %o0 200cfc4: 92 10 00 18 mov %i0, %o1 200cfc8: 94 10 00 19 mov %i1, %o2 200cfcc: 96 07 bf fc add %fp, -4, %o3 200cfd0: 40 00 08 f5 call 200f3a4 <_CORE_message_queue_Seize> 200cfd4: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200cfd8: 40 00 11 66 call 2011570 <_Thread_Enable_dispatch> 200cfdc: 3b 00 80 af sethi %hi(0x202bc00), %i5 if (msg_prio) { 200cfe0: 80 a6 e0 00 cmp %i3, 0 *msg_prio = _POSIX_Message_queue_Priority_from_core( _Thread_Executing->Wait.count 200cfe4: ba 17 61 10 or %i5, 0x110, %i5 do_wait, timeout ); _Thread_Enable_dispatch(); if (msg_prio) { 200cfe8: 02 80 00 07 be 200d004 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN 200cfec: 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 (unsigned int) ((priority >= 0) ? priority : -priority); 200cff0: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 200cff4: 85 38 e0 1f sra %g3, 0x1f, %g2 200cff8: 86 18 80 03 xor %g2, %g3, %g3 200cffc: 84 20 c0 02 sub %g3, %g2, %g2 *msg_prio = _POSIX_Message_queue_Priority_from_core( 200d000: c4 26 c0 00 st %g2, [ %i3 ] _Thread_Executing->Wait.count ); } if ( !_Thread_Executing->Wait.return_code ) 200d004: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200d008: 80 a0 60 00 cmp %g1, 0 200d00c: 12 80 00 11 bne 200d050 <_POSIX_Message_queue_Receive_support+0x108> 200d010: 01 00 00 00 nop return length_out; 200d014: f0 07 bf fc ld [ %fp + -4 ], %i0 200d018: 81 c7 e0 08 ret 200d01c: 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; 200d020: 99 30 60 0e srl %g1, 0xe, %o4 200d024: 98 1b 20 01 xor %o4, 1, %o4 200d028: 10 bf ff e5 b 200cfbc <_POSIX_Message_queue_Receive_support+0x74> 200d02c: 98 0b 20 01 and %o4, 1, %o4 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { _Thread_Enable_dispatch(); 200d030: 40 00 11 50 call 2011570 <_Thread_Enable_dispatch> 200d034: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200d038: 40 00 2b 17 call 2017c94 <__errno> 200d03c: 01 00 00 00 nop 200d040: 82 10 20 7a mov 0x7a, %g1 ! 7a 200d044: c2 22 00 00 st %g1, [ %o0 ] 200d048: 81 c7 e0 08 ret 200d04c: 81 e8 00 00 restore } if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200d050: 40 00 2b 11 call 2017c94 <__errno> 200d054: b0 10 3f ff mov -1, %i0 200d058: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200d05c: b8 10 00 08 mov %o0, %i4 200d060: 40 00 00 a2 call 200d2e8 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200d064: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200d068: d0 27 00 00 st %o0, [ %i4 ] 200d06c: 81 c7 e0 08 ret 200d070: 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(); 200d074: 40 00 11 3f call 2011570 <_Thread_Enable_dispatch> 200d078: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200d07c: 40 00 2b 06 call 2017c94 <__errno> 200d080: 01 00 00 00 nop 200d084: 82 10 20 09 mov 9, %g1 ! 9 200d088: c2 22 00 00 st %g1, [ %o0 ] 200d08c: 81 c7 e0 08 ret 200d090: 81 e8 00 00 restore =============================================================================== 0200f8e8 <_POSIX_Semaphore_Create_support>: size_t name_len, int pshared, unsigned int value, POSIX_Semaphore_Control **the_sem ) { 200f8e8: 9d e3 bf a0 save %sp, -96, %sp POSIX_Semaphore_Control *the_semaphore; CORE_semaphore_Attributes *the_sem_attr; char *name; /* Sharing semaphores among processes is not currently supported */ if (pshared != 0) 200f8ec: 80 a6 a0 00 cmp %i2, 0 200f8f0: 12 80 00 30 bne 200f9b0 <_POSIX_Semaphore_Create_support+0xc8> 200f8f4: 03 00 80 8c sethi %hi(0x2023000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200f8f8: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> 200f8fc: 84 00 a0 01 inc %g2 200f900: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 200f904: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1 * _POSIX_Semaphore_Allocate */ RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Allocate( void ) { return (POSIX_Semaphore_Control *) 200f908: 35 00 80 8d sethi %hi(0x2023400), %i2 200f90c: 7f ff ed d1 call 200b050 <_Objects_Allocate> 200f910: 90 16 a2 b0 or %i2, 0x2b0, %o0 ! 20236b0 <_POSIX_Semaphore_Information> rtems_set_errno_and_return_minus_one( ENOSYS ); _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { 200f914: ba 92 20 00 orcc %o0, 0, %i5 200f918: 02 80 00 2c be 200f9c8 <_POSIX_Semaphore_Create_support+0xe0> 200f91c: 80 a6 20 00 cmp %i0, 0 /* * Make a copy of the user's string for name just in case it was * dynamically constructed. */ if ( name_arg != NULL ) { 200f920: 02 80 00 1e be 200f998 <_POSIX_Semaphore_Create_support+0xb0> 200f924: 92 10 00 19 mov %i1, %o1 name = _Workspace_String_duplicate( name_arg, name_len ); 200f928: 40 00 04 c6 call 2010c40 <_Workspace_String_duplicate> 200f92c: 90 10 00 18 mov %i0, %o0 if ( !name ) { 200f930: b2 92 20 00 orcc %o0, 0, %i1 200f934: 02 80 00 2d be 200f9e8 <_POSIX_Semaphore_Create_support+0x100><== NEVER TAKEN 200f938: 82 10 20 01 mov 1, %g1 } the_semaphore->process_shared = pshared; if ( name ) { the_semaphore->named = true; 200f93c: 84 10 20 01 mov 1, %g2 } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f940: c0 27 60 10 clr [ %i5 + 0x10 ] if ( name ) { the_semaphore->named = true; 200f944: c4 2f 60 14 stb %g2, [ %i5 + 0x14 ] the_semaphore->open_count = 1; 200f948: c2 27 60 18 st %g1, [ %i5 + 0x18 ] the_semaphore->linked = true; 200f94c: c2 2f 60 15 stb %g1, [ %i5 + 0x15 ] the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200f950: 82 10 3f ff mov -1, %g1 _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f954: 90 07 60 1c add %i5, 0x1c, %o0 200f958: 92 07 60 5c add %i5, 0x5c, %o1 200f95c: 94 10 00 1b mov %i3, %o2 the_sem_attr->discipline = CORE_SEMAPHORE_DISCIPLINES_FIFO; /* * This effectively disables limit checking. */ the_sem_attr->maximum_count = 0xFFFFFFFF; 200f960: c2 27 60 5c st %g1, [ %i5 + 0x5c ] _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f964: 7f ff ec 18 call 200a9c4 <_CORE_semaphore_Initialize> 200f968: c0 27 60 60 clr [ %i5 + 0x60 ] Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200f96c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200f970: b4 16 a2 b0 or %i2, 0x2b0, %i2 200f974: c4 06 a0 1c ld [ %i2 + 0x1c ], %g2 200f978: 83 28 60 02 sll %g1, 2, %g1 200f97c: fa 20 80 01 st %i5, [ %g2 + %g1 ] the_object ); #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) /* ASSERT: information->is_string */ the_object->name.name_p = name; 200f980: f2 27 60 0c st %i1, [ %i5 + 0xc ] &_POSIX_Semaphore_Information, &the_semaphore->Object, name ); *the_sem = the_semaphore; 200f984: fa 27 00 00 st %i5, [ %i4 ] _Thread_Enable_dispatch(); 200f988: 7f ff f3 1a call 200c5f0 <_Thread_Enable_dispatch> 200f98c: b0 10 20 00 clr %i0 return 0; 200f990: 81 c7 e0 08 ret 200f994: 81 e8 00 00 restore } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f998: c0 27 60 10 clr [ %i5 + 0x10 ] if ( name ) { the_semaphore->named = true; the_semaphore->open_count = 1; the_semaphore->linked = true; } else { the_semaphore->named = false; 200f99c: c0 2f 60 14 clrb [ %i5 + 0x14 ] the_semaphore->open_count = 0; 200f9a0: c0 27 60 18 clr [ %i5 + 0x18 ] the_semaphore->linked = false; 200f9a4: c0 2f 60 15 clrb [ %i5 + 0x15 ] _POSIX_Semaphore_Free( the_semaphore ); _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENOMEM ); } } else { name = NULL; 200f9a8: 10 bf ff ea b 200f950 <_POSIX_Semaphore_Create_support+0x68> 200f9ac: b2 10 20 00 clr %i1 CORE_semaphore_Attributes *the_sem_attr; char *name; /* Sharing semaphores among processes is not currently supported */ if (pshared != 0) rtems_set_errno_and_return_minus_one( ENOSYS ); 200f9b0: 40 00 0b 71 call 2012774 <__errno> 200f9b4: b0 10 3f ff mov -1, %i0 200f9b8: 82 10 20 58 mov 0x58, %g1 200f9bc: c2 22 00 00 st %g1, [ %o0 ] 200f9c0: 81 c7 e0 08 ret 200f9c4: 81 e8 00 00 restore _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { _Thread_Enable_dispatch(); 200f9c8: 7f ff f3 0a call 200c5f0 <_Thread_Enable_dispatch> 200f9cc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENOSPC ); 200f9d0: 40 00 0b 69 call 2012774 <__errno> 200f9d4: 01 00 00 00 nop 200f9d8: 82 10 20 1c mov 0x1c, %g1 ! 1c 200f9dc: c2 22 00 00 st %g1, [ %o0 ] 200f9e0: 81 c7 e0 08 ret 200f9e4: 81 e8 00 00 restore RTEMS_INLINE_ROUTINE void _POSIX_Semaphore_Free ( POSIX_Semaphore_Control *the_semaphore ) { _Objects_Free( &_POSIX_Semaphore_Information, &the_semaphore->Object ); 200f9e8: 90 16 a2 b0 or %i2, 0x2b0, %o0 <== NOT EXECUTED 200f9ec: 7f ff ee 86 call 200b404 <_Objects_Free> <== NOT EXECUTED 200f9f0: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED */ if ( name_arg != NULL ) { name = _Workspace_String_duplicate( name_arg, name_len ); if ( !name ) { _POSIX_Semaphore_Free( the_semaphore ); _Thread_Enable_dispatch(); 200f9f4: 7f ff f2 ff call 200c5f0 <_Thread_Enable_dispatch> <== NOT EXECUTED 200f9f8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 200f9fc: 40 00 0b 5e call 2012774 <__errno> <== NOT EXECUTED 200fa00: 01 00 00 00 nop <== NOT EXECUTED 200fa04: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 200fa08: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200fa0c: 81 c7 e0 08 ret <== NOT EXECUTED 200fa10: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200d368 <_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 ]; 200d368: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200d36c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200d370: 80 a0 a0 00 cmp %g2, 0 200d374: 12 80 00 06 bne 200d38c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200d378: 01 00 00 00 nop 200d37c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200d380: 80 a0 a0 01 cmp %g2, 1 200d384: 22 80 00 05 be,a 200d398 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200d388: 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(); 200d38c: 82 13 c0 00 mov %o7, %g1 200d390: 7f ff f5 b5 call 200aa64 <_Thread_Enable_dispatch> 200d394: 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 && 200d398: 80 a0 60 00 cmp %g1, 0 200d39c: 02 bf ff fc be 200d38c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200d3a0: 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--; 200d3a4: 03 00 80 7b sethi %hi(0x201ec00), %g1 200d3a8: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 201ee10 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200d3ac: 92 10 3f ff mov -1, %o1 200d3b0: 84 00 bf ff add %g2, -1, %g2 200d3b4: c4 20 62 10 st %g2, [ %g1 + 0x210 ] return _Thread_Dispatch_disable_level; 200d3b8: c2 00 62 10 ld [ %g1 + 0x210 ], %g1 200d3bc: 82 13 c0 00 mov %o7, %g1 200d3c0: 40 00 01 d9 call 200db24 <_POSIX_Thread_Exit> 200d3c4: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200e85c <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200e85c: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200e860: 7f ff ff f2 call 200e828 <_POSIX_Priority_Is_valid> 200e864: d0 06 40 00 ld [ %i1 ], %o0 200e868: 80 8a 20 ff btst 0xff, %o0 200e86c: 32 80 00 04 bne,a 200e87c <_POSIX_Thread_Translate_sched_param+0x20><== ALWAYS TAKEN 200e870: c0 26 80 00 clr [ %i2 ] return EINVAL; 200e874: 81 c7 e0 08 ret 200e878: 91 e8 20 16 restore %g0, 0x16, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200e87c: 80 a6 20 00 cmp %i0, 0 200e880: 02 80 00 2c be 200e930 <_POSIX_Thread_Translate_sched_param+0xd4> 200e884: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200e888: 80 a6 20 01 cmp %i0, 1 200e88c: 02 80 00 2d be 200e940 <_POSIX_Thread_Translate_sched_param+0xe4> 200e890: 80 a6 20 02 cmp %i0, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200e894: 02 80 00 2d be 200e948 <_POSIX_Thread_Translate_sched_param+0xec> 200e898: 80 a6 20 04 cmp %i0, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200e89c: 12 bf ff f6 bne 200e874 <_POSIX_Thread_Translate_sched_param+0x18> 200e8a0: 01 00 00 00 nop if ( (param->sched_ss_repl_period.tv_sec == 0) && 200e8a4: c2 06 60 08 ld [ %i1 + 8 ], %g1 200e8a8: 80 a0 60 00 cmp %g1, 0 200e8ac: 32 80 00 07 bne,a 200e8c8 <_POSIX_Thread_Translate_sched_param+0x6c> 200e8b0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e8b4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200e8b8: 80 a0 60 00 cmp %g1, 0 200e8bc: 02 bf ff ee be 200e874 <_POSIX_Thread_Translate_sched_param+0x18> 200e8c0: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200e8c4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e8c8: 80 a0 60 00 cmp %g1, 0 200e8cc: 12 80 00 06 bne 200e8e4 <_POSIX_Thread_Translate_sched_param+0x88> 200e8d0: 01 00 00 00 nop 200e8d4: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200e8d8: 80 a0 60 00 cmp %g1, 0 200e8dc: 02 bf ff e6 be 200e874 <_POSIX_Thread_Translate_sched_param+0x18> 200e8e0: 01 00 00 00 nop (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200e8e4: 7f ff f6 d1 call 200c428 <_Timespec_To_ticks> 200e8e8: 90 06 60 08 add %i1, 8, %o0 200e8ec: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200e8f0: 7f ff f6 ce call 200c428 <_Timespec_To_ticks> 200e8f4: 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 ) < 200e8f8: 80 a7 40 08 cmp %i5, %o0 200e8fc: 0a bf ff de bcs 200e874 <_POSIX_Thread_Translate_sched_param+0x18> 200e900: 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 ) ) 200e904: 7f ff ff c9 call 200e828 <_POSIX_Priority_Is_valid> 200e908: d0 06 60 04 ld [ %i1 + 4 ], %o0 200e90c: 80 8a 20 ff btst 0xff, %o0 200e910: 02 bf ff d9 be 200e874 <_POSIX_Thread_Translate_sched_param+0x18> 200e914: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200e918: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200e91c: 03 00 80 20 sethi %hi(0x2008000), %g1 200e920: 82 10 63 d8 or %g1, 0x3d8, %g1 ! 20083d8 <_POSIX_Threads_Sporadic_budget_callout> 200e924: c2 26 c0 00 st %g1, [ %i3 ] return 0; 200e928: 81 c7 e0 08 ret 200e92c: 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; 200e930: 82 10 20 01 mov 1, %g1 200e934: c2 26 80 00 st %g1, [ %i2 ] return 0; 200e938: 81 c7 e0 08 ret 200e93c: 81 e8 00 00 restore *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; } return EINVAL; } 200e940: 81 c7 e0 08 ret 200e944: 91 e8 20 00 restore %g0, 0, %o0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200e948: f0 26 80 00 st %i0, [ %i2 ] return 0; 200e94c: 81 c7 e0 08 ret 200e950: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200d694 <_POSIX_Threads_Delete_extension>: */ static void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200d694: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *the_thread; POSIX_API_Control *api; void **value_ptr; api = deleted->API_Extensions[ THREAD_API_POSIX ]; 200d698: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200d69c: 40 00 09 c2 call 200fda4 <_POSIX_Threads_cancel_run> 200d6a0: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200d6a4: 90 10 00 19 mov %i1, %o0 200d6a8: 40 00 09 db call 200fe14 <_POSIX_Keys_Run_destructors> 200d6ac: ba 06 20 44 add %i0, 0x44, %i5 /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200d6b0: 10 80 00 03 b 200d6bc <_POSIX_Threads_Delete_extension+0x28> 200d6b4: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200d6b8: f8 20 40 00 st %i4, [ %g1 ] <== NOT EXECUTED /* * Wakeup all the tasks which joined with this one */ value_ptr = (void **) deleted->Wait.return_argument; while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) 200d6bc: 7f ff f5 82 call 200acc4 <_Thread_queue_Dequeue> 200d6c0: 90 10 00 1d mov %i5, %o0 200d6c4: 80 a2 20 00 cmp %o0, 0 200d6c8: 32 bf ff fc bne,a 200d6b8 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200d6cc: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200d6d0: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200d6d4: 80 a0 60 04 cmp %g1, 4 200d6d8: 02 80 00 05 be 200d6ec <_POSIX_Threads_Delete_extension+0x58> 200d6dc: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d6e0: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d6e4: 7f ff f8 fb call 200bad0 <_Workspace_Free> 200d6e8: 81 e8 00 00 restore while ( (the_thread = _Thread_queue_Dequeue( &api->Join_List )) ) *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200d6ec: 7f ff f8 6f call 200b8a8 <_Watchdog_Remove> 200d6f0: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d6f4: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d6f8: 7f ff f8 f6 call 200bad0 <_Workspace_Free> 200d6fc: 81 e8 00 00 restore =============================================================================== 020080ec <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 20080ec: 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; 20080f0: 03 00 80 8a sethi %hi(0x2022800), %g1 20080f4: 82 10 61 10 or %g1, 0x110, %g1 ! 2022910 maximum = Configuration_POSIX_API.number_of_initialization_threads; 20080f8: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 20080fc: 80 a6 e0 00 cmp %i3, 0 2008100: 02 80 00 18 be 2008160 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2008104: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2008108: 80 a7 60 00 cmp %i5, 0 200810c: 02 80 00 15 be 2008160 <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2008110: 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 ); 2008114: 40 00 1a 10 call 200e954 2008118: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 200811c: 92 10 20 02 mov 2, %o1 2008120: 40 00 1a 19 call 200e984 2008124: 90 07 bf c0 add %fp, -64, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2008128: d2 07 60 04 ld [ %i5 + 4 ], %o1 200812c: 40 00 1a 26 call 200e9c4 2008130: 90 07 bf c0 add %fp, -64, %o0 status = pthread_create( 2008134: d4 07 40 00 ld [ %i5 ], %o2 2008138: 90 07 bf bc add %fp, -68, %o0 200813c: 92 07 bf c0 add %fp, -64, %o1 2008140: 7f ff fe fe call 2007d38 2008144: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 2008148: 94 92 20 00 orcc %o0, 0, %o2 200814c: 12 80 00 07 bne 2008168 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 2008150: 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++ ) { 2008154: 80 a7 00 1b cmp %i4, %i3 2008158: 12 bf ff ef bne 2008114 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 200815c: ba 07 60 08 add %i5, 8, %i5 2008160: 81 c7 e0 08 ret 2008164: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 2008168: 90 10 20 02 mov 2, %o0 200816c: 40 00 08 7b call 200a358 <_Internal_error_Occurred> 2008170: 92 10 20 01 mov 1, %o1 =============================================================================== 0200d820 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200d820: 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 ]; 200d824: 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 ); 200d828: 40 00 04 71 call 200e9ec <_Timespec_To_ticks> 200d82c: 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); 200d830: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200d834: 03 00 80 76 sethi %hi(0x201d800), %g1 200d838: d2 08 63 38 ldub [ %g1 + 0x338 ], %o1 ! 201db38 */ #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 ) { 200d83c: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200d840: 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; 200d844: d0 26 60 74 st %o0, [ %i1 + 0x74 ] */ #if 0 printk( "TSR %d %d %d\n", the_thread->resource_count, the_thread->current_priority, new_priority ); #endif if ( the_thread->resource_count == 0 ) { 200d848: 80 a0 60 00 cmp %g1, 0 200d84c: 12 80 00 06 bne 200d864 <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200d850: 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 ) { 200d854: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d858: 80 a0 40 09 cmp %g1, %o1 200d85c: 18 80 00 09 bgu 200d880 <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200d860: 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 ); 200d864: 90 07 60 90 add %i5, 0x90, %o0 200d868: 40 00 04 61 call 200e9ec <_Timespec_To_ticks> 200d86c: 31 00 80 7a sethi %hi(0x201e800), %i0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d870: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d874: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d878: 7f ff f7 ad call 200b72c <_Watchdog_Insert> 200d87c: 91 ee 21 78 restore %i0, 0x178, %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 ); 200d880: 7f ff f2 e8 call 200a420 <_Thread_Change_priority> 200d884: 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 ); 200d888: 90 07 60 90 add %i5, 0x90, %o0 200d88c: 40 00 04 58 call 200e9ec <_Timespec_To_ticks> 200d890: 31 00 80 7a sethi %hi(0x201e800), %i0 200d894: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d898: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d89c: 7f ff f7 a4 call 200b72c <_Watchdog_Insert> 200d8a0: 91 ee 21 78 restore %i0, 0x178, %o0 =============================================================================== 0200d8a4 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d8a4: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200d8a8: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200d8ac: 05 00 80 76 sethi %hi(0x201d800), %g2 200d8b0: d2 08 a3 38 ldub [ %g2 + 0x338 ], %o1 ! 201db38 */ #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 ) { 200d8b4: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200d8b8: 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 */ 200d8bc: 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; 200d8c0: 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 ) { 200d8c4: 80 a0 a0 00 cmp %g2, 0 200d8c8: 12 80 00 06 bne 200d8e0 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200d8cc: c6 22 20 74 st %g3, [ %o0 + 0x74 ] /* * Make sure we are actually lowering it. If they have lowered it * to logically lower than sched_ss_low_priority, then we do not want to * change it. */ if ( the_thread->current_priority < new_priority ) { 200d8d0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200d8d4: 80 a0 40 09 cmp %g1, %o1 200d8d8: 0a 80 00 04 bcs 200d8e8 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200d8dc: 94 10 20 01 mov 1, %o2 200d8e0: 81 c3 e0 08 retl <== NOT EXECUTED 200d8e4: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200d8e8: 82 13 c0 00 mov %o7, %g1 200d8ec: 7f ff f2 cd call 200a420 <_Thread_Change_priority> 200d8f0: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200fda4 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200fda4: 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 ]; 200fda8: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200fdac: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200fdb0: 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 ); 200fdb4: b6 07 20 e8 add %i4, 0xe8, %i3 200fdb8: 80 a0 40 1b cmp %g1, %i3 200fdbc: 02 80 00 14 be 200fe0c <_POSIX_Threads_cancel_run+0x68> 200fdc0: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200fdc4: 7f ff ca 68 call 2002764 200fdc8: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200fdcc: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200fdd0: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200fdd4: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200fdd8: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200fddc: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200fde0: 7f ff ca 65 call 2002774 200fde4: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200fde8: c2 07 60 08 ld [ %i5 + 8 ], %g1 200fdec: 9f c0 40 00 call %g1 200fdf0: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200fdf4: 7f ff ef 37 call 200bad0 <_Workspace_Free> 200fdf8: 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 ) ) { 200fdfc: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200fe00: 80 a0 40 1b cmp %g1, %i3 200fe04: 12 bf ff f0 bne 200fdc4 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200fe08: 01 00 00 00 nop 200fe0c: 81 c7 e0 08 ret 200fe10: 81 e8 00 00 restore =============================================================================== 02007b74 <_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) { 2007b74: 9d e3 bf 98 save %sp, -104, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 2007b78: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007b7c: 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; 2007b80: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007b84: 80 a0 60 00 cmp %g1, 0 2007b88: 12 80 00 0e bne 2007bc0 <_POSIX_Timer_TSR+0x4c> 2007b8c: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 2007b90: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2007b94: 80 a0 60 00 cmp %g1, 0 2007b98: 32 80 00 0b bne,a 2007bc4 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 2007b9c: 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; 2007ba0: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 2007ba4: 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 ) ) { 2007ba8: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 2007bac: 40 00 18 7d call 200dda0 2007bb0: 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; 2007bb4: c0 26 60 68 clr [ %i1 + 0x68 ] 2007bb8: 81 c7 e0 08 ret 2007bbc: 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( 2007bc0: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2007bc4: d4 06 60 08 ld [ %i1 + 8 ], %o2 2007bc8: 90 06 60 10 add %i1, 0x10, %o0 2007bcc: 98 10 00 19 mov %i1, %o4 2007bd0: 17 00 80 1e sethi %hi(0x2007800), %o3 2007bd4: 40 00 19 96 call 200e22c <_POSIX_Timer_Insert_helper> 2007bd8: 96 12 e3 74 or %o3, 0x374, %o3 ! 2007b74 <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2007bdc: 80 8a 20 ff btst 0xff, %o0 2007be0: 02 bf ff f6 be 2007bb8 <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 2007be4: 01 00 00 00 nop struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007be8: 40 00 06 2a call 2009490 <_TOD_Get_as_timestamp> 2007bec: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007bf0: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007bf4: 94 10 20 00 clr %o2 2007bf8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007bfc: 90 10 00 1c mov %i4, %o0 2007c00: 96 12 e2 00 or %o3, 0x200, %o3 2007c04: 40 00 4b 0c call 201a834 <__divdi3> 2007c08: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007c0c: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007c10: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007c14: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007c18: 90 10 00 1c mov %i4, %o0 2007c1c: 96 12 e2 00 or %o3, 0x200, %o3 2007c20: 40 00 4b f0 call 201abe0 <__moddi3> 2007c24: 92 10 00 1d mov %i5, %o1 /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); /* The state really did not change but just to be safe */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2007c28: 82 10 20 03 mov 3, %g1 2007c2c: d2 26 60 70 st %o1, [ %i1 + 0x70 ] 2007c30: 10 bf ff de b 2007ba8 <_POSIX_Timer_TSR+0x34> 2007c34: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200fed8 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200fed8: 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, 200fedc: 98 10 20 01 mov 1, %o4 200fee0: 90 10 00 18 mov %i0, %o0 200fee4: 92 10 00 19 mov %i1, %o1 200fee8: 94 07 bf cc add %fp, -52, %o2 200feec: 40 00 00 2e call 200ffa4 <_POSIX_signals_Clear_signals> 200fef0: 96 10 00 1a mov %i2, %o3 200fef4: 80 8a 20 ff btst 0xff, %o0 200fef8: 02 80 00 23 be 200ff84 <_POSIX_signals_Check_signal+0xac> 200fefc: 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 ) 200ff00: 85 2e 60 02 sll %i1, 2, %g2 200ff04: 37 00 80 7b sethi %hi(0x201ec00), %i3 200ff08: b9 2e 60 04 sll %i1, 4, %i4 200ff0c: b6 16 e2 60 or %i3, 0x260, %i3 200ff10: b8 27 00 02 sub %i4, %g2, %i4 200ff14: 84 06 c0 1c add %i3, %i4, %g2 200ff18: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200ff1c: 80 a7 60 01 cmp %i5, 1 200ff20: 02 80 00 19 be 200ff84 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200ff24: 21 00 80 7b sethi %hi(0x201ec00), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200ff28: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200ff2c: 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, 200ff30: a0 14 22 00 or %l0, 0x200, %l0 200ff34: 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; 200ff38: 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, 200ff3c: 90 07 bf d8 add %fp, -40, %o0 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200ff40: 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, 200ff44: 92 02 60 20 add %o1, 0x20, %o1 200ff48: 40 00 04 7c call 2011138 200ff4c: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200ff50: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200ff54: 80 a0 60 02 cmp %g1, 2 200ff58: 02 80 00 0e be 200ff90 <_POSIX_signals_Check_signal+0xb8> 200ff5c: 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 ); 200ff60: 9f c7 40 00 call %i5 200ff64: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200ff68: d0 04 20 0c ld [ %l0 + 0xc ], %o0 200ff6c: 92 07 bf d8 add %fp, -40, %o1 200ff70: 90 02 20 20 add %o0, 0x20, %o0 200ff74: 40 00 04 71 call 2011138 200ff78: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200ff7c: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200ff80: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200ff84: b0 08 60 01 and %g1, 1, %i0 200ff88: 81 c7 e0 08 ret 200ff8c: 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)( 200ff90: 92 07 bf cc add %fp, -52, %o1 200ff94: 9f c7 40 00 call %i5 200ff98: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200ff9c: 10 bf ff f4 b 200ff6c <_POSIX_signals_Check_signal+0x94> 200ffa0: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 02010774 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 2010774: 9d e3 bf a0 save %sp, -96, %sp 2010778: 84 10 20 01 mov 1, %g2 201077c: 82 06 3f ff add %i0, -1, %g1 clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 2010780: 7f ff c7 f9 call 2002764 2010784: bb 28 80 01 sll %g2, %g1, %i5 if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 2010788: 05 00 80 7b sethi %hi(0x201ec00), %g2 201078c: 83 2e 20 02 sll %i0, 2, %g1 2010790: 84 10 a2 60 or %g2, 0x260, %g2 2010794: b1 2e 20 04 sll %i0, 4, %i0 2010798: 82 26 00 01 sub %i0, %g1, %g1 201079c: c4 00 80 01 ld [ %g2 + %g1 ], %g2 20107a0: 80 a0 a0 02 cmp %g2, 2 20107a4: 02 80 00 08 be 20107c4 <_POSIX_signals_Clear_process_signals+0x50> 20107a8: 31 00 80 7c sethi %hi(0x201f000), %i0 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 20107ac: 03 00 80 7c sethi %hi(0x201f000), %g1 20107b0: c4 00 60 54 ld [ %g1 + 0x54 ], %g2 ! 201f054 <_POSIX_signals_Pending> 20107b4: ba 28 80 1d andn %g2, %i5, %i5 20107b8: fa 20 60 54 st %i5, [ %g1 + 0x54 ] } _ISR_Enable( level ); 20107bc: 7f ff c7 ee call 2002774 20107c0: 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 ] ) ) 20107c4: b0 16 20 58 or %i0, 0x58, %i0 20107c8: c4 00 40 18 ld [ %g1 + %i0 ], %g2 20107cc: b0 00 40 18 add %g1, %i0, %i0 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20107d0: b0 06 20 04 add %i0, 4, %i0 20107d4: 80 a0 80 18 cmp %g2, %i0 20107d8: 02 bf ff f6 be 20107b0 <_POSIX_signals_Clear_process_signals+0x3c><== ALWAYS TAKEN 20107dc: 03 00 80 7c sethi %hi(0x201f000), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 20107e0: 7f ff c7 e5 call 2002774 <== NOT EXECUTED 20107e4: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 020089d8 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20089d8: 82 10 20 1b mov 0x1b, %g1 20089dc: 86 10 20 01 mov 1, %g3 #include #include #include #include static int _POSIX_signals_Get_lowest( 20089e0: 84 00 7f ff add %g1, -1, %g2 20089e4: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20089e8: 80 88 80 08 btst %g2, %o0 20089ec: 12 80 00 11 bne 2008a30 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 20089f0: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20089f4: 82 00 60 01 inc %g1 20089f8: 80 a0 60 20 cmp %g1, 0x20 20089fc: 12 bf ff fa bne 20089e4 <_POSIX_signals_Get_lowest+0xc> 2008a00: 84 00 7f ff add %g1, -1, %g2 2008a04: 82 10 20 01 mov 1, %g1 2008a08: 10 80 00 05 b 2008a1c <_POSIX_signals_Get_lowest+0x44> 2008a0c: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2008a10: 80 a0 60 1b cmp %g1, 0x1b 2008a14: 02 80 00 07 be 2008a30 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2008a18: 01 00 00 00 nop #include #include #include #include static int _POSIX_signals_Get_lowest( 2008a1c: 84 00 7f ff add %g1, -1, %g2 2008a20: 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 ) ) { 2008a24: 80 88 80 08 btst %g2, %o0 2008a28: 22 bf ff fa be,a 2008a10 <_POSIX_signals_Get_lowest+0x38> 2008a2c: 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; } 2008a30: 81 c3 e0 08 retl 2008a34: 90 10 00 01 mov %g1, %o0 =============================================================================== 0200d3e4 <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200d3e4: 9d e3 bf a0 save %sp, -96, %sp /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d3e8: 35 00 80 7b sethi %hi(0x201ec00), %i2 POSIX_API_Control *api; int signo; ISR_Level level; int hold_errno; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d3ec: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * We need to ensure that if the signal handler executes a call * which overwrites the unblocking status, we restore it. */ hold_errno = _Thread_Executing->Wait.return_code; 200d3f0: b4 16 a2 00 or %i2, 0x200, %i2 200d3f4: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200d3f8: 80 a7 20 00 cmp %i4, 0 200d3fc: 02 80 00 34 be 200d4cc <_POSIX_signals_Post_switch_extension+0xe8> 200d400: f2 00 60 34 ld [ %g1 + 0x34 ], %i1 * * The first thing done is to check there are any signals to be * processed at all. No point in doing this loop otherwise. */ while (1) { _ISR_Disable( level ); 200d404: 7f ff d4 d8 call 2002764 200d408: 37 00 80 7c sethi %hi(0x201f000), %i3 200d40c: b6 16 e0 54 or %i3, 0x54, %i3 ! 201f054 <_POSIX_signals_Pending> if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d410: c6 06 c0 00 ld [ %i3 ], %g3 200d414: 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 & 200d418: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d41c: 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 & 200d420: 80 a8 40 02 andncc %g1, %g2, %g0 200d424: 02 80 00 26 be 200d4bc <_POSIX_signals_Post_switch_extension+0xd8> 200d428: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200d42c: 7f ff d4 d2 call 2002774 200d430: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d434: 92 10 00 1d mov %i5, %o1 200d438: 94 10 20 00 clr %o2 200d43c: 40 00 0a a7 call 200fed8 <_POSIX_signals_Check_signal> 200d440: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d444: 92 10 00 1d mov %i5, %o1 200d448: 90 10 00 1c mov %i4, %o0 200d44c: 40 00 0a a3 call 200fed8 <_POSIX_signals_Check_signal> 200d450: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200d454: ba 07 60 01 inc %i5 200d458: 80 a7 60 20 cmp %i5, 0x20 200d45c: 12 bf ff f7 bne 200d438 <_POSIX_signals_Post_switch_extension+0x54> 200d460: 92 10 00 1d mov %i5, %o1 200d464: 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 ); 200d468: 92 10 00 1d mov %i5, %o1 200d46c: 94 10 20 00 clr %o2 200d470: 40 00 0a 9a call 200fed8 <_POSIX_signals_Check_signal> 200d474: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d478: 92 10 00 1d mov %i5, %o1 200d47c: 90 10 00 1c mov %i4, %o0 200d480: 40 00 0a 96 call 200fed8 <_POSIX_signals_Check_signal> 200d484: 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++ ) { 200d488: ba 07 60 01 inc %i5 200d48c: 80 a7 60 1b cmp %i5, 0x1b 200d490: 12 bf ff f7 bne 200d46c <_POSIX_signals_Post_switch_extension+0x88> 200d494: 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 ); 200d498: 7f ff d4 b3 call 2002764 200d49c: 01 00 00 00 nop if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d4a0: c6 06 c0 00 ld [ %i3 ], %g3 200d4a4: 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 & 200d4a8: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d4ac: 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 & 200d4b0: 80 a8 40 02 andncc %g1, %g2, %g0 200d4b4: 12 bf ff de bne 200d42c <_POSIX_signals_Post_switch_extension+0x48><== NEVER TAKEN 200d4b8: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200d4bc: 7f ff d4 ae call 2002774 200d4c0: 01 00 00 00 nop _POSIX_signals_Check_signal( api, signo, false ); _POSIX_signals_Check_signal( api, signo, true ); } } _Thread_Executing->Wait.return_code = hold_errno; 200d4c4: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 200d4c8: f2 20 60 34 st %i1, [ %g1 + 0x34 ] 200d4cc: 81 c7 e0 08 ret 200d4d0: 81 e8 00 00 restore =============================================================================== 0201b414 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201b414: 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 ) ) { 201b418: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201b41c: 05 04 00 20 sethi %hi(0x10008000), %g2 201b420: 88 10 20 01 mov 1, %g4 201b424: 86 06 7f ff add %i1, -1, %g3 201b428: ba 08 40 02 and %g1, %g2, %i5 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201b42c: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201b430: 80 a7 40 02 cmp %i5, %g2 201b434: 02 80 00 2c be 201b4e4 <_POSIX_signals_Unblock_thread+0xd0> 201b438: 87 29 00 03 sll %g4, %g3, %g3 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201b43c: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 201b440: 80 a8 c0 02 andncc %g3, %g2, %g0 201b444: 02 80 00 24 be 201b4d4 <_POSIX_signals_Unblock_thread+0xc0> 201b448: 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 ) ) { 201b44c: 80 88 40 02 btst %g1, %g2 201b450: 02 80 00 15 be 201b4a4 <_POSIX_signals_Unblock_thread+0x90> 201b454: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201b458: 84 10 20 04 mov 4, %g2 201b45c: 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); 201b460: 05 00 00 ef sethi %hi(0x3bc00), %g2 201b464: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 /* * 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) ) 201b468: 80 88 40 02 btst %g1, %g2 201b46c: 12 80 00 38 bne 201b54c <_POSIX_signals_Unblock_thread+0x138> 201b470: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201b474: 22 80 00 19 be,a 201b4d8 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN 201b478: b0 10 20 00 clr %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201b47c: 7f ff c1 0b call 200b8a8 <_Watchdog_Remove> 201b480: 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 ); 201b484: 90 10 00 18 mov %i0, %o0 201b488: 13 04 00 ff sethi %hi(0x1003fc00), %o1 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201b48c: b0 10 20 00 clr %i0 201b490: 7f ff bc 32 call 200a558 <_Thread_Clear_state> 201b494: 92 12 63 f8 or %o1, 0x3f8, %o1 201b498: b0 0e 20 01 and %i0, 1, %i0 201b49c: 81 c7 e0 08 ret 201b4a0: 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 ) { 201b4a4: 32 80 00 0d bne,a 201b4d8 <_POSIX_signals_Unblock_thread+0xc4><== NEVER TAKEN 201b4a8: b0 10 20 00 clr %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201b4ac: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b4b0: 82 10 62 00 or %g1, 0x200, %g1 ! 201ee00 <_Per_CPU_Information> 201b4b4: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b4b8: 80 a0 a0 00 cmp %g2, 0 201b4bc: 22 80 00 07 be,a 201b4d8 <_POSIX_signals_Unblock_thread+0xc4> 201b4c0: b0 10 20 00 clr %i0 201b4c4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201b4c8: 80 a6 00 02 cmp %i0, %g2 201b4cc: 22 80 00 02 be,a 201b4d4 <_POSIX_signals_Unblock_thread+0xc0><== ALWAYS TAKEN 201b4d0: c8 28 60 18 stb %g4, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; 201b4d4: b0 10 20 00 clr %i0 } 201b4d8: b0 0e 20 01 and %i0, 1, %i0 201b4dc: 81 c7 e0 08 ret 201b4e0: 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) ) { 201b4e4: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201b4e8: 80 88 c0 01 btst %g3, %g1 201b4ec: 22 80 00 13 be,a 201b538 <_POSIX_signals_Unblock_thread+0x124> 201b4f0: c2 07 20 d0 ld [ %i4 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201b4f4: 82 10 20 04 mov 4, %g1 201b4f8: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201b4fc: 80 a6 a0 00 cmp %i2, 0 201b500: 02 80 00 19 be 201b564 <_POSIX_signals_Unblock_thread+0x150> 201b504: 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; 201b508: c4 06 80 00 ld [ %i2 ], %g2 201b50c: c4 20 40 00 st %g2, [ %g1 ] 201b510: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201b514: c4 20 60 04 st %g2, [ %g1 + 4 ] 201b518: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201b51c: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201b520: 90 10 00 18 mov %i0, %o0 201b524: 7f ff be f8 call 200b104 <_Thread_queue_Extract_with_proxy> 201b528: b0 10 20 01 mov 1, %i0 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201b52c: b0 0e 20 01 and %i0, 1, %i0 201b530: 81 c7 e0 08 ret 201b534: 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) ) { 201b538: 80 a8 c0 01 andncc %g3, %g1, %g0 201b53c: 32 bf ff ef bne,a 201b4f8 <_POSIX_signals_Unblock_thread+0xe4> 201b540: 82 10 20 04 mov 4, %g1 } else if ( the_thread->current_state == STATES_READY ) { if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; 201b544: 10 bf ff e5 b 201b4d8 <_POSIX_signals_Unblock_thread+0xc4> 201b548: b0 10 20 00 clr %i0 /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 201b54c: 90 10 00 18 mov %i0, %o0 201b550: 7f ff be ed call 200b104 <_Thread_queue_Extract_with_proxy> 201b554: b0 10 20 00 clr %i0 201b558: b0 0e 20 01 and %i0, 1, %i0 201b55c: 81 c7 e0 08 ret 201b560: 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; 201b564: 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; 201b568: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201b56c: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201b570: 10 bf ff ec b 201b520 <_POSIX_signals_Unblock_thread+0x10c> 201b574: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 0200ab6c <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200ab6c: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200ab70: 80 a6 60 00 cmp %i1, 0 200ab74: 02 80 00 4c be 200aca4 <_RBTree_Extract_unprotected+0x138> 200ab78: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200ab7c: c2 06 20 08 ld [ %i0 + 8 ], %g1 200ab80: 80 a0 40 19 cmp %g1, %i1 200ab84: 02 80 00 56 be 200acdc <_RBTree_Extract_unprotected+0x170> 200ab88: 90 10 00 19 mov %i1, %o0 the_rbtree->first[RBT_LEFT] = next; } /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200ab8c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200ab90: 80 a0 40 19 cmp %g1, %i1 200ab94: 02 80 00 56 be 200acec <_RBTree_Extract_unprotected+0x180> 200ab98: 90 10 00 19 mov %i1, %o0 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200ab9c: fa 06 60 04 ld [ %i1 + 4 ], %i5 200aba0: 80 a7 60 00 cmp %i5, 0 200aba4: 22 80 00 5a be,a 200ad0c <_RBTree_Extract_unprotected+0x1a0> 200aba8: f8 06 60 08 ld [ %i1 + 8 ], %i4 200abac: c2 06 60 08 ld [ %i1 + 8 ], %g1 200abb0: 80 a0 60 00 cmp %g1, 0 200abb4: 32 80 00 05 bne,a 200abc8 <_RBTree_Extract_unprotected+0x5c> 200abb8: c2 07 60 08 ld [ %i5 + 8 ], %g1 200abbc: 10 80 00 3c b 200acac <_RBTree_Extract_unprotected+0x140> 200abc0: 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]; 200abc4: c2 07 60 08 ld [ %i5 + 8 ], %g1 200abc8: 80 a0 60 00 cmp %g1, 0 200abcc: 32 bf ff fe bne,a 200abc4 <_RBTree_Extract_unprotected+0x58> 200abd0: ba 10 00 01 mov %g1, %i5 * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 200abd4: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200abd8: 80 a7 20 00 cmp %i4, 0 200abdc: 02 80 00 48 be 200acfc <_RBTree_Extract_unprotected+0x190> 200abe0: 01 00 00 00 nop leaf->parent = target->parent; 200abe4: c2 07 40 00 ld [ %i5 ], %g1 200abe8: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200abec: c4 07 40 00 ld [ %i5 ], %g2 target->parent->child[dir] = leaf; /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200abf0: c2 06 40 00 ld [ %i1 ], %g1 } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; dir = target != target->parent->child[0]; 200abf4: c8 00 a0 04 ld [ %g2 + 4 ], %g4 leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 200abf8: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200abfc: 88 1f 40 04 xor %i5, %g4, %g4 200ac00: 80 a0 00 04 cmp %g0, %g4 200ac04: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200ac08: 89 29 20 02 sll %g4, 2, %g4 200ac0c: 84 00 80 04 add %g2, %g4, %g2 200ac10: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200ac14: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ac18: 84 18 80 19 xor %g2, %i1, %g2 200ac1c: 80 a0 00 02 cmp %g0, %g2 200ac20: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200ac24: 85 28 a0 02 sll %g2, 2, %g2 200ac28: 82 00 40 02 add %g1, %g2, %g1 200ac2c: fa 20 60 04 st %i5, [ %g1 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 200ac30: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ac34: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200ac38: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ac3c: 80 a0 60 00 cmp %g1, 0 200ac40: 32 80 00 02 bne,a 200ac48 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200ac44: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200ac48: c2 06 60 04 ld [ %i1 + 4 ], %g1 200ac4c: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200ac50: c2 06 60 04 ld [ %i1 + 4 ], %g1 200ac54: 80 a0 60 00 cmp %g1, 0 200ac58: 32 80 00 02 bne,a 200ac60 <_RBTree_Extract_unprotected+0xf4> 200ac5c: fa 20 40 00 st %i5, [ %g1 ] /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200ac60: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200ac64: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200ac68: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200ac6c: c2 27 60 0c st %g1, [ %i5 + 0xc ] /* fix coloring. leaf has moved up the tree. The color of the deleted * node is in victim_color. There are two cases: * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node, its child must be red. Paint child black. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 200ac70: 80 a0 e0 00 cmp %g3, 0 200ac74: 32 80 00 06 bne,a 200ac8c <_RBTree_Extract_unprotected+0x120> 200ac78: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200ac7c: 80 a7 20 00 cmp %i4, 0 200ac80: 32 80 00 02 bne,a 200ac88 <_RBTree_Extract_unprotected+0x11c> 200ac84: c0 27 20 0c clr [ %i4 + 0xc ] /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 200ac88: 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; 200ac8c: c0 26 60 08 clr [ %i1 + 8 ] 200ac90: c0 26 60 04 clr [ %i1 + 4 ] 200ac94: 80 a0 60 00 cmp %g1, 0 200ac98: 02 80 00 03 be 200aca4 <_RBTree_Extract_unprotected+0x138> 200ac9c: c0 26 40 00 clr [ %i1 ] 200aca0: c0 20 60 0c clr [ %g1 + 0xc ] 200aca4: 81 c7 e0 08 ret 200aca8: 81 e8 00 00 restore * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 200acac: c2 06 40 00 ld [ %i1 ], %g1 200acb0: 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]; 200acb4: 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; 200acb8: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200acbc: c4 00 60 04 ld [ %g1 + 4 ], %g2 200acc0: 84 18 80 19 xor %g2, %i1, %g2 200acc4: 80 a0 00 02 cmp %g0, %g2 200acc8: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200accc: 85 28 a0 02 sll %g2, 2, %g2 200acd0: 82 00 40 02 add %g1, %g2, %g1 200acd4: 10 bf ff e7 b 200ac70 <_RBTree_Extract_unprotected+0x104> 200acd8: f8 20 60 04 st %i4, [ %g1 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Successor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_RIGHT ); 200acdc: 40 00 00 eb call 200b088 <_RBTree_Next_unprotected> 200ace0: 92 10 20 01 mov 1, %o1 /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { RBTree_Node *next; next = _RBTree_Successor_unprotected(the_node); the_rbtree->first[RBT_LEFT] = next; 200ace4: 10 bf ff aa b 200ab8c <_RBTree_Extract_unprotected+0x20> 200ace8: d0 26 20 08 st %o0, [ %i0 + 8 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Predecessor_unprotected( const RBTree_Node *node ) { return _RBTree_Next_unprotected( node, RBT_LEFT ); 200acec: 40 00 00 e7 call 200b088 <_RBTree_Next_unprotected> 200acf0: 92 10 20 00 clr %o1 /* Check if max needs to be updated. min=max for 1 element trees so * do not use else if here. */ if (the_node == the_rbtree->first[RBT_RIGHT]) { RBTree_Node *previous; previous = _RBTree_Predecessor_unprotected(the_node); the_rbtree->first[RBT_RIGHT] = previous; 200acf4: 10 bf ff aa b 200ab9c <_RBTree_Extract_unprotected+0x30> 200acf8: d0 26 20 0c st %o0, [ %i0 + 0xc ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 200acfc: 7f ff fe d3 call 200a848 <_RBTree_Extract_validate_unprotected> 200ad00: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200ad04: 10 bf ff bb b 200abf0 <_RBTree_Extract_unprotected+0x84> 200ad08: c4 07 40 00 ld [ %i5 ], %g2 * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { 200ad0c: 80 a7 20 00 cmp %i4, 0 200ad10: 32 bf ff e8 bne,a 200acb0 <_RBTree_Extract_unprotected+0x144> 200ad14: 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); 200ad18: 7f ff fe cc call 200a848 <_RBTree_Extract_validate_unprotected> 200ad1c: 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]; 200ad20: 10 bf ff e6 b 200acb8 <_RBTree_Extract_unprotected+0x14c> 200ad24: c2 06 40 00 ld [ %i1 ], %g1 =============================================================================== 0200a848 <_RBTree_Extract_validate_unprotected>: ) { RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200a848: c2 02 00 00 ld [ %o0 ], %g1 if(!parent->parent) return; 200a84c: c4 00 40 00 ld [ %g1 ], %g2 200a850: 80 a0 a0 00 cmp %g2, 0 200a854: 02 80 00 3f be 200a950 <_RBTree_Extract_validate_unprotected+0x108> 200a858: 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]) 200a85c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a860: 80 a2 00 02 cmp %o0, %g2 200a864: 22 80 00 02 be,a 200a86c <_RBTree_Extract_validate_unprotected+0x24> 200a868: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200a86c: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a870: 80 a0 e0 01 cmp %g3, 1 200a874: 02 80 00 32 be 200a93c <_RBTree_Extract_validate_unprotected+0xf4> 200a878: 9a 10 20 01 mov 1, %o5 sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 200a87c: c6 00 40 00 ld [ %g1 ], %g3 200a880: 80 a0 e0 00 cmp %g3, 0 200a884: 02 80 00 2e be 200a93c <_RBTree_Extract_validate_unprotected+0xf4> 200a888: 80 a0 a0 00 cmp %g2, 0 200a88c: 22 80 00 07 be,a 200a8a8 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 200a890: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200a894: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200a898: 80 a1 20 01 cmp %g4, 1 200a89c: 22 80 00 63 be,a 200aa28 <_RBTree_Extract_validate_unprotected+0x1e0> 200a8a0: d8 00 60 04 ld [ %g1 + 4 ], %o4 _RBTree_Rotate(parent, dir); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 200a8a4: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200a8a8: 80 a0 e0 00 cmp %g3, 0 200a8ac: 22 80 00 07 be,a 200a8c8 <_RBTree_Extract_validate_unprotected+0x80> 200a8b0: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a8b4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a8b8: 80 a0 e0 01 cmp %g3, 1 200a8bc: 22 80 00 29 be,a 200a960 <_RBTree_Extract_validate_unprotected+0x118> 200a8c0: c6 00 60 04 ld [ %g1 + 4 ], %g3 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200a8c4: c6 00 a0 04 ld [ %g2 + 4 ], %g3 200a8c8: 80 a0 e0 00 cmp %g3, 0 200a8cc: 22 80 00 07 be,a 200a8e8 <_RBTree_Extract_validate_unprotected+0xa0> 200a8d0: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a8d4: c6 00 e0 0c ld [ %g3 + 0xc ], %g3 200a8d8: 80 a0 e0 01 cmp %g3, 1 200a8dc: 22 80 00 21 be,a 200a960 <_RBTree_Extract_validate_unprotected+0x118> 200a8e0: c6 00 60 04 ld [ %g1 + 4 ], %g3 sibling->color = RBT_RED; 200a8e4: da 20 a0 0c st %o5, [ %g2 + 0xc ] 200a8e8: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a8ec: 80 a0 a0 01 cmp %g2, 1 200a8f0: 22 80 00 99 be,a 200ab54 <_RBTree_Extract_validate_unprotected+0x30c> 200a8f4: c0 20 60 0c clr [ %g1 + 0xc ] if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; 200a8f8: c6 00 40 00 ld [ %g1 ], %g3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a8fc: 80 a0 e0 00 cmp %g3, 0 200a900: 02 80 00 6c be 200aab0 <_RBTree_Extract_validate_unprotected+0x268><== NEVER TAKEN 200a904: 90 10 00 01 mov %g1, %o0 if(!(the_node->parent->parent)) return NULL; 200a908: c4 00 c0 00 ld [ %g3 ], %g2 200a90c: 80 a0 a0 00 cmp %g2, 0 200a910: 02 80 00 69 be 200aab4 <_RBTree_Extract_validate_unprotected+0x26c> 200a914: 84 10 20 00 clr %g2 if(the_node == the_node->parent->child[RBT_LEFT]) 200a918: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200a91c: 80 a0 40 02 cmp %g1, %g2 200a920: 22 80 00 0e be,a 200a958 <_RBTree_Extract_validate_unprotected+0x110> 200a924: c4 00 e0 08 ld [ %g3 + 8 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a928: 82 10 00 03 mov %g3, %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200a92c: c6 02 20 0c ld [ %o0 + 0xc ], %g3 200a930: 80 a0 e0 01 cmp %g3, 1 200a934: 32 bf ff d3 bne,a 200a880 <_RBTree_Extract_validate_unprotected+0x38><== ALWAYS TAKEN 200a938: c6 00 40 00 ld [ %g1 ], %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200a93c: c2 02 00 00 ld [ %o0 ], %g1 200a940: c2 00 40 00 ld [ %g1 ], %g1 200a944: 80 a0 60 00 cmp %g1, 0 200a948: 02 80 00 5f be 200aac4 <_RBTree_Extract_validate_unprotected+0x27c> 200a94c: 01 00 00 00 nop 200a950: 81 c3 e0 08 retl 200a954: 01 00 00 00 nop RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a958: 10 bf ff f5 b 200a92c <_RBTree_Extract_validate_unprotected+0xe4> 200a95c: 82 10 00 03 mov %g3, %g1 * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 200a960: 86 1a 00 03 xor %o0, %g3, %g3 200a964: 80 a0 00 03 cmp %g0, %g3 200a968: 9a 40 20 00 addx %g0, 0, %o5 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a96c: 86 1b 60 01 xor %o5, 1, %g3 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 200a970: 87 28 e0 02 sll %g3, 2, %g3 200a974: 88 00 80 03 add %g2, %g3, %g4 200a978: 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); 200a97c: 80 a1 20 00 cmp %g4, 0 200a980: 22 80 00 07 be,a 200a99c <_RBTree_Extract_validate_unprotected+0x154> 200a984: 9b 2b 60 02 sll %o5, 2, %o5 200a988: d8 01 20 0c ld [ %g4 + 0xc ], %o4 200a98c: 80 a3 20 01 cmp %o4, 1 200a990: 22 80 00 4f be,a 200aacc <_RBTree_Extract_validate_unprotected+0x284> 200a994: d6 00 60 0c ld [ %g1 + 0xc ], %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200a998: 9b 2b 60 02 sll %o5, 2, %o5 200a99c: 98 00 80 0d add %g2, %o5, %o4 200a9a0: c8 03 20 04 ld [ %o4 + 4 ], %g4 * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; 200a9a4: 96 10 20 01 mov 1, %o3 200a9a8: d6 20 a0 0c st %o3, [ %g2 + 0xc ] RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a9ac: 80 a1 20 00 cmp %g4, 0 200a9b0: 02 80 00 15 be 200aa04 <_RBTree_Extract_validate_unprotected+0x1bc><== NEVER TAKEN 200a9b4: c0 21 20 0c clr [ %g4 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a9b8: 96 01 00 03 add %g4, %g3, %o3 200a9bc: d4 02 e0 04 ld [ %o3 + 4 ], %o2 200a9c0: d4 23 20 04 st %o2, [ %o4 + 4 ] if (c->child[dir]) 200a9c4: d8 02 e0 04 ld [ %o3 + 4 ], %o4 200a9c8: 80 a3 20 00 cmp %o4, 0 200a9cc: 32 80 00 02 bne,a 200a9d4 <_RBTree_Extract_validate_unprotected+0x18c> 200a9d0: c4 23 00 00 st %g2, [ %o4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a9d4: d8 00 80 00 ld [ %g2 ], %o4 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200a9d8: 96 01 00 03 add %g4, %g3, %o3 200a9dc: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a9e0: d6 03 20 04 ld [ %o4 + 4 ], %o3 c->parent = the_node->parent; 200a9e4: d8 21 00 00 st %o4, [ %g4 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a9e8: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 200a9ec: c8 20 80 00 st %g4, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a9f0: 80 a0 00 0b cmp %g0, %o3 200a9f4: 84 40 20 00 addx %g0, 0, %g2 200a9f8: 85 28 a0 02 sll %g2, 2, %g2 200a9fc: 98 03 00 02 add %o4, %g2, %o4 200aa00: c8 23 20 04 st %g4, [ %o4 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 200aa04: c8 00 60 0c ld [ %g1 + 0xc ], %g4 dir = the_node != parent->child[0]; if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; 200aa08: 84 00 40 03 add %g1, %g3, %g2 200aa0c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 } sibling->color = parent->color; 200aa10: c8 20 a0 0c st %g4, [ %g2 + 0xc ] 200aa14: 88 00 80 03 add %g2, %g3, %g4 200aa18: c8 01 20 04 ld [ %g4 + 4 ], %g4 parent->color = RBT_BLACK; 200aa1c: c0 20 60 0c clr [ %g1 + 0xc ] sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; 200aa20: 10 80 00 33 b 200aaec <_RBTree_Extract_validate_unprotected+0x2a4> 200aa24: c0 21 20 0c clr [ %g4 + 0xc ] * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 200aa28: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200aa2c: 88 1b 00 08 xor %o4, %o0, %g4 200aa30: 80 a0 00 04 cmp %g0, %g4 200aa34: 94 40 20 00 addx %g0, 0, %o2 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200aa38: 96 1a a0 01 xor %o2, 1, %o3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200aa3c: 97 2a e0 02 sll %o3, 2, %o3 200aa40: 98 00 40 0b add %g1, %o3, %o4 200aa44: c8 03 20 04 ld [ %o4 + 4 ], %g4 200aa48: 80 a1 20 00 cmp %g4, 0 200aa4c: 02 80 00 1c be 200aabc <_RBTree_Extract_validate_unprotected+0x274><== NEVER TAKEN 200aa50: c0 20 a0 0c clr [ %g2 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200aa54: 95 2a a0 02 sll %o2, 2, %o2 200aa58: 84 01 00 0a add %g4, %o2, %g2 200aa5c: d2 00 a0 04 ld [ %g2 + 4 ], %o1 200aa60: d2 23 20 04 st %o1, [ %o4 + 4 ] if (c->child[dir]) 200aa64: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200aa68: 80 a0 a0 00 cmp %g2, 0 200aa6c: 02 80 00 04 be 200aa7c <_RBTree_Extract_validate_unprotected+0x234><== NEVER TAKEN 200aa70: 94 01 00 0a add %g4, %o2, %o2 c->child[dir]->parent = the_node; 200aa74: c2 20 80 00 st %g1, [ %g2 ] 200aa78: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200aa7c: c2 22 a0 04 st %g1, [ %o2 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aa80: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200aa84: c6 21 00 00 st %g3, [ %g4 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aa88: 84 18 40 02 xor %g1, %g2, %g2 200aa8c: 80 a0 00 02 cmp %g0, %g2 200aa90: 84 40 20 00 addx %g0, 0, %g2 200aa94: 85 28 a0 02 sll %g2, 2, %g2 200aa98: 96 00 40 0b add %g1, %o3, %o3 200aa9c: 86 00 c0 02 add %g3, %g2, %g3 c->parent = the_node->parent; the_node->parent = c; 200aaa0: 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; 200aaa4: c8 20 e0 04 st %g4, [ %g3 + 4 ] 200aaa8: 10 bf ff 7f b 200a8a4 <_RBTree_Extract_validate_unprotected+0x5c> 200aaac: c4 02 e0 04 ld [ %o3 + 4 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200aab0: 84 10 20 00 clr %g2 <== NOT EXECUTED 200aab4: 10 bf ff 9e b 200a92c <_RBTree_Extract_validate_unprotected+0xe4> 200aab8: 82 10 00 03 mov %g3, %g1 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200aabc: 10 bf ff 7a b 200a8a4 <_RBTree_Extract_validate_unprotected+0x5c><== NOT EXECUTED 200aac0: 84 10 20 00 clr %g2 <== NOT EXECUTED sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200aac4: 81 c3 e0 08 retl 200aac8: c0 22 20 0c clr [ %o0 + 0xc ] 200aacc: 98 00 40 03 add %g1, %g3, %o4 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; } sibling->color = parent->color; 200aad0: d6 20 a0 0c st %o3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200aad4: c0 20 60 0c clr [ %g1 + 0xc ] 200aad8: c4 03 20 04 ld [ %o4 + 4 ], %g2 200aadc: 80 a0 a0 00 cmp %g2, 0 200aae0: 02 bf ff 97 be 200a93c <_RBTree_Extract_validate_unprotected+0xf4><== NEVER TAKEN 200aae4: c0 21 20 0c clr [ %g4 + 0xc ] 200aae8: 9b 2b 60 02 sll %o5, 2, %o5 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200aaec: 88 00 80 0d add %g2, %o5, %g4 200aaf0: d8 01 20 04 ld [ %g4 + 4 ], %o4 200aaf4: 86 00 40 03 add %g1, %g3, %g3 200aaf8: d8 20 e0 04 st %o4, [ %g3 + 4 ] if (c->child[dir]) 200aafc: c6 01 20 04 ld [ %g4 + 4 ], %g3 200ab00: 80 a0 e0 00 cmp %g3, 0 200ab04: 32 80 00 02 bne,a 200ab0c <_RBTree_Extract_validate_unprotected+0x2c4> 200ab08: c2 20 c0 00 st %g1, [ %g3 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ab0c: c6 00 40 00 ld [ %g1 ], %g3 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200ab10: 9a 00 80 0d add %g2, %o5, %o5 200ab14: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ab18: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 200ab1c: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 200ab20: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ab24: 88 18 40 04 xor %g1, %g4, %g4 200ab28: 80 a0 00 04 cmp %g0, %g4 200ab2c: 82 40 20 00 addx %g0, 0, %g1 200ab30: 83 28 60 02 sll %g1, 2, %g1 200ab34: 86 00 c0 01 add %g3, %g1, %g3 sibling->child[_RBTree_Opposite_direction(dir)]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200ab38: c2 02 00 00 ld [ %o0 ], %g1 200ab3c: c4 20 e0 04 st %g2, [ %g3 + 4 ] 200ab40: c2 00 40 00 ld [ %g1 ], %g1 200ab44: 80 a0 60 00 cmp %g1, 0 200ab48: 12 bf ff 82 bne 200a950 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200ab4c: 01 00 00 00 nop 200ab50: 30 bf ff dd b,a 200aac4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED 200ab54: c2 02 00 00 ld [ %o0 ], %g1 200ab58: c2 00 40 00 ld [ %g1 ], %g1 200ab5c: 80 a0 60 00 cmp %g1, 0 200ab60: 12 bf ff 7c bne 200a950 <_RBTree_Extract_validate_unprotected+0x108><== ALWAYS TAKEN 200ab64: 01 00 00 00 nop 200ab68: 30 bf ff d7 b,a 200aac4 <_RBTree_Extract_validate_unprotected+0x27c><== NOT EXECUTED =============================================================================== 0200b760 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200b760: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200b764: 7f ff e1 a2 call 2003dec 200b768: b8 10 00 18 mov %i0, %i4 200b76c: b6 10 00 08 mov %o0, %i3 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 200b770: fa 06 20 04 ld [ %i0 + 4 ], %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b774: 80 a7 60 00 cmp %i5, 0 200b778: 02 80 00 15 be 200b7cc <_RBTree_Find+0x6c> <== NEVER TAKEN 200b77c: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200b780: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200b784: 92 10 00 1d mov %i5, %o1 200b788: 9f c0 40 00 call %g1 200b78c: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b790: 83 3a 20 1f sra %o0, 0x1f, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 200b794: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200b798: 82 20 40 08 sub %g1, %o0, %g1 200b79c: 83 30 60 1f srl %g1, 0x1f, %g1 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b7a0: 83 28 60 02 sll %g1, 2, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 200b7a4: 12 80 00 06 bne 200b7bc <_RBTree_Find+0x5c> 200b7a8: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200b7ac: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200b7b0: 80 a0 a0 00 cmp %g2, 0 200b7b4: 12 80 00 0a bne 200b7dc <_RBTree_Find+0x7c> 200b7b8: b0 10 00 1d mov %i5, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b7bc: fa 00 60 04 ld [ %g1 + 4 ], %i5 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b7c0: 80 a7 60 00 cmp %i5, 0 200b7c4: 32 bf ff f0 bne,a 200b784 <_RBTree_Find+0x24> 200b7c8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b7cc: 7f ff e1 8c call 2003dfc 200b7d0: 90 10 00 1b mov %i3, %o0 return return_node; } 200b7d4: 81 c7 e0 08 ret 200b7d8: 81 e8 00 00 restore RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b7dc: 7f ff e1 88 call 2003dfc 200b7e0: 90 10 00 1b mov %i3, %o0 return return_node; } 200b7e4: 81 c7 e0 08 ret 200b7e8: 81 e8 00 00 restore =============================================================================== 0200bbcc <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200bbcc: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200bbd0: 80 a6 20 00 cmp %i0, 0 200bbd4: 02 80 00 0f be 200bc10 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bbd8: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200bbdc: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200bbe0: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200bbe4: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200bbe8: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200bbec: f2 26 20 10 st %i1, [ %i0 + 0x10 ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200bbf0: 02 80 00 08 be 200bc10 <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bbf4: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert_unprotected(the_rbtree, next); 200bbf8: 92 10 00 1a mov %i2, %o1 200bbfc: 7f ff ff 0b call 200b828 <_RBTree_Insert_unprotected> 200bc00: 90 10 00 18 mov %i0, %o0 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function, is_unique); count = number_nodes; next = starting_address; while ( count-- ) { 200bc04: b6 86 ff ff addcc %i3, -1, %i3 200bc08: 12 bf ff fc bne 200bbf8 <_RBTree_Initialize+0x2c> 200bc0c: b4 06 80 1c add %i2, %i4, %i2 200bc10: 81 c7 e0 08 ret 200bc14: 81 e8 00 00 restore =============================================================================== 0200ad4c <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200ad4c: 9d e3 bf a0 save %sp, -96, %sp if(!the_node) return (RBTree_Node*)-1; 200ad50: 80 a6 60 00 cmp %i1, 0 200ad54: 02 80 00 9c be 200afc4 <_RBTree_Insert_unprotected+0x278> 200ad58: b8 10 00 18 mov %i0, %i4 RBTree_Node *iter_node = the_rbtree->root; 200ad5c: fa 06 20 04 ld [ %i0 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200ad60: 80 a7 60 00 cmp %i5, 0 200ad64: 32 80 00 05 bne,a 200ad78 <_RBTree_Insert_unprotected+0x2c> 200ad68: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200ad6c: 10 80 00 9a b 200afd4 <_RBTree_Insert_unprotected+0x288> 200ad70: c0 26 60 0c clr [ %i1 + 0xc ] the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); 200ad74: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200ad78: 92 10 00 1d mov %i5, %o1 200ad7c: 9f c0 40 00 call %g1 200ad80: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ad84: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200ad88: b6 38 00 08 xnor %g0, %o0, %i3 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ad8c: 80 a0 a0 00 cmp %g2, 0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200ad90: b7 36 e0 1f srl %i3, 0x1f, %i3 if (!iter_node->child[dir]) { 200ad94: 83 2e e0 02 sll %i3, 2, %g1 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200ad98: 02 80 00 05 be 200adac <_RBTree_Insert_unprotected+0x60> 200ad9c: 82 07 40 01 add %i5, %g1, %g1 200ada0: 80 a2 20 00 cmp %o0, 0 200ada4: 02 80 00 8a be 200afcc <_RBTree_Insert_unprotected+0x280> 200ada8: 01 00 00 00 nop return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { 200adac: f0 00 60 04 ld [ %g1 + 4 ], %i0 200adb0: 80 a6 20 00 cmp %i0, 0 200adb4: 32 bf ff f0 bne,a 200ad74 <_RBTree_Insert_unprotected+0x28> 200adb8: ba 10 00 18 mov %i0, %i5 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 200adbc: c4 07 20 10 ld [ %i4 + 0x10 ], %g2 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200adc0: b4 06 e0 02 add %i3, 2, %i2 200adc4: 87 2e a0 02 sll %i2, 2, %g3 200adc8: d2 07 00 03 ld [ %i4 + %g3 ], %o1 compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200adcc: c0 26 60 08 clr [ %i1 + 8 ] 200add0: c0 26 60 04 clr [ %i1 + 4 ] the_node->color = RBT_RED; iter_node->child[dir] = the_node; 200add4: f2 20 60 04 st %i1, [ %g1 + 4 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200add8: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; 200addc: fa 26 40 00 st %i5, [ %i1 ] if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 200ade0: c2 26 60 0c st %g1, [ %i1 + 0xc ] iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ compare_result = the_rbtree->compare_function( 200ade4: 9f c0 80 00 call %g2 200ade8: 90 10 00 19 mov %i1, %o0 the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || 200adec: 80 a6 e0 00 cmp %i3, 0 200adf0: 12 80 00 10 bne 200ae30 <_RBTree_Insert_unprotected+0xe4> 200adf4: 80 a2 20 00 cmp %o0, 0 200adf8: 06 80 00 10 bl 200ae38 <_RBTree_Insert_unprotected+0xec> 200adfc: b5 2e a0 02 sll %i2, 2, %i2 200ae00: c2 06 40 00 ld [ %i1 ], %g1 if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; g->color = RBT_RED; 200ae04: b4 10 20 01 mov 1, %i2 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200ae08: c4 00 40 00 ld [ %g1 ], %g2 200ae0c: 86 90 a0 00 orcc %g2, 0, %g3 200ae10: 22 80 00 06 be,a 200ae28 <_RBTree_Insert_unprotected+0xdc> 200ae14: c0 26 60 0c clr [ %i1 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200ae18: c8 00 60 0c ld [ %g1 + 0xc ], %g4 200ae1c: 80 a1 20 01 cmp %g4, 1 200ae20: 22 80 00 08 be,a 200ae40 <_RBTree_Insert_unprotected+0xf4> 200ae24: f6 00 80 00 ld [ %g2 ], %i3 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200ae28: 81 c7 e0 08 ret 200ae2c: 81 e8 00 00 restore compare_result = the_rbtree->compare_function( the_node, _RBTree_First(the_rbtree, dir) ); if ( (!dir && _RBTree_Is_lesser(compare_result)) || (dir && _RBTree_Is_greater(compare_result)) ) { 200ae30: 04 bf ff f4 ble 200ae00 <_RBTree_Insert_unprotected+0xb4> 200ae34: b5 2e a0 02 sll %i2, 2, %i2 the_rbtree->first[dir] = the_node; 200ae38: 10 bf ff f2 b 200ae00 <_RBTree_Insert_unprotected+0xb4> 200ae3c: f2 27 00 1a st %i1, [ %i4 + %i2 ] ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(!(the_node->parent->parent->parent)) return NULL; 200ae40: 80 a6 e0 00 cmp %i3, 0 200ae44: 02 80 00 0c be 200ae74 <_RBTree_Insert_unprotected+0x128> <== NEVER TAKEN 200ae48: c8 00 a0 04 ld [ %g2 + 4 ], %g4 { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) 200ae4c: 80 a1 00 01 cmp %g4, %g1 200ae50: 02 80 00 5b be 200afbc <_RBTree_Insert_unprotected+0x270> 200ae54: ba 10 00 04 mov %g4, %i5 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200ae58: 80 a7 60 00 cmp %i5, 0 200ae5c: 22 80 00 07 be,a 200ae78 <_RBTree_Insert_unprotected+0x12c> 200ae60: fa 00 60 04 ld [ %g1 + 4 ], %i5 200ae64: f8 07 60 0c ld [ %i5 + 0xc ], %i4 200ae68: 80 a7 20 01 cmp %i4, 1 200ae6c: 22 80 00 4f be,a 200afa8 <_RBTree_Insert_unprotected+0x25c> 200ae70: c0 20 60 0c clr [ %g1 + 0xc ] the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200ae74: fa 00 60 04 ld [ %g1 + 4 ], %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ae78: 88 18 40 04 xor %g1, %g4, %g4 200ae7c: 80 a0 00 04 cmp %g0, %g4 the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200ae80: ba 1e 40 1d xor %i1, %i5, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ae84: 88 40 20 00 addx %g0, 0, %g4 the_node->parent->color = RBT_BLACK; u->color = RBT_BLACK; g->color = RBT_RED; the_node = g; } else { /* if uncle is black */ RBTree_Direction dir = the_node != the_node->parent->child[0]; 200ae88: 80 a0 00 1d cmp %g0, %i5 200ae8c: ba 40 20 00 addx %g0, 0, %i5 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200ae90: 80 a7 40 04 cmp %i5, %g4 200ae94: 02 80 00 20 be 200af14 <_RBTree_Insert_unprotected+0x1c8> 200ae98: 80 a0 00 04 cmp %g0, %g4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ae9c: b6 60 3f ff subx %g0, -1, %i3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200aea0: b7 2e e0 02 sll %i3, 2, %i3 200aea4: b6 00 40 1b add %g1, %i3, %i3 200aea8: fa 06 e0 04 ld [ %i3 + 4 ], %i5 200aeac: 80 a7 60 00 cmp %i5, 0 200aeb0: 02 80 00 16 be 200af08 <_RBTree_Insert_unprotected+0x1bc> <== NEVER TAKEN 200aeb4: b9 29 20 02 sll %g4, 2, %i4 c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200aeb8: 9e 07 40 1c add %i5, %i4, %o7 200aebc: da 03 e0 04 ld [ %o7 + 4 ], %o5 200aec0: da 26 e0 04 st %o5, [ %i3 + 4 ] if (c->child[dir]) 200aec4: f6 03 e0 04 ld [ %o7 + 4 ], %i3 200aec8: 80 a6 e0 00 cmp %i3, 0 200aecc: 22 80 00 05 be,a 200aee0 <_RBTree_Insert_unprotected+0x194> 200aed0: b6 07 40 1c add %i5, %i4, %i3 c->child[dir]->parent = the_node; 200aed4: c2 26 c0 00 st %g1, [ %i3 ] 200aed8: c4 00 40 00 ld [ %g1 ], %g2 c->child[dir] = the_node; 200aedc: b6 07 40 1c add %i5, %i4, %i3 200aee0: c2 26 e0 04 st %g1, [ %i3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aee4: f6 00 a0 04 ld [ %g2 + 4 ], %i3 c->parent = the_node->parent; 200aee8: c4 27 40 00 st %g2, [ %i5 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aeec: b6 1e c0 01 xor %i3, %g1, %i3 c->parent = the_node->parent; the_node->parent = c; 200aef0: fa 20 40 00 st %i5, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aef4: 80 a0 00 1b cmp %g0, %i3 200aef8: 82 40 20 00 addx %g0, 0, %g1 200aefc: 83 28 60 02 sll %g1, 2, %g1 200af00: 84 00 80 01 add %g2, %g1, %g2 200af04: fa 20 a0 04 st %i5, [ %g2 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200af08: b2 06 40 1c add %i1, %i4, %i1 200af0c: f2 06 60 04 ld [ %i1 + 4 ], %i1 200af10: c2 06 40 00 ld [ %i1 ], %g1 } the_node->parent->color = RBT_BLACK; 200af14: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 200af18: 88 26 80 04 sub %i2, %g4, %g4 200af1c: ba 19 20 01 xor %g4, 1, %i5 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200af20: bb 2f 60 02 sll %i5, 2, %i5 200af24: ba 00 c0 1d add %g3, %i5, %i5 200af28: c4 07 60 04 ld [ %i5 + 4 ], %g2 200af2c: 80 a0 a0 00 cmp %g2, 0 200af30: 02 bf ff b6 be 200ae08 <_RBTree_Insert_unprotected+0xbc> <== NEVER TAKEN 200af34: f4 20 e0 0c st %i2, [ %g3 + 0xc ] c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200af38: 89 29 20 02 sll %g4, 2, %g4 200af3c: 82 00 80 04 add %g2, %g4, %g1 200af40: f8 00 60 04 ld [ %g1 + 4 ], %i4 200af44: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 200af48: c2 00 60 04 ld [ %g1 + 4 ], %g1 200af4c: 80 a0 60 00 cmp %g1, 0 200af50: 32 80 00 02 bne,a 200af58 <_RBTree_Insert_unprotected+0x20c> 200af54: c6 20 40 00 st %g3, [ %g1 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200af58: fa 00 c0 00 ld [ %g3 ], %i5 the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200af5c: 88 00 80 04 add %g2, %g4, %g4 the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; 200af60: fa 20 80 00 st %i5, [ %g2 ] the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 200af64: c6 21 20 04 st %g3, [ %g4 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200af68: c8 07 60 04 ld [ %i5 + 4 ], %g4 c->parent = the_node->parent; the_node->parent = c; 200af6c: c4 20 c0 00 st %g2, [ %g3 ] 200af70: c2 06 40 00 ld [ %i1 ], %g1 if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200af74: 86 18 c0 04 xor %g3, %g4, %g3 200af78: 80 a0 00 03 cmp %g0, %g3 200af7c: 86 40 20 00 addx %g0, 0, %g3 200af80: 87 28 e0 02 sll %g3, 2, %g3 200af84: ba 07 40 03 add %i5, %g3, %i5 200af88: c4 27 60 04 st %g2, [ %i5 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200af8c: c4 00 40 00 ld [ %g1 ], %g2 200af90: 86 90 a0 00 orcc %g2, 0, %g3 200af94: 32 bf ff a2 bne,a 200ae1c <_RBTree_Insert_unprotected+0xd0><== ALWAYS TAKEN 200af98: c8 00 60 0c ld [ %g1 + 0xc ], %g4 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200af9c: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200afa0: 81 c7 e0 08 ret <== NOT EXECUTED 200afa4: 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; 200afa8: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; 200afac: f8 20 a0 0c st %i4, [ %g2 + 0xc ] 200afb0: 82 10 00 1b mov %i3, %g1 200afb4: 10 bf ff 95 b 200ae08 <_RBTree_Insert_unprotected+0xbc> 200afb8: b2 10 00 02 mov %g2, %i1 if(!the_node) return NULL; if(!(the_node->parent)) return NULL; if(!(the_node->parent->parent)) return NULL; if(the_node == the_node->parent->child[RBT_LEFT]) return the_node->parent->child[RBT_RIGHT]; 200afbc: 10 bf ff a7 b 200ae58 <_RBTree_Insert_unprotected+0x10c> 200afc0: fa 00 a0 08 ld [ %g2 + 8 ], %i5 RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { if(!the_node) return (RBTree_Node*)-1; 200afc4: 81 c7 e0 08 ret 200afc8: 91 e8 3f ff restore %g0, -1, %o0 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200afcc: 81 c7 e0 08 ret 200afd0: 91 e8 00 1d restore %g0, %i5, %o0 RBTree_Node *iter_node = the_rbtree->root; int compare_result; if (!iter_node) { /* special case: first node inserted */ the_node->color = RBT_BLACK; the_rbtree->root = the_node; 200afd4: f2 26 20 04 st %i1, [ %i0 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200afd8: f2 26 20 0c st %i1, [ %i0 + 0xc ] 200afdc: f2 26 20 08 st %i1, [ %i0 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200afe0: f0 26 40 00 st %i0, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200afe4: c0 26 60 08 clr [ %i1 + 8 ] 200afe8: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 200afec: 81 c7 e0 08 ret 200aff0: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200b024 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200b024: 9d e3 bf a0 save %sp, -96, %sp */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200b028: 80 a0 00 19 cmp %g0, %i1 200b02c: 82 60 3f ff subx %g0, -1, %g1 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200b030: 82 00 60 02 add %g1, 2, %g1 200b034: 83 28 60 02 sll %g1, 2, %g1 200b038: fa 06 00 01 ld [ %i0 + %g1 ], %i5 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 200b03c: 80 a7 60 00 cmp %i5, 0 200b040: 12 80 00 06 bne 200b058 <_RBTree_Iterate_unprotected+0x34><== ALWAYS TAKEN 200b044: 94 10 00 1b mov %i3, %o2 200b048: 30 80 00 0e b,a 200b080 <_RBTree_Iterate_unprotected+0x5c><== NOT EXECUTED 200b04c: 80 8f 20 ff btst 0xff, %i4 200b050: 02 80 00 0c be 200b080 <_RBTree_Iterate_unprotected+0x5c> <== NEVER TAKEN 200b054: 94 10 00 1b mov %i3, %o2 stop = (*visitor)( current, dir, visitor_arg ); 200b058: 90 10 00 1d mov %i5, %o0 200b05c: 9f c6 80 00 call %i2 200b060: 92 10 00 19 mov %i1, %o1 current = _RBTree_Next_unprotected( current, dir ); 200b064: 92 10 00 19 mov %i1, %o1 RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { stop = (*visitor)( current, dir, visitor_arg ); 200b068: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( current, dir ); 200b06c: 40 00 00 07 call 200b088 <_RBTree_Next_unprotected> 200b070: 90 10 00 1d mov %i5, %o0 { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); const RBTree_Node *current = _RBTree_First( rbtree, opp_dir ); bool stop = false; while ( !stop && current != NULL ) { 200b074: ba 92 20 00 orcc %o0, 0, %i5 200b078: 12 bf ff f5 bne 200b04c <_RBTree_Iterate_unprotected+0x28> 200b07c: b8 1f 20 01 xor %i4, 1, %i4 200b080: 81 c7 e0 08 ret 200b084: 81 e8 00 00 restore =============================================================================== 020081d4 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 20081d4: 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; 20081d8: 03 00 80 76 sethi %hi(0x201d800), %g1 20081dc: 82 10 63 40 or %g1, 0x340, %g1 ! 201db40 20081e0: 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 ) 20081e4: 80 a7 60 00 cmp %i5, 0 20081e8: 02 80 00 18 be 2008248 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 20081ec: 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++ ) { 20081f0: 80 a6 e0 00 cmp %i3, 0 20081f4: 02 80 00 15 be 2008248 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 20081f8: b8 10 20 00 clr %i4 return_value = rtems_task_create( 20081fc: d4 07 60 04 ld [ %i5 + 4 ], %o2 2008200: d0 07 40 00 ld [ %i5 ], %o0 2008204: d2 07 60 08 ld [ %i5 + 8 ], %o1 2008208: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 200820c: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2008210: 7f ff ff 70 call 2007fd0 2008214: 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 ) ) 2008218: 94 92 20 00 orcc %o0, 0, %o2 200821c: 12 80 00 0d bne 2008250 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008220: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2008224: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2008228: 40 00 00 0e call 2008260 200822c: 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 ) ) 2008230: 94 92 20 00 orcc %o0, 0, %o2 2008234: 12 80 00 07 bne 2008250 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008238: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 200823c: 80 a7 00 1b cmp %i4, %i3 2008240: 12 bf ff ef bne 20081fc <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2008244: ba 07 60 1c add %i5, 0x1c, %i5 2008248: 81 c7 e0 08 ret 200824c: 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 ); 2008250: 90 10 20 01 mov 1, %o0 2008254: 40 00 04 2a call 20092fc <_Internal_error_Occurred> 2008258: 92 10 20 01 mov 1, %o1 =============================================================================== 0200dbd0 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200dbd0: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200dbd4: 80 a0 60 00 cmp %g1, 0 200dbd8: 22 80 00 0c be,a 200dc08 <_RTEMS_tasks_Switch_extension+0x38> 200dbdc: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200dbe0: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200dbe4: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200dbe8: c8 00 80 00 ld [ %g2 ], %g4 200dbec: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200dbf0: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200dbf4: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200dbf8: 80 a0 60 00 cmp %g1, 0 200dbfc: 32 bf ff fa bne,a 200dbe4 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200dc00: 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; 200dc04: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200dc08: 80 a0 60 00 cmp %g1, 0 200dc0c: 02 80 00 0d be 200dc40 <_RTEMS_tasks_Switch_extension+0x70> 200dc10: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200dc14: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200dc18: 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; 200dc1c: c8 00 80 00 ld [ %g2 ], %g4 200dc20: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200dc24: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200dc28: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200dc2c: 80 a0 60 00 cmp %g1, 0 200dc30: 32 bf ff fa bne,a 200dc18 <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200dc34: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200dc38: 81 c3 e0 08 retl 200dc3c: 01 00 00 00 nop 200dc40: 81 c3 e0 08 retl =============================================================================== 02037d84 <_Rate_monotonic_Get_status>: bool _Rate_monotonic_Get_status( Rate_monotonic_Control *the_period, Rate_monotonic_Period_time_t *wall_since_last_period, Thread_CPU_usage_t *cpu_since_last_period ) { 2037d84: 9d e3 bf 98 save %sp, -104, %sp #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ Timestamp_Control uptime; #endif Thread_Control *owning_thread = the_period->owner; 2037d88: f6 06 20 40 ld [ %i0 + 0x40 ], %i3 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2037d8c: 7f ff 61 e2 call 2010514 <_TOD_Get_uptime> 2037d90: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_Subtract( 2037d94: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2037d98: f8 1e 20 50 ldd [ %i0 + 0x50 ], %i4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2037d9c: 03 00 81 9d sethi %hi(0x2067400), %g1 2037da0: 82 10 63 10 or %g1, 0x310, %g1 ! 2067710 <_Per_CPU_Information> 2037da4: de 00 60 0c ld [ %g1 + 0xc ], %o7 2037da8: ba a0 c0 1d subcc %g3, %i5, %i5 2037dac: b8 60 80 1c subx %g2, %i4, %i4 2037db0: f8 3e 40 00 std %i4, [ %i1 ] if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2037db4: 88 10 20 01 mov 1, %g4 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 2037db8: 80 a3 c0 1b cmp %o7, %i3 2037dbc: 02 80 00 05 be 2037dd0 <_Rate_monotonic_Get_status+0x4c> 2037dc0: f8 1e e0 80 ldd [ %i3 + 0x80 ], %i4 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 2037dc4: b0 09 20 01 and %g4, 1, %i0 2037dc8: 81 c7 e0 08 ret 2037dcc: 81 e8 00 00 restore 2037dd0: d8 18 60 20 ldd [ %g1 + 0x20 ], %o4 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2037dd4: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 2037dd8: 86 a0 c0 0d subcc %g3, %o5, %g3 2037ddc: 84 60 80 0c subx %g2, %o4, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2037de0: ba 87 40 03 addcc %i5, %g3, %i5 2037de4: b8 47 00 02 addx %i4, %g2, %i4 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2037de8: 80 a6 00 1c cmp %i0, %i4 2037dec: 14 bf ff f6 bg 2037dc4 <_Rate_monotonic_Get_status+0x40> <== NEVER TAKEN 2037df0: 88 10 20 00 clr %g4 2037df4: 02 80 00 09 be 2037e18 <_Rate_monotonic_Get_status+0x94> 2037df8: 80 a6 40 1d cmp %i1, %i5 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2037dfc: ba a7 40 19 subcc %i5, %i1, %i5 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2037e00: 88 10 20 01 mov 1, %g4 2037e04: b8 67 00 18 subx %i4, %i0, %i4 } 2037e08: b0 09 20 01 and %g4, 1, %i0 2037e0c: f8 3e 80 00 std %i4, [ %i2 ] 2037e10: 81 c7 e0 08 ret 2037e14: 81 e8 00 00 restore /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 2037e18: 28 bf ff fa bleu,a 2037e00 <_Rate_monotonic_Get_status+0x7c> 2037e1c: ba a7 40 19 subcc %i5, %i1, %i5 return false; 2037e20: 10 bf ff e9 b 2037dc4 <_Rate_monotonic_Get_status+0x40> 2037e24: 88 10 20 00 clr %g4 =============================================================================== 020381c4 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 20381c4: 9d e3 bf 98 save %sp, -104, %sp 20381c8: 11 00 81 9f sethi %hi(0x2067c00), %o0 20381cc: 92 10 00 18 mov %i0, %o1 20381d0: 90 12 20 d0 or %o0, 0xd0, %o0 20381d4: 7f ff 45 25 call 2009668 <_Objects_Get> 20381d8: 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 ) { 20381dc: c2 07 bf fc ld [ %fp + -4 ], %g1 20381e0: 80 a0 60 00 cmp %g1, 0 20381e4: 12 80 00 17 bne 2038240 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 20381e8: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 20381ec: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 20381f0: 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); 20381f4: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 20381f8: 80 88 80 01 btst %g2, %g1 20381fc: 22 80 00 08 be,a 203821c <_Rate_monotonic_Timeout+0x58> 2038200: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2038204: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2038208: c2 07 60 08 ld [ %i5 + 8 ], %g1 203820c: 80 a0 80 01 cmp %g2, %g1 2038210: 02 80 00 1a be 2038278 <_Rate_monotonic_Timeout+0xb4> 2038214: 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 ) { 2038218: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 203821c: 80 a0 60 01 cmp %g1, 1 2038220: 02 80 00 0a be 2038248 <_Rate_monotonic_Timeout+0x84> 2038224: 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; 2038228: 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--; 203822c: 03 00 81 9c sethi %hi(0x2067000), %g1 2038230: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20671e0 <_Thread_Dispatch_disable_level> 2038234: 84 00 bf ff add %g2, -1, %g2 2038238: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return _Thread_Dispatch_disable_level; 203823c: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 2038240: 81 c7 e0 08 ret 2038244: 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; 2038248: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 203824c: 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; 2038250: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2038254: 7f ff ff 44 call 2037f64 <_Rate_monotonic_Initiate_statistics> 2038258: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 203825c: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038260: 11 00 81 9c sethi %hi(0x2067000), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2038264: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038268: 90 12 22 88 or %o0, 0x288, %o0 203826c: 7f ff 4c 5f call 200b3e8 <_Watchdog_Insert> 2038270: 92 07 60 10 add %i5, 0x10, %o1 2038274: 30 bf ff ee b,a 203822c <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2038278: 7f ff 47 e7 call 200a214 <_Thread_Clear_state> 203827c: 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 ); 2038280: 10 bf ff f5 b 2038254 <_Rate_monotonic_Timeout+0x90> 2038284: 90 10 00 1d mov %i5, %o0 =============================================================================== 02037e28 <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 2037e28: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2037e2c: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037e30: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2037e34: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2037e38: 80 a0 60 04 cmp %g1, 4 2037e3c: 02 80 00 32 be 2037f04 <_Rate_monotonic_Update_statistics+0xdc> 2037e40: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 2037e44: 90 10 00 18 mov %i0, %o0 2037e48: 92 07 bf f8 add %fp, -8, %o1 2037e4c: 7f ff ff ce call 2037d84 <_Rate_monotonic_Get_status> 2037e50: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 2037e54: 80 8a 20 ff btst 0xff, %o0 2037e58: 02 80 00 21 be 2037edc <_Rate_monotonic_Update_statistics+0xb4> 2037e5c: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2037e60: f8 1e 20 70 ldd [ %i0 + 0x70 ], %i4 * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 2037e64: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2037e68: ba 87 40 03 addcc %i5, %g3, %i5 2037e6c: b8 47 00 02 addx %i4, %g2, %i4 2037e70: 80 a0 40 02 cmp %g1, %g2 2037e74: 04 80 00 1c ble 2037ee4 <_Rate_monotonic_Update_statistics+0xbc> 2037e78: f8 3e 20 70 std %i4, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 2037e7c: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2037e80: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 2037e84: 80 a0 40 02 cmp %g1, %g2 2037e88: 26 80 00 05 bl,a 2037e9c <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 2037e8c: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 2037e90: 80 a0 40 02 cmp %g1, %g2 2037e94: 22 80 00 28 be,a 2037f34 <_Rate_monotonic_Update_statistics+0x10c><== ALWAYS TAKEN 2037e98: c2 06 20 6c ld [ %i0 + 0x6c ], %g1 /* * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); 2037e9c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 2037ea0: f8 1e 20 88 ldd [ %i0 + 0x88 ], %i4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2037ea4: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2037ea8: ba 87 40 03 addcc %i5, %g3, %i5 2037eac: b8 47 00 02 addx %i4, %g2, %i4 2037eb0: 80 a0 40 02 cmp %g1, %g2 2037eb4: 14 80 00 1b bg 2037f20 <_Rate_monotonic_Update_statistics+0xf8> 2037eb8: f8 3e 20 88 std %i4, [ %i0 + 0x88 ] 2037ebc: 80 a0 40 02 cmp %g1, %g2 2037ec0: 22 80 00 15 be,a 2037f14 <_Rate_monotonic_Update_statistics+0xec><== ALWAYS TAKEN 2037ec4: c2 06 20 7c ld [ %i0 + 0x7c ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037ec8: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 2037ecc: 80 a0 40 02 cmp %g1, %g2 2037ed0: 16 80 00 1e bge 2037f48 <_Rate_monotonic_Update_statistics+0x120><== ALWAYS TAKEN 2037ed4: 01 00 00 00 nop stats->max_wall_time = since_last_period; 2037ed8: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 2037edc: 81 c7 e0 08 ret 2037ee0: 81 e8 00 00 restore * Update CPU time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) 2037ee4: 32 bf ff e8 bne,a 2037e84 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 2037ee8: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 2037eec: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 2037ef0: 80 a0 40 03 cmp %g1, %g3 2037ef4: 28 bf ff e4 bleu,a 2037e84 <_Rate_monotonic_Update_statistics+0x5c> 2037ef8: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 2037efc: 10 bf ff e1 b 2037e80 <_Rate_monotonic_Update_statistics+0x58> 2037f00: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2037f04: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2037f08: 82 00 60 01 inc %g1 2037f0c: 10 bf ff ce b 2037e44 <_Rate_monotonic_Update_statistics+0x1c> 2037f10: c2 26 20 5c st %g1, [ %i0 + 0x5c ] * Update Wall time */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 2037f14: 80 a0 40 03 cmp %g1, %g3 2037f18: 28 bf ff ed bleu,a 2037ecc <_Rate_monotonic_Update_statistics+0xa4> 2037f1c: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037f20: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2037f24: 80 a0 40 02 cmp %g1, %g2 2037f28: 06 bf ff ec bl 2037ed8 <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 2037f2c: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 2037f30: 30 80 00 06 b,a 2037f48 <_Rate_monotonic_Update_statistics+0x120> _Timestamp_Add_to( &stats->total_cpu_time, &executed ); if ( _Timestamp_Less_than( &executed, &stats->min_cpu_time ) ) stats->min_cpu_time = executed; if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2037f34: 80 a0 40 03 cmp %g1, %g3 2037f38: 3a bf ff da bcc,a 2037ea0 <_Rate_monotonic_Update_statistics+0x78> 2037f3c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 2037f40: 10 bf ff d7 b 2037e9c <_Rate_monotonic_Update_statistics+0x74> 2037f44: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] _Timestamp_Add_to( &stats->total_wall_time, &since_last_period ); if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) stats->min_wall_time = since_last_period; if ( _Timestamp_Greater_than( &since_last_period, &stats->max_wall_time ) ) 2037f48: 12 bf ff e5 bne 2037edc <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 2037f4c: 01 00 00 00 nop 2037f50: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2037f54: 80 a0 40 03 cmp %g1, %g3 2037f58: 2a bf ff e1 bcs,a 2037edc <_Rate_monotonic_Update_statistics+0xb4> 2037f5c: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 2037f60: 30 bf ff df b,a 2037edc <_Rate_monotonic_Update_statistics+0xb4> =============================================================================== 0200bc20 <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200bc20: 9d e3 bf 98 save %sp, -104, %sp Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server_id server_id; /* Put violating task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200bc24: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200bc28: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200bc2c: 80 a0 40 09 cmp %g1, %o1 200bc30: 32 80 00 02 bne,a 200bc38 <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200bc34: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200bc38: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200bc3c: 80 a0 40 09 cmp %g1, %o1 200bc40: 02 80 00 04 be 200bc50 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200bc44: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200bc48: 40 00 01 9d call 200c2bc <_Thread_Change_priority> 200bc4c: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200bc50: fa 06 20 88 ld [ %i0 + 0x88 ], %i5 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200bc54: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200bc58: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200bc5c: 80 a0 a0 00 cmp %g2, 0 200bc60: 02 80 00 09 be 200bc84 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200bc64: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200bc68: d0 00 40 00 ld [ %g1 ], %o0 200bc6c: 7f ff ff d5 call 200bbc0 <_Scheduler_CBS_Get_server_id> 200bc70: 92 07 bf fc add %fp, -4, %o1 sched_info->cbs_server->task_id, &server_id ); sched_info->cbs_server->cbs_budget_overrun( server_id ); 200bc74: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200bc78: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200bc7c: 9f c0 40 00 call %g1 200bc80: d0 07 bf fc ld [ %fp + -4 ], %o0 200bc84: 81 c7 e0 08 ret 200bc88: 81 e8 00 00 restore =============================================================================== 0200b778 <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200b778: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b77c: 39 00 80 84 sethi %hi(0x2021000), %i4 200b780: c2 07 23 cc ld [ %i4 + 0x3cc ], %g1 ! 20213cc <_Scheduler_CBS_Maximum_servers> 200b784: 80 a0 60 00 cmp %g1, 0 200b788: 02 80 00 18 be 200b7e8 <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200b78c: 03 00 80 89 sethi %hi(0x2022400), %g1 200b790: 37 00 80 89 sethi %hi(0x2022400), %i3 200b794: c4 06 e2 98 ld [ %i3 + 0x298 ], %g2 ! 2022698 <_Scheduler_CBS_Server_list> 200b798: ba 10 20 00 clr %i5 200b79c: b8 17 23 cc or %i4, 0x3cc, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200b7a0: 83 2f 60 02 sll %i5, 2, %g1 200b7a4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200b7a8: 80 a0 60 00 cmp %g1, 0 200b7ac: 02 80 00 05 be 200b7c0 <_Scheduler_CBS_Cleanup+0x48> 200b7b0: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200b7b4: 40 00 00 46 call 200b8cc <_Scheduler_CBS_Destroy_server> 200b7b8: 01 00 00 00 nop 200b7bc: c4 06 e2 98 ld [ %i3 + 0x298 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b7c0: c2 07 00 00 ld [ %i4 ], %g1 200b7c4: ba 07 60 01 inc %i5 200b7c8: 80 a0 40 1d cmp %g1, %i5 200b7cc: 18 bf ff f6 bgu 200b7a4 <_Scheduler_CBS_Cleanup+0x2c> 200b7d0: 83 2f 60 02 sll %i5, 2, %g1 if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); return SCHEDULER_CBS_OK; } 200b7d4: b0 10 20 00 clr %i0 for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[ i ] ) _Scheduler_CBS_Destroy_server( i ); } _Workspace_Free( _Scheduler_CBS_Server_list ); 200b7d8: 40 00 08 65 call 200d96c <_Workspace_Free> 200b7dc: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200b7e0: 81 c7 e0 08 ret 200b7e4: 81 e8 00 00 restore 200b7e8: 10 bf ff fb b 200b7d4 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200b7ec: c4 00 62 98 ld [ %g1 + 0x298 ], %g2 <== NOT EXECUTED =============================================================================== 0200b7f0 <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b7f0: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b7f4: c2 06 20 04 ld [ %i0 + 4 ], %g1 200b7f8: 80 a0 60 00 cmp %g1, 0 200b7fc: 04 80 00 30 ble 200b8bc <_Scheduler_CBS_Create_server+0xcc> 200b800: b8 10 00 18 mov %i0, %i4 200b804: c2 06 00 00 ld [ %i0 ], %g1 200b808: 80 a0 60 00 cmp %g1, 0 200b80c: 04 80 00 2c ble 200b8bc <_Scheduler_CBS_Create_server+0xcc> 200b810: 03 00 80 84 sethi %hi(0x2021000), %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b814: c8 00 63 cc ld [ %g1 + 0x3cc ], %g4 ! 20213cc <_Scheduler_CBS_Maximum_servers> 200b818: 80 a1 20 00 cmp %g4, 0 200b81c: 02 80 00 11 be 200b860 <_Scheduler_CBS_Create_server+0x70><== NEVER TAKEN 200b820: 37 00 80 89 sethi %hi(0x2022400), %i3 if ( !_Scheduler_CBS_Server_list[i] ) 200b824: fa 06 e2 98 ld [ %i3 + 0x298 ], %i5 ! 2022698 <_Scheduler_CBS_Server_list> 200b828: c2 07 40 00 ld [ %i5 ], %g1 200b82c: 80 a0 60 00 cmp %g1, 0 200b830: 02 80 00 21 be 200b8b4 <_Scheduler_CBS_Create_server+0xc4> 200b834: b0 10 20 00 clr %i0 200b838: 10 80 00 06 b 200b850 <_Scheduler_CBS_Create_server+0x60> 200b83c: 82 10 20 00 clr %g1 200b840: c6 07 40 02 ld [ %i5 + %g2 ], %g3 200b844: 80 a0 e0 00 cmp %g3, 0 200b848: 02 80 00 08 be 200b868 <_Scheduler_CBS_Create_server+0x78> 200b84c: b0 10 00 02 mov %g2, %i0 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b850: 82 00 60 01 inc %g1 200b854: 80 a0 40 04 cmp %g1, %g4 200b858: 12 bf ff fa bne 200b840 <_Scheduler_CBS_Create_server+0x50> 200b85c: 85 28 60 02 sll %g1, 2, %g2 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 200b860: 81 c7 e0 08 ret 200b864: 91 e8 3f e6 restore %g0, -26, %o0 *server_id = i; 200b868: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b86c: 40 00 08 38 call 200d94c <_Workspace_Allocate> 200b870: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b874: c2 06 80 00 ld [ %i2 ], %g1 if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) 200b878: d0 27 40 18 st %o0, [ %i5 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b87c: c4 06 e2 98 ld [ %i3 + 0x298 ], %g2 200b880: 83 28 60 02 sll %g1, 2, %g1 200b884: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b888: 80 a0 60 00 cmp %g1, 0 200b88c: 02 80 00 0e be 200b8c4 <_Scheduler_CBS_Create_server+0xd4><== NEVER TAKEN 200b890: 86 10 3f ff mov -1, %g3 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b894: c4 07 00 00 ld [ %i4 ], %g2 200b898: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b89c: c4 07 20 04 ld [ %i4 + 4 ], %g2 the_server->task_id = -1; 200b8a0: c6 20 40 00 st %g3, [ %g1 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b8a4: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b8a8: f2 20 60 0c st %i1, [ %g1 + 0xc ] return SCHEDULER_CBS_OK; 200b8ac: 81 c7 e0 08 ret 200b8b0: 91 e8 20 00 restore %g0, 0, %o0 params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( !_Scheduler_CBS_Server_list[i] ) 200b8b4: 10 bf ff ed b 200b868 <_Scheduler_CBS_Create_server+0x78> 200b8b8: 82 10 20 00 clr %g1 if ( params->budget <= 0 || params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 200b8bc: 81 c7 e0 08 ret 200b8c0: 91 e8 3f ee restore %g0, -18, %o0 the_server->parameters = *params; the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; } 200b8c4: 81 c7 e0 08 ret <== NOT EXECUTED 200b8c8: 91 e8 3f ef restore %g0, -17, %o0 <== NOT EXECUTED =============================================================================== 0200b94c <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b94c: 9d e3 bf 98 save %sp, -104, %sp Objects_Locations location; Thread_Control *the_thread; Scheduler_CBS_Per_thread *sched_info; the_thread = _Thread_Get(task_id, &location); 200b950: 92 07 bf fc add %fp, -4, %o1 200b954: 40 00 03 a8 call 200c7f4 <_Thread_Get> 200b958: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b95c: ba 92 20 00 orcc %o0, 0, %i5 200b960: 02 80 00 1e be 200b9d8 <_Scheduler_CBS_Detach_thread+0x8c> 200b964: 01 00 00 00 nop _Thread_Enable_dispatch(); 200b968: 40 00 03 96 call 200c7c0 <_Thread_Enable_dispatch> 200b96c: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b970: 03 00 80 84 sethi %hi(0x2021000), %g1 200b974: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 20213cc <_Scheduler_CBS_Maximum_servers> 200b978: 80 a6 00 01 cmp %i0, %g1 200b97c: 1a 80 00 17 bcc 200b9d8 <_Scheduler_CBS_Detach_thread+0x8c> 200b980: 03 00 80 89 sethi %hi(0x2022400), %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 200b984: c2 00 62 98 ld [ %g1 + 0x298 ], %g1 ! 2022698 <_Scheduler_CBS_Server_list> 200b988: b1 2e 20 02 sll %i0, 2, %i0 200b98c: c2 00 40 18 ld [ %g1 + %i0 ], %g1 200b990: 80 a0 60 00 cmp %g1, 0 200b994: 02 80 00 13 be 200b9e0 <_Scheduler_CBS_Detach_thread+0x94> 200b998: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 200b99c: c4 00 40 00 ld [ %g1 ], %g2 200b9a0: 80 a0 80 19 cmp %g2, %i1 200b9a4: 12 80 00 0d bne 200b9d8 <_Scheduler_CBS_Detach_thread+0x8c><== NEVER TAKEN 200b9a8: 84 10 3f ff mov -1, %g2 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200b9ac: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b9b0: c6 07 60 a0 ld [ %i5 + 0xa0 ], %g3 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; 200b9b4: c4 20 40 00 st %g2, [ %g1 ] sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; 200b9b8: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b9bc: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; 200b9c0: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b9c4: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b9c8: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b9cc: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] return SCHEDULER_CBS_OK; 200b9d0: 81 c7 e0 08 ret 200b9d4: 91 e8 20 00 restore %g0, 0, %o0 if ( the_thread ) { _Thread_Enable_dispatch(); } if ( server_id >= _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; 200b9d8: 81 c7 e0 08 ret 200b9dc: 91 e8 3f ee restore %g0, -18, %o0 the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; } 200b9e0: 81 c7 e0 08 ret 200b9e4: 91 e8 3f e7 restore %g0, -25, %o0 =============================================================================== 0200bbc0 <_Scheduler_CBS_Get_server_id>: rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200bbc0: 03 00 80 84 sethi %hi(0x2021000), %g1 200bbc4: c6 00 63 cc ld [ %g1 + 0x3cc ], %g3 ! 20213cc <_Scheduler_CBS_Maximum_servers> 200bbc8: 80 a0 e0 00 cmp %g3, 0 200bbcc: 02 80 00 11 be 200bc10 <_Scheduler_CBS_Get_server_id+0x50><== NEVER TAKEN 200bbd0: 03 00 80 89 sethi %hi(0x2022400), %g1 200bbd4: c8 00 62 98 ld [ %g1 + 0x298 ], %g4 ! 2022698 <_Scheduler_CBS_Server_list> 200bbd8: 82 10 20 00 clr %g1 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200bbdc: 85 28 60 02 sll %g1, 2, %g2 Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && 200bbe0: c4 01 00 02 ld [ %g4 + %g2 ], %g2 200bbe4: 80 a0 a0 00 cmp %g2, 0 200bbe8: 22 80 00 07 be,a 200bc04 <_Scheduler_CBS_Get_server_id+0x44> 200bbec: 82 00 60 01 inc %g1 200bbf0: c4 00 80 00 ld [ %g2 ], %g2 200bbf4: 80 a0 80 08 cmp %g2, %o0 200bbf8: 22 80 00 08 be,a 200bc18 <_Scheduler_CBS_Get_server_id+0x58> 200bbfc: c2 22 40 00 st %g1, [ %o1 ] rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200bc00: 82 00 60 01 inc %g1 200bc04: 80 a0 40 03 cmp %g1, %g3 200bc08: 12 bf ff f6 bne 200bbe0 <_Scheduler_CBS_Get_server_id+0x20> 200bc0c: 85 28 60 02 sll %g1, 2, %g2 *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; } 200bc10: 81 c3 e0 08 retl 200bc14: 90 10 3f e7 mov -25, %o0 unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; 200bc18: 81 c3 e0 08 retl 200bc1c: 90 10 20 00 clr %o0 =============================================================================== 0200bc8c <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200bc8c: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); 200bc90: 3b 00 80 84 sethi %hi(0x2021000), %i5 200bc94: d0 07 63 cc ld [ %i5 + 0x3cc ], %o0 ! 20213cc <_Scheduler_CBS_Maximum_servers> } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200bc98: 40 00 07 2d call 200d94c <_Workspace_Allocate> 200bc9c: 91 2a 20 02 sll %o0, 2, %o0 200bca0: 09 00 80 89 sethi %hi(0x2022400), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200bca4: 80 a2 20 00 cmp %o0, 0 200bca8: 02 80 00 10 be 200bce8 <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200bcac: d0 21 22 98 st %o0, [ %g4 + 0x298 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200bcb0: c6 07 63 cc ld [ %i5 + 0x3cc ], %g3 200bcb4: 80 a0 e0 00 cmp %g3, 0 200bcb8: 12 80 00 05 bne 200bccc <_Scheduler_CBS_Initialize+0x40> <== ALWAYS TAKEN 200bcbc: 82 10 20 00 clr %g1 _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200bcc0: 81 c7 e0 08 ret <== NOT EXECUTED 200bcc4: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED 200bcc8: d0 01 22 98 ld [ %g4 + 0x298 ], %o0 _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; 200bccc: 85 28 60 02 sll %g1, 2, %g2 unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200bcd0: 82 00 60 01 inc %g1 200bcd4: 80 a0 40 03 cmp %g1, %g3 200bcd8: 12 bf ff fc bne 200bcc8 <_Scheduler_CBS_Initialize+0x3c> 200bcdc: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200bce0: 81 c7 e0 08 ret 200bce4: 91 e8 20 00 restore %g0, 0, %o0 { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 200bce8: b0 10 3f ef mov -17, %i0 <== NOT EXECUTED for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; } 200bcec: 81 c7 e0 08 ret <== NOT EXECUTED 200bcf0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200a814 <_Scheduler_CBS_Release_job>: { Priority_Control new_priority; Scheduler_CBS_Per_thread *sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; Scheduler_CBS_Server *serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a814: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a818: 80 a2 60 00 cmp %o1, 0 200a81c: 02 80 00 11 be 200a860 <_Scheduler_CBS_Release_job+0x4c> 200a820: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a824: 80 a0 60 00 cmp %g1, 0 200a828: 02 80 00 13 be 200a874 <_Scheduler_CBS_Release_job+0x60> 200a82c: 07 00 80 81 sethi %hi(0x2020400), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a830: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a834: d2 00 e2 48 ld [ %g3 + 0x248 ], %o1 200a838: 92 02 40 02 add %o1, %g2, %o1 200a83c: 05 20 00 00 sethi %hi(0x80000000), %g2 200a840: 92 2a 40 02 andn %o1, %g2, %o1 new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) the_thread->cpu_time_budget = serv_info->parameters.budget; 200a844: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a848: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a84c: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a850: 94 10 20 01 mov 1, %o2 200a854: 82 13 c0 00 mov %o7, %g1 200a858: 40 00 01 45 call 200ad6c <_Thread_Change_priority> 200a85c: 9e 10 40 00 mov %g1, %o7 /* Switch back to background priority. */ new_priority = the_thread->Start.initial_priority; } /* Budget replenishment for the next job. */ if (serv_info) 200a860: 80 a0 60 00 cmp %g1, 0 200a864: 12 bf ff f8 bne 200a844 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 200a868: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 200a86c: 10 bf ff f9 b 200a850 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 200a870: d2 22 20 18 st %o1, [ %o0 + 0x18 ] <== NOT EXECUTED /* Initializing or shifting deadline. */ if (serv_info) new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) & ~SCHEDULER_EDF_PRIO_MSB; else new_priority = (_Watchdog_Ticks_since_boot + deadline) 200a874: 03 00 80 81 sethi %hi(0x2020400), %g1 200a878: c2 00 62 48 ld [ %g1 + 0x248 ], %g1 ! 2020648 <_Watchdog_Ticks_since_boot> 200a87c: 92 02 40 01 add %o1, %g1, %o1 200a880: 03 20 00 00 sethi %hi(0x80000000), %g1 200a884: 10 bf ff f2 b 200a84c <_Scheduler_CBS_Release_job+0x38> 200a888: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 0200a88c <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a88c: 9d e3 bf a0 save %sp, -96, %sp Scheduler_CBS_Per_thread *sched_info; Scheduler_CBS_Server *serv_info; Priority_Control new_priority; _Scheduler_EDF_Enqueue(the_thread); 200a890: 40 00 00 5b call 200a9fc <_Scheduler_EDF_Enqueue> 200a894: 90 10 00 18 mov %i0, %o0 /* TODO: flash critical section? */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; serv_info = (Scheduler_CBS_Server *) sched_info->cbs_server; 200a898: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a89c: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 * Late unblock rule for deadline-driven tasks. The remaining time to * deadline must be sufficient to serve the remaining computation time * without increased utilization of this task. It might cause a deadline * miss of another task. */ if (serv_info) { 200a8a0: 80 a7 60 00 cmp %i5, 0 200a8a4: 02 80 00 19 be 200a908 <_Scheduler_CBS_Unblock+0x7c> 200a8a8: 03 00 80 81 sethi %hi(0x2020400), %g1 time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a8ac: d2 07 60 04 ld [ %i5 + 4 ], %o1 */ if (serv_info) { time_t deadline = serv_info->parameters.deadline; time_t budget = serv_info->parameters.budget; time_t deadline_left = the_thread->cpu_time_budget; time_t budget_left = the_thread->real_priority - 200a8b0: d0 00 62 48 ld [ %g1 + 0x248 ], %o0 200a8b4: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a8b8: 40 00 41 a4 call 201af48 <.umul> 200a8bc: 90 27 00 08 sub %i4, %o0, %o0 200a8c0: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a8c4: b6 10 00 08 mov %o0, %i3 200a8c8: 40 00 41 a0 call 201af48 <.umul> 200a8cc: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a8d0: 80 a6 c0 08 cmp %i3, %o0 200a8d4: 24 80 00 0e ble,a 200a90c <_Scheduler_CBS_Unblock+0x80> 200a8d8: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 /* Put late unblocked task to background until the end of period. */ new_priority = the_thread->Start.initial_priority; 200a8dc: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a8e0: 80 a7 00 09 cmp %i4, %o1 200a8e4: 32 80 00 02 bne,a 200a8ec <_Scheduler_CBS_Unblock+0x60> 200a8e8: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a8ec: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a8f0: 80 a2 00 09 cmp %o0, %o1 200a8f4: 02 80 00 07 be 200a910 <_Scheduler_CBS_Unblock+0x84> 200a8f8: 3b 00 80 82 sethi %hi(0x2020800), %i5 _Thread_Change_priority(the_thread, new_priority, true); 200a8fc: 90 10 00 18 mov %i0, %o0 200a900: 40 00 01 1b call 200ad6c <_Thread_Change_priority> 200a904: 94 10 20 01 mov 1, %o2 200a908: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, 200a90c: 3b 00 80 82 sethi %hi(0x2020800), %i5 200a910: ba 17 62 80 or %i5, 0x280, %i5 ! 2020a80 <_Per_CPU_Information> 200a914: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a918: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 200a91c: 03 00 80 7e sethi %hi(0x201f800), %g1 200a920: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 ! 201f810 <_Scheduler+0x30> 200a924: 9f c0 40 00 call %g1 200a928: 01 00 00 00 nop 200a92c: 80 a2 20 00 cmp %o0, 0 200a930: 04 80 00 0a ble 200a958 <_Scheduler_CBS_Unblock+0xcc> 200a934: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a938: c2 07 60 0c ld [ %i5 + 0xc ], %g1 * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; 200a93c: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a940: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a944: 80 a0 60 00 cmp %g1, 0 200a948: 22 80 00 06 be,a 200a960 <_Scheduler_CBS_Unblock+0xd4> 200a94c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a950: 82 10 20 01 mov 1, %g1 200a954: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200a958: 81 c7 e0 08 ret 200a95c: 81 e8 00 00 restore * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_higher_than( the_thread->current_priority, _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a960: 80 a0 60 00 cmp %g1, 0 200a964: 12 bf ff fd bne 200a958 <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 200a968: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a96c: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200a970: 30 bf ff fa b,a 200a958 <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 0200a974 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a974: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a978: 40 00 06 d1 call 200c4bc <_Workspace_Allocate> 200a97c: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a980: 80 a2 20 00 cmp %o0, 0 200a984: 02 80 00 05 be 200a998 <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a988: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a98c: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a990: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a994: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a998: 81 c7 e0 08 ret 200a99c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a9f8 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a9f8: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a9fc: 7f ff ff a8 call 200a89c <_Scheduler_EDF_Enqueue> 200aa00: 90 10 00 18 mov %i0, %o0 * a context switch. * Pseudo-ISR case: * Even if the thread isn't preemptible, if the new heir is * a pseudo-ISR system task, we need to do a context switch. */ if ( _Scheduler_Is_priority_lower_than( 200aa04: 3b 00 80 82 sethi %hi(0x2020800), %i5 200aa08: ba 17 61 e0 or %i5, 0x1e0, %i5 ! 20209e0 <_Per_CPU_Information> 200aa0c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200aa10: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 200aa14: 03 00 80 7d sethi %hi(0x201f400), %g1 200aa18: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 ! 201f770 <_Scheduler+0x30> 200aa1c: 9f c0 40 00 call %g1 200aa20: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200aa24: 80 a2 20 00 cmp %o0, 0 200aa28: 26 80 00 04 bl,a 200aa38 <_Scheduler_EDF_Unblock+0x40> 200aa2c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200aa30: 81 c7 e0 08 ret 200aa34: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200aa38: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200aa3c: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200aa40: 80 a0 60 00 cmp %g1, 0 200aa44: 22 80 00 06 be,a 200aa5c <_Scheduler_EDF_Unblock+0x64> 200aa48: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200aa4c: 82 10 20 01 mov 1, %g1 200aa50: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200aa54: 81 c7 e0 08 ret 200aa58: 81 e8 00 00 restore */ if ( _Scheduler_Is_priority_lower_than( _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200aa5c: 80 a0 60 00 cmp %g1, 0 200aa60: 12 bf ff f4 bne 200aa30 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 200aa64: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200aa68: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200aa6c: 30 bf ff fa b,a 200aa54 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 0200a150 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 200a150: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 200a154: 03 00 80 7b sethi %hi(0x201ec00), %g1 200a158: d0 00 62 0c ld [ %g1 + 0x20c ], %o0 ! 201ee0c <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 200a15c: c2 0a 20 70 ldub [ %o0 + 0x70 ], %g1 200a160: 80 a0 60 00 cmp %g1, 0 200a164: 02 80 00 26 be 200a1fc <_Scheduler_priority_Tick+0xac> 200a168: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 200a16c: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 200a170: 80 a0 60 00 cmp %g1, 0 200a174: 12 80 00 22 bne 200a1fc <_Scheduler_priority_Tick+0xac> 200a178: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 200a17c: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 200a180: 80 a0 60 01 cmp %g1, 1 200a184: 0a 80 00 07 bcs 200a1a0 <_Scheduler_priority_Tick+0x50> 200a188: 80 a0 60 02 cmp %g1, 2 200a18c: 28 80 00 10 bleu,a 200a1cc <_Scheduler_priority_Tick+0x7c> 200a190: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 200a194: 80 a0 60 03 cmp %g1, 3 200a198: 22 80 00 04 be,a 200a1a8 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN 200a19c: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 200a1a0: 81 c7 e0 08 ret 200a1a4: 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 ) 200a1a8: 82 00 7f ff add %g1, -1, %g1 200a1ac: 80 a0 60 00 cmp %g1, 0 200a1b0: 12 bf ff fc bne 200a1a0 <_Scheduler_priority_Tick+0x50> 200a1b4: c2 22 20 74 st %g1, [ %o0 + 0x74 ] (*executing->budget_callout)( executing ); 200a1b8: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 200a1bc: 9f c0 40 00 call %g1 200a1c0: 01 00 00 00 nop 200a1c4: 81 c7 e0 08 ret 200a1c8: 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 ) { 200a1cc: 82 00 7f ff add %g1, -1, %g1 200a1d0: 80 a0 60 00 cmp %g1, 0 200a1d4: 14 bf ff f3 bg 200a1a0 <_Scheduler_priority_Tick+0x50> 200a1d8: c2 22 20 74 st %g1, [ %o0 + 0x74 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 200a1dc: 03 00 80 76 sethi %hi(0x201d800), %g1 200a1e0: c2 00 63 ec ld [ %g1 + 0x3ec ], %g1 ! 201dbec <_Scheduler+0xc> 200a1e4: 9f c0 40 00 call %g1 200a1e8: 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; 200a1ec: 03 00 80 7a sethi %hi(0x201e800), %g1 200a1f0: d0 07 bf fc ld [ %fp + -4 ], %o0 200a1f4: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 200a1f8: c2 22 20 74 st %g1, [ %o0 + 0x74 ] 200a1fc: 81 c7 e0 08 ret 200a200: 81 e8 00 00 restore =============================================================================== 0200aa10 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 200aa10: 03 00 80 7a sethi %hi(0x201e800), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200aa14: c2 00 63 f0 ld [ %g1 + 0x3f0 ], %g1 ! 201ebf0 <_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 ) { 200aa18: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200aa1c: c2 00 40 00 ld [ %g1 ], %g1 200aa20: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200aa24: 80 a0 80 03 cmp %g2, %g3 200aa28: 3a 80 00 08 bcc,a 200aa48 <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200aa2c: 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 ) { 200aa30: 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 ) { 200aa34: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200aa38: 80 a0 80 03 cmp %g2, %g3 200aa3c: 2a bf ff fe bcs,a 200aa34 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 200aa40: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 200aa44: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200aa48: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200aa4c: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200aa50: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 200aa54: c4 22 00 00 st %g2, [ %o0 ] before_node->previous = the_node; 200aa58: 81 c3 e0 08 retl 200aa5c: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02008a64 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2008a64: 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(); 2008a68: 03 00 80 80 sethi %hi(0x2020000), %g1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 2008a6c: d2 00 61 9c ld [ %g1 + 0x19c ], %o1 ! 202019c 2008a70: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008a74: 40 00 4a e8 call 201b614 <.udiv> 2008a78: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2008a7c: 80 a6 20 00 cmp %i0, 0 2008a80: 02 80 00 2c be 2008b30 <_TOD_Validate+0xcc> <== NEVER TAKEN 2008a84: 82 10 20 00 clr %g1 2008a88: c4 06 20 18 ld [ %i0 + 0x18 ], %g2 2008a8c: 80 a2 00 02 cmp %o0, %g2 2008a90: 28 80 00 26 bleu,a 2008b28 <_TOD_Validate+0xc4> 2008a94: b0 08 60 01 and %g1, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2008a98: c4 06 20 14 ld [ %i0 + 0x14 ], %g2 2008a9c: 80 a0 a0 3b cmp %g2, 0x3b 2008aa0: 38 80 00 22 bgu,a 2008b28 <_TOD_Validate+0xc4> 2008aa4: b0 08 60 01 and %g1, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2008aa8: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 2008aac: 80 a0 a0 3b cmp %g2, 0x3b 2008ab0: 38 80 00 1e bgu,a 2008b28 <_TOD_Validate+0xc4> 2008ab4: b0 08 60 01 and %g1, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2008ab8: c4 06 20 0c ld [ %i0 + 0xc ], %g2 2008abc: 80 a0 a0 17 cmp %g2, 0x17 2008ac0: 38 80 00 1a bgu,a 2008b28 <_TOD_Validate+0xc4> 2008ac4: b0 08 60 01 and %g1, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2008ac8: c4 06 20 04 ld [ %i0 + 4 ], %g2 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 2008acc: 80 a0 a0 00 cmp %g2, 0 2008ad0: 02 80 00 15 be 2008b24 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008ad4: 80 a0 a0 0c cmp %g2, 0xc (the_tod->month == 0) || 2008ad8: 38 80 00 14 bgu,a 2008b28 <_TOD_Validate+0xc4> 2008adc: b0 08 60 01 and %g1, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008ae0: c6 06 00 00 ld [ %i0 ], %g3 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 2008ae4: 80 a0 e7 c3 cmp %g3, 0x7c3 2008ae8: 28 80 00 10 bleu,a 2008b28 <_TOD_Validate+0xc4> 2008aec: b0 08 60 01 and %g1, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008af0: c8 06 20 08 ld [ %i0 + 8 ], %g4 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008af4: 80 a1 20 00 cmp %g4, 0 2008af8: 02 80 00 0b be 2008b24 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008afc: 80 88 e0 03 btst 3, %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2008b00: 32 80 00 0f bne,a 2008b3c <_TOD_Validate+0xd8> 2008b04: 85 28 a0 02 sll %g2, 2, %g2 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2008b08: 82 00 a0 0d add %g2, 0xd, %g1 2008b0c: 05 00 80 7a sethi %hi(0x201e800), %g2 2008b10: 83 28 60 02 sll %g1, 2, %g1 2008b14: 84 10 a3 d8 or %g2, 0x3d8, %g2 2008b18: c2 00 80 01 ld [ %g2 + %g1 ], %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; if ( the_tod->day > days_in_month ) 2008b1c: 80 a0 40 04 cmp %g1, %g4 2008b20: 82 60 3f ff subx %g0, -1, %g1 return false; return true; } 2008b24: b0 08 60 01 and %g1, 1, %i0 2008b28: 81 c7 e0 08 ret 2008b2c: 81 e8 00 00 restore 2008b30: b0 08 60 01 and %g1, 1, %i0 <== NOT EXECUTED 2008b34: 81 c7 e0 08 ret <== NOT EXECUTED 2008b38: 81 e8 00 00 restore <== NOT EXECUTED return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2008b3c: 03 00 80 7a sethi %hi(0x201e800), %g1 2008b40: 82 10 63 d8 or %g1, 0x3d8, %g1 ! 201ebd8 <_TOD_Days_per_month> 2008b44: c2 00 40 02 ld [ %g1 + %g2 ], %g1 if ( the_tod->day > days_in_month ) 2008b48: 80 a0 40 04 cmp %g1, %g4 2008b4c: 10 bf ff f6 b 2008b24 <_TOD_Validate+0xc0> 2008b50: 82 60 3f ff subx %g0, -1, %g1 =============================================================================== 0200a420 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200a420: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 200a424: f6 06 20 10 ld [ %i0 + 0x10 ], %i3 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 200a428: 40 00 03 b1 call 200b2ec <_Thread_Set_transient> 200a42c: 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 ) 200a430: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a434: 80 a0 40 19 cmp %g1, %i1 200a438: 02 80 00 05 be 200a44c <_Thread_Change_priority+0x2c> 200a43c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200a440: 90 10 00 18 mov %i0, %o0 200a444: 40 00 03 90 call 200b284 <_Thread_Set_priority> 200a448: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200a44c: 7f ff e0 c6 call 2002764 200a450: 01 00 00 00 nop 200a454: 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; 200a458: f8 07 60 10 ld [ %i5 + 0x10 ], %i4 if ( state != STATES_TRANSIENT ) { 200a45c: 80 a7 20 04 cmp %i4, 4 200a460: 02 80 00 18 be 200a4c0 <_Thread_Change_priority+0xa0> 200a464: 80 8e e0 04 btst 4, %i3 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 200a468: 02 80 00 0b be 200a494 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200a46c: 82 0f 3f fb and %i4, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 200a470: 7f ff e0 c1 call 2002774 <== NOT EXECUTED 200a474: 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); 200a478: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200a47c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a480: 80 8f 00 01 btst %i4, %g1 <== NOT EXECUTED 200a484: 32 80 00 0d bne,a 200a4b8 <_Thread_Change_priority+0x98> <== NOT EXECUTED 200a488: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200a48c: 81 c7 e0 08 ret 200a490: 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 ); 200a494: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 200a498: 7f ff e0 b7 call 2002774 200a49c: 90 10 00 19 mov %i1, %o0 200a4a0: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a4a4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a4a8: 80 8f 00 01 btst %i4, %g1 200a4ac: 02 bf ff f8 be 200a48c <_Thread_Change_priority+0x6c> 200a4b0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 200a4b4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 200a4b8: 40 00 03 42 call 200b1c0 <_Thread_queue_Requeue> 200a4bc: 93 e8 00 1d restore %g0, %i5, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 200a4c0: 22 80 00 1a be,a 200a528 <_Thread_Change_priority+0x108> <== ALWAYS TAKEN 200a4c4: c0 27 60 10 clr [ %i5 + 0x10 ] 200a4c8: 39 00 80 76 sethi %hi(0x201d800), %i4 <== NOT EXECUTED 200a4cc: b8 17 23 e0 or %i4, 0x3e0, %i4 ! 201dbe0 <_Scheduler> <== NOT EXECUTED _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200a4d0: 7f ff e0 a9 call 2002774 200a4d4: 90 10 00 19 mov %i1, %o0 200a4d8: 7f ff e0 a3 call 2002764 200a4dc: 01 00 00 00 nop 200a4e0: 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(); 200a4e4: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a4e8: 9f c0 40 00 call %g1 200a4ec: 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 ); 200a4f0: 03 00 80 7b sethi %hi(0x201ec00), %g1 200a4f4: 82 10 62 00 or %g1, 0x200, %g1 ! 201ee00 <_Per_CPU_Information> 200a4f8: 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() && 200a4fc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a500: 80 a0 80 03 cmp %g2, %g3 200a504: 02 80 00 07 be 200a520 <_Thread_Change_priority+0x100> 200a508: 01 00 00 00 nop 200a50c: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200a510: 80 a0 a0 00 cmp %g2, 0 200a514: 02 80 00 03 be 200a520 <_Thread_Change_priority+0x100> 200a518: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200a51c: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 200a520: 7f ff e0 95 call 2002774 200a524: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200a528: 39 00 80 76 sethi %hi(0x201d800), %i4 * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); if ( prepend_it ) 200a52c: 80 a6 a0 00 cmp %i2, 0 200a530: 02 80 00 06 be 200a548 <_Thread_Change_priority+0x128> 200a534: b8 17 23 e0 or %i4, 0x3e0, %i4 200a538: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 200a53c: 9f c0 40 00 call %g1 200a540: 90 10 00 1d mov %i5, %o0 200a544: 30 bf ff e3 b,a 200a4d0 <_Thread_Change_priority+0xb0> */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 200a548: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200a54c: 9f c0 40 00 call %g1 200a550: 90 10 00 1d mov %i5, %o0 200a554: 30 bf ff df b,a 200a4d0 <_Thread_Change_priority+0xb0> =============================================================================== 0200a774 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a774: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a778: 90 10 00 18 mov %i0, %o0 200a77c: 40 00 00 77 call 200a958 <_Thread_Get> 200a780: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a784: c2 07 bf fc ld [ %fp + -4 ], %g1 200a788: 80 a0 60 00 cmp %g1, 0 200a78c: 12 80 00 09 bne 200a7b0 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 200a790: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a794: 7f ff ff 71 call 200a558 <_Thread_Clear_state> 200a798: 92 12 60 18 or %o1, 0x18, %o1 ! 10000018 * * This routine decrements the thread dispatch level. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_decrement_disable_level(void) { _Thread_Dispatch_disable_level--; 200a79c: 03 00 80 7a sethi %hi(0x201e800), %g1 200a7a0: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e8d0 <_Thread_Dispatch_disable_level> 200a7a4: 84 00 bf ff add %g2, -1, %g2 200a7a8: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 200a7ac: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 200a7b0: 81 c7 e0 08 ret 200a7b4: 81 e8 00 00 restore =============================================================================== 0200a7b8 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200a7b8: 9d e3 bf 98 save %sp, -104, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200a7bc: 27 00 80 7a sethi %hi(0x201e800), %l3 200a7c0: c2 04 e0 d0 ld [ %l3 + 0xd0 ], %g1 ! 201e8d0 <_Thread_Dispatch_disable_level> 200a7c4: 82 00 60 01 inc %g1 200a7c8: c2 24 e0 d0 st %g1, [ %l3 + 0xd0 ] return _Thread_Dispatch_disable_level; 200a7cc: c2 04 e0 d0 ld [ %l3 + 0xd0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200a7d0: 31 00 80 7b sethi %hi(0x201ec00), %i0 200a7d4: b0 16 22 00 or %i0, 0x200, %i0 ! 201ee00 <_Per_CPU_Information> _ISR_Disable( level ); 200a7d8: 7f ff df e3 call 2002764 200a7dc: f2 06 20 0c ld [ %i0 + 0xc ], %i1 while ( _Thread_Dispatch_necessary == true ) { 200a7e0: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1 200a7e4: 80 a0 60 00 cmp %g1, 0 200a7e8: 02 80 00 45 be 200a8fc <_Thread_Dispatch+0x144> 200a7ec: 01 00 00 00 nop heir = _Thread_Heir; 200a7f0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 _Thread_Dispatch_necessary = false; 200a7f4: c0 2e 20 18 clrb [ %i0 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a7f8: 80 a6 40 10 cmp %i1, %l0 200a7fc: 02 80 00 40 be 200a8fc <_Thread_Dispatch+0x144> 200a800: e0 26 20 0c st %l0, [ %i0 + 0xc ] 200a804: 25 00 80 7a sethi %hi(0x201e800), %l2 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a808: 29 00 80 7a sethi %hi(0x201e800), %l4 200a80c: a4 14 a1 4c or %l2, 0x14c, %l2 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 200a810: 10 80 00 35 b 200a8e4 <_Thread_Dispatch+0x12c> 200a814: 23 00 80 7a sethi %hi(0x201e800), %l1 _ISR_Enable( level ); 200a818: 7f ff df d7 call 2002774 200a81c: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 200a820: 40 00 0e 1f call 200e09c <_TOD_Get_uptime> 200a824: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_Subtract( 200a828: c4 1f bf f8 ldd [ %fp + -8 ], %g2 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a82c: f4 1e 20 20 ldd [ %i0 + 0x20 ], %i2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a830: f8 1e 60 80 ldd [ %i1 + 0x80 ], %i4 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a834: c2 04 80 00 ld [ %l2 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a838: b6 a0 c0 1b subcc %g3, %i3, %i3 200a83c: b4 60 80 1a subx %g2, %i2, %i2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a840: ba 87 40 1b addcc %i5, %i3, %i5 200a844: b8 47 00 1a addx %i4, %i2, %i4 200a848: f8 3e 60 80 std %i4, [ %i1 + 0x80 ] 200a84c: 80 a0 60 00 cmp %g1, 0 200a850: 02 80 00 06 be 200a868 <_Thread_Dispatch+0xb0> <== NEVER TAKEN 200a854: c4 3e 20 20 std %g2, [ %i0 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 200a858: c4 00 40 00 ld [ %g1 ], %g2 200a85c: c4 26 61 54 st %g2, [ %i1 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200a860: c4 04 21 54 ld [ %l0 + 0x154 ], %g2 200a864: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 200a868: 90 10 00 19 mov %i1, %o0 200a86c: 40 00 03 9e call 200b6e4 <_User_extensions_Thread_switch> 200a870: 92 10 00 10 mov %l0, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200a874: 90 06 60 c8 add %i1, 0xc8, %o0 200a878: 40 00 04 e5 call 200bc0c <_CPU_Context_switch> 200a87c: 92 04 20 c8 add %l0, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a880: c2 06 61 50 ld [ %i1 + 0x150 ], %g1 200a884: 80 a0 60 00 cmp %g1, 0 200a888: 02 80 00 0c be 200a8b8 <_Thread_Dispatch+0x100> 200a88c: d0 04 61 48 ld [ %l1 + 0x148 ], %o0 200a890: 80 a6 40 08 cmp %i1, %o0 200a894: 02 80 00 09 be 200a8b8 <_Thread_Dispatch+0x100> 200a898: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a89c: 02 80 00 04 be 200a8ac <_Thread_Dispatch+0xf4> 200a8a0: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a8a4: 40 00 04 a0 call 200bb24 <_CPU_Context_save_fp> 200a8a8: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 200a8ac: 40 00 04 bb call 200bb98 <_CPU_Context_restore_fp> 200a8b0: 90 06 61 50 add %i1, 0x150, %o0 _Thread_Allocated_fp = executing; 200a8b4: f2 24 61 48 st %i1, [ %l1 + 0x148 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200a8b8: 7f ff df ab call 2002764 200a8bc: f2 06 20 0c ld [ %i0 + 0xc ], %i1 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200a8c0: c2 0e 20 18 ldub [ %i0 + 0x18 ], %g1 200a8c4: 80 a0 60 00 cmp %g1, 0 200a8c8: 02 80 00 0d be 200a8fc <_Thread_Dispatch+0x144> 200a8cc: 01 00 00 00 nop heir = _Thread_Heir; 200a8d0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 _Thread_Dispatch_necessary = false; 200a8d4: c0 2e 20 18 clrb [ %i0 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a8d8: 80 a4 00 19 cmp %l0, %i1 200a8dc: 02 80 00 08 be 200a8fc <_Thread_Dispatch+0x144> <== NEVER TAKEN 200a8e0: e0 26 20 0c st %l0, [ %i0 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 200a8e4: c2 04 20 78 ld [ %l0 + 0x78 ], %g1 200a8e8: 80 a0 60 01 cmp %g1, 1 200a8ec: 12 bf ff cb bne 200a818 <_Thread_Dispatch+0x60> 200a8f0: c2 05 20 30 ld [ %l4 + 0x30 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a8f4: 10 bf ff c9 b 200a818 <_Thread_Dispatch+0x60> 200a8f8: c2 24 20 74 st %g1, [ %l0 + 0x74 ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 200a8fc: 7f ff df 9e call 2002774 200a900: 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--; 200a904: c2 04 e0 d0 ld [ %l3 + 0xd0 ], %g1 200a908: 82 00 7f ff add %g1, -1, %g1 200a90c: c2 24 e0 d0 st %g1, [ %l3 + 0xd0 ] return _Thread_Dispatch_disable_level; 200a910: c2 04 e0 d0 ld [ %l3 + 0xd0 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 200a914: 7f ff f7 a2 call 200879c <_API_extensions_Run_postswitch> 200a918: 01 00 00 00 nop 200a91c: 81 c7 e0 08 ret 200a920: 81 e8 00 00 restore =============================================================================== 020105bc <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 20105bc: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 20105c0: 03 00 80 7b sethi %hi(0x201ec00), %g1 20105c4: fa 00 62 0c ld [ %g1 + 0x20c ], %i5 ! 201ee0c <_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(); 20105c8: 3f 00 80 41 sethi %hi(0x2010400), %i7 20105cc: be 17 e1 bc or %i7, 0x1bc, %i7 ! 20105bc <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 20105d0: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 20105d4: 7f ff c8 68 call 2002774 20105d8: 91 2a 20 08 sll %o0, 8, %o0 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 20105dc: c4 07 61 50 ld [ %i5 + 0x150 ], %g2 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 20105e0: 03 00 80 79 sethi %hi(0x201e400), %g1 doneConstructors = true; 20105e4: 86 10 20 01 mov 1, %g3 doCons = !doneConstructors && _Objects_Get_API( executing->Object.id ) != OBJECTS_INTERNAL_API; if (doCons) doneConstructors = true; #else doCons = !doneConstructors; 20105e8: f6 08 60 d8 ldub [ %g1 + 0xd8 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 20105ec: 80 a0 a0 00 cmp %g2, 0 20105f0: 02 80 00 0c be 2010620 <_Thread_Handler+0x64> 20105f4: c6 28 60 d8 stb %g3, [ %g1 + 0xd8 ] #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 ); 20105f8: 39 00 80 7a sethi %hi(0x201e800), %i4 20105fc: d0 07 21 48 ld [ %i4 + 0x148 ], %o0 ! 201e948 <_Thread_Allocated_fp> 2010600: 80 a7 40 08 cmp %i5, %o0 2010604: 02 80 00 07 be 2010620 <_Thread_Handler+0x64> 2010608: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 201060c: 22 80 00 05 be,a 2010620 <_Thread_Handler+0x64> 2010610: fa 27 21 48 st %i5, [ %i4 + 0x148 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2010614: 7f ff ed 44 call 200bb24 <_CPU_Context_save_fp> 2010618: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 201061c: fa 27 21 48 st %i5, [ %i4 + 0x148 ] /* * 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 ); 2010620: 7f ff eb b0 call 200b4e0 <_User_extensions_Thread_begin> 2010624: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 2010628: 7f ff e8 bf call 200a924 <_Thread_Enable_dispatch> 201062c: 01 00 00 00 nop /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { 2010630: 80 8e e0 ff btst 0xff, %i3 2010634: 02 80 00 0e be 201066c <_Thread_Handler+0xb0> 2010638: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 201063c: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 2010640: 80 a0 60 00 cmp %g1, 0 2010644: 02 80 00 0e be 201067c <_Thread_Handler+0xc0> 2010648: 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 ) { 201064c: 22 80 00 11 be,a 2010690 <_Thread_Handler+0xd4> <== ALWAYS TAKEN 2010650: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 * was placed in return_argument. This assumed that if it returned * anything (which is not supporting in all APIs), then it would be * able to fit in a (void *). */ _User_extensions_Thread_exitted( executing ); 2010654: 7f ff eb b7 call 200b530 <_User_extensions_Thread_exitted> 2010658: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 201065c: 90 10 20 00 clr %o0 2010660: 92 10 20 01 mov 1, %o1 2010664: 7f ff e3 26 call 20092fc <_Internal_error_Occurred> 2010668: 94 10 20 05 mov 5, %o2 * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (doCons) /* && (volatile void *)_init) */ { INIT_NAME (); 201066c: 40 00 35 0d call 201daa0 <_init> 2010670: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 2010674: 10 bf ff f3 b 2010640 <_Thread_Handler+0x84> 2010678: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 201067c: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 2010680: 9f c0 40 00 call %g1 2010684: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 2010688: 10 bf ff f3 b 2010654 <_Thread_Handler+0x98> 201068c: 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)( 2010690: 9f c0 40 00 call %g1 2010694: d0 07 60 94 ld [ %i5 + 0x94 ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 2010698: 10 bf ff ef b 2010654 <_Thread_Handler+0x98> 201069c: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200ac10 <_Thread_Handler_initialization>: * * Output parameters: NONE */ void _Thread_Handler_initialization(void) { 200ac10: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200ac14: 03 00 80 76 sethi %hi(0x201d800), %g1 200ac18: 82 10 62 ec or %g1, 0x2ec, %g1 ! 201daec #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ac1c: c6 00 60 2c ld [ %g1 + 0x2c ], %g3 * Output parameters: NONE */ void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200ac20: fa 00 60 18 ld [ %g1 + 0x18 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200ac24: f8 00 60 0c ld [ %g1 + 0xc ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ac28: 80 a0 e0 00 cmp %g3, 0 200ac2c: 02 80 00 21 be 200acb0 <_Thread_Handler_initialization+0xa0> 200ac30: c4 00 60 28 ld [ %g1 + 0x28 ], %g2 200ac34: c6 00 60 30 ld [ %g1 + 0x30 ], %g3 200ac38: 80 a0 e0 00 cmp %g3, 0 200ac3c: 02 80 00 1d be 200acb0 <_Thread_Handler_initialization+0xa0><== NEVER TAKEN 200ac40: 80 a0 a0 00 cmp %g2, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200ac44: 22 80 00 05 be,a 200ac58 <_Thread_Handler_initialization+0x48> 200ac48: 03 00 80 7b sethi %hi(0x201ec00), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200ac4c: 9f c0 80 00 call %g2 200ac50: d0 00 60 08 ld [ %g1 + 8 ], %o0 ! 201ec08 <_POSIX_Message_queue_Information+0x8> _Thread_Dispatch_necessary = false; 200ac54: 03 00 80 7b sethi %hi(0x201ec00), %g1 200ac58: 82 10 62 00 or %g1, 0x200, %g1 ! 201ee00 <_Per_CPU_Information> 200ac5c: c0 28 60 18 clrb [ %g1 + 0x18 ] _Thread_Executing = NULL; 200ac60: c0 20 60 0c clr [ %g1 + 0xc ] _Thread_Heir = NULL; 200ac64: c0 20 60 10 clr [ %g1 + 0x10 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200ac68: 03 00 80 7a sethi %hi(0x201e800), %g1 200ac6c: c0 20 61 48 clr [ %g1 + 0x148 ] ! 201e948 <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200ac70: 03 00 80 7a sethi %hi(0x201e800), %g1 200ac74: f8 20 61 50 st %i4, [ %g1 + 0x150 ] ! 201e950 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200ac78: 03 00 80 7a sethi %hi(0x201e800), %g1 200ac7c: fa 20 60 30 st %i5, [ %g1 + 0x30 ] ! 201e830 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200ac80: 82 10 20 08 mov 8, %g1 200ac84: 11 00 80 7a sethi %hi(0x201e800), %o0 200ac88: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200ac8c: 90 12 21 d0 or %o0, 0x1d0, %o0 200ac90: 92 10 20 01 mov 1, %o1 200ac94: 94 10 20 01 mov 1, %o2 200ac98: 96 10 20 01 mov 1, %o3 200ac9c: 98 10 21 68 mov 0x168, %o4 200aca0: 7f ff fb 35 call 2009974 <_Objects_Initialize_information> 200aca4: 9a 10 20 00 clr %o5 200aca8: 81 c7 e0 08 ret 200acac: 81 e8 00 00 restore _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || rtems_configuration_get_stack_free_hook() == NULL) _Internal_error_Occurred( 200acb0: 90 10 20 00 clr %o0 200acb4: 92 10 20 01 mov 1, %o1 200acb8: 7f ff f9 91 call 20092fc <_Internal_error_Occurred> 200acbc: 94 10 20 0e mov 0xe, %o2 =============================================================================== 0200aa08 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200aa08: 9d e3 bf a0 save %sp, -96, %sp 200aa0c: 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; 200aa10: c0 26 61 58 clr [ %i1 + 0x158 ] 200aa14: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 200aa18: 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 ) { 200aa1c: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 200aa20: e2 00 40 00 ld [ %g1 ], %l1 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 200aa24: 80 a6 a0 00 cmp %i2, 0 200aa28: 02 80 00 6b be 200abd4 <_Thread_Initialize+0x1cc> 200aa2c: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 200aa30: c0 2e 60 b0 clrb [ %i1 + 0xb0 ] 200aa34: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200aa38: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ] the_stack->size = size; 200aa3c: d0 26 60 b4 st %o0, [ %i1 + 0xb4 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 200aa40: 80 a7 20 00 cmp %i4, 0 200aa44: 12 80 00 48 bne 200ab64 <_Thread_Initialize+0x15c> 200aa48: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200aa4c: 39 00 80 7a sethi %hi(0x201e800), %i4 200aa50: c2 07 21 50 ld [ %i4 + 0x150 ], %g1 ! 201e950 <_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; 200aa54: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200aa58: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200aa5c: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200aa60: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200aa64: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200aa68: 80 a0 60 00 cmp %g1, 0 200aa6c: 12 80 00 46 bne 200ab84 <_Thread_Initialize+0x17c> 200aa70: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200aa74: 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; 200aa78: 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; 200aa7c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200aa80: e4 2e 60 9c stb %l2, [ %i1 + 0x9c ] the_thread->Start.budget_algorithm = budget_algorithm; 200aa84: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 200aa88: 80 a4 20 02 cmp %l0, 2 200aa8c: 12 80 00 05 bne 200aaa0 <_Thread_Initialize+0x98> 200aa90: c2 26 60 a4 st %g1, [ %i1 + 0xa4 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200aa94: 03 00 80 7a sethi %hi(0x201e800), %g1 200aa98: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 201e830 <_Thread_Ticks_per_timeslice> 200aa9c: c2 26 60 74 st %g1, [ %i1 + 0x74 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200aaa0: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200aaa4: 03 00 80 76 sethi %hi(0x201d800), %g1 200aaa8: c2 00 63 f8 ld [ %g1 + 0x3f8 ], %g1 ! 201dbf8 <_Scheduler+0x18> 200aaac: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200aab0: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 200aab4: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200aab8: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200aabc: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200aac0: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200aac4: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200aac8: 9f c0 40 00 call %g1 200aacc: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200aad0: b8 92 20 00 orcc %o0, 0, %i4 200aad4: 22 80 00 13 be,a 200ab20 <_Thread_Initialize+0x118> 200aad8: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200aadc: 90 10 00 19 mov %i1, %o0 200aae0: 40 00 01 e9 call 200b284 <_Thread_Set_priority> 200aae4: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aae8: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200aaec: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200aaf0: c0 26 60 80 clr [ %i1 + 0x80 ] 200aaf4: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aaf8: 83 28 60 02 sll %g1, 2, %g1 200aafc: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200ab00: e2 26 60 0c st %l1, [ %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 ); 200ab04: 90 10 00 19 mov %i1, %o0 200ab08: 40 00 02 b1 call 200b5cc <_User_extensions_Thread_create> 200ab0c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 200ab10: 80 8a 20 ff btst 0xff, %o0 200ab14: 32 80 00 12 bne,a 200ab5c <_Thread_Initialize+0x154> 200ab18: b0 0e 20 ff and %i0, 0xff, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200ab1c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 200ab20: 40 00 03 ec call 200bad0 <_Workspace_Free> 200ab24: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200ab28: 40 00 03 ea call 200bad0 <_Workspace_Free> 200ab2c: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 200ab30: 40 00 03 e8 call 200bad0 <_Workspace_Free> 200ab34: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200ab38: 40 00 03 e6 call 200bad0 <_Workspace_Free> 200ab3c: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200ab40: 40 00 03 e4 call 200bad0 <_Workspace_Free> 200ab44: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200ab48: 40 00 03 e2 call 200bad0 <_Workspace_Free> 200ab4c: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200ab50: 40 00 02 06 call 200b368 <_Thread_Stack_Free> 200ab54: 90 10 00 19 mov %i1, %o0 200ab58: b0 0e 20 ff and %i0, 0xff, %i0 200ab5c: 81 c7 e0 08 ret 200ab60: 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 ); 200ab64: 40 00 03 d3 call 200bab0 <_Workspace_Allocate> 200ab68: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200ab6c: b6 92 20 00 orcc %o0, 0, %i3 200ab70: 32 bf ff b8 bne,a 200aa50 <_Thread_Initialize+0x48> 200ab74: 39 00 80 7a sethi %hi(0x201e800), %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; 200ab78: 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; 200ab7c: 10 bf ff e8 b 200ab1c <_Thread_Initialize+0x114> 200ab80: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200ab84: 90 00 60 01 add %g1, 1, %o0 200ab88: 40 00 03 ca call 200bab0 <_Workspace_Allocate> 200ab8c: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200ab90: b4 92 20 00 orcc %o0, 0, %i2 200ab94: 02 80 00 1d be 200ac08 <_Thread_Initialize+0x200> 200ab98: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200ab9c: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 200aba0: c8 07 21 50 ld [ %i4 + 0x150 ], %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++ ) 200aba4: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200aba8: 10 80 00 03 b 200abb4 <_Thread_Initialize+0x1ac> 200abac: 82 10 20 00 clr %g1 200abb0: 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; 200abb4: 85 28 a0 02 sll %g2, 2, %g2 200abb8: 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++ ) 200abbc: 82 00 60 01 inc %g1 200abc0: 80 a0 40 04 cmp %g1, %g4 200abc4: 08 bf ff fb bleu 200abb0 <_Thread_Initialize+0x1a8> 200abc8: 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; 200abcc: 10 bf ff ad b 200aa80 <_Thread_Initialize+0x78> 200abd0: 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 ); 200abd4: 90 10 00 19 mov %i1, %o0 200abd8: 40 00 01 d4 call 200b328 <_Thread_Stack_Allocate> 200abdc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200abe0: 80 a2 00 1b cmp %o0, %i3 200abe4: 0a 80 00 07 bcs 200ac00 <_Thread_Initialize+0x1f8> 200abe8: 80 a2 20 00 cmp %o0, 0 200abec: 02 80 00 05 be 200ac00 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 200abf0: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200abf4: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2 the_thread->Start.core_allocated_stack = true; 200abf8: 10 bf ff 90 b 200aa38 <_Thread_Initialize+0x30> 200abfc: c2 2e 60 b0 stb %g1, [ %i1 + 0xb0 ] stack = the_thread->Start.stack; #else if ( !stack_area ) { actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ 200ac00: 10 bf ff d6 b 200ab58 <_Thread_Initialize+0x150> 200ac04: 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; 200ac08: 10 bf ff c5 b 200ab1c <_Thread_Initialize+0x114> 200ac0c: b8 10 20 00 clr %i4 =============================================================================== 0200b368 <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 200b368: 9d e3 bf a0 save %sp, -96, %sp #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200b36c: c2 0e 20 b0 ldub [ %i0 + 0xb0 ], %g1 200b370: 80 a0 60 00 cmp %g1, 0 void _Thread_Stack_Free( Thread_Control *the_thread ) { rtems_stack_free_hook stack_free_hook = 200b374: 03 00 80 76 sethi %hi(0x201d800), %g1 #if defined(RTEMS_SCORE_THREAD_ENABLE_USER_PROVIDED_STACK_VIA_API) /* * If the API provided the stack space, then don't free it. */ if ( !the_thread->Start.core_allocated_stack ) 200b378: 02 80 00 04 be 200b388 <_Thread_Stack_Free+0x20> <== NEVER TAKEN 200b37c: c2 00 63 1c ld [ %g1 + 0x31c ], %g1 ! 201db1c * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ (*stack_free_hook)( the_thread->Start.Initial_stack.area ); 200b380: 9f c0 40 00 call %g1 200b384: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0 200b388: 81 c7 e0 08 ret 200b38c: 81 e8 00 00 restore =============================================================================== 0200b1c0 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200b1c0: 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 ) 200b1c4: 80 a6 20 00 cmp %i0, 0 200b1c8: 02 80 00 13 be 200b214 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200b1cc: 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 ) { 200b1d0: fa 06 20 34 ld [ %i0 + 0x34 ], %i5 200b1d4: 80 a7 60 01 cmp %i5, 1 200b1d8: 02 80 00 04 be 200b1e8 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200b1dc: 01 00 00 00 nop 200b1e0: 81 c7 e0 08 ret <== NOT EXECUTED 200b1e4: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200b1e8: 7f ff dd 5f call 2002764 200b1ec: 01 00 00 00 nop 200b1f0: b8 10 00 08 mov %o0, %i4 200b1f4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200b1f8: 03 00 00 ef sethi %hi(0x3bc00), %g1 200b1fc: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200b200: 80 88 80 01 btst %g2, %g1 200b204: 12 80 00 06 bne 200b21c <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200b208: 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 ); 200b20c: 7f ff dd 5a call 2002774 200b210: 90 10 00 1c mov %i4, %o0 200b214: 81 c7 e0 08 ret 200b218: 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 ); 200b21c: 92 10 00 19 mov %i1, %o1 200b220: 94 10 20 01 mov 1, %o2 200b224: 40 00 0d 96 call 200e87c <_Thread_queue_Extract_priority_helper> 200b228: fa 26 20 30 st %i5, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200b22c: 90 10 00 18 mov %i0, %o0 200b230: 92 10 00 19 mov %i1, %o1 200b234: 7f ff ff 35 call 200af08 <_Thread_queue_Enqueue_priority> 200b238: 94 07 bf fc add %fp, -4, %o2 200b23c: 30 bf ff f4 b,a 200b20c <_Thread_queue_Requeue+0x4c> =============================================================================== 0200b240 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200b240: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200b244: 90 10 00 18 mov %i0, %o0 200b248: 7f ff fd c4 call 200a958 <_Thread_Get> 200b24c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b250: c2 07 bf fc ld [ %fp + -4 ], %g1 200b254: 80 a0 60 00 cmp %g1, 0 200b258: 12 80 00 09 bne 200b27c <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 200b25c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200b260: 40 00 0d c0 call 200e960 <_Thread_queue_Process_timeout> 200b264: 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--; 200b268: 03 00 80 7a sethi %hi(0x201e800), %g1 200b26c: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e8d0 <_Thread_Dispatch_disable_level> 200b270: 84 00 bf ff add %g2, -1, %g2 200b274: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 200b278: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 200b27c: 81 c7 e0 08 ret 200b280: 81 e8 00 00 restore =============================================================================== 02018254 <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2018254: 9d e3 bf 88 save %sp, -120, %sp 2018258: 21 00 80 f3 sethi %hi(0x203cc00), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 201825c: a4 07 bf e8 add %fp, -24, %l2 2018260: b4 07 bf ec add %fp, -20, %i2 2018264: b8 07 bf f4 add %fp, -12, %i4 2018268: a2 07 bf f8 add %fp, -8, %l1 201826c: 33 00 80 f3 sethi %hi(0x203cc00), %i1 2018270: 27 00 80 f3 sethi %hi(0x203cc00), %l3 2018274: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 2018278: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 201827c: e4 27 bf f0 st %l2, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2018280: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 2018284: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2018288: f8 27 bf fc st %i4, [ %fp + -4 ] 201828c: a0 14 22 48 or %l0, 0x248, %l0 2018290: b6 06 20 30 add %i0, 0x30, %i3 2018294: b2 16 60 98 or %i1, 0x98, %i1 2018298: ba 06 20 68 add %i0, 0x68, %i5 201829c: a6 14 e1 50 or %l3, 0x150, %l3 20182a0: ac 06 20 08 add %i0, 8, %l6 20182a4: aa 06 20 40 add %i0, 0x40, %l5 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 20182a8: a8 10 20 01 mov 1, %l4 { /* * Afterwards all timer inserts are directed to this chain and the interval * and TOD chains will be no more modified by other parties. */ ts->insert_chain = insert_chain; 20182ac: e4 26 20 78 st %l2, [ %i0 + 0x78 ] static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20182b0: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20182b4: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20182b8: 90 10 00 1b mov %i3, %o0 20182bc: 92 20 40 09 sub %g1, %o1, %o1 20182c0: 94 10 00 1c mov %i4, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20182c4: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20182c8: 40 00 12 ba call 201cdb0 <_Watchdog_Adjust_to_chain> 20182cc: 01 00 00 00 nop 20182d0: d0 1e 40 00 ldd [ %i1 ], %o0 20182d4: 94 10 20 00 clr %o2 20182d8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20182dc: 40 00 51 aa call 202c984 <__divdi3> 20182e0: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 20182e4: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 20182e8: 80 a2 40 0a cmp %o1, %o2 20182ec: 18 80 00 2b bgu 2018398 <_Timer_server_Body+0x144> 20182f0: ae 10 00 09 mov %o1, %l7 * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); } else if ( snapshot < last_snapshot ) { 20182f4: 80 a2 40 0a cmp %o1, %o2 20182f8: 0a 80 00 20 bcs 2018378 <_Timer_server_Body+0x124> 20182fc: 90 10 00 1d mov %i5, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2018300: ee 26 20 74 st %l7, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2018304: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018308: 40 00 02 bb call 2018df4 <_Chain_Get> 201830c: 01 00 00 00 nop if ( timer == NULL ) { 2018310: 92 92 20 00 orcc %o0, 0, %o1 2018314: 02 80 00 10 be 2018354 <_Timer_server_Body+0x100> 2018318: 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 ) { 201831c: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2018320: 80 a0 60 01 cmp %g1, 1 2018324: 02 80 00 19 be 2018388 <_Timer_server_Body+0x134> 2018328: 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 ) { 201832c: 12 bf ff f6 bne 2018304 <_Timer_server_Body+0xb0> <== NEVER TAKEN 2018330: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2018334: 40 00 12 d0 call 201ce74 <_Watchdog_Insert> 2018338: 90 10 00 1d mov %i5, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 201833c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2018340: 40 00 02 ad call 2018df4 <_Chain_Get> 2018344: 01 00 00 00 nop if ( timer == NULL ) { 2018348: 92 92 20 00 orcc %o0, 0, %o1 201834c: 32 bf ff f5 bne,a 2018320 <_Timer_server_Body+0xcc> <== NEVER TAKEN 2018350: 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 ); 2018354: 7f ff dd 2f call 200f810 2018358: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 201835c: c2 07 bf e8 ld [ %fp + -24 ], %g1 2018360: 80 a0 40 1a cmp %g1, %i2 2018364: 02 80 00 12 be 20183ac <_Timer_server_Body+0x158> <== ALWAYS TAKEN 2018368: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 201836c: 7f ff dd 2d call 200f820 <== NOT EXECUTED 2018370: 01 00 00 00 nop <== NOT EXECUTED 2018374: 30 bf ff cf b,a 20182b0 <_Timer_server_Body+0x5c> <== NOT EXECUTED /* * The current TOD is before the last TOD which indicates that * TOD has been set backwards. */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); 2018378: 92 10 20 01 mov 1, %o1 ! 1 201837c: 40 00 12 5d call 201ccf0 <_Watchdog_Adjust> 2018380: 94 22 80 17 sub %o2, %l7, %o2 2018384: 30 bf ff df b,a 2018300 <_Timer_server_Body+0xac> Timer_server_Control *ts, Timer_Control *timer ) { if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2018388: 90 10 00 1b mov %i3, %o0 201838c: 40 00 12 ba call 201ce74 <_Watchdog_Insert> 2018390: 92 02 60 10 add %o1, 0x10, %o1 2018394: 30 bf ff dc b,a 2018304 <_Timer_server_Body+0xb0> /* * This path is for normal forward movement and cases where the * TOD has been set forward. */ delta = snapshot - last_snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2018398: 92 22 40 0a sub %o1, %o2, %o1 201839c: 90 10 00 1d mov %i5, %o0 20183a0: 40 00 12 84 call 201cdb0 <_Watchdog_Adjust_to_chain> 20183a4: 94 10 00 1c mov %i4, %o2 20183a8: 30 bf ff d6 b,a 2018300 <_Timer_server_Body+0xac> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 20183ac: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 20183b0: 7f ff dd 1c call 200f820 20183b4: 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 ) ) { 20183b8: c2 07 bf f4 ld [ %fp + -12 ], %g1 20183bc: 80 a0 40 11 cmp %g1, %l1 20183c0: 12 80 00 0c bne 20183f0 <_Timer_server_Body+0x19c> 20183c4: 01 00 00 00 nop 20183c8: 30 80 00 13 b,a 2018414 <_Timer_server_Body+0x1c0> Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; new_first->previous = head; 20183cc: f8 20 60 04 st %i4, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 20183d0: 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; 20183d4: c0 25 e0 08 clr [ %l7 + 8 ] _ISR_Enable( level ); 20183d8: 7f ff dd 12 call 200f820 20183dc: 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 ); 20183e0: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0 20183e4: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1 20183e8: 9f c0 40 00 call %g1 20183ec: d2 05 e0 24 ld [ %l7 + 0x24 ], %o1 /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 20183f0: 7f ff dd 08 call 200f810 20183f4: 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; 20183f8: ee 07 bf f4 ld [ %fp + -12 ], %l7 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 20183fc: 80 a5 c0 11 cmp %l7, %l1 2018400: 32 bf ff f3 bne,a 20183cc <_Timer_server_Body+0x178> 2018404: c2 05 c0 00 ld [ %l7 ], %g1 watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 2018408: 7f ff dd 06 call 200f820 201840c: 01 00 00 00 nop 2018410: 30 bf ff a7 b,a 20182ac <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2018414: 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++; 2018418: c2 04 c0 00 ld [ %l3 ], %g1 201841c: 82 00 60 01 inc %g1 2018420: c2 24 c0 00 st %g1, [ %l3 ] return _Thread_Dispatch_disable_level; 2018424: c2 04 c0 00 ld [ %l3 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2018428: d0 06 00 00 ld [ %i0 ], %o0 201842c: 40 00 10 fa call 201c814 <_Thread_Set_state> 2018430: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2018434: 7f ff ff 05 call 2018048 <_Timer_server_Reset_interval_system_watchdog> 2018438: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 201843c: 7f ff ff 17 call 2018098 <_Timer_server_Reset_tod_system_watchdog> 2018440: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2018444: 40 00 0e 70 call 201be04 <_Thread_Enable_dispatch> 2018448: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201844c: 90 10 00 16 mov %l6, %o0 _Thread_Set_state( ts->thread, STATES_DELAYING ); _Timer_server_Reset_interval_system_watchdog( ts ); _Timer_server_Reset_tod_system_watchdog( ts ); _Thread_Enable_dispatch(); ts->active = true; 2018450: e8 2e 20 7c stb %l4, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2018454: 40 00 12 e7 call 201cff0 <_Watchdog_Remove> 2018458: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 201845c: 40 00 12 e5 call 201cff0 <_Watchdog_Remove> 2018460: 90 10 00 15 mov %l5, %o0 2018464: 30 bf ff 92 b,a 20182ac <_Timer_server_Body+0x58> =============================================================================== 020180e8 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 20180e8: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 20180ec: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20180f0: 80 a0 60 00 cmp %g1, 0 20180f4: 02 80 00 05 be 2018108 <_Timer_server_Schedule_operation_method+0x20> 20180f8: 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 ); 20180fc: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2018100: 40 00 03 32 call 2018dc8 <_Chain_Append> 2018104: 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++; 2018108: 03 00 80 f3 sethi %hi(0x203cc00), %g1 201810c: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 ! 203cd50 <_Thread_Dispatch_disable_level> 2018110: 84 00 a0 01 inc %g2 2018114: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2018118: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201811c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2018120: 80 a0 60 01 cmp %g1, 1 2018124: 02 80 00 2b be 20181d0 <_Timer_server_Schedule_operation_method+0xe8> 2018128: 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 ) { 201812c: 02 80 00 04 be 201813c <_Timer_server_Schedule_operation_method+0x54> 2018130: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2018134: 40 00 0f 34 call 201be04 <_Thread_Enable_dispatch> 2018138: 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 ); 201813c: 7f ff dd b5 call 200f810 2018140: 01 00 00 00 nop 2018144: b8 10 00 08 mov %o0, %i4 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2018148: 03 00 80 f3 sethi %hi(0x203cc00), %g1 201814c: d0 18 60 98 ldd [ %g1 + 0x98 ], %o0 ! 203cc98 <_TOD> 2018150: 94 10 20 00 clr %o2 2018154: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2018158: 40 00 52 0b call 202c984 <__divdi3> 201815c: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2018160: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 last_snapshot = ts->TOD_watchdogs.last_snapshot; 2018164: c4 06 20 74 ld [ %i0 + 0x74 ], %g2 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2018168: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 201816c: 80 a0 40 03 cmp %g1, %g3 2018170: 02 80 00 0a be 2018198 <_Timer_server_Schedule_operation_method+0xb0> 2018174: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2018178: 08 80 00 34 bleu 2018248 <_Timer_server_Schedule_operation_method+0x160> 201817c: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2018180: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 2018184: 80 a1 00 02 cmp %g4, %g2 2018188: 08 80 00 03 bleu 2018194 <_Timer_server_Schedule_operation_method+0xac><== NEVER TAKEN 201818c: 86 10 20 00 clr %g3 delta_interval -= delta; 2018190: 86 21 00 02 sub %g4, %g2, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2018194: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2018198: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201819c: 7f ff dd a1 call 200f820 20181a0: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 20181a4: 90 06 20 68 add %i0, 0x68, %o0 20181a8: 40 00 13 33 call 201ce74 <_Watchdog_Insert> 20181ac: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20181b0: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20181b4: 80 a0 60 00 cmp %g1, 0 20181b8: 12 bf ff df bne 2018134 <_Timer_server_Schedule_operation_method+0x4c> 20181bc: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 20181c0: 7f ff ff b6 call 2018098 <_Timer_server_Reset_tod_system_watchdog> 20181c4: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 20181c8: 40 00 0f 0f call 201be04 <_Thread_Enable_dispatch> 20181cc: 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 ); 20181d0: 7f ff dd 90 call 200f810 20181d4: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 20181d8: 05 00 80 f3 sethi %hi(0x203cc00), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 20181dc: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 20181e0: c4 00 a2 48 ld [ %g2 + 0x248 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 20181e4: 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 ); 20181e8: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 20181ec: 80 a0 40 03 cmp %g1, %g3 20181f0: 02 80 00 08 be 2018210 <_Timer_server_Schedule_operation_method+0x128> 20181f4: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20181f8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 20181fc: 80 a1 00 1c cmp %g4, %i4 2018200: 1a 80 00 03 bcc 201820c <_Timer_server_Schedule_operation_method+0x124> 2018204: 86 10 20 00 clr %g3 delta_interval -= delta; 2018208: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 201820c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2018210: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2018214: 7f ff dd 83 call 200f820 2018218: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 201821c: 90 06 20 30 add %i0, 0x30, %o0 2018220: 40 00 13 15 call 201ce74 <_Watchdog_Insert> 2018224: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2018228: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 201822c: 80 a0 60 00 cmp %g1, 0 2018230: 12 bf ff c1 bne 2018134 <_Timer_server_Schedule_operation_method+0x4c> 2018234: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2018238: 7f ff ff 84 call 2018048 <_Timer_server_Reset_interval_system_watchdog> 201823c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2018240: 40 00 0e f1 call 201be04 <_Thread_Enable_dispatch> 2018244: 81 e8 00 00 restore } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2018248: 84 01 00 02 add %g4, %g2, %g2 delta_interval += delta; 201824c: 10 bf ff d2 b 2018194 <_Timer_server_Schedule_operation_method+0xac> 2018250: 86 20 80 09 sub %g2, %o1, %g3 =============================================================================== 0200d25c <_Timespec_Add_to>: ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d25c: d8 02 00 00 ld [ %o0 ], %o4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 200d260: c4 02 40 00 ld [ %o1 ], %g2 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 200d264: c6 02 20 04 ld [ %o0 + 4 ], %g3 200d268: c2 02 60 04 ld [ %o1 + 4 ], %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d26c: 98 03 00 02 add %o4, %g2, %o4 time->tv_nsec += add->tv_nsec; 200d270: 82 00 c0 01 add %g3, %g1, %g1 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d274: d8 22 00 00 st %o4, [ %o0 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200d278: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 200d27c: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 200d280: 80 a0 40 04 cmp %g1, %g4 200d284: 08 80 00 0d bleu 200d2b8 <_Timespec_Add_to+0x5c> <== ALWAYS TAKEN 200d288: c2 22 20 04 st %g1, [ %o0 + 4 ] 200d28c: 98 03 20 01 inc %o4 <== NOT EXECUTED time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200d290: 1b 31 19 4d sethi %hi(0xc4653400), %o5 <== NOT EXECUTED * * This routines adds two timespecs. The second argument is added * to the first. */ uint32_t _Timespec_Add_to( 200d294: 98 23 00 02 sub %o4, %g2, %o4 <== NOT EXECUTED time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200d298: 9a 13 62 00 or %o5, 0x200, %o5 <== NOT EXECUTED 200d29c: 82 00 40 0d add %g1, %o5, %g1 <== NOT EXECUTED * * This routines adds two timespecs. The second argument is added * to the first. */ uint32_t _Timespec_Add_to( 200d2a0: 86 03 00 02 add %o4, %g2, %g3 <== NOT EXECUTED /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200d2a4: 80 a0 40 04 cmp %g1, %g4 <== NOT EXECUTED 200d2a8: 18 bf ff fd bgu 200d29c <_Timespec_Add_to+0x40> <== NOT EXECUTED 200d2ac: 84 00 a0 01 inc %g2 <== NOT EXECUTED 200d2b0: c2 22 20 04 st %g1, [ %o0 + 4 ] <== NOT EXECUTED 200d2b4: c6 22 00 00 st %g3, [ %o0 ] <== NOT EXECUTED time->tv_sec++; seconds++; } return seconds; } 200d2b8: 81 c3 e0 08 retl 200d2bc: 90 10 00 02 mov %g2, %o0 =============================================================================== 0200adc8 <_Timespec_Divide>: const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200adc8: 9d e3 bf 90 save %sp, -112, %sp * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200adcc: fa 06 40 00 ld [ %i1 ], %i5 right += rhs->tv_nsec; 200add0: d6 06 60 04 ld [ %i1 + 4 ], %o3 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200add4: b9 3f 60 1f sra %i5, 0x1f, %i4 200add8: 83 2f 20 03 sll %i4, 3, %g1 200addc: 9b 2f 60 03 sll %i5, 3, %o5 200ade0: 85 37 60 1d srl %i5, 0x1d, %g2 200ade4: 98 10 80 01 or %g2, %g1, %o4 200ade8: 83 33 60 1b srl %o5, 0x1b, %g1 200adec: ad 2b 20 05 sll %o4, 5, %l6 200adf0: af 2b 60 05 sll %o5, 5, %l7 200adf4: ac 10 40 16 or %g1, %l6, %l6 200adf8: 9a a5 c0 0d subcc %l7, %o5, %o5 200adfc: 83 33 60 1a srl %o5, 0x1a, %g1 200ae00: 98 65 80 0c subx %l6, %o4, %o4 200ae04: ab 2b 60 06 sll %o5, 6, %l5 200ae08: a9 2b 20 06 sll %o4, 6, %l4 200ae0c: 86 a5 40 0d subcc %l5, %o5, %g3 200ae10: a8 10 40 14 or %g1, %l4, %l4 200ae14: 84 65 00 0c subx %l4, %o4, %g2 200ae18: 86 80 c0 1d addcc %g3, %i5, %g3 200ae1c: 83 30 e0 1e srl %g3, 0x1e, %g1 200ae20: 84 40 80 1c addx %g2, %i4, %g2 200ae24: a7 28 e0 02 sll %g3, 2, %l3 200ae28: a5 28 a0 02 sll %g2, 2, %l2 200ae2c: 86 80 c0 13 addcc %g3, %l3, %g3 200ae30: a4 10 40 12 or %g1, %l2, %l2 200ae34: 83 30 e0 1e srl %g3, 0x1e, %g1 200ae38: 84 40 80 12 addx %g2, %l2, %g2 200ae3c: a3 28 e0 02 sll %g3, 2, %l1 200ae40: a1 28 a0 02 sll %g2, 2, %l0 200ae44: 86 80 c0 11 addcc %g3, %l1, %g3 200ae48: a0 10 40 10 or %g1, %l0, %l0 200ae4c: 93 28 e0 02 sll %g3, 2, %o1 200ae50: 84 40 80 10 addx %g2, %l0, %g2 200ae54: 83 30 e0 1e srl %g3, 0x1e, %g1 200ae58: 91 28 a0 02 sll %g2, 2, %o0 200ae5c: 86 80 c0 09 addcc %g3, %o1, %g3 200ae60: 90 10 40 08 or %g1, %o0, %o0 200ae64: bb 28 e0 09 sll %g3, 9, %i5 200ae68: 84 40 80 08 addx %g2, %o0, %g2 200ae6c: b9 30 e0 17 srl %g3, 0x17, %i4 200ae70: 89 28 a0 09 sll %g2, 9, %g4 right += rhs->tv_nsec; 200ae74: 95 3a e0 1f sra %o3, 0x1f, %o2 * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae78: 84 17 00 04 or %i4, %g4, %g2 right += rhs->tv_nsec; 200ae7c: 96 87 40 0b addcc %i5, %o3, %o3 const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200ae80: 82 10 00 1a mov %i2, %g1 * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; 200ae84: 94 40 80 0a addx %g2, %o2, %o2 const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200ae88: 88 10 00 1b mov %i3, %g4 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae8c: f8 06 00 00 ld [ %i0 ], %i4 left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; if ( right == 0 ) { 200ae90: 80 92 80 0b orcc %o2, %o3, %g0 200ae94: 02 80 00 62 be 200b01c <_Timespec_Divide+0x254> <== ALWAYS TAKEN 200ae98: fa 06 20 04 ld [ %i0 + 4 ], %i5 /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200ae9c: b2 10 00 1c mov %i4, %i1 <== NOT EXECUTED 200aea0: 9f 37 20 1d srl %i4, 0x1d, %o7 <== NOT EXECUTED 200aea4: b1 3f 20 1f sra %i4, 0x1f, %i0 <== NOT EXECUTED 200aea8: b9 2e 20 03 sll %i0, 3, %i4 <== NOT EXECUTED 200aeac: 9b 2e 60 03 sll %i1, 3, %o5 <== NOT EXECUTED 200aeb0: 98 13 c0 1c or %o7, %i4, %o4 <== NOT EXECUTED 200aeb4: a3 2b 60 05 sll %o5, 5, %l1 <== NOT EXECUTED 200aeb8: b9 33 60 1b srl %o5, 0x1b, %i4 <== NOT EXECUTED 200aebc: 9a a4 40 0d subcc %l1, %o5, %o5 <== NOT EXECUTED 200aec0: b7 2b 60 06 sll %o5, 6, %i3 <== NOT EXECUTED 200aec4: 9f 33 60 1a srl %o5, 0x1a, %o7 <== NOT EXECUTED 200aec8: a1 2b 20 05 sll %o4, 5, %l0 <== NOT EXECUTED 200aecc: a0 17 00 10 or %i4, %l0, %l0 <== NOT EXECUTED 200aed0: 98 64 00 0c subx %l0, %o4, %o4 <== NOT EXECUTED 200aed4: 9a a6 c0 0d subcc %i3, %o5, %o5 <== NOT EXECUTED 200aed8: b5 2b 20 06 sll %o4, 6, %i2 <== NOT EXECUTED 200aedc: b4 13 c0 1a or %o7, %i2, %i2 <== NOT EXECUTED 200aee0: 98 66 80 0c subx %i2, %o4, %o4 <== NOT EXECUTED 200aee4: b2 83 40 19 addcc %o5, %i1, %i1 <== NOT EXECUTED 200aee8: b0 43 00 18 addx %o4, %i0, %i0 <== NOT EXECUTED 200aeec: b7 36 60 1e srl %i1, 0x1e, %i3 <== NOT EXECUTED 200aef0: 85 2e 20 02 sll %i0, 2, %g2 <== NOT EXECUTED 200aef4: 84 16 c0 02 or %i3, %g2, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200aef8: fa 27 bf fc st %i5, [ %fp + -4 ] <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200aefc: 87 2e 60 02 sll %i1, 2, %g3 <== NOT EXECUTED left += lhs->tv_nsec; 200af00: bb 3f 60 1f sra %i5, 0x1f, %i5 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200af04: b2 86 40 03 addcc %i1, %g3, %i1 <== NOT EXECUTED 200af08: b0 46 00 02 addx %i0, %g2, %i0 <== NOT EXECUTED 200af0c: 85 36 60 1e srl %i1, 0x1e, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200af10: fa 27 bf f8 st %i5, [ %fp + -8 ] <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200af14: 93 2e 60 02 sll %i1, 2, %o1 <== NOT EXECUTED left += lhs->tv_nsec; 200af18: f8 1f bf f8 ldd [ %fp + -8 ], %i4 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200af1c: 92 86 40 09 addcc %i1, %o1, %o1 <== NOT EXECUTED 200af20: 91 2e 20 02 sll %i0, 2, %o0 <== NOT EXECUTED 200af24: 90 10 80 08 or %g2, %o0, %o0 <== NOT EXECUTED 200af28: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200af2c: 90 46 00 08 addx %i0, %o0, %o0 <== NOT EXECUTED 200af30: af 2a 60 02 sll %o1, 2, %l7 <== NOT EXECUTED 200af34: ad 2a 20 02 sll %o0, 2, %l6 <== NOT EXECUTED 200af38: 86 82 40 17 addcc %o1, %l7, %g3 <== NOT EXECUTED 200af3c: ac 10 80 16 or %g2, %l6, %l6 <== NOT EXECUTED 200af40: b7 28 e0 09 sll %g3, 9, %i3 <== NOT EXECUTED 200af44: 84 42 00 16 addx %o0, %l6, %g2 <== NOT EXECUTED 200af48: b3 30 e0 17 srl %g3, 0x17, %i1 <== NOT EXECUTED 200af4c: b5 28 a0 09 sll %g2, 9, %i2 <== NOT EXECUTED left += lhs->tv_nsec; 200af50: 86 86 c0 1d addcc %i3, %i5, %g3 <== NOT EXECUTED /* * For math simplicity just convert the timespec to nanoseconds * in a 64-bit integer. */ left = lhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; 200af54: 84 16 40 1a or %i1, %i2, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200af58: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200af5c: b7 28 a0 02 sll %g2, 2, %i3 <== NOT EXECUTED 200af60: bb 28 e0 02 sll %g3, 2, %i5 <== NOT EXECUTED 200af64: b5 30 e0 1e srl %g3, 0x1e, %i2 <== NOT EXECUTED 200af68: ab 2f 60 05 sll %i5, 5, %l5 <== NOT EXECUTED 200af6c: b8 16 80 1b or %i2, %i3, %i4 <== NOT EXECUTED 200af70: 92 a5 40 1d subcc %l5, %i5, %o1 <== NOT EXECUTED 200af74: b7 37 60 1b srl %i5, 0x1b, %i3 <== NOT EXECUTED 200af78: a9 2f 20 05 sll %i4, 5, %l4 <== NOT EXECUTED 200af7c: a8 16 c0 14 or %i3, %l4, %l4 <== NOT EXECUTED 200af80: 90 65 00 1c subx %l4, %i4, %o0 <== NOT EXECUTED 200af84: 92 82 40 03 addcc %o1, %g3, %o1 <== NOT EXECUTED 200af88: 90 42 00 02 addx %o0, %g2, %o0 <== NOT EXECUTED 200af8c: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200af90: a5 2a 20 02 sll %o0, 2, %l2 <== NOT EXECUTED 200af94: a7 2a 60 02 sll %o1, 2, %l3 <== NOT EXECUTED 200af98: a4 10 80 12 or %g2, %l2, %l2 <== NOT EXECUTED 200af9c: 92 82 40 13 addcc %o1, %l3, %o1 <== NOT EXECUTED 200afa0: 85 32 60 1e srl %o1, 0x1e, %g2 <== NOT EXECUTED 200afa4: 90 42 00 12 addx %o0, %l2, %o0 <== NOT EXECUTED 200afa8: a3 2a 60 02 sll %o1, 2, %l1 <== NOT EXECUTED 200afac: a1 2a 20 02 sll %o0, 2, %l0 <== NOT EXECUTED 200afb0: 92 82 40 11 addcc %o1, %l1, %o1 <== NOT EXECUTED 200afb4: a0 10 80 10 or %g2, %l0, %l0 <== NOT EXECUTED 200afb8: 85 2a 60 05 sll %o1, 5, %g2 <== NOT EXECUTED 200afbc: 90 42 00 10 addx %o0, %l0, %o0 <== NOT EXECUTED 200afc0: 87 2a 20 05 sll %o0, 5, %g3 <== NOT EXECUTED 200afc4: c8 27 bf f0 st %g4, [ %fp + -16 ] <== NOT EXECUTED 200afc8: bb 32 60 1b srl %o1, 0x1b, %i5 <== NOT EXECUTED 200afcc: c2 27 bf f4 st %g1, [ %fp + -12 ] <== NOT EXECUTED 200afd0: 90 17 40 03 or %i5, %g3, %o0 <== NOT EXECUTED 200afd4: 40 00 3b ca call 2019efc <__udivdi3> <== NOT EXECUTED 200afd8: 92 10 00 02 mov %g2, %o1 <== NOT EXECUTED *ival_percentage = answer / 1000; 200afdc: 94 10 20 00 clr %o2 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200afe0: b8 10 00 08 mov %o0, %i4 <== NOT EXECUTED 200afe4: ba 10 00 09 mov %o1, %i5 <== NOT EXECUTED *ival_percentage = answer / 1000; 200afe8: 40 00 3b c5 call 2019efc <__udivdi3> <== NOT EXECUTED 200afec: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200aff0: c2 07 bf f4 ld [ %fp + -12 ], %g1 <== NOT EXECUTED *fval_percentage = answer % 1000; 200aff4: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; *ival_percentage = answer / 1000; 200aff8: d2 20 40 00 st %o1, [ %g1 ] <== NOT EXECUTED *fval_percentage = answer % 1000; 200affc: 94 10 20 00 clr %o2 <== NOT EXECUTED 200b000: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200b004: 40 00 3c 92 call 201a24c <__umoddi3> <== NOT EXECUTED 200b008: 92 10 00 1d mov %i5, %o1 <== NOT EXECUTED 200b00c: c8 07 bf f0 ld [ %fp + -16 ], %g4 <== NOT EXECUTED 200b010: d2 21 00 00 st %o1, [ %g4 ] <== NOT EXECUTED 200b014: 81 c7 e0 08 ret <== NOT EXECUTED 200b018: 81 e8 00 00 restore <== NOT EXECUTED left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; if ( right == 0 ) { *ival_percentage = 0; 200b01c: c0 26 80 00 clr [ %i2 ] *fval_percentage = 0; 200b020: c0 26 c0 00 clr [ %i3 ] return; 200b024: 81 c7 e0 08 ret 200b028: 81 e8 00 00 restore =============================================================================== 0200cd24 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200cd24: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200cd28: d4 1e 40 00 ldd [ %i1 ], %o2 200cd2c: 80 92 80 0b orcc %o2, %o3, %g0 200cd30: 22 80 00 2f be,a 200cdec <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200cd34: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200cd38: d0 1e 00 00 ldd [ %i0 ], %o0 200cd3c: 83 2a 20 02 sll %o0, 2, %g1 200cd40: 89 32 60 1e srl %o1, 0x1e, %g4 200cd44: 87 2a 60 02 sll %o1, 2, %g3 200cd48: 84 11 00 01 or %g4, %g1, %g2 200cd4c: 83 30 e0 1b srl %g3, 0x1b, %g1 200cd50: 9b 28 e0 05 sll %g3, 5, %o5 200cd54: 99 28 a0 05 sll %g2, 5, %o4 200cd58: 86 a3 40 03 subcc %o5, %g3, %g3 200cd5c: 98 10 40 0c or %g1, %o4, %o4 200cd60: 84 63 00 02 subx %o4, %g2, %g2 200cd64: 92 80 c0 09 addcc %g3, %o1, %o1 200cd68: 83 32 60 1e srl %o1, 0x1e, %g1 200cd6c: 90 40 80 08 addx %g2, %o0, %o0 200cd70: b3 2a 60 02 sll %o1, 2, %i1 200cd74: b1 2a 20 02 sll %o0, 2, %i0 200cd78: 92 82 40 19 addcc %o1, %i1, %o1 200cd7c: b0 10 40 18 or %g1, %i0, %i0 200cd80: 83 32 60 1e srl %o1, 0x1e, %g1 200cd84: 90 42 00 18 addx %o0, %i0, %o0 200cd88: bb 2a 60 02 sll %o1, 2, %i5 200cd8c: b9 2a 20 02 sll %o0, 2, %i4 200cd90: 92 82 40 1d addcc %o1, %i5, %o1 200cd94: b8 10 40 1c or %g1, %i4, %i4 200cd98: 87 32 60 1b srl %o1, 0x1b, %g3 200cd9c: 90 42 00 1c addx %o0, %i4, %o0 200cda0: 83 2a 60 05 sll %o1, 5, %g1 200cda4: 85 2a 20 05 sll %o0, 5, %g2 200cda8: 92 10 00 01 mov %g1, %o1 200cdac: 40 00 3b 72 call 201bb74 <__divdi3> 200cdb0: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200cdb4: 94 10 20 00 clr %o2 * This looks odd but gives the results the proper precision. * * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; 200cdb8: b8 10 00 08 mov %o0, %i4 200cdbc: ba 10 00 09 mov %o1, %i5 *_ival_percentage = answer / 1000; 200cdc0: 40 00 3b 6d call 201bb74 <__divdi3> 200cdc4: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200cdc8: 90 10 00 1c mov %i4, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200cdcc: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200cdd0: 94 10 20 00 clr %o2 200cdd4: 96 10 23 e8 mov 0x3e8, %o3 200cdd8: 40 00 3c 52 call 201bf20 <__moddi3> 200cddc: 92 10 00 1d mov %i5, %o1 200cde0: d2 26 c0 00 st %o1, [ %i3 ] 200cde4: 81 c7 e0 08 ret 200cde8: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200cdec: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200cdf0: 81 c7 e0 08 ret <== NOT EXECUTED 200cdf4: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200b57c <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200b57c: 9d e3 bf a0 save %sp, -96, %sp 200b580: 39 00 80 7a sethi %hi(0x201e800), %i4 200b584: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201eaa8 <_User_extensions_List> 200b588: 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 ); 200b58c: 80 a7 40 1c cmp %i5, %i4 200b590: 02 80 00 0d be 200b5c4 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200b594: 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 ) 200b598: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b59c: 80 a0 60 00 cmp %g1, 0 200b5a0: 02 80 00 05 be 200b5b4 <_User_extensions_Fatal+0x38> 200b5a4: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200b5a8: 92 10 00 19 mov %i1, %o1 200b5ac: 9f c0 40 00 call %g1 200b5b0: 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 ) { 200b5b4: 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 ); 200b5b8: 80 a7 40 1c cmp %i5, %i4 200b5bc: 32 bf ff f8 bne,a 200b59c <_User_extensions_Fatal+0x20> 200b5c0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b5c4: 81 c7 e0 08 ret 200b5c8: 81 e8 00 00 restore =============================================================================== 0200b428 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200b428: 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; 200b42c: 07 00 80 76 sethi %hi(0x201d800), %g3 200b430: 86 10 e2 ec or %g3, 0x2ec, %g3 ! 201daec initial_extensions = Configuration.User_extension_table; 200b434: f6 00 e0 48 ld [ %g3 + 0x48 ], %i3 200b438: 3b 00 80 7a sethi %hi(0x201e800), %i5 200b43c: 09 00 80 7a sethi %hi(0x201e800), %g4 200b440: 84 17 62 a8 or %i5, 0x2a8, %g2 200b444: 82 11 20 d4 or %g4, 0xd4, %g1 200b448: b4 00 a0 04 add %g2, 4, %i2 200b44c: b8 00 60 04 add %g1, 4, %i4 200b450: f4 27 62 a8 st %i2, [ %i5 + 0x2a8 ] head->previous = NULL; 200b454: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 200b458: 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; 200b45c: f8 21 20 d4 st %i4, [ %g4 + 0xd4 ] head->previous = NULL; 200b460: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200b464: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200b468: 80 a6 e0 00 cmp %i3, 0 200b46c: 02 80 00 1b be 200b4d8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b470: f4 00 e0 44 ld [ %g3 + 0x44 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 200b474: 83 2e a0 02 sll %i2, 2, %g1 200b478: b9 2e a0 04 sll %i2, 4, %i4 200b47c: b8 27 00 01 sub %i4, %g1, %i4 200b480: b8 07 00 1a add %i4, %i2, %i4 200b484: 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 *) 200b488: 40 00 01 98 call 200bae8 <_Workspace_Allocate_or_fatal_error> 200b48c: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b490: 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 *) 200b494: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b498: 40 00 17 65 call 201122c 200b49c: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200b4a0: 80 a6 a0 00 cmp %i2, 0 200b4a4: 02 80 00 0d be 200b4d8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b4a8: 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; 200b4ac: 92 10 00 1b mov %i3, %o1 200b4b0: 94 10 20 20 mov 0x20, %o2 200b4b4: 40 00 17 21 call 2011138 200b4b8: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 200b4bc: 40 00 0d 68 call 200ea5c <_User_extensions_Add_set> 200b4c0: 90 10 00 1d mov %i5, %o0 200b4c4: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200b4c8: 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++ ) { 200b4cc: 80 a7 00 1a cmp %i4, %i2 200b4d0: 12 bf ff f7 bne 200b4ac <_User_extensions_Handler_initialization+0x84> 200b4d4: b6 06 e0 20 add %i3, 0x20, %i3 200b4d8: 81 c7 e0 08 ret 200b4dc: 81 e8 00 00 restore =============================================================================== 0200b4e0 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 200b4e0: 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; 200b4e4: 39 00 80 7a sethi %hi(0x201e800), %i4 200b4e8: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201eaa8 <_User_extensions_List> 200b4ec: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b4f0: b8 07 20 04 add %i4, 4, %i4 200b4f4: 80 a7 40 1c cmp %i5, %i4 200b4f8: 02 80 00 0c be 200b528 <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200b4fc: 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 ) 200b500: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b504: 80 a0 60 00 cmp %g1, 0 200b508: 02 80 00 04 be 200b518 <_User_extensions_Thread_begin+0x38> 200b50c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200b510: 9f c0 40 00 call %g1 200b514: 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 ) { 200b518: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b51c: 80 a7 40 1c cmp %i5, %i4 200b520: 32 bf ff f9 bne,a 200b504 <_User_extensions_Thread_begin+0x24> 200b524: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b528: 81 c7 e0 08 ret 200b52c: 81 e8 00 00 restore =============================================================================== 0200b5cc <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200b5cc: 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; 200b5d0: 39 00 80 7a sethi %hi(0x201e800), %i4 200b5d4: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201eaa8 <_User_extensions_List> 200b5d8: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200b5dc: b8 07 20 04 add %i4, 4, %i4 200b5e0: 80 a7 40 1c cmp %i5, %i4 200b5e4: 02 80 00 10 be 200b624 <_User_extensions_Thread_create+0x58><== NEVER TAKEN 200b5e8: 37 00 80 7b sethi %hi(0x201ec00), %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 ) { 200b5ec: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200b5f0: 80 a0 60 00 cmp %g1, 0 200b5f4: 02 80 00 08 be 200b614 <_User_extensions_Thread_create+0x48> 200b5f8: 84 16 e2 00 or %i3, 0x200, %g2 status = (*the_extension->Callouts.thread_create)( 200b5fc: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b600: 9f c0 40 00 call %g1 200b604: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200b608: 80 8a 20 ff btst 0xff, %o0 200b60c: 22 80 00 0a be,a 200b634 <_User_extensions_Thread_create+0x68> 200b610: b0 10 20 00 clr %i0 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b614: 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 ); 200b618: 80 a7 40 1c cmp %i5, %i4 200b61c: 32 bf ff f5 bne,a 200b5f0 <_User_extensions_Thread_create+0x24> 200b620: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200b624: b0 10 20 01 mov 1, %i0 } 200b628: b0 0e 20 01 and %i0, 1, %i0 200b62c: 81 c7 e0 08 ret 200b630: 81 e8 00 00 restore 200b634: b0 0e 20 01 and %i0, 1, %i0 200b638: 81 c7 e0 08 ret 200b63c: 81 e8 00 00 restore =============================================================================== 0200b640 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200b640: 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; 200b644: 39 00 80 7a sethi %hi(0x201e800), %i4 200b648: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201eaa8 <_User_extensions_List> 200b64c: 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 ); 200b650: 80 a7 40 1c cmp %i5, %i4 200b654: 02 80 00 0d be 200b688 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200b658: 37 00 80 7b sethi %hi(0x201ec00), %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 ) 200b65c: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b660: 80 a0 60 00 cmp %g1, 0 200b664: 02 80 00 05 be 200b678 <_User_extensions_Thread_delete+0x38> 200b668: 84 16 e2 00 or %i3, 0x200, %g2 (*the_extension->Callouts.thread_delete)( 200b66c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b670: 9f c0 40 00 call %g1 200b674: 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 ) { 200b678: 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 ); 200b67c: 80 a7 40 1c cmp %i5, %i4 200b680: 32 bf ff f8 bne,a 200b660 <_User_extensions_Thread_delete+0x20> 200b684: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b688: 81 c7 e0 08 ret 200b68c: 81 e8 00 00 restore =============================================================================== 0200b530 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200b530: 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; 200b534: 39 00 80 7a sethi %hi(0x201e800), %i4 200b538: b8 17 22 a8 or %i4, 0x2a8, %i4 ! 201eaa8 <_User_extensions_List> 200b53c: 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 ); 200b540: 80 a7 40 1c cmp %i5, %i4 200b544: 02 80 00 0c be 200b574 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200b548: 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 ) 200b54c: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b550: 80 a0 60 00 cmp %g1, 0 200b554: 02 80 00 04 be 200b564 <_User_extensions_Thread_exitted+0x34> 200b558: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200b55c: 9f c0 40 00 call %g1 200b560: 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 ) { 200b564: fa 07 60 04 ld [ %i5 + 4 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_Last( &_User_extensions_List ); 200b568: 80 a7 40 1c cmp %i5, %i4 200b56c: 32 bf ff f9 bne,a 200b550 <_User_extensions_Thread_exitted+0x20> 200b570: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b574: 81 c7 e0 08 ret 200b578: 81 e8 00 00 restore =============================================================================== 0200beec <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200beec: 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; 200bef0: 39 00 80 7d sethi %hi(0x201f400), %i4 200bef4: fa 07 21 d8 ld [ %i4 + 0x1d8 ], %i5 ! 201f5d8 <_User_extensions_List> 200bef8: b8 17 21 d8 or %i4, 0x1d8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200befc: b8 07 20 04 add %i4, 4, %i4 200bf00: 80 a7 40 1c cmp %i5, %i4 200bf04: 02 80 00 0d be 200bf38 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200bf08: 37 00 80 7e sethi %hi(0x201f800), %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 ) 200bf0c: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200bf10: 80 a0 60 00 cmp %g1, 0 200bf14: 02 80 00 05 be 200bf28 <_User_extensions_Thread_restart+0x3c> 200bf18: 84 16 e1 30 or %i3, 0x130, %g2 (*the_extension->Callouts.thread_restart)( 200bf1c: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200bf20: 9f c0 40 00 call %g1 200bf24: 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 ) { 200bf28: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200bf2c: 80 a7 40 1c cmp %i5, %i4 200bf30: 32 bf ff f8 bne,a 200bf10 <_User_extensions_Thread_restart+0x24> 200bf34: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200bf38: 81 c7 e0 08 ret 200bf3c: 81 e8 00 00 restore =============================================================================== 0200b690 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200b690: 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; 200b694: 39 00 80 7a sethi %hi(0x201e800), %i4 200b698: fa 07 22 a8 ld [ %i4 + 0x2a8 ], %i5 ! 201eaa8 <_User_extensions_List> 200b69c: b8 17 22 a8 or %i4, 0x2a8, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b6a0: b8 07 20 04 add %i4, 4, %i4 200b6a4: 80 a7 40 1c cmp %i5, %i4 200b6a8: 02 80 00 0d be 200b6dc <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200b6ac: 37 00 80 7b sethi %hi(0x201ec00), %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 ) 200b6b0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b6b4: 80 a0 60 00 cmp %g1, 0 200b6b8: 02 80 00 05 be 200b6cc <_User_extensions_Thread_start+0x3c> 200b6bc: 84 16 e2 00 or %i3, 0x200, %g2 (*the_extension->Callouts.thread_start)( 200b6c0: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b6c4: 9f c0 40 00 call %g1 200b6c8: 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 ) { 200b6cc: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b6d0: 80 a7 40 1c cmp %i5, %i4 200b6d4: 32 bf ff f8 bne,a 200b6b4 <_User_extensions_Thread_start+0x24> 200b6d8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b6dc: 81 c7 e0 08 ret 200b6e0: 81 e8 00 00 restore =============================================================================== 0200b6e4 <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200b6e4: 9d e3 bf a0 save %sp, -96, %sp 200b6e8: 39 00 80 7a sethi %hi(0x201e800), %i4 200b6ec: fa 07 20 d4 ld [ %i4 + 0xd4 ], %i5 ! 201e8d4 <_User_extensions_Switches_list> 200b6f0: b8 17 20 d4 or %i4, 0xd4, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200b6f4: b8 07 20 04 add %i4, 4, %i4 200b6f8: 80 a7 40 1c cmp %i5, %i4 200b6fc: 02 80 00 0a be 200b724 <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200b700: 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 ); 200b704: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b708: 90 10 00 18 mov %i0, %o0 200b70c: 9f c0 40 00 call %g1 200b710: 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 ) { 200b714: 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 ); 200b718: 80 a7 40 1c cmp %i5, %i4 200b71c: 32 bf ff fb bne,a 200b708 <_User_extensions_Thread_switch+0x24> 200b720: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b724: 81 c7 e0 08 ret 200b728: 81 e8 00 00 restore =============================================================================== 0200d13c <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200d13c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200d140: 7f ff d8 d7 call 200349c 200d144: 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; 200d148: 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 ); 200d14c: b8 06 20 04 add %i0, 4, %i4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200d150: 80 a0 40 1c cmp %g1, %i4 200d154: 02 80 00 1f be 200d1d0 <_Watchdog_Adjust+0x94> 200d158: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200d15c: 12 80 00 1f bne 200d1d8 <_Watchdog_Adjust+0x9c> 200d160: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200d164: 80 a6 a0 00 cmp %i2, 0 200d168: 02 80 00 1a be 200d1d0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d16c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d170: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d174: 80 a6 80 02 cmp %i2, %g2 200d178: 1a 80 00 0a bcc 200d1a0 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200d17c: b6 10 20 01 mov 1, %i3 _Watchdog_First( header )->delta_interval -= units; 200d180: 10 80 00 1d b 200d1f4 <_Watchdog_Adjust+0xb8> <== NOT EXECUTED 200d184: 84 20 80 1a sub %g2, %i2, %g2 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200d188: 02 80 00 12 be 200d1d0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d18c: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d190: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d194: 80 a0 80 1a cmp %g2, %i2 200d198: 38 80 00 17 bgu,a 200d1f4 <_Watchdog_Adjust+0xb8> 200d19c: 84 20 80 1a sub %g2, %i2, %g2 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200d1a0: f6 20 60 10 st %i3, [ %g1 + 0x10 ] while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; 200d1a4: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200d1a8: 7f ff d8 c1 call 20034ac 200d1ac: 01 00 00 00 nop _Watchdog_Tickle( header ); 200d1b0: 40 00 00 a8 call 200d450 <_Watchdog_Tickle> 200d1b4: 90 10 00 18 mov %i0, %o0 _ISR_Disable( level ); 200d1b8: 7f ff d8 b9 call 200349c 200d1bc: 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; 200d1c0: c2 06 00 00 ld [ %i0 ], %g1 if ( _Chain_Is_empty( header ) ) 200d1c4: 80 a7 00 01 cmp %i4, %g1 200d1c8: 12 bf ff f0 bne 200d188 <_Watchdog_Adjust+0x4c> 200d1cc: 80 a6 a0 00 cmp %i2, 0 } break; } } _ISR_Enable( level ); 200d1d0: 7f ff d8 b7 call 20034ac 200d1d4: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200d1d8: 12 bf ff fe bne 200d1d0 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200d1dc: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200d1e0: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d1e4: b4 00 80 1a add %g2, %i2, %i2 200d1e8: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200d1ec: 7f ff d8 b0 call 20034ac 200d1f0: 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; 200d1f4: 10 bf ff f7 b 200d1d0 <_Watchdog_Adjust+0x94> 200d1f8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] =============================================================================== 0200b8a8 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b8a8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b8ac: 7f ff db ae call 2002764 200b8b0: 01 00 00 00 nop previous_state = the_watchdog->state; 200b8b4: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200b8b8: 80 a7 60 01 cmp %i5, 1 200b8bc: 02 80 00 2a be 200b964 <_Watchdog_Remove+0xbc> 200b8c0: 03 00 80 7a sethi %hi(0x201e800), %g1 200b8c4: 1a 80 00 09 bcc 200b8e8 <_Watchdog_Remove+0x40> 200b8c8: 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; 200b8cc: 03 00 80 7a sethi %hi(0x201e800), %g1 200b8d0: c2 00 61 c8 ld [ %g1 + 0x1c8 ], %g1 ! 201e9c8 <_Watchdog_Ticks_since_boot> 200b8d4: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b8d8: 7f ff db a7 call 2002774 200b8dc: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b8e0: 81 c7 e0 08 ret 200b8e4: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200b8e8: 18 bf ff fa bgu 200b8d0 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200b8ec: 03 00 80 7a sethi %hi(0x201e800), %g1 RTEMS_INLINE_ROUTINE Watchdog_Control *_Watchdog_Next( Watchdog_Control *the_watchdog ) { return ( (Watchdog_Control *) the_watchdog->Node.next ); 200b8f0: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b8f4: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b8f8: c4 00 40 00 ld [ %g1 ], %g2 200b8fc: 80 a0 a0 00 cmp %g2, 0 200b900: 02 80 00 07 be 200b91c <_Watchdog_Remove+0x74> 200b904: 05 00 80 7a sethi %hi(0x201e800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b908: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b90c: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200b910: 84 00 c0 02 add %g3, %g2, %g2 200b914: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b918: 05 00 80 7a sethi %hi(0x201e800), %g2 200b91c: c4 00 a1 c4 ld [ %g2 + 0x1c4 ], %g2 ! 201e9c4 <_Watchdog_Sync_count> 200b920: 80 a0 a0 00 cmp %g2, 0 200b924: 22 80 00 07 be,a 200b940 <_Watchdog_Remove+0x98> 200b928: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b92c: 05 00 80 7b sethi %hi(0x201ec00), %g2 200b930: c6 00 a2 08 ld [ %g2 + 0x208 ], %g3 ! 201ee08 <_Per_CPU_Information+0x8> 200b934: 05 00 80 7a sethi %hi(0x201e800), %g2 200b938: c6 20 a1 64 st %g3, [ %g2 + 0x164 ] ! 201e964 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b93c: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200b940: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b944: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b948: 03 00 80 7a sethi %hi(0x201e800), %g1 200b94c: c2 00 61 c8 ld [ %g1 + 0x1c8 ], %g1 ! 201e9c8 <_Watchdog_Ticks_since_boot> 200b950: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b954: 7f ff db 88 call 2002774 200b958: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b95c: 81 c7 e0 08 ret 200b960: 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; 200b964: c2 00 61 c8 ld [ %g1 + 0x1c8 ], %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; 200b968: 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; 200b96c: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b970: 7f ff db 81 call 2002774 200b974: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b978: 81 c7 e0 08 ret 200b97c: 81 e8 00 00 restore =============================================================================== 0200cb4c <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200cb4c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200cb50: 7f ff d9 51 call 2003094 200cb54: 01 00 00 00 nop 200cb58: b6 10 00 08 mov %o0, %i3 printk( "Watchdog Chain: %s %p\n", name, header ); 200cb5c: 11 00 80 79 sethi %hi(0x201e400), %o0 200cb60: 94 10 00 19 mov %i1, %o2 200cb64: 92 10 00 18 mov %i0, %o1 200cb68: 7f ff e1 5d call 20050dc 200cb6c: 90 12 22 70 or %o0, 0x270, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200cb70: fa 06 40 00 ld [ %i1 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200cb74: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200cb78: 80 a7 40 19 cmp %i5, %i1 200cb7c: 02 80 00 0f be 200cbb8 <_Watchdog_Report_chain+0x6c> 200cb80: 11 00 80 79 sethi %hi(0x201e400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200cb84: 92 10 00 1d mov %i5, %o1 200cb88: 40 00 00 0f call 200cbc4 <_Watchdog_Report> 200cb8c: 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 ) 200cb90: fa 07 40 00 ld [ %i5 ], %i5 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200cb94: 80 a7 40 19 cmp %i5, %i1 200cb98: 12 bf ff fc bne 200cb88 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200cb9c: 92 10 00 1d mov %i5, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200cba0: 11 00 80 79 sethi %hi(0x201e400), %o0 200cba4: 92 10 00 18 mov %i0, %o1 200cba8: 7f ff e1 4d call 20050dc 200cbac: 90 12 22 88 or %o0, 0x288, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200cbb0: 7f ff d9 3d call 20030a4 200cbb4: 91 e8 00 1b restore %g0, %i3, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200cbb8: 7f ff e1 49 call 20050dc 200cbbc: 90 12 22 98 or %o0, 0x298, %o0 200cbc0: 30 bf ff fc b,a 200cbb0 <_Watchdog_Report_chain+0x64> =============================================================================== 02007be4 : int adjtime( const struct timeval *delta, struct timeval *olddelta ) { 2007be4: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2007be8: 80 a6 20 00 cmp %i0, 0 2007bec: 02 80 00 8c be 2007e1c 2007bf0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 2007bf4: c4 06 20 04 ld [ %i0 + 4 ], %g2 2007bf8: 03 00 03 d0 sethi %hi(0xf4000), %g1 2007bfc: 82 10 62 3f or %g1, 0x23f, %g1 ! f423f 2007c00: 80 a0 80 01 cmp %g2, %g1 2007c04: 18 80 00 86 bgu 2007e1c 2007c08: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 2007c0c: 22 80 00 06 be,a 2007c24 2007c10: c2 06 00 00 ld [ %i0 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 2007c14: c0 26 60 04 clr [ %i1 + 4 ] 2007c18: c4 06 20 04 ld [ %i0 + 4 ], %g2 if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { olddelta->tv_sec = 0; 2007c1c: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007c20: c2 06 00 00 ld [ %i0 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007c24: 07 00 80 81 sethi %hi(0x2020400), %g3 2007c28: c8 00 e3 4c ld [ %g3 + 0x34c ], %g4 ! 202074c olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007c2c: bb 28 60 08 sll %g1, 8, %i5 2007c30: 87 28 60 03 sll %g1, 3, %g3 2007c34: 86 27 40 03 sub %i5, %g3, %g3 2007c38: bb 28 e0 06 sll %g3, 6, %i5 2007c3c: 86 27 40 03 sub %i5, %g3, %g3 2007c40: 82 00 c0 01 add %g3, %g1, %g1 2007c44: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 2007c48: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007c4c: 80 a0 80 04 cmp %g2, %g4 2007c50: 1a 80 00 05 bcc 2007c64 2007c54: 03 00 80 85 sethi %hi(0x2021400), %g1 return 0; 2007c58: 82 10 20 00 clr %g1 /* set the user's output */ if ( olddelta ) *olddelta = *delta; return 0; } 2007c5c: 81 c7 e0 08 ret 2007c60: 91 e8 00 01 restore %g0, %g1, %o0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007c64: c4 00 62 60 ld [ %g1 + 0x260 ], %g2 2007c68: 84 00 a0 01 inc %g2 2007c6c: c4 20 62 60 st %g2, [ %g1 + 0x260 ] return _Thread_Dispatch_disable_level; 2007c70: c2 00 62 60 ld [ %g1 + 0x260 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007c74: 40 00 07 20 call 20098f4 <_TOD_Get_as_timestamp> 2007c78: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007c7c: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007c80: 94 10 20 00 clr %o2 2007c84: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007c88: 90 10 00 1c mov %i4, %o0 2007c8c: 96 12 e2 00 or %o3, 0x200, %o3 2007c90: 40 00 52 09 call 201c4b4 <__divdi3> 2007c94: 92 10 00 1d mov %i5, %o1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2007c98: f6 06 00 00 ld [ %i0 ], %i3 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007c9c: 94 10 20 00 clr %o2 2007ca0: b6 06 c0 09 add %i3, %o1, %i3 2007ca4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007ca8: 90 10 00 1c mov %i4, %o0 2007cac: 96 12 e2 00 or %o3, 0x200, %o3 2007cb0: 40 00 52 ec call 201c860 <__moddi3> 2007cb4: 92 10 00 1d mov %i5, %o1 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007cb8: c2 06 20 04 ld [ %i0 + 4 ], %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007cbc: 09 31 19 4d sethi %hi(0xc4653400), %g4 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007cc0: 87 28 60 07 sll %g1, 7, %g3 2007cc4: 85 28 60 02 sll %g1, 2, %g2 2007cc8: 84 20 c0 02 sub %g3, %g2, %g2 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007ccc: 88 11 22 00 or %g4, 0x200, %g4 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007cd0: 82 00 80 01 add %g2, %g1, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007cd4: 07 0e e6 b2 sethi %hi(0x3b9ac800), %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007cd8: 83 28 60 03 sll %g1, 3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007cdc: 86 10 e1 ff or %g3, 0x1ff, %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007ce0: 92 00 40 09 add %g1, %o1, %o1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007ce4: 80 a2 40 03 cmp %o1, %g3 2007ce8: 08 80 00 07 bleu 2007d04 2007cec: 84 06 e0 01 add %i3, 1, %g2 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007cf0: 92 02 40 04 add %o1, %g4, %o1 ts.tv_sec++; 2007cf4: b6 10 00 02 mov %g2, %i3 ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007cf8: 80 a2 40 03 cmp %o1, %g3 2007cfc: 18 bf ff fd bgu 2007cf0 <== NEVER TAKEN 2007d00: 84 00 a0 01 inc %g2 ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007d04: 3b 0e e6 b2 sethi %hi(0x3b9ac800), %i5 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007d08: 09 31 19 4d sethi %hi(0xc4653400), %g4 2007d0c: 82 10 00 09 mov %o1, %g1 int _EXFUN(setitimer, (int __which, const struct itimerval *__value, struct itimerval *__ovalue)); #if defined(__rtems__) /* BSD function used by RTEMS code */ int _EXFUN(adjtime,(const struct timeval *, struct timeval *)); 2007d10: 84 06 ff ff add %i3, -1, %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007d14: ba 17 62 00 or %i5, 0x200, %i5 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007d18: 88 11 22 00 or %g4, 0x200, %g4 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007d1c: 82 00 40 1d add %g1, %i5, %g1 ts.tv_sec--; 2007d20: 86 10 00 02 mov %g2, %g3 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) ) { 2007d24: 80 a0 40 04 cmp %g1, %g4 2007d28: 08 bf ff fd bleu 2007d1c 2007d2c: 84 00 bf ff add %g2, -1, %g2 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2007d30: b9 38 e0 1f sra %g3, 0x1f, %i4 2007d34: ae 10 00 01 mov %g1, %l7 2007d38: ad 38 60 1f sra %g1, 0x1f, %l6 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2007d3c: 83 2f 20 03 sll %i4, 3, %g1 2007d40: b7 28 e0 03 sll %g3, 3, %i3 2007d44: 85 30 e0 1d srl %g3, 0x1d, %g2 2007d48: b4 10 80 01 or %g2, %g1, %i2 2007d4c: 83 36 e0 1b srl %i3, 0x1b, %g1 2007d50: a9 2e a0 05 sll %i2, 5, %l4 2007d54: ab 2e e0 05 sll %i3, 5, %l5 2007d58: a8 10 40 14 or %g1, %l4, %l4 2007d5c: b6 a5 40 1b subcc %l5, %i3, %i3 2007d60: 83 36 e0 1a srl %i3, 0x1a, %g1 2007d64: b4 65 00 1a subx %l4, %i2, %i2 2007d68: a7 2e e0 06 sll %i3, 6, %l3 2007d6c: a5 2e a0 06 sll %i2, 6, %l2 2007d70: b6 a4 c0 1b subcc %l3, %i3, %i3 2007d74: a4 10 40 12 or %g1, %l2, %l2 2007d78: b4 64 80 1a subx %l2, %i2, %i2 2007d7c: ba 86 c0 03 addcc %i3, %g3, %i5 2007d80: 83 37 60 1e srl %i5, 0x1e, %g1 2007d84: b8 46 80 1c addx %i2, %i4, %i4 2007d88: a3 2f 60 02 sll %i5, 2, %l1 2007d8c: a1 2f 20 02 sll %i4, 2, %l0 2007d90: a2 87 40 11 addcc %i5, %l1, %l1 2007d94: a0 10 40 10 or %g1, %l0, %l0 2007d98: 83 34 60 1e srl %l1, 0x1e, %g1 2007d9c: a0 47 00 10 addx %i4, %l0, %l0 2007da0: 97 2c 60 02 sll %l1, 2, %o3 2007da4: 95 2c 20 02 sll %l0, 2, %o2 2007da8: 96 84 40 0b addcc %l1, %o3, %o3 2007dac: 94 10 40 0a or %g1, %o2, %o2 2007db0: 9b 2a e0 02 sll %o3, 2, %o5 2007db4: 94 44 00 0a addx %l0, %o2, %o2 2007db8: 83 32 e0 1e srl %o3, 0x1e, %g1 2007dbc: 86 82 c0 0d addcc %o3, %o5, %g3 2007dc0: 99 2a a0 02 sll %o2, 2, %o4 2007dc4: 98 10 40 0c or %g1, %o4, %o4 2007dc8: 84 42 80 0c addx %o2, %o4, %g2 2007dcc: 83 28 e0 09 sll %g3, 9, %g1 2007dd0: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2007dd4: 90 07 bf f8 add %fp, -8, %o0 2007dd8: bb 30 e0 17 srl %g3, 0x17, %i5 2007ddc: 86 85 c0 01 addcc %l7, %g1, %g3 2007de0: 84 17 40 04 or %i5, %g4, %g2 2007de4: 84 45 80 02 addx %l6, %g2, %g2 2007de8: 40 00 06 df call 2009964 <_TOD_Set_with_timestamp> 2007dec: c4 3f bf f8 std %g2, [ %fp + -8 ] ts.tv_sec--; } _TOD_Set( &ts ); _Thread_Enable_dispatch(); 2007df0: 40 00 0d a0 call 200b470 <_Thread_Enable_dispatch> 2007df4: 01 00 00 00 nop /* set the user's output */ if ( olddelta ) 2007df8: 80 a6 60 00 cmp %i1, 0 2007dfc: 02 bf ff 97 be 2007c58 2007e00: 82 10 20 00 clr %g1 *olddelta = *delta; 2007e04: c4 06 00 00 ld [ %i0 ], %g2 2007e08: c4 26 40 00 st %g2, [ %i1 ] 2007e0c: c4 06 20 04 ld [ %i0 + 4 ], %g2 2007e10: c4 26 60 04 st %g2, [ %i1 + 4 ] return 0; } 2007e14: 81 c7 e0 08 ret 2007e18: 91 e8 00 01 restore %g0, %g1, %o0 */ if ( !delta ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007e1c: 40 00 25 ab call 20114c8 <__errno> 2007e20: 01 00 00 00 nop 2007e24: 84 10 20 16 mov 0x16, %g2 ! 16 2007e28: 82 10 3f ff mov -1, %g1 2007e2c: 10 bf ff 8c b 2007c5c 2007e30: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02007df0 : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2007df0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2007df4: 3b 00 80 83 sethi %hi(0x2020c00), %i5 2007df8: 40 00 04 85 call 200900c 2007dfc: 90 17 61 d4 or %i5, 0x1d4, %o0 ! 2020dd4 if (fcntl (fildes, F_GETFD) < 0) { 2007e00: 90 10 00 18 mov %i0, %o0 2007e04: 40 00 1c 42 call 200ef0c 2007e08: 92 10 20 01 mov 1, %o1 2007e0c: 80 a2 20 00 cmp %o0, 0 2007e10: 06 80 00 6c bl 2007fc0 2007e14: 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) { 2007e18: 02 80 00 3b be 2007f04 2007e1c: 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) { 2007e20: f8 06 40 00 ld [ %i1 ], %i4 2007e24: 80 a7 00 18 cmp %i4, %i0 2007e28: 12 80 00 2f bne 2007ee4 2007e2c: 90 17 61 d4 or %i5, 0x1d4, %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); 2007e30: 92 10 00 1c mov %i4, %o1 2007e34: 11 00 80 83 sethi %hi(0x2020c00), %o0 2007e38: 94 10 20 00 clr %o2 2007e3c: 40 00 01 92 call 2008484 2007e40: 90 12 22 1c or %o0, 0x21c, %o0 if (r_chain == NULL) { 2007e44: b6 92 20 00 orcc %o0, 0, %i3 2007e48: 22 80 00 0f be,a 2007e84 2007e4c: b6 17 61 d4 or %i5, 0x1d4, %i3 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007e50: b8 06 e0 1c add %i3, 0x1c, %i4 2007e54: 40 00 04 6e call 200900c 2007e58: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007e5c: 92 10 00 19 mov %i1, %o1 2007e60: 40 00 01 d2 call 20085a8 2007e64: 90 06 e0 08 add %i3, 8, %o0 2007e68: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2007e6c: 40 00 04 88 call 200908c 2007e70: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007e74: 40 00 04 86 call 200908c 2007e78: 90 17 61 d4 or %i5, 0x1d4, %o0 return result; } return AIO_ALLDONE; } 2007e7c: 81 c7 e0 08 ret 2007e80: 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)) { 2007e84: c4 06 e0 54 ld [ %i3 + 0x54 ], %g2 2007e88: 82 06 e0 58 add %i3, 0x58, %g1 2007e8c: 80 a0 80 01 cmp %g2, %g1 2007e90: 02 80 00 0f be 2007ecc <== NEVER TAKEN 2007e94: 90 06 e0 54 add %i3, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007e98: 92 10 00 1c mov %i4, %o1 2007e9c: 40 00 01 7a call 2008484 2007ea0: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007ea4: 80 a2 20 00 cmp %o0, 0 2007ea8: 02 80 00 0e be 2007ee0 2007eac: 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); 2007eb0: 40 00 01 be call 20085a8 2007eb4: 90 02 20 08 add %o0, 8, %o0 2007eb8: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007ebc: 40 00 04 74 call 200908c 2007ec0: 90 10 00 1b mov %i3, %o0 return result; 2007ec4: 81 c7 e0 08 ret 2007ec8: 81 e8 00 00 restore if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock(&aio_request_queue.mutex); return AIO_ALLDONE; 2007ecc: b0 10 20 02 mov 2, %i0 <== NOT EXECUTED AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); if (r_chain == NULL) { pthread_mutex_unlock(&aio_request_queue.mutex); 2007ed0: 40 00 04 6f call 200908c 2007ed4: 90 17 61 d4 or %i5, 0x1d4, %o0 return AIO_ALLDONE; 2007ed8: 81 c7 e0 08 ret 2007edc: 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); 2007ee0: 90 10 00 1b mov %i3, %o0 2007ee4: 40 00 04 6a call 200908c 2007ee8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2007eec: 40 00 2b 61 call 2012c70 <__errno> 2007ef0: 01 00 00 00 nop 2007ef4: 82 10 20 16 mov 0x16, %g1 ! 16 2007ef8: c2 22 00 00 st %g1, [ %o0 ] 2007efc: 81 c7 e0 08 ret 2007f00: 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); 2007f04: 11 00 80 83 sethi %hi(0x2020c00), %o0 2007f08: 94 10 20 00 clr %o2 2007f0c: 40 00 01 5e call 2008484 2007f10: 90 12 22 1c or %o0, 0x21c, %o0 if (r_chain == NULL) { 2007f14: b8 92 20 00 orcc %o0, 0, %i4 2007f18: 02 80 00 0f be 2007f54 2007f1c: b6 07 20 1c add %i4, 0x1c, %i3 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007f20: 40 00 04 3b call 200900c 2007f24: 90 10 00 1b mov %i3, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007f28: 40 00 0b 26 call 200abc0 <_Chain_Extract> 2007f2c: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007f30: 40 00 01 8a call 2008558 2007f34: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007f38: 40 00 04 55 call 200908c 2007f3c: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2007f40: b0 10 20 00 clr %i0 pthread_mutex_lock (&r_chain->mutex); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_unlock (&aio_request_queue.mutex); 2007f44: 40 00 04 52 call 200908c 2007f48: 90 17 61 d4 or %i5, 0x1d4, %o0 return AIO_CANCELED; 2007f4c: 81 c7 e0 08 ret 2007f50: 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; 2007f54: b8 17 61 d4 or %i5, 0x1d4, %i4 r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007f58: c4 07 20 54 ld [ %i4 + 0x54 ], %g2 2007f5c: 82 07 20 58 add %i4, 0x58, %g1 2007f60: 80 a0 80 01 cmp %g2, %g1 2007f64: 02 bf ff da be 2007ecc <== NEVER TAKEN 2007f68: 90 07 20 54 add %i4, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007f6c: 92 10 00 18 mov %i0, %o1 2007f70: 40 00 01 45 call 2008484 2007f74: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007f78: b6 92 20 00 orcc %o0, 0, %i3 2007f7c: 22 bf ff d5 be,a 2007ed0 2007f80: b0 10 20 02 mov 2, %i0 2007f84: 40 00 0b 0f call 200abc0 <_Chain_Extract> 2007f88: ba 06 e0 1c add %i3, 0x1c, %i5 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007f8c: 40 00 01 73 call 2008558 2007f90: 90 10 00 1b mov %i3, %o0 pthread_mutex_destroy (&r_chain->mutex); 2007f94: 40 00 03 71 call 2008d58 2007f98: 90 10 00 1d mov %i5, %o0 pthread_cond_destroy (&r_chain->mutex); 2007f9c: 40 00 02 92 call 20089e4 2007fa0: 90 10 00 1d mov %i5, %o0 free (r_chain); 2007fa4: 7f ff ef 9f call 2003e20 2007fa8: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2007fac: 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); 2007fb0: 40 00 04 37 call 200908c 2007fb4: 90 10 00 1c mov %i4, %o0 return AIO_CANCELED; 2007fb8: 81 c7 e0 08 ret 2007fbc: 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); 2007fc0: 40 00 04 33 call 200908c 2007fc4: 90 17 61 d4 or %i5, 0x1d4, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2007fc8: 40 00 2b 2a call 2012c70 <__errno> 2007fcc: b0 10 3f ff mov -1, %i0 2007fd0: 82 10 20 09 mov 9, %g1 2007fd4: c2 22 00 00 st %g1, [ %o0 ] 2007fd8: 81 c7 e0 08 ret 2007fdc: 81 e8 00 00 restore =============================================================================== 02007fe8 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2007fe8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2007fec: 03 00 00 08 sethi %hi(0x2000), %g1 2007ff0: 80 a6 00 01 cmp %i0, %g1 2007ff4: 12 80 00 14 bne 2008044 2007ff8: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007ffc: d0 06 40 00 ld [ %i1 ], %o0 2008000: 40 00 1b c3 call 200ef0c 2008004: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2008008: 90 0a 20 03 and %o0, 3, %o0 200800c: 90 02 3f ff add %o0, -1, %o0 2008010: 80 a2 20 01 cmp %o0, 1 2008014: 18 80 00 0c bgu 2008044 2008018: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 200801c: 7f ff f0 c2 call 2004324 2008020: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008024: 80 a2 20 00 cmp %o0, 0 2008028: 02 80 00 06 be 2008040 <== NEVER TAKEN 200802c: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2008030: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2008034: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2008038: 40 00 01 78 call 2008618 200803c: 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); 2008040: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2008044: 82 10 3f ff mov -1, %g1 2008048: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 200804c: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2008050: 40 00 2b 08 call 2012c70 <__errno> 2008054: b0 10 3f ff mov -1, %i0 2008058: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 200805c: 81 c7 e0 08 ret 2008060: 81 e8 00 00 restore =============================================================================== 020087fc : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20087fc: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008800: d0 06 00 00 ld [ %i0 ], %o0 2008804: 92 10 20 03 mov 3, %o1 2008808: 40 00 19 c1 call 200ef0c 200880c: ba 10 20 09 mov 9, %i5 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2008810: 80 8a 20 01 btst 1, %o0 2008814: 12 80 00 0b bne 2008840 2008818: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 200881c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008820: 80 a0 60 00 cmp %g1, 0 2008824: 12 80 00 06 bne 200883c 2008828: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 200882c: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008830: 80 a0 60 00 cmp %g1, 0 2008834: 16 80 00 0a bge 200885c 2008838: 01 00 00 00 nop rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 200883c: 82 10 3f ff mov -1, %g1 ! ffffffff 2008840: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2008844: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2008848: 40 00 29 0a call 2012c70 <__errno> 200884c: b0 10 3f ff mov -1, %i0 2008850: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2008854: 81 c7 e0 08 ret 2008858: 81 e8 00 00 restore rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 200885c: 7f ff ee b2 call 2004324 2008860: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008864: 80 a2 20 00 cmp %o0, 0 2008868: 02 80 00 06 be 2008880 <== NEVER TAKEN 200886c: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2008870: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2008874: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2008878: 7f ff ff 68 call 2008618 200887c: 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); 2008880: 10 bf ff ef b 200883c <== NOT EXECUTED 2008884: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 02008890 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2008890: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008894: d0 06 00 00 ld [ %i0 ], %o0 2008898: 40 00 19 9d call 200ef0c 200889c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20088a0: 90 0a 20 03 and %o0, 3, %o0 20088a4: 90 02 3f ff add %o0, -1, %o0 20088a8: 80 a2 20 01 cmp %o0, 1 20088ac: 18 80 00 0a bgu 20088d4 20088b0: 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) 20088b4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20088b8: 80 a0 60 00 cmp %g1, 0 20088bc: 12 80 00 06 bne 20088d4 20088c0: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20088c4: c2 06 20 08 ld [ %i0 + 8 ], %g1 20088c8: 80 a0 60 00 cmp %g1, 0 20088cc: 16 80 00 0a bge 20088f4 20088d0: 01 00 00 00 nop rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20088d4: 82 10 3f ff mov -1, %g1 ! ffffffff 20088d8: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 20088dc: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 20088e0: 40 00 28 e4 call 2012c70 <__errno> 20088e4: b0 10 3f ff mov -1, %i0 20088e8: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 20088ec: 81 c7 e0 08 ret 20088f0: 81 e8 00 00 restore rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20088f4: 7f ff ee 8c call 2004324 20088f8: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20088fc: 80 a2 20 00 cmp %o0, 0 2008900: 02 80 00 06 be 2008918 <== NEVER TAKEN 2008904: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 2008908: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 200890c: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2008910: 7f ff ff 42 call 2008618 2008914: 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); 2008918: 10 bf ff ef b 20088d4 <== NOT EXECUTED 200891c: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 02008e5c : rtems_rbtree_control *chunk_tree, rtems_rbheap_chunk *a, rtems_rbheap_chunk *b ) { if (b != NULL_PAGE && rtems_rbheap_is_chunk_free(b)) { 2008e5c: 80 a2 ff f8 cmp %o3, -8 2008e60: 02 80 00 23 be 2008eec 2008e64: 01 00 00 00 nop */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2008e68: c2 02 c0 00 ld [ %o3 ], %g1 2008e6c: 80 a0 60 00 cmp %g1, 0 2008e70: 22 80 00 1c be,a 2008ee0 2008e74: c4 02 e0 04 ld [ %o3 + 4 ], %g2 if (b->begin < a->begin) { 2008e78: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 2008e7c: c4 02 a0 18 ld [ %o2 + 0x18 ], %g2 2008e80: 80 a0 c0 02 cmp %g3, %g2 2008e84: 3a 80 00 07 bcc,a 2008ea0 2008e88: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008e8c: 84 10 00 0a mov %o2, %g2 2008e90: c2 02 80 00 ld [ %o2 ], %g1 2008e94: 94 10 00 0b mov %o3, %o2 2008e98: 96 10 00 02 mov %g2, %o3 a = b; b = t; } a->size += b->size; 2008e9c: c8 02 a0 1c ld [ %o2 + 0x1c ], %g4 2008ea0: c6 02 e0 1c ld [ %o3 + 0x1c ], %g3 { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2008ea4: c4 02 e0 04 ld [ %o3 + 4 ], %g2 2008ea8: 86 01 00 03 add %g4, %g3, %g3 2008eac: c6 22 a0 1c st %g3, [ %o2 + 0x1c ] next->previous = previous; previous->next = next; 2008eb0: c2 20 80 00 st %g1, [ %g2 ] Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; next->previous = previous; 2008eb4: c4 20 60 04 st %g2, [ %g1 + 4 ] ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008eb8: c2 02 00 00 ld [ %o0 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2008ebc: d0 22 e0 04 st %o0, [ %o3 + 4 ] before_node = after_node->next; after_node->next = the_node; 2008ec0: d6 22 00 00 st %o3, [ %o0 ] the_node->next = before_node; 2008ec4: c2 22 c0 00 st %g1, [ %o3 ] rtems_chain_extract_unprotected(&b->chain_node); add_to_chain(free_chain, b); _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); 2008ec8: 90 10 00 09 mov %o1, %o0 before_node->previous = the_node; 2008ecc: d6 20 60 04 st %o3, [ %g1 + 4 ] 2008ed0: 92 02 e0 08 add %o3, 8, %o1 2008ed4: 82 13 c0 00 mov %o7, %g1 2008ed8: 40 00 07 25 call 200ab6c <_RBTree_Extract_unprotected> 2008edc: 9e 10 40 00 mov %g1, %o7 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2008ee0: 80 a0 a0 00 cmp %g2, 0 2008ee4: 32 bf ff e6 bne,a 2008e7c <== NEVER TAKEN 2008ee8: c6 02 e0 18 ld [ %o3 + 0x18 ], %g3 <== NOT EXECUTED 2008eec: 81 c3 e0 08 retl =============================================================================== 02007a50 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2007a50: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2007a54: 80 a6 60 00 cmp %i1, 0 2007a58: 02 80 00 0a be 2007a80 2007a5c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2007a60: 02 80 00 19 be 2007ac4 2007a64: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2007a68: 02 80 00 12 be 2007ab0 <== NEVER TAKEN 2007a6c: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 2007a70: 02 80 00 10 be 2007ab0 2007a74: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2007a78: 02 80 00 08 be 2007a98 2007a7c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2007a80: 40 00 27 ea call 2011a28 <__errno> 2007a84: b0 10 3f ff mov -1, %i0 ! ffffffff 2007a88: 82 10 20 16 mov 0x16, %g1 2007a8c: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2007a90: 81 c7 e0 08 ret 2007a94: 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 ); 2007a98: 40 00 27 e4 call 2011a28 <__errno> 2007a9c: b0 10 3f ff mov -1, %i0 2007aa0: 82 10 20 58 mov 0x58, %g1 2007aa4: c2 22 00 00 st %g1, [ %o0 ] 2007aa8: 81 c7 e0 08 ret 2007aac: 81 e8 00 00 restore _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { _TOD_Get_uptime_as_timespec( tp ); 2007ab0: 90 10 00 19 mov %i1, %o0 2007ab4: 40 00 08 a1 call 2009d38 <_TOD_Get_uptime_as_timespec> 2007ab8: b0 10 20 00 clr %i0 return 0; 2007abc: 81 c7 e0 08 ret 2007ac0: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007ac4: 40 00 08 8b call 2009cf0 <_TOD_Get_as_timestamp> 2007ac8: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007acc: f8 1f bf f8 ldd [ %fp + -8 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007ad0: 94 10 20 00 clr %o2 2007ad4: 90 10 00 1c mov %i4, %o0 2007ad8: 92 10 00 1d mov %i5, %o1 2007adc: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007ae0: 40 00 56 0f call 201d31c <__divdi3> 2007ae4: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007ae8: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007aec: d2 26 40 00 st %o1, [ %i1 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007af0: 90 10 00 1c mov %i4, %o0 2007af4: 92 10 00 1d mov %i5, %o1 2007af8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); return 0; 2007afc: b0 10 20 00 clr %i0 2007b00: 40 00 56 f2 call 201d6c8 <__moddi3> 2007b04: 96 12 e2 00 or %o3, 0x200, %o3 2007b08: d2 26 60 04 st %o1, [ %i1 + 4 ] 2007b0c: 81 c7 e0 08 ret 2007b10: 81 e8 00 00 restore =============================================================================== 02028ff8 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2028ff8: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 2028ffc: 80 a6 60 00 cmp %i1, 0 2029000: 02 80 00 08 be 2029020 <== NEVER TAKEN 2029004: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2029008: 02 80 00 0c be 2029038 202900c: 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 ) 2029010: 02 80 00 4a be 2029138 2029014: 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 ) 2029018: 02 80 00 48 be 2029138 202901c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2029020: 40 00 4a b6 call 203baf8 <__errno> 2029024: b0 10 3f ff mov -1, %i0 ! ffffffff 2029028: 82 10 20 16 mov 0x16, %g1 202902c: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2029030: 81 c7 e0 08 ret 2029034: 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 ) 2029038: c4 06 40 00 ld [ %i1 ], %g2 202903c: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2029040: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2029044: 80 a0 80 01 cmp %g2, %g1 2029048: 08 bf ff f6 bleu 2029020 202904c: 03 00 81 9c sethi %hi(0x2067000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2029050: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20671e0 <_Thread_Dispatch_disable_level> 2029054: 84 00 a0 01 inc %g2 2029058: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return _Thread_Dispatch_disable_level; 202905c: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2029060: fa 06 40 00 ld [ %i1 ], %i5 2029064: ea 06 60 04 ld [ %i1 + 4 ], %l5 2029068: b9 3f 60 1f sra %i5, 0x1f, %i4 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 202906c: 83 2f 20 03 sll %i4, 3, %g1 2029070: b7 2f 60 03 sll %i5, 3, %i3 2029074: 85 37 60 1d srl %i5, 0x1d, %g2 2029078: b4 10 80 01 or %g2, %g1, %i2 202907c: 83 36 e0 1b srl %i3, 0x1b, %g1 2029080: a5 2e a0 05 sll %i2, 5, %l2 2029084: a7 2e e0 05 sll %i3, 5, %l3 2029088: a4 10 40 12 or %g1, %l2, %l2 202908c: b6 a4 c0 1b subcc %l3, %i3, %i3 2029090: 83 36 e0 1a srl %i3, 0x1a, %g1 2029094: b4 64 80 1a subx %l2, %i2, %i2 2029098: a3 2e e0 06 sll %i3, 6, %l1 202909c: a1 2e a0 06 sll %i2, 6, %l0 20290a0: 86 a4 40 1b subcc %l1, %i3, %g3 20290a4: a0 10 40 10 or %g1, %l0, %l0 20290a8: 84 64 00 1a subx %l0, %i2, %g2 20290ac: 86 80 c0 1d addcc %g3, %i5, %g3 20290b0: 83 30 e0 1e srl %g3, 0x1e, %g1 20290b4: 84 40 80 1c addx %g2, %i4, %g2 20290b8: 97 28 e0 02 sll %g3, 2, %o3 20290bc: 95 28 a0 02 sll %g2, 2, %o2 20290c0: 86 80 c0 0b addcc %g3, %o3, %g3 20290c4: 94 10 40 0a or %g1, %o2, %o2 20290c8: 83 30 e0 1e srl %g3, 0x1e, %g1 20290cc: 84 40 80 0a addx %g2, %o2, %g2 20290d0: 9b 28 e0 02 sll %g3, 2, %o5 20290d4: 99 28 a0 02 sll %g2, 2, %o4 20290d8: 86 80 c0 0d addcc %g3, %o5, %g3 20290dc: 98 10 40 0c or %g1, %o4, %o4 20290e0: b3 28 e0 02 sll %g3, 2, %i1 20290e4: 84 40 80 0c addx %g2, %o4, %g2 20290e8: 83 30 e0 1e srl %g3, 0x1e, %g1 20290ec: b1 28 a0 02 sll %g2, 2, %i0 20290f0: 86 80 c0 19 addcc %g3, %i1, %g3 20290f4: b0 10 40 18 or %g1, %i0, %i0 20290f8: 84 40 80 18 addx %g2, %i0, %g2 20290fc: 83 28 e0 09 sll %g3, 9, %g1 2029100: 89 28 a0 09 sll %g2, 9, %g4 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2029104: 90 07 bf f8 add %fp, -8, %o0 2029108: bb 30 e0 17 srl %g3, 0x17, %i5 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 202910c: a9 3d 60 1f sra %l5, 0x1f, %l4 2029110: 86 85 40 01 addcc %l5, %g1, %g3 2029114: 84 17 40 04 or %i5, %g4, %g2 2029118: 84 45 00 02 addx %l4, %g2, %g2 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 202911c: b0 10 20 00 clr %i0 &tod_as_timestamp, tod_as_timespec->tv_sec, tod_as_timespec->tv_nsec ); _TOD_Set_with_timestamp( &tod_as_timestamp ); 2029120: 40 00 04 d4 call 202a470 <_TOD_Set_with_timestamp> 2029124: c4 3f bf f8 std %g2, [ %fp + -8 ] if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); 2029128: 7f ff 85 2e call 200a5e0 <_Thread_Enable_dispatch> 202912c: 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; 2029130: 81 c7 e0 08 ret 2029134: 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 ); 2029138: 40 00 4a 70 call 203baf8 <__errno> 202913c: b0 10 3f ff mov -1, %i0 2029140: 82 10 20 58 mov 0x58, %g1 2029144: c2 22 00 00 st %g1, [ %o0 ] 2029148: 81 c7 e0 08 ret 202914c: 81 e8 00 00 restore =============================================================================== 0201b0dc : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201b0dc: 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() ) 201b0e0: 7f ff ff 63 call 201ae6c 201b0e4: 01 00 00 00 nop 201b0e8: 80 a2 00 18 cmp %o0, %i0 201b0ec: 12 80 00 ad bne 201b3a0 201b0f0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201b0f4: 02 80 00 b1 be 201b3b8 201b0f8: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201b0fc: 80 a0 60 1f cmp %g1, 0x1f 201b100: 18 80 00 ae bgu 201b3b8 201b104: a1 2e 60 02 sll %i1, 2, %l0 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 201b108: 31 00 80 7b sethi %hi(0x201ec00), %i0 201b10c: a3 2e 60 04 sll %i1, 4, %l1 201b110: b0 16 22 60 or %i0, 0x260, %i0 201b114: 84 24 40 10 sub %l1, %l0, %g2 201b118: 84 06 00 02 add %i0, %g2, %g2 201b11c: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201b120: 80 a0 a0 01 cmp %g2, 1 201b124: 02 80 00 9d be 201b398 201b128: 80 a6 60 04 cmp %i1, 4 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 201b12c: 02 80 00 3f be 201b228 201b130: 80 a6 60 08 cmp %i1, 8 201b134: 02 80 00 3d be 201b228 201b138: 80 a6 60 0b cmp %i1, 0xb 201b13c: 02 80 00 3b be 201b228 201b140: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201b144: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201b148: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201b14c: 80 a6 a0 00 cmp %i2, 0 201b150: 02 80 00 3c be 201b240 201b154: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201b158: c2 06 80 00 ld [ %i2 ], %g1 201b15c: 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++; 201b160: 03 00 80 7a sethi %hi(0x201e800), %g1 201b164: c4 00 60 d0 ld [ %g1 + 0xd0 ], %g2 ! 201e8d0 <_Thread_Dispatch_disable_level> 201b168: 84 00 a0 01 inc %g2 201b16c: c4 20 60 d0 st %g2, [ %g1 + 0xd0 ] return _Thread_Dispatch_disable_level; 201b170: c2 00 60 d0 ld [ %g1 + 0xd0 ], %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; 201b174: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b178: d0 00 62 0c ld [ %g1 + 0x20c ], %o0 ! 201ee0c <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201b17c: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201b180: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201b184: 80 af 40 01 andncc %i5, %g1, %g0 201b188: 12 80 00 17 bne 201b1e4 201b18c: 09 00 80 7b sethi %hi(0x201ec00), %g4 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201b190: c2 01 23 ec ld [ %g4 + 0x3ec ], %g1 ! 201efec <_POSIX_signals_Wait_queue> 201b194: 88 11 23 ec or %g4, 0x3ec, %g4 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201b198: 88 01 20 04 add %g4, 4, %g4 201b19c: 80 a0 40 04 cmp %g1, %g4 201b1a0: 32 80 00 0d bne,a 201b1d4 201b1a4: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201b1a8: 10 80 00 28 b 201b248 201b1ac: 03 00 80 76 sethi %hi(0x201d800), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201b1b0: c4 00 e0 d0 ld [ %g3 + 0xd0 ], %g2 201b1b4: 80 af 40 02 andncc %i5, %g2, %g0 201b1b8: 12 80 00 0b bne 201b1e4 201b1bc: 90 10 00 01 mov %g1, %o0 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201b1c0: c2 00 40 00 ld [ %g1 ], %g1 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201b1c4: 80 a0 40 04 cmp %g1, %g4 201b1c8: 22 80 00 20 be,a 201b248 <== ALWAYS TAKEN 201b1cc: 03 00 80 76 sethi %hi(0x201d800), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201b1d0: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 ! 201d830 <== NOT EXECUTED 201b1d4: 80 8f 40 02 btst %i5, %g2 201b1d8: 02 bf ff f6 be 201b1b0 201b1dc: c6 00 61 5c ld [ %g1 + 0x15c ], %g3 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201b1e0: 90 10 00 01 mov %g1, %o0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201b1e4: 92 10 00 19 mov %i1, %o1 201b1e8: 40 00 00 8b call 201b414 <_POSIX_signals_Unblock_thread> 201b1ec: 94 07 bf f4 add %fp, -12, %o2 201b1f0: 80 8a 20 ff btst 0xff, %o0 201b1f4: 12 80 00 09 bne 201b218 201b1f8: 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 ); 201b1fc: 40 00 00 7d call 201b3f0 <_POSIX_signals_Set_process_signals> 201b200: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201b204: a0 24 40 10 sub %l1, %l0, %l0 201b208: c2 06 00 10 ld [ %i0 + %l0 ], %g1 201b20c: 80 a0 60 02 cmp %g1, 2 201b210: 02 80 00 4f be 201b34c 201b214: 11 00 80 7b sethi %hi(0x201ec00), %o0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { _Thread_Enable_dispatch(); 201b218: 7f ff bd c3 call 200a924 <_Thread_Enable_dispatch> 201b21c: b0 10 20 00 clr %i0 201b220: 81 c7 e0 08 ret 201b224: 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 ); 201b228: 40 00 01 0f call 201b664 201b22c: 01 00 00 00 nop 201b230: 40 00 00 d2 call 201b578 201b234: 92 10 00 19 mov %i1, %o1 201b238: 81 c7 e0 08 ret 201b23c: 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; 201b240: 10 bf ff c8 b 201b160 201b244: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201b248: f8 08 63 38 ldub [ %g1 + 0x338 ], %i4 201b24c: 1b 00 80 7a sethi %hi(0x201e800), %o5 201b250: b8 07 20 01 inc %i4 201b254: 9a 13 60 3c or %o5, 0x3c, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201b258: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201b25c: 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); 201b260: 17 04 00 00 sethi %hi(0x10000000), %o3 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 201b264: c2 03 40 00 ld [ %o5 ], %g1 201b268: 80 a0 60 00 cmp %g1, 0 201b26c: 22 80 00 31 be,a 201b330 <== NEVER TAKEN 201b270: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201b274: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201b278: f6 10 60 10 lduh [ %g1 + 0x10 ], %i3 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201b27c: 80 a6 e0 00 cmp %i3, 0 201b280: 02 80 00 2b be 201b32c 201b284: f4 00 60 1c ld [ %g1 + 0x1c ], %i2 201b288: 84 10 20 01 mov 1, %g2 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201b28c: 87 28 a0 02 sll %g2, 2, %g3 maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { the_thread = (Thread_Control *) object_table[ index ]; 201b290: c6 06 80 03 ld [ %i2 + %g3 ], %g3 if ( !the_thread ) 201b294: 80 a0 e0 00 cmp %g3, 0 201b298: 22 80 00 22 be,a 201b320 201b29c: 84 00 a0 01 inc %g2 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201b2a0: c8 00 e0 14 ld [ %g3 + 0x14 ], %g4 201b2a4: 80 a1 00 1c cmp %g4, %i4 201b2a8: 38 80 00 1e bgu,a 201b320 201b2ac: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201b2b0: de 00 e1 5c ld [ %g3 + 0x15c ], %o7 201b2b4: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201b2b8: 80 af 40 0f andncc %i5, %o7, %g0 201b2bc: 22 80 00 19 be,a 201b320 201b2c0: 84 00 a0 01 inc %g2 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 201b2c4: 80 a1 00 1c cmp %g4, %i4 201b2c8: 2a 80 00 14 bcs,a 201b318 201b2cc: b8 10 00 04 mov %g4, %i4 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201b2d0: 80 a2 20 00 cmp %o0, 0 201b2d4: 22 80 00 13 be,a 201b320 <== NEVER TAKEN 201b2d8: 84 00 a0 01 inc %g2 <== NOT EXECUTED 201b2dc: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 201b2e0: 80 a0 60 00 cmp %g1, 0 201b2e4: 22 80 00 0f be,a 201b320 <== NEVER TAKEN 201b2e8: 84 00 a0 01 inc %g2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201b2ec: de 00 e0 10 ld [ %g3 + 0x10 ], %o7 201b2f0: 80 a3 e0 00 cmp %o7, 0 201b2f4: 22 80 00 09 be,a 201b318 201b2f8: b8 10 00 04 mov %g4, %i4 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201b2fc: 80 88 40 0b btst %g1, %o3 201b300: 32 80 00 08 bne,a 201b320 201b304: 84 00 a0 01 inc %g2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201b308: 80 8b c0 0b btst %o7, %o3 201b30c: 22 80 00 05 be,a 201b320 201b310: 84 00 a0 01 inc %g2 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201b314: b8 10 00 04 mov %g4, %i4 201b318: 90 10 00 03 mov %g3, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201b31c: 84 00 a0 01 inc %g2 201b320: 80 a6 c0 02 cmp %i3, %g2 201b324: 1a bf ff db bcc 201b290 201b328: 87 28 a0 02 sll %g2, 2, %g3 201b32c: 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++) { 201b330: 80 a3 40 0c cmp %o5, %o4 201b334: 32 bf ff cd bne,a 201b268 201b338: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201b33c: 80 a2 20 00 cmp %o0, 0 201b340: 12 bf ff aa bne 201b1e8 201b344: 92 10 00 19 mov %i1, %o1 201b348: 30 bf ff ad b,a 201b1fc */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 201b34c: 7f ff b5 6a call 20088f4 <_Chain_Get> 201b350: 90 12 23 e0 or %o0, 0x3e0, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201b354: 92 92 20 00 orcc %o0, 0, %o1 201b358: 02 80 00 1e be 201b3d0 201b35c: 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 ); 201b360: 11 00 80 7c sethi %hi(0x201f000), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201b364: c2 22 60 08 st %g1, [ %o1 + 8 ] 201b368: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201b36c: 90 12 20 58 or %o0, 0x58, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201b370: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201b374: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201b378: 90 02 00 10 add %o0, %l0, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201b37c: c2 22 60 10 st %g1, [ %o1 + 0x10 ] _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201b380: 7f ff b5 52 call 20088c8 <_Chain_Append> 201b384: b0 10 20 00 clr %i0 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { _Thread_Enable_dispatch(); 201b388: 7f ff bd 67 call 200a924 <_Thread_Enable_dispatch> 201b38c: 01 00 00 00 nop 201b390: 81 c7 e0 08 ret 201b394: 81 e8 00 00 restore } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); return 0; } 201b398: 81 c7 e0 08 ret 201b39c: 91 e8 20 00 restore %g0, 0, %o0 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201b3a0: 7f ff d5 1f call 201081c <__errno> 201b3a4: b0 10 3f ff mov -1, %i0 201b3a8: 82 10 20 03 mov 3, %g1 201b3ac: c2 22 00 00 st %g1, [ %o0 ] 201b3b0: 81 c7 e0 08 ret 201b3b4: 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 ); 201b3b8: 7f ff d5 19 call 201081c <__errno> 201b3bc: b0 10 3f ff mov -1, %i0 201b3c0: 82 10 20 16 mov 0x16, %g1 201b3c4: c2 22 00 00 st %g1, [ %o0 ] 201b3c8: 81 c7 e0 08 ret 201b3cc: 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(); 201b3d0: 7f ff bd 55 call 200a924 <_Thread_Enable_dispatch> 201b3d4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201b3d8: 7f ff d5 11 call 201081c <__errno> 201b3dc: 01 00 00 00 nop 201b3e0: 82 10 20 0b mov 0xb, %g1 ! b 201b3e4: c2 22 00 00 st %g1, [ %o0 ] 201b3e8: 81 c7 e0 08 ret 201b3ec: 81 e8 00 00 restore =============================================================================== 02007fb4 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 2007fb4: 9d e3 bf 88 save %sp, -120, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007fb8: 03 00 80 8c sethi %hi(0x2023000), %g1 2007fbc: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2007fc0: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2007fc4: 84 00 a0 01 inc %g2 2007fc8: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 2007fcc: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1 2007fd0: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2007fd4: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2007fd8: fa 27 a0 58 st %i5, [ %fp + 0x58 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2007fdc: a2 8e 62 00 andcc %i1, 0x200, %l1 2007fe0: 12 80 00 36 bne 20080b8 2007fe4: a0 10 20 00 clr %l0 */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 2007fe8: 39 00 80 8e sethi %hi(0x2023800), %i4 2007fec: 40 00 0c 19 call 200b050 <_Objects_Allocate> 2007ff0: 90 17 20 bc or %i4, 0xbc, %o0 ! 20238bc <_POSIX_Message_queue_Information_fds> attr = va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 2007ff4: ba 92 20 00 orcc %o0, 0, %i5 2007ff8: 02 80 00 39 be 20080dc <== NEVER TAKEN 2007ffc: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 2008000: f2 27 60 14 st %i1, [ %i5 + 0x14 ] const char *name, Objects_Id *id, size_t *len ) { return _POSIX_Name_to_id( &_POSIX_Message_queue_Information, name, id, len ); 2008004: 35 00 80 8d sethi %hi(0x2023400), %i2 2008008: 92 10 00 18 mov %i0, %o1 200800c: 90 16 a3 30 or %i2, 0x330, %o0 2008010: 94 07 bf f0 add %fp, -16, %o2 2008014: 40 00 01 46 call 200852c <_POSIX_Name_to_id> 2008018: 96 07 bf fc add %fp, -4, %o3 * If the name to id translation worked, then the message queue exists * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "message queue does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 200801c: b6 92 20 00 orcc %o0, 0, %i3 2008020: 22 80 00 0f be,a 200805c 2008024: 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) ) ) { 2008028: 80 a6 e0 02 cmp %i3, 2 200802c: 02 80 00 3f be 2008128 2008030: 80 a4 60 00 cmp %l1, 0 RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 2008034: 90 17 20 bc or %i4, 0xbc, %o0 2008038: 40 00 0c f3 call 200b404 <_Objects_Free> 200803c: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 2008040: 40 00 11 6c call 200c5f0 <_Thread_Enable_dispatch> 2008044: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 2008048: 40 00 29 cb call 2012774 <__errno> 200804c: 01 00 00 00 nop 2008050: f6 22 00 00 st %i3, [ %o0 ] 2008054: 81 c7 e0 08 ret 2008058: 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) ) { 200805c: 80 a6 6a 00 cmp %i1, 0xa00 2008060: 02 80 00 27 be 20080fc 2008064: d2 07 bf f0 ld [ %fp + -16 ], %o1 RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control *_POSIX_Message_queue_Get ( Objects_Id id, Objects_Locations *location ) { return (POSIX_Message_queue_Control *) 2008068: 94 07 bf f8 add %fp, -8, %o2 200806c: 40 00 0d 4c call 200b59c <_Objects_Get> 2008070: 90 16 a3 30 or %i2, 0x330, %o0 /* * In this case we need to do an ID->pointer conversion to * check the mode. */ the_mq = _POSIX_Message_queue_Get( the_mq_id, &location ); the_mq->open_count += 1; 2008074: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 2008078: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 200807c: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008080: b8 17 20 bc or %i4, 0xbc, %i4 2008084: c4 22 20 18 st %g2, [ %o0 + 0x18 ] 2008088: 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 ); 200808c: d0 27 bf f4 st %o0, [ %fp + -12 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 2008090: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 2008094: 83 28 60 02 sll %g1, 2, %g1 2008098: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200809c: 40 00 11 55 call 200c5f0 <_Thread_Enable_dispatch> 20080a0: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 20080a4: 40 00 11 53 call 200c5f0 <_Thread_Enable_dispatch> 20080a8: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 20080ac: f0 07 60 08 ld [ %i5 + 8 ], %i0 20080b0: 81 c7 e0 08 ret 20080b4: 81 e8 00 00 restore size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 20080b8: 82 07 a0 4c add %fp, 0x4c, %g1 mode = va_arg( arg, mode_t ); attr = va_arg( arg, struct mq_attr * ); 20080bc: e0 07 a0 50 ld [ %fp + 0x50 ], %l0 size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 20080c0: c2 27 bf ec st %g1, [ %fp + -20 ] */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 20080c4: 39 00 80 8e sethi %hi(0x2023800), %i4 20080c8: 40 00 0b e2 call 200b050 <_Objects_Allocate> 20080cc: 90 17 20 bc or %i4, 0xbc, %o0 ! 20238bc <_POSIX_Message_queue_Information_fds> attr = va_arg( arg, struct mq_attr * ); va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 20080d0: ba 92 20 00 orcc %o0, 0, %i5 20080d4: 32 bf ff cc bne,a 2008004 20080d8: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 20080dc: 40 00 11 45 call 200c5f0 <_Thread_Enable_dispatch> 20080e0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 20080e4: 40 00 29 a4 call 2012774 <__errno> 20080e8: 01 00 00 00 nop 20080ec: 82 10 20 17 mov 0x17, %g1 ! 17 20080f0: c2 22 00 00 st %g1, [ %o0 ] 20080f4: 81 c7 e0 08 ret 20080f8: 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 ); 20080fc: 90 17 20 bc or %i4, 0xbc, %o0 2008100: 40 00 0c c1 call 200b404 <_Objects_Free> 2008104: 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(); 2008108: 40 00 11 3a call 200c5f0 <_Thread_Enable_dispatch> 200810c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 2008110: 40 00 29 99 call 2012774 <__errno> 2008114: 01 00 00 00 nop 2008118: 82 10 20 11 mov 0x11, %g1 ! 11 200811c: c2 22 00 00 st %g1, [ %o0 ] 2008120: 81 c7 e0 08 ret 2008124: 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) ) ) { 2008128: 02 bf ff c4 be 2008038 200812c: 90 17 20 bc or %i4, 0xbc, %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( 2008130: d2 07 bf fc ld [ %fp + -4 ], %o1 2008134: 90 10 00 18 mov %i0, %o0 2008138: 94 10 20 01 mov 1, %o2 200813c: 96 10 00 10 mov %l0, %o3 2008140: 40 00 1c 0c call 200f170 <_POSIX_Message_queue_Create_support> 2008144: 98 07 bf f4 add %fp, -12, %o4 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 2008148: 80 a2 3f ff cmp %o0, -1 200814c: 02 80 00 0d be 2008180 2008150: c6 07 bf f4 ld [ %fp + -12 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 2008154: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008158: b8 17 20 bc or %i4, 0xbc, %i4 200815c: 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; 2008160: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 2008164: 83 28 60 02 sll %g1, 2, %g1 2008168: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 200816c: 40 00 11 21 call 200c5f0 <_Thread_Enable_dispatch> 2008170: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 2008174: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 2008178: 81 c7 e0 08 ret 200817c: 81 e8 00 00 restore 2008180: 90 17 20 bc or %i4, 0xbc, %o0 2008184: 92 10 00 1d mov %i5, %o1 2008188: 40 00 0c 9f call 200b404 <_Objects_Free> 200818c: 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(); 2008190: 40 00 11 18 call 200c5f0 <_Thread_Enable_dispatch> 2008194: 01 00 00 00 nop 2008198: 81 c7 e0 08 ret 200819c: 81 e8 00 00 restore =============================================================================== 0200c878 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200c878: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200c87c: 80 a0 60 00 cmp %g1, 0 200c880: 02 80 00 06 be 200c898 200c884: 90 10 20 16 mov 0x16, %o0 200c888: c4 00 40 00 ld [ %g1 ], %g2 200c88c: 80 a0 a0 00 cmp %g2, 0 200c890: 12 80 00 04 bne 200c8a0 200c894: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200c898: 81 c3 e0 08 retl 200c89c: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200c8a0: 18 80 00 09 bgu 200c8c4 200c8a4: 84 10 20 01 mov 1, %g2 ! 1 200c8a8: 85 28 80 09 sll %g2, %o1, %g2 200c8ac: 80 88 a0 17 btst 0x17, %g2 200c8b0: 02 80 00 05 be 200c8c4 <== NEVER TAKEN 200c8b4: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200c8b8: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200c8bc: 81 c3 e0 08 retl 200c8c0: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200c8c4: 81 c3 e0 08 retl 200c8c8: 90 10 20 86 mov 0x86, %o0 =============================================================================== 02007ff8 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2007ff8: 9d e3 bf 90 save %sp, -112, %sp const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2007ffc: 80 a6 20 00 cmp %i0, 0 2008000: 02 80 00 04 be 2008010 2008004: 80 a6 a0 00 cmp %i2, 0 return EINVAL; if ( count == 0 ) 2008008: 12 80 00 04 bne 2008018 200800c: 80 a6 60 00 cmp %i1, 0 * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; _Thread_Enable_dispatch(); return 0; } 2008010: 81 c7 e0 08 ret 2008014: 91 e8 20 16 restore %g0, 0x16, %o0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2008018: 02 80 00 24 be 20080a8 200801c: 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 ) 2008020: c2 06 40 00 ld [ %i1 ], %g1 2008024: 80 a0 60 00 cmp %g1, 0 2008028: 02 bf ff fa be 2008010 200802c: 01 00 00 00 nop return EINVAL; switch ( the_attr->process_shared ) { 2008030: c2 06 60 04 ld [ %i1 + 4 ], %g1 2008034: 80 a0 60 00 cmp %g1, 0 2008038: 12 bf ff f6 bne 2008010 <== NEVER TAKEN 200803c: 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++; 2008040: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 201ff20 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2008044: c0 27 bf f0 clr [ %fp + -16 ] 2008048: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 200804c: f4 27 bf f4 st %i2, [ %fp + -12 ] 2008050: c4 20 63 20 st %g2, [ %g1 + 0x320 ] return _Thread_Dispatch_disable_level; 2008054: c2 00 63 20 ld [ %g1 + 0x320 ], %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 *) 2008058: 39 00 80 80 sethi %hi(0x2020000), %i4 200805c: 40 00 08 ee call 200a414 <_Objects_Allocate> 2008060: 90 17 22 d0 or %i4, 0x2d0, %o0 ! 20202d0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2008064: ba 92 20 00 orcc %o0, 0, %i5 2008068: 02 80 00 14 be 20080b8 200806c: 90 07 60 10 add %i5, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2008070: 40 00 06 36 call 2009948 <_CORE_barrier_Initialize> 2008074: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008078: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200807c: b8 17 22 d0 or %i4, 0x2d0, %i4 2008080: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008084: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008088: 85 28 a0 02 sll %g2, 2, %g2 200808c: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2008090: c0 27 60 0c clr [ %i5 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 2008094: c2 26 00 00 st %g1, [ %i0 ] _Thread_Enable_dispatch(); 2008098: 40 00 0e 10 call 200b8d8 <_Thread_Enable_dispatch> 200809c: b0 10 20 00 clr %i0 20080a0: 81 c7 e0 08 ret 20080a4: 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 ); 20080a8: 7f ff ff 9b call 2007f14 20080ac: 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 ) 20080b0: 10 bf ff dd b 2008024 20080b4: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 20080b8: 40 00 0e 08 call 200b8d8 <_Thread_Enable_dispatch> 20080bc: b0 10 20 0b mov 0xb, %i0 20080c0: 81 c7 e0 08 ret 20080c4: 81 e8 00 00 restore =============================================================================== 0200788c : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 200788c: 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 ) 2007890: 80 a6 20 00 cmp %i0, 0 2007894: 02 80 00 14 be 20078e4 2007898: 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++; 200789c: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 201f730 <_Thread_Dispatch_disable_level> 20078a0: 84 00 a0 01 inc %g2 20078a4: c4 20 63 30 st %g2, [ %g1 + 0x330 ] return _Thread_Dispatch_disable_level; 20078a8: c2 00 63 30 ld [ %g1 + 0x330 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 20078ac: 40 00 12 ef call 200c468 <_Workspace_Allocate> 20078b0: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 20078b4: 80 a2 20 00 cmp %o0, 0 20078b8: 02 80 00 09 be 20078dc <== NEVER TAKEN 20078bc: 03 00 80 7f sethi %hi(0x201fc00), %g1 thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20078c0: c2 00 60 6c ld [ %g1 + 0x6c ], %g1 ! 201fc6c <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 20078c4: 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; 20078c8: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 20078cc: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 20078d0: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 20078d4: 40 00 06 6b call 2009280 <_Chain_Append> 20078d8: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 20078dc: 40 00 0e 54 call 200b22c <_Thread_Enable_dispatch> 20078e0: 81 e8 00 00 restore 20078e4: 81 c7 e0 08 ret 20078e8: 81 e8 00 00 restore =============================================================================== 02008824 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2008824: 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; 2008828: 80 a6 60 00 cmp %i1, 0 200882c: 22 80 00 28 be,a 20088cc 2008830: 33 00 80 7b sethi %hi(0x201ec00), %i1 else the_attr = &_POSIX_Condition_variables_Default_attributes; /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2008834: c4 06 60 04 ld [ %i1 + 4 ], %g2 ! 201ec04 2008838: 80 a0 a0 01 cmp %g2, 1 200883c: 02 80 00 06 be 2008854 <== NEVER TAKEN 2008840: 82 10 20 16 mov 0x16, %g1 return EINVAL; if ( !the_attr->is_initialized ) 2008844: c4 06 40 00 ld [ %i1 ], %g2 2008848: 80 a0 a0 00 cmp %g2, 0 200884c: 32 80 00 04 bne,a 200885c 2008850: 03 00 80 84 sethi %hi(0x2021000), %g1 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2008854: 81 c7 e0 08 ret 2008858: 91 e8 00 01 restore %g0, %g1, %o0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200885c: c4 00 61 20 ld [ %g1 + 0x120 ], %g2 2008860: 84 00 a0 01 inc %g2 2008864: c4 20 61 20 st %g2, [ %g1 + 0x120 ] return _Thread_Dispatch_disable_level; 2008868: c2 00 61 20 ld [ %g1 + 0x120 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 200886c: 39 00 80 85 sethi %hi(0x2021400), %i4 2008870: 40 00 0a 9e call 200b2e8 <_Objects_Allocate> 2008874: 90 17 21 68 or %i4, 0x168, %o0 ! 2021568 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2008878: ba 92 20 00 orcc %o0, 0, %i5 200887c: 02 80 00 16 be 20088d4 2008880: 90 07 60 18 add %i5, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2008884: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2008888: 92 10 20 00 clr %o1 200888c: 15 04 00 02 sethi %hi(0x10000800), %o2 2008890: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2008894: c2 27 60 10 st %g1, [ %i5 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2008898: 40 00 11 f3 call 200d064 <_Thread_queue_Initialize> 200889c: c0 27 60 14 clr [ %i5 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20088a0: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20088a4: b8 17 21 68 or %i4, 0x168, %i4 20088a8: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20088ac: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20088b0: 85 28 a0 02 sll %g2, 2, %g2 20088b4: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 20088b8: c0 27 60 0c clr [ %i5 + 0xc ] 0 ); *cond = the_cond->Object.id; _Thread_Enable_dispatch(); 20088bc: 40 00 0f bc call 200c7ac <_Thread_Enable_dispatch> 20088c0: c2 26 00 00 st %g1, [ %i0 ] return 0; 20088c4: 10 bf ff e4 b 2008854 20088c8: 82 10 20 00 clr %g1 { POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; else the_attr = &_POSIX_Condition_variables_Default_attributes; 20088cc: 10 bf ff da b 2008834 20088d0: b2 16 62 54 or %i1, 0x254, %i1 _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 20088d4: 40 00 0f b6 call 200c7ac <_Thread_Enable_dispatch> 20088d8: 01 00 00 00 nop return ENOMEM; 20088dc: 10 bf ff de b 2008854 20088e0: 82 10 20 0c mov 0xc, %g1 ! c =============================================================================== 02008688 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2008688: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 200868c: 80 a0 60 00 cmp %g1, 0 2008690: 02 80 00 06 be 20086a8 2008694: 90 10 20 16 mov 0x16, %o0 2008698: c4 00 40 00 ld [ %g1 ], %g2 200869c: 80 a0 a0 00 cmp %g2, 0 20086a0: 32 80 00 04 bne,a 20086b0 <== ALWAYS TAKEN 20086a4: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 20086a8: 81 c3 e0 08 retl 20086ac: 01 00 00 00 nop 20086b0: 81 c3 e0 08 retl 20086b4: 90 10 20 00 clr %o0 ! 0 =============================================================================== 02007d38 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 2007d38: 9d e3 bf 58 save %sp, -168, %sp int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2007d3c: 80 a6 a0 00 cmp %i2, 0 2007d40: 02 80 00 0a be 2007d68 2007d44: ba 10 20 0e mov 0xe, %i5 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2007d48: 80 a6 60 00 cmp %i1, 0 2007d4c: 22 80 00 63 be,a 2007ed8 2007d50: 33 00 80 84 sethi %hi(0x2021000), %i1 if ( !the_attr->is_initialized ) 2007d54: c2 06 40 00 ld [ %i1 ], %g1 2007d58: 80 a0 60 00 cmp %g1, 0 2007d5c: 32 80 00 05 bne,a 2007d70 2007d60: c2 06 60 04 ld [ %i1 + 4 ], %g1 schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; break; default: return EINVAL; 2007d64: ba 10 20 16 mov 0x16, %i5 */ *thread = the_thread->Object.id; _RTEMS_Unlock_allocator(); return 0; } 2007d68: 81 c7 e0 08 ret 2007d6c: 91 e8 00 1d restore %g0, %i5, %o0 * stack space if it is allowed to allocate it itself. * * NOTE: If the user provides the stack we will let it drop below * twice the minimum. */ if ( the_attr->stackaddr && !_Stack_Is_enough(the_attr->stacksize) ) 2007d70: 80 a0 60 00 cmp %g1, 0 2007d74: 02 80 00 07 be 2007d90 2007d78: 03 00 80 8a sethi %hi(0x2022800), %g1 2007d7c: c4 06 60 08 ld [ %i1 + 8 ], %g2 2007d80: c2 00 61 0c ld [ %g1 + 0x10c ], %g1 2007d84: 80 a0 80 01 cmp %g2, %g1 2007d88: 0a bf ff f8 bcs 2007d68 2007d8c: ba 10 20 16 mov 0x16, %i5 * If inheritsched is set to PTHREAD_INHERIT_SCHED, then this thread * inherits scheduling attributes from the creating thread. If it is * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { 2007d90: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2007d94: 80 a0 60 01 cmp %g1, 1 2007d98: 02 80 00 52 be 2007ee0 2007d9c: 80 a0 60 02 cmp %g1, 2 2007da0: 32 bf ff f2 bne,a 2007d68 2007da4: ba 10 20 16 mov 0x16, %i5 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2007da8: da 06 60 18 ld [ %i1 + 0x18 ], %o5 2007dac: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2007db0: fa 06 60 20 ld [ %i1 + 0x20 ], %i5 2007db4: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 2007db8: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 2007dbc: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 2007dc0: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2007dc4: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 2007dc8: da 27 bf e4 st %o5, [ %fp + -28 ] 2007dcc: de 27 bf e8 st %o7, [ %fp + -24 ] 2007dd0: fa 27 bf ec st %i5, [ %fp + -20 ] 2007dd4: c8 27 bf f0 st %g4, [ %fp + -16 ] 2007dd8: c6 27 bf f4 st %g3, [ %fp + -12 ] 2007ddc: c4 27 bf f8 st %g2, [ %fp + -8 ] 2007de0: c2 27 bf fc st %g1, [ %fp + -4 ] /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 2007de4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2007de8: 80 a0 60 00 cmp %g1, 0 2007dec: 12 bf ff df bne 2007d68 2007df0: ba 10 20 86 mov 0x86, %i5 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2007df4: 40 00 1a 8d call 200e828 <_POSIX_Priority_Is_valid> 2007df8: d0 07 bf e4 ld [ %fp + -28 ], %o0 2007dfc: 80 8a 20 ff btst 0xff, %o0 2007e00: 02 bf ff da be 2007d68 <== NEVER TAKEN 2007e04: ba 10 20 16 mov 0x16, %i5 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 2007e08: 03 00 80 8a sethi %hi(0x2022800), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 2007e0c: e0 07 bf e4 ld [ %fp + -28 ], %l0 2007e10: e8 08 61 08 ldub [ %g1 + 0x108 ], %l4 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2007e14: 90 10 00 1c mov %i4, %o0 2007e18: 92 07 bf e4 add %fp, -28, %o1 2007e1c: 94 07 bf dc add %fp, -36, %o2 2007e20: 40 00 1a 8f call 200e85c <_POSIX_Thread_Translate_sched_param> 2007e24: 96 07 bf e0 add %fp, -32, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2007e28: ba 92 20 00 orcc %o0, 0, %i5 2007e2c: 12 bf ff cf bne 2007d68 2007e30: 25 00 80 8d sethi %hi(0x2023400), %l2 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2007e34: d0 04 a3 20 ld [ %l2 + 0x320 ], %o0 ! 2023720 <_RTEMS_Allocator_Mutex> 2007e38: 40 00 06 9a call 20098a0 <_API_Mutex_Lock> 2007e3c: 27 00 80 8e sethi %hi(0x2023800), %l3 * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 2007e40: 40 00 09 73 call 200a40c <_Objects_Allocate> 2007e44: 90 14 e0 c0 or %l3, 0xc0, %o0 ! 20238c0 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2007e48: a2 92 20 00 orcc %o0, 0, %l1 2007e4c: 02 80 00 1f be 2007ec8 2007e50: 05 00 80 8a sethi %hi(0x2022800), %g2 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007e54: 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 ) 2007e58: d6 00 a1 0c ld [ %g2 + 0x10c ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007e5c: c0 27 bf d4 clr [ %fp + -44 ] 2007e60: 97 2a e0 01 sll %o3, 1, %o3 2007e64: 80 a2 c0 01 cmp %o3, %g1 2007e68: 1a 80 00 03 bcc 2007e74 2007e6c: d4 06 60 04 ld [ %i1 + 4 ], %o2 2007e70: 96 10 00 01 mov %g1, %o3 2007e74: c2 07 bf dc ld [ %fp + -36 ], %g1 2007e78: 9a 0d 20 ff and %l4, 0xff, %o5 2007e7c: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2007e80: 82 10 20 01 mov 1, %g1 2007e84: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007e88: c2 07 bf e0 ld [ %fp + -32 ], %g1 2007e8c: c0 23 a0 68 clr [ %sp + 0x68 ] 2007e90: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2007e94: 82 07 bf d4 add %fp, -44, %g1 2007e98: 90 14 e0 c0 or %l3, 0xc0, %o0 2007e9c: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2007ea0: 92 10 00 11 mov %l1, %o1 2007ea4: 98 10 20 01 mov 1, %o4 2007ea8: 40 00 0e c3 call 200b9b4 <_Thread_Initialize> 2007eac: 9a 23 40 10 sub %o5, %l0, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2007eb0: 80 8a 20 ff btst 0xff, %o0 2007eb4: 12 80 00 1e bne 2007f2c 2007eb8: 11 00 80 8e sethi %hi(0x2023800), %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 2007ebc: 92 10 00 11 mov %l1, %o1 2007ec0: 40 00 0a 40 call 200a7c0 <_Objects_Free> 2007ec4: 90 12 20 c0 or %o0, 0xc0, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2007ec8: d0 04 a3 20 ld [ %l2 + 0x320 ], %o0 2007ecc: 40 00 06 8a call 20098f4 <_API_Mutex_Unlock> 2007ed0: ba 10 20 0b mov 0xb, %i5 2007ed4: 30 bf ff a5 b,a 2007d68 int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2007ed8: 10 bf ff 9f b 2007d54 2007edc: b2 16 63 bc or %i1, 0x3bc, %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 ]; 2007ee0: 03 00 80 8e sethi %hi(0x2023800), %g1 2007ee4: c2 00 63 cc ld [ %g1 + 0x3cc ], %g1 ! 2023bcc <_Per_CPU_Information+0xc> 2007ee8: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2007eec: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 2007ef0: da 00 60 8c ld [ %g1 + 0x8c ], %o5 2007ef4: de 00 60 90 ld [ %g1 + 0x90 ], %o7 2007ef8: fa 00 60 94 ld [ %g1 + 0x94 ], %i5 2007efc: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 2007f00: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 2007f04: 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; 2007f08: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 2007f0c: d8 27 bf e4 st %o4, [ %fp + -28 ] 2007f10: da 27 bf e8 st %o5, [ %fp + -24 ] 2007f14: de 27 bf ec st %o7, [ %fp + -20 ] 2007f18: fa 27 bf f0 st %i5, [ %fp + -16 ] 2007f1c: c8 27 bf f4 st %g4, [ %fp + -12 ] 2007f20: c6 27 bf f8 st %g3, [ %fp + -8 ] break; 2007f24: 10 bf ff b0 b 2007de4 2007f28: c4 27 bf fc st %g2, [ %fp + -4 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2007f2c: e0 04 61 5c ld [ %l1 + 0x15c ], %l0 api->Attributes = *the_attr; 2007f30: 92 10 00 19 mov %i1, %o1 2007f34: 94 10 20 40 mov 0x40, %o2 2007f38: 40 00 27 87 call 2011d54 2007f3c: 90 10 00 10 mov %l0, %o0 api->detachstate = the_attr->detachstate; 2007f40: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2007f44: 92 07 bf e4 add %fp, -28, %o1 2007f48: 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; 2007f4c: c2 24 20 40 st %g1, [ %l0 + 0x40 ] api->schedpolicy = schedpolicy; 2007f50: f8 24 20 84 st %i4, [ %l0 + 0x84 ] api->schedparam = schedparam; 2007f54: 40 00 27 80 call 2011d54 2007f58: 90 04 20 88 add %l0, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 2007f5c: 90 10 00 11 mov %l1, %o0 2007f60: 92 10 20 01 mov 1, %o1 2007f64: 94 10 00 1a mov %i2, %o2 2007f68: 96 10 00 1b mov %i3, %o3 2007f6c: 40 00 11 07 call 200c388 <_Thread_Start> 2007f70: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2007f74: 80 a7 20 04 cmp %i4, 4 2007f78: 02 80 00 07 be 2007f94 2007f7c: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2007f80: c2 04 60 08 ld [ %l1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2007f84: d0 04 a3 20 ld [ %l2 + 0x320 ], %o0 2007f88: 40 00 06 5b call 20098f4 <_API_Mutex_Unlock> 2007f8c: c2 26 00 00 st %g1, [ %i0 ] 2007f90: 30 bf ff 76 b,a 2007d68 return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 2007f94: 40 00 11 25 call 200c428 <_Timespec_To_ticks> 2007f98: 90 04 20 90 add %l0, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007f9c: 92 04 20 a8 add %l0, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007fa0: d0 24 20 b4 st %o0, [ %l0 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007fa4: 11 00 80 8d sethi %hi(0x2023400), %o0 2007fa8: 40 00 12 0d call 200c7dc <_Watchdog_Insert> 2007fac: 90 12 23 38 or %o0, 0x338, %o0 ! 2023738 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2007fb0: 10 bf ff f5 b 2007f84 2007fb4: c2 04 60 08 ld [ %l1 + 8 ], %g1 =============================================================================== 0201b578 : int pthread_kill( pthread_t thread, int sig ) { 201b578: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201b57c: 80 a6 60 00 cmp %i1, 0 201b580: 02 80 00 2d be 201b634 201b584: ba 06 7f ff add %i1, -1, %i5 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201b588: 80 a7 60 1f cmp %i5, 0x1f 201b58c: 18 80 00 2a bgu 201b634 201b590: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 201b594: 7f ff bc f1 call 200a958 <_Thread_Get> 201b598: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201b59c: c2 07 bf fc ld [ %fp + -4 ], %g1 201b5a0: 80 a0 60 00 cmp %g1, 0 201b5a4: 12 80 00 2a bne 201b64c <== NEVER TAKEN 201b5a8: b8 10 00 08 mov %o0, %i4 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 201b5ac: 83 2e 60 02 sll %i1, 2, %g1 201b5b0: 85 2e 60 04 sll %i1, 4, %g2 201b5b4: 84 20 80 01 sub %g2, %g1, %g2 201b5b8: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b5bc: 82 10 62 60 or %g1, 0x260, %g1 ! 201ee60 <_POSIX_signals_Vectors> 201b5c0: 82 00 40 02 add %g1, %g2, %g1 201b5c4: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b5c8: 80 a0 a0 01 cmp %g2, 1 201b5cc: 02 80 00 14 be 201b61c 201b5d0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201b5d4: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201b5d8: b6 10 20 01 mov 1, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201b5dc: 92 10 00 19 mov %i1, %o1 201b5e0: bb 2e c0 1d sll %i3, %i5, %i5 201b5e4: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201b5e8: ba 10 80 1d or %g2, %i5, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201b5ec: 7f ff ff 8a call 201b414 <_POSIX_signals_Unblock_thread> 201b5f0: fa 20 60 d4 st %i5, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201b5f4: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b5f8: 82 10 62 00 or %g1, 0x200, %g1 ! 201ee00 <_Per_CPU_Information> 201b5fc: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b600: 80 a0 a0 00 cmp %g2, 0 201b604: 02 80 00 06 be 201b61c 201b608: 01 00 00 00 nop 201b60c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201b610: 80 a7 00 02 cmp %i4, %g2 201b614: 02 80 00 06 be 201b62c 201b618: 01 00 00 00 nop api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { _Thread_Enable_dispatch(); 201b61c: 7f ff bc c2 call 200a924 <_Thread_Enable_dispatch> 201b620: b0 10 20 00 clr %i0 ! 0 201b624: 81 c7 e0 08 ret 201b628: 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; 201b62c: f6 28 60 18 stb %i3, [ %g1 + 0x18 ] 201b630: 30 bf ff fb b,a 201b61c if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201b634: 7f ff d4 7a call 201081c <__errno> 201b638: b0 10 3f ff mov -1, %i0 201b63c: 82 10 20 16 mov 0x16, %g1 201b640: c2 22 00 00 st %g1, [ %o0 ] 201b644: 81 c7 e0 08 ret 201b648: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201b64c: 7f ff d4 74 call 201081c <__errno> <== NOT EXECUTED 201b650: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b654: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 201b658: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 201b65c: 81 c7 e0 08 ret <== NOT EXECUTED 201b660: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02009d80 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2009d80: 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 ); 2009d84: 90 10 00 19 mov %i1, %o0 2009d88: 40 00 00 38 call 2009e68 <_POSIX_Absolute_timeout_to_ticks> 2009d8c: 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 ); 2009d90: 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 ); 2009d94: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009d98: 80 a7 60 03 cmp %i5, 3 2009d9c: 02 80 00 0c be 2009dcc 2009da0: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009da4: 7f ff ff bd call 2009c98 <_POSIX_Mutex_Lock_support> 2009da8: 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) ) { 2009dac: 80 a2 20 10 cmp %o0, 0x10 2009db0: 12 80 00 0a bne 2009dd8 2009db4: b0 10 00 08 mov %o0, %i0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2009db8: 80 a7 60 00 cmp %i5, 0 2009dbc: 12 80 00 09 bne 2009de0 <== ALWAYS TAKEN 2009dc0: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 2009dc4: 81 c7 e0 08 ret <== NOT EXECUTED 2009dc8: 91 e8 20 16 restore %g0, 0x16, %o0 <== NOT EXECUTED */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009dcc: 7f ff ff b3 call 2009c98 <_POSIX_Mutex_Lock_support> 2009dd0: 92 10 20 01 mov 1, %o1 2009dd4: b0 10 00 08 mov %o0, %i0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2009dd8: 81 c7 e0 08 ret 2009ddc: 81 e8 00 00 restore * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2009de0: 80 a7 60 01 cmp %i5, 1 2009de4: 18 bf ff fd bgu 2009dd8 <== NEVER TAKEN 2009de8: 01 00 00 00 nop status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 2009dec: 81 c7 e0 08 ret 2009df0: 91 e8 20 74 restore %g0, 0x74, %o0 =============================================================================== 020075b8 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 20075b8: 82 10 00 08 mov %o0, %g1 if ( !attr ) 20075bc: 80 a0 60 00 cmp %g1, 0 20075c0: 02 80 00 06 be 20075d8 20075c4: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 20075c8: c4 00 40 00 ld [ %g1 ], %g2 20075cc: 80 a0 a0 00 cmp %g2, 0 20075d0: 12 80 00 04 bne 20075e0 20075d4: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 20075d8: 81 c3 e0 08 retl 20075dc: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 20075e0: 02 bf ff fe be 20075d8 <== NEVER TAKEN 20075e4: 01 00 00 00 nop return EINVAL; *type = attr->type; 20075e8: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 20075ec: 90 10 20 00 clr %o0 } 20075f0: 81 c3 e0 08 retl 20075f4: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 02009948 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2009948: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200994c: 80 a0 60 00 cmp %g1, 0 2009950: 02 80 00 06 be 2009968 2009954: 90 10 20 16 mov 0x16, %o0 2009958: c4 00 40 00 ld [ %g1 ], %g2 200995c: 80 a0 a0 00 cmp %g2, 0 2009960: 12 80 00 04 bne 2009970 2009964: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2009968: 81 c3 e0 08 retl 200996c: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2009970: 18 bf ff fe bgu 2009968 <== NEVER TAKEN 2009974: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2009978: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 200997c: 81 c3 e0 08 retl 2009980: 90 10 20 00 clr %o0 =============================================================================== 0200764c : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 200764c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007650: 80 a0 60 00 cmp %g1, 0 2007654: 02 80 00 06 be 200766c 2007658: 90 10 20 16 mov 0x16, %o0 200765c: c4 00 40 00 ld [ %g1 ], %g2 2007660: 80 a0 a0 00 cmp %g2, 0 2007664: 12 80 00 04 bne 2007674 <== ALWAYS TAKEN 2007668: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 200766c: 81 c3 e0 08 retl 2007670: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 2007674: 18 bf ff fe bgu 200766c 2007678: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 200767c: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 2007680: 81 c3 e0 08 retl 2007684: 90 10 20 00 clr %o0 =============================================================================== 02008474 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2008474: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 2008478: 80 a6 60 00 cmp %i1, 0 200847c: 12 80 00 05 bne 2008490 2008480: 80 a6 20 00 cmp %i0, 0 return EINVAL; 2008484: 82 10 20 16 mov 0x16, %g1 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2008488: 81 c7 e0 08 ret 200848c: 91 e8 00 01 restore %g0, %g1, %o0 int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) 2008490: 22 bf ff fe be,a 2008488 2008494: 82 10 20 16 mov 0x16, %g1 return EINVAL; if ( !once_control->init_executed ) { 2008498: c4 06 20 04 ld [ %i0 + 4 ], %g2 200849c: 80 a0 a0 00 cmp %g2, 0 20084a0: 12 bf ff fa bne 2008488 20084a4: 82 10 20 00 clr %g1 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20084a8: 90 10 21 00 mov 0x100, %o0 20084ac: 92 10 21 00 mov 0x100, %o1 20084b0: 40 00 03 17 call 200910c 20084b4: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 20084b8: c2 06 20 04 ld [ %i0 + 4 ], %g1 20084bc: 80 a0 60 00 cmp %g1, 0 20084c0: 02 80 00 09 be 20084e4 <== ALWAYS TAKEN 20084c4: 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); 20084c8: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 20084cc: 92 10 21 00 mov 0x100, %o1 20084d0: 40 00 03 0f call 200910c 20084d4: 94 07 bf fc add %fp, -4, %o2 } return 0; 20084d8: 82 10 20 00 clr %g1 } 20084dc: 81 c7 e0 08 ret 20084e0: 91 e8 00 01 restore %g0, %g1, %o0 if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); if ( !once_control->init_executed ) { once_control->is_initialized = true; 20084e4: c2 26 00 00 st %g1, [ %i0 ] once_control->init_executed = true; (*init_routine)(); 20084e8: 9f c6 40 00 call %i1 20084ec: c2 26 20 04 st %g1, [ %i0 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20084f0: 10 bf ff f7 b 20084cc 20084f4: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 020083d8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20083d8: 9d e3 bf 90 save %sp, -112, %sp const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20083dc: 80 a6 20 00 cmp %i0, 0 20083e0: 02 80 00 08 be 2008400 20083e4: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20083e8: 02 80 00 24 be 2008478 20083ec: 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 ) 20083f0: c2 06 40 00 ld [ %i1 ], %g1 20083f4: 80 a0 60 00 cmp %g1, 0 20083f8: 32 80 00 04 bne,a 2008408 <== ALWAYS TAKEN 20083fc: c2 06 60 04 ld [ %i1 + 4 ], %g1 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 2008400: 81 c7 e0 08 ret 2008404: 91 e8 20 16 restore %g0, 0x16, %o0 * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) return EINVAL; switch ( the_attr->process_shared ) { 2008408: 80 a0 60 00 cmp %g1, 0 200840c: 12 bf ff fd bne 2008400 <== NEVER TAKEN 2008410: 03 00 80 8c sethi %hi(0x2023000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008414: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 2008418: c0 27 bf f4 clr [ %fp + -12 ] 200841c: 84 00 a0 01 inc %g2 2008420: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 2008424: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1 * This function allocates a RWLock control block from * the inactive chain of free RWLock control blocks. */ RTEMS_INLINE_ROUTINE POSIX_RWLock_Control *_POSIX_RWLock_Allocate( void ) { return (POSIX_RWLock_Control *) 2008428: 39 00 80 8d sethi %hi(0x2023400), %i4 200842c: 40 00 0b 09 call 200b050 <_Objects_Allocate> 2008430: 90 17 21 f0 or %i4, 0x1f0, %o0 ! 20235f0 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2008434: ba 92 20 00 orcc %o0, 0, %i5 2008438: 02 80 00 14 be 2008488 200843c: 90 07 60 10 add %i5, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2008440: 40 00 09 54 call 200a990 <_CORE_RWLock_Initialize> 2008444: 92 07 bf f4 add %fp, -12, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008448: c4 17 60 0a lduh [ %i5 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200844c: b8 17 21 f0 or %i4, 0x1f0, %i4 2008450: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008454: c2 07 60 08 ld [ %i5 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008458: 85 28 a0 02 sll %g2, 2, %g2 200845c: fa 20 c0 02 st %i5, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2008460: c0 27 60 0c clr [ %i5 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2008464: c2 26 00 00 st %g1, [ %i0 ] _Thread_Enable_dispatch(); 2008468: 40 00 10 62 call 200c5f0 <_Thread_Enable_dispatch> 200846c: b0 10 20 00 clr %i0 2008470: 81 c7 e0 08 ret 2008474: 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 ); 2008478: 40 00 01 b7 call 2008b54 200847c: 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 ) 2008480: 10 bf ff dd b 20083f4 2008484: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 2008488: 40 00 10 5a call 200c5f0 <_Thread_Enable_dispatch> 200848c: b0 10 20 0b mov 0xb, %i0 2008490: 81 c7 e0 08 ret 2008494: 81 e8 00 00 restore =============================================================================== 02008cc0 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008cc0: 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 ) 2008cc4: 80 a6 20 00 cmp %i0, 0 2008cc8: 02 80 00 25 be 2008d5c 2008ccc: 92 07 bf fc add %fp, -4, %o1 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2008cd0: 40 00 1b 22 call 200f958 <_POSIX_Absolute_timeout_to_ticks> 2008cd4: 90 10 00 19 mov %i1, %o0 2008cd8: d2 06 00 00 ld [ %i0 ], %o1 2008cdc: ba 10 00 08 mov %o0, %i5 2008ce0: 94 07 bf f8 add %fp, -8, %o2 2008ce4: 11 00 80 86 sethi %hi(0x2021800), %o0 2008ce8: 40 00 0b ac call 200bb98 <_Objects_Get> 2008cec: 90 12 22 e0 or %o0, 0x2e0, %o0 ! 2021ae0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2008cf0: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008cf4: 80 a0 60 00 cmp %g1, 0 2008cf8: 32 80 00 1a bne,a 2008d60 2008cfc: b0 10 20 16 mov 0x16, %i0 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2008d00: d2 06 00 00 ld [ %i0 ], %o1 2008d04: d6 07 bf fc ld [ %fp + -4 ], %o3 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008d08: 82 1f 60 03 xor %i5, 3, %g1 the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2008d0c: 90 02 20 10 add %o0, 0x10, %o0 2008d10: 80 a0 00 01 cmp %g0, %g1 2008d14: 98 10 20 00 clr %o4 2008d18: b8 60 3f ff subx %g0, -1, %i4 2008d1c: 40 00 07 f6 call 200acf4 <_CORE_RWLock_Obtain_for_reading> 2008d20: 94 10 00 1c mov %i4, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008d24: 40 00 0f 7b call 200cb10 <_Thread_Enable_dispatch> 2008d28: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2008d2c: 03 00 80 87 sethi %hi(0x2021c00), %g1 2008d30: c2 00 62 2c ld [ %g1 + 0x22c ], %g1 ! 2021e2c <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 2008d34: 80 a7 20 00 cmp %i4, 0 2008d38: 12 80 00 05 bne 2008d4c 2008d3c: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2008d40: 80 a2 20 02 cmp %o0, 2 2008d44: 02 80 00 09 be 2008d68 2008d48: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008d4c: 40 00 00 3f call 2008e48 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008d50: 01 00 00 00 nop 2008d54: 81 c7 e0 08 ret 2008d58: 91 e8 00 08 restore %g0, %o0, %o0 #endif case OBJECTS_ERROR: break; } return EINVAL; 2008d5c: b0 10 20 16 mov 0x16, %i0 } 2008d60: 81 c7 e0 08 ret 2008d64: 81 e8 00 00 restore ); _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008d68: 22 bf ff fe be,a 2008d60 <== NEVER TAKEN 2008d6c: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008d70: ba 07 7f ff add %i5, -1, %i5 2008d74: 80 a7 60 01 cmp %i5, 1 2008d78: 18 bf ff f5 bgu 2008d4c <== NEVER TAKEN 2008d7c: b0 10 20 74 mov 0x74, %i0 2008d80: 30 bf ff f8 b,a 2008d60 =============================================================================== 02008d84 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008d84: 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 ) 2008d88: 80 a6 20 00 cmp %i0, 0 2008d8c: 02 80 00 25 be 2008e20 2008d90: 92 07 bf fc add %fp, -4, %o1 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2008d94: 40 00 1a f1 call 200f958 <_POSIX_Absolute_timeout_to_ticks> 2008d98: 90 10 00 19 mov %i1, %o0 2008d9c: d2 06 00 00 ld [ %i0 ], %o1 2008da0: ba 10 00 08 mov %o0, %i5 2008da4: 94 07 bf f8 add %fp, -8, %o2 2008da8: 11 00 80 86 sethi %hi(0x2021800), %o0 2008dac: 40 00 0b 7b call 200bb98 <_Objects_Get> 2008db0: 90 12 22 e0 or %o0, 0x2e0, %o0 ! 2021ae0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2008db4: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008db8: 80 a0 60 00 cmp %g1, 0 2008dbc: 32 80 00 1a bne,a 2008e24 2008dc0: b0 10 20 16 mov 0x16, %i0 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2008dc4: d2 06 00 00 ld [ %i0 ], %o1 2008dc8: d6 07 bf fc ld [ %fp + -4 ], %o3 * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2008dcc: 82 1f 60 03 xor %i5, 3, %g1 the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2008dd0: 90 02 20 10 add %o0, 0x10, %o0 2008dd4: 80 a0 00 01 cmp %g0, %g1 2008dd8: 98 10 20 00 clr %o4 2008ddc: b8 60 3f ff subx %g0, -1, %i4 2008de0: 40 00 07 fa call 200adc8 <_CORE_RWLock_Obtain_for_writing> 2008de4: 94 10 00 1c mov %i4, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008de8: 40 00 0f 4a call 200cb10 <_Thread_Enable_dispatch> 2008dec: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2008df0: 03 00 80 87 sethi %hi(0x2021c00), %g1 2008df4: c2 00 62 2c ld [ %g1 + 0x22c ], %g1 ! 2021e2c <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2008df8: 80 a7 20 00 cmp %i4, 0 2008dfc: 12 80 00 05 bne 2008e10 2008e00: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2008e04: 80 a2 20 02 cmp %o0, 2 2008e08: 02 80 00 09 be 2008e2c 2008e0c: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008e10: 40 00 00 0e call 2008e48 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008e14: 01 00 00 00 nop 2008e18: 81 c7 e0 08 ret 2008e1c: 91 e8 00 08 restore %g0, %o0, %o0 #endif case OBJECTS_ERROR: break; } return EINVAL; 2008e20: b0 10 20 16 mov 0x16, %i0 } 2008e24: 81 c7 e0 08 ret 2008e28: 81 e8 00 00 restore ); _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008e2c: 22 bf ff fe be,a 2008e24 <== NEVER TAKEN 2008e30: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008e34: ba 07 7f ff add %i5, -1, %i5 2008e38: 80 a7 60 01 cmp %i5, 1 2008e3c: 18 bf ff f5 bgu 2008e10 <== NEVER TAKEN 2008e40: b0 10 20 74 mov 0x74, %i0 2008e44: 30 bf ff f8 b,a 2008e24 =============================================================================== 02009660 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2009660: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2009664: 80 a0 60 00 cmp %g1, 0 2009668: 02 80 00 06 be 2009680 200966c: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2009670: c4 00 40 00 ld [ %g1 ], %g2 2009674: 80 a0 a0 00 cmp %g2, 0 2009678: 12 80 00 04 bne 2009688 200967c: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 2009680: 81 c3 e0 08 retl 2009684: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 2009688: 18 bf ff fe bgu 2009680 <== NEVER TAKEN 200968c: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2009690: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 2009694: 81 c3 e0 08 retl 2009698: 90 10 20 00 clr %o0 =============================================================================== 0200a730 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 200a730: 9d e3 bf 90 save %sp, -112, %sp int rc; /* * Check all the parameters */ if ( !param ) 200a734: 80 a6 a0 00 cmp %i2, 0 200a738: 02 80 00 0a be 200a760 200a73c: ba 10 20 16 mov 0x16, %i5 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 200a740: 90 10 00 19 mov %i1, %o0 200a744: 92 10 00 1a mov %i2, %o1 200a748: 94 07 bf f4 add %fp, -12, %o2 200a74c: 40 00 18 f6 call 2010b24 <_POSIX_Thread_Translate_sched_param> 200a750: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 200a754: ba 92 20 00 orcc %o0, 0, %i5 200a758: 02 80 00 05 be 200a76c 200a75c: 90 10 00 18 mov %i0, %o0 case OBJECTS_ERROR: break; } return ESRCH; } 200a760: b0 10 00 1d mov %i5, %i0 200a764: 81 c7 e0 08 ret 200a768: 81 e8 00 00 restore return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 200a76c: 40 00 0c d1 call 200dab0 <_Thread_Get> 200a770: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a774: c2 07 bf fc ld [ %fp + -4 ], %g1 200a778: 80 a0 60 00 cmp %g1, 0 200a77c: 12 80 00 2b bne 200a828 200a780: b6 10 00 08 mov %o0, %i3 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200a784: f8 02 21 5c ld [ %o0 + 0x15c ], %i4 if ( api->schedpolicy == SCHED_SPORADIC ) 200a788: c2 07 20 84 ld [ %i4 + 0x84 ], %g1 200a78c: 80 a0 60 04 cmp %g1, 4 200a790: 02 80 00 35 be 200a864 200a794: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 200a798: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 200a79c: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 200a7a0: c2 27 20 88 st %g1, [ %i4 + 0x88 ] 200a7a4: c4 06 a0 04 ld [ %i2 + 4 ], %g2 200a7a8: c4 27 20 8c st %g2, [ %i4 + 0x8c ] 200a7ac: c4 06 a0 08 ld [ %i2 + 8 ], %g2 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 200a7b0: f2 27 20 84 st %i1, [ %i4 + 0x84 ] api->schedparam = *param; 200a7b4: c4 27 20 90 st %g2, [ %i4 + 0x90 ] 200a7b8: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 200a7bc: c4 27 20 94 st %g2, [ %i4 + 0x94 ] 200a7c0: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 200a7c4: c4 27 20 98 st %g2, [ %i4 + 0x98 ] 200a7c8: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 200a7cc: c4 27 20 9c st %g2, [ %i4 + 0x9c ] 200a7d0: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 200a7d4: c4 27 20 a0 st %g2, [ %i4 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 200a7d8: c4 07 bf f4 ld [ %fp + -12 ], %g2 200a7dc: c4 26 e0 78 st %g2, [ %i3 + 0x78 ] the_thread->budget_callout = budget_callout; 200a7e0: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 200a7e4: 06 80 00 0e bl 200a81c <== NEVER TAKEN 200a7e8: c4 26 e0 7c st %g2, [ %i3 + 0x7c ] 200a7ec: 80 a6 60 02 cmp %i1, 2 200a7f0: 04 80 00 11 ble 200a834 200a7f4: 07 00 80 8c sethi %hi(0x2023000), %g3 200a7f8: 80 a6 60 04 cmp %i1, 4 200a7fc: 12 80 00 08 bne 200a81c <== NEVER TAKEN 200a800: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 200a804: c2 27 20 a4 st %g1, [ %i4 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 200a808: 40 00 11 13 call 200ec54 <_Watchdog_Remove> 200a80c: 90 07 20 a8 add %i4, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 200a810: 90 10 20 00 clr %o0 200a814: 7f ff ff 7b call 200a600 <_POSIX_Threads_Sporadic_budget_TSR> 200a818: 92 10 00 1b mov %i3, %o1 break; } _Thread_Enable_dispatch(); 200a81c: 40 00 0c 98 call 200da7c <_Thread_Enable_dispatch> 200a820: b0 10 00 1d mov %i5, %i0 200a824: 30 bf ff d0 b,a 200a764 #endif case OBJECTS_ERROR: break; } return ESRCH; 200a828: ba 10 20 03 mov 3, %i5 } 200a82c: 81 c7 e0 08 ret 200a830: 91 e8 00 1d restore %g0, %i5, %o0 200a834: d2 08 e0 98 ldub [ %g3 + 0x98 ], %o1 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a838: 05 00 80 8f sethi %hi(0x2023c00), %g2 200a83c: c4 00 a1 f0 ld [ %g2 + 0x1f0 ], %g2 ! 2023df0 <_Thread_Ticks_per_timeslice> 200a840: 92 22 40 01 sub %o1, %g1, %o1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a844: 90 10 00 1b mov %i3, %o0 200a848: 94 10 20 01 mov 1, %o2 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a84c: c4 26 e0 74 st %g2, [ %i3 + 0x74 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a850: 40 00 0b 4a call 200d578 <_Thread_Change_priority> 200a854: d2 26 e0 18 st %o1, [ %i3 + 0x18 ] _Watchdog_Remove( &api->Sporadic_timer ); _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); break; } _Thread_Enable_dispatch(); 200a858: 40 00 0c 89 call 200da7c <_Thread_Enable_dispatch> 200a85c: b0 10 00 1d mov %i5, %i0 200a860: 30 bf ff c1 b,a 200a764 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200a864: 40 00 10 fc call 200ec54 <_Watchdog_Remove> 200a868: 90 07 20 a8 add %i4, 0xa8, %o0 api->schedpolicy = policy; api->schedparam = *param; 200a86c: 10 bf ff cc b 200a79c 200a870: c2 06 80 00 ld [ %i2 ], %g1 =============================================================================== 020080d0 : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20080d0: 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() ) 20080d4: 3b 00 80 7f sethi %hi(0x201fc00), %i5 20080d8: ba 17 60 60 or %i5, 0x60, %i5 ! 201fc60 <_Per_CPU_Information> 20080dc: c2 07 60 08 ld [ %i5 + 8 ], %g1 20080e0: 80 a0 60 00 cmp %g1, 0 20080e4: 12 80 00 17 bne 2008140 <== NEVER TAKEN 20080e8: 03 00 80 7d sethi %hi(0x201f400), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20080ec: c4 07 60 0c ld [ %i5 + 0xc ], %g2 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20080f0: c6 00 63 30 ld [ %g1 + 0x330 ], %g3 20080f4: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 20080f8: 86 00 e0 01 inc %g3 20080fc: c6 20 63 30 st %g3, [ %g1 + 0x330 ] return _Thread_Dispatch_disable_level; 2008100: c2 00 63 30 ld [ %g1 + 0x330 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2008104: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 2008108: 80 a0 60 00 cmp %g1, 0 200810c: 12 80 00 0b bne 2008138 <== NEVER TAKEN 2008110: 01 00 00 00 nop 2008114: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 2008118: 80 a0 60 00 cmp %g1, 0 200811c: 02 80 00 07 be 2008138 2008120: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2008124: 40 00 0c 42 call 200b22c <_Thread_Enable_dispatch> 2008128: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 200812c: f0 07 60 0c ld [ %i5 + 0xc ], %i0 2008130: 40 00 18 93 call 200e37c <_POSIX_Thread_Exit> 2008134: 81 e8 00 00 restore _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2008138: 40 00 0c 3d call 200b22c <_Thread_Enable_dispatch> 200813c: 81 e8 00 00 restore 2008140: 81 c7 e0 08 ret <== NOT EXECUTED 2008144: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008618 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2008618: 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); 200861c: 39 00 80 83 sethi %hi(0x2020c00), %i4 2008620: 40 00 02 7b call 200900c 2008624: 90 17 21 d4 or %i4, 0x1d4, %o0 ! 2020dd4 if (result != 0) { 2008628: b6 92 20 00 orcc %o0, 0, %i3 200862c: 12 80 00 31 bne 20086f0 <== NEVER TAKEN 2008630: 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); 2008634: 40 00 04 b5 call 2009908 2008638: b2 17 21 d4 or %i4, 0x1d4, %i1 200863c: 92 07 bf e0 add %fp, -32, %o1 2008640: 40 00 03 a7 call 20094dc 2008644: 94 07 bf e4 add %fp, -28, %o2 req->caller_thread = pthread_self (); 2008648: 40 00 04 b0 call 2009908 200864c: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008650: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2008654: c6 07 bf e0 ld [ %fp + -32 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008658: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 200865c: 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; 2008660: c6 07 bf e4 ld [ %fp + -28 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); 2008664: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008668: 84 20 c0 02 sub %g3, %g2, %g2 200866c: 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) && 2008670: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2008674: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 2008678: 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; 200867c: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2008680: 80 a0 a0 00 cmp %g2, 0 2008684: 12 80 00 06 bne 200869c <== NEVER TAKEN 2008688: d2 00 40 00 ld [ %g1 ], %o1 200868c: c4 06 60 64 ld [ %i1 + 0x64 ], %g2 2008690: 80 a0 a0 04 cmp %g2, 4 2008694: 24 80 00 1b ble,a 2008700 2008698: 90 06 60 48 add %i1, 0x48, %o0 else { /* the maximum number of threads has been already created even though some of them might be idle. The request belongs to one of the active fd chain */ r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, 200869c: 94 10 20 00 clr %o2 20086a0: 11 00 80 83 sethi %hi(0x2020c00), %o0 20086a4: 7f ff ff 78 call 2008484 20086a8: 90 12 22 1c or %o0, 0x21c, %o0 ! 2020e1c req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20086ac: b4 92 20 00 orcc %o0, 0, %i2 20086b0: 22 80 00 31 be,a 2008774 20086b4: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 20086b8: b2 06 a0 1c add %i2, 0x1c, %i1 20086bc: 40 00 02 54 call 200900c 20086c0: 90 10 00 19 mov %i1, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20086c4: 90 06 a0 08 add %i2, 8, %o0 20086c8: 7f ff ff 12 call 2008310 20086cc: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20086d0: 40 00 01 2b call 2008b7c 20086d4: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20086d8: 40 00 02 6d call 200908c 20086dc: 90 10 00 19 mov %i1, %o0 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 20086e0: 40 00 02 6b call 200908c 20086e4: 90 17 21 d4 or %i4, 0x1d4, %o0 return 0; } 20086e8: 81 c7 e0 08 ret 20086ec: 91 e8 00 1b restore %g0, %i3, %o0 /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); if (result != 0) { free (req); 20086f0: 7f ff ed cc call 2003e20 <== NOT EXECUTED 20086f4: b0 10 00 1b mov %i3, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 20086f8: 81 c7 e0 08 ret <== NOT EXECUTED 20086fc: 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); 2008700: 7f ff ff 61 call 2008484 2008704: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2008708: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 200870c: 80 a0 60 01 cmp %g1, 1 2008710: 12 bf ff ea bne 20086b8 2008714: 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); 2008718: 90 02 20 08 add %o0, 8, %o0 200871c: 40 00 09 42 call 200ac24 <_Chain_Insert> 2008720: 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); 2008724: 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; 2008728: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 200872c: 40 00 01 de call 2008ea4 2008730: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2008734: 92 10 20 00 clr %o1 2008738: 40 00 00 e1 call 2008abc 200873c: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2008740: 90 07 bf dc add %fp, -36, %o0 2008744: 92 06 60 08 add %i1, 8, %o1 2008748: 96 10 00 1a mov %i2, %o3 200874c: 15 00 80 20 sethi %hi(0x2008000), %o2 2008750: 40 00 02 c3 call 200925c 2008754: 94 12 a0 64 or %o2, 0x64, %o2 ! 2008064 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2008758: 82 92 20 00 orcc %o0, 0, %g1 200875c: 12 80 00 25 bne 20087f0 <== NEVER TAKEN 2008760: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2008764: c2 06 60 64 ld [ %i1 + 0x64 ], %g1 2008768: 82 00 60 01 inc %g1 200876c: 10 bf ff dd b 20086e0 2008770: c2 26 60 64 st %g1, [ %i1 + 0x64 ] } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2008774: 11 00 80 83 sethi %hi(0x2020c00), %o0 2008778: d2 00 40 00 ld [ %g1 ], %o1 200877c: 90 12 22 28 or %o0, 0x228, %o0 2008780: 7f ff ff 41 call 2008484 2008784: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2008788: 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); 200878c: b4 10 00 08 mov %o0, %i2 2008790: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 2008794: 80 a0 60 01 cmp %g1, 1 2008798: 02 80 00 0b be 20087c4 200879c: 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); 20087a0: 7f ff fe dc call 2008310 20087a4: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 20087a8: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 20087ac: 80 a0 60 00 cmp %g1, 0 20087b0: 04 bf ff cc ble 20086e0 <== ALWAYS TAKEN 20087b4: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 20087b8: 40 00 00 f1 call 2008b7c <== NOT EXECUTED 20087bc: 90 06 60 04 add %i1, 4, %o0 <== NOT EXECUTED 20087c0: 30 bf ff c8 b,a 20086e0 <== NOT EXECUTED 20087c4: 40 00 09 18 call 200ac24 <_Chain_Insert> 20087c8: 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); 20087cc: 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; 20087d0: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 20087d4: 40 00 01 b4 call 2008ea4 20087d8: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 20087dc: 90 06 a0 20 add %i2, 0x20, %o0 20087e0: 40 00 00 b7 call 2008abc 20087e4: 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) 20087e8: 10 bf ff f1 b 20087ac 20087ec: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, rtems_aio_handle, (void *) r_chain); if (result != 0) { pthread_mutex_unlock (&aio_request_queue.mutex); 20087f0: 40 00 02 27 call 200908c <== NOT EXECUTED 20087f4: b6 10 00 01 mov %g1, %i3 <== NOT EXECUTED 20087f8: 30 bf ff bc b,a 20086e8 <== NOT EXECUTED =============================================================================== 02008064 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2008064: 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); 2008068: 35 00 80 83 sethi %hi(0x2020c00), %i2 200806c: b6 06 20 1c add %i0, 0x1c, %i3 2008070: b4 16 a1 d4 or %i2, 0x1d4, %i2 if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2008074: a0 10 00 1a mov %i2, %l0 2008078: a2 10 00 1a mov %i2, %l1 pthread_cond_destroy (&r_chain->cond); free (r_chain); /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 200807c: a4 06 a0 58 add %i2, 0x58, %l2 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2008080: b2 06 a0 4c add %i2, 0x4c, %i1 /* acquire the mutex of the current fd chain. we don't need to lock the queue mutex since we can add requests to idle fd chains or even active ones if the working request has been extracted from the chain */ result = pthread_mutex_lock (&r_chain->mutex); 2008084: 40 00 03 e2 call 200900c 2008088: 90 10 00 1b mov %i3, %o0 if (result != 0) 200808c: 80 a2 20 00 cmp %o0, 0 2008090: 12 80 00 2b bne 200813c <== NEVER TAKEN 2008094: 01 00 00 00 nop 2008098: 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 ); 200809c: 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)) { 20080a0: 80 a7 40 01 cmp %i5, %g1 20080a4: 02 80 00 41 be 20081a8 20080a8: 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); 20080ac: 40 00 06 17 call 2009908 20080b0: 01 00 00 00 nop 20080b4: 92 07 bf d8 add %fp, -40, %o1 20080b8: 40 00 05 09 call 20094dc 20080bc: 94 07 bf e4 add %fp, -28, %o2 param.sched_priority = req->priority; 20080c0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 20080c4: 40 00 06 11 call 2009908 20080c8: c2 27 bf e4 st %g1, [ %fp + -28 ] 20080cc: d2 07 60 08 ld [ %i5 + 8 ], %o1 20080d0: 40 00 06 12 call 2009918 20080d4: 94 07 bf e4 add %fp, -28, %o2 20080d8: 40 00 0a ba call 200abc0 <_Chain_Extract> 20080dc: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 20080e0: 40 00 03 eb call 200908c 20080e4: 90 10 00 1b mov %i3, %o0 switch (req->aiocbp->aio_lio_opcode) { 20080e8: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 20080ec: c2 07 20 30 ld [ %i4 + 0x30 ], %g1 20080f0: 80 a0 60 02 cmp %g1, 2 20080f4: 22 80 00 25 be,a 2008188 20080f8: c4 1f 20 08 ldd [ %i4 + 8 ], %g2 20080fc: 80 a0 60 03 cmp %g1, 3 2008100: 02 80 00 1e be 2008178 <== NEVER TAKEN 2008104: 01 00 00 00 nop 2008108: 80 a0 60 01 cmp %g1, 1 200810c: 22 80 00 0e be,a 2008144 <== ALWAYS TAKEN 2008110: c4 1f 20 08 ldd [ %i4 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2008114: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 2008118: 40 00 2a d6 call 2012c70 <__errno> <== NOT EXECUTED 200811c: c2 27 20 38 st %g1, [ %i4 + 0x38 ] <== NOT EXECUTED 2008120: 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); 2008124: 90 10 00 1b mov %i3, %o0 <== NOT EXECUTED 2008128: 40 00 03 b9 call 200900c <== NOT EXECUTED 200812c: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED if (result != 0) 2008130: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2008134: 22 bf ff da be,a 200809c <== NOT EXECUTED 2008138: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 200813c: 81 c7 e0 08 ret 2008140: 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, 2008144: d0 07 00 00 ld [ %i4 ], %o0 2008148: d2 07 20 10 ld [ %i4 + 0x10 ], %o1 200814c: d4 07 20 14 ld [ %i4 + 0x14 ], %o2 2008150: 96 10 00 02 mov %g2, %o3 2008154: 40 00 2d c3 call 2013860 2008158: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 200815c: 80 a2 3f ff cmp %o0, -1 2008160: 22 bf ff ed be,a 2008114 <== NEVER TAKEN 2008164: f8 07 60 14 ld [ %i5 + 0x14 ], %i4 <== NOT EXECUTED req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 2008168: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200816c: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2008170: 10 bf ff c5 b 2008084 2008174: 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); 2008178: 40 00 1c 0c call 200f1a8 <== NOT EXECUTED 200817c: d0 07 00 00 ld [ %i4 ], %o0 <== NOT EXECUTED break; 2008180: 10 bf ff f8 b 2008160 <== NOT EXECUTED 2008184: 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, 2008188: d0 07 00 00 ld [ %i4 ], %o0 200818c: d2 07 20 10 ld [ %i4 + 0x10 ], %o1 2008190: d4 07 20 14 ld [ %i4 + 0x14 ], %o2 2008194: 96 10 00 02 mov %g2, %o3 2008198: 40 00 2d f0 call 2013958 200819c: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 20081a0: 10 bf ff f0 b 2008160 20081a4: 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); 20081a8: 40 00 03 b9 call 200908c 20081ac: 90 10 00 1b mov %i3, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 20081b0: 40 00 03 97 call 200900c 20081b4: 90 10 00 1a mov %i2, %o0 if (rtems_chain_is_empty (chain)) 20081b8: c2 06 20 08 ld [ %i0 + 8 ], %g1 20081bc: 80 a7 40 01 cmp %i5, %g1 20081c0: 02 80 00 05 be 20081d4 <== ALWAYS TAKEN 20081c4: 92 07 bf dc add %fp, -36, %o1 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 20081c8: 40 00 03 b1 call 200908c 20081cc: 90 10 00 1a mov %i2, %o0 20081d0: 30 bf ff ad b,a 2008084 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 20081d4: 40 00 01 d3 call 2008920 20081d8: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20081dc: c2 07 bf dc ld [ %fp + -36 ], %g1 timeout.tv_nsec = 0; 20081e0: c0 27 bf e0 clr [ %fp + -32 ] pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20081e4: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20081e8: 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; 20081ec: c2 27 bf dc st %g1, [ %fp + -36 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20081f0: 90 10 00 1d mov %i5, %o0 20081f4: 92 10 00 10 mov %l0, %o1 20081f8: 40 00 02 7d call 2008bec 20081fc: 94 07 bf dc add %fp, -36, %o2 &aio_request_queue.mutex, &timeout); /* If no requests were added to the chain we delete the fd chain from the queue and start working with idle fd chains */ if (result == ETIMEDOUT) { 2008200: 80 a2 20 74 cmp %o0, 0x74 2008204: 12 bf ff f1 bne 20081c8 <== NEVER TAKEN 2008208: 01 00 00 00 nop 200820c: 40 00 0a 6d call 200abc0 <_Chain_Extract> 2008210: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2008214: 40 00 02 d1 call 2008d58 2008218: 90 10 00 1b mov %i3, %o0 pthread_cond_destroy (&r_chain->cond); 200821c: 40 00 01 f2 call 20089e4 2008220: 90 10 00 1d mov %i5, %o0 free (r_chain); 2008224: 7f ff ee ff call 2003e20 2008228: 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; 200822c: f0 06 a0 54 ld [ %i2 + 0x54 ], %i0 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2008230: 80 a6 00 12 cmp %i0, %l2 2008234: 22 80 00 1d be,a 20082a8 2008238: c4 06 a0 68 ld [ %i2 + 0x68 ], %g2 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 200823c: c4 04 60 68 ld [ %l1 + 0x68 ], %g2 ++aio_request_queue.active_threads; 2008240: c2 04 60 64 ld [ %l1 + 0x64 ], %g1 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2008244: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 2008248: 82 00 60 01 inc %g1 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 200824c: c4 24 60 68 st %g2, [ %l1 + 0x68 ] ++aio_request_queue.active_threads; 2008250: c2 24 60 64 st %g1, [ %l1 + 0x64 ] 2008254: 40 00 0a 5b call 200abc0 <_Chain_Extract> 2008258: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200825c: c2 04 60 48 ld [ %l1 + 0x48 ], %g1 rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; while (temp->fildes < r_chain->fildes && 2008260: c6 06 20 14 ld [ %i0 + 0x14 ], %g3 2008264: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2008268: 80 a0 c0 02 cmp %g3, %g2 200826c: 14 80 00 08 bg 200828c <== ALWAYS TAKEN 2008270: 80 a0 40 19 cmp %g1, %i1 RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2008274: 10 80 00 09 b 2008298 <== NOT EXECUTED 2008278: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED 200827c: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2008280: 80 a0 80 03 cmp %g2, %g3 2008284: 16 80 00 04 bge 2008294 2008288: 80 a0 40 19 cmp %g1, %i1 200828c: 32 bf ff fc bne,a 200827c <== ALWAYS TAKEN 2008290: c2 00 40 00 ld [ %g1 ], %g1 2008294: d0 00 60 04 ld [ %g1 + 4 ], %o0 2008298: 92 10 00 18 mov %i0, %o1 200829c: 40 00 0a 62 call 200ac24 <_Chain_Insert> 20082a0: b6 06 20 1c add %i0, 0x1c, %i3 20082a4: 30 bf ff c9 b,a 20081c8 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; 20082a8: c2 06 a0 64 ld [ %i2 + 0x64 ], %g1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 20082ac: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 20082b0: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 20082b4: 92 07 bf dc add %fp, -36, %o1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 20082b8: c4 26 a0 68 st %g2, [ %i2 + 0x68 ] --aio_request_queue.active_threads; 20082bc: c2 26 a0 64 st %g1, [ %i2 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 20082c0: 40 00 01 98 call 2008920 20082c4: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20082c8: c2 07 bf dc ld [ %fp + -36 ], %g1 timeout.tv_nsec = 0; 20082cc: c0 27 bf e0 clr [ %fp + -32 ] AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20082d0: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20082d4: 90 06 a0 04 add %i2, 4, %o0 AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20082d8: c2 27 bf dc st %g1, [ %fp + -36 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20082dc: 92 10 00 1a mov %i2, %o1 20082e0: 40 00 02 43 call 2008bec 20082e4: 94 07 bf dc add %fp, -36, %o2 &aio_request_queue.mutex, &timeout); /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { 20082e8: 80 a2 20 74 cmp %o0, 0x74 20082ec: 22 80 00 04 be,a 20082fc <== ALWAYS TAKEN 20082f0: c2 06 a0 68 ld [ %i2 + 0x68 ], %g1 20082f4: 10 bf ff d2 b 200823c <== NOT EXECUTED 20082f8: f0 06 a0 54 ld [ %i2 + 0x54 ], %i0 <== NOT EXECUTED AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 20082fc: 90 10 00 1a mov %i2, %o0 /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 2008300: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2008304: 40 00 03 62 call 200908c 2008308: c2 26 a0 68 st %g1, [ %i2 + 0x68 ] 200830c: 30 bf ff 8c b,a 200813c =============================================================================== 0200837c : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 200837c: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2008380: 3b 00 80 83 sethi %hi(0x2020c00), %i5 2008384: 40 00 03 9b call 20091f0 2008388: 90 17 61 dc or %i5, 0x1dc, %o0 ! 2020ddc if (result != 0) 200838c: b0 92 20 00 orcc %o0, 0, %i0 2008390: 12 80 00 23 bne 200841c <== NEVER TAKEN 2008394: 90 17 61 dc or %i5, 0x1dc, %o0 return result; result = 2008398: 40 00 03 a2 call 2009220 200839c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 20083a0: 80 a2 20 00 cmp %o0, 0 20083a4: 12 80 00 20 bne 2008424 <== NEVER TAKEN 20083a8: 39 00 80 83 sethi %hi(0x2020c00), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 20083ac: 92 10 20 00 clr %o1 20083b0: 40 00 02 bd call 2008ea4 20083b4: 90 17 21 d4 or %i4, 0x1d4, %o0 if (result != 0) 20083b8: 80 a2 20 00 cmp %o0, 0 20083bc: 12 80 00 23 bne 2008448 <== NEVER TAKEN 20083c0: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 20083c4: 11 00 80 83 sethi %hi(0x2020c00), %o0 20083c8: 40 00 01 bd call 2008abc 20083cc: 90 12 21 d8 or %o0, 0x1d8, %o0 ! 2020dd8 if (result != 0) { 20083d0: b0 92 20 00 orcc %o0, 0, %i0 20083d4: 12 80 00 26 bne 200846c <== NEVER TAKEN 20083d8: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083dc: 82 17 21 d4 or %i4, 0x1d4, %g1 head->previous = NULL; tail->previous = head; 20083e0: 84 00 60 54 add %g1, 0x54, %g2 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083e4: ba 00 60 4c add %g1, 0x4c, %i5 head->previous = NULL; tail->previous = head; 20083e8: 88 00 60 48 add %g1, 0x48, %g4 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083ec: 86 00 60 58 add %g1, 0x58, %g3 head->previous = NULL; tail->previous = head; 20083f0: c4 20 60 5c st %g2, [ %g1 + 0x5c ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083f4: fa 20 60 48 st %i5, [ %g1 + 0x48 ] head->previous = NULL; 20083f8: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 20083fc: c8 20 60 50 st %g4, [ %g1 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2008400: c6 20 60 54 st %g3, [ %g1 + 0x54 ] head->previous = NULL; 2008404: c0 20 60 58 clr [ %g1 + 0x58 ] } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 2008408: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; 200840c: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2008410: 05 00 00 2c sethi %hi(0xb000), %g2 2008414: 84 10 a0 0b or %g2, 0xb, %g2 ! b00b 2008418: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 200841c: 81 c7 e0 08 ret 2008420: 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); 2008424: 40 00 03 67 call 20091c0 <== NOT EXECUTED 2008428: 90 17 61 dc or %i5, 0x1dc, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 200842c: 39 00 80 83 sethi %hi(0x2020c00), %i4 <== NOT EXECUTED 2008430: 92 10 20 00 clr %o1 <== NOT EXECUTED 2008434: 40 00 02 9c call 2008ea4 <== NOT EXECUTED 2008438: 90 17 21 d4 or %i4, 0x1d4, %o0 <== NOT EXECUTED if (result != 0) 200843c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2008440: 02 bf ff e1 be 20083c4 <== NOT EXECUTED 2008444: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2008448: 40 00 03 5e call 20091c0 <== NOT EXECUTED 200844c: 90 17 61 dc or %i5, 0x1dc, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2008450: 92 10 20 00 clr %o1 <== NOT EXECUTED 2008454: 11 00 80 83 sethi %hi(0x2020c00), %o0 <== NOT EXECUTED 2008458: 40 00 01 99 call 2008abc <== NOT EXECUTED 200845c: 90 12 21 d8 or %o0, 0x1d8, %o0 ! 2020dd8 <== NOT EXECUTED if (result != 0) { 2008460: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2008464: 22 bf ff df be,a 20083e0 <== NOT EXECUTED 2008468: 82 17 21 d4 or %i4, 0x1d4, %g1 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 200846c: 40 00 02 3b call 2008d58 <== NOT EXECUTED 2008470: 90 17 21 d4 or %i4, 0x1d4, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2008474: 40 00 03 53 call 20091c0 <== NOT EXECUTED 2008478: 90 17 61 dc or %i5, 0x1dc, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 200847c: 10 bf ff d9 b 20083e0 <== NOT EXECUTED 2008480: 82 17 21 d4 or %i4, 0x1d4, %g1 <== NOT EXECUTED =============================================================================== 02008310 : 2008310: c2 02 00 00 ld [ %o0 ], %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2008314: 88 02 20 04 add %o0, 4, %g4 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2008318: 80 a0 40 04 cmp %g1, %g4 200831c: 02 80 00 15 be 2008370 <== NEVER TAKEN 2008320: 9a 10 00 09 mov %o1, %o5 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2008324: c6 02 60 14 ld [ %o1 + 0x14 ], %g3 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2008328: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 while (req->aiocbp->aio_reqprio > prio && 200832c: c6 00 e0 18 ld [ %g3 + 0x18 ], %g3 2008330: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 2008334: 80 a0 80 03 cmp %g2, %g3 2008338: 26 80 00 07 bl,a 2008354 <== NEVER TAKEN 200833c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2008340: 10 80 00 0b b 200836c 2008344: d0 00 60 04 ld [ %g1 + 4 ], %o0 2008348: 22 80 00 09 be,a 200836c <== NOT EXECUTED 200834c: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2008350: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2008354: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2008358: c4 00 a0 18 ld [ %g2 + 0x18 ], %g2 <== NOT EXECUTED 200835c: 80 a0 80 03 cmp %g2, %g3 <== NOT EXECUTED 2008360: 06 bf ff fa bl 2008348 <== NOT EXECUTED 2008364: 80 a1 00 01 cmp %g4, %g1 <== NOT EXECUTED 2008368: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED 200836c: 92 10 00 0d mov %o5, %o1 2008370: 82 13 c0 00 mov %o7, %g1 2008374: 40 00 0a 2c call 200ac24 <_Chain_Insert> 2008378: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02008558 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2008558: 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; 200855c: fa 06 20 08 ld [ %i0 + 8 ], %i5 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( const Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Immutable_tail( the_chain )); 2008560: 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)) 2008564: 80 a7 40 18 cmp %i5, %i0 2008568: 02 80 00 0e be 20085a0 <== NEVER TAKEN 200856c: b6 10 20 8c mov 0x8c, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2008570: 40 00 09 94 call 200abc0 <_Chain_Extract> 2008574: 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; 2008578: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 200857c: f8 07 40 00 ld [ %i5 ], %i4 req->aiocbp->return_value = -1; 2008580: 84 10 3f ff mov -1, %g2 free (req); 2008584: 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; 2008588: f6 20 60 34 st %i3, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 200858c: 7f ff ee 25 call 2003e20 2008590: c4 20 60 38 st %g2, [ %g1 + 0x38 ] rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2008594: 80 a7 00 18 cmp %i4, %i0 2008598: 12 bf ff f6 bne 2008570 200859c: ba 10 00 1c mov %i4, %i5 20085a0: 81 c7 e0 08 ret 20085a4: 81 e8 00 00 restore =============================================================================== 020085a8 : * 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) { 20085a8: 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; 20085ac: 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 ); 20085b0: 84 06 20 04 add %i0, 4, %g2 if (rtems_chain_is_empty (chain)) 20085b4: 80 a7 40 02 cmp %i5, %g2 20085b8: 12 80 00 06 bne 20085d0 20085bc: b0 10 20 02 mov 2, %i0 20085c0: 30 80 00 12 b,a 2008608 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) { 20085c4: 80 a0 80 1d cmp %g2, %i5 <== NOT EXECUTED 20085c8: 02 80 00 12 be 2008610 <== NOT EXECUTED 20085cc: 01 00 00 00 nop <== NOT EXECUTED 20085d0: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20085d4: 80 a0 40 19 cmp %g1, %i1 20085d8: 32 bf ff fb bne,a 20085c4 <== NEVER TAKEN 20085dc: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 20085e0: 40 00 09 78 call 200abc0 <_Chain_Extract> 20085e4: 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; 20085e8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 current->aiocbp->return_value = -1; 20085ec: 84 10 3f ff mov -1, %g2 20085f0: c4 20 60 38 st %g2, [ %g1 + 0x38 ] if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; 20085f4: 84 10 20 8c mov 0x8c, %g2 current->aiocbp->return_value = -1; free (current); 20085f8: 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; 20085fc: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; free (current); 2008600: 7f ff ee 08 call 2003e20 2008604: b0 10 20 00 clr %i0 } return AIO_CANCELED; } 2008608: 81 c7 e0 08 ret 200860c: 81 e8 00 00 restore node = rtems_chain_next (node); current = (rtems_aio_request *) node; } if (rtems_chain_is_tail (chain, node)) return AIO_NOTCANCELED; 2008610: 81 c7 e0 08 ret <== NOT EXECUTED 2008614: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 02008a0c : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2008a0c: 9d e3 bf 98 save %sp, -104, %sp */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2008a10: 40 00 01 aa call 20090b8 <_Chain_Get> 2008a14: 90 10 00 18 mov %i0, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2008a18: 92 10 20 00 clr %o1 2008a1c: ba 10 00 08 mov %o0, %i5 2008a20: 94 10 00 1a mov %i2, %o2 2008a24: 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 2008a28: 80 a7 60 00 cmp %i5, 0 2008a2c: 12 80 00 0a bne 2008a54 2008a30: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2008a34: 7f ff fc e9 call 2007dd8 2008a38: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2008a3c: 80 a2 20 00 cmp %o0, 0 2008a40: 02 bf ff f4 be 2008a10 <== NEVER TAKEN 2008a44: 01 00 00 00 nop timeout, &out ); } *node_ptr = node; 2008a48: fa 26 c0 00 st %i5, [ %i3 ] return sc; } 2008a4c: 81 c7 e0 08 ret 2008a50: 91 e8 00 08 restore %g0, %o0, %o0 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2008a54: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2008a58: fa 26 c0 00 st %i5, [ %i3 ] return sc; } 2008a5c: 81 c7 e0 08 ret 2008a60: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009994 : 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 ) { 2009994: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2009998: 03 00 80 8c sethi %hi(0x2023000), %g1 200999c: c4 00 63 a8 ld [ %g1 + 0x3a8 ], %g2 ! 20233a8 <_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 ) { 20099a0: ba 10 00 18 mov %i0, %i5 rtems_device_major_number major_limit = _IO_Number_of_drivers; 20099a4: 03 00 80 8d sethi %hi(0x2023400), %g1 rtems_status_code rtems_io_register_driver( rtems_device_major_number major, const rtems_driver_address_table *driver_table, rtems_device_major_number *registered_major ) { 20099a8: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 20099ac: c8 00 63 e4 ld [ %g1 + 0x3e4 ], %g4 if ( rtems_interrupt_is_in_progress() ) 20099b0: 80 a0 a0 00 cmp %g2, 0 20099b4: 12 80 00 20 bne 2009a34 20099b8: b0 10 20 12 mov 0x12, %i0 return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 20099bc: 80 a6 a0 00 cmp %i2, 0 20099c0: 02 80 00 22 be 2009a48 20099c4: 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 ) 20099c8: 02 80 00 20 be 2009a48 20099cc: c8 26 80 00 st %g4, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 20099d0: c4 06 40 00 ld [ %i1 ], %g2 20099d4: 80 a0 a0 00 cmp %g2, 0 20099d8: 22 80 00 19 be,a 2009a3c 20099dc: 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 ) 20099e0: 80 a1 00 1d cmp %g4, %i5 20099e4: 08 80 00 14 bleu 2009a34 20099e8: b0 10 20 0a mov 0xa, %i0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20099ec: 05 00 80 8b sethi %hi(0x2022c00), %g2 20099f0: c8 00 a2 70 ld [ %g2 + 0x270 ], %g4 ! 2022e70 <_Thread_Dispatch_disable_level> 20099f4: 88 01 20 01 inc %g4 20099f8: c8 20 a2 70 st %g4, [ %g2 + 0x270 ] return _Thread_Dispatch_disable_level; 20099fc: c4 00 a2 70 ld [ %g2 + 0x270 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 2009a00: 80 a7 60 00 cmp %i5, 0 2009a04: 02 80 00 13 be 2009a50 2009a08: 39 00 80 8d sethi %hi(0x2023400), %i4 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 2009a0c: c8 07 23 e8 ld [ %i4 + 0x3e8 ], %g4 ! 20237e8 <_IO_Driver_address_table> 2009a10: 85 2f 60 03 sll %i5, 3, %g2 2009a14: b7 2f 60 05 sll %i5, 5, %i3 2009a18: 82 26 c0 02 sub %i3, %g2, %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2009a1c: f2 01 00 01 ld [ %g4 + %g1 ], %i1 2009a20: 80 a6 60 00 cmp %i1, 0 2009a24: 02 80 00 3a be 2009b0c 2009a28: 82 01 00 01 add %g4, %g1, %g1 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 2009a2c: 40 00 08 6a call 200bbd4 <_Thread_Enable_dispatch> 2009a30: b0 10 20 0c mov 0xc, %i0 return RTEMS_RESOURCE_IN_USE; 2009a34: 81 c7 e0 08 ret 2009a38: 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; 2009a3c: 80 a0 a0 00 cmp %g2, 0 2009a40: 12 bf ff e9 bne 20099e4 2009a44: 80 a1 00 1d cmp %g4, %i5 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 2009a48: 81 c7 e0 08 ret 2009a4c: 91 e8 20 09 restore %g0, 9, %o0 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 2009a50: c8 00 63 e4 ld [ %g1 + 0x3e4 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 2009a54: 80 a1 20 00 cmp %g4, 0 2009a58: 02 80 00 33 be 2009b24 <== NEVER TAKEN 2009a5c: c2 07 23 e8 ld [ %i4 + 0x3e8 ], %g1 2009a60: 30 80 00 04 b,a 2009a70 2009a64: 80 a7 40 04 cmp %i5, %g4 2009a68: 02 80 00 24 be 2009af8 2009a6c: 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; 2009a70: c4 00 40 00 ld [ %g1 ], %g2 2009a74: 80 a0 a0 00 cmp %g2, 0 2009a78: 32 bf ff fb bne,a 2009a64 2009a7c: ba 07 60 01 inc %i5 2009a80: c4 00 60 04 ld [ %g1 + 4 ], %g2 2009a84: 80 a0 a0 00 cmp %g2, 0 2009a88: 32 bf ff f7 bne,a 2009a64 2009a8c: ba 07 60 01 inc %i5 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009a90: fa 26 80 00 st %i5, [ %i2 ] 2009a94: 85 2f 60 03 sll %i5, 3, %g2 if ( m != n ) 2009a98: 80 a1 00 1d cmp %g4, %i5 2009a9c: 02 80 00 18 be 2009afc <== NEVER TAKEN 2009aa0: b7 2f 60 05 sll %i5, 5, %i3 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009aa4: c8 00 c0 00 ld [ %g3 ], %g4 2009aa8: c2 07 23 e8 ld [ %i4 + 0x3e8 ], %g1 2009aac: 84 26 c0 02 sub %i3, %g2, %g2 2009ab0: c8 20 40 02 st %g4, [ %g1 + %g2 ] 2009ab4: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2009ab8: 82 00 40 02 add %g1, %g2, %g1 2009abc: c8 20 60 04 st %g4, [ %g1 + 4 ] 2009ac0: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2009ac4: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009ac8: c4 20 60 08 st %g2, [ %g1 + 8 ] 2009acc: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2009ad0: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009ad4: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2009ad8: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2009adc: b0 10 00 1d mov %i5, %i0 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009ae0: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2009ae4: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2009ae8: 40 00 08 3b call 200bbd4 <_Thread_Enable_dispatch> 2009aec: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2009af0: 40 00 22 7a call 20124d8 2009af4: 81 e8 00 00 restore if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009af8: fa 26 80 00 st %i5, [ %i2 ] if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2009afc: 40 00 08 36 call 200bbd4 <_Thread_Enable_dispatch> 2009b00: b0 10 20 05 mov 5, %i0 return sc; 2009b04: 81 c7 e0 08 ret 2009b08: 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; 2009b0c: c2 00 60 04 ld [ %g1 + 4 ], %g1 2009b10: 80 a0 60 00 cmp %g1, 0 2009b14: 12 bf ff c6 bne 2009a2c 2009b18: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2009b1c: 10 bf ff e2 b 2009aa4 2009b20: fa 26 80 00 st %i5, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009b24: 10 bf ff f6 b 2009afc <== NOT EXECUTED 2009b28: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 0200ab98 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 200ab98: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200ab9c: 80 a6 20 00 cmp %i0, 0 200aba0: 02 80 00 20 be 200ac20 <== NEVER TAKEN 200aba4: 37 00 80 84 sethi %hi(0x2021000), %i3 200aba8: b6 16 e2 a8 or %i3, 0x2a8, %i3 ! 20212a8 <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200abac: 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 ]; 200abb0: c2 06 c0 00 ld [ %i3 ], %g1 200abb4: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 200abb8: 80 a7 20 00 cmp %i4, 0 200abbc: 22 80 00 16 be,a 200ac14 200abc0: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200abc4: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 200abc8: 86 90 60 00 orcc %g1, 0, %g3 200abcc: 22 80 00 12 be,a 200ac14 200abd0: b6 06 e0 04 add %i3, 4, %i3 200abd4: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 200abd8: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 200abdc: 83 2f 60 02 sll %i5, 2, %g1 200abe0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_thread ) 200abe4: 90 90 60 00 orcc %g1, 0, %o0 200abe8: 02 80 00 05 be 200abfc 200abec: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 200abf0: 9f c6 00 00 call %i0 200abf4: 01 00 00 00 nop 200abf8: c6 17 20 10 lduh [ %i4 + 0x10 ], %g3 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200abfc: 83 28 e0 10 sll %g3, 0x10, %g1 200ac00: 83 30 60 10 srl %g1, 0x10, %g1 200ac04: 80 a0 40 1d cmp %g1, %i5 200ac08: 3a bf ff f5 bcc,a 200abdc 200ac0c: c4 07 20 1c ld [ %i4 + 0x1c ], %g2 200ac10: 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++ ) { 200ac14: 80 a6 c0 1a cmp %i3, %i2 200ac18: 32 bf ff e7 bne,a 200abb4 200ac1c: c2 06 c0 00 ld [ %i3 ], %g1 200ac20: 81 c7 e0 08 ret 200ac24: 81 e8 00 00 restore =============================================================================== 020097bc : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 20097bc: 9d e3 bf a0 save %sp, -96, %sp int i; /* * Validate parameters and look up information structure. */ if ( !info ) 20097c0: 80 a6 a0 00 cmp %i2, 0 20097c4: 02 80 00 21 be 2009848 20097c8: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 20097cc: 93 2e 60 10 sll %i1, 0x10, %o1 20097d0: 90 10 00 18 mov %i0, %o0 20097d4: 40 00 07 a7 call 200b670 <_Objects_Get_information> 20097d8: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 20097dc: 80 a2 20 00 cmp %o0, 0 20097e0: 02 80 00 1a be 2009848 20097e4: 82 10 20 0a mov 0xa, %g1 * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 20097e8: 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; 20097ec: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; 20097f0: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; 20097f4: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 20097f8: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; 20097fc: c4 26 a0 04 st %g2, [ %i2 + 4 ] info->auto_extend = obj_info->auto_extend; 2009800: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2009804: 80 a1 20 00 cmp %g4, 0 2009808: 02 80 00 12 be 2009850 <== NEVER TAKEN 200980c: c8 26 a0 08 st %g4, [ %i2 + 8 ] 2009810: fa 02 20 1c ld [ %o0 + 0x1c ], %i5 2009814: 86 10 20 01 mov 1, %g3 2009818: 82 10 20 01 mov 1, %g1 200981c: 84 10 20 00 clr %g2 if ( !obj_info->local_table[i] ) 2009820: 87 28 e0 02 sll %g3, 2, %g3 2009824: c6 07 40 03 ld [ %i5 + %g3 ], %g3 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2009828: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 200982c: 80 a0 00 03 cmp %g0, %g3 2009830: 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++ ) 2009834: 80 a1 00 01 cmp %g4, %g1 2009838: 1a bf ff fa bcc 2009820 200983c: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 2009840: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 2009844: 82 10 20 00 clr %g1 } 2009848: 81 c7 e0 08 ret 200984c: 91 e8 00 01 restore %g0, %g1, %o0 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2009850: 84 10 20 00 clr %g2 <== NOT EXECUTED if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; return RTEMS_SUCCESSFUL; 2009854: 82 10 20 00 clr %g1 <== NOT EXECUTED for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 2009858: 10 bf ff fc b 2009848 <== NOT EXECUTED 200985c: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] <== NOT EXECUTED =============================================================================== 0200927c : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 200927c: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2009280: 80 a6 20 00 cmp %i0, 0 2009284: 12 80 00 04 bne 2009294 2009288: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 200928c: 81 c7 e0 08 ret 2009290: 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 ) 2009294: 80 a6 60 00 cmp %i1, 0 2009298: 02 bf ff fd be 200928c 200929c: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 20092a0: 80 a7 60 00 cmp %i5, 0 20092a4: 02 bf ff fa be 200928c <== NEVER TAKEN 20092a8: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 20092ac: 02 bf ff f8 be 200928c 20092b0: 82 10 20 08 mov 8, %g1 20092b4: 80 a6 a0 00 cmp %i2, 0 20092b8: 02 bf ff f5 be 200928c 20092bc: 80 a6 80 1b cmp %i2, %i3 20092c0: 0a bf ff f3 bcs 200928c 20092c4: 80 8e e0 07 btst 7, %i3 20092c8: 12 bf ff f1 bne 200928c 20092cc: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 20092d0: 12 bf ff ef bne 200928c 20092d4: 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++; 20092d8: 03 00 80 8c sethi %hi(0x2023000), %g1 20092dc: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> 20092e0: 84 00 a0 01 inc %g2 20092e4: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 20092e8: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %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 ); 20092ec: 23 00 80 8c sethi %hi(0x2023000), %l1 20092f0: 40 00 07 58 call 200b050 <_Objects_Allocate> 20092f4: 90 14 61 bc or %l1, 0x1bc, %o0 ! 20231bc <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 20092f8: a0 92 20 00 orcc %o0, 0, %l0 20092fc: 02 80 00 1a be 2009364 2009300: 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; 2009304: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2009308: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 200930c: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2009310: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2009314: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2009318: 40 00 48 a9 call 201b5bc <.udiv> 200931c: 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, 2009320: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2009324: 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, 2009328: 96 10 00 1b mov %i3, %o3 200932c: b8 04 20 24 add %l0, 0x24, %i4 2009330: 40 00 04 8d call 200a564 <_Chain_Initialize> 2009334: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009338: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200933c: a2 14 61 bc or %l1, 0x1bc, %l1 2009340: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009344: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009348: 85 28 a0 02 sll %g2, 2, %g2 200934c: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2009350: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2009354: 40 00 0c a7 call 200c5f0 <_Thread_Enable_dispatch> 2009358: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 200935c: 10 bf ff cc b 200928c 2009360: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 2009364: 40 00 0c a3 call 200c5f0 <_Thread_Enable_dispatch> 2009368: 01 00 00 00 nop return RTEMS_TOO_MANY; 200936c: 10 bf ff c8 b 200928c 2009370: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 02015980 : rtems_status_code rtems_partition_return_buffer( rtems_id id, void *buffer ) { 2015980: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Partition_Control *_Partition_Get ( Objects_Id id, Objects_Locations *location ) { return (Partition_Control *) 2015984: 11 00 80 f2 sethi %hi(0x203c800), %o0 2015988: 92 10 00 18 mov %i0, %o1 201598c: 90 12 23 44 or %o0, 0x344, %o0 2015990: 40 00 15 13 call 201addc <_Objects_Get> 2015994: 94 07 bf fc add %fp, -4, %o2 register Partition_Control *the_partition; Objects_Locations location; the_partition = _Partition_Get( id, &location ); switch ( location ) { 2015998: c2 07 bf fc ld [ %fp + -4 ], %g1 201599c: 80 a0 60 00 cmp %g1, 0 20159a0: 12 80 00 19 bne 2015a04 20159a4: ba 10 00 08 mov %o0, %i5 ) { void *starting; void *ending; starting = the_partition->starting_address; 20159a8: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 20159ac: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20159b0: 82 02 00 01 add %o0, %g1, %g1 ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 20159b4: 80 a6 40 01 cmp %i1, %g1 20159b8: 18 80 00 15 bgu 2015a0c <== NEVER TAKEN 20159bc: 80 a6 40 08 cmp %i1, %o0 20159c0: 0a 80 00 13 bcs 2015a0c 20159c4: 01 00 00 00 nop offset = (uint32_t) _Addresses_Subtract( the_buffer, the_partition->starting_address ); return ((offset % the_partition->buffer_size) == 0); 20159c8: d2 07 60 18 ld [ %i5 + 0x18 ], %o1 20159cc: 40 00 5b 10 call 202c60c <.urem> 20159d0: 90 26 40 08 sub %i1, %o0, %o0 starting = the_partition->starting_address; ending = _Addresses_Add_offset( starting, the_partition->length ); return ( _Addresses_Is_in_range( the_buffer, starting, ending ) && 20159d4: 80 a2 20 00 cmp %o0, 0 20159d8: 12 80 00 0d bne 2015a0c 20159dc: 90 07 60 24 add %i5, 0x24, %o0 RTEMS_INLINE_ROUTINE void _Partition_Free_buffer ( Partition_Control *the_partition, Chain_Node *the_buffer ) { _Chain_Append( &the_partition->Memory, the_buffer ); 20159e0: 40 00 0c fa call 2018dc8 <_Chain_Append> 20159e4: 92 10 00 19 mov %i1, %o1 case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 20159e8: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 20159ec: b0 10 20 00 clr %i0 switch ( location ) { case OBJECTS_LOCAL: if ( _Partition_Is_buffer_valid( buffer, the_partition ) ) { _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; 20159f0: 82 00 7f ff add %g1, -1, %g1 _Thread_Enable_dispatch(); 20159f4: 40 00 19 04 call 201be04 <_Thread_Enable_dispatch> 20159f8: c2 27 60 20 st %g1, [ %i5 + 0x20 ] 20159fc: 81 c7 e0 08 ret 2015a00: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2015a04: 81 c7 e0 08 ret 2015a08: 91 e8 20 04 restore %g0, 4, %o0 _Partition_Free_buffer( the_partition, buffer ); the_partition->number_of_used_blocks -= 1; _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } _Thread_Enable_dispatch(); 2015a0c: 40 00 18 fe call 201be04 <_Thread_Enable_dispatch> 2015a10: b0 10 20 09 mov 9, %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2015a14: 81 c7 e0 08 ret 2015a18: 81 e8 00 00 restore =============================================================================== 02037fe8 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2037fe8: 9d e3 bf 98 save %sp, -104, %sp 2037fec: 11 00 81 9f sethi %hi(0x2067c00), %o0 2037ff0: 92 10 00 18 mov %i0, %o1 2037ff4: 90 12 20 d0 or %o0, 0xd0, %o0 2037ff8: 7f ff 45 9c call 2009668 <_Objects_Get> 2037ffc: 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 ) { 2038000: c2 07 bf fc ld [ %fp + -4 ], %g1 2038004: 80 a0 60 00 cmp %g1, 0 2038008: 12 80 00 0d bne 203803c 203800c: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2038010: 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 ); 2038014: 39 00 81 9d sethi %hi(0x2067400), %i4 2038018: b8 17 23 10 or %i4, 0x310, %i4 ! 2067710 <_Per_CPU_Information> 203801c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2038020: 80 a0 80 01 cmp %g2, %g1 2038024: 02 80 00 08 be 2038044 2038028: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 203802c: 7f ff 49 6d call 200a5e0 <_Thread_Enable_dispatch> 2038030: b0 10 20 17 mov 0x17, %i0 2038034: 81 c7 e0 08 ret 2038038: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 203803c: 81 c7 e0 08 ret 2038040: 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 ) { 2038044: 12 80 00 0e bne 203807c 2038048: 01 00 00 00 nop switch ( the_period->state ) { 203804c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2038050: 80 a0 60 04 cmp %g1, 4 2038054: 18 80 00 06 bgu 203806c <== NEVER TAKEN 2038058: b0 10 20 00 clr %i0 203805c: 83 28 60 02 sll %g1, 2, %g1 2038060: 05 00 81 83 sethi %hi(0x2060c00), %g2 2038064: 84 10 a1 e0 or %g2, 0x1e0, %g2 ! 2060de0 2038068: f0 00 80 01 ld [ %g2 + %g1 ], %i0 id, NULL ); _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 203806c: 7f ff 49 5d call 200a5e0 <_Thread_Enable_dispatch> 2038070: 01 00 00 00 nop 2038074: 81 c7 e0 08 ret 2038078: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 203807c: 7f ff 29 2e call 2002534 2038080: 01 00 00 00 nop 2038084: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2038088: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 203808c: 80 a6 e0 00 cmp %i3, 0 2038090: 02 80 00 1c be 2038100 2038094: 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 ) { 2038098: 02 80 00 2e be 2038150 203809c: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 20380a0: 12 bf ff e5 bne 2038034 <== NEVER TAKEN 20380a4: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 20380a8: 7f ff ff 60 call 2037e28 <_Rate_monotonic_Update_statistics> 20380ac: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 20380b0: 7f ff 29 25 call 2002544 20380b4: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20380b8: 82 10 20 02 mov 2, %g1 20380bc: 92 07 60 10 add %i5, 0x10, %o1 20380c0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 20380c4: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20380c8: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20380cc: 11 00 81 9c sethi %hi(0x2067000), %o0 20380d0: 7f ff 4c c6 call 200b3e8 <_Watchdog_Insert> 20380d4: 90 12 22 88 or %o0, 0x288, %o0 ! 2067288 <_Watchdog_Ticks_chain> 20380d8: d0 07 60 40 ld [ %i5 + 0x40 ], %o0 20380dc: d2 07 60 3c ld [ %i5 + 0x3c ], %o1 20380e0: 03 00 81 8b sethi %hi(0x2062c00), %g1 20380e4: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 ! 2062dc0 <_Scheduler+0x34> 20380e8: 9f c0 40 00 call %g1 20380ec: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Scheduler_Release_job(the_period->owner, the_period->next_length); _Thread_Enable_dispatch(); 20380f0: 7f ff 49 3c call 200a5e0 <_Thread_Enable_dispatch> 20380f4: 01 00 00 00 nop 20380f8: 81 c7 e0 08 ret 20380fc: 81 e8 00 00 restore return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 2038100: 7f ff 29 11 call 2002544 2038104: 01 00 00 00 nop the_period->next_length = length; /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 2038108: 90 10 00 1d mov %i5, %o0 203810c: 7f ff ff 96 call 2037f64 <_Rate_monotonic_Initiate_statistics> 2038110: f2 27 60 3c st %i1, [ %i5 + 0x3c ] the_period->state = RATE_MONOTONIC_ACTIVE; 2038114: 82 10 20 02 mov 2, %g1 2038118: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 203811c: 03 00 80 e0 sethi %hi(0x2038000), %g1 2038120: 82 10 61 c4 or %g1, 0x1c4, %g1 ! 20381c4 <_Rate_monotonic_Timeout> the_watchdog->id = id; 2038124: f0 27 60 30 st %i0, [ %i5 + 0x30 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038128: 92 07 60 10 add %i5, 0x10, %o1 203812c: 11 00 81 9c sethi %hi(0x2067000), %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2038130: c0 27 60 18 clr [ %i5 + 0x18 ] ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038134: 90 12 22 88 or %o0, 0x288, %o0 ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 2038138: c0 27 60 34 clr [ %i5 + 0x34 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 203813c: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2038140: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2038144: 7f ff 4c a9 call 200b3e8 <_Watchdog_Insert> 2038148: b0 10 20 00 clr %i0 203814c: 30 bf ff c8 b,a 203806c if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2038150: 7f ff ff 36 call 2037e28 <_Rate_monotonic_Update_statistics> 2038154: 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; 2038158: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 203815c: 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; 2038160: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2038164: 7f ff 28 f8 call 2002544 2038168: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 203816c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2038170: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2038174: 90 10 00 01 mov %g1, %o0 2038178: 13 00 00 10 sethi %hi(0x4000), %o1 203817c: 7f ff 4b 79 call 200af60 <_Thread_Set_state> 2038180: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2038184: 7f ff 28 ec call 2002534 2038188: 01 00 00 00 nop local_state = the_period->state; 203818c: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 2038190: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2038194: 7f ff 28 ec call 2002544 2038198: 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 ) 203819c: 80 a6 a0 03 cmp %i2, 3 20381a0: 22 80 00 06 be,a 20381b8 20381a4: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 20381a8: 7f ff 49 0e call 200a5e0 <_Thread_Enable_dispatch> 20381ac: b0 10 20 00 clr %i0 20381b0: 81 c7 e0 08 ret 20381b4: 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 ); 20381b8: 7f ff 48 17 call 200a214 <_Thread_Clear_state> 20381bc: 13 00 00 10 sethi %hi(0x4000), %o1 20381c0: 30 bf ff fa b,a 20381a8 =============================================================================== 02029b28 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2029b28: 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 ) 2029b2c: 80 a6 60 00 cmp %i1, 0 2029b30: 02 80 00 48 be 2029c50 <== NEVER TAKEN 2029b34: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 2029b38: 13 00 81 78 sethi %hi(0x205e000), %o1 2029b3c: 9f c6 40 00 call %i1 2029b40: 92 12 60 c0 or %o1, 0xc0, %o1 ! 205e0c0 <_TOD_Days_per_month+0x68> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2029b44: 90 10 00 18 mov %i0, %o0 2029b48: 13 00 81 78 sethi %hi(0x205e000), %o1 2029b4c: 9f c6 40 00 call %i1 2029b50: 92 12 60 e0 or %o1, 0xe0, %o1 ! 205e0e0 <_TOD_Days_per_month+0x88> (*print)( context, "--- Wall times are in seconds ---\n" ); 2029b54: 90 10 00 18 mov %i0, %o0 2029b58: 13 00 81 78 sethi %hi(0x205e000), %o1 2029b5c: 9f c6 40 00 call %i1 2029b60: 92 12 61 08 or %o1, 0x108, %o1 ! 205e108 <_TOD_Days_per_month+0xb0> Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2029b64: 90 10 00 18 mov %i0, %o0 2029b68: 13 00 81 78 sethi %hi(0x205e000), %o1 2029b6c: 9f c6 40 00 call %i1 2029b70: 92 12 61 30 or %o1, 0x130, %o1 ! 205e130 <_TOD_Days_per_month+0xd8> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 2029b74: 90 10 00 18 mov %i0, %o0 2029b78: 13 00 81 78 sethi %hi(0x205e000), %o1 2029b7c: 9f c6 40 00 call %i1 2029b80: 92 12 61 80 or %o1, 0x180, %o1 ! 205e180 <_TOD_Days_per_month+0x128> /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2029b84: 39 00 81 9f sethi %hi(0x2067c00), %i4 2029b88: b8 17 20 d0 or %i4, 0xd0, %i4 ! 2067cd0 <_Rate_monotonic_Information> 2029b8c: fa 07 20 08 ld [ %i4 + 8 ], %i5 2029b90: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2029b94: 80 a7 40 01 cmp %i5, %g1 2029b98: 18 80 00 2e bgu 2029c50 <== NEVER TAKEN 2029b9c: 35 00 81 78 sethi %hi(0x205e000), %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, 2029ba0: 27 00 81 78 sethi %hi(0x205e000), %l3 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 2029ba4: 25 00 81 78 sethi %hi(0x205e000), %l2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2029ba8: 37 00 81 7d sethi %hi(0x205f400), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2029bac: b4 16 a1 d0 or %i2, 0x1d0, %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, 2029bb0: a6 14 e1 e8 or %l3, 0x1e8, %l3 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 2029bb4: a4 14 a2 08 or %l2, 0x208, %l2 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2029bb8: 10 80 00 06 b 2029bd0 2029bbc: b6 16 e2 90 or %i3, 0x290, %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++ ) { 2029bc0: 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 ; 2029bc4: 80 a0 40 1d cmp %g1, %i5 2029bc8: 0a 80 00 22 bcs 2029c50 2029bcc: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2029bd0: 90 10 00 1d mov %i5, %o0 2029bd4: 40 00 37 b3 call 2037aa0 2029bd8: 92 07 bf c8 add %fp, -56, %o1 if ( status != RTEMS_SUCCESSFUL ) 2029bdc: 80 a2 20 00 cmp %o0, 0 2029be0: 32 bf ff f8 bne,a 2029bc0 2029be4: 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 ); 2029be8: 92 07 bf b0 add %fp, -80, %o1 2029bec: 40 00 38 1f call 2037c68 2029bf0: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2029bf4: d0 07 bf b0 ld [ %fp + -80 ], %o0 2029bf8: 94 07 bf a0 add %fp, -96, %o2 2029bfc: 7f ff 98 ed call 200ffb0 2029c00: 92 10 20 05 mov 5, %o1 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2029c04: d8 1f bf c8 ldd [ %fp + -56 ], %o4 2029c08: 92 10 00 1a mov %i2, %o1 2029c0c: 94 10 00 1d mov %i5, %o2 2029c10: 90 10 00 18 mov %i0, %o0 2029c14: 9f c6 40 00 call %i1 2029c18: 96 07 bf a0 add %fp, -96, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2029c1c: c2 07 bf c8 ld [ %fp + -56 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 2029c20: 94 07 bf a8 add %fp, -88, %o2 2029c24: 90 07 bf e0 add %fp, -32, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2029c28: 80 a0 60 00 cmp %g1, 0 2029c2c: 12 80 00 0b bne 2029c58 2029c30: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 2029c34: 9f c6 40 00 call %i1 2029c38: 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 ; 2029c3c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2029c40: 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 ; 2029c44: 80 a0 40 1d cmp %g1, %i5 2029c48: 1a bf ff e3 bcc 2029bd4 <== ALWAYS TAKEN 2029c4c: 90 10 00 1d mov %i5, %o0 2029c50: 81 c7 e0 08 ret 2029c54: 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 ); 2029c58: 40 00 03 33 call 202a924 <_Timespec_Divide_by_integer> 2029c5c: 92 10 00 01 mov %g1, %o1 (*print)( context, 2029c60: d0 07 bf d4 ld [ %fp + -44 ], %o0 2029c64: 40 00 ac c6 call 2054f7c <.div> 2029c68: 92 10 23 e8 mov 0x3e8, %o1 2029c6c: aa 10 00 08 mov %o0, %l5 2029c70: d0 07 bf dc ld [ %fp + -36 ], %o0 2029c74: 40 00 ac c2 call 2054f7c <.div> 2029c78: 92 10 23 e8 mov 0x3e8, %o1 2029c7c: c2 07 bf a8 ld [ %fp + -88 ], %g1 2029c80: a2 10 00 08 mov %o0, %l1 2029c84: d0 07 bf ac ld [ %fp + -84 ], %o0 2029c88: e0 07 bf d0 ld [ %fp + -48 ], %l0 2029c8c: e8 07 bf d8 ld [ %fp + -40 ], %l4 2029c90: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2029c94: 40 00 ac ba call 2054f7c <.div> 2029c98: 92 10 23 e8 mov 0x3e8, %o1 2029c9c: 96 10 00 15 mov %l5, %o3 2029ca0: 98 10 00 14 mov %l4, %o4 2029ca4: 9a 10 00 11 mov %l1, %o5 2029ca8: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2029cac: 92 10 00 13 mov %l3, %o1 2029cb0: 94 10 00 10 mov %l0, %o2 2029cb4: 9f c6 40 00 call %i1 2029cb8: 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); 2029cbc: d2 07 bf c8 ld [ %fp + -56 ], %o1 2029cc0: 94 07 bf a8 add %fp, -88, %o2 2029cc4: 40 00 03 18 call 202a924 <_Timespec_Divide_by_integer> 2029cc8: 90 07 bf f8 add %fp, -8, %o0 (*print)( context, 2029ccc: d0 07 bf ec ld [ %fp + -20 ], %o0 2029cd0: 40 00 ac ab call 2054f7c <.div> 2029cd4: 92 10 23 e8 mov 0x3e8, %o1 2029cd8: a8 10 00 08 mov %o0, %l4 2029cdc: d0 07 bf f4 ld [ %fp + -12 ], %o0 2029ce0: 40 00 ac a7 call 2054f7c <.div> 2029ce4: 92 10 23 e8 mov 0x3e8, %o1 2029ce8: c2 07 bf a8 ld [ %fp + -88 ], %g1 2029cec: a0 10 00 08 mov %o0, %l0 2029cf0: d0 07 bf ac ld [ %fp + -84 ], %o0 2029cf4: ea 07 bf e8 ld [ %fp + -24 ], %l5 2029cf8: e2 07 bf f0 ld [ %fp + -16 ], %l1 2029cfc: 92 10 23 e8 mov 0x3e8, %o1 2029d00: 40 00 ac 9f call 2054f7c <.div> 2029d04: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2029d08: 92 10 00 12 mov %l2, %o1 2029d0c: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2029d10: 94 10 00 15 mov %l5, %o2 2029d14: 90 10 00 18 mov %i0, %o0 2029d18: 96 10 00 14 mov %l4, %o3 2029d1c: 98 10 00 11 mov %l1, %o4 2029d20: 9f c6 40 00 call %i1 2029d24: 9a 10 00 10 mov %l0, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2029d28: 10 bf ff a6 b 2029bc0 2029d2c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 02029d48 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 2029d48: 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++; 2029d4c: 03 00 81 9c sethi %hi(0x2067000), %g1 2029d50: c4 00 61 e0 ld [ %g1 + 0x1e0 ], %g2 ! 20671e0 <_Thread_Dispatch_disable_level> 2029d54: 84 00 a0 01 inc %g2 2029d58: c4 20 61 e0 st %g2, [ %g1 + 0x1e0 ] return _Thread_Dispatch_disable_level; 2029d5c: c2 00 61 e0 ld [ %g1 + 0x1e0 ], %g1 /* * Cycle through all possible ids and try to reset each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 2029d60: 39 00 81 9f sethi %hi(0x2067c00), %i4 2029d64: b8 17 20 d0 or %i4, 0xd0, %i4 ! 2067cd0 <_Rate_monotonic_Information> 2029d68: fa 07 20 08 ld [ %i4 + 8 ], %i5 2029d6c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2029d70: 80 a7 40 01 cmp %i5, %g1 2029d74: 18 80 00 09 bgu 2029d98 <== NEVER TAKEN 2029d78: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 2029d7c: 40 00 00 09 call 2029da0 2029d80: 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 ; 2029d84: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 2029d88: 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 ; 2029d8c: 80 a0 40 1d cmp %g1, %i5 2029d90: 1a bf ff fb bcc 2029d7c 2029d94: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 2029d98: 7f ff 82 12 call 200a5e0 <_Thread_Enable_dispatch> 2029d9c: 81 e8 00 00 restore =============================================================================== 02009024 : return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { 2009024: 9d e3 bf a0 save %sp, -96, %sp void *ptr = NULL; rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; 2009028: fa 06 20 30 ld [ %i0 + 0x30 ], %i5 #include static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 200902c: 90 10 00 19 mov %i1, %o0 2009030: 40 00 47 34 call 201ad00 <.urem> 2009034: 92 10 00 1d mov %i5, %o1 if (excess > 0) { 2009038: 80 a2 20 00 cmp %o0, 0 200903c: 02 80 00 26 be 20090d4 <== ALWAYS TAKEN 2009040: b6 10 00 19 mov %i1, %i3 value += alignment - excess; 2009044: ba 06 40 1d add %i1, %i5, %i5 <== NOT EXECUTED 2009048: b6 27 40 08 sub %i5, %o0, %i3 <== NOT EXECUTED 200904c: 80 a6 c0 19 cmp %i3, %i1 <== NOT EXECUTED 2009050: 82 60 3f ff subx %g0, -1, %g1 <== NOT EXECUTED rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; uintptr_t alignment = control->alignment; uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { 2009054: 80 88 60 ff btst 0xff, %g1 2009058: 02 80 00 1d be 20090cc <== NEVER TAKEN 200905c: 80 a6 60 00 cmp %i1, 0 2009060: 02 80 00 1b be 20090cc 2009064: 82 06 20 04 add %i0, 4, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009068: fa 06 00 00 ld [ %i0 ], %i5 { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_chunk *big_enough = NULL; while (current != tail && big_enough == NULL) { 200906c: 80 a7 40 01 cmp %i5, %g1 2009070: 02 80 00 17 be 20090cc 2009074: 01 00 00 00 nop rtems_rbheap_chunk *free_chunk = (rtems_rbheap_chunk *) current; if (free_chunk->size >= size) { 2009078: f8 07 60 1c ld [ %i5 + 0x1c ], %i4 200907c: 80 a6 c0 1c cmp %i3, %i4 2009080: 38 80 00 10 bgu,a 20090c0 2009084: fa 07 40 00 ld [ %i5 ], %i5 uintptr_t aligned_size = align_up(alignment, size); if (size > 0 && size <= aligned_size) { rtems_rbheap_chunk *free_chunk = search_free_chunk(free_chain, aligned_size); if (free_chunk != NULL) { 2009088: 80 a7 60 00 cmp %i5, 0 200908c: 02 80 00 10 be 20090cc <== NEVER TAKEN 2009090: 80 a7 00 1b cmp %i4, %i3 uintptr_t free_size = free_chunk->size; if (free_size > aligned_size) { 2009094: 18 80 00 12 bgu 20090dc 2009098: 01 00 00 00 nop ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200909c: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 20090a0: c2 07 60 04 ld [ %i5 + 4 ], %g1 ptr = (void *) new_chunk->begin; } } else { rtems_chain_extract_unprotected(&free_chunk->chain_node); rtems_chain_set_off_chain(&free_chunk->chain_node); ptr = (void *) free_chunk->begin; 20090a4: f0 07 60 18 ld [ %i5 + 0x18 ], %i0 next->previous = previous; 20090a8: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 20090ac: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain( Chain_Node *node ) { node->next = node->previous = NULL; 20090b0: c0 27 60 04 clr [ %i5 + 4 ] 20090b4: c0 27 40 00 clr [ %i5 ] } } } return ptr; } 20090b8: 81 c7 e0 08 ret 20090bc: 81 e8 00 00 restore { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_chunk *big_enough = NULL; while (current != tail && big_enough == NULL) { 20090c0: 80 a0 40 1d cmp %g1, %i5 20090c4: 32 bf ff ee bne,a 200907c <== NEVER TAKEN 20090c8: f8 07 60 1c ld [ %i5 + 0x1c ], %i4 <== NOT EXECUTED return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { void *ptr = NULL; 20090cc: 81 c7 e0 08 ret 20090d0: 91 e8 20 00 restore %g0, 0, %o0 static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; if (excess > 0) { 20090d4: 10 bf ff e0 b 2009054 20090d8: 82 10 20 01 mov 1, %g1 if (free_chunk != NULL) { uintptr_t free_size = free_chunk->size; if (free_size > aligned_size) { rtems_rbheap_chunk *new_chunk = get_chunk(control); 20090dc: 7f ff ff 46 call 2008df4 20090e0: 90 10 00 18 mov %i0, %o0 if (new_chunk != NULL) { 20090e4: b4 92 20 00 orcc %o0, 0, %i2 20090e8: 02 bf ff f9 be 20090cc <== NEVER TAKEN 20090ec: b8 27 00 1b sub %i4, %i3, %i4 uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 20090f0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 rtems_rbheap_chunk *new_chunk = get_chunk(control); if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; 20090f4: f8 27 60 1c st %i4, [ %i5 + 0x1c ] new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; 20090f8: f6 26 a0 1c st %i3, [ %i2 + 0x1c ] if (new_chunk != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; 20090fc: b8 07 00 01 add %i4, %g1, %i4 2009100: c0 26 a0 04 clr [ %i2 + 4 ] 2009104: f8 26 a0 18 st %i4, [ %i2 + 0x18 ] 2009108: c0 26 80 00 clr [ %i2 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_chunk *chunk ) { _RBTree_Insert_unprotected(tree, &chunk->tree_node); 200910c: 90 06 20 18 add %i0, 0x18, %o0 2009110: 40 00 07 0f call 200ad4c <_RBTree_Insert_unprotected> 2009114: 92 06 a0 08 add %i2, 8, %o1 free_chunk->size = new_free_size; new_chunk->begin = free_chunk->begin + new_free_size; new_chunk->size = aligned_size; rtems_chain_set_off_chain(&new_chunk->chain_node); insert_into_tree(chunk_tree, new_chunk); ptr = (void *) new_chunk->begin; 2009118: f0 06 a0 18 ld [ %i2 + 0x18 ], %i0 200911c: 81 c7 e0 08 ret 2009120: 81 e8 00 00 restore =============================================================================== 02009268 : /* Do nothing */ } void rtems_rbheap_extend_descriptors_with_malloc(rtems_rbheap_control *control) { 2009268: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED rtems_rbheap_chunk *chunk = malloc(sizeof(*chunk)); 200926c: 7f ff ec 75 call 2004440 <== NOT EXECUTED 2009270: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED if (chunk != NULL) { 2009274: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2009278: 02 80 00 07 be 2009294 <== NOT EXECUTED 200927c: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2009280: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED after_node->next = the_node; 2009284: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2009288: c4 22 20 04 st %g2, [ %o0 + 4 ] <== NOT EXECUTED before_node = after_node->next; after_node->next = the_node; the_node->next = before_node; 200928c: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED before_node->previous = the_node; 2009290: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED 2009294: 81 c7 e0 08 ret <== NOT EXECUTED 2009298: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02009124 : _RBTree_Extract_unprotected(chunk_tree, &b->tree_node); } } rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { 2009124: 9d e3 bf 80 save %sp, -128, %sp 2009128: b4 10 00 18 mov %i0, %i2 rtems_status_code sc = RTEMS_SUCCESSFUL; if (ptr != NULL) { 200912c: 80 a6 60 00 cmp %i1, 0 2009130: 02 80 00 2a be 20091d8 2009134: b0 10 20 00 clr %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 2009138: fa 06 a0 1c ld [ %i2 + 0x1c ], %i5 #define NULL_PAGE rtems_rbheap_chunk_of_node(NULL) static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key) { rtems_rbheap_chunk chunk = { .begin = key }; 200913c: c0 27 bf fc clr [ %fp + -4 ] 2009140: c0 27 bf e0 clr [ %fp + -32 ] 2009144: c0 27 bf e4 clr [ %fp + -28 ] 2009148: c0 27 bf e8 clr [ %fp + -24 ] 200914c: c0 27 bf ec clr [ %fp + -20 ] 2009150: c0 27 bf f0 clr [ %fp + -16 ] 2009154: c0 27 bf f4 clr [ %fp + -12 ] 2009158: f2 27 bf f8 st %i1, [ %fp + -8 ] RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200915c: 80 a7 60 00 cmp %i5, 0 2009160: 02 80 00 3e be 2009258 <== NEVER TAKEN 2009164: b8 06 a0 18 add %i2, 0x18, %i4 2009168: b6 10 20 00 clr %i3 compare_result = the_rbtree->compare_function(the_node, iter_node); 200916c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2009170: 92 10 00 1d mov %i5, %o1 2009174: 9f c0 40 00 call %g1 2009178: 90 07 bf e8 add %fp, -24, %o0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 200917c: 83 3a 20 1f sra %o0, 0x1f, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 2009180: 80 a2 20 00 cmp %o0, 0 RTEMS_INLINE_ROUTINE bool _RBTree_Is_greater( int compare_result ) { return compare_result > 0; 2009184: 82 20 40 08 sub %g1, %o0, %g1 2009188: 83 30 60 1f srl %g1, 0x1f, %g1 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200918c: 83 28 60 02 sll %g1, 2, %g1 RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); if ( _RBTree_Is_equal( compare_result ) ) { 2009190: 12 80 00 06 bne 20091a8 2009194: 82 07 40 01 add %i5, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 2009198: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200919c: 80 a0 a0 00 cmp %g2, 0 20091a0: 12 80 00 10 bne 20091e0 <== ALWAYS TAKEN 20091a4: b6 10 00 1d mov %i5, %i3 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 20091a8: fa 00 60 04 ld [ %g1 + 4 ], %i5 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 20091ac: 80 a7 60 00 cmp %i5, 0 20091b0: 32 bf ff f0 bne,a 2009170 20091b4: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return rtems_rbheap_chunk_of_node( 20091b8: ba 06 ff f8 add %i3, -8, %i5 if (ptr != NULL) { rtems_chain_control *free_chain = &control->free_chunk_chain; rtems_rbtree_control *chunk_tree = &control->chunk_tree; rtems_rbheap_chunk *chunk = find(chunk_tree, (uintptr_t) ptr); if (chunk != NULL_PAGE) { 20091bc: 80 a7 7f f8 cmp %i5, -8 20091c0: 02 80 00 06 be 20091d8 20091c4: b0 10 20 04 mov 4, %i0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 20091c8: c2 06 ff f8 ld [ %i3 + -8 ], %g1 20091cc: 80 a0 60 00 cmp %g1, 0 20091d0: 02 80 00 06 be 20091e8 20091d4: b0 10 20 0e mov 0xe, %i0 sc = RTEMS_INVALID_ID; } } return sc; } 20091d8: 81 c7 e0 08 ret 20091dc: 81 e8 00 00 restore static rtems_rbheap_chunk *find(rtems_rbtree_control *chunk_tree, uintptr_t key) { rtems_rbheap_chunk chunk = { .begin = key }; return rtems_rbheap_chunk_of_node( 20091e0: 10 bf ff f7 b 20091bc 20091e4: ba 06 ff f8 add %i3, -8, %i5 20091e8: c2 06 ff fc ld [ %i3 + -4 ], %g1 20091ec: 80 a0 60 00 cmp %g1, 0 20091f0: 12 bf ff fa bne 20091d8 <== NEVER TAKEN 20091f4: 92 10 20 00 clr %o1 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 20091f8: 40 00 07 a4 call 200b088 <_RBTree_Next_unprotected> 20091fc: 90 10 00 1b mov %i3, %o0 2009200: 92 10 20 01 mov 1, %o1 2009204: b2 10 00 08 mov %o0, %i1 2009208: 40 00 07 a0 call 200b088 <_RBTree_Next_unprotected> 200920c: 90 10 00 1b mov %i3, %o0 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 2009210: 92 10 00 1c mov %i4, %o1 static rtems_rbheap_chunk *get_next( const rtems_rbheap_chunk *chunk, RBTree_Direction dir ) { return rtems_rbheap_chunk_of_node( 2009214: 96 02 3f f8 add %o0, -8, %o3 if (chunk != NULL_PAGE) { if (!rtems_rbheap_is_chunk_free(chunk)) { rtems_rbheap_chunk *pred = get_next(chunk, RBT_LEFT); rtems_rbheap_chunk *succ = get_next(chunk, RBT_RIGHT); check_and_merge(free_chain, chunk_tree, chunk, succ); 2009218: 94 10 00 1d mov %i5, %o2 200921c: 7f ff ff 10 call 2008e5c 2009220: 90 10 00 1a mov %i2, %o0 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2009224: c2 06 80 00 ld [ %i2 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2009228: f4 26 ff fc st %i2, [ %i3 + -4 ] before_node = after_node->next; after_node->next = the_node; 200922c: fa 26 80 00 st %i5, [ %i2 ] the_node->next = before_node; 2009230: c2 26 ff f8 st %g1, [ %i3 + -8 ] before_node->previous = the_node; 2009234: fa 20 60 04 st %i5, [ %g1 + 4 ] add_to_chain(free_chain, chunk); check_and_merge(free_chain, chunk_tree, chunk, pred); 2009238: 90 10 00 1a mov %i2, %o0 200923c: 92 10 00 1c mov %i4, %o1 2009240: 94 10 00 1d mov %i5, %o2 2009244: 96 06 7f f8 add %i1, -8, %o3 2009248: 7f ff ff 05 call 2008e5c 200924c: b0 10 20 00 clr %i0 2009250: 81 c7 e0 08 ret 2009254: 81 e8 00 00 restore sc = RTEMS_INVALID_ID; } } return sc; } 2009258: 81 c7 e0 08 ret <== NOT EXECUTED 200925c: 91 e8 20 04 restore %g0, 4, %o0 <== NOT EXECUTED =============================================================================== 02008ef4 : uintptr_t area_size, uintptr_t alignment, rtems_rbheap_extend_descriptors extend_descriptors, void *handler_arg ) { 2008ef4: 9d e3 bf a0 save %sp, -96, %sp rtems_status_code sc = RTEMS_SUCCESSFUL; if (alignment > 0) { 2008ef8: 80 a6 e0 00 cmp %i3, 0 2008efc: 12 80 00 04 bne 2008f0c 2008f00: 82 10 20 0a mov 0xa, %g1 } else { sc = RTEMS_INVALID_NUMBER; } return sc; } 2008f04: 81 c7 e0 08 ret 2008f08: 91 e8 00 01 restore %g0, %g1, %o0 #include static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 2008f0c: 90 10 00 19 mov %i1, %o0 2008f10: 92 10 00 1b mov %i3, %o1 2008f14: 40 00 47 7b call 201ad00 <.urem> 2008f18: b4 06 40 1a add %i1, %i2, %i2 if (excess > 0) { 2008f1c: 80 a2 20 00 cmp %o0, 0 2008f20: 32 80 00 09 bne,a 2008f44 2008f24: a0 06 40 1b add %i1, %i3, %l0 2008f28: 82 10 20 01 mov 1, %g1 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 2008f2c: 80 88 60 ff btst 0xff, %g1 2008f30: 12 80 00 0b bne 2008f5c <== ALWAYS TAKEN 2008f34: a0 10 00 19 mov %i1, %l0 insert_into_tree(chunk_tree, first); } else { sc = RTEMS_NO_MEMORY; } } else { sc = RTEMS_INVALID_ADDRESS; 2008f38: 82 10 20 09 mov 9, %g1 <== NOT EXECUTED } else { sc = RTEMS_INVALID_NUMBER; } return sc; } 2008f3c: 81 c7 e0 08 ret 2008f40: 91 e8 00 01 restore %g0, %g1, %o0 static uintptr_t align_up(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; if (excess > 0) { value += alignment - excess; 2008f44: a0 24 00 08 sub %l0, %o0, %l0 2008f48: 80 a4 00 19 cmp %l0, %i1 2008f4c: 82 60 3f ff subx %g0, -1, %g1 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 2008f50: 80 88 60 ff btst 0xff, %g1 2008f54: 02 bf ff fa be 2008f3c 2008f58: 82 10 20 09 mov 9, %g1 2008f5c: 80 a6 40 1a cmp %i1, %i2 2008f60: 1a bf ff f7 bcc 2008f3c 2008f64: 82 10 20 09 mov 9, %g1 return value; } static uintptr_t align_down(uintptr_t alignment, uintptr_t value) { uintptr_t excess = value % alignment; 2008f68: 90 10 00 1a mov %i2, %o0 2008f6c: 40 00 47 65 call 201ad00 <.urem> 2008f70: 92 10 00 1b mov %i3, %o1 return value - excess; 2008f74: b4 26 80 08 sub %i2, %o0, %i2 uintptr_t begin = (uintptr_t) area_begin; uintptr_t end = begin + area_size; uintptr_t aligned_begin = align_up(alignment, begin); uintptr_t aligned_end = align_down(alignment, end); if (begin < end && begin <= aligned_begin && aligned_begin < aligned_end) { 2008f78: 80 a4 00 1a cmp %l0, %i2 2008f7c: 1a bf ff e2 bcc 2008f04 2008f80: 82 10 20 09 mov 9, %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2008f84: 82 06 20 04 add %i0, 4, %g1 head->next = tail; 2008f88: c2 26 00 00 st %g1, [ %i0 ] RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2008f8c: 82 06 20 0c add %i0, 0xc, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 2008f90: c2 26 20 14 st %g1, [ %i0 + 0x14 ] the_rbtree->permanent_null = NULL; the_rbtree->root = NULL; the_rbtree->first[0] = NULL; the_rbtree->first[1] = NULL; the_rbtree->compare_function = compare_function; the_rbtree->is_unique = is_unique; 2008f94: 82 10 20 01 mov 1, %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 2008f98: 84 06 20 10 add %i0, 0x10, %g2 2008f9c: c2 2e 20 2c stb %g1, [ %i0 + 0x2c ] { the_rbtree->permanent_null = NULL; the_rbtree->root = NULL; the_rbtree->first[0] = NULL; the_rbtree->first[1] = NULL; the_rbtree->compare_function = compare_function; 2008fa0: 03 00 80 23 sethi %hi(0x2008c00), %g1 2008fa4: 82 10 61 e4 or %g1, 0x1e4, %g1 ! 2008de4 head->next = tail; head->previous = NULL; 2008fa8: c0 26 20 04 clr [ %i0 + 4 ] 2008fac: c2 26 20 28 st %g1, [ %i0 + 0x28 ] tail->previous = head; 2008fb0: f0 26 20 08 st %i0, [ %i0 + 8 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2008fb4: c0 26 20 10 clr [ %i0 + 0x10 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2008fb8: c4 26 20 0c st %g2, [ %i0 + 0xc ] RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 2008fbc: c0 26 20 18 clr [ %i0 + 0x18 ] the_rbtree->root = NULL; 2008fc0: c0 26 20 1c clr [ %i0 + 0x1c ] the_rbtree->first[0] = NULL; 2008fc4: c0 26 20 20 clr [ %i0 + 0x20 ] the_rbtree->first[1] = NULL; 2008fc8: c0 26 20 24 clr [ %i0 + 0x24 ] rtems_rbheap_chunk *first = NULL; rtems_chain_initialize_empty(free_chain); rtems_chain_initialize_empty(&control->spare_descriptor_chain); rtems_rbtree_initialize_empty(chunk_tree, chunk_compare, true); control->alignment = alignment; 2008fcc: f6 26 20 30 st %i3, [ %i0 + 0x30 ] control->handler_arg = handler_arg; 2008fd0: fa 26 20 38 st %i5, [ %i0 + 0x38 ] control->extend_descriptors = extend_descriptors; 2008fd4: f8 26 20 34 st %i4, [ %i0 + 0x34 ] first = get_chunk(control); 2008fd8: 7f ff ff 87 call 2008df4 2008fdc: 90 10 00 18 mov %i0, %o0 first->begin = aligned_begin; first->size = aligned_end - aligned_begin; add_to_chain(free_chain, first); insert_into_tree(chunk_tree, first); } else { sc = RTEMS_NO_MEMORY; 2008fe0: 82 10 20 1a mov 0x1a, %g1 control->alignment = alignment; control->handler_arg = handler_arg; control->extend_descriptors = extend_descriptors; first = get_chunk(control); if (first != NULL) { 2008fe4: 80 a2 20 00 cmp %o0, 0 2008fe8: 02 bf ff c7 be 2008f04 2008fec: 92 10 00 08 mov %o0, %o1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 2008ff0: c2 06 00 00 ld [ %i0 ], %g1 first->begin = aligned_begin; first->size = aligned_end - aligned_begin; 2008ff4: b4 26 80 10 sub %i2, %l0, %i2 control->handler_arg = handler_arg; control->extend_descriptors = extend_descriptors; first = get_chunk(control); if (first != NULL) { first->begin = aligned_begin; 2008ff8: e0 22 20 18 st %l0, [ %o0 + 0x18 ] first->size = aligned_end - aligned_begin; 2008ffc: f4 22 20 1c st %i2, [ %o0 + 0x1c ] Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 2009000: f0 22 20 04 st %i0, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 2009004: d0 26 00 00 st %o0, [ %i0 ] the_node->next = before_node; 2009008: c2 22 00 00 st %g1, [ %o0 ] before_node->previous = the_node; 200900c: d0 20 60 04 st %o0, [ %g1 + 4 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_chunk *chunk ) { _RBTree_Insert_unprotected(tree, &chunk->tree_node); 2009010: 92 02 60 08 add %o1, 8, %o1 2009014: 40 00 07 4e call 200ad4c <_RBTree_Insert_unprotected> 2009018: 90 06 20 18 add %i0, 0x18, %o0 uintptr_t alignment, rtems_rbheap_extend_descriptors extend_descriptors, void *handler_arg ) { rtems_status_code sc = RTEMS_SUCCESSFUL; 200901c: 10 bf ff ba b 2008f04 2009020: 82 10 20 00 clr %g1 =============================================================================== 02016f38 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2016f38: 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 ) 2016f3c: 80 a6 60 00 cmp %i1, 0 2016f40: 12 80 00 04 bne 2016f50 2016f44: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016f48: 81 c7 e0 08 ret 2016f4c: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2016f50: 90 10 00 18 mov %i0, %o0 2016f54: 40 00 13 b9 call 201be38 <_Thread_Get> 2016f58: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2016f5c: c2 07 bf fc ld [ %fp + -4 ], %g1 2016f60: 80 a0 60 00 cmp %g1, 0 2016f64: 12 80 00 20 bne 2016fe4 2016f68: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2016f6c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2016f70: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2016f74: 80 a0 60 00 cmp %g1, 0 2016f78: 02 80 00 1e be 2016ff0 2016f7c: 01 00 00 00 nop if ( asr->is_enabled ) { 2016f80: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2016f84: 80 a0 60 00 cmp %g1, 0 2016f88: 02 80 00 1e be 2017000 2016f8c: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016f90: 7f ff e2 20 call 200f810 2016f94: 01 00 00 00 nop *signal_set |= signals; 2016f98: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2016f9c: b2 10 40 19 or %g1, %i1, %i1 2016fa0: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2016fa4: 7f ff e2 1f call 200f820 2016fa8: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2016fac: 03 00 80 f4 sethi %hi(0x203d000), %g1 2016fb0: 82 10 62 80 or %g1, 0x280, %g1 ! 203d280 <_Per_CPU_Information> 2016fb4: c4 00 60 08 ld [ %g1 + 8 ], %g2 2016fb8: 80 a0 a0 00 cmp %g2, 0 2016fbc: 02 80 00 06 be 2016fd4 2016fc0: 01 00 00 00 nop 2016fc4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2016fc8: 80 a7 00 02 cmp %i4, %g2 2016fcc: 02 80 00 15 be 2017020 <== ALWAYS TAKEN 2016fd0: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2016fd4: 40 00 13 8c call 201be04 <_Thread_Enable_dispatch> 2016fd8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2016fdc: 10 bf ff db b 2016f48 2016fe0: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2016fe4: 82 10 20 04 mov 4, %g1 } 2016fe8: 81 c7 e0 08 ret 2016fec: 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(); 2016ff0: 40 00 13 85 call 201be04 <_Thread_Enable_dispatch> 2016ff4: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2016ff8: 10 bf ff d4 b 2016f48 2016ffc: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2017000: 7f ff e2 04 call 200f810 2017004: 01 00 00 00 nop *signal_set |= signals; 2017008: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 201700c: b2 10 40 19 or %g1, %i1, %i1 2017010: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2017014: 7f ff e2 03 call 200f820 2017018: 01 00 00 00 nop 201701c: 30 bf ff ee b,a 2016fd4 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; 2017020: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2017024: 30 bf ff ec b,a 2016fd4 =============================================================================== 0201020c : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 201020c: 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 ) 2010210: 80 a6 a0 00 cmp %i2, 0 2010214: 02 80 00 3b be 2010300 2010218: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 201021c: 21 00 80 7b sethi %hi(0x201ec00), %l0 2010220: a0 14 22 00 or %l0, 0x200, %l0 ! 201ee00 <_Per_CPU_Information> 2010224: 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; 2010228: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 201022c: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010230: 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 ]; 2010234: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010238: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 201023c: 80 a0 60 00 cmp %g1, 0 2010240: 12 80 00 40 bne 2010340 2010244: 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; 2010248: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 201024c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 2010250: 7f ff ee ca call 200bd78 <_CPU_ISR_Get_level> 2010254: 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; 2010258: a3 2c 60 0a sll %l1, 0xa, %l1 201025c: 90 14 40 08 or %l1, %o0, %o0 old_mode |= _ISR_Get_level(); 2010260: b6 12 00 1b or %o0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 2010264: 80 8e 61 00 btst 0x100, %i1 2010268: 02 80 00 06 be 2010280 201026c: 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; 2010270: 83 36 20 08 srl %i0, 8, %g1 2010274: 82 18 60 01 xor %g1, 1, %g1 2010278: 82 08 60 01 and %g1, 1, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 201027c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 2010280: 80 8e 62 00 btst 0x200, %i1 2010284: 12 80 00 21 bne 2010308 2010288: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 201028c: 80 8e 60 0f btst 0xf, %i1 2010290: 12 80 00 27 bne 201032c 2010294: 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 ) { 2010298: 80 8e 64 00 btst 0x400, %i1 201029c: 02 80 00 14 be 20102ec 20102a0: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 20102a4: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 */ is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; 20102a8: b1 36 20 0a srl %i0, 0xa, %i0 20102ac: b0 1e 20 01 xor %i0, 1, %i0 20102b0: b0 0e 20 01 and %i0, 1, %i0 if ( is_asr_enabled != asr->is_enabled ) { 20102b4: 80 a6 00 01 cmp %i0, %g1 20102b8: 22 80 00 0e be,a 20102f0 20102bc: 03 00 80 7a sethi %hi(0x201e800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 20102c0: 7f ff c9 29 call 2002764 20102c4: f0 2f 20 08 stb %i0, [ %i4 + 8 ] _signals = information->signals_pending; 20102c8: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 20102cc: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 20102d0: 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; 20102d4: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 20102d8: 7f ff c9 27 call 2002774 20102dc: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 20102e0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 20102e4: 80 a0 00 01 cmp %g0, %g1 20102e8: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 20102ec: 03 00 80 7a sethi %hi(0x201e800), %g1 20102f0: c4 00 62 10 ld [ %g1 + 0x210 ], %g2 ! 201ea10 <_System_state_Current> 20102f4: 80 a0 a0 03 cmp %g2, 3 20102f8: 02 80 00 1f be 2010374 20102fc: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 2010300: 81 c7 e0 08 ret 2010304: 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) ) { 2010308: 22 bf ff e1 be,a 201028c 201030c: c0 27 60 78 clr [ %i5 + 0x78 ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 2010310: 03 00 80 7a sethi %hi(0x201e800), %g1 2010314: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 ! 201e830 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 2010318: 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; 201031c: c2 27 60 74 st %g1, [ %i5 + 0x74 ] if ( mask & RTEMS_PREEMPT_MASK ) executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; if ( mask & RTEMS_TIMESLICE_MASK ) { if ( _Modes_Is_timeslice(mode_set) ) { executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 2010320: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 2010324: 02 bf ff dd be 2010298 2010328: c2 27 60 78 st %g1, [ %i5 + 0x78 ] */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 201032c: 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 ) ); 2010330: 7f ff c9 11 call 2002774 2010334: 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 ) { 2010338: 10 bf ff d9 b 201029c 201033c: 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; 2010340: 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; 2010344: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 2010348: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 201034c: 7f ff ee 8b call 200bd78 <_CPU_ISR_Get_level> 2010350: 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; 2010354: a3 2c 60 0a sll %l1, 0xa, %l1 2010358: 90 14 40 08 or %l1, %o0, %o0 old_mode |= _ISR_Get_level(); 201035c: b6 12 00 1b or %o0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 2010360: 80 8e 61 00 btst 0x100, %i1 2010364: 02 bf ff c7 be 2010280 2010368: 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; 201036c: 10 bf ff c2 b 2010274 2010370: 83 36 20 08 srl %i0, 8, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 2010374: 80 88 e0 ff btst 0xff, %g3 2010378: 12 80 00 0a bne 20103a0 201037c: c4 04 20 0c ld [ %l0 + 0xc ], %g2 2010380: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 2010384: 80 a0 80 03 cmp %g2, %g3 2010388: 02 bf ff de be 2010300 201038c: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 2010390: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 2010394: 80 a0 a0 00 cmp %g2, 0 2010398: 02 bf ff da be 2010300 <== NEVER TAKEN 201039c: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 20103a0: 82 10 20 01 mov 1, %g1 ! 1 20103a4: 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(); 20103a8: 7f ff e9 04 call 200a7b8 <_Thread_Dispatch> 20103ac: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 20103b0: 82 10 20 00 clr %g1 ! 0 } 20103b4: 81 c7 e0 08 ret 20103b8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200c890 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200c890: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200c894: 80 a6 60 00 cmp %i1, 0 200c898: 02 80 00 08 be 200c8b8 200c89c: 80 a6 a0 00 cmp %i2, 0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200c8a0: 03 00 80 88 sethi %hi(0x2022000), %g1 200c8a4: c4 08 63 b8 ldub [ %g1 + 0x3b8 ], %g2 ! 20223b8 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200c8a8: 80 a6 40 02 cmp %i1, %g2 200c8ac: 18 80 00 1e bgu 200c924 200c8b0: 82 10 20 13 mov 0x13, %g1 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200c8b4: 80 a6 a0 00 cmp %i2, 0 200c8b8: 02 80 00 1b be 200c924 200c8bc: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200c8c0: 90 10 00 18 mov %i0, %o0 200c8c4: 40 00 0a 2c call 200f174 <_Thread_Get> 200c8c8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200c8cc: c2 07 bf fc ld [ %fp + -4 ], %g1 200c8d0: 80 a0 60 00 cmp %g1, 0 200c8d4: 12 80 00 16 bne 200c92c 200c8d8: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200c8dc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200c8e0: 80 a6 60 00 cmp %i1, 0 200c8e4: 02 80 00 0d be 200c918 200c8e8: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200c8ec: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200c8f0: 80 a0 60 00 cmp %g1, 0 200c8f4: 02 80 00 06 be 200c90c 200c8f8: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200c8fc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200c900: 80 a6 40 01 cmp %i1, %g1 200c904: 1a 80 00 05 bcc 200c918 <== ALWAYS TAKEN 200c908: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200c90c: 92 10 00 19 mov %i1, %o1 200c910: 40 00 08 cb call 200ec3c <_Thread_Change_priority> 200c914: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200c918: 40 00 0a 0a call 200f140 <_Thread_Enable_dispatch> 200c91c: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 200c920: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200c924: 81 c7 e0 08 ret 200c928: 91 e8 00 01 restore %g0, %g1, %o0 200c92c: 81 c7 e0 08 ret 200c930: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 020066e0 : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 20066e0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 20066e4: 80 a6 60 00 cmp %i1, 0 20066e8: 02 80 00 1e be 2006760 20066ec: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 20066f0: 90 10 00 18 mov %i0, %o0 20066f4: 40 00 08 b0 call 20089b4 <_Thread_Get> 20066f8: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20066fc: c2 07 bf fc ld [ %fp + -4 ], %g1 2006700: 80 a0 60 00 cmp %g1, 0 2006704: 12 80 00 19 bne 2006768 2006708: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 200670c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 2006710: 80 a0 60 00 cmp %g1, 0 2006714: 02 80 00 10 be 2006754 2006718: 01 00 00 00 nop if (tvp->ptr == ptr) { 200671c: c4 00 60 04 ld [ %g1 + 4 ], %g2 2006720: 80 a0 80 19 cmp %g2, %i1 2006724: 32 80 00 09 bne,a 2006748 2006728: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 200672c: 10 80 00 18 b 200678c 2006730: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 2006734: 80 a0 80 19 cmp %g2, %i1 2006738: 22 80 00 0e be,a 2006770 200673c: c4 02 40 00 ld [ %o1 ], %g2 2006740: 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; 2006744: 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) { 2006748: 80 a2 60 00 cmp %o1, 0 200674c: 32 bf ff fa bne,a 2006734 <== ALWAYS TAKEN 2006750: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 2006754: 40 00 08 8b call 2008980 <_Thread_Enable_dispatch> 2006758: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 200675c: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2006760: 81 c7 e0 08 ret 2006764: 91 e8 00 01 restore %g0, %g1, %o0 2006768: 81 c7 e0 08 ret 200676c: 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; 2006770: 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 ); 2006774: 40 00 00 2e call 200682c <_RTEMS_Tasks_Invoke_task_variable_dtor> 2006778: 01 00 00 00 nop _Thread_Enable_dispatch(); 200677c: 40 00 08 81 call 2008980 <_Thread_Enable_dispatch> 2006780: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2006784: 10 bf ff f7 b 2006760 2006788: 82 10 20 00 clr %g1 ! 0 while (tvp) { if (tvp->ptr == ptr) { if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 200678c: 92 10 00 01 mov %g1, %o1 2006790: 10 bf ff f9 b 2006774 2006794: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 02006798 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 2006798: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 200679c: 80 a6 60 00 cmp %i1, 0 20067a0: 02 80 00 1b be 200680c 20067a4: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !result ) 20067a8: 80 a6 a0 00 cmp %i2, 0 20067ac: 02 80 00 18 be 200680c 20067b0: 90 10 00 18 mov %i0, %o0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 20067b4: 40 00 08 80 call 20089b4 <_Thread_Get> 20067b8: 92 07 bf fc add %fp, -4, %o1 switch (location) { 20067bc: c2 07 bf fc ld [ %fp + -4 ], %g1 20067c0: 80 a0 60 00 cmp %g1, 0 20067c4: 12 80 00 14 bne 2006814 20067c8: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 20067cc: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 20067d0: 80 a0 60 00 cmp %g1, 0 20067d4: 32 80 00 07 bne,a 20067f0 20067d8: c4 00 60 04 ld [ %g1 + 4 ], %g2 20067dc: 30 80 00 10 b,a 200681c 20067e0: 80 a0 60 00 cmp %g1, 0 20067e4: 02 80 00 0e be 200681c <== NEVER TAKEN 20067e8: 01 00 00 00 nop if (tvp->ptr == ptr) { 20067ec: c4 00 60 04 ld [ %g1 + 4 ], %g2 20067f0: 80 a0 80 19 cmp %g2, %i1 20067f4: 32 bf ff fb bne,a 20067e0 20067f8: 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; 20067fc: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); 2006800: 40 00 08 60 call 2008980 <_Thread_Enable_dispatch> 2006804: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 2006808: 82 10 20 00 clr %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 200680c: 81 c7 e0 08 ret 2006810: 91 e8 00 01 restore %g0, %g1, %o0 2006814: 81 c7 e0 08 ret 2006818: 91 e8 00 01 restore %g0, %g1, %o0 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 200681c: 40 00 08 59 call 2008980 <_Thread_Enable_dispatch> 2006820: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 2006824: 10 bf ff fa b 200680c 2006828: 82 10 20 09 mov 9, %g1 ! 9 =============================================================================== 020179d8 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 20179d8: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 20179dc: 11 00 80 f5 sethi %hi(0x203d400), %o0 20179e0: 92 10 00 18 mov %i0, %o1 20179e4: 90 12 22 c4 or %o0, 0x2c4, %o0 20179e8: 40 00 0c fd call 201addc <_Objects_Get> 20179ec: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 20179f0: c2 07 bf fc ld [ %fp + -4 ], %g1 20179f4: 80 a0 60 00 cmp %g1, 0 20179f8: 12 80 00 0c bne 2017a28 20179fc: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2017a00: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2017a04: 80 a0 60 04 cmp %g1, 4 2017a08: 02 80 00 04 be 2017a18 <== NEVER TAKEN 2017a0c: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2017a10: 40 00 15 78 call 201cff0 <_Watchdog_Remove> 2017a14: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2017a18: 40 00 10 fb call 201be04 <_Thread_Enable_dispatch> 2017a1c: b0 10 20 00 clr %i0 2017a20: 81 c7 e0 08 ret 2017a24: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2017a28: 81 c7 e0 08 ret 2017a2c: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02017f34 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2017f34: 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; 2017f38: 03 00 80 f5 sethi %hi(0x203d400), %g1 2017f3c: fa 00 63 04 ld [ %g1 + 0x304 ], %i5 ! 203d704 <_Timer_server> if ( !timer_server ) 2017f40: 80 a7 60 00 cmp %i5, 0 2017f44: 02 80 00 08 be 2017f64 2017f48: 82 10 20 0e mov 0xe, %g1 return RTEMS_INCORRECT_STATE; if ( !_TOD.is_set ) 2017f4c: 39 00 80 f3 sethi %hi(0x203cc00), %i4 2017f50: 82 17 20 98 or %i4, 0x98, %g1 ! 203cc98 <_TOD> 2017f54: c4 08 60 14 ldub [ %g1 + 0x14 ], %g2 2017f58: 80 a0 a0 00 cmp %g2, 0 2017f5c: 12 80 00 04 bne 2017f6c <== ALWAYS TAKEN 2017f60: 82 10 20 0b mov 0xb, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2017f64: 81 c7 e0 08 ret 2017f68: 91 e8 00 01 restore %g0, %g1, %o0 return RTEMS_INCORRECT_STATE; if ( !_TOD.is_set ) return RTEMS_NOT_DEFINED; if ( !routine ) 2017f6c: 80 a6 a0 00 cmp %i2, 0 2017f70: 02 bf ff fd be 2017f64 2017f74: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2017f78: 7f ff f3 24 call 2014c08 <_TOD_Validate> 2017f7c: 90 10 00 19 mov %i1, %o0 2017f80: 80 8a 20 ff btst 0xff, %o0 2017f84: 12 80 00 04 bne 2017f94 2017f88: 82 10 20 14 mov 0x14, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2017f8c: 81 c7 e0 08 ret 2017f90: 91 e8 00 01 restore %g0, %g1, %o0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017f94: 7f ff f2 e3 call 2014b20 <_TOD_To_seconds> 2017f98: 90 10 00 19 mov %i1, %o0 2017f9c: b2 10 00 08 mov %o0, %i1 2017fa0: d0 1f 20 98 ldd [ %i4 + 0x98 ], %o0 2017fa4: 94 10 20 00 clr %o2 2017fa8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017fac: 40 00 52 76 call 202c984 <__divdi3> 2017fb0: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 if ( seconds <= _TOD_Seconds_since_epoch() ) 2017fb4: 80 a6 40 09 cmp %i1, %o1 2017fb8: 08 bf ff f5 bleu 2017f8c 2017fbc: 82 10 20 14 mov 0x14, %g1 2017fc0: 92 10 00 18 mov %i0, %o1 2017fc4: 11 00 80 f5 sethi %hi(0x203d400), %o0 2017fc8: 94 07 bf fc add %fp, -4, %o2 2017fcc: 40 00 0b 84 call 201addc <_Objects_Get> 2017fd0: 90 12 22 c4 or %o0, 0x2c4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2017fd4: c2 07 bf fc ld [ %fp + -4 ], %g1 2017fd8: 80 a0 60 00 cmp %g1, 0 2017fdc: 12 80 00 19 bne 2018040 2017fe0: a0 10 00 08 mov %o0, %l0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2017fe4: 40 00 14 03 call 201cff0 <_Watchdog_Remove> 2017fe8: 90 02 20 10 add %o0, 0x10, %o0 2017fec: d0 1f 20 98 ldd [ %i4 + 0x98 ], %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2017ff0: 82 10 20 03 mov 3, %g1 2017ff4: 94 10 20 00 clr %o2 2017ff8: c2 24 20 38 st %g1, [ %l0 + 0x38 ] 2017ffc: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2018000: c0 24 20 18 clr [ %l0 + 0x18 ] 2018004: 96 12 e2 00 or %o3, 0x200, %o3 the_watchdog->routine = routine; 2018008: f4 24 20 2c st %i2, [ %l0 + 0x2c ] the_watchdog->id = id; 201800c: f0 24 20 30 st %i0, [ %l0 + 0x30 ] 2018010: 40 00 52 5d call 202c984 <__divdi3> 2018014: f6 24 20 34 st %i3, [ %l0 + 0x34 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); (*timer_server->schedule_operation)( timer_server, the_timer ); 2018018: c2 07 60 04 ld [ %i5 + 4 ], %g1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 201801c: b2 26 40 09 sub %i1, %o1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2018020: 90 10 00 1d mov %i5, %o0 2018024: 92 10 00 10 mov %l0, %o1 2018028: 9f c0 40 00 call %g1 201802c: f2 24 20 1c st %i1, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 2018030: 40 00 0f 75 call 201be04 <_Thread_Enable_dispatch> 2018034: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2018038: 10 bf ff cb b 2017f64 201803c: 82 10 20 00 clr %g1 ! 0 #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2018040: 10 bf ff c9 b 2017f64 2018044: 82 10 20 04 mov 4, %g1 =============================================================================== 02008508 : #include int sched_get_priority_max( int policy ) { 2008508: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 200850c: 80 a6 20 04 cmp %i0, 4 2008510: 08 80 00 08 bleu 2008530 2008514: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2008518: 40 00 23 c8 call 2011438 <__errno> 200851c: b0 10 3f ff mov -1, %i0 2008520: 82 10 20 16 mov 0x16, %g1 2008524: c2 22 00 00 st %g1, [ %o0 ] 2008528: 81 c7 e0 08 ret 200852c: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2008530: b1 28 40 18 sll %g1, %i0, %i0 2008534: 80 8e 20 17 btst 0x17, %i0 2008538: 02 bf ff f8 be 2008518 <== NEVER TAKEN 200853c: 03 00 80 8a sethi %hi(0x2022800), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2008540: f0 08 61 08 ldub [ %g1 + 0x108 ], %i0 ! 2022908 } 2008544: 81 c7 e0 08 ret 2008548: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 0200854c : #include int sched_get_priority_min( int policy ) { 200854c: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2008550: 80 a6 20 04 cmp %i0, 4 2008554: 08 80 00 08 bleu 2008574 2008558: 82 10 00 18 mov %i0, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 200855c: 40 00 23 b7 call 2011438 <__errno> 2008560: b0 10 3f ff mov -1, %i0 2008564: 82 10 20 16 mov 0x16, %g1 2008568: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 200856c: 81 c7 e0 08 ret 2008570: 81 e8 00 00 restore int sched_get_priority_min( int policy ) { switch ( policy ) { 2008574: 84 10 20 01 mov 1, %g2 2008578: 83 28 80 01 sll %g2, %g1, %g1 200857c: 80 88 60 17 btst 0x17, %g1 2008580: 02 bf ff f7 be 200855c <== NEVER TAKEN 2008584: b0 10 20 01 mov 1, %i0 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2008588: 81 c7 e0 08 ret 200858c: 81 e8 00 00 restore =============================================================================== 02008590 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2008590: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2008594: 80 a6 20 00 cmp %i0, 0 2008598: 12 80 00 0a bne 20085c0 <== ALWAYS TAKEN 200859c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 20085a0: 02 80 00 13 be 20085ec 20085a4: 03 00 80 8d sethi %hi(0x2023400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 20085a8: d0 00 61 f0 ld [ %g1 + 0x1f0 ], %o0 ! 20235f0 <_Thread_Ticks_per_timeslice> 20085ac: 92 10 00 19 mov %i1, %o1 20085b0: 40 00 0f 89 call 200c3d4 <_Timespec_From_ticks> 20085b4: b0 10 20 00 clr %i0 return 0; } 20085b8: 81 c7 e0 08 ret 20085bc: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 20085c0: 7f ff ee 6b call 2003f6c 20085c4: 01 00 00 00 nop 20085c8: 80 a2 00 18 cmp %o0, %i0 20085cc: 02 bf ff f5 be 20085a0 20085d0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20085d4: 40 00 23 99 call 2011438 <__errno> 20085d8: b0 10 3f ff mov -1, %i0 20085dc: 82 10 20 03 mov 3, %g1 20085e0: c2 22 00 00 st %g1, [ %o0 ] 20085e4: 81 c7 e0 08 ret 20085e8: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 20085ec: 40 00 23 93 call 2011438 <__errno> 20085f0: b0 10 3f ff mov -1, %i0 20085f4: 82 10 20 16 mov 0x16, %g1 20085f8: c2 22 00 00 st %g1, [ %o0 ] 20085fc: 81 c7 e0 08 ret 2008600: 81 e8 00 00 restore =============================================================================== 02008b7c : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2008b7c: 9d e3 bf 88 save %sp, -120, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008b80: 03 00 80 8c sethi %hi(0x2023000), %g1 2008b84: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2008b88: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2008b8c: 84 00 a0 01 inc %g2 2008b90: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 2008b94: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %g1 2008b98: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2008b9c: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2008ba0: fa 27 a0 58 st %i5, [ %fp + 0x58 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2008ba4: b4 8e 62 00 andcc %i1, 0x200, %i2 2008ba8: 12 80 00 27 bne 2008c44 2008bac: b6 10 20 00 clr %i3 const char *name, Objects_Id *id, size_t *len ) { return _POSIX_Name_to_id( &_POSIX_Semaphore_Information, name, id, len ); 2008bb0: 39 00 80 8d sethi %hi(0x2023400), %i4 2008bb4: 92 10 00 18 mov %i0, %o1 2008bb8: 90 17 22 b0 or %i4, 0x2b0, %o0 2008bbc: 94 07 bf f0 add %fp, -16, %o2 2008bc0: 7f ff fe 5b call 200852c <_POSIX_Name_to_id> 2008bc4: 96 07 bf fc add %fp, -4, %o3 * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "semaphore does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 2008bc8: ba 92 20 00 orcc %o0, 0, %i5 2008bcc: 22 80 00 0e be,a 2008c04 2008bd0: 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) ) ) { 2008bd4: 80 a7 60 02 cmp %i5, 2 2008bd8: 12 80 00 04 bne 2008be8 2008bdc: 80 a6 a0 00 cmp %i2, 0 2008be0: 12 80 00 1d bne 2008c54 2008be4: d2 07 bf fc ld [ %fp + -4 ], %o1 _Thread_Enable_dispatch(); 2008be8: 40 00 0e 82 call 200c5f0 <_Thread_Enable_dispatch> 2008bec: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 2008bf0: 40 00 26 e1 call 2012774 <__errno> 2008bf4: 01 00 00 00 nop 2008bf8: fa 22 00 00 st %i5, [ %o0 ] 2008bfc: 81 c7 e0 08 ret 2008c00: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2008c04: 80 a6 6a 00 cmp %i1, 0xa00 2008c08: 02 80 00 1f be 2008c84 2008c0c: d2 07 bf f0 ld [ %fp + -16 ], %o1 RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Get ( sem_t *id, Objects_Locations *location ) { return (POSIX_Semaphore_Control *) 2008c10: 94 07 bf f8 add %fp, -8, %o2 2008c14: 40 00 0a 62 call 200b59c <_Objects_Get> 2008c18: 90 17 22 b0 or %i4, 0x2b0, %o0 _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( (sem_t *) &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2008c1c: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( (sem_t *) &the_semaphore_id, &location ); 2008c20: d0 27 bf f4 st %o0, [ %fp + -12 ] the_semaphore->open_count += 1; 2008c24: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2008c28: 40 00 0e 72 call 200c5f0 <_Thread_Enable_dispatch> 2008c2c: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 2008c30: 40 00 0e 70 call 200c5f0 <_Thread_Enable_dispatch> 2008c34: 01 00 00 00 nop return_id: #if defined(RTEMS_USE_16_BIT_OBJECT) the_semaphore->Semaphore_id = the_semaphore->Object.id; return &the_semaphore->Semaphore_id; #else return (sem_t *)&the_semaphore->Object.id; 2008c38: f0 07 bf f4 ld [ %fp + -12 ], %i0 2008c3c: 81 c7 e0 08 ret 2008c40: 91 ee 20 08 restore %i0, 8, %o0 size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2008c44: 82 07 a0 4c add %fp, 0x4c, %g1 mode = va_arg( arg, mode_t ); value = va_arg( arg, unsigned int ); 2008c48: f6 07 a0 50 ld [ %fp + 0x50 ], %i3 size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2008c4c: 10 bf ff d9 b 2008bb0 2008c50: c2 27 bf ec st %g1, [ %fp + -20 ] /* * At this point, the semaphore does not exist and everything has been * checked. We should go ahead and create a semaphore. */ status =_POSIX_Semaphore_Create_support( 2008c54: 94 10 20 00 clr %o2 2008c58: 96 10 00 1b mov %i3, %o3 2008c5c: 98 07 bf f4 add %fp, -12, %o4 2008c60: 40 00 1b 22 call 200f8e8 <_POSIX_Semaphore_Create_support> 2008c64: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 2008c68: 40 00 0e 62 call 200c5f0 <_Thread_Enable_dispatch> 2008c6c: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2008c70: 80 a7 7f ff cmp %i5, -1 2008c74: 32 bf ff f2 bne,a 2008c3c <== ALWAYS TAKEN 2008c78: f0 07 bf f4 ld [ %fp + -12 ], %i0 the_semaphore->Semaphore_id = the_semaphore->Object.id; return &the_semaphore->Semaphore_id; #else return (sem_t *)&the_semaphore->Object.id; #endif } 2008c7c: 81 c7 e0 08 ret <== NOT EXECUTED 2008c80: 91 e8 3f ff restore %g0, -1, %o0 <== NOT EXECUTED /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); 2008c84: 40 00 0e 5b call 200c5f0 <_Thread_Enable_dispatch> 2008c88: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2008c8c: 40 00 26 ba call 2012774 <__errno> 2008c90: 01 00 00 00 nop 2008c94: 82 10 20 11 mov 0x11, %g1 ! 11 2008c98: c2 22 00 00 st %g1, [ %o0 ] 2008c9c: 81 c7 e0 08 ret 2008ca0: 81 e8 00 00 restore =============================================================================== 0200afac : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 200afac: 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 ); 200afb0: 90 10 00 19 mov %i1, %o0 200afb4: 40 00 17 13 call 2010c00 <_POSIX_Absolute_timeout_to_ticks> 200afb8: 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 ); 200afbc: 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 ) 200afc0: 80 a2 20 03 cmp %o0, 3 200afc4: 02 80 00 06 be 200afdc <== ALWAYS TAKEN 200afc8: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 200afcc: 40 00 1a 0d call 2011800 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 200afd0: 92 10 20 00 clr %o1 <== NOT EXECUTED 200afd4: 81 c7 e0 08 ret <== NOT EXECUTED 200afd8: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 200afdc: 40 00 1a 09 call 2011800 <_POSIX_Semaphore_Wait_support> 200afe0: 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; } 200afe4: 81 c7 e0 08 ret 200afe8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020084a4 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 20084a4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 20084a8: 80 a6 a0 00 cmp %i2, 0 20084ac: 02 80 00 0d be 20084e0 20084b0: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 20084b4: 05 00 80 89 sethi %hi(0x2022400), %g2 20084b8: 83 2e 20 04 sll %i0, 4, %g1 20084bc: 84 10 a1 80 or %g2, 0x180, %g2 20084c0: 82 20 40 03 sub %g1, %g3, %g1 20084c4: c6 00 80 01 ld [ %g2 + %g1 ], %g3 20084c8: 82 00 80 01 add %g2, %g1, %g1 20084cc: c6 26 80 00 st %g3, [ %i2 ] 20084d0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20084d4: c4 26 a0 04 st %g2, [ %i2 + 4 ] 20084d8: c2 00 60 08 ld [ %g1 + 8 ], %g1 20084dc: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 20084e0: 80 a6 20 00 cmp %i0, 0 20084e4: 02 80 00 33 be 20085b0 20084e8: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 20084ec: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 20084f0: 80 a0 60 1f cmp %g1, 0x1f 20084f4: 18 80 00 2f bgu 20085b0 20084f8: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 20084fc: 02 80 00 2d be 20085b0 2008500: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2008504: 02 80 00 1a be 200856c <== NEVER TAKEN 2008508: 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 ); 200850c: 7f ff e9 82 call 2002b14 2008510: 01 00 00 00 nop 2008514: ba 10 00 08 mov %o0, %i5 if ( act->sa_handler == SIG_DFL ) { 2008518: c2 06 60 08 ld [ %i1 + 8 ], %g1 200851c: 80 a0 60 00 cmp %g1, 0 2008520: 02 80 00 15 be 2008574 2008524: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 2008528: 40 00 18 62 call 200e6b0 <_POSIX_signals_Clear_process_signals> 200852c: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2008530: c4 06 40 00 ld [ %i1 ], %g2 2008534: 87 2e 20 02 sll %i0, 2, %g3 2008538: 03 00 80 89 sethi %hi(0x2022400), %g1 200853c: b1 2e 20 04 sll %i0, 4, %i0 2008540: 82 10 61 80 or %g1, 0x180, %g1 2008544: b0 26 00 03 sub %i0, %g3, %i0 2008548: c4 20 40 18 st %g2, [ %g1 + %i0 ] 200854c: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008550: b0 00 40 18 add %g1, %i0, %i0 2008554: c4 26 20 04 st %g2, [ %i0 + 4 ] 2008558: c2 06 60 08 ld [ %i1 + 8 ], %g1 200855c: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 2008560: 7f ff e9 71 call 2002b24 2008564: 90 10 00 1d mov %i5, %o0 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 2008568: 82 10 20 00 clr %g1 } 200856c: 81 c7 e0 08 ret 2008570: 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 ]; 2008574: b1 2e 20 04 sll %i0, 4, %i0 2008578: b0 26 00 01 sub %i0, %g1, %i0 200857c: 03 00 80 7f sethi %hi(0x201fc00), %g1 2008580: 82 10 63 c4 or %g1, 0x3c4, %g1 ! 201ffc4 <_POSIX_signals_Default_vectors> 2008584: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2008588: 82 00 40 18 add %g1, %i0, %g1 200858c: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008590: c4 00 60 08 ld [ %g1 + 8 ], %g2 2008594: 03 00 80 89 sethi %hi(0x2022400), %g1 2008598: 82 10 61 80 or %g1, 0x180, %g1 ! 2022580 <_POSIX_signals_Vectors> 200859c: c8 20 40 18 st %g4, [ %g1 + %i0 ] 20085a0: b0 00 40 18 add %g1, %i0, %i0 20085a4: c6 26 20 04 st %g3, [ %i0 + 4 ] 20085a8: 10 bf ff ee b 2008560 20085ac: 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 ); 20085b0: 40 00 25 1e call 2011a28 <__errno> 20085b4: 01 00 00 00 nop 20085b8: 84 10 20 16 mov 0x16, %g2 ! 16 20085bc: 82 10 3f ff mov -1, %g1 20085c0: 10 bf ff eb b 200856c 20085c4: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02008a38 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2008a38: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2008a3c: ba 96 20 00 orcc %i0, 0, %i5 2008a40: 02 80 00 84 be 2008c50 2008a44: 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 ) { 2008a48: 02 80 00 5c be 2008bb8 2008a4c: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 2008a50: 40 00 0f cc call 200c980 <_Timespec_Is_valid> 2008a54: 90 10 00 1a mov %i2, %o0 2008a58: 80 8a 20 ff btst 0xff, %o0 2008a5c: 02 80 00 7d be 2008c50 2008a60: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2008a64: 40 00 0f da call 200c9cc <_Timespec_To_ticks> 2008a68: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2008a6c: b0 92 20 00 orcc %o0, 0, %i0 2008a70: 02 80 00 78 be 2008c50 <== NEVER TAKEN 2008a74: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008a78: 02 80 00 53 be 2008bc4 <== NEVER TAKEN 2008a7c: 35 00 80 8a sethi %hi(0x2022800), %i2 the_thread = _Thread_Executing; 2008a80: 35 00 80 8a sethi %hi(0x2022800), %i2 2008a84: b4 16 a2 30 or %i2, 0x230, %i2 ! 2022a30 <_Per_CPU_Information> 2008a88: f8 06 a0 0c ld [ %i2 + 0xc ], %i4 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2008a8c: 7f ff e8 fd call 2002e80 2008a90: f6 07 21 5c ld [ %i4 + 0x15c ], %i3 2008a94: a0 10 00 08 mov %o0, %l0 if ( *set & api->signals_pending ) { 2008a98: c2 07 40 00 ld [ %i5 ], %g1 2008a9c: c4 06 e0 d4 ld [ %i3 + 0xd4 ], %g2 2008aa0: 80 88 40 02 btst %g1, %g2 2008aa4: 12 80 00 53 bne 2008bf0 2008aa8: 01 00 00 00 nop return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2008aac: 05 00 80 8b sethi %hi(0x2022c00), %g2 2008ab0: c4 00 a0 84 ld [ %g2 + 0x84 ], %g2 ! 2022c84 <_POSIX_signals_Pending> 2008ab4: 80 88 40 02 btst %g1, %g2 2008ab8: 12 80 00 2f bne 2008b74 2008abc: 03 00 80 89 sethi %hi(0x2022400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008ac0: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 2022500 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 2008ac4: 86 10 3f ff mov -1, %g3 2008ac8: c6 26 40 00 st %g3, [ %i1 ] 2008acc: 84 00 a0 01 inc %g2 2008ad0: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2008ad4: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2008ad8: 82 10 20 04 mov 4, %g1 2008adc: c2 27 20 34 st %g1, [ %i4 + 0x34 ] the_thread->Wait.option = *set; 2008ae0: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2008ae4: f2 27 20 28 st %i1, [ %i4 + 0x28 ] the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; 2008ae8: c2 27 20 30 st %g1, [ %i4 + 0x30 ] RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008aec: a2 10 20 01 mov 1, %l1 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2008af0: 21 00 80 8b sethi %hi(0x2022c00), %l0 2008af4: a0 14 20 1c or %l0, 0x1c, %l0 ! 2022c1c <_POSIX_signals_Wait_queue> 2008af8: e0 27 20 44 st %l0, [ %i4 + 0x44 ] 2008afc: e2 24 20 30 st %l1, [ %l0 + 0x30 ] the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; the_thread->Wait.return_argument = the_info; _Thread_queue_Enter_critical_section( &_POSIX_signals_Wait_queue ); _ISR_Enable( level ); 2008b00: 7f ff e8 e4 call 2002e90 2008b04: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2008b08: 90 10 00 10 mov %l0, %o0 2008b0c: 92 10 00 18 mov %i0, %o1 2008b10: 15 00 80 31 sethi %hi(0x200c400), %o2 2008b14: 40 00 0e 29 call 200c3b8 <_Thread_queue_Enqueue_with_handler> 2008b18: 94 12 a3 98 or %o2, 0x398, %o2 ! 200c798 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2008b1c: 40 00 0c d8 call 200be7c <_Thread_Enable_dispatch> 2008b20: 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 ); 2008b24: d2 06 40 00 ld [ %i1 ], %o1 2008b28: 90 10 00 1b mov %i3, %o0 2008b2c: 94 10 00 19 mov %i1, %o2 2008b30: 96 10 20 00 clr %o3 2008b34: 40 00 19 1c call 200efa4 <_POSIX_signals_Clear_signals> 2008b38: 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) 2008b3c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2008b40: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008b44: 80 a0 60 04 cmp %g1, 4 2008b48: 12 80 00 3b bne 2008c34 2008b4c: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2008b50: f0 06 40 00 ld [ %i1 ], %i0 2008b54: c2 07 40 00 ld [ %i5 ], %g1 2008b58: 84 06 3f ff add %i0, -1, %g2 2008b5c: a3 2c 40 02 sll %l1, %g2, %l1 2008b60: 80 8c 40 01 btst %l1, %g1 2008b64: 02 80 00 34 be 2008c34 2008b68: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 2008b6c: 81 c7 e0 08 ret 2008b70: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2008b74: 7f ff ff 99 call 20089d8 <_POSIX_signals_Get_lowest> 2008b78: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2008b7c: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2008b80: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2008b84: 96 10 20 01 mov 1, %o3 2008b88: 90 10 00 1b mov %i3, %o0 2008b8c: 92 10 00 18 mov %i0, %o1 2008b90: 40 00 19 05 call 200efa4 <_POSIX_signals_Clear_signals> 2008b94: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2008b98: 7f ff e8 be call 2002e90 2008b9c: 90 10 00 10 mov %l0, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2008ba0: 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; 2008ba4: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2008ba8: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2008bac: c0 26 60 08 clr [ %i1 + 8 ] 2008bb0: 81 c7 e0 08 ret 2008bb4: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008bb8: 12 bf ff b2 bne 2008a80 2008bbc: b0 10 20 00 clr %i0 the_thread = _Thread_Executing; 2008bc0: 35 00 80 8a sethi %hi(0x2022800), %i2 2008bc4: b4 16 a2 30 or %i2, 0x230, %i2 ! 2022a30 <_Per_CPU_Information> 2008bc8: f8 06 a0 0c ld [ %i2 + 0xc ], %i4 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008bcc: b2 07 bf f4 add %fp, -12, %i1 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2008bd0: 7f ff e8 ac call 2002e80 2008bd4: f6 07 21 5c ld [ %i4 + 0x15c ], %i3 2008bd8: a0 10 00 08 mov %o0, %l0 if ( *set & api->signals_pending ) { 2008bdc: c2 07 40 00 ld [ %i5 ], %g1 2008be0: c4 06 e0 d4 ld [ %i3 + 0xd4 ], %g2 2008be4: 80 88 40 02 btst %g1, %g2 2008be8: 22 bf ff b2 be,a 2008ab0 2008bec: 05 00 80 8b sethi %hi(0x2022c00), %g2 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2008bf0: 7f ff ff 7a call 20089d8 <_POSIX_signals_Get_lowest> 2008bf4: 90 10 00 02 mov %g2, %o0 _POSIX_signals_Clear_signals( 2008bf8: 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 ); 2008bfc: 92 10 00 08 mov %o0, %o1 2008c00: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 2008c04: 96 10 20 00 clr %o3 2008c08: 90 10 00 1b mov %i3, %o0 2008c0c: 40 00 18 e6 call 200efa4 <_POSIX_signals_Clear_signals> 2008c10: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2008c14: 7f ff e8 9f call 2002e90 2008c18: 90 10 00 10 mov %l0, %o0 the_info->si_code = SI_USER; 2008c1c: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2008c20: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2008c24: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2008c28: f0 06 40 00 ld [ %i1 ], %i0 2008c2c: 81 c7 e0 08 ret 2008c30: 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; 2008c34: 40 00 25 5d call 20121a8 <__errno> 2008c38: b0 10 3f ff mov -1, %i0 2008c3c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2008c40: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008c44: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2008c48: 81 c7 e0 08 ret 2008c4c: 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 ); 2008c50: 40 00 25 56 call 20121a8 <__errno> 2008c54: b0 10 3f ff mov -1, %i0 2008c58: 82 10 20 16 mov 0x16, %g1 2008c5c: c2 22 00 00 st %g1, [ %o0 ] 2008c60: 81 c7 e0 08 ret 2008c64: 81 e8 00 00 restore =============================================================================== 0200a870 : int sigwait( const sigset_t *set, int *sig ) { 200a870: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 200a874: 92 10 20 00 clr %o1 200a878: 90 10 00 18 mov %i0, %o0 200a87c: 7f ff ff 6d call 200a630 200a880: 94 10 20 00 clr %o2 if ( status != -1 ) { 200a884: 80 a2 3f ff cmp %o0, -1 200a888: 02 80 00 07 be 200a8a4 200a88c: 80 a6 60 00 cmp %i1, 0 if ( sig ) 200a890: 02 80 00 0a be 200a8b8 <== NEVER TAKEN 200a894: 01 00 00 00 nop *sig = status; 200a898: d0 26 40 00 st %o0, [ %i1 ] return 0; 200a89c: 81 c7 e0 08 ret 200a8a0: 91 e8 20 00 restore %g0, 0, %o0 } return errno; 200a8a4: 40 00 24 78 call 2013a84 <__errno> 200a8a8: 01 00 00 00 nop 200a8ac: f0 02 00 00 ld [ %o0 ], %i0 200a8b0: 81 c7 e0 08 ret 200a8b4: 81 e8 00 00 restore } 200a8b8: 81 c7 e0 08 ret <== NOT EXECUTED 200a8bc: 91 e8 20 00 restore %g0, 0, %o0 <== NOT EXECUTED =============================================================================== 020076ec : */ long sysconf( int name ) { 20076ec: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 20076f0: 80 a6 20 02 cmp %i0, 2 20076f4: 02 80 00 12 be 200773c 20076f8: 82 10 00 18 mov %i0, %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 20076fc: 80 a6 20 04 cmp %i0, 4 2007700: 02 80 00 16 be 2007758 2007704: 80 a0 60 33 cmp %g1, 0x33 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2007708: 02 80 00 0b be 2007734 200770c: b0 10 24 00 mov 0x400, %i0 return 1024; if ( name == _SC_PAGESIZE ) 2007710: 80 a0 60 08 cmp %g1, 8 2007714: 02 80 00 08 be 2007734 2007718: 31 00 00 04 sethi %hi(0x1000), %i0 return PAGE_SIZE; if ( name == _SC_SYMLOOP_MAX ) 200771c: 80 a0 60 4f cmp %g1, 0x4f 2007720: 02 80 00 05 be 2007734 <== NEVER TAKEN 2007724: b0 10 20 20 mov 0x20, %i0 return RTEMS_FILESYSTEM_SYMLOOP_MAX; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2007728: 80 a0 62 03 cmp %g1, 0x203 200772c: 12 80 00 0f bne 2007768 <== ALWAYS TAKEN 2007730: b0 10 20 00 clr %i0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2007734: 81 c7 e0 08 ret 2007738: 81 e8 00 00 restore int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); 200773c: 03 00 80 77 sethi %hi(0x201dc00), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 2007740: d2 00 62 ec ld [ %g1 + 0x2ec ], %o1 ! 201deec 2007744: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007748: 40 00 48 9e call 20199c0 <.udiv> 200774c: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2007750: 81 c7 e0 08 ret 2007754: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) return rtems_libio_number_iops; 2007758: 03 00 80 78 sethi %hi(0x201e000), %g1 200775c: f0 00 60 34 ld [ %g1 + 0x34 ], %i0 ! 201e034 2007760: 81 c7 e0 08 ret 2007764: 81 e8 00 00 restore #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2007768: 40 00 25 18 call 2010bc8 <__errno> 200776c: b0 10 3f ff mov -1, %i0 2007770: 82 10 20 16 mov 0x16, %g1 2007774: c2 22 00 00 st %g1, [ %o0 ] } 2007778: 81 c7 e0 08 ret 200777c: 81 e8 00 00 restore =============================================================================== 02008ca4 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2008ca4: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2008ca8: 80 a6 20 01 cmp %i0, 1 2008cac: 12 80 00 3e bne 2008da4 2008cb0: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2008cb4: 02 80 00 3c be 2008da4 2008cb8: 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) { 2008cbc: 02 80 00 0e be 2008cf4 2008cc0: 03 00 80 8c sethi %hi(0x2023000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2008cc4: c2 06 40 00 ld [ %i1 ], %g1 2008cc8: 82 00 7f ff add %g1, -1, %g1 2008ccc: 80 a0 60 01 cmp %g1, 1 2008cd0: 18 80 00 35 bgu 2008da4 <== NEVER TAKEN 2008cd4: 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 ) 2008cd8: c2 06 60 04 ld [ %i1 + 4 ], %g1 2008cdc: 80 a0 60 00 cmp %g1, 0 2008ce0: 02 80 00 31 be 2008da4 <== NEVER TAKEN 2008ce4: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2008ce8: 80 a0 60 1f cmp %g1, 0x1f 2008cec: 18 80 00 2e bgu 2008da4 <== NEVER TAKEN 2008cf0: 03 00 80 8c sethi %hi(0x2023000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008cf4: c4 00 63 c0 ld [ %g1 + 0x3c0 ], %g2 ! 20233c0 <_Thread_Dispatch_disable_level> 2008cf8: 84 00 a0 01 inc %g2 2008cfc: c4 20 63 c0 st %g2, [ %g1 + 0x3c0 ] return _Thread_Dispatch_disable_level; 2008d00: c2 00 63 c0 ld [ %g1 + 0x3c0 ], %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 ); 2008d04: 3b 00 80 8d sethi %hi(0x2023400), %i5 2008d08: 40 00 08 d2 call 200b050 <_Objects_Allocate> 2008d0c: 90 17 62 f0 or %i5, 0x2f0, %o0 ! 20236f0 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2008d10: 80 a2 20 00 cmp %o0, 0 2008d14: 02 80 00 2a be 2008dbc 2008d18: 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; 2008d1c: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2008d20: 03 00 80 8e sethi %hi(0x2023800), %g1 2008d24: c2 00 61 3c ld [ %g1 + 0x13c ], %g1 ! 202393c <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2008d28: 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; 2008d2c: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2008d30: 02 80 00 08 be 2008d50 2008d34: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2008d38: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 2008d3c: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 2008d40: 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; 2008d44: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2008d48: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2008d4c: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008d50: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008d54: ba 17 62 f0 or %i5, 0x2f0, %i5 2008d58: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 } ptimer->overrun = 0; 2008d5c: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2008d60: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2008d64: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2008d68: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2008d6c: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008d70: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2008d74: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2008d78: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2008d7c: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008d80: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008d84: 85 28 a0 02 sll %g2, 2, %g2 2008d88: 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; 2008d8c: 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; 2008d90: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2008d94: 40 00 0e 17 call 200c5f0 <_Thread_Enable_dispatch> 2008d98: b0 10 20 00 clr %i0 return 0; } 2008d9c: 81 c7 e0 08 ret 2008da0: 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 ); 2008da4: 40 00 26 74 call 2012774 <__errno> 2008da8: b0 10 3f ff mov -1, %i0 2008dac: 82 10 20 16 mov 0x16, %g1 2008db0: c2 22 00 00 st %g1, [ %o0 ] 2008db4: 81 c7 e0 08 ret 2008db8: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 2008dbc: 40 00 0e 0d call 200c5f0 <_Thread_Enable_dispatch> 2008dc0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 2008dc4: 40 00 26 6c call 2012774 <__errno> 2008dc8: 01 00 00 00 nop 2008dcc: 82 10 20 0b mov 0xb, %g1 ! b 2008dd0: c2 22 00 00 st %g1, [ %o0 ] 2008dd4: 81 c7 e0 08 ret 2008dd8: 81 e8 00 00 restore =============================================================================== 020078e0 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 20078e0: 9d e3 bf 78 save %sp, -136, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 20078e4: 80 a6 a0 00 cmp %i2, 0 20078e8: 02 80 00 82 be 2007af0 <== NEVER TAKEN 20078ec: 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) ) ) { 20078f0: 40 00 10 50 call 200ba30 <_Timespec_Is_valid> 20078f4: 90 06 a0 08 add %i2, 8, %o0 20078f8: 80 8a 20 ff btst 0xff, %o0 20078fc: 02 80 00 7d be 2007af0 2007900: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2007904: 40 00 10 4b call 200ba30 <_Timespec_Is_valid> 2007908: 90 10 00 1a mov %i2, %o0 200790c: 80 8a 20 ff btst 0xff, %o0 2007910: 02 80 00 78 be 2007af0 <== NEVER TAKEN 2007914: 80 8e 7f fb btst -5, %i1 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2007918: 12 80 00 76 bne 2007af0 200791c: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2007920: c8 06 80 00 ld [ %i2 ], %g4 2007924: c6 06 a0 04 ld [ %i2 + 4 ], %g3 2007928: c4 06 a0 08 ld [ %i2 + 8 ], %g2 200792c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2007930: c8 27 bf f0 st %g4, [ %fp + -16 ] 2007934: c6 27 bf f4 st %g3, [ %fp + -12 ] 2007938: c4 27 bf f8 st %g2, [ %fp + -8 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 200793c: 02 80 00 4a be 2007a64 2007940: c2 27 bf fc st %g1, [ %fp + -4 ] RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 2007944: 92 10 00 18 mov %i0, %o1 2007948: 11 00 80 7d sethi %hi(0x201f400), %o0 200794c: 94 07 bf dc add %fp, -36, %o2 2007950: 40 00 09 99 call 2009fb4 <_Objects_Get> 2007954: 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 ) { 2007958: c2 07 bf dc ld [ %fp + -36 ], %g1 200795c: 80 a0 60 00 cmp %g1, 0 2007960: 12 80 00 64 bne 2007af0 <== NEVER TAKEN 2007964: b2 10 00 08 mov %o0, %i1 case OBJECTS_LOCAL: /* First, it verifies if the timer must be stopped */ if ( normalize.it_value.tv_sec == 0 && normalize.it_value.tv_nsec == 0 ) { 2007968: c2 07 bf f8 ld [ %fp + -8 ], %g1 200796c: 80 a0 60 00 cmp %g1, 0 2007970: 12 80 00 05 bne 2007984 2007974: c2 07 bf fc ld [ %fp + -4 ], %g1 2007978: 80 a0 60 00 cmp %g1, 0 200797c: 02 80 00 63 be 2007b08 2007980: 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 ); 2007984: 40 00 10 64 call 200bb14 <_Timespec_To_ticks> 2007988: 90 10 00 1a mov %i2, %o0 200798c: d0 26 60 64 st %o0, [ %i1 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2007990: 40 00 10 61 call 200bb14 <_Timespec_To_ticks> 2007994: 90 07 bf f8 add %fp, -8, %o0 activated = _POSIX_Timer_Insert_helper( 2007998: d4 06 60 08 ld [ %i1 + 8 ], %o2 return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); initial_period = _Timespec_To_ticks( &normalize.it_value ); 200799c: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 20079a0: 98 10 00 19 mov %i1, %o4 20079a4: 90 06 60 10 add %i1, 0x10, %o0 20079a8: 17 00 80 1e sethi %hi(0x2007800), %o3 20079ac: 40 00 1a 20 call 200e22c <_POSIX_Timer_Insert_helper> 20079b0: 96 12 e3 74 or %o3, 0x374, %o3 ! 2007b74 <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 20079b4: 80 8a 20 ff btst 0xff, %o0 20079b8: 02 80 00 27 be 2007a54 20079bc: 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 ) 20079c0: 02 80 00 0b be 20079ec 20079c4: c2 07 bf f0 ld [ %fp + -16 ], %g1 *ovalue = ptimer->timer_data; 20079c8: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 20079cc: c2 26 c0 00 st %g1, [ %i3 ] 20079d0: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 20079d4: c2 26 e0 04 st %g1, [ %i3 + 4 ] 20079d8: c2 06 60 5c ld [ %i1 + 0x5c ], %g1 20079dc: c2 26 e0 08 st %g1, [ %i3 + 8 ] 20079e0: c2 06 60 60 ld [ %i1 + 0x60 ], %g1 20079e4: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 20079e8: c2 07 bf f0 ld [ %fp + -16 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 20079ec: 90 07 bf e0 add %fp, -32, %o0 20079f0: c2 26 60 54 st %g1, [ %i1 + 0x54 ] 20079f4: c2 07 bf f4 ld [ %fp + -12 ], %g1 20079f8: c2 26 60 58 st %g1, [ %i1 + 0x58 ] 20079fc: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007a00: c2 26 60 5c st %g1, [ %i1 + 0x5c ] 2007a04: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a08: c2 26 60 60 st %g1, [ %i1 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2007a0c: 82 10 20 03 mov 3, %g1 2007a10: 40 00 06 a0 call 2009490 <_TOD_Get_as_timestamp> 2007a14: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007a18: f8 1f bf e0 ldd [ %fp + -32 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007a1c: 94 10 20 00 clr %o2 2007a20: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a24: 90 10 00 1c mov %i4, %o0 2007a28: 96 12 e2 00 or %o3, 0x200, %o3 2007a2c: 40 00 4b 82 call 201a834 <__divdi3> 2007a30: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a34: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007a38: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a3c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a40: 90 10 00 1c mov %i4, %o0 2007a44: 96 12 e2 00 or %o3, 0x200, %o3 2007a48: 40 00 4c 66 call 201abe0 <__moddi3> 2007a4c: 92 10 00 1d mov %i5, %o1 2007a50: d2 26 60 70 st %o1, [ %i1 + 0x70 ] _TOD_Get( &ptimer->time ); _Thread_Enable_dispatch(); 2007a54: 40 00 0d 36 call 200af2c <_Thread_Enable_dispatch> 2007a58: b0 10 20 00 clr %i0 2007a5c: 81 c7 e0 08 ret 2007a60: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007a64: 40 00 06 8b call 2009490 <_TOD_Get_as_timestamp> 2007a68: 90 07 bf e0 add %fp, -32, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007a6c: f8 1f bf e0 ldd [ %fp + -32 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007a70: 94 10 20 00 clr %o2 2007a74: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a78: 90 10 00 1c mov %i4, %o0 2007a7c: 96 12 e2 00 or %o3, 0x200, %o3 2007a80: 40 00 4b 6d call 201a834 <__divdi3> 2007a84: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a88: 94 10 20 00 clr %o2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007a8c: d2 27 bf e8 st %o1, [ %fp + -24 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a90: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a94: 90 10 00 1c mov %i4, %o0 2007a98: 96 12 e2 00 or %o3, 0x200, %o3 2007a9c: 40 00 4c 51 call 201abe0 <__moddi3> 2007aa0: 92 10 00 1d mov %i5, %o1 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2007aa4: 90 07 bf f8 add %fp, -8, %o0 2007aa8: d2 27 bf ec st %o1, [ %fp + -20 ] 2007aac: 40 00 0f f4 call 200ba7c <_Timespec_Less_than> 2007ab0: 92 07 bf e8 add %fp, -24, %o1 2007ab4: 80 8a 20 ff btst 0xff, %o0 2007ab8: 12 80 00 0e bne 2007af0 2007abc: 92 07 bf f8 add %fp, -8, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2007ac0: 90 07 bf e8 add %fp, -24, %o0 2007ac4: 40 00 10 00 call 200bac4 <_Timespec_Subtract> 2007ac8: 94 10 00 09 mov %o1, %o2 2007acc: 92 10 00 18 mov %i0, %o1 2007ad0: 11 00 80 7d sethi %hi(0x201f400), %o0 2007ad4: 94 07 bf dc add %fp, -36, %o2 2007ad8: 40 00 09 37 call 2009fb4 <_Objects_Get> 2007adc: 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 ) { 2007ae0: c2 07 bf dc ld [ %fp + -36 ], %g1 2007ae4: 80 a0 60 00 cmp %g1, 0 2007ae8: 02 bf ff a0 be 2007968 2007aec: b2 10 00 08 mov %o0, %i1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2007af0: 40 00 25 b7 call 20111cc <__errno> 2007af4: b0 10 3f ff mov -1, %i0 2007af8: 82 10 20 16 mov 0x16, %g1 2007afc: c2 22 00 00 st %g1, [ %o0 ] } 2007b00: 81 c7 e0 08 ret 2007b04: 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 ); 2007b08: 40 00 11 3f call 200c004 <_Watchdog_Remove> 2007b0c: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2007b10: 80 a6 e0 00 cmp %i3, 0 2007b14: 02 80 00 0b be 2007b40 2007b18: c2 07 bf f0 ld [ %fp + -16 ], %g1 *ovalue = ptimer->timer_data; 2007b1c: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 2007b20: c2 26 c0 00 st %g1, [ %i3 ] 2007b24: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2007b28: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2007b2c: c2 06 60 5c ld [ %i1 + 0x5c ], %g1 2007b30: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2007b34: c2 06 60 60 ld [ %i1 + 0x60 ], %g1 2007b38: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 2007b3c: c2 07 bf f0 ld [ %fp + -16 ], %g1 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; /* Returns with success */ _Thread_Enable_dispatch(); return 0; 2007b40: 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; 2007b44: c2 26 60 54 st %g1, [ %i1 + 0x54 ] 2007b48: c2 07 bf f4 ld [ %fp + -12 ], %g1 2007b4c: c2 26 60 58 st %g1, [ %i1 + 0x58 ] 2007b50: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007b54: c2 26 60 5c st %g1, [ %i1 + 0x5c ] 2007b58: c2 07 bf fc ld [ %fp + -4 ], %g1 2007b5c: c2 26 60 60 st %g1, [ %i1 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2007b60: 82 10 20 04 mov 4, %g1 /* Returns with success */ _Thread_Enable_dispatch(); 2007b64: 40 00 0c f2 call 200af2c <_Thread_Enable_dispatch> 2007b68: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] 2007b6c: 81 c7 e0 08 ret 2007b70: 81 e8 00 00 restore =============================================================================== 02007b1c : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2007b1c: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2007b20: 3b 00 80 83 sethi %hi(0x2020c00), %i5 2007b24: ba 17 62 d8 or %i5, 0x2d8, %i5 ! 2020ed8 <_POSIX_signals_Ualarm_timer> 2007b28: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2007b2c: 80 a0 60 00 cmp %g1, 0 2007b30: 02 80 00 24 be 2007bc0 2007b34: 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 ); 2007b38: 40 00 10 f1 call 200befc <_Watchdog_Remove> 2007b3c: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2007b40: 90 02 3f fe add %o0, -2, %o0 2007b44: 80 a2 20 01 cmp %o0, 1 2007b48: 08 80 00 26 bleu 2007be0 <== ALWAYS TAKEN 2007b4c: 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 ) { 2007b50: 80 a7 20 00 cmp %i4, 0 2007b54: 02 80 00 19 be 2007bb8 2007b58: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2007b5c: 90 10 00 1c mov %i4, %o0 2007b60: 40 00 4e d6 call 201b6b8 <.udiv> 2007b64: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007b68: 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; 2007b6c: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007b70: 40 00 4f 7e call 201b968 <.urem> 2007b74: 90 10 00 1c mov %i4, %o0 2007b78: 87 2a 20 07 sll %o0, 7, %g3 2007b7c: 82 10 00 08 mov %o0, %g1 2007b80: 85 2a 20 02 sll %o0, 2, %g2 2007b84: 84 20 c0 02 sub %g3, %g2, %g2 2007b88: 82 00 80 01 add %g2, %g1, %g1 2007b8c: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 2007b90: 90 07 bf f8 add %fp, -8, %o0 2007b94: 40 00 0f 6e call 200b94c <_Timespec_To_ticks> 2007b98: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2007b9c: 40 00 0f 6c call 200b94c <_Timespec_To_ticks> 2007ba0: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007ba4: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007ba8: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007bac: 11 00 80 81 sethi %hi(0x2020400), %o0 2007bb0: 40 00 10 74 call 200bd80 <_Watchdog_Insert> 2007bb4: 90 12 22 78 or %o0, 0x278, %o0 ! 2020678 <_Watchdog_Ticks_chain> } return remaining; } 2007bb8: 81 c7 e0 08 ret 2007bbc: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007bc0: 03 00 80 1e sethi %hi(0x2007800), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2007bc4: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 2007bc8: 82 10 62 ec or %g1, 0x2ec, %g1 the_watchdog->id = id; 2007bcc: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007bd0: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2007bd4: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2007bd8: 10 bf ff de b 2007b50 2007bdc: 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); 2007be0: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2007be4: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2007be8: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2007bec: 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); 2007bf0: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2007bf4: 40 00 0f 41 call 200b8f8 <_Timespec_From_ticks> 2007bf8: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007bfc: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2007c00: 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; 2007c04: 85 28 60 03 sll %g1, 3, %g2 2007c08: 87 28 60 08 sll %g1, 8, %g3 2007c0c: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 2007c10: 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; 2007c14: b1 28 a0 06 sll %g2, 6, %i0 2007c18: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2007c1c: 40 00 4e a9 call 201b6c0 <.div> 2007c20: 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; 2007c24: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2007c28: 10 bf ff ca b 2007b50 2007c2c: b0 02 00 18 add %o0, %i0, %i0