=============================================================================== 02008678 <_API_extensions_Run_postdriver>: /* * _API_extensions_Run_postdriver */ void _API_extensions_Run_postdriver( void ) { 2008678: 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; 200867c: 39 00 80 7b sethi %hi(0x201ec00), %i4 2008680: fa 07 20 24 ld [ %i4 + 0x24 ], %i5 ! 201ec24 <_API_extensions_List> 2008684: b8 17 20 24 or %i4, 0x24, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 2008688: b8 07 20 04 add %i4, 4, %i4 200868c: 80 a7 40 1c cmp %i5, %i4 2008690: 02 80 00 09 be 20086b4 <_API_extensions_Run_postdriver+0x3c><== NEVER TAKEN 2008694: 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)(); 2008698: c2 07 60 08 ld [ %i5 + 8 ], %g1 200869c: 9f c0 40 00 call %g1 20086a0: 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 ) { 20086a4: 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 ); 20086a8: 80 a7 40 1c cmp %i5, %i4 20086ac: 32 bf ff fc bne,a 200869c <_API_extensions_Run_postdriver+0x24> 20086b0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20086b4: 81 c7 e0 08 ret 20086b8: 81 e8 00 00 restore =============================================================================== 020086bc <_API_extensions_Run_postswitch>: /* * _API_extensions_Run_postswitch */ void _API_extensions_Run_postswitch( void ) { 20086bc: 9d e3 bf a0 save %sp, -96, %sp 20086c0: 39 00 80 7b sethi %hi(0x201ec00), %i4 20086c4: fa 07 20 24 ld [ %i4 + 0x24 ], %i5 ! 201ec24 <_API_extensions_List> 20086c8: b8 17 20 24 or %i4, 0x24, %i4 Chain_Node *the_node; API_extensions_Control *the_extension; for ( the_node = _Chain_First( &_API_extensions_List ); 20086cc: b8 07 20 04 add %i4, 4, %i4 20086d0: 80 a7 40 1c cmp %i5, %i4 20086d4: 02 80 00 0a be 20086fc <_API_extensions_Run_postswitch+0x40><== NEVER TAKEN 20086d8: 37 00 80 7b sethi %hi(0x201ec00), %i3 20086dc: b6 16 e3 70 or %i3, 0x370, %i3 ! 201ef70 <_Per_CPU_Information> !_Chain_Is_tail( &_API_extensions_List, the_node ) ; the_node = the_node->next ) { the_extension = (API_extensions_Control *) the_node; (*the_extension->postswitch_hook)( _Thread_Executing ); 20086e0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20086e4: 9f c0 40 00 call %g1 20086e8: 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 ) { 20086ec: 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 ); 20086f0: 80 a7 40 1c cmp %i5, %i4 20086f4: 32 bf ff fc bne,a 20086e4 <_API_extensions_Run_postswitch+0x28> 20086f8: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20086fc: 81 c7 e0 08 ret 2008700: 81 e8 00 00 restore =============================================================================== 0200ad30 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 200ad30: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 200ad34: 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 ); 200ad38: 7f ff e3 49 call 2003a5c 200ad3c: fa 00 63 ac ld [ %g1 + 0x3ac ], %i5 ! 2021fac <_Per_CPU_Information+0xc> 200ad40: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 200ad44: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 200ad48: 80 a0 60 00 cmp %g1, 0 200ad4c: 02 80 00 2b be 200adf8 <_CORE_RWLock_Release+0xc8> 200ad50: 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 ) { 200ad54: 22 80 00 22 be,a 200addc <_CORE_RWLock_Release+0xac> 200ad58: 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; 200ad5c: 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; 200ad60: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200ad64: 7f ff e3 42 call 2003a6c 200ad68: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 200ad6c: 40 00 08 18 call 200cdcc <_Thread_queue_Dequeue> 200ad70: 90 10 00 18 mov %i0, %o0 if ( next ) { 200ad74: 80 a2 20 00 cmp %o0, 0 200ad78: 22 80 00 24 be,a 200ae08 <_CORE_RWLock_Release+0xd8> 200ad7c: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200ad80: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200ad84: 80 a0 60 01 cmp %g1, 1 200ad88: 02 80 00 22 be 200ae10 <_CORE_RWLock_Release+0xe0> 200ad8c: 84 10 20 01 mov 1, %g2 } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200ad90: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200ad94: 82 00 60 01 inc %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200ad98: c4 26 20 44 st %g2, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 200ad9c: 10 80 00 09 b 200adc0 <_CORE_RWLock_Release+0x90> 200ada0: 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 || 200ada4: 80 a0 60 01 cmp %g1, 1 200ada8: 02 80 00 0b be 200add4 <_CORE_RWLock_Release+0xa4> <== NEVER TAKEN 200adac: 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; 200adb0: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200adb4: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 200adb8: 40 00 09 15 call 200d20c <_Thread_queue_Extract> 200adbc: 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 ); 200adc0: 40 00 09 64 call 200d350 <_Thread_queue_First> 200adc4: 90 10 00 18 mov %i0, %o0 if ( !next || 200adc8: 92 92 20 00 orcc %o0, 0, %o1 200adcc: 32 bf ff f6 bne,a 200ada4 <_CORE_RWLock_Release+0x74> 200add0: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200add4: 81 c7 e0 08 ret 200add8: 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; 200addc: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200ade0: 80 a0 60 00 cmp %g1, 0 200ade4: 02 bf ff de be 200ad5c <_CORE_RWLock_Release+0x2c> 200ade8: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 200adec: 7f ff e3 20 call 2003a6c 200adf0: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 200adf4: 30 80 00 05 b,a 200ae08 <_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 ); 200adf8: 7f ff e3 1d call 2003a6c 200adfc: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200ae00: 82 10 20 02 mov 2, %g1 200ae04: c2 27 60 34 st %g1, [ %i5 + 0x34 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200ae08: 81 c7 e0 08 ret 200ae0c: 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; 200ae10: 82 10 20 02 mov 2, %g1 200ae14: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200ae18: 81 c7 e0 08 ret 200ae1c: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200ae20 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200ae20: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200ae24: 90 10 00 18 mov %i0, %o0 200ae28: 40 00 07 0e call 200ca60 <_Thread_Get> 200ae2c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200ae30: c2 07 bf fc ld [ %fp + -4 ], %g1 200ae34: 80 a0 60 00 cmp %g1, 0 200ae38: 12 80 00 09 bne 200ae5c <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 200ae3c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200ae40: 40 00 09 86 call 200d458 <_Thread_queue_Process_timeout> 200ae44: 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--; 200ae48: 03 00 80 86 sethi %hi(0x2021800), %g1 200ae4c: c4 00 62 60 ld [ %g1 + 0x260 ], %g2 ! 2021a60 <_Thread_Dispatch_disable_level> 200ae50: 84 00 bf ff add %g2, -1, %g2 200ae54: c4 20 62 60 st %g2, [ %g1 + 0x260 ] return _Thread_Dispatch_disable_level; 200ae58: c2 00 62 60 ld [ %g1 + 0x260 ], %g1 200ae5c: 81 c7 e0 08 ret 200ae60: 81 e8 00 00 restore =============================================================================== 02011a08 <_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 ) { 2011a08: 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; 2011a0c: 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; 2011a10: 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; 2011a14: 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; 2011a18: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 2011a1c: c0 26 20 64 clr [ %i0 + 0x64 ] /* * Round size up to multiple of a pointer for chain init and * check for overflow on adding overhead to each message. */ allocated_message_size = maximum_message_size; if (allocated_message_size & (sizeof(uint32_t) - 1)) { 2011a20: 80 8e e0 03 btst 3, %i3 2011a24: 02 80 00 0a be 2011a4c <_CORE_message_queue_Initialize+0x44> 2011a28: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 2011a2c: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 2011a30: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 2011a34: 80 a6 c0 1c cmp %i3, %i4 2011a38: 08 80 00 05 bleu 2011a4c <_CORE_message_queue_Initialize+0x44><== ALWAYS TAKEN 2011a3c: ba 10 20 00 clr %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011a40: b0 0f 60 01 and %i5, 1, %i0 2011a44: 81 c7 e0 08 ret 2011a48: 81 e8 00 00 restore /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 2011a4c: b8 07 20 14 add %i4, 0x14, %i4 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 2011a50: 90 10 20 00 clr %o0 2011a54: 92 10 00 1a mov %i2, %o1 2011a58: 94 10 20 00 clr %o2 2011a5c: 96 10 00 1c mov %i4, %o3 2011a60: 40 00 45 56 call 2022fb8 <__muldi3> 2011a64: ba 10 20 00 clr %i5 if ( x > SIZE_MAX ) 2011a68: 80 a2 20 00 cmp %o0, 0 2011a6c: 34 bf ff f6 bg,a 2011a44 <_CORE_message_queue_Initialize+0x3c> 2011a70: b0 0f 60 01 and %i5, 1, %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 2011a74: 40 00 0c ea call 2014e1c <_Workspace_Allocate> 2011a78: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 2011a7c: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 2011a80: 80 a2 20 00 cmp %o0, 0 2011a84: 02 bf ff ef be 2011a40 <_CORE_message_queue_Initialize+0x38> 2011a88: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 2011a8c: 90 06 20 68 add %i0, 0x68, %o0 2011a90: 94 10 00 1a mov %i2, %o2 2011a94: 7f ff ff c3 call 20119a0 <_Chain_Initialize> 2011a98: 96 10 00 1c mov %i4, %o3 allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 2011a9c: 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 ); 2011aa0: 82 06 20 50 add %i0, 0x50, %g1 2011aa4: 84 18 a0 01 xor %g2, 1, %g2 2011aa8: 80 a0 00 02 cmp %g0, %g2 2011aac: 84 06 20 54 add %i0, 0x54, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2011ab0: 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; 2011ab4: c4 26 20 50 st %g2, [ %i0 + 0x50 ] 2011ab8: 90 10 00 18 mov %i0, %o0 head->previous = NULL; 2011abc: c0 26 20 54 clr [ %i0 + 0x54 ] 2011ac0: 92 60 3f ff subx %g0, -1, %o1 2011ac4: 94 10 20 80 mov 0x80, %o2 2011ac8: 96 10 20 06 mov 6, %o3 2011acc: 40 00 0a 7a call 20144b4 <_Thread_queue_Initialize> 2011ad0: ba 10 20 01 mov 1, %i5 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 2011ad4: b0 0f 60 01 and %i5, 1, %i0 2011ad8: 81 c7 e0 08 ret 2011adc: 81 e8 00 00 restore =============================================================================== 02008c60 <_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 ) { 2008c60: 9d e3 bf a0 save %sp, -96, %sp 2008c64: ba 10 00 18 mov %i0, %i5 Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008c68: b0 10 20 00 clr %i0 if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2008c6c: 40 00 07 de call 200abe4 <_Thread_queue_Dequeue> 2008c70: 90 10 00 1d mov %i5, %o0 2008c74: 80 a2 20 00 cmp %o0, 0 2008c78: 02 80 00 04 be 2008c88 <_CORE_semaphore_Surrender+0x28> 2008c7c: 01 00 00 00 nop status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); } return status; } 2008c80: 81 c7 e0 08 ret 2008c84: 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 ); 2008c88: 7f ff e6 8c call 20026b8 2008c8c: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2008c90: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2008c94: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2008c98: 80 a0 40 02 cmp %g1, %g2 2008c9c: 1a 80 00 05 bcc 2008cb0 <_CORE_semaphore_Surrender+0x50> <== NEVER TAKEN 2008ca0: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2008ca4: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2008ca8: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2008cac: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2008cb0: 7f ff e6 86 call 20026c8 2008cb4: 01 00 00 00 nop } return status; } 2008cb8: 81 c7 e0 08 ret 2008cbc: 81 e8 00 00 restore =============================================================================== 02008850 <_Chain_Initialize>: Chain_Control *the_chain, void *starting_address, size_t number_nodes, size_t node_size ) { 2008850: 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; 2008854: 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 ); 2008858: ba 06 20 04 add %i0, 4, %i5 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200885c: 80 a6 a0 00 cmp %i2, 0 2008860: 02 80 00 12 be 20088a8 <_Chain_Initialize+0x58> <== NEVER TAKEN 2008864: 90 10 00 18 mov %i0, %o0 2008868: b4 06 bf ff add %i2, -1, %i2 { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; Chain_Node *next = starting_address; 200886c: 82 10 00 19 mov %i1, %g1 head->previous = NULL; while ( count-- ) { 2008870: 92 10 00 1a mov %i2, %o1 ) { size_t count = number_nodes; Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); Chain_Node *current = head; 2008874: 10 80 00 05 b 2008888 <_Chain_Initialize+0x38> 2008878: 84 10 00 18 mov %i0, %g2 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 200887c: 84 10 00 01 mov %g1, %g2 2008880: b4 06 bf ff add %i2, -1, %i2 current->next = next; next->previous = current; current = next; next = (Chain_Node *) 2008884: 82 10 00 03 mov %g3, %g1 Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { current->next = next; 2008888: c2 20 80 00 st %g1, [ %g2 ] next->previous = current; 200888c: c4 20 60 04 st %g2, [ %g1 + 4 ] Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 2008890: 80 a6 a0 00 cmp %i2, 0 2008894: 12 bf ff fa bne 200887c <_Chain_Initialize+0x2c> 2008898: 86 00 40 1b add %g1, %i3, %g3 * node_size - size of node in bytes * * Output parameters: NONE */ void _Chain_Initialize( 200889c: 40 00 43 11 call 20194e0 <.umul> 20088a0: 90 10 00 1b mov %i3, %o0 Chain_Node *current = head; Chain_Node *next = starting_address; head->previous = NULL; while ( count-- ) { 20088a4: 90 06 40 08 add %i1, %o0, %o0 current = next; next = (Chain_Node *) _Addresses_Add_offset( (void *) next, node_size ); } current->next = tail; 20088a8: fa 22 00 00 st %i5, [ %o0 ] tail->previous = current; 20088ac: d0 26 20 08 st %o0, [ %i0 + 8 ] } 20088b0: 81 c7 e0 08 ret 20088b4: 81 e8 00 00 restore =============================================================================== 0200788c <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 200788c: 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 ]; 2007890: fa 06 21 58 ld [ %i0 + 0x158 ], %i5 option_set = (rtems_option) the_thread->Wait.option; _ISR_Disable( level ); 2007894: 7f ff eb 89 call 20026b8 2007898: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 pending_events = api->pending_events; 200789c: c4 07 40 00 ld [ %i5 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 20078a0: 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 ) ) { 20078a4: 86 88 40 02 andcc %g1, %g2, %g3 20078a8: 02 80 00 39 be 200798c <_Event_Surrender+0x100> 20078ac: 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() && 20078b0: 88 11 23 70 or %g4, 0x370, %g4 ! 201ef70 <_Per_CPU_Information> 20078b4: f2 01 20 08 ld [ %g4 + 8 ], %i1 20078b8: 80 a6 60 00 cmp %i1, 0 20078bc: 32 80 00 1c bne,a 200792c <_Event_Surrender+0xa0> 20078c0: 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); 20078c4: 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 ) ) { 20078c8: 80 89 21 00 btst 0x100, %g4 20078cc: 02 80 00 30 be 200798c <_Event_Surrender+0x100> 20078d0: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20078d4: 02 80 00 04 be 20078e4 <_Event_Surrender+0x58> 20078d8: 80 8f 20 02 btst 2, %i4 20078dc: 02 80 00 2c be 200798c <_Event_Surrender+0x100> <== NEVER TAKEN 20078e0: 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; 20078e4: 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) ); 20078e8: 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 ); 20078ec: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 20078f0: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20078f4: c6 20 40 00 st %g3, [ %g1 ] _ISR_Flash( level ); 20078f8: 7f ff eb 74 call 20026c8 20078fc: 01 00 00 00 nop 2007900: 7f ff eb 6e call 20026b8 2007904: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2007908: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200790c: 80 a0 60 02 cmp %g1, 2 2007910: 02 80 00 21 be 2007994 <_Event_Surrender+0x108> 2007914: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2007918: 7f ff eb 6c call 20026c8 200791c: 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 ); 2007920: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 2007924: 40 00 0a d6 call 200a47c <_Thread_Clear_state> 2007928: 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() && 200792c: 80 a6 00 04 cmp %i0, %g4 2007930: 32 bf ff e6 bne,a 20078c8 <_Event_Surrender+0x3c> 2007934: c8 06 20 10 ld [ %i0 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2007938: 09 00 80 7c sethi %hi(0x201f000), %g4 200793c: f2 01 23 70 ld [ %g4 + 0x370 ], %i1 ! 201f370 <_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 ) && 2007940: 80 a6 60 02 cmp %i1, 2 2007944: 02 80 00 07 be 2007960 <_Event_Surrender+0xd4> <== NEVER TAKEN 2007948: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 200794c: f2 01 23 70 ld [ %g4 + 0x370 ], %i1 * If we are in an ISR and sending to the current thread, then * we have a critical section issue to deal with. */ if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2007950: 80 a6 60 01 cmp %i1, 1 2007954: 32 bf ff dd bne,a 20078c8 <_Event_Surrender+0x3c> 2007958: 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) ) { 200795c: 80 a0 40 03 cmp %g1, %g3 2007960: 02 80 00 04 be 2007970 <_Event_Surrender+0xe4> 2007964: 80 8f 20 02 btst 2, %i4 2007968: 02 80 00 09 be 200798c <_Event_Surrender+0x100> <== NEVER TAKEN 200796c: 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; 2007970: c2 06 20 28 ld [ %i0 + 0x28 ], %g1 2007974: 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 ); 2007978: c4 27 40 00 st %g2, [ %i5 ] the_thread->Wait.count = 0; 200797c: c0 26 20 24 clr [ %i0 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2007980: c6 20 40 00 st %g3, [ %g1 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2007984: 82 10 20 03 mov 3, %g1 2007988: c2 21 23 70 st %g1, [ %g4 + 0x370 ] _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 200798c: 7f ff eb 4f call 20026c8 2007990: 91 e8 00 08 restore %g0, %o0, %o0 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2007994: 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 ); 2007998: 7f ff eb 4c call 20026c8 200799c: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 20079a0: 40 00 0f 8f call 200b7dc <_Watchdog_Remove> 20079a4: 90 06 20 48 add %i0, 0x48, %o0 20079a8: b2 16 63 f8 or %i1, 0x3f8, %i1 20079ac: 40 00 0a b4 call 200a47c <_Thread_Clear_state> 20079b0: 81 e8 00 00 restore =============================================================================== 020079b4 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 20079b4: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 20079b8: 90 10 00 18 mov %i0, %o0 20079bc: 40 00 0b af call 200a878 <_Thread_Get> 20079c0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20079c4: c2 07 bf fc ld [ %fp + -4 ], %g1 20079c8: 80 a0 60 00 cmp %g1, 0 20079cc: 12 80 00 16 bne 2007a24 <_Event_Timeout+0x70> <== NEVER TAKEN 20079d0: 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 ); 20079d4: 7f ff eb 39 call 20026b8 20079d8: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20079dc: 03 00 80 7b sethi %hi(0x201ec00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 20079e0: c2 00 63 7c ld [ %g1 + 0x37c ], %g1 ! 201ef7c <_Per_CPU_Information+0xc> 20079e4: 80 a7 40 01 cmp %i5, %g1 20079e8: 02 80 00 11 be 2007a2c <_Event_Timeout+0x78> 20079ec: 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; 20079f0: 82 10 20 06 mov 6, %g1 20079f4: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20079f8: 7f ff eb 34 call 20026c8 20079fc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2007a00: 90 10 00 1d mov %i5, %o0 2007a04: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007a08: 40 00 0a 9d call 200a47c <_Thread_Clear_state> 2007a0c: 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--; 2007a10: 03 00 80 7a sethi %hi(0x201e800), %g1 2007a14: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201ea30 <_Thread_Dispatch_disable_level> 2007a18: 84 00 bf ff add %g2, -1, %g2 2007a1c: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 2007a20: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 2007a24: 81 c7 e0 08 ret 2007a28: 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 ) 2007a2c: 03 00 80 7c sethi %hi(0x201f000), %g1 2007a30: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 201f370 <_Event_Sync_state> 2007a34: 80 a0 a0 01 cmp %g2, 1 2007a38: 32 bf ff ef bne,a 20079f4 <_Event_Timeout+0x40> 2007a3c: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2007a40: 84 10 20 02 mov 2, %g2 2007a44: c4 20 63 70 st %g2, [ %g1 + 0x370 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2007a48: 10 bf ff eb b 20079f4 <_Event_Timeout+0x40> 2007a4c: 82 10 20 06 mov 6, %g1 =============================================================================== 0200e09c <_Heap_Allocate_aligned_with_boundary>: Heap_Control *heap, uintptr_t alloc_size, uintptr_t alignment, uintptr_t boundary ) { 200e09c: 9d e3 bf 98 save %sp, -104, %sp 200e0a0: ba 10 00 18 mov %i0, %i5 Heap_Statistics *const stats = &heap->stats; uintptr_t const block_size_floor = alloc_size + HEAP_BLOCK_HEADER_SIZE 200e0a4: a0 06 60 04 add %i1, 4, %l0 - HEAP_ALLOC_BONUS; uintptr_t const page_size = heap->page_size; 200e0a8: ec 06 20 10 ld [ %i0 + 0x10 ], %l6 Heap_Block *block = NULL; uintptr_t alloc_begin = 0; uint32_t search_count = 0; bool search_again = false; if ( block_size_floor < alloc_size ) { 200e0ac: 80 a6 40 10 cmp %i1, %l0 200e0b0: 18 80 00 23 bgu 200e13c <_Heap_Allocate_aligned_with_boundary+0xa0> 200e0b4: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { 200e0b8: 80 a6 e0 00 cmp %i3, 0 200e0bc: 12 80 00 7d bne 200e2b0 <_Heap_Allocate_aligned_with_boundary+0x214> 200e0c0: 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; 200e0c4: e2 07 60 08 ld [ %i5 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e0c8: 80 a7 40 11 cmp %i5, %l1 200e0cc: 02 80 00 18 be 200e12c <_Heap_Allocate_aligned_with_boundary+0x90> 200e0d0: b8 10 20 00 clr %i4 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e0d4: 82 05 a0 07 add %l6, 7, %g1 + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e0d8: ae 10 20 04 mov 4, %l7 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e0dc: c2 27 bf fc st %g1, [ %fp + -4 ] + HEAP_BLOCK_HEADER_SIZE + page_size - 1; uintptr_t alloc_end = block_end + HEAP_ALLOC_BONUS; 200e0e0: 10 80 00 0b b 200e10c <_Heap_Allocate_aligned_with_boundary+0x70> 200e0e4: ae 25 c0 19 sub %l7, %i1, %l7 * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { if ( alignment == 0 ) { 200e0e8: 12 80 00 17 bne 200e144 <_Heap_Allocate_aligned_with_boundary+0xa8> 200e0ec: b0 04 60 08 add %l1, 8, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e0f0: 80 a6 20 00 cmp %i0, 0 200e0f4: 12 80 00 5b bne 200e260 <_Heap_Allocate_aligned_with_boundary+0x1c4> 200e0f8: b8 07 20 01 inc %i4 break; } block = block->next; 200e0fc: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e100: 80 a7 40 11 cmp %i5, %l1 200e104: 22 80 00 0b be,a 200e130 <_Heap_Allocate_aligned_with_boundary+0x94> 200e108: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 /* * The HEAP_PREV_BLOCK_USED flag is always set in the block size_and_flag * field. Thus the value is about one unit larger than the real block * size. The greater than operator takes this into account. */ if ( block->size_and_flag > block_size_floor ) { 200e10c: e4 04 60 04 ld [ %l1 + 4 ], %l2 200e110: 80 a4 00 12 cmp %l0, %l2 200e114: 0a bf ff f5 bcs 200e0e8 <_Heap_Allocate_aligned_with_boundary+0x4c> 200e118: 80 a6 a0 00 cmp %i2, 0 if ( alloc_begin != 0 ) { break; } block = block->next; 200e11c: e2 04 60 08 ld [ %l1 + 8 ], %l1 do { Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); block = _Heap_Free_list_first( heap ); while ( block != free_list_tail ) { 200e120: 80 a7 40 11 cmp %i5, %l1 200e124: 12 bf ff fa bne 200e10c <_Heap_Allocate_aligned_with_boundary+0x70> 200e128: b8 07 20 01 inc %i4 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e12c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200e130: 80 a0 40 1c cmp %g1, %i4 200e134: 0a 80 00 5a bcs 200e29c <_Heap_Allocate_aligned_with_boundary+0x200> 200e138: b0 10 20 00 clr %i0 stats->max_search = search_count; } return (void *) alloc_begin; } 200e13c: 81 c7 e0 08 ret 200e140: 81 e8 00 00 restore uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200e144: c4 07 bf fc ld [ %fp + -4 ], %g2 uintptr_t alignment, uintptr_t boundary ) { uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; 200e148: ea 07 60 14 ld [ %i5 + 0x14 ], %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e14c: a4 0c bf fe and %l2, -2, %l2 uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size + HEAP_BLOCK_HEADER_SIZE + page_size - 1; 200e150: 82 20 80 15 sub %g2, %l5, %g1 uintptr_t const page_size = heap->page_size; uintptr_t const min_block_size = heap->min_block_size; uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; 200e154: a4 04 40 12 add %l1, %l2, %l2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e158: 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; 200e15c: b0 05 c0 12 add %l7, %l2, %i0 uintptr_t const block_begin = (uintptr_t) block; uintptr_t const block_size = _Heap_Block_size( block ); uintptr_t const block_end = block_begin + block_size; uintptr_t const alloc_begin_floor = _Heap_Alloc_area_of_block( block ); uintptr_t const alloc_begin_ceiling = block_end - min_block_size 200e160: a4 00 40 12 add %g1, %l2, %l2 200e164: 40 00 2d c5 call 2019878 <.urem> 200e168: 90 10 00 18 mov %i0, %o0 200e16c: 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 ) { 200e170: 80 a4 80 18 cmp %l2, %i0 200e174: 1a 80 00 06 bcc 200e18c <_Heap_Allocate_aligned_with_boundary+0xf0> 200e178: a8 04 60 08 add %l1, 8, %l4 200e17c: 90 10 00 12 mov %l2, %o0 200e180: 40 00 2d be call 2019878 <.urem> 200e184: 92 10 00 1a mov %i2, %o1 200e188: b0 24 80 08 sub %l2, %o0, %i0 } alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { 200e18c: 80 a6 e0 00 cmp %i3, 0 200e190: 02 80 00 24 be 200e220 <_Heap_Allocate_aligned_with_boundary+0x184> 200e194: 80 a5 00 18 cmp %l4, %i0 /* Ensure that the we have a valid new block at the end */ if ( alloc_begin > alloc_begin_ceiling ) { alloc_begin = _Heap_Align_down( alloc_begin_ceiling, alignment ); } alloc_end = alloc_begin + alloc_size; 200e198: a4 06 00 19 add %i0, %i1, %l2 200e19c: 92 10 00 1b mov %i3, %o1 200e1a0: 40 00 2d b6 call 2019878 <.urem> 200e1a4: 90 10 00 12 mov %l2, %o0 200e1a8: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e1ac: 80 a6 00 08 cmp %i0, %o0 200e1b0: 1a 80 00 1b bcc 200e21c <_Heap_Allocate_aligned_with_boundary+0x180> 200e1b4: 80 a2 00 12 cmp %o0, %l2 200e1b8: 1a 80 00 1a bcc 200e220 <_Heap_Allocate_aligned_with_boundary+0x184> 200e1bc: 80 a5 00 18 cmp %l4, %i0 alloc_end = alloc_begin + alloc_size; /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; 200e1c0: a6 05 00 19 add %l4, %i1, %l3 uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { if ( boundary_line < boundary_floor ) { 200e1c4: 80 a4 c0 08 cmp %l3, %o0 200e1c8: 08 80 00 08 bleu 200e1e8 <_Heap_Allocate_aligned_with_boundary+0x14c> 200e1cc: b0 10 20 00 clr %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e1d0: 10 bf ff c9 b 200e0f4 <_Heap_Allocate_aligned_with_boundary+0x58> 200e1d4: 80 a6 20 00 cmp %i0, 0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e1d8: 1a 80 00 11 bcc 200e21c <_Heap_Allocate_aligned_with_boundary+0x180> 200e1dc: 80 a4 c0 08 cmp %l3, %o0 if ( boundary_line < boundary_floor ) { 200e1e0: 18 bf ff c4 bgu 200e0f0 <_Heap_Allocate_aligned_with_boundary+0x54><== NEVER TAKEN 200e1e4: b0 10 20 00 clr %i0 return 0; } alloc_begin = boundary_line - alloc_size; 200e1e8: b0 22 00 19 sub %o0, %i1, %i0 200e1ec: 92 10 00 1a mov %i2, %o1 200e1f0: 40 00 2d a2 call 2019878 <.urem> 200e1f4: 90 10 00 18 mov %i0, %o0 200e1f8: 92 10 00 1b mov %i3, %o1 200e1fc: b0 26 00 08 sub %i0, %o0, %i0 alloc_begin = _Heap_Align_down( alloc_begin, alignment ); alloc_end = alloc_begin + alloc_size; 200e200: a4 06 00 19 add %i0, %i1, %l2 200e204: 40 00 2d 9d call 2019878 <.urem> 200e208: 90 10 00 12 mov %l2, %o0 200e20c: 90 24 80 08 sub %l2, %o0, %o0 /* Ensure boundary constaint */ if ( boundary != 0 ) { uintptr_t const boundary_floor = alloc_begin_floor + alloc_size; uintptr_t boundary_line = _Heap_Align_down( alloc_end, boundary ); while ( alloc_begin < boundary_line && boundary_line < alloc_end ) { 200e210: 80 a2 00 12 cmp %o0, %l2 200e214: 0a bf ff f1 bcs 200e1d8 <_Heap_Allocate_aligned_with_boundary+0x13c> 200e218: 80 a6 00 08 cmp %i0, %o0 boundary_line = _Heap_Align_down( alloc_end, boundary ); } } /* Ensure that the we have a valid new block at the beginning */ if ( alloc_begin >= alloc_begin_floor ) { 200e21c: 80 a5 00 18 cmp %l4, %i0 200e220: 18 80 00 22 bgu 200e2a8 <_Heap_Allocate_aligned_with_boundary+0x20c> 200e224: 82 10 3f f8 mov -8, %g1 200e228: 90 10 00 18 mov %i0, %o0 200e22c: a4 20 40 11 sub %g1, %l1, %l2 200e230: 92 10 00 16 mov %l6, %o1 200e234: 40 00 2d 91 call 2019878 <.urem> 200e238: 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 ) { 200e23c: 90 a4 80 08 subcc %l2, %o0, %o0 200e240: 02 bf ff ad be 200e0f4 <_Heap_Allocate_aligned_with_boundary+0x58> 200e244: 80 a6 20 00 cmp %i0, 0 200e248: 80 a2 00 15 cmp %o0, %l5 return alloc_begin; } } return 0; 200e24c: 82 40 3f ff addx %g0, -1, %g1 200e250: b0 0e 00 01 and %i0, %g1, %i0 } /* Statistics */ ++search_count; if ( alloc_begin != 0 ) { 200e254: 80 a6 20 00 cmp %i0, 0 200e258: 02 bf ff a9 be 200e0fc <_Heap_Allocate_aligned_with_boundary+0x60> 200e25c: 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; 200e260: c4 07 60 48 ld [ %i5 + 0x48 ], %g2 stats->searches += search_count; 200e264: c2 07 60 4c ld [ %i5 + 0x4c ], %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e268: 84 00 a0 01 inc %g2 stats->searches += search_count; 200e26c: 82 00 40 1c add %g1, %i4, %g1 search_again = _Heap_Protection_free_delayed_blocks( heap, alloc_begin ); } while ( search_again ); if ( alloc_begin != 0 ) { /* Statistics */ ++stats->allocs; 200e270: c4 27 60 48 st %g2, [ %i5 + 0x48 ] stats->searches += search_count; 200e274: c2 27 60 4c st %g1, [ %i5 + 0x4c ] block = _Heap_Block_allocate( heap, block, alloc_begin, alloc_size ); 200e278: 90 10 00 1d mov %i5, %o0 200e27c: 92 10 00 11 mov %l1, %o1 200e280: 94 10 00 18 mov %i0, %o2 200e284: 7f ff eb 9e call 20090fc <_Heap_Block_allocate> 200e288: 96 10 00 19 mov %i1, %o3 boundary ); } /* Statistics */ if ( stats->max_search < search_count ) { 200e28c: c2 07 60 44 ld [ %i5 + 0x44 ], %g1 200e290: 80 a0 40 1c cmp %g1, %i4 200e294: 1a 80 00 03 bcc 200e2a0 <_Heap_Allocate_aligned_with_boundary+0x204> 200e298: 01 00 00 00 nop stats->max_search = search_count; 200e29c: f8 27 60 44 st %i4, [ %i5 + 0x44 ] } return (void *) alloc_begin; } 200e2a0: 81 c7 e0 08 ret 200e2a4: 81 e8 00 00 restore if ( free_size >= min_block_size || free_size == 0 ) { return alloc_begin; } } return 0; 200e2a8: 10 bf ff 92 b 200e0f0 <_Heap_Allocate_aligned_with_boundary+0x54> 200e2ac: b0 10 20 00 clr %i0 /* Integer overflow occured */ return NULL; } if ( boundary != 0 ) { if ( boundary < alloc_size ) { 200e2b0: 18 bf ff a3 bgu 200e13c <_Heap_Allocate_aligned_with_boundary+0xa0> 200e2b4: 80 a6 a0 00 cmp %i2, 0 return NULL; } if ( alignment == 0 ) { 200e2b8: 22 bf ff 83 be,a 200e0c4 <_Heap_Allocate_aligned_with_boundary+0x28> 200e2bc: b4 10 00 16 mov %l6, %i2 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 200e2c0: 10 bf ff 82 b 200e0c8 <_Heap_Allocate_aligned_with_boundary+0x2c> 200e2c4: e2 07 60 08 ld [ %i5 + 8 ], %l1 =============================================================================== 0200e2dc <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200e2dc: 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; 200e2e0: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200e2e4: 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; 200e2e8: ba 06 40 1a add %i1, %i2, %i5 uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { Heap_Statistics *const stats = &heap->stats; Heap_Block *const first_block = heap->first_block; 200e2ec: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200e2f0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 200e2f4: d6 06 20 14 ld [ %i0 + 0x14 ], %o3 uintptr_t const extend_area_begin = (uintptr_t) extend_area_begin_ptr; uintptr_t const extend_area_end = extend_area_begin + extend_area_size; uintptr_t const free_size = stats->free_size; 200e2f8: e4 06 20 30 ld [ %i0 + 0x30 ], %l2 uintptr_t extend_first_block_size = 0; uintptr_t extended_size = 0; bool extend_area_ok = false; if ( extend_area_end < extend_area_begin ) { 200e2fc: 80 a6 40 1d cmp %i1, %i5 200e300: 08 80 00 05 bleu 200e314 <_Heap_Extend+0x38> 200e304: a2 10 20 00 clr %l1 if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; } 200e308: b0 0c 60 01 and %l1, 1, %i0 200e30c: 81 c7 e0 08 ret 200e310: 81 e8 00 00 restore if ( extend_area_end < extend_area_begin ) { return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200e314: 90 10 00 19 mov %i1, %o0 200e318: 92 10 00 1a mov %i2, %o1 200e31c: 94 10 00 10 mov %l0, %o2 200e320: 98 07 bf f8 add %fp, -8, %o4 200e324: 7f ff eb 17 call 2008f80 <_Heap_Get_first_and_last_block> 200e328: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200e32c: 80 8a 20 ff btst 0xff, %o0 200e330: 02 bf ff f6 be 200e308 <_Heap_Extend+0x2c> 200e334: aa 10 20 00 clr %l5 200e338: a2 10 00 1c mov %i4, %l1 200e33c: ac 10 20 00 clr %l6 200e340: a6 10 20 00 clr %l3 200e344: 10 80 00 14 b 200e394 <_Heap_Extend+0xb8> 200e348: 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 ) { 200e34c: 2a 80 00 02 bcs,a 200e354 <_Heap_Extend+0x78> 200e350: ac 10 00 11 mov %l1, %l6 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e354: 90 10 00 1a mov %i2, %o0 200e358: 40 00 2e 0f call 2019b94 <.urem> 200e35c: 92 10 00 10 mov %l0, %o1 200e360: 82 06 bf f8 add %i2, -8, %g1 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e364: 80 a6 80 19 cmp %i2, %i1 200e368: 02 80 00 1c be 200e3d8 <_Heap_Extend+0xfc> 200e36c: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200e370: 80 a6 40 1a cmp %i1, %i2 200e374: 38 80 00 02 bgu,a 200e37c <_Heap_Extend+0xa0> 200e378: aa 10 00 01 mov %g1, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e37c: e2 00 60 04 ld [ %g1 + 4 ], %l1 200e380: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e384: a2 00 40 11 add %g1, %l1, %l1 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e388: 80 a7 00 11 cmp %i4, %l1 200e38c: 22 80 00 1b be,a 200e3f8 <_Heap_Extend+0x11c> 200e390: 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; 200e394: 80 a4 40 1c cmp %l1, %i4 200e398: 02 80 00 66 be 200e530 <_Heap_Extend+0x254> 200e39c: 82 10 00 11 mov %l1, %g1 uintptr_t const sub_area_end = start_block->prev_size; Heap_Block *const end_block = _Heap_Block_of_alloc_area( sub_area_end, page_size ); if ( 200e3a0: 80 a0 40 1d cmp %g1, %i5 200e3a4: 0a 80 00 70 bcs 200e564 <_Heap_Extend+0x288> 200e3a8: f4 04 40 00 ld [ %l1 ], %i2 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200e3ac: 80 a0 40 1d cmp %g1, %i5 200e3b0: 12 bf ff e7 bne 200e34c <_Heap_Extend+0x70> 200e3b4: 80 a7 40 1a cmp %i5, %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e3b8: 90 10 00 1a mov %i2, %o0 200e3bc: 40 00 2d f6 call 2019b94 <.urem> 200e3c0: 92 10 00 10 mov %l0, %o1 200e3c4: 82 06 bf f8 add %i2, -8, %g1 200e3c8: a8 10 00 11 mov %l1, %l4 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200e3cc: 80 a6 80 19 cmp %i2, %i1 200e3d0: 12 bf ff e8 bne 200e370 <_Heap_Extend+0x94> <== ALWAYS TAKEN 200e3d4: 82 20 40 08 sub %g1, %o0, %g1 start_block->prev_size = extend_area_end; 200e3d8: fa 24 40 00 st %i5, [ %l1 ] - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e3dc: e2 00 60 04 ld [ %g1 + 4 ], %l1 200e3e0: a2 0c 7f fe and %l1, -2, %l1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e3e4: a2 00 40 11 add %g1, %l1, %l1 } else if ( sub_area_end < extend_area_begin ) { link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200e3e8: 80 a7 00 11 cmp %i4, %l1 200e3ec: 12 bf ff ea bne 200e394 <_Heap_Extend+0xb8> <== NEVER TAKEN 200e3f0: a6 10 00 01 mov %g1, %l3 if ( extend_area_begin < heap->area_begin ) { 200e3f4: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200e3f8: 80 a6 40 01 cmp %i1, %g1 200e3fc: 3a 80 00 55 bcc,a 200e550 <_Heap_Extend+0x274> 200e400: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200e404: 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; 200e408: c2 07 bf f8 ld [ %fp + -8 ], %g1 200e40c: 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 ) { 200e410: 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 = 200e414: 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; 200e418: fa 20 40 00 st %i5, [ %g1 ] extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200e41c: b8 10 e0 01 or %g3, 1, %i4 extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = 200e420: f8 20 60 04 st %i4, [ %g1 + 4 ] extend_first_block_size | HEAP_PREV_BLOCK_USED; _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200e424: 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 ) { 200e428: 80 a1 00 01 cmp %g4, %g1 200e42c: 08 80 00 43 bleu 200e538 <_Heap_Extend+0x25c> 200e430: c0 20 a0 04 clr [ %g2 + 4 ] heap->first_block = extend_first_block; 200e434: 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 ) { 200e438: 80 a5 20 00 cmp %l4, 0 200e43c: 02 80 00 63 be 200e5c8 <_Heap_Extend+0x2ec> 200e440: 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; 200e444: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200e448: 92 10 00 1c mov %i4, %o1 200e44c: 40 00 2d d2 call 2019b94 <.urem> 200e450: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200e454: 80 a2 20 00 cmp %o0, 0 200e458: 02 80 00 04 be 200e468 <_Heap_Extend+0x18c> 200e45c: c4 05 00 00 ld [ %l4 ], %g2 return value - remainder + alignment; 200e460: b2 06 40 1c add %i1, %i4, %i1 200e464: 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 = 200e468: 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; 200e46c: 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 = 200e470: 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; 200e474: 84 10 a0 01 or %g2, 1, %g2 _Heap_Free_block( heap, new_first_block ); 200e478: 90 10 00 18 mov %i0, %o0 200e47c: 92 10 00 01 mov %g1, %o1 200e480: 7f ff ff 8d call 200e2b4 <_Heap_Free_block> 200e484: c4 26 7f fc st %g2, [ %i1 + -4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200e488: 80 a4 e0 00 cmp %l3, 0 200e48c: 02 80 00 3b be 200e578 <_Heap_Extend+0x29c> 200e490: ba 07 7f f8 add %i5, -8, %i5 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e494: 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( 200e498: ba 27 40 13 sub %i5, %l3, %i5 200e49c: 40 00 2d be call 2019b94 <.urem> 200e4a0: 90 10 00 1d mov %i5, %o0 ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = (last_block->size_and_flag - last_block_new_size) 200e4a4: c2 04 e0 04 ld [ %l3 + 4 ], %g1 200e4a8: ba 27 40 08 sub %i5, %o0, %i5 200e4ac: 82 20 40 1d sub %g1, %i5, %g1 | HEAP_PREV_BLOCK_USED; 200e4b0: 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 = 200e4b4: 84 07 40 13 add %i5, %l3, %g2 200e4b8: 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; 200e4bc: c2 04 e0 04 ld [ %l3 + 4 ], %g1 (last_block->size_and_flag - last_block_new_size) | HEAP_PREV_BLOCK_USED; _Heap_Block_set_size( last_block, last_block_new_size ); _Heap_Free_block( heap, last_block ); 200e4c0: 90 10 00 18 mov %i0, %o0 200e4c4: 82 08 60 01 and %g1, 1, %g1 200e4c8: 92 10 00 13 mov %l3, %o1 block->size_and_flag = size | flag; 200e4cc: ba 17 40 01 or %i5, %g1, %i5 200e4d0: 7f ff ff 79 call 200e2b4 <_Heap_Free_block> 200e4d4: fa 24 e0 04 st %i5, [ %l3 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e4d8: 80 a4 e0 00 cmp %l3, 0 200e4dc: 02 80 00 34 be 200e5ac <_Heap_Extend+0x2d0> 200e4e0: 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 200e4e4: 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( 200e4e8: 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; 200e4ec: 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; 200e4f0: 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; 200e4f4: 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( 200e4f8: 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; 200e4fc: 88 09 20 01 and %g4, 1, %g4 block->size_and_flag = size | flag; 200e500: 88 17 40 04 or %i5, %g4, %g4 200e504: c8 20 60 04 st %g4, [ %g1 + 4 ] 200e508: a4 20 c0 12 sub %g3, %l2, %l2 /* Statistics */ stats->size += extended_size; 200e50c: 82 00 80 12 add %g2, %l2, %g1 200e510: c2 26 20 2c st %g1, [ %i0 + 0x2c ] if ( extended_size_ptr != NULL ) 200e514: 80 a6 e0 00 cmp %i3, 0 200e518: 02 bf ff 7c be 200e308 <_Heap_Extend+0x2c> <== NEVER TAKEN 200e51c: a2 10 20 01 mov 1, %l1 *extended_size_ptr = extended_size; 200e520: e4 26 c0 00 st %l2, [ %i3 ] return true; } 200e524: b0 0c 60 01 and %l1, 1, %i0 200e528: 81 c7 e0 08 ret 200e52c: 81 e8 00 00 restore return false; } do { uintptr_t const sub_area_begin = (start_block != first_block) ? (uintptr_t) start_block : heap->area_begin; 200e530: 10 bf ff 9c b 200e3a0 <_Heap_Extend+0xc4> 200e534: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 extend_last_block->size_and_flag = 0; _Heap_Protection_block_initialize( heap, extend_last_block ); if ( (uintptr_t) extend_first_block < (uintptr_t) heap->first_block ) { heap->first_block = extend_first_block; } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200e538: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200e53c: 80 a0 40 02 cmp %g1, %g2 200e540: 2a bf ff be bcs,a 200e438 <_Heap_Extend+0x15c> 200e544: c4 26 20 24 st %g2, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200e548: 10 bf ff bd b 200e43c <_Heap_Extend+0x160> 200e54c: 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 ) { 200e550: 80 a7 40 01 cmp %i5, %g1 200e554: 38 bf ff ad bgu,a 200e408 <_Heap_Extend+0x12c> 200e558: fa 26 20 1c st %i5, [ %i0 + 0x1c ] heap->area_end = extend_area_end; } extend_first_block_size = (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; 200e55c: 10 bf ff ac b 200e40c <_Heap_Extend+0x130> 200e560: 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 ( 200e564: 80 a6 40 1a cmp %i1, %i2 200e568: 1a bf ff 92 bcc 200e3b0 <_Heap_Extend+0xd4> 200e56c: 80 a0 40 1d cmp %g1, %i5 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; 200e570: 10 bf ff 66 b 200e308 <_Heap_Extend+0x2c> 200e574: a2 10 20 00 clr %l1 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200e578: 80 a5 60 00 cmp %l5, 0 200e57c: 02 bf ff d7 be 200e4d8 <_Heap_Extend+0x1fc> 200e580: 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; 200e584: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200e588: c2 07 bf fc ld [ %fp + -4 ], %g1 200e58c: 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 ); 200e590: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200e594: 84 10 80 03 or %g2, %g3, %g2 200e598: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200e59c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200e5a0: 84 10 a0 01 or %g2, 1, %g2 200e5a4: 10 bf ff cd b 200e4d8 <_Heap_Extend+0x1fc> 200e5a8: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200e5ac: 32 bf ff cf bne,a 200e4e8 <_Heap_Extend+0x20c> 200e5b0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200e5b4: d2 07 bf f8 ld [ %fp + -8 ], %o1 200e5b8: 7f ff ff 3f call 200e2b4 <_Heap_Free_block> 200e5bc: 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 200e5c0: 10 bf ff ca b 200e4e8 <_Heap_Extend+0x20c> 200e5c4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { _Heap_Merge_below( heap, extend_area_begin, merge_below_block ); } else if ( link_below_block != NULL ) { 200e5c8: 80 a5 a0 00 cmp %l6, 0 200e5cc: 02 bf ff b0 be 200e48c <_Heap_Extend+0x1b0> 200e5d0: 80 a4 e0 00 cmp %l3, 0 { uintptr_t const last_block_begin = (uintptr_t) last_block; uintptr_t const link_begin = (uintptr_t) link; last_block->size_and_flag = (link_begin - last_block_begin) | HEAP_PREV_BLOCK_USED; 200e5d4: ac 25 80 02 sub %l6, %g2, %l6 200e5d8: 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 = 200e5dc: 10 bf ff ac b 200e48c <_Heap_Extend+0x1b0> 200e5e0: ec 20 a0 04 st %l6, [ %g2 + 4 ] =============================================================================== 0200e2c8 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200e2c8: 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 ) { 200e2cc: 80 a6 60 00 cmp %i1, 0 200e2d0: 02 80 00 57 be 200e42c <_Heap_Free+0x164> 200e2d4: 84 10 20 01 mov 1, %g2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 200e2d8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e2dc: 40 00 2d 67 call 2019878 <.urem> 200e2e0: 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 200e2e4: 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); 200e2e8: 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); 200e2ec: ba 27 40 08 sub %i5, %o0, %i5 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e2f0: 80 a7 40 01 cmp %i5, %g1 200e2f4: 0a 80 00 4e bcs 200e42c <_Heap_Free+0x164> 200e2f8: 84 10 20 00 clr %g2 200e2fc: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200e300: 80 a7 40 04 cmp %i5, %g4 200e304: 38 80 00 4b bgu,a 200e430 <_Heap_Free+0x168> 200e308: b0 08 a0 01 and %g2, 1, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e30c: de 07 60 04 ld [ %i5 + 4 ], %o7 200e310: b2 0b ff fe and %o7, -2, %i1 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e314: 86 07 40 19 add %i5, %i1, %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; 200e318: 80 a0 40 03 cmp %g1, %g3 200e31c: 38 80 00 45 bgu,a 200e430 <_Heap_Free+0x168> <== NEVER TAKEN 200e320: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED 200e324: 80 a1 00 03 cmp %g4, %g3 200e328: 2a 80 00 42 bcs,a 200e430 <_Heap_Free+0x168> <== NEVER TAKEN 200e32c: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e330: da 00 e0 04 ld [ %g3 + 4 ], %o5 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200e334: 80 8b 60 01 btst 1, %o5 200e338: 02 80 00 3d be 200e42c <_Heap_Free+0x164> <== NEVER TAKEN 200e33c: 98 0b 7f fe and %o5, -2, %o4 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200e340: 80 a1 00 03 cmp %g4, %g3 200e344: 02 80 00 06 be 200e35c <_Heap_Free+0x94> 200e348: 9a 10 20 00 clr %o5 200e34c: 84 00 c0 0c add %g3, %o4, %g2 200e350: da 00 a0 04 ld [ %g2 + 4 ], %o5 200e354: 9a 0b 60 01 and %o5, 1, %o5 return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) 200e358: 9a 1b 60 01 xor %o5, 1, %o5 next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); if ( !_Heap_Is_prev_used( block ) ) { 200e35c: 80 8b e0 01 btst 1, %o7 200e360: 12 80 00 1d bne 200e3d4 <_Heap_Free+0x10c> 200e364: 80 8b 60 ff btst 0xff, %o5 uintptr_t const prev_size = block->prev_size; 200e368: d6 07 40 00 ld [ %i5 ], %o3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e36c: 9e 27 40 0b sub %i5, %o3, %o7 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e370: 80 a0 40 0f cmp %g1, %o7 200e374: 18 80 00 2e bgu 200e42c <_Heap_Free+0x164> <== NEVER TAKEN 200e378: 84 10 20 00 clr %g2 200e37c: 80 a1 00 0f cmp %g4, %o7 200e380: 2a 80 00 2c bcs,a 200e430 <_Heap_Free+0x168> <== NEVER TAKEN 200e384: b0 08 a0 01 and %g2, 1, %i0 <== NOT EXECUTED block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200e388: c2 03 e0 04 ld [ %o7 + 4 ], %g1 return( false ); } /* As we always coalesce free blocks, the block that preceedes prev_block must have been used. */ if ( !_Heap_Is_prev_used ( prev_block) ) { 200e38c: 80 88 60 01 btst 1, %g1 200e390: 02 80 00 27 be 200e42c <_Heap_Free+0x164> <== NEVER TAKEN 200e394: 80 8b 60 ff btst 0xff, %o5 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200e398: 22 80 00 3a be,a 200e480 <_Heap_Free+0x1b8> 200e39c: 96 06 40 0b add %i1, %o3, %o3 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200e3a0: c2 00 e0 08 ld [ %g3 + 8 ], %g1 Heap_Block *prev = block->prev; 200e3a4: 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; 200e3a8: c6 06 20 38 ld [ %i0 + 0x38 ], %g3 prev->next = next; 200e3ac: c2 20 a0 08 st %g1, [ %g2 + 8 ] next->prev = prev; 200e3b0: c4 20 60 0c st %g2, [ %g1 + 0xc ] 200e3b4: 82 00 ff ff add %g3, -1, %g1 200e3b8: 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; 200e3bc: 98 06 40 0c add %i1, %o4, %o4 200e3c0: 96 03 00 0b add %o4, %o3, %o3 _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e3c4: 82 12 e0 01 or %o3, 1, %g1 next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200e3c8: d6 23 c0 0b st %o3, [ %o7 + %o3 ] 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; 200e3cc: 10 80 00 0e b 200e404 <_Heap_Free+0x13c> 200e3d0: c2 23 e0 04 st %g1, [ %o7 + 4 ] uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200e3d4: 22 80 00 19 be,a 200e438 <_Heap_Free+0x170> 200e3d8: c4 06 20 08 ld [ %i0 + 8 ], %g2 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200e3dc: c4 00 e0 08 ld [ %g3 + 8 ], %g2 Heap_Block *prev = old_block->prev; 200e3e0: c2 00 e0 0c ld [ %g3 + 0xc ], %g1 new_block->next = next; 200e3e4: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = prev; 200e3e8: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200e3ec: 98 03 00 19 add %o4, %i1, %o4 next->prev = new_block; 200e3f0: fa 20 a0 0c st %i5, [ %g2 + 0xc ] prev->next = new_block; 200e3f4: fa 20 60 08 st %i5, [ %g1 + 8 ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200e3f8: 84 13 20 01 or %o4, 1, %g2 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200e3fc: d8 27 40 0c st %o4, [ %i5 + %o4 ] 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; 200e400: c4 27 60 04 st %g2, [ %i5 + 4 ] stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e404: c4 06 20 40 ld [ %i0 + 0x40 ], %g2 ++stats->frees; 200e408: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 stats->free_size += block_size; 200e40c: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e410: 84 00 bf ff add %g2, -1, %g2 ++stats->frees; 200e414: 82 00 60 01 inc %g1 stats->free_size += block_size; 200e418: b2 00 c0 19 add %g3, %i1, %i1 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200e41c: c4 26 20 40 st %g2, [ %i0 + 0x40 ] ++stats->frees; 200e420: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200e424: f2 26 20 30 st %i1, [ %i0 + 0x30 ] return( true ); 200e428: 84 10 20 01 mov 1, %g2 } 200e42c: b0 08 a0 01 and %g2, 1, %i0 200e430: 81 c7 e0 08 ret 200e434: 81 e8 00 00 restore next_block->prev_size = size; } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; 200e438: 82 16 60 01 or %i1, 1, %g1 200e43c: c2 27 60 04 st %g1, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e440: c8 00 e0 04 ld [ %g3 + 4 ], %g4 ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200e444: f0 27 60 0c st %i0, [ %i5 + 0xc ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200e448: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200e44c: c4 27 60 08 st %g2, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200e450: fa 20 a0 0c st %i5, [ %g2 + 0xc ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e454: 84 09 3f fe and %g4, -2, %g2 next_block->prev_size = block_size; 200e458: f2 27 40 19 st %i1, [ %i5 + %i1 ] } 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; 200e45c: 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 ) { 200e460: 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; 200e464: 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; 200e468: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200e46c: 80 a0 40 02 cmp %g1, %g2 200e470: 08 bf ff e5 bleu 200e404 <_Heap_Free+0x13c> 200e474: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200e478: 10 bf ff e3 b 200e404 <_Heap_Free+0x13c> 200e47c: 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; 200e480: 82 12 e0 01 or %o3, 1, %g1 200e484: c2 23 e0 04 st %g1, [ %o7 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200e488: c2 00 e0 04 ld [ %g3 + 4 ], %g1 next_block->prev_size = size; 200e48c: d6 27 40 19 st %o3, [ %i5 + %i1 ] _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; 200e490: 82 08 7f fe and %g1, -2, %g1 200e494: 10 bf ff dc b 200e404 <_Heap_Free+0x13c> 200e498: c2 20 e0 04 st %g1, [ %g3 + 4 ] =============================================================================== 0202ed4c <_Heap_Get_free_information>: void _Heap_Get_free_information( Heap_Control *the_heap, Heap_Information *info ) { 202ed4c: 9d e3 bf a0 save %sp, -96, %sp return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 202ed50: c2 06 20 08 ld [ %i0 + 8 ], %g1 Heap_Block *the_block; Heap_Block *const tail = _Heap_Free_list_tail(the_heap); info->number = 0; 202ed54: c0 26 40 00 clr [ %i1 ] info->largest = 0; 202ed58: c0 26 60 04 clr [ %i1 + 4 ] info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); 202ed5c: 80 a6 00 01 cmp %i0, %g1 202ed60: 02 80 00 14 be 202edb0 <_Heap_Get_free_information+0x64> <== NEVER TAKEN 202ed64: c0 26 60 08 clr [ %i1 + 8 ] 202ed68: 88 10 20 01 mov 1, %g4 202ed6c: 9e 10 20 00 clr %o7 202ed70: 10 80 00 03 b 202ed7c <_Heap_Get_free_information+0x30> 202ed74: 86 10 20 00 clr %g3 202ed78: 88 10 00 0d mov %o5, %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; 202ed7c: c4 00 60 04 ld [ %g1 + 4 ], %g2 the_block != tail; the_block = the_block->next) 202ed80: 9a 01 20 01 add %g4, 1, %o5 202ed84: 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 ) 202ed88: 80 a0 80 0f cmp %g2, %o7 202ed8c: 08 80 00 03 bleu 202ed98 <_Heap_Get_free_information+0x4c> 202ed90: 86 00 c0 02 add %g3, %g2, %g3 info->largest = the_size; 202ed94: c4 26 60 04 st %g2, [ %i1 + 4 ] info->largest = 0; info->total = 0; for(the_block = _Heap_Free_list_first(the_heap); the_block != tail; the_block = the_block->next) 202ed98: 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); 202ed9c: 80 a6 00 01 cmp %i0, %g1 202eda0: 32 bf ff f6 bne,a 202ed78 <_Heap_Get_free_information+0x2c> 202eda4: de 06 60 04 ld [ %i1 + 4 ], %o7 202eda8: c8 26 40 00 st %g4, [ %i1 ] 202edac: c6 26 60 08 st %g3, [ %i1 + 8 ] 202edb0: 81 c7 e0 08 ret 202edb4: 81 e8 00 00 restore =============================================================================== 0200ae48 <_Heap_Greedy_allocate>: Heap_Block *_Heap_Greedy_allocate( Heap_Control *heap, uintptr_t remaining_free_space ) { 200ae48: 9d e3 bf a0 save %sp, -96, %sp void *free_space = remaining_free_space > 0 ? _Heap_Allocate( heap, remaining_free_space ) : NULL; 200ae4c: b4 10 20 00 clr %i2 200ae50: 80 a6 60 00 cmp %i1, 0 200ae54: 12 80 00 1c bne 200aec4 <_Heap_Greedy_allocate+0x7c> 200ae58: 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; 200ae5c: 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; 200ae60: b0 10 20 00 clr %i0 while ( current != free_list_tail ) { 200ae64: 80 a7 00 1d cmp %i4, %i5 200ae68: 12 80 00 05 bne 200ae7c <_Heap_Greedy_allocate+0x34> <== ALWAYS TAKEN 200ae6c: b6 10 20 00 clr %i3 current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); } _Heap_Free( heap, free_space ); 200ae70: 10 80 00 11 b 200aeb4 <_Heap_Greedy_allocate+0x6c> <== NOT EXECUTED 200ae74: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED _Heap_Block_size( current ) - HEAP_BLOCK_HEADER_SIZE ); current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); 200ae78: 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; 200ae7c: 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( 200ae80: 92 10 00 1d mov %i5, %o1 200ae84: 96 0a ff fe and %o3, -2, %o3 200ae88: 94 07 60 08 add %i5, 8, %o2 200ae8c: 90 10 00 1c mov %i4, %o0 200ae90: 40 00 00 e6 call 200b228 <_Heap_Block_allocate> 200ae94: 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; 200ae98: 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; 200ae9c: 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 ) { 200aea0: 80 a7 00 01 cmp %i4, %g1 200aea4: 12 bf ff f5 bne 200ae78 <_Heap_Greedy_allocate+0x30> 200aea8: b6 10 00 1d mov %i5, %i3 200aeac: b0 10 00 1d mov %i5, %i0 current->next = blocks; blocks = current; current = _Heap_Free_list_first( heap ); } _Heap_Free( heap, free_space ); 200aeb0: 90 10 00 1c mov %i4, %o0 200aeb4: 40 00 1f 1d call 2012b28 <_Heap_Free> 200aeb8: 92 10 00 1a mov %i2, %o1 return blocks; } 200aebc: 81 c7 e0 08 ret 200aec0: 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 ); 200aec4: 90 10 00 18 mov %i0, %o0 200aec8: 92 10 00 19 mov %i1, %o1 200aecc: 94 10 20 00 clr %o2 200aed0: 40 00 1e 8b call 20128fc <_Heap_Allocate_aligned_with_boundary> 200aed4: 96 10 20 00 clr %o3 200aed8: 10 bf ff e1 b 200ae5c <_Heap_Greedy_allocate+0x14> 200aedc: b4 10 00 08 mov %o0, %i2 =============================================================================== 0200aee0 <_Heap_Greedy_free>: void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { 200aee0: 9d e3 bf a0 save %sp, -96, %sp while ( blocks != NULL ) { 200aee4: 80 a6 60 00 cmp %i1, 0 200aee8: 32 80 00 04 bne,a 200aef8 <_Heap_Greedy_free+0x18> <== ALWAYS TAKEN 200aeec: fa 06 60 08 ld [ %i1 + 8 ], %i5 200aef0: 30 80 00 0a b,a 200af18 <_Heap_Greedy_free+0x38> <== NOT EXECUTED Heap_Block *current = blocks; blocks = blocks->next; 200aef4: fa 06 60 08 ld [ %i1 + 8 ], %i5 _Heap_Free( heap, (void *) _Heap_Alloc_area_of_block( current ) ); 200aef8: 92 06 60 08 add %i1, 8, %o1 200aefc: 40 00 1f 0b call 2012b28 <_Heap_Free> 200af00: 90 10 00 18 mov %i0, %o0 void _Heap_Greedy_free( Heap_Control *heap, Heap_Block *blocks ) { while ( blocks != NULL ) { 200af04: 80 a7 60 00 cmp %i5, 0 200af08: 12 bf ff fb bne 200aef4 <_Heap_Greedy_free+0x14> 200af0c: b2 10 00 1d mov %i5, %i1 200af10: 81 c7 e0 08 ret 200af14: 81 e8 00 00 restore 200af18: 81 c7 e0 08 ret <== NOT EXECUTED 200af1c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02045000 <_Heap_Iterate>: void _Heap_Iterate( Heap_Control *heap, Heap_Block_visitor visitor, void *visitor_arg ) { 2045000: 9d e3 bf a0 save %sp, -96, %sp Heap_Block *current = heap->first_block; 2045004: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *end = heap->last_block; 2045008: fa 06 20 24 ld [ %i0 + 0x24 ], %i5 bool stop = false; while ( !stop && current != end ) { 204500c: 80 a7 00 1d cmp %i4, %i5 2045010: 32 80 00 06 bne,a 2045028 <_Heap_Iterate+0x28> <== ALWAYS TAKEN 2045014: d2 07 20 04 ld [ %i4 + 4 ], %o1 2045018: 30 80 00 0e b,a 2045050 <_Heap_Iterate+0x50> <== NOT EXECUTED 204501c: 02 80 00 0d be 2045050 <_Heap_Iterate+0x50> 2045020: 01 00 00 00 nop - 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; 2045024: d2 07 20 04 ld [ %i4 + 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 ); 2045028: 90 10 00 1c mov %i4, %o0 204502c: 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); 2045030: b8 07 00 09 add %i4, %o1, %i4 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; 2045034: d4 07 20 04 ld [ %i4 + 4 ], %o2 2045038: 96 10 00 1a mov %i2, %o3 204503c: 9f c6 40 00 call %i1 2045040: 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 ) { 2045044: 80 8a 20 ff btst 0xff, %o0 2045048: 02 bf ff f5 be 204501c <_Heap_Iterate+0x1c> <== ALWAYS TAKEN 204504c: 80 a7 40 1c cmp %i5, %i4 2045050: 81 c7 e0 08 ret 2045054: 81 e8 00 00 restore =============================================================================== 0200e5bc <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 200e5bc: 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); 200e5c0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200e5c4: 40 00 2c ad call 2019878 <.urem> 200e5c8: 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 200e5cc: 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); 200e5d0: 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); 200e5d4: 84 20 80 08 sub %g2, %o0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e5d8: 80 a0 80 01 cmp %g2, %g1 200e5dc: 0a 80 00 16 bcs 200e634 <_Heap_Size_of_alloc_area+0x78> 200e5e0: 86 10 20 00 clr %g3 200e5e4: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 200e5e8: 80 a0 80 04 cmp %g2, %g4 200e5ec: 18 80 00 13 bgu 200e638 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e5f0: b0 08 e0 01 and %g3, 1, %i0 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200e5f4: f0 00 a0 04 ld [ %g2 + 4 ], %i0 200e5f8: b0 0e 3f fe and %i0, -2, %i0 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200e5fc: 84 00 80 18 add %g2, %i0, %g2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200e600: 80 a0 40 02 cmp %g1, %g2 200e604: 18 80 00 0d bgu 200e638 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e608: b0 08 e0 01 and %g3, 1, %i0 200e60c: 80 a1 00 02 cmp %g4, %g2 200e610: 0a 80 00 0a bcs 200e638 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e614: 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; 200e618: c2 00 a0 04 ld [ %g2 + 4 ], %g1 block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 200e61c: 80 88 60 01 btst 1, %g1 200e620: 02 80 00 06 be 200e638 <_Heap_Size_of_alloc_area+0x7c> <== NEVER TAKEN 200e624: 84 20 80 19 sub %g2, %i1, %g2 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 200e628: 86 10 20 01 mov 1, %g3 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 200e62c: 84 00 a0 04 add %g2, 4, %g2 200e630: c4 26 80 00 st %g2, [ %i2 ] return true; } 200e634: b0 08 e0 01 and %g3, 1, %i0 200e638: 81 c7 e0 08 ret 200e63c: 81 e8 00 00 restore =============================================================================== 02009eb8 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2009eb8: 9d e3 bf 80 save %sp, -128, %sp uintptr_t const min_block_size = heap->min_block_size; Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2009ebc: 3b 00 80 27 sethi %hi(0x2009c00), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2009ec0: e0 06 20 10 ld [ %i0 + 0x10 ], %l0 uintptr_t const min_block_size = heap->min_block_size; 2009ec4: f6 06 20 14 ld [ %i0 + 0x14 ], %i3 Heap_Block *const first_block = heap->first_block; 2009ec8: f8 06 20 20 ld [ %i0 + 0x20 ], %i4 Heap_Block *const last_block = heap->last_block; 2009ecc: e2 06 20 24 ld [ %i0 + 0x24 ], %l1 Heap_Block *block = first_block; Heap_Walk_printer printer = dump ? _Heap_Walk_print : _Heap_Walk_print_nothing; 2009ed0: 80 a6 a0 00 cmp %i2, 0 2009ed4: 02 80 00 04 be 2009ee4 <_Heap_Walk+0x2c> 2009ed8: ba 17 62 4c or %i5, 0x24c, %i5 2009edc: 3b 00 80 27 sethi %hi(0x2009c00), %i5 2009ee0: ba 17 62 54 or %i5, 0x254, %i5 ! 2009e54 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2009ee4: 03 00 80 84 sethi %hi(0x2021000), %g1 2009ee8: c4 00 60 78 ld [ %g1 + 0x78 ], %g2 ! 2021078 <_System_state_Current> 2009eec: 80 a0 a0 03 cmp %g2, 3 2009ef0: 02 80 00 05 be 2009f04 <_Heap_Walk+0x4c> 2009ef4: 82 10 20 01 mov 1, %g1 block = next_block; } while ( block != first_block ); return true; } 2009ef8: b0 08 60 01 and %g1, 1, %i0 2009efc: 81 c7 e0 08 ret 2009f00: 81 e8 00 00 restore Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); Heap_Block *const first_block = heap->first_block; Heap_Block *const last_block = heap->last_block; (*printer)( 2009f04: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2009f08: c6 06 20 1c ld [ %i0 + 0x1c ], %g3 2009f0c: c4 06 20 08 ld [ %i0 + 8 ], %g2 2009f10: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2009f14: 90 10 00 19 mov %i1, %o0 2009f18: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 2009f1c: f8 23 a0 60 st %i4, [ %sp + 0x60 ] 2009f20: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2009f24: c4 23 a0 68 st %g2, [ %sp + 0x68 ] 2009f28: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2009f2c: 92 10 20 00 clr %o1 2009f30: 96 10 00 10 mov %l0, %o3 2009f34: 15 00 80 76 sethi %hi(0x201d800), %o2 2009f38: 98 10 00 1b mov %i3, %o4 2009f3c: 9f c7 40 00 call %i5 2009f40: 94 12 a1 48 or %o2, 0x148, %o2 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 2009f44: 80 a4 20 00 cmp %l0, 0 2009f48: 02 80 00 28 be 2009fe8 <_Heap_Walk+0x130> 2009f4c: 80 8c 20 07 btst 7, %l0 (*printer)( source, true, "page size is zero\n" ); return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 2009f50: 12 80 00 2d bne 200a004 <_Heap_Walk+0x14c> 2009f54: 90 10 00 1b mov %i3, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2009f58: 7f ff de dd call 2001acc <.urem> 2009f5c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2009f60: 80 a2 20 00 cmp %o0, 0 2009f64: 12 80 00 30 bne 200a024 <_Heap_Walk+0x16c> 2009f68: 90 07 20 08 add %i4, 8, %o0 2009f6c: 7f ff de d8 call 2001acc <.urem> 2009f70: 92 10 00 10 mov %l0, %o1 ); return false; } if ( 2009f74: 80 a2 20 00 cmp %o0, 0 2009f78: 32 80 00 33 bne,a 200a044 <_Heap_Walk+0x18c> 2009f7c: 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; 2009f80: e8 07 20 04 ld [ %i4 + 4 ], %l4 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2009f84: 80 8d 20 01 btst 1, %l4 2009f88: 22 80 00 36 be,a 200a060 <_Heap_Walk+0x1a8> 2009f8c: 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; 2009f90: c2 04 60 04 ld [ %l1 + 4 ], %g1 2009f94: 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); 2009f98: 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; 2009f9c: c4 00 60 04 ld [ %g1 + 4 ], %g2 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2009fa0: 80 88 a0 01 btst 1, %g2 2009fa4: 02 80 00 0a be 2009fcc <_Heap_Walk+0x114> 2009fa8: 80 a7 00 01 cmp %i4, %g1 ); return false; } if ( 2009fac: 02 80 00 33 be 200a078 <_Heap_Walk+0x1c0> 2009fb0: 90 10 00 19 mov %i1, %o0 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2009fb4: 92 10 20 01 mov 1, %o1 2009fb8: 15 00 80 76 sethi %hi(0x201d800), %o2 2009fbc: 9f c7 40 00 call %i5 2009fc0: 94 12 a2 c0 or %o2, 0x2c0, %o2 ! 201dac0 <__log2table+0x2d8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009fc4: 10 bf ff cd b 2009ef8 <_Heap_Walk+0x40> 2009fc8: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_free( last_block ) ) { (*printer)( 2009fcc: 90 10 00 19 mov %i1, %o0 2009fd0: 92 10 20 01 mov 1, %o1 2009fd4: 15 00 80 76 sethi %hi(0x201d800), %o2 2009fd8: 9f c7 40 00 call %i5 2009fdc: 94 12 a2 a8 or %o2, 0x2a8, %o2 ! 201daa8 <__log2table+0x2c0> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009fe0: 10 bf ff c6 b 2009ef8 <_Heap_Walk+0x40> 2009fe4: 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" ); 2009fe8: 90 10 00 19 mov %i1, %o0 2009fec: 92 10 20 01 mov 1, %o1 2009ff0: 15 00 80 76 sethi %hi(0x201d800), %o2 2009ff4: 9f c7 40 00 call %i5 2009ff8: 94 12 a1 e0 or %o2, 0x1e0, %o2 ! 201d9e0 <__log2table+0x1f8> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2009ffc: 10 bf ff bf b 2009ef8 <_Heap_Walk+0x40> 200a000: 82 10 20 00 clr %g1 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { (*printer)( 200a004: 90 10 00 19 mov %i1, %o0 200a008: 92 10 20 01 mov 1, %o1 200a00c: 96 10 00 10 mov %l0, %o3 200a010: 15 00 80 76 sethi %hi(0x201d800), %o2 200a014: 9f c7 40 00 call %i5 200a018: 94 12 a1 f8 or %o2, 0x1f8, %o2 ! 201d9f8 <__log2table+0x210> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a01c: 10 bf ff b7 b 2009ef8 <_Heap_Walk+0x40> 200a020: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { (*printer)( 200a024: 90 10 00 19 mov %i1, %o0 200a028: 92 10 20 01 mov 1, %o1 200a02c: 96 10 00 1b mov %i3, %o3 200a030: 15 00 80 76 sethi %hi(0x201d800), %o2 200a034: 9f c7 40 00 call %i5 200a038: 94 12 a2 18 or %o2, 0x218, %o2 ! 201da18 <__log2table+0x230> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a03c: 10 bf ff af b 2009ef8 <_Heap_Walk+0x40> 200a040: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 200a044: 92 10 20 01 mov 1, %o1 200a048: 96 10 00 1c mov %i4, %o3 200a04c: 15 00 80 76 sethi %hi(0x201d800), %o2 200a050: 9f c7 40 00 call %i5 200a054: 94 12 a2 40 or %o2, 0x240, %o2 ! 201da40 <__log2table+0x258> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a058: 10 bf ff a8 b 2009ef8 <_Heap_Walk+0x40> 200a05c: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_prev_used( first_block ) ) { (*printer)( 200a060: 92 10 20 01 mov 1, %o1 200a064: 15 00 80 76 sethi %hi(0x201d800), %o2 200a068: 9f c7 40 00 call %i5 200a06c: 94 12 a2 78 or %o2, 0x278, %o2 ! 201da78 <__log2table+0x290> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a070: 10 bf ff a2 b 2009ef8 <_Heap_Walk+0x40> 200a074: 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; 200a078: f4 06 20 08 ld [ %i0 + 8 ], %i2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 200a07c: ea 06 20 10 ld [ %i0 + 0x10 ], %l5 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 200a080: 80 a6 00 1a cmp %i0, %i2 200a084: 02 80 00 0d be 200a0b8 <_Heap_Walk+0x200> 200a088: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a08c: 80 a0 40 1a cmp %g1, %i2 200a090: 28 80 00 bc bleu,a 200a380 <_Heap_Walk+0x4c8> <== ALWAYS TAKEN 200a094: e6 06 20 24 ld [ %i0 + 0x24 ], %l3 if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { (*printer)( 200a098: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a09c: 92 10 20 01 mov 1, %o1 200a0a0: 96 10 00 1a mov %i2, %o3 200a0a4: 15 00 80 76 sethi %hi(0x201d800), %o2 200a0a8: 9f c7 40 00 call %i5 200a0ac: 94 12 a2 f0 or %o2, 0x2f0, %o2 ! 201daf0 <__log2table+0x308> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a0b0: 10 bf ff 92 b 2009ef8 <_Heap_Walk+0x40> 200a0b4: 82 10 20 00 clr %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a0b8: 2d 00 80 77 sethi %hi(0x201dc00), %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 200a0bc: 2f 00 80 77 sethi %hi(0x201dc00), %l7 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a0c0: a4 10 00 1c mov %i4, %l2 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a0c4: ac 15 a1 20 or %l6, 0x120, %l6 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { (*printer)( 200a0c8: ae 15 e1 08 or %l7, 0x108, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a0cc: 2b 00 80 77 sethi %hi(0x201dc00), %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; 200a0d0: a6 0d 3f fe and %l4, -2, %l3 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200a0d4: b4 04 c0 12 add %l3, %l2, %i2 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a0d8: 80 a0 40 1a cmp %g1, %i2 200a0dc: 28 80 00 0b bleu,a 200a108 <_Heap_Walk+0x250> <== ALWAYS TAKEN 200a0e0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 Heap_Block *const next_block = _Heap_Block_at( block, block_size ); uintptr_t const next_block_begin = (uintptr_t) next_block; bool const is_not_last_block = block != last_block; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { (*printer)( 200a0e4: 90 10 00 19 mov %i1, %o0 <== NOT EXECUTED 200a0e8: 92 10 20 01 mov 1, %o1 200a0ec: 96 10 00 12 mov %l2, %o3 200a0f0: 15 00 80 76 sethi %hi(0x201d800), %o2 200a0f4: 98 10 00 1a mov %i2, %o4 200a0f8: 9f c7 40 00 call %i5 200a0fc: 94 12 a3 98 or %o2, 0x398, %o2 "block 0x%08x: next block 0x%08x not in heap\n", block, next_block ); return false; 200a100: 10 bf ff 7e b 2009ef8 <_Heap_Walk+0x40> 200a104: 82 10 20 00 clr %g1 200a108: 80 a0 40 1a cmp %g1, %i2 200a10c: 0a bf ff f7 bcs 200a0e8 <_Heap_Walk+0x230> 200a110: 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; 200a114: 82 1c 80 11 xor %l2, %l1, %g1 200a118: 80 a0 00 01 cmp %g0, %g1 200a11c: 82 40 20 00 addx %g0, 0, %g1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a120: 90 10 00 13 mov %l3, %o0 200a124: c2 27 bf fc st %g1, [ %fp + -4 ] 200a128: 7f ff de 69 call 2001acc <.urem> 200a12c: 92 10 00 10 mov %l0, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 200a130: 80 a2 20 00 cmp %o0, 0 200a134: 02 80 00 05 be 200a148 <_Heap_Walk+0x290> 200a138: c2 07 bf fc ld [ %fp + -4 ], %g1 200a13c: 80 88 60 ff btst 0xff, %g1 200a140: 12 80 00 76 bne 200a318 <_Heap_Walk+0x460> 200a144: 90 10 00 19 mov %i1, %o0 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 200a148: 80 a6 c0 13 cmp %i3, %l3 200a14c: 08 80 00 05 bleu 200a160 <_Heap_Walk+0x2a8> 200a150: 80 a4 80 1a cmp %l2, %i2 200a154: 80 88 60 ff btst 0xff, %g1 200a158: 12 80 00 78 bne 200a338 <_Heap_Walk+0x480> <== ALWAYS TAKEN 200a15c: 80 a4 80 1a cmp %l2, %i2 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 200a160: 2a 80 00 06 bcs,a 200a178 <_Heap_Walk+0x2c0> 200a164: c2 06 a0 04 ld [ %i2 + 4 ], %g1 200a168: 80 88 60 ff btst 0xff, %g1 200a16c: 12 80 00 7d bne 200a360 <_Heap_Walk+0x4a8> 200a170: 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; 200a174: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 200a178: 80 88 60 01 btst 1, %g1 200a17c: 02 80 00 19 be 200a1e0 <_Heap_Walk+0x328> 200a180: a8 0d 20 01 and %l4, 1, %l4 if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 200a184: 80 a5 20 00 cmp %l4, 0 200a188: 22 80 00 0e be,a 200a1c0 <_Heap_Walk+0x308> 200a18c: da 04 80 00 ld [ %l2 ], %o5 (*printer)( 200a190: 90 10 00 19 mov %i1, %o0 200a194: 92 10 20 00 clr %o1 200a198: 94 10 00 17 mov %l7, %o2 200a19c: 96 10 00 12 mov %l2, %o3 200a1a0: 9f c7 40 00 call %i5 200a1a4: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a1a8: 80 a7 00 1a cmp %i4, %i2 200a1ac: 02 80 00 42 be 200a2b4 <_Heap_Walk+0x3fc> 200a1b0: a4 10 00 1a mov %i2, %l2 200a1b4: e8 06 a0 04 ld [ %i2 + 4 ], %l4 200a1b8: 10 bf ff c6 b 200a0d0 <_Heap_Walk+0x218> 200a1bc: c2 06 20 20 ld [ %i0 + 0x20 ], %g1 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200a1c0: 96 10 00 12 mov %l2, %o3 200a1c4: 90 10 00 19 mov %i1, %o0 200a1c8: 92 10 20 00 clr %o1 200a1cc: 94 10 00 16 mov %l6, %o2 200a1d0: 9f c7 40 00 call %i5 200a1d4: 98 10 00 13 mov %l3, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 200a1d8: 10 bf ff f5 b 200a1ac <_Heap_Walk+0x2f4> 200a1dc: 80 a7 00 1a cmp %i4, %i2 false, "block 0x%08x: size %u, prev 0x%08x%s, next 0x%08x%s\n", block, block_size, block->prev, block->prev == first_free_block ? 200a1e0: da 04 a0 0c ld [ %l2 + 0xc ], %o5 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a1e4: c2 06 20 08 ld [ %i0 + 8 ], %g1 200a1e8: 05 00 80 76 sethi %hi(0x201d800), %g2 return _Heap_Free_list_head(heap)->next; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_last( Heap_Control *heap ) { return _Heap_Free_list_tail(heap)->prev; 200a1ec: c8 06 20 0c ld [ %i0 + 0xc ], %g4 200a1f0: 80 a0 40 0d cmp %g1, %o5 200a1f4: 02 80 00 05 be 200a208 <_Heap_Walk+0x350> 200a1f8: 86 10 a1 08 or %g2, 0x108, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a1fc: 80 a6 00 0d cmp %i0, %o5 200a200: 02 80 00 3c be 200a2f0 <_Heap_Walk+0x438> 200a204: 86 15 60 d0 or %l5, 0xd0, %g3 block->next, block->next == last_free_block ? 200a208: c2 04 a0 08 ld [ %l2 + 8 ], %g1 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a20c: 1f 00 80 76 sethi %hi(0x201d800), %o7 200a210: 80 a1 00 01 cmp %g4, %g1 200a214: 02 80 00 05 be 200a228 <_Heap_Walk+0x370> 200a218: 84 13 e1 28 or %o7, 0x128, %g2 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a21c: 80 a6 00 01 cmp %i0, %g1 200a220: 02 80 00 31 be 200a2e4 <_Heap_Walk+0x42c> 200a224: 84 15 60 d0 or %l5, 0xd0, %g2 Heap_Block *const last_free_block = _Heap_Free_list_last( heap ); bool const prev_used = _Heap_Is_prev_used( block ); uintptr_t const block_size = _Heap_Block_size( block ); Heap_Block *const next_block = _Heap_Block_at( block, block_size ); (*printer)( 200a228: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 200a22c: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 200a230: c4 23 a0 64 st %g2, [ %sp + 0x64 ] 200a234: 90 10 00 19 mov %i1, %o0 200a238: 92 10 20 00 clr %o1 200a23c: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a240: 96 10 00 12 mov %l2, %o3 200a244: 94 12 a0 60 or %o2, 0x60, %o2 200a248: 9f c7 40 00 call %i5 200a24c: 98 10 00 13 mov %l3, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 200a250: da 06 80 00 ld [ %i2 ], %o5 200a254: 80 a4 c0 0d cmp %l3, %o5 200a258: 12 80 00 19 bne 200a2bc <_Heap_Walk+0x404> 200a25c: 80 a5 20 00 cmp %l4, 0 ); return false; } if ( !prev_used ) { 200a260: 02 80 00 27 be 200a2fc <_Heap_Walk+0x444> 200a264: 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; 200a268: c2 06 20 08 ld [ %i0 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 200a26c: 80 a6 00 01 cmp %i0, %g1 200a270: 02 80 00 0b be 200a29c <_Heap_Walk+0x3e4> <== NEVER TAKEN 200a274: 92 10 20 01 mov 1, %o1 if ( free_block == block ) { 200a278: 80 a4 80 01 cmp %l2, %g1 200a27c: 02 bf ff cc be 200a1ac <_Heap_Walk+0x2f4> 200a280: 80 a7 00 1a cmp %i4, %i2 return true; } free_block = free_block->next; 200a284: c2 00 60 08 ld [ %g1 + 8 ], %g1 ) { const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *free_block = _Heap_Free_list_first( heap ); while ( free_block != free_list_tail ) { 200a288: 80 a6 00 01 cmp %i0, %g1 200a28c: 12 bf ff fc bne 200a27c <_Heap_Walk+0x3c4> 200a290: 80 a4 80 01 cmp %l2, %g1 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200a294: 90 10 00 19 mov %i1, %o0 200a298: 92 10 20 01 mov 1, %o1 200a29c: 96 10 00 12 mov %l2, %o3 200a2a0: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a2a4: 9f c7 40 00 call %i5 200a2a8: 94 12 a1 48 or %o2, 0x148, %o2 ! 201dd48 <__log2table+0x560> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 200a2ac: 10 bf ff 13 b 2009ef8 <_Heap_Walk+0x40> 200a2b0: 82 10 20 00 clr %g1 } block = next_block; } while ( block != first_block ); return true; 200a2b4: 10 bf ff 11 b 2009ef8 <_Heap_Walk+0x40> 200a2b8: 82 10 20 01 mov 1, %g1 " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { (*printer)( 200a2bc: f4 23 a0 5c st %i2, [ %sp + 0x5c ] 200a2c0: 90 10 00 19 mov %i1, %o0 200a2c4: 92 10 20 01 mov 1, %o1 200a2c8: 96 10 00 12 mov %l2, %o3 200a2cc: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a2d0: 98 10 00 13 mov %l3, %o4 200a2d4: 9f c7 40 00 call %i5 200a2d8: 94 12 a0 98 or %o2, 0x98, %o2 return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 200a2dc: 10 bf ff 07 b 2009ef8 <_Heap_Walk+0x40> 200a2e0: 82 10 20 00 clr %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 200a2e4: 05 00 80 76 sethi %hi(0x201d800), %g2 200a2e8: 10 bf ff d0 b 200a228 <_Heap_Walk+0x370> 200a2ec: 84 10 a1 38 or %g2, 0x138, %g2 ! 201d938 <__log2table+0x150> block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 200a2f0: 07 00 80 76 sethi %hi(0x201d800), %g3 200a2f4: 10 bf ff c5 b 200a208 <_Heap_Walk+0x350> 200a2f8: 86 10 e1 18 or %g3, 0x118, %g3 ! 201d918 <__log2table+0x130> return false; } if ( !prev_used ) { (*printer)( 200a2fc: 92 10 20 01 mov 1, %o1 200a300: 96 10 00 12 mov %l2, %o3 200a304: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a308: 9f c7 40 00 call %i5 200a30c: 94 12 a0 d8 or %o2, 0xd8, %o2 ! 201dcd8 <__log2table+0x4f0> return false; } if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; 200a310: 10 bf fe fa b 2009ef8 <_Heap_Walk+0x40> 200a314: 82 10 20 00 clr %g1 return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { (*printer)( 200a318: 92 10 20 01 mov 1, %o1 200a31c: 96 10 00 12 mov %l2, %o3 200a320: 15 00 80 76 sethi %hi(0x201d800), %o2 200a324: 98 10 00 13 mov %l3, %o4 200a328: 9f c7 40 00 call %i5 200a32c: 94 12 a3 c8 or %o2, 0x3c8, %o2 "block 0x%08x: block size %u not page aligned\n", block, block_size ); return false; 200a330: 10 bf fe f2 b 2009ef8 <_Heap_Walk+0x40> 200a334: 82 10 20 00 clr %g1 } if ( block_size < min_block_size && is_not_last_block ) { (*printer)( 200a338: 90 10 00 19 mov %i1, %o0 200a33c: 92 10 20 01 mov 1, %o1 200a340: 96 10 00 12 mov %l2, %o3 200a344: 15 00 80 76 sethi %hi(0x201d800), %o2 200a348: 98 10 00 13 mov %l3, %o4 200a34c: 94 12 a3 f8 or %o2, 0x3f8, %o2 200a350: 9f c7 40 00 call %i5 200a354: 9a 10 00 1b mov %i3, %o5 block, block_size, min_block_size ); return false; 200a358: 10 bf fe e8 b 2009ef8 <_Heap_Walk+0x40> 200a35c: 82 10 20 00 clr %g1 } if ( next_block_begin <= block_begin && is_not_last_block ) { (*printer)( 200a360: 92 10 20 01 mov 1, %o1 200a364: 96 10 00 12 mov %l2, %o3 200a368: 15 00 80 77 sethi %hi(0x201dc00), %o2 200a36c: 98 10 00 1a mov %i2, %o4 200a370: 9f c7 40 00 call %i5 200a374: 94 12 a0 28 or %o2, 0x28, %o2 "block 0x%08x: next block 0x%08x is not a successor\n", block, next_block ); return false; 200a378: 10 bf fe e0 b 2009ef8 <_Heap_Walk+0x40> 200a37c: 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; 200a380: 80 a4 c0 1a cmp %l3, %i2 200a384: 0a bf ff 46 bcs 200a09c <_Heap_Walk+0x1e4> <== NEVER TAKEN 200a388: 90 10 00 19 mov %i1, %o0 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a38c: c2 27 bf fc st %g1, [ %fp + -4 ] 200a390: 90 06 a0 08 add %i2, 8, %o0 200a394: 7f ff dd ce call 2001acc <.urem> 200a398: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 200a39c: 80 a2 20 00 cmp %o0, 0 200a3a0: 12 80 00 36 bne 200a478 <_Heap_Walk+0x5c0> <== NEVER TAKEN 200a3a4: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a3a8: c4 06 a0 04 ld [ %i2 + 4 ], %g2 200a3ac: 84 08 bf fe and %g2, -2, %g2 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200a3b0: 84 06 80 02 add %i2, %g2, %g2 200a3b4: c4 00 a0 04 ld [ %g2 + 4 ], %g2 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a3b8: 80 88 a0 01 btst 1, %g2 200a3bc: 12 80 00 27 bne 200a458 <_Heap_Walk+0x5a0> <== NEVER TAKEN 200a3c0: 84 10 00 18 mov %i0, %g2 200a3c4: 10 80 00 19 b 200a428 <_Heap_Walk+0x570> 200a3c8: a4 10 00 1a mov %i2, %l2 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); const Heap_Block *const first_free_block = _Heap_Free_list_first( heap ); const Heap_Block *prev_block = free_list_tail; const Heap_Block *free_block = first_free_block; while ( free_block != free_list_tail ) { 200a3cc: 80 a6 00 1a cmp %i0, %i2 200a3d0: 02 bf ff 3a be 200a0b8 <_Heap_Walk+0x200> 200a3d4: 80 a6 80 01 cmp %i2, %g1 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 200a3d8: 0a bf ff 31 bcs 200a09c <_Heap_Walk+0x1e4> 200a3dc: 90 10 00 19 mov %i1, %o0 200a3e0: 80 a6 80 13 cmp %i2, %l3 200a3e4: 18 bf ff 2f bgu 200a0a0 <_Heap_Walk+0x1e8> <== NEVER TAKEN 200a3e8: 92 10 20 01 mov 1, %o1 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200a3ec: c2 27 bf fc st %g1, [ %fp + -4 ] 200a3f0: 90 06 a0 08 add %i2, 8, %o0 200a3f4: 7f ff dd b6 call 2001acc <.urem> 200a3f8: 92 10 00 15 mov %l5, %o1 ); return false; } if ( 200a3fc: 80 a2 20 00 cmp %o0, 0 200a400: 12 80 00 1e bne 200a478 <_Heap_Walk+0x5c0> 200a404: c2 07 bf fc ld [ %fp + -4 ], %g1 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200a408: c6 06 a0 04 ld [ %i2 + 4 ], %g3 ); return false; } if ( _Heap_Is_used( free_block ) ) { 200a40c: 84 10 00 12 mov %l2, %g2 200a410: 86 08 ff fe and %g3, -2, %g3 block->size_and_flag = size | flag; } RTEMS_INLINE_ROUTINE bool _Heap_Is_prev_used( const Heap_Block *block ) { return block->size_and_flag & HEAP_PREV_BLOCK_USED; 200a414: 86 00 c0 1a add %g3, %i2, %g3 200a418: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200a41c: 80 88 e0 01 btst 1, %g3 200a420: 12 80 00 0e bne 200a458 <_Heap_Walk+0x5a0> 200a424: a4 10 00 1a mov %i2, %l2 ); return false; } if ( free_block->prev != prev_block ) { 200a428: d8 06 a0 0c ld [ %i2 + 0xc ], %o4 200a42c: 80 a3 00 02 cmp %o4, %g2 200a430: 22 bf ff e7 be,a 200a3cc <_Heap_Walk+0x514> 200a434: f4 06 a0 08 ld [ %i2 + 8 ], %i2 (*printer)( 200a438: 90 10 00 19 mov %i1, %o0 200a43c: 92 10 20 01 mov 1, %o1 200a440: 96 10 00 1a mov %i2, %o3 200a444: 15 00 80 76 sethi %hi(0x201d800), %o2 200a448: 9f c7 40 00 call %i5 200a44c: 94 12 a3 60 or %o2, 0x360, %o2 ! 201db60 <__log2table+0x378> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a450: 10 bf fe aa b 2009ef8 <_Heap_Walk+0x40> 200a454: 82 10 20 00 clr %g1 return false; } if ( _Heap_Is_used( free_block ) ) { (*printer)( 200a458: 90 10 00 19 mov %i1, %o0 200a45c: 92 10 20 01 mov 1, %o1 200a460: 96 10 00 1a mov %i2, %o3 200a464: 15 00 80 76 sethi %hi(0x201d800), %o2 200a468: 9f c7 40 00 call %i5 200a46c: 94 12 a3 40 or %o2, 0x340, %o2 ! 201db40 <__log2table+0x358> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a470: 10 bf fe a2 b 2009ef8 <_Heap_Walk+0x40> 200a474: 82 10 20 00 clr %g1 } if ( !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 200a478: 90 10 00 19 mov %i1, %o0 200a47c: 92 10 20 01 mov 1, %o1 200a480: 96 10 00 1a mov %i2, %o3 200a484: 15 00 80 76 sethi %hi(0x201d800), %o2 200a488: 9f c7 40 00 call %i5 200a48c: 94 12 a3 10 or %o2, 0x310, %o2 ! 201db10 <__log2table+0x328> if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 200a490: 10 bf fe 9a b 2009ef8 <_Heap_Walk+0x40> 200a494: 82 10 20 00 clr %g1 =============================================================================== 0200852c <_IO_Initialize_all_drivers>: * * Output Parameters: NONE */ void _IO_Initialize_all_drivers( void ) { 200852c: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major; for ( major=0 ; major < _IO_Number_of_drivers ; major ++ ) 2008530: 39 00 80 7c sethi %hi(0x201f000), %i4 2008534: c2 07 23 b4 ld [ %i4 + 0x3b4 ], %g1 ! 201f3b4 <_IO_Number_of_drivers> 2008538: 80 a0 60 00 cmp %g1, 0 200853c: 02 80 00 0c be 200856c <_IO_Initialize_all_drivers+0x40> <== NEVER TAKEN 2008540: ba 10 20 00 clr %i5 2008544: b8 17 23 b4 or %i4, 0x3b4, %i4 (void) rtems_io_initialize( major, 0, NULL ); 2008548: 90 10 00 1d mov %i5, %o0 200854c: 92 10 20 00 clr %o1 2008550: 40 00 16 47 call 200de6c 2008554: 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 ++ ) 2008558: c2 07 00 00 ld [ %i4 ], %g1 200855c: ba 07 60 01 inc %i5 2008560: 80 a0 40 1d cmp %g1, %i5 2008564: 18 bf ff fa bgu 200854c <_IO_Initialize_all_drivers+0x20> 2008568: 90 10 00 1d mov %i5, %o0 200856c: 81 c7 e0 08 ret 2008570: 81 e8 00 00 restore =============================================================================== 02008460 <_IO_Manager_initialization>: * workspace. * */ void _IO_Manager_initialization(void) { 2008460: 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; 2008464: 03 00 80 77 sethi %hi(0x201dc00), %g1 2008468: 82 10 60 4c or %g1, 0x4c, %g1 ! 201dc4c drivers_in_table = Configuration.number_of_device_drivers; 200846c: f8 00 60 38 ld [ %g1 + 0x38 ], %i4 number_of_drivers = Configuration.maximum_drivers; 2008470: f2 00 60 34 ld [ %g1 + 0x34 ], %i1 /* * If the user claims there are less drivers than are actually in * the table, then let's just go with the table's count. */ if ( number_of_drivers <= drivers_in_table ) 2008474: 80 a7 00 19 cmp %i4, %i1 2008478: 0a 80 00 08 bcs 2008498 <_IO_Manager_initialization+0x38> 200847c: fa 00 60 3c ld [ %g1 + 0x3c ], %i5 * If the maximum number of driver is the same as the number in the * table, then we do not have to copy the driver table. They can't * register any dynamically. */ if ( number_of_drivers == drivers_in_table ) { _IO_Driver_address_table = driver_table; 2008480: 03 00 80 7c sethi %hi(0x201f000), %g1 2008484: fa 20 63 b8 st %i5, [ %g1 + 0x3b8 ] ! 201f3b8 <_IO_Driver_address_table> _IO_Number_of_drivers = number_of_drivers; 2008488: 03 00 80 7c sethi %hi(0x201f000), %g1 200848c: f8 20 63 b4 st %i4, [ %g1 + 0x3b4 ] ! 201f3b4 <_IO_Number_of_drivers> return; 2008490: 81 c7 e0 08 ret 2008494: 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 ) 2008498: 83 2e 60 03 sll %i1, 3, %g1 200849c: b5 2e 60 05 sll %i1, 5, %i2 20084a0: 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( 20084a4: 40 00 0d 5e call 200ba1c <_Workspace_Allocate_or_fatal_error> 20084a8: 90 10 00 1a mov %i2, %o0 sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20084ac: 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 *) 20084b0: 37 00 80 7c sethi %hi(0x201f000), %i3 _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; 20084b4: f2 20 63 b4 st %i1, [ %g1 + 0x3b4 ] /* * 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 *) 20084b8: d0 26 e3 b8 st %o0, [ %i3 + 0x3b8 ] _Workspace_Allocate_or_fatal_error( sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); _IO_Number_of_drivers = number_of_drivers; memset( 20084bc: 92 10 20 00 clr %o1 20084c0: 40 00 22 f2 call 2011088 20084c4: 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++ ) 20084c8: 80 a7 20 00 cmp %i4, 0 20084cc: 02 bf ff f1 be 2008490 <_IO_Manager_initialization+0x30> <== NEVER TAKEN 20084d0: f6 06 e3 b8 ld [ %i3 + 0x3b8 ], %i3 20084d4: 82 10 20 00 clr %g1 20084d8: 88 10 20 00 clr %g4 _IO_Driver_address_table[index] = driver_table[index]; 20084dc: c4 07 40 01 ld [ %i5 + %g1 ], %g2 20084e0: 86 07 40 01 add %i5, %g1, %g3 20084e4: c4 26 c0 01 st %g2, [ %i3 + %g1 ] 20084e8: f4 00 e0 04 ld [ %g3 + 4 ], %i2 20084ec: 84 06 c0 01 add %i3, %g1, %g2 20084f0: f4 20 a0 04 st %i2, [ %g2 + 4 ] 20084f4: f4 00 e0 08 ld [ %g3 + 8 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 20084f8: 88 01 20 01 inc %g4 _IO_Driver_address_table[index] = driver_table[index]; 20084fc: f4 20 a0 08 st %i2, [ %g2 + 8 ] 2008500: f4 00 e0 0c ld [ %g3 + 0xc ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2008504: 82 00 60 18 add %g1, 0x18, %g1 _IO_Driver_address_table[index] = driver_table[index]; 2008508: f4 20 a0 0c st %i2, [ %g2 + 0xc ] 200850c: f4 00 e0 10 ld [ %g3 + 0x10 ], %i2 memset( _IO_Driver_address_table, 0, sizeof( rtems_driver_address_table ) * ( number_of_drivers ) ); for ( index = 0 ; index < drivers_in_table ; index++ ) 2008510: 80 a1 00 1c cmp %g4, %i4 _IO_Driver_address_table[index] = driver_table[index]; 2008514: f4 20 a0 10 st %i2, [ %g2 + 0x10 ] 2008518: 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++ ) 200851c: 12 bf ff f0 bne 20084dc <_IO_Manager_initialization+0x7c> 2008520: c6 20 a0 14 st %g3, [ %g2 + 0x14 ] 2008524: 81 c7 e0 08 ret 2008528: 81 e8 00 00 restore =============================================================================== 020092dc <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20092dc: 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 ) 20092e0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20092e4: ba 10 00 18 mov %i0, %i5 * If the application is using the optional manager stubs and * still attempts to create the object, the information block * should be all zeroed out because it is in the BSS. So let's * check that code for this manager is even present. */ if ( information->size == 0 ) 20092e8: 80 a0 60 00 cmp %g1, 0 20092ec: 02 80 00 19 be 2009350 <_Objects_Allocate+0x74> <== NEVER TAKEN 20092f0: b0 10 20 00 clr %i0 /* * OK. The manager should be initialized and configured to have objects. * With any luck, it is safe to attempt to allocate an object. */ the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20092f4: b8 07 60 20 add %i5, 0x20, %i4 20092f8: 7f ff fd 47 call 2008814 <_Chain_Get> 20092fc: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2009300: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2009304: 80 a0 60 00 cmp %g1, 0 2009308: 02 80 00 12 be 2009350 <_Objects_Allocate+0x74> 200930c: 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 ) { 2009310: 80 a2 20 00 cmp %o0, 0 2009314: 02 80 00 11 be 2009358 <_Objects_Allocate+0x7c> 2009318: 01 00 00 00 nop } if ( the_object ) { uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 200931c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2009320: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2009324: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 2009328: 40 00 40 a8 call 20195c8 <.udiv> 200932c: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2009330: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2009334: 91 2a 20 02 sll %o0, 2, %o0 2009338: c6 00 40 08 ld [ %g1 + %o0 ], %g3 information->inactive--; 200933c: 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 ]--; 2009340: 86 00 ff ff add %g3, -1, %g3 2009344: c6 20 40 08 st %g3, [ %g1 + %o0 ] information->inactive--; 2009348: 82 00 bf ff add %g2, -1, %g1 200934c: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2009350: 81 c7 e0 08 ret 2009354: 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 ); 2009358: 40 00 00 10 call 2009398 <_Objects_Extend_information> 200935c: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 2009360: 7f ff fd 2d call 2008814 <_Chain_Get> 2009364: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2009368: b0 92 20 00 orcc %o0, 0, %i0 200936c: 32 bf ff ed bne,a 2009320 <_Objects_Allocate+0x44> 2009370: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 ); } #endif return the_object; } 2009374: 81 c7 e0 08 ret 2009378: 81 e8 00 00 restore =============================================================================== 02009398 <_Objects_Extend_information>: */ void _Objects_Extend_information( Objects_Information *information ) { 2009398: 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 ) 200939c: e0 06 20 34 ld [ %i0 + 0x34 ], %l0 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20093a0: f8 16 20 0a lduh [ %i0 + 0xa ], %i4 index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 20093a4: 80 a4 20 00 cmp %l0, 0 20093a8: 02 80 00 a6 be 2009640 <_Objects_Extend_information+0x2a8> 20093ac: f2 16 20 10 lduh [ %i0 + 0x10 ], %i1 block_count = 0; else { block_count = information->maximum / information->allocation_size; 20093b0: f4 16 20 14 lduh [ %i0 + 0x14 ], %i2 20093b4: b3 2e 60 10 sll %i1, 0x10, %i1 20093b8: 92 10 00 1a mov %i2, %o1 20093bc: 40 00 40 83 call 20195c8 <.udiv> 20093c0: 91 36 60 10 srl %i1, 0x10, %o0 20093c4: a7 2a 20 10 sll %o0, 0x10, %l3 20093c8: a7 34 e0 10 srl %l3, 0x10, %l3 for ( ; block < block_count; block++ ) { 20093cc: 80 a4 e0 00 cmp %l3, 0 20093d0: 02 80 00 a3 be 200965c <_Objects_Extend_information+0x2c4><== NEVER TAKEN 20093d4: 90 10 00 1a mov %i2, %o0 if ( information->object_blocks[ block ] == NULL ) { 20093d8: c2 04 00 00 ld [ %l0 ], %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 20093dc: ba 10 00 1c mov %i4, %i5 block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 20093e0: 80 a0 60 00 cmp %g1, 0 20093e4: 12 80 00 08 bne 2009404 <_Objects_Extend_information+0x6c><== ALWAYS TAKEN 20093e8: b6 10 20 00 clr %i3 do_extend = false; 20093ec: 10 80 00 a0 b 200966c <_Objects_Extend_information+0x2d4> <== NOT EXECUTED 20093f0: b4 10 20 00 clr %i2 <== NOT EXECUTED block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { if ( information->object_blocks[ block ] == NULL ) { 20093f4: c2 04 00 01 ld [ %l0 + %g1 ], %g1 20093f8: 80 a0 60 00 cmp %g1, 0 20093fc: 22 80 00 08 be,a 200941c <_Objects_Extend_information+0x84> 2009400: b4 10 20 00 clr %i2 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 2009404: b6 06 e0 01 inc %i3 if ( information->object_blocks[ block ] == NULL ) { do_extend = false; break; } else index_base += information->allocation_size; 2009408: ba 07 40 1a add %i5, %i2, %i5 if ( information->object_blocks == NULL ) block_count = 0; else { block_count = information->maximum / information->allocation_size; for ( ; block < block_count; block++ ) { 200940c: 80 a4 c0 1b cmp %l3, %i3 2009410: 18 bf ff f9 bgu 20093f4 <_Objects_Extend_information+0x5c> 2009414: 83 2e e0 02 sll %i3, 2, %g1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2009418: b4 10 20 01 mov 1, %i2 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 200941c: b3 36 60 10 srl %i1, 0x10, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2009420: 03 00 00 3f sethi %hi(0xfc00), %g1 } else index_base += information->allocation_size; } } maximum = (uint32_t) information->maximum + information->allocation_size; 2009424: b2 06 40 08 add %i1, %o0, %i1 /* * We need to limit the number of objects to the maximum number * representable in the index portion of the object Id. In the * case of 16-bit Ids, this is only 256 object instances. */ if ( maximum > OBJECTS_ID_FINAL_INDEX ) { 2009428: 82 10 63 ff or %g1, 0x3ff, %g1 200942c: 80 a6 40 01 cmp %i1, %g1 2009430: 18 80 00 93 bgu 200967c <_Objects_Extend_information+0x2e4> 2009434: 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; 2009438: 40 00 40 2a call 20194e0 <.umul> 200943c: d2 06 20 18 ld [ %i0 + 0x18 ], %o1 if ( information->auto_extend ) { 2009440: c2 0e 20 12 ldub [ %i0 + 0x12 ], %g1 2009444: 80 a0 60 00 cmp %g1, 0 2009448: 02 80 00 6a be 20095f0 <_Objects_Extend_information+0x258> 200944c: 01 00 00 00 nop new_object_block = _Workspace_Allocate( block_size ); 2009450: 40 00 09 65 call 200b9e4 <_Workspace_Allocate> 2009454: 01 00 00 00 nop if ( !new_object_block ) 2009458: a0 92 20 00 orcc %o0, 0, %l0 200945c: 02 80 00 88 be 200967c <_Objects_Extend_information+0x2e4> 2009460: 01 00 00 00 nop } /* * Do we need to grow the tables? */ if ( do_extend ) { 2009464: 80 8e a0 ff btst 0xff, %i2 2009468: 22 80 00 3f be,a 2009564 <_Objects_Extend_information+0x1cc> 200946c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 */ /* * Up the block count and maximum */ block_count++; 2009470: b4 04 e0 01 add %l3, 1, %i2 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2009474: 91 2e a0 01 sll %i2, 1, %o0 2009478: 90 02 00 1a add %o0, %i2, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); 200947c: 90 06 40 08 add %i1, %o0, %o0 /* * Allocate the tables and break it up. */ block_size = block_count * (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + 2009480: 90 02 00 1c add %o0, %i4, %o0 ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); 2009484: 40 00 09 58 call 200b9e4 <_Workspace_Allocate> 2009488: 91 2a 20 02 sll %o0, 2, %o0 if ( !object_blocks ) { 200948c: a2 92 20 00 orcc %o0, 0, %l1 2009490: 02 80 00 79 be 2009674 <_Objects_Extend_information+0x2dc> 2009494: b5 2e a0 02 sll %i2, 2, %i2 * Take the block count down. Saves all the (block_count - 1) * in the copies. */ block_count--; if ( information->maximum > minimum_index ) { 2009498: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 200949c: 80 a7 00 01 cmp %i4, %g1 20094a0: a4 04 40 1a add %l1, %i2, %l2 20094a4: 0a 80 00 57 bcs 2009600 <_Objects_Extend_information+0x268> 20094a8: b4 04 80 1a add %l2, %i2, %i2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20094ac: 80 a7 20 00 cmp %i4, 0 20094b0: 02 80 00 07 be 20094cc <_Objects_Extend_information+0x134><== NEVER TAKEN 20094b4: 82 10 20 00 clr %g1 * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 20094b8: 85 28 60 02 sll %g1, 2, %g2 } else { /* * Deal with the special case of the 0 to minimum_index */ for ( index = 0; index < minimum_index; index++ ) { 20094bc: 82 00 60 01 inc %g1 20094c0: 80 a7 00 01 cmp %i4, %g1 20094c4: 18 bf ff fd bgu 20094b8 <_Objects_Extend_information+0x120><== NEVER TAKEN 20094c8: c0 20 80 1a clr [ %g2 + %i2 ] 20094cc: a7 2c e0 02 sll %l3, 2, %l3 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20094d0: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 } /* * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; 20094d4: c0 24 40 13 clr [ %l1 + %l3 ] inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 20094d8: 86 07 40 03 add %i5, %g3, %g3 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 20094dc: 80 a7 40 03 cmp %i5, %g3 20094e0: 1a 80 00 0a bcc 2009508 <_Objects_Extend_information+0x170><== NEVER TAKEN 20094e4: c0 24 80 13 clr [ %l2 + %l3 ] * information - object information table * * Output parameters: NONE */ void _Objects_Extend_information( 20094e8: 83 2f 60 02 sll %i5, 2, %g1 20094ec: 84 10 00 1d mov %i5, %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 20094f0: 82 06 80 01 add %i2, %g1, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; 20094f4: c0 20 40 00 clr [ %g1 ] object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); index++ ) { 20094f8: 84 00 a0 01 inc %g2 * Initialise the new entries in the table. */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; 20094fc: 80 a0 c0 02 cmp %g3, %g2 2009500: 18 bf ff fd bgu 20094f4 <_Objects_Extend_information+0x15c> 2009504: 82 00 60 04 add %g1, 4, %g1 index < ( information->allocation_size + index_base ); index++ ) { local_table[ index ] = NULL; } _ISR_Disable( level ); 2009508: 7f ff e4 6c call 20026b8 200950c: 01 00 00 00 nop uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2009510: 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( 2009514: c4 16 20 04 lduh [ %i0 + 4 ], %g2 local_table[ index ] = NULL; } _ISR_Disable( level ); old_tables = information->object_blocks; 2009518: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 information->object_blocks = object_blocks; information->inactive_per_block = inactive_per_block; information->local_table = local_table; information->maximum = (Objects_Maximum) maximum; 200951c: f2 36 20 10 sth %i1, [ %i0 + 0x10 ] 2009520: 87 28 e0 18 sll %g3, 0x18, %g3 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009524: 85 28 a0 1b sll %g2, 0x1b, %g2 _ISR_Disable( level ); old_tables = information->object_blocks; information->object_blocks = object_blocks; 2009528: e2 26 20 34 st %l1, [ %i0 + 0x34 ] information->inactive_per_block = inactive_per_block; 200952c: e4 26 20 30 st %l2, [ %i0 + 0x30 ] information->local_table = local_table; 2009530: f4 26 20 1c st %i2, [ %i0 + 0x1c ] information->maximum = (Objects_Maximum) maximum; information->maximum_id = _Objects_Build_id( 2009534: b3 2e 60 10 sll %i1, 0x10, %i1 uint32_t the_class, uint32_t node, uint32_t index ) { return (( (Objects_Id) the_api ) << OBJECTS_API_START_BIT) | 2009538: 03 00 00 40 sethi %hi(0x10000), %g1 200953c: b3 36 60 10 srl %i1, 0x10, %i1 2009540: 82 10 c0 01 or %g3, %g1, %g1 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009544: 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) | 2009548: 82 10 40 19 or %g1, %i1, %g1 200954c: c2 26 20 0c st %g1, [ %i0 + 0xc ] information->the_class, _Objects_Local_node, information->maximum ); _ISR_Enable( level ); 2009550: 7f ff e4 5e call 20026c8 2009554: 01 00 00 00 nop _Workspace_Free( old_tables ); 2009558: 40 00 09 2b call 200ba04 <_Workspace_Free> 200955c: 90 10 00 1c mov %i4, %o0 } /* * Assign the new object block to the object block table. */ information->object_blocks[ block ] = new_object_block; 2009560: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2009564: b7 2e e0 02 sll %i3, 2, %i3 2009568: e0 20 40 1b st %l0, [ %g1 + %i3 ] /* * Initialize objects .. add to a local chain first. */ _Chain_Initialize( 200956c: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 2009570: d4 16 20 14 lduh [ %i0 + 0x14 ], %o2 2009574: d2 00 40 1b ld [ %g1 + %i3 ], %o1 2009578: d6 06 20 18 ld [ %i0 + 0x18 ], %o3 200957c: 90 07 bf f4 add %fp, -12, %o0 2009580: 7f ff fc b4 call 2008850 <_Chain_Initialize> 2009584: 39 00 00 40 sethi %hi(0x10000), %i4 /* * Move from the local chain, initialise, then append to the inactive chain */ index = index_base; while ((the_object = (Objects_Control *) _Chain_Get( &Inactive )) != NULL ) { 2009588: 10 80 00 0d b 20095bc <_Objects_Extend_information+0x224> 200958c: b4 06 20 20 add %i0, 0x20, %i2 the_object->id = _Objects_Build_id( 2009590: c6 16 20 04 lduh [ %i0 + 4 ], %g3 2009594: 85 28 a0 18 sll %g2, 0x18, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 2009598: 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) | 200959c: 84 10 80 1c or %g2, %i4, %g2 (( (Objects_Id) the_class ) << OBJECTS_CLASS_START_BIT) | 20095a0: 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) | 20095a4: 84 10 80 1d or %g2, %i5, %g2 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20095a8: 90 10 00 1a mov %i2, %o0 20095ac: 92 10 00 01 mov %g1, %o1 index++; 20095b0: ba 07 60 01 inc %i5 information->the_class, _Objects_Local_node, index ); _Chain_Append( &information->Inactive, &the_object->Node ); 20095b4: 7f ff fc 8d call 20087e8 <_Chain_Append> 20095b8: 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 ) { 20095bc: 7f ff fc 96 call 2008814 <_Chain_Get> 20095c0: 90 07 bf f4 add %fp, -12, %o0 20095c4: 82 92 20 00 orcc %o0, 0, %g1 20095c8: 32 bf ff f2 bne,a 2009590 <_Objects_Extend_information+0x1f8> 20095cc: c4 06 00 00 ld [ %i0 ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20095d0: c8 16 20 14 lduh [ %i0 + 0x14 ], %g4 20095d4: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20095d8: c4 16 20 2c lduh [ %i0 + 0x2c ], %g2 _Chain_Append( &information->Inactive, &the_object->Node ); index++; } information->inactive_per_block[ block ] = information->allocation_size; 20095dc: c8 20 c0 1b st %g4, [ %g3 + %i3 ] information->inactive = (Objects_Maximum)(information->inactive + information->allocation_size); 20095e0: 82 00 80 04 add %g2, %g4, %g1 index++; } information->inactive_per_block[ block ] = information->allocation_size; information->inactive = 20095e4: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] 20095e8: 81 c7 e0 08 ret 20095ec: 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 ); 20095f0: 40 00 09 0b call 200ba1c <_Workspace_Allocate_or_fatal_error> 20095f4: 01 00 00 00 nop 20095f8: 10 bf ff 9b b 2009464 <_Objects_Extend_information+0xcc> 20095fc: a0 10 00 08 mov %o0, %l0 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2009600: d2 06 20 34 ld [ %i0 + 0x34 ], %o1 information->object_blocks, block_count * sizeof(void*) ); 2009604: a7 2c e0 02 sll %l3, 2, %l3 /* * Copy each section of the table over. This has to be performed as * separate parts as size of each block has changed. */ memcpy( object_blocks, 2009608: 40 00 1e 64 call 2010f98 200960c: 94 10 00 13 mov %l3, %o2 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, 2009610: d2 06 20 30 ld [ %i0 + 0x30 ], %o1 2009614: 94 10 00 13 mov %l3, %o2 2009618: 40 00 1e 60 call 2010f98 200961c: 90 10 00 12 mov %l2, %o0 information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2009620: c2 16 20 10 lduh [ %i0 + 0x10 ], %g1 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 2009624: d2 06 20 1c ld [ %i0 + 0x1c ], %o1 information->local_table, (information->maximum + minimum_index) * sizeof(Objects_Control *) ); 2009628: b8 07 00 01 add %i4, %g1, %i4 information->object_blocks, block_count * sizeof(void*) ); memcpy( inactive_per_block, information->inactive_per_block, block_count * sizeof(uint32_t) ); memcpy( local_table, 200962c: 90 10 00 1a mov %i2, %o0 2009630: 40 00 1e 5a call 2010f98 2009634: 95 2f 20 02 sll %i4, 2, %o2 */ object_blocks[block_count] = NULL; inactive_per_block[block_count] = 0; for ( index=index_base ; index < ( information->allocation_size + index_base ); 2009638: 10 bf ff a7 b 20094d4 <_Objects_Extend_information+0x13c> 200963c: c6 16 20 14 lduh [ %i0 + 0x14 ], %g3 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) 2009640: 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 ); 2009644: ba 10 00 1c mov %i4, %i5 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2009648: b4 10 20 01 mov 1, %i2 minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 200964c: b6 10 20 00 clr %i3 /* if ( information->maximum < minimum_index ) */ if ( information->object_blocks == NULL ) block_count = 0; 2009650: a6 10 20 00 clr %l3 2009654: 10 bf ff 72 b 200941c <_Objects_Extend_information+0x84> 2009658: b3 2e 60 10 sll %i1, 0x10, %i1 /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; minimum_index = _Objects_Get_index( information->minimum_id ); 200965c: ba 10 00 1c mov %i4, %i5 <== NOT EXECUTED /* * Search for a free block of indexes. If we do NOT need to allocate or * extend the block table, then we will change do_extend. */ do_extend = true; 2009660: b4 10 20 01 mov 1, %i2 <== NOT EXECUTED minimum_index = _Objects_Get_index( information->minimum_id ); index_base = minimum_index; block = 0; 2009664: 10 bf ff 6e b 200941c <_Objects_Extend_information+0x84> <== NOT EXECUTED 2009668: b6 10 20 00 clr %i3 <== NOT EXECUTED 200966c: 10 bf ff 6c b 200941c <_Objects_Extend_information+0x84> <== NOT EXECUTED 2009670: b6 10 20 00 clr %i3 <== NOT EXECUTED (sizeof(void *) + sizeof(uint32_t) + sizeof(Objects_Name *)) + ((maximum + minimum_index) * sizeof(Objects_Control *)); object_blocks = (void**) _Workspace_Allocate( block_size ); if ( !object_blocks ) { _Workspace_Free( new_object_block ); 2009674: 40 00 08 e4 call 200ba04 <_Workspace_Free> 2009678: 90 10 00 10 mov %l0, %o0 return; 200967c: 81 c7 e0 08 ret 2009680: 81 e8 00 00 restore =============================================================================== 02009728 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2009728: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 200972c: 80 a6 60 00 cmp %i1, 0 2009730: 02 80 00 17 be 200978c <_Objects_Get_information+0x64> 2009734: ba 10 20 00 clr %i5 /* * This call implicitly validates the_api so we do not call * _Objects_Is_api_valid above here. */ the_class_api_maximum = _Objects_API_maximum_class( the_api ); 2009738: 40 00 13 c2 call 200e640 <_Objects_API_maximum_class> 200973c: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2009740: 80 a2 20 00 cmp %o0, 0 2009744: 02 80 00 12 be 200978c <_Objects_Get_information+0x64> 2009748: 80 a2 00 19 cmp %o0, %i1 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 200974c: 0a 80 00 10 bcs 200978c <_Objects_Get_information+0x64> 2009750: 03 00 80 7a sethi %hi(0x201e800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2009754: b1 2e 20 02 sll %i0, 2, %i0 2009758: 82 10 61 98 or %g1, 0x198, %g1 200975c: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2009760: 80 a0 60 00 cmp %g1, 0 2009764: 02 80 00 0a be 200978c <_Objects_Get_information+0x64> <== NEVER TAKEN 2009768: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 200976c: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2009770: 80 a7 60 00 cmp %i5, 0 2009774: 02 80 00 06 be 200978c <_Objects_Get_information+0x64> <== NEVER TAKEN 2009778: 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 ) 200977c: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2009780: 80 a0 00 01 cmp %g0, %g1 2009784: 82 60 20 00 subx %g0, 0, %g1 2009788: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 200978c: 81 c7 e0 08 ret 2009790: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02018194 <_Objects_Get_name_as_string>: char *_Objects_Get_name_as_string( Objects_Id id, size_t length, char *name ) { 2018194: 9d e3 bf 90 save %sp, -112, %sp char lname[5]; Objects_Control *the_object; Objects_Locations location; Objects_Id tmpId; if ( length == 0 ) 2018198: 80 a6 60 00 cmp %i1, 0 201819c: 02 80 00 41 be 20182a0 <_Objects_Get_name_as_string+0x10c> 20181a0: 80 a6 a0 00 cmp %i2, 0 return NULL; if ( name == NULL ) 20181a4: 02 80 00 3a be 201828c <_Objects_Get_name_as_string+0xf8> 20181a8: 80 a6 20 00 cmp %i0, 0 return NULL; tmpId = (id == OBJECTS_ID_OF_SELF) ? _Thread_Executing->Object.id : id; 20181ac: 02 80 00 3a be 2018294 <_Objects_Get_name_as_string+0x100> 20181b0: 03 00 80 c8 sethi %hi(0x2032000), %g1 information = _Objects_Get_information_id( tmpId ); 20181b4: 7f ff df 33 call 200fe80 <_Objects_Get_information_id> 20181b8: 90 10 00 18 mov %i0, %o0 if ( !information ) 20181bc: ba 92 20 00 orcc %o0, 0, %i5 20181c0: 02 80 00 38 be 20182a0 <_Objects_Get_name_as_string+0x10c> 20181c4: 92 10 00 18 mov %i0, %o1 return NULL; the_object = _Objects_Get( information, tmpId, &location ); 20181c8: 7f ff df 6c call 200ff78 <_Objects_Get> 20181cc: 94 07 bf fc add %fp, -4, %o2 switch ( location ) { 20181d0: c2 07 bf fc ld [ %fp + -4 ], %g1 20181d4: 80 a0 60 00 cmp %g1, 0 20181d8: 32 80 00 33 bne,a 20182a4 <_Objects_Get_name_as_string+0x110> 20181dc: b4 10 20 00 clr %i2 return NULL; case OBJECTS_LOCAL: #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) { 20181e0: c2 0f 60 38 ldub [ %i5 + 0x38 ], %g1 20181e4: 80 a0 60 00 cmp %g1, 0 20181e8: 32 80 00 31 bne,a 20182ac <_Objects_Get_name_as_string+0x118> 20181ec: c4 02 20 0c ld [ %o0 + 0xc ], %g2 s = the_object->name.name_p; } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; 20181f0: c2 02 20 0c ld [ %o0 + 0xc ], %g1 lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; lname[ 4 ] = '\0'; 20181f4: c0 2f bf f4 clrb [ %fp + -12 ] { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; lname[ 1 ] = (u32_name >> 16) & 0xff; lname[ 2 ] = (u32_name >> 8) & 0xff; 20181f8: 85 30 60 08 srl %g1, 8, %g2 } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 20181fc: 89 30 60 18 srl %g1, 0x18, %g4 lname[ 1 ] = (u32_name >> 16) & 0xff; 2018200: 87 30 60 10 srl %g1, 0x10, %g3 lname[ 2 ] = (u32_name >> 8) & 0xff; 2018204: c4 2f bf f2 stb %g2, [ %fp + -14 ] } else #endif { uint32_t u32_name = (uint32_t) the_object->name.name_u32; lname[ 0 ] = (u32_name >> 24) & 0xff; 2018208: c8 2f bf f0 stb %g4, [ %fp + -16 ] lname[ 1 ] = (u32_name >> 16) & 0xff; 201820c: c6 2f bf f1 stb %g3, [ %fp + -15 ] lname[ 2 ] = (u32_name >> 8) & 0xff; lname[ 3 ] = (u32_name >> 0) & 0xff; 2018210: c2 2f bf f3 stb %g1, [ %fp + -13 ] lname[ 4 ] = '\0'; s = lname; 2018214: 84 07 bf f0 add %fp, -16, %g2 } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2018218: b2 86 7f ff addcc %i1, -1, %i1 201821c: 02 80 00 1a be 2018284 <_Objects_Get_name_as_string+0xf0> <== NEVER TAKEN 2018220: 82 10 00 1a mov %i2, %g1 2018224: c8 48 80 00 ldsb [ %g2 ], %g4 2018228: 80 a1 20 00 cmp %g4, 0 201822c: 02 80 00 16 be 2018284 <_Objects_Get_name_as_string+0xf0> 2018230: c6 08 80 00 ldub [ %g2 ], %g3 2018234: 31 00 80 c2 sethi %hi(0x2030800), %i0 * This method objects the name of an object and returns its name * in the form of a C string. It attempts to be careful about * overflowing the user's string and about returning unprintable characters. */ char *_Objects_Get_name_as_string( 2018238: b2 06 80 19 add %i2, %i1, %i1 201823c: 10 80 00 05 b 2018250 <_Objects_Get_name_as_string+0xbc> 2018240: b0 16 23 d8 or %i0, 0x3d8, %i0 s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2018244: 80 a1 20 00 cmp %g4, 0 2018248: 02 80 00 0f be 2018284 <_Objects_Get_name_as_string+0xf0> 201824c: c6 08 80 00 ldub [ %g2 ], %g3 *d = (isprint((unsigned char)*s)) ? *s : '*'; 2018250: fa 06 00 00 ld [ %i0 ], %i5 2018254: 88 08 e0 ff and %g3, 0xff, %g4 2018258: 88 07 40 04 add %i5, %g4, %g4 201825c: c8 49 20 01 ldsb [ %g4 + 1 ], %g4 2018260: 80 89 20 97 btst 0x97, %g4 2018264: 12 80 00 03 bne 2018270 <_Objects_Get_name_as_string+0xdc> 2018268: 84 00 a0 01 inc %g2 201826c: 86 10 20 2a mov 0x2a, %g3 2018270: c6 28 40 00 stb %g3, [ %g1 ] s = lname; } d = name; if ( s ) { for ( i=0 ; i<(length-1) && *s ; i++, s++, d++ ) { 2018274: 82 00 60 01 inc %g1 2018278: 80 a0 40 19 cmp %g1, %i1 201827c: 32 bf ff f2 bne,a 2018244 <_Objects_Get_name_as_string+0xb0> 2018280: c8 48 80 00 ldsb [ %g2 ], %g4 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 2018284: 7f ff e3 75 call 2011058 <_Thread_Enable_dispatch> 2018288: c0 28 40 00 clrb [ %g1 ] return name; } return NULL; /* unreachable path */ } 201828c: 81 c7 e0 08 ret 2018290: 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; 2018294: c2 00 62 bc ld [ %g1 + 0x2bc ], %g1 2018298: 10 bf ff c7 b 20181b4 <_Objects_Get_name_as_string+0x20> 201829c: f0 00 60 08 ld [ %g1 + 8 ], %i0 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* not supported */ #endif case OBJECTS_ERROR: return NULL; 20182a0: b4 10 20 00 clr %i2 _Thread_Enable_dispatch(); return name; } return NULL; /* unreachable path */ } 20182a4: 81 c7 e0 08 ret 20182a8: 91 e8 00 1a restore %g0, %i2, %o0 lname[ 4 ] = '\0'; s = lname; } d = name; if ( s ) { 20182ac: 80 a0 a0 00 cmp %g2, 0 20182b0: 12 bf ff da bne 2018218 <_Objects_Get_name_as_string+0x84> 20182b4: 82 10 00 1a mov %i2, %g1 *d = (isprint((unsigned char)*s)) ? *s : '*'; } } *d = '\0'; _Thread_Enable_dispatch(); 20182b8: 7f ff e3 68 call 2011058 <_Thread_Enable_dispatch> 20182bc: c0 28 40 00 clrb [ %g1 ] 20182c0: 30 bf ff f3 b,a 201828c <_Objects_Get_name_as_string+0xf8> =============================================================================== 0201ad98 <_Objects_Get_next>: Objects_Information *information, Objects_Id id, Objects_Locations *location_p, Objects_Id *next_id_p ) { 201ad98: 9d e3 bf a0 save %sp, -96, %sp Objects_Control *object; Objects_Id next_id; if ( !information ) return NULL; 201ad9c: 90 10 20 00 clr %o0 ) { Objects_Control *object; Objects_Id next_id; if ( !information ) 201ada0: 80 a6 20 00 cmp %i0, 0 201ada4: 02 80 00 19 be 201ae08 <_Objects_Get_next+0x70> 201ada8: ba 10 00 18 mov %i0, %i5 return NULL; if ( !location_p ) 201adac: 80 a6 a0 00 cmp %i2, 0 201adb0: 02 80 00 16 be 201ae08 <_Objects_Get_next+0x70> 201adb4: 80 a6 e0 00 cmp %i3, 0 return NULL; if ( !next_id_p ) 201adb8: 02 80 00 14 be 201ae08 <_Objects_Get_next+0x70> 201adbc: 83 2e 60 10 sll %i1, 0x10, %g1 return NULL; if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) 201adc0: 80 a0 60 00 cmp %g1, 0 201adc4: 22 80 00 13 be,a 201ae10 <_Objects_Get_next+0x78> 201adc8: 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) 201adcc: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 201add0: 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); 201add4: 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) 201add8: 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); 201addc: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 201ade0: 80 a0 80 01 cmp %g2, %g1 201ade4: 0a 80 00 13 bcs 201ae30 <_Objects_Get_next+0x98> 201ade8: 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); 201adec: 7f ff d4 63 call 200ff78 <_Objects_Get> 201adf0: b2 06 60 01 inc %i1 next_id++; } while (*location_p != OBJECTS_LOCAL); 201adf4: c2 06 80 00 ld [ %i2 ], %g1 201adf8: 80 a0 60 00 cmp %g1, 0 201adfc: 32 bf ff f5 bne,a 201add0 <_Objects_Get_next+0x38> 201ae00: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 *next_id_p = next_id; 201ae04: f2 26 c0 00 st %i1, [ %i3 ] return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; } 201ae08: 81 c7 e0 08 ret 201ae0c: 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) 201ae10: c4 17 60 10 lduh [ %i5 + 0x10 ], %g2 201ae14: 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); 201ae18: 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) 201ae1c: 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); 201ae20: 90 10 00 1d mov %i5, %o0 else next_id = id; do { /* walked off end of list? */ if (_Objects_Get_index(next_id) > information->maximum) 201ae24: 80 a0 80 01 cmp %g2, %g1 201ae28: 1a bf ff f1 bcc 201adec <_Objects_Get_next+0x54> <== ALWAYS TAKEN 201ae2c: 94 10 00 1a mov %i2, %o2 { *location_p = OBJECTS_ERROR; 201ae30: 82 10 20 01 mov 1, %g1 201ae34: c2 26 80 00 st %g1, [ %i2 ] *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; return 0; 201ae38: 90 10 20 00 clr %o0 *next_id_p = next_id; return object; final: *next_id_p = OBJECTS_ID_FINAL; 201ae3c: 82 10 3f ff mov -1, %g1 201ae40: c2 26 c0 00 st %g1, [ %i3 ] return 0; } 201ae44: 81 c7 e0 08 ret 201ae48: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200fff0 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200fff0: 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; 200fff4: 80 a6 20 00 cmp %i0, 0 200fff8: 12 80 00 06 bne 2010010 <_Objects_Id_to_name+0x20> 200fffc: 83 36 20 18 srl %i0, 0x18, %g1 2010000: 03 00 80 c8 sethi %hi(0x2032000), %g1 2010004: c2 00 62 bc ld [ %g1 + 0x2bc ], %g1 ! 20322bc <_Per_CPU_Information+0xc> 2010008: f0 00 60 08 ld [ %g1 + 8 ], %i0 201000c: 83 36 20 18 srl %i0, 0x18, %g1 2010010: 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 ) 2010014: 84 00 7f ff add %g1, -1, %g2 2010018: 80 a0 a0 02 cmp %g2, 2 201001c: 18 80 00 12 bgu 2010064 <_Objects_Id_to_name+0x74> 2010020: ba 10 20 03 mov 3, %i5 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 2010024: 83 28 60 02 sll %g1, 2, %g1 2010028: 05 00 80 c7 sethi %hi(0x2031c00), %g2 201002c: 84 10 a0 98 or %g2, 0x98, %g2 ! 2031c98 <_Objects_Information_table> 2010030: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2010034: 80 a0 60 00 cmp %g1, 0 2010038: 02 80 00 0b be 2010064 <_Objects_Id_to_name+0x74> 201003c: 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 ]; 2010040: 85 28 a0 02 sll %g2, 2, %g2 2010044: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2010048: 80 a2 20 00 cmp %o0, 0 201004c: 02 80 00 06 be 2010064 <_Objects_Id_to_name+0x74> <== NEVER TAKEN 2010050: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2010054: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2010058: 80 a0 60 00 cmp %g1, 0 201005c: 02 80 00 04 be 201006c <_Objects_Id_to_name+0x7c> <== ALWAYS TAKEN 2010060: 92 10 00 18 mov %i0, %o1 return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2010064: 81 c7 e0 08 ret 2010068: 91 e8 00 1d restore %g0, %i5, %o0 #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 201006c: 7f ff ff c3 call 200ff78 <_Objects_Get> 2010070: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2010074: 80 a2 20 00 cmp %o0, 0 2010078: 02 bf ff fb be 2010064 <_Objects_Id_to_name+0x74> 201007c: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2010080: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2010084: ba 10 20 00 clr %i5 the_object = _Objects_Get( information, tmpId, &ignored_location ); if ( !the_object ) return OBJECTS_INVALID_ID; *name = the_object->name; _Thread_Enable_dispatch(); 2010088: 40 00 03 f4 call 2011058 <_Thread_Enable_dispatch> 201008c: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2010090: 30 bf ff f5 b,a 2010064 <_Objects_Id_to_name+0x74> =============================================================================== 02009a38 <_Objects_Shrink_information>: */ void _Objects_Shrink_information( Objects_Information *information ) { 2009a38: 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 ); 2009a3c: fa 16 20 0a lduh [ %i0 + 0xa ], %i5 block_count = (information->maximum - index_base) / 2009a40: f8 16 20 14 lduh [ %i0 + 0x14 ], %i4 2009a44: d0 16 20 10 lduh [ %i0 + 0x10 ], %o0 2009a48: 92 10 00 1c mov %i4, %o1 2009a4c: 40 00 3e df call 20195c8 <.udiv> 2009a50: 90 22 00 1d sub %o0, %i5, %o0 information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009a54: 80 a2 20 00 cmp %o0, 0 2009a58: 02 80 00 34 be 2009b28 <_Objects_Shrink_information+0xf0> <== NEVER TAKEN 2009a5c: 01 00 00 00 nop if ( information->inactive_per_block[ block ] == 2009a60: c8 06 20 30 ld [ %i0 + 0x30 ], %g4 2009a64: c2 01 00 00 ld [ %g4 ], %g1 2009a68: 80 a7 00 01 cmp %i4, %g1 2009a6c: 02 80 00 0f be 2009aa8 <_Objects_Shrink_information+0x70> <== NEVER TAKEN 2009a70: 82 10 20 00 clr %g1 2009a74: 10 80 00 07 b 2009a90 <_Objects_Shrink_information+0x58> 2009a78: b6 10 20 04 mov 4, %i3 * the_block - the block to remove * * Output parameters: NONE */ void _Objects_Shrink_information( 2009a7c: 86 06 e0 04 add %i3, 4, %g3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { if ( information->inactive_per_block[ block ] == 2009a80: 80 a7 00 02 cmp %i4, %g2 2009a84: 02 80 00 0a be 2009aac <_Objects_Shrink_information+0x74> 2009a88: ba 07 40 1c add %i5, %i4, %i5 2009a8c: b6 10 00 03 mov %g3, %i3 index_base = _Objects_Get_index( information->minimum_id ); block_count = (information->maximum - index_base) / information->allocation_size; for ( block = 0; block < block_count; block++ ) { 2009a90: 82 00 60 01 inc %g1 2009a94: 80 a0 40 08 cmp %g1, %o0 2009a98: 32 bf ff f9 bne,a 2009a7c <_Objects_Shrink_information+0x44> 2009a9c: c4 01 00 1b ld [ %g4 + %i3 ], %g2 2009aa0: 81 c7 e0 08 ret 2009aa4: 81 e8 00 00 restore if ( information->inactive_per_block[ block ] == 2009aa8: b6 10 20 00 clr %i3 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2009aac: 10 80 00 06 b 2009ac4 <_Objects_Shrink_information+0x8c> 2009ab0: d0 06 20 20 ld [ %i0 + 0x20 ], %o0 if ((index >= index_base) && (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); } } while ( the_object ); 2009ab4: 80 a7 20 00 cmp %i4, 0 2009ab8: 22 80 00 12 be,a 2009b00 <_Objects_Shrink_information+0xc8> 2009abc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 index = _Objects_Get_index( the_object->id ); /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; 2009ac0: 90 10 00 1c mov %i4, %o0 * Assume the Inactive chain is never empty at this point */ the_object = (Objects_Control *) _Chain_First( &information->Inactive ); do { index = _Objects_Get_index( the_object->id ); 2009ac4: c2 12 20 0a lduh [ %o0 + 0xa ], %g1 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2009ac8: 80 a0 40 1d cmp %g1, %i5 2009acc: 0a bf ff fa bcs 2009ab4 <_Objects_Shrink_information+0x7c> 2009ad0: f8 02 00 00 ld [ %o0 ], %i4 (index < (index_base + information->allocation_size))) { 2009ad4: c4 16 20 14 lduh [ %i0 + 0x14 ], %g2 2009ad8: 84 07 40 02 add %i5, %g2, %g2 /* * Get the next node before the node is extracted */ extract_me = the_object; the_object = (Objects_Control *) the_object->Node.next; if ((index >= index_base) && 2009adc: 80 a0 40 02 cmp %g1, %g2 2009ae0: 1a bf ff f6 bcc 2009ab8 <_Objects_Shrink_information+0x80> 2009ae4: 80 a7 20 00 cmp %i4, 0 (index < (index_base + information->allocation_size))) { _Chain_Extract( &extract_me->Node ); 2009ae8: 40 00 10 f9 call 200decc <_Chain_Extract> 2009aec: 01 00 00 00 nop } } while ( the_object ); 2009af0: 80 a7 20 00 cmp %i4, 0 2009af4: 12 bf ff f4 bne 2009ac4 <_Objects_Shrink_information+0x8c><== ALWAYS TAKEN 2009af8: 90 10 00 1c mov %i4, %o0 /* * Free the memory and reset the structures in the object' information */ _Workspace_Free( information->object_blocks[ block ] ); 2009afc: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 <== NOT EXECUTED 2009b00: 40 00 07 c1 call 200ba04 <_Workspace_Free> 2009b04: d0 00 40 1b ld [ %g1 + %i3 ], %o0 information->object_blocks[ block ] = NULL; 2009b08: c2 06 20 34 ld [ %i0 + 0x34 ], %g1 information->inactive_per_block[ block ] = 0; information->inactive -= information->allocation_size; 2009b0c: 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; 2009b10: c0 20 40 1b clr [ %g1 + %i3 ] information->inactive_per_block[ block ] = 0; 2009b14: c6 06 20 30 ld [ %i0 + 0x30 ], %g3 information->inactive -= information->allocation_size; 2009b18: 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; 2009b1c: c0 20 c0 1b clr [ %g3 + %i3 ] information->inactive -= information->allocation_size; 2009b20: 82 20 80 01 sub %g2, %g1, %g1 2009b24: c2 36 20 2c sth %g1, [ %i0 + 0x2c ] return; 2009b28: 81 c7 e0 08 ret 2009b2c: 81 e8 00 00 restore =============================================================================== 0200fc10 <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200fc10: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200fc14: f4 06 20 08 ld [ %i0 + 8 ], %i2 200fc18: 3b 00 80 7b sethi %hi(0x201ec00), %i5 200fc1c: b3 36 a0 18 srl %i2, 0x18, %i1 200fc20: ba 17 62 48 or %i5, 0x248, %i5 for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { void *value = key->Values [ thread_api ][ thread_index ]; 200fc24: b5 2e a0 10 sll %i2, 0x10, %i2 200fc28: b2 0e 60 07 and %i1, 7, %i1 200fc2c: b5 36 a0 0e srl %i2, 0xe, %i2 200fc30: b2 06 60 04 add %i1, 4, %i1 200fc34: 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 ) { 200fc38: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 200fc3c: 80 a6 e0 00 cmp %i3, 0 200fc40: 02 80 00 20 be 200fcc0 <_POSIX_Keys_Run_destructors+0xb0> 200fc44: b8 10 20 01 mov 1, %i4 200fc48: 84 10 20 01 mov 1, %g2 POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fc4c: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 _POSIX_Keys_Information.local_table [ index ]; 200fc50: 83 2f 20 10 sll %i4, 0x10, %g1 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200fc54: 83 30 60 0e srl %g1, 0xe, %g1 200fc58: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200fc5c: 80 a0 60 00 cmp %g1, 0 200fc60: 02 80 00 10 be 200fca0 <_POSIX_Keys_Run_destructors+0x90> 200fc64: 86 00 40 19 add %g1, %i1, %g3 200fc68: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 200fc6c: 80 a1 20 00 cmp %g4, 0 200fc70: 22 80 00 0d be,a 200fca4 <_POSIX_Keys_Run_destructors+0x94> 200fc74: b8 07 20 01 inc %i4 void *value = key->Values [ thread_api ][ thread_index ]; 200fc78: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200fc7c: d0 00 c0 1a ld [ %g3 + %i2 ], %o0 if ( value != NULL ) { 200fc80: 80 a2 20 00 cmp %o0, 0 200fc84: 22 80 00 08 be,a 200fca4 <_POSIX_Keys_Run_destructors+0x94><== ALWAYS TAKEN 200fc88: b8 07 20 01 inc %i4 key->Values [ thread_api ][ thread_index ] = NULL; 200fc8c: c0 20 c0 1a clr [ %g3 + %i2 ] <== NOT EXECUTED (*key->destructor)( value ); 200fc90: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED 200fc94: 9f c0 40 00 call %g1 <== NOT EXECUTED 200fc98: 01 00 00 00 nop <== NOT EXECUTED done = false; 200fc9c: 84 10 20 00 clr %g2 ! 0 <== NOT EXECUTED Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { 200fca0: b8 07 20 01 inc %i4 200fca4: 83 2f 20 10 sll %i4, 0x10, %g1 200fca8: 83 30 60 10 srl %g1, 0x10, %g1 200fcac: 80 a6 c0 01 cmp %i3, %g1 200fcb0: 1a bf ff e7 bcc 200fc4c <_POSIX_Keys_Run_destructors+0x3c> 200fcb4: 80 88 a0 ff btst 0xff, %g2 * number of iterations. An infinite loop may happen if destructors set * thread specific data. This can be considered dubious. * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { 200fcb8: 22 bf ff e1 be,a 200fc3c <_POSIX_Keys_Run_destructors+0x2c><== NEVER TAKEN 200fcbc: f6 17 60 10 lduh [ %i5 + 0x10 ], %i3 <== NOT EXECUTED 200fcc0: 81 c7 e0 08 ret 200fcc4: 81 e8 00 00 restore =============================================================================== 0200cbf4 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200cbf4: 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( 200cbf8: 11 00 80 ae sethi %hi(0x202b800), %o0 200cbfc: 92 10 00 18 mov %i0, %o1 200cc00: 90 12 23 7c or %o0, 0x37c, %o0 200cc04: 40 00 0d 72 call 20101cc <_Objects_Get> 200cc08: 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 ) { 200cc0c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200cc10: 80 a0 60 00 cmp %g1, 0 200cc14: 22 80 00 08 be,a 200cc34 <_POSIX_Message_queue_Receive_support+0x40> 200cc18: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200cc1c: 40 00 2a f8 call 20177fc <__errno> 200cc20: b0 10 3f ff mov -1, %i0 200cc24: 82 10 20 09 mov 9, %g1 200cc28: c2 22 00 00 st %g1, [ %o0 ] } 200cc2c: 81 c7 e0 08 ret 200cc30: 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 ) { 200cc34: 84 08 60 03 and %g1, 3, %g2 200cc38: 80 a0 a0 01 cmp %g2, 1 200cc3c: 02 80 00 3a be 200cd24 <_POSIX_Message_queue_Receive_support+0x130> 200cc40: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EBADF ); } the_mq = the_mq_fd->Queue; 200cc44: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200cc48: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200cc4c: 80 a0 80 1a cmp %g2, %i2 200cc50: 18 80 00 24 bgu 200cce0 <_POSIX_Message_queue_Receive_support+0xec> 200cc54: 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; 200cc58: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200cc5c: 80 a7 20 00 cmp %i4, 0 200cc60: 12 80 00 1b bne 200cccc <_POSIX_Message_queue_Receive_support+0xd8> 200cc64: 98 10 20 00 clr %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200cc68: 9a 10 00 1d mov %i5, %o5 200cc6c: 90 02 20 1c add %o0, 0x1c, %o0 200cc70: 92 10 00 18 mov %i0, %o1 200cc74: 94 10 00 19 mov %i1, %o2 200cc78: 96 07 bf fc add %fp, -4, %o3 200cc7c: 40 00 08 e8 call 200f01c <_CORE_message_queue_Seize> 200cc80: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200cc84: 40 00 11 59 call 20111e8 <_Thread_Enable_dispatch> 200cc88: 3b 00 80 ae sethi %hi(0x202b800), %i5 if (msg_prio) { 200cc8c: 80 a6 e0 00 cmp %i3, 0 *msg_prio = _POSIX_Message_queue_Priority_from_core( _Thread_Executing->Wait.count 200cc90: ba 17 63 f0 or %i5, 0x3f0, %i5 do_wait, timeout ); _Thread_Enable_dispatch(); if (msg_prio) { 200cc94: 02 80 00 07 be 200ccb0 <_POSIX_Message_queue_Receive_support+0xbc><== NEVER TAKEN 200cc98: 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); 200cc9c: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 200cca0: 85 38 e0 1f sra %g3, 0x1f, %g2 200cca4: 86 18 80 03 xor %g2, %g3, %g3 200cca8: 84 20 c0 02 sub %g3, %g2, %g2 *msg_prio = _POSIX_Message_queue_Priority_from_core( 200ccac: c4 26 c0 00 st %g2, [ %i3 ] _Thread_Executing->Wait.count ); } if ( !_Thread_Executing->Wait.return_code ) 200ccb0: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200ccb4: 80 a0 60 00 cmp %g1, 0 200ccb8: 12 80 00 12 bne 200cd00 <_POSIX_Message_queue_Receive_support+0x10c> 200ccbc: 01 00 00 00 nop return length_out; 200ccc0: f0 07 bf fc ld [ %fp + -4 ], %i0 200ccc4: 81 c7 e0 08 ret 200ccc8: 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; 200cccc: 05 00 00 10 sethi %hi(0x4000), %g2 200ccd0: 82 08 40 02 and %g1, %g2, %g1 200ccd4: 80 a0 00 01 cmp %g0, %g1 200ccd8: 10 bf ff e4 b 200cc68 <_POSIX_Message_queue_Receive_support+0x74> 200ccdc: 98 60 3f ff subx %g0, -1, %o4 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { _Thread_Enable_dispatch(); 200cce0: 40 00 11 42 call 20111e8 <_Thread_Enable_dispatch> 200cce4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200cce8: 40 00 2a c5 call 20177fc <__errno> 200ccec: 01 00 00 00 nop 200ccf0: 82 10 20 7a mov 0x7a, %g1 ! 7a 200ccf4: c2 22 00 00 st %g1, [ %o0 ] 200ccf8: 81 c7 e0 08 ret 200ccfc: 81 e8 00 00 restore } if ( !_Thread_Executing->Wait.return_code ) return length_out; rtems_set_errno_and_return_minus_one( 200cd00: 40 00 2a bf call 20177fc <__errno> 200cd04: b0 10 3f ff mov -1, %i0 200cd08: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200cd0c: b6 10 00 08 mov %o0, %i3 200cd10: 40 00 00 a3 call 200cf9c <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200cd14: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200cd18: d0 26 c0 00 st %o0, [ %i3 ] 200cd1c: 81 c7 e0 08 ret 200cd20: 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(); 200cd24: 40 00 11 31 call 20111e8 <_Thread_Enable_dispatch> 200cd28: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EBADF ); 200cd2c: 40 00 2a b4 call 20177fc <__errno> 200cd30: 01 00 00 00 nop 200cd34: 82 10 20 09 mov 9, %g1 ! 9 200cd38: c2 22 00 00 st %g1, [ %o0 ] 200cd3c: 81 c7 e0 08 ret 200cd40: 81 e8 00 00 restore =============================================================================== 0200f8c4 <_POSIX_Semaphore_Create_support>: size_t name_len, int pshared, unsigned int value, POSIX_Semaphore_Control **the_sem ) { 200f8c4: 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) 200f8c8: 80 a6 a0 00 cmp %i2, 0 200f8cc: 12 80 00 30 bne 200f98c <_POSIX_Semaphore_Create_support+0xc8> 200f8d0: 03 00 80 8d sethi %hi(0x2023400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200f8d4: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> 200f8d8: 84 00 a0 01 inc %g2 200f8dc: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 200f8e0: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 * _POSIX_Semaphore_Allocate */ RTEMS_INLINE_ROUTINE POSIX_Semaphore_Control *_POSIX_Semaphore_Allocate( void ) { return (POSIX_Semaphore_Control *) 200f8e4: 35 00 80 8e sethi %hi(0x2023800), %i2 200f8e8: 7f ff ed a6 call 200af80 <_Objects_Allocate> 200f8ec: 90 16 a0 40 or %i2, 0x40, %o0 ! 2023840 <_POSIX_Semaphore_Information> rtems_set_errno_and_return_minus_one( ENOSYS ); _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { 200f8f0: ba 92 20 00 orcc %o0, 0, %i5 200f8f4: 02 80 00 2c be 200f9a4 <_POSIX_Semaphore_Create_support+0xe0> 200f8f8: 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 ) { 200f8fc: 02 80 00 1e be 200f974 <_POSIX_Semaphore_Create_support+0xb0> 200f900: 92 10 00 19 mov %i1, %o1 name = _Workspace_String_duplicate( name_arg, name_len ); 200f904: 40 00 04 ad call 2010bb8 <_Workspace_String_duplicate> 200f908: 90 10 00 18 mov %i0, %o0 if ( !name ) { 200f90c: b2 92 20 00 orcc %o0, 0, %i1 200f910: 02 80 00 2d be 200f9c4 <_POSIX_Semaphore_Create_support+0x100><== NEVER TAKEN 200f914: 82 10 20 01 mov 1, %g1 } the_semaphore->process_shared = pshared; if ( name ) { the_semaphore->named = true; 200f918: 84 10 20 01 mov 1, %g2 } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f91c: c0 27 60 10 clr [ %i5 + 0x10 ] if ( name ) { the_semaphore->named = true; 200f920: c4 2f 60 14 stb %g2, [ %i5 + 0x14 ] the_semaphore->open_count = 1; 200f924: c2 27 60 18 st %g1, [ %i5 + 0x18 ] the_semaphore->linked = true; 200f928: 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; 200f92c: 82 10 3f ff mov -1, %g1 _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f930: 90 07 60 1c add %i5, 0x1c, %o0 200f934: 92 07 60 5c add %i5, 0x5c, %o1 200f938: 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; 200f93c: c2 27 60 5c st %g1, [ %i5 + 0x5c ] _CORE_semaphore_Initialize( &the_semaphore->Semaphore, the_sem_attr, value ); 200f940: 7f ff eb dc call 200a8b0 <_CORE_semaphore_Initialize> 200f944: c0 27 60 60 clr [ %i5 + 0x60 ] Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 200f948: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200f94c: b4 16 a0 40 or %i2, 0x40, %i2 200f950: c4 06 a0 1c ld [ %i2 + 0x1c ], %g2 200f954: 83 28 60 02 sll %g1, 2, %g1 200f958: 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; 200f95c: f2 27 60 0c st %i1, [ %i5 + 0xc ] &_POSIX_Semaphore_Information, &the_semaphore->Object, name ); *the_sem = the_semaphore; 200f960: fa 27 00 00 st %i5, [ %i4 ] _Thread_Enable_dispatch(); 200f964: 7f ff f2 ec call 200c514 <_Thread_Enable_dispatch> 200f968: b0 10 20 00 clr %i0 return 0; } 200f96c: 81 c7 e0 08 ret 200f970: 81 e8 00 00 restore } } else { name = NULL; } the_semaphore->process_shared = pshared; 200f974: 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; 200f978: c0 2f 60 14 clrb [ %i5 + 0x14 ] the_semaphore->open_count = 0; 200f97c: c0 27 60 18 clr [ %i5 + 0x18 ] the_semaphore->linked = false; 200f980: 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; 200f984: 10 bf ff ea b 200f92c <_POSIX_Semaphore_Create_support+0x68> 200f988: 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 ); 200f98c: 40 00 0a ff call 2012588 <__errno> 200f990: b0 10 3f ff mov -1, %i0 200f994: 82 10 20 58 mov 0x58, %g1 200f998: c2 22 00 00 st %g1, [ %o0 ] 200f99c: 81 c7 e0 08 ret 200f9a0: 81 e8 00 00 restore _Thread_Disable_dispatch(); the_semaphore = _POSIX_Semaphore_Allocate(); if ( !the_semaphore ) { _Thread_Enable_dispatch(); 200f9a4: 7f ff f2 dc call 200c514 <_Thread_Enable_dispatch> 200f9a8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENOSPC ); 200f9ac: 40 00 0a f7 call 2012588 <__errno> 200f9b0: 01 00 00 00 nop 200f9b4: 82 10 20 1c mov 0x1c, %g1 ! 1c 200f9b8: c2 22 00 00 st %g1, [ %o0 ] 200f9bc: 81 c7 e0 08 ret 200f9c0: 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 ); 200f9c4: 90 16 a0 40 or %i2, 0x40, %o0 <== NOT EXECUTED 200f9c8: 7f ff ee 58 call 200b328 <_Objects_Free> <== NOT EXECUTED 200f9cc: 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(); 200f9d0: 7f ff f2 d1 call 200c514 <_Thread_Enable_dispatch> <== NOT EXECUTED 200f9d4: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED rtems_set_errno_and_return_minus_one( ENOMEM ); 200f9d8: 40 00 0a ec call 2012588 <__errno> <== NOT EXECUTED 200f9dc: 01 00 00 00 nop <== NOT EXECUTED 200f9e0: 82 10 20 0c mov 0xc, %g1 ! c <== NOT EXECUTED 200f9e4: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED 200f9e8: 81 c7 e0 08 ret <== NOT EXECUTED 200f9ec: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200d328 <_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 ]; 200d328: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200d32c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200d330: 80 a0 a0 00 cmp %g2, 0 200d334: 12 80 00 06 bne 200d34c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24><== NEVER TAKEN 200d338: 01 00 00 00 nop 200d33c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200d340: 80 a0 a0 01 cmp %g2, 1 200d344: 22 80 00 05 be,a 200d358 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x30> 200d348: 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(); 200d34c: 82 13 c0 00 mov %o7, %g1 200d350: 7f ff f5 89 call 200a974 <_Thread_Enable_dispatch> 200d354: 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 && 200d358: 80 a0 60 00 cmp %g1, 0 200d35c: 02 bf ff fc be 200d34c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x24> 200d360: 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--; 200d364: 03 00 80 7b sethi %hi(0x201ec00), %g1 200d368: c4 00 63 80 ld [ %g1 + 0x380 ], %g2 ! 201ef80 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200d36c: 92 10 3f ff mov -1, %o1 200d370: 84 00 bf ff add %g2, -1, %g2 200d374: c4 20 63 80 st %g2, [ %g1 + 0x380 ] return _Thread_Dispatch_disable_level; 200d378: c2 00 63 80 ld [ %g1 + 0x380 ], %g1 200d37c: 82 13 c0 00 mov %o7, %g1 200d380: 40 00 01 da call 200dae8 <_POSIX_Thread_Exit> 200d384: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200e830 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200e830: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200e834: d0 06 40 00 ld [ %i1 ], %o0 200e838: 7f ff ff f1 call 200e7fc <_POSIX_Priority_Is_valid> 200e83c: ba 10 00 18 mov %i0, %i5 200e840: 80 8a 20 ff btst 0xff, %o0 200e844: 02 80 00 34 be 200e914 <_POSIX_Thread_Translate_sched_param+0xe4><== NEVER TAKEN 200e848: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200e84c: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; 200e850: c0 26 c0 00 clr [ %i3 ] if ( policy == SCHED_OTHER ) { 200e854: 80 a7 60 00 cmp %i5, 0 200e858: 02 80 00 2d be 200e90c <_POSIX_Thread_Translate_sched_param+0xdc> 200e85c: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; return 0; } if ( policy == SCHED_FIFO ) { 200e860: 80 a7 60 01 cmp %i5, 1 200e864: 02 80 00 2c be 200e914 <_POSIX_Thread_Translate_sched_param+0xe4> 200e868: 80 a7 60 02 cmp %i5, 2 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200e86c: 02 80 00 2c be 200e91c <_POSIX_Thread_Translate_sched_param+0xec> 200e870: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; return 0; } if ( policy == SCHED_SPORADIC ) { 200e874: 12 80 00 28 bne 200e914 <_POSIX_Thread_Translate_sched_param+0xe4> 200e878: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200e87c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200e880: 80 a0 60 00 cmp %g1, 0 200e884: 32 80 00 07 bne,a 200e8a0 <_POSIX_Thread_Translate_sched_param+0x70> 200e888: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e88c: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200e890: 80 a0 60 00 cmp %g1, 0 200e894: 02 80 00 23 be 200e920 <_POSIX_Thread_Translate_sched_param+0xf0> 200e898: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200e89c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200e8a0: 80 a0 60 00 cmp %g1, 0 200e8a4: 12 80 00 06 bne 200e8bc <_POSIX_Thread_Translate_sched_param+0x8c> 200e8a8: 01 00 00 00 nop 200e8ac: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200e8b0: 80 a0 60 00 cmp %g1, 0 200e8b4: 02 80 00 18 be 200e914 <_POSIX_Thread_Translate_sched_param+0xe4> 200e8b8: b0 10 20 16 mov 0x16, %i0 (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200e8bc: 7f ff f6 a3 call 200c348 <_Timespec_To_ticks> 200e8c0: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200e8c4: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_init_budget.tv_sec == 0) && (param->sched_ss_init_budget.tv_nsec == 0) ) return EINVAL; if ( _Timespec_To_ticks( ¶m->sched_ss_repl_period ) < 200e8c8: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200e8cc: 7f ff f6 9f call 200c348 <_Timespec_To_ticks> 200e8d0: 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 ) < 200e8d4: 80 a7 40 08 cmp %i5, %o0 200e8d8: 0a 80 00 12 bcs 200e920 <_POSIX_Thread_Translate_sched_param+0xf0> 200e8dc: 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 ) ) 200e8e0: 7f ff ff c7 call 200e7fc <_POSIX_Priority_Is_valid> 200e8e4: d0 06 60 04 ld [ %i1 + 4 ], %o0 200e8e8: 80 8a 20 ff btst 0xff, %o0 200e8ec: 02 80 00 0a be 200e914 <_POSIX_Thread_Translate_sched_param+0xe4> 200e8f0: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200e8f4: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200e8f8: 03 00 80 20 sethi %hi(0x2008000), %g1 200e8fc: 82 10 63 2c or %g1, 0x32c, %g1 ! 200832c <_POSIX_Threads_Sporadic_budget_callout> 200e900: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200e904: 81 c7 e0 08 ret 200e908: 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; 200e90c: 82 10 20 01 mov 1, %g1 200e910: c2 26 80 00 st %g1, [ %i2 ] return 0; 200e914: 81 c7 e0 08 ret 200e918: 81 e8 00 00 restore *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200e91c: fa 26 80 00 st %i5, [ %i2 ] return 0; 200e920: 81 c7 e0 08 ret 200e924: 81 e8 00 00 restore =============================================================================== 0200d664 <_POSIX_Threads_Delete_extension>: */ static void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200d664: 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 ]; 200d668: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200d66c: 40 00 09 4d call 200fba0 <_POSIX_Threads_cancel_run> 200d670: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200d674: 90 10 00 19 mov %i1, %o0 200d678: 40 00 09 66 call 200fc10 <_POSIX_Keys_Run_destructors> 200d67c: 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 )) ) 200d680: 10 80 00 03 b 200d68c <_POSIX_Threads_Delete_extension+0x28> 200d684: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200d688: 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 )) ) 200d68c: 7f ff f5 56 call 200abe4 <_Thread_queue_Dequeue> 200d690: 90 10 00 1d mov %i5, %o0 200d694: 80 a2 20 00 cmp %o0, 0 200d698: 32 bf ff fc bne,a 200d688 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200d69c: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200d6a0: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200d6a4: 80 a0 60 04 cmp %g1, 4 200d6a8: 02 80 00 05 be 200d6bc <_POSIX_Threads_Delete_extension+0x58> 200d6ac: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d6b0: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d6b4: 7f ff f8 d4 call 200ba04 <_Workspace_Free> 200d6b8: 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 ); 200d6bc: 7f ff f8 48 call 200b7dc <_Watchdog_Remove> 200d6c0: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200d6c4: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200d6c8: 7f ff f8 cf call 200ba04 <_Workspace_Free> 200d6cc: 81 e8 00 00 restore =============================================================================== 02008048 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2008048: 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; 200804c: 03 00 80 8a sethi %hi(0x2022800), %g1 2008050: 82 10 62 2c or %g1, 0x22c, %g1 ! 2022a2c maximum = Configuration_POSIX_API.number_of_initialization_threads; 2008054: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2008058: 80 a6 e0 00 cmp %i3, 0 200805c: 02 80 00 18 be 20080bc <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 2008060: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2008064: 80 a7 60 00 cmp %i5, 0 2008068: 02 80 00 15 be 20080bc <_POSIX_Threads_Initialize_user_threads_body+0x74><== NEVER TAKEN 200806c: 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 ); 2008070: 40 00 1a 2e call 200e928 2008074: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 2008078: 92 10 20 02 mov 2, %o1 200807c: 40 00 1a 37 call 200e958 2008080: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2008084: d2 07 60 04 ld [ %i5 + 4 ], %o1 2008088: 40 00 1a 44 call 200e998 200808c: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 2008090: d4 07 40 00 ld [ %i5 ], %o2 2008094: 90 07 bf fc add %fp, -4, %o0 2008098: 92 07 bf bc add %fp, -68, %o1 200809c: 7f ff fe fd call 2007c90 20080a0: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20080a4: 94 92 20 00 orcc %o0, 0, %o2 20080a8: 12 80 00 07 bne 20080c4 <_POSIX_Threads_Initialize_user_threads_body+0x7c> 20080ac: 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++ ) { 20080b0: 80 a7 00 1b cmp %i4, %i3 20080b4: 12 bf ff ef bne 2008070 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 20080b8: ba 07 60 08 add %i5, 8, %i5 20080bc: 81 c7 e0 08 ret 20080c0: 81 e8 00 00 restore &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20080c4: 90 10 20 02 mov 2, %o0 20080c8: 40 00 08 6e call 200a280 <_Internal_error_Occurred> 20080cc: 92 10 20 01 mov 1, %o1 =============================================================================== 0200d7e8 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200d7e8: 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 ]; 200d7ec: 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 ); 200d7f0: 40 00 04 59 call 200e954 <_Timespec_To_ticks> 200d7f4: 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); 200d7f8: c4 07 60 88 ld [ %i5 + 0x88 ], %g2 200d7fc: 03 00 80 77 sethi %hi(0x201dc00), %g1 200d800: d2 08 60 94 ldub [ %g1 + 0x94 ], %o1 ! 201dc94 */ #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 ) { 200d804: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200d808: 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; 200d80c: 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 ) { 200d810: 80 a0 60 00 cmp %g1, 0 200d814: 12 80 00 06 bne 200d82c <_POSIX_Threads_Sporadic_budget_TSR+0x44><== NEVER TAKEN 200d818: 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 ) { 200d81c: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200d820: 80 a0 40 09 cmp %g1, %o1 200d824: 38 80 00 09 bgu,a 200d848 <_POSIX_Threads_Sporadic_budget_TSR+0x60> 200d828: 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 ); 200d82c: 40 00 04 4a call 200e954 <_Timespec_To_ticks> 200d830: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d834: 31 00 80 7a sethi %hi(0x201e800), %i0 200d838: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d83c: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d840: 7f ff f7 85 call 200b654 <_Watchdog_Insert> 200d844: 91 ee 22 f0 restore %i0, 0x2f0, %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 ); 200d848: 7f ff f2 c2 call 200a350 <_Thread_Change_priority> 200d84c: 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 ); 200d850: 40 00 04 41 call 200e954 <_Timespec_To_ticks> 200d854: 90 07 60 90 add %i5, 0x90, %o0 200d858: 31 00 80 7a sethi %hi(0x201e800), %i0 200d85c: b2 07 60 a8 add %i5, 0xa8, %i1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200d860: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200d864: 7f ff f7 7c call 200b654 <_Watchdog_Insert> 200d868: 91 ee 22 f0 restore %i0, 0x2f0, %o0 =============================================================================== 0200d86c <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200d86c: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 200d870: c6 00 a0 8c ld [ %g2 + 0x8c ], %g3 200d874: 05 00 80 77 sethi %hi(0x201dc00), %g2 200d878: d2 08 a0 94 ldub [ %g2 + 0x94 ], %o1 ! 201dc94 */ #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 ) { 200d87c: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200d880: 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 */ 200d884: 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; 200d888: 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 ) { 200d88c: 80 a0 a0 00 cmp %g2, 0 200d890: 12 80 00 06 bne 200d8a8 <_POSIX_Threads_Sporadic_budget_callout+0x3c><== NEVER TAKEN 200d894: 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 ) { 200d898: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200d89c: 80 a0 40 09 cmp %g1, %o1 200d8a0: 0a 80 00 04 bcs 200d8b0 <_POSIX_Threads_Sporadic_budget_callout+0x44><== ALWAYS TAKEN 200d8a4: 94 10 20 01 mov 1, %o2 200d8a8: 81 c3 e0 08 retl <== NOT EXECUTED 200d8ac: 01 00 00 00 nop <== NOT EXECUTED _Thread_Change_priority( the_thread, new_priority, true ); 200d8b0: 82 13 c0 00 mov %o7, %g1 200d8b4: 7f ff f2 a7 call 200a350 <_Thread_Change_priority> 200d8b8: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200fba0 <_POSIX_Threads_cancel_run>: #include void _POSIX_Threads_cancel_run( Thread_Control *the_thread ) { 200fba0: 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 ]; 200fba4: f8 06 21 5c ld [ %i0 + 0x15c ], %i4 handler_stack = &thread_support->Cancellation_Handlers; thread_support->cancelability_state = PTHREAD_CANCEL_DISABLE; 200fba8: 84 10 20 01 mov 1, %g2 while ( !_Chain_Is_empty( handler_stack ) ) { 200fbac: 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 ); 200fbb0: b6 07 20 e8 add %i4, 0xe8, %i3 200fbb4: 80 a0 40 1b cmp %g1, %i3 200fbb8: 02 80 00 14 be 200fc08 <_POSIX_Threads_cancel_run+0x68> 200fbbc: c4 27 20 d8 st %g2, [ %i4 + 0xd8 ] _ISR_Disable( level ); 200fbc0: 7f ff ca be call 20026b8 200fbc4: 01 00 00 00 nop handler = (POSIX_Cancel_Handler_control *) 200fbc8: fa 07 20 ec ld [ %i4 + 0xec ], %i5 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 200fbcc: c4 07 40 00 ld [ %i5 ], %g2 previous = the_node->previous; 200fbd0: c2 07 60 04 ld [ %i5 + 4 ], %g1 next->previous = previous; 200fbd4: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 200fbd8: c4 20 40 00 st %g2, [ %g1 ] _Chain_Tail( handler_stack )->previous; _Chain_Extract_unprotected( &handler->Node ); _ISR_Enable( level ); 200fbdc: 7f ff ca bb call 20026c8 200fbe0: 01 00 00 00 nop (*handler->routine)( handler->arg ); 200fbe4: c2 07 60 08 ld [ %i5 + 8 ], %g1 200fbe8: 9f c0 40 00 call %g1 200fbec: d0 07 60 0c ld [ %i5 + 0xc ], %o0 _Workspace_Free( handler ); 200fbf0: 7f ff ef 85 call 200ba04 <_Workspace_Free> 200fbf4: 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 ) ) { 200fbf8: c2 07 20 e4 ld [ %i4 + 0xe4 ], %g1 200fbfc: 80 a0 40 1b cmp %g1, %i3 200fc00: 12 bf ff f0 bne 200fbc0 <_POSIX_Threads_cancel_run+0x20> <== NEVER TAKEN 200fc04: 01 00 00 00 nop 200fc08: 81 c7 e0 08 ret 200fc0c: 81 e8 00 00 restore =============================================================================== 02007af8 <_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) { 2007af8: 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; 2007afc: c4 06 60 68 ld [ %i1 + 0x68 ], %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007b00: 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; 2007b04: 84 00 a0 01 inc %g2 /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2007b08: 80 a0 60 00 cmp %g1, 0 2007b0c: 12 80 00 0e bne 2007b44 <_POSIX_Timer_TSR+0x4c> 2007b10: c4 26 60 68 st %g2, [ %i1 + 0x68 ] 2007b14: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2007b18: 80 a0 60 00 cmp %g1, 0 2007b1c: 32 80 00 0b bne,a 2007b48 <_POSIX_Timer_TSR+0x50> <== ALWAYS TAKEN 2007b20: 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; 2007b24: 82 10 20 04 mov 4, %g1 <== NOT EXECUTED 2007b28: 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 ) ) { 2007b2c: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 2007b30: 40 00 18 9c call 200dda0 2007b34: 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; 2007b38: c0 26 60 68 clr [ %i1 + 0x68 ] 2007b3c: 81 c7 e0 08 ret 2007b40: 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( 2007b44: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2007b48: d4 06 60 08 ld [ %i1 + 8 ], %o2 2007b4c: 90 06 60 10 add %i1, 0x10, %o0 2007b50: 98 10 00 19 mov %i1, %o4 2007b54: 17 00 80 1e sethi %hi(0x2007800), %o3 2007b58: 40 00 19 b2 call 200e220 <_POSIX_Timer_Insert_helper> 2007b5c: 96 12 e2 f8 or %o3, 0x2f8, %o3 ! 2007af8 <_POSIX_Timer_TSR> ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2007b60: 80 8a 20 ff btst 0xff, %o0 2007b64: 02 bf ff f6 be 2007b3c <_POSIX_Timer_TSR+0x44> <== NEVER TAKEN 2007b68: 01 00 00 00 nop struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007b6c: 40 00 06 0c call 200939c <_TOD_Get_as_timestamp> 2007b70: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007b74: 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); 2007b78: 94 10 20 00 clr %o2 2007b7c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007b80: 90 10 00 1c mov %i4, %o0 2007b84: 96 12 e2 00 or %o3, 0x200, %o3 2007b88: 40 00 4b 21 call 201a80c <__divdi3> 2007b8c: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007b90: 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); 2007b94: d2 26 60 6c st %o1, [ %i1 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007b98: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007b9c: 90 10 00 1c mov %i4, %o0 2007ba0: 96 12 e2 00 or %o3, 0x200, %o3 2007ba4: 40 00 4c 00 call 201aba4 <__moddi3> 2007ba8: 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; 2007bac: 82 10 20 03 mov 3, %g1 2007bb0: d2 26 60 70 st %o1, [ %i1 + 0x70 ] 2007bb4: 10 bf ff de b 2007b2c <_POSIX_Timer_TSR+0x34> 2007bb8: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] =============================================================================== 0200fcc8 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200fcc8: 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, 200fccc: 98 10 20 01 mov 1, %o4 200fcd0: 90 10 00 18 mov %i0, %o0 200fcd4: 92 10 00 19 mov %i1, %o1 200fcd8: 94 07 bf f4 add %fp, -12, %o2 200fcdc: 40 00 00 2e call 200fd94 <_POSIX_signals_Clear_signals> 200fce0: 96 10 00 1a mov %i2, %o3 200fce4: 80 8a 20 ff btst 0xff, %o0 200fce8: 02 80 00 23 be 200fd74 <_POSIX_signals_Check_signal+0xac> 200fcec: 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 ) 200fcf0: 85 2e 60 02 sll %i1, 2, %g2 200fcf4: 37 00 80 7b sethi %hi(0x201ec00), %i3 200fcf8: b9 2e 60 04 sll %i1, 4, %i4 200fcfc: b6 16 e3 d0 or %i3, 0x3d0, %i3 200fd00: b8 27 00 02 sub %i4, %g2, %i4 200fd04: 84 06 c0 1c add %i3, %i4, %g2 200fd08: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200fd0c: 80 a7 60 01 cmp %i5, 1 200fd10: 02 80 00 19 be 200fd74 <_POSIX_signals_Check_signal+0xac> <== NEVER TAKEN 200fd14: 21 00 80 7b sethi %hi(0x201ec00), %l0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200fd18: f4 06 20 d0 ld [ %i0 + 0xd0 ], %i2 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200fd1c: 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, 200fd20: a0 14 23 70 or %l0, 0x370, %l0 200fd24: 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; 200fd28: 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, 200fd2c: 90 07 bf cc add %fp, -52, %o0 /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200fd30: 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, 200fd34: 92 02 60 20 add %o1, 0x20, %o1 200fd38: 40 00 04 98 call 2010f98 200fd3c: 94 10 20 28 mov 0x28, %o2 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200fd40: c2 06 c0 1c ld [ %i3 + %i4 ], %g1 200fd44: 80 a0 60 02 cmp %g1, 2 200fd48: 02 80 00 0e be 200fd80 <_POSIX_signals_Check_signal+0xb8> 200fd4c: 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 ); 200fd50: 9f c7 40 00 call %i5 200fd54: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200fd58: d0 04 20 0c ld [ %l0 + 0xc ], %o0 200fd5c: 92 07 bf cc add %fp, -52, %o1 200fd60: 90 02 20 20 add %o0, 0x20, %o0 200fd64: 40 00 04 8d call 2010f98 200fd68: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200fd6c: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200fd70: f4 26 20 d0 st %i2, [ %i0 + 0xd0 ] return true; } 200fd74: b0 08 60 01 and %g1, 1, %i0 200fd78: 81 c7 e0 08 ret 200fd7c: 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)( 200fd80: 92 07 bf f4 add %fp, -12, %o1 200fd84: 9f c7 40 00 call %i5 200fd88: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200fd8c: 10 bf ff f4 b 200fd5c <_POSIX_signals_Check_signal+0x94> 200fd90: d0 04 20 0c ld [ %l0 + 0xc ], %o0 =============================================================================== 0201057c <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 201057c: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 2010580: 7f ff c8 4e call 20026b8 2010584: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 2010588: 85 2e 20 04 sll %i0, 4, %g2 201058c: 83 2e 20 02 sll %i0, 2, %g1 2010590: 82 20 80 01 sub %g2, %g1, %g1 2010594: 05 00 80 7b sethi %hi(0x201ec00), %g2 2010598: 84 10 a3 d0 or %g2, 0x3d0, %g2 ! 201efd0 <_POSIX_signals_Vectors> 201059c: c4 00 80 01 ld [ %g2 + %g1 ], %g2 20105a0: 80 a0 a0 02 cmp %g2, 2 20105a4: 02 80 00 0b be 20105d0 <_POSIX_signals_Clear_process_signals+0x54> 20105a8: 05 00 80 7c sethi %hi(0x201f000), %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 20105ac: 03 00 80 7c sethi %hi(0x201f000), %g1 20105b0: c4 00 61 c4 ld [ %g1 + 0x1c4 ], %g2 ! 201f1c4 <_POSIX_signals_Pending> 20105b4: 86 10 20 01 mov 1, %g3 20105b8: b0 06 3f ff add %i0, -1, %i0 20105bc: b1 28 c0 18 sll %g3, %i0, %i0 20105c0: b0 28 80 18 andn %g2, %i0, %i0 20105c4: f0 20 61 c4 st %i0, [ %g1 + 0x1c4 ] } _ISR_Enable( level ); 20105c8: 7f ff c8 40 call 20026c8 20105cc: 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 ] ) ) 20105d0: 84 10 a1 c8 or %g2, 0x1c8, %g2 20105d4: c6 00 40 02 ld [ %g1 + %g2 ], %g3 20105d8: 82 00 40 02 add %g1, %g2, %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 20105dc: 82 00 60 04 add %g1, 4, %g1 20105e0: 80 a0 c0 01 cmp %g3, %g1 20105e4: 02 bf ff f3 be 20105b0 <_POSIX_signals_Clear_process_signals+0x34><== ALWAYS TAKEN 20105e8: 03 00 80 7c sethi %hi(0x201f000), %g1 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; } _ISR_Enable( level ); 20105ec: 7f ff c8 37 call 20026c8 <== NOT EXECUTED 20105f0: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED =============================================================================== 0200d3b4 <_POSIX_signals_Post_switch_extension>: */ void _POSIX_signals_Post_switch_extension( Thread_Control *the_thread ) { 200d3b4: 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; 200d3b8: 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 ]; 200d3bc: 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; 200d3c0: b4 16 a3 70 or %i2, 0x370, %i2 200d3c4: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 /* * api may be NULL in case of a thread close in progress */ if ( !api ) 200d3c8: 80 a7 20 00 cmp %i4, 0 200d3cc: 02 80 00 34 be 200d49c <_POSIX_signals_Post_switch_extension+0xe8> 200d3d0: 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 ); 200d3d4: 7f ff d4 b9 call 20026b8 200d3d8: 37 00 80 7c sethi %hi(0x201f000), %i3 200d3dc: b6 16 e1 c4 or %i3, 0x1c4, %i3 ! 201f1c4 <_POSIX_signals_Pending> if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d3e0: c6 06 c0 00 ld [ %i3 ], %g3 200d3e4: 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 & 200d3e8: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d3ec: 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 & 200d3f0: 80 a8 40 02 andncc %g1, %g2, %g0 200d3f4: 02 80 00 26 be 200d48c <_POSIX_signals_Post_switch_extension+0xd8> 200d3f8: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); break; } _ISR_Enable( level ); 200d3fc: 7f ff d4 b3 call 20026c8 200d400: ba 10 20 1b mov 0x1b, %i5 ! 1b for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { _POSIX_signals_Check_signal( api, signo, false ); 200d404: 92 10 00 1d mov %i5, %o1 200d408: 94 10 20 00 clr %o2 200d40c: 40 00 0a 2f call 200fcc8 <_POSIX_signals_Check_signal> 200d410: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d414: 92 10 00 1d mov %i5, %o1 200d418: 90 10 00 1c mov %i4, %o0 200d41c: 40 00 0a 2b call 200fcc8 <_POSIX_signals_Check_signal> 200d420: 94 10 20 01 mov 1, %o2 _ISR_Enable( level ); break; } _ISR_Enable( level ); for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 200d424: ba 07 60 01 inc %i5 200d428: 80 a7 60 20 cmp %i5, 0x20 200d42c: 12 bf ff f7 bne 200d408 <_POSIX_signals_Post_switch_extension+0x54> 200d430: 92 10 00 1d mov %i5, %o1 200d434: 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 ); 200d438: 92 10 00 1d mov %i5, %o1 200d43c: 94 10 20 00 clr %o2 200d440: 40 00 0a 22 call 200fcc8 <_POSIX_signals_Check_signal> 200d444: 90 10 00 1c mov %i4, %o0 _POSIX_signals_Check_signal( api, signo, true ); 200d448: 92 10 00 1d mov %i5, %o1 200d44c: 90 10 00 1c mov %i4, %o0 200d450: 40 00 0a 1e call 200fcc8 <_POSIX_signals_Check_signal> 200d454: 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++ ) { 200d458: ba 07 60 01 inc %i5 200d45c: 80 a7 60 1b cmp %i5, 0x1b 200d460: 12 bf ff f7 bne 200d43c <_POSIX_signals_Post_switch_extension+0x88> 200d464: 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 ); 200d468: 7f ff d4 94 call 20026b8 200d46c: 01 00 00 00 nop if ( !(~api->signals_blocked & (api->signals_pending | _POSIX_signals_Pending)) ) { 200d470: c6 06 c0 00 ld [ %i3 ], %g3 200d474: 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 & 200d478: c4 07 20 d0 ld [ %i4 + 0xd0 ], %g2 (api->signals_pending | _POSIX_signals_Pending)) ) { 200d47c: 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 & 200d480: 80 a8 40 02 andncc %g1, %g2, %g0 200d484: 12 bf ff de bne 200d3fc <_POSIX_signals_Post_switch_extension+0x48><== NEVER TAKEN 200d488: 01 00 00 00 nop (api->signals_pending | _POSIX_signals_Pending)) ) { _ISR_Enable( level ); 200d48c: 7f ff d4 8f call 20026c8 200d490: 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; 200d494: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 200d498: f2 20 60 34 st %i1, [ %g1 + 0x34 ] 200d49c: 81 c7 e0 08 ret 200d4a0: 81 e8 00 00 restore =============================================================================== 0201b58c <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 201b58c: 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 ) ) { 201b590: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 201b594: 05 04 00 20 sethi %hi(0x10008000), %g2 201b598: 86 10 20 01 mov 1, %g3 201b59c: ba 06 7f ff add %i1, -1, %i5 201b5a0: 88 08 40 02 and %g1, %g2, %g4 { POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 201b5a4: da 06 21 5c ld [ %i0 + 0x15c ], %o5 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 201b5a8: 80 a1 00 02 cmp %g4, %g2 201b5ac: 02 80 00 1c be 201b61c <_POSIX_signals_Unblock_thread+0x90> 201b5b0: 9f 28 c0 1d sll %g3, %i5, %o7 } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201b5b4: c4 03 60 d0 ld [ %o5 + 0xd0 ], %g2 201b5b8: 80 ab c0 02 andncc %o7, %g2, %g0 201b5bc: 02 80 00 15 be 201b610 <_POSIX_signals_Unblock_thread+0x84> 201b5c0: ba 10 20 00 clr %i5 201b5c4: 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 ) ) { 201b5c8: 80 88 40 02 btst %g1, %g2 201b5cc: 02 80 00 29 be 201b670 <_POSIX_signals_Unblock_thread+0xe4> 201b5d0: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201b5d4: 84 10 20 04 mov 4, %g2 201b5d8: 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); 201b5dc: 05 00 00 ef sethi %hi(0x3bc00), %g2 201b5e0: 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) ) 201b5e4: 80 88 40 02 btst %g1, %g2 201b5e8: 12 80 00 36 bne 201b6c0 <_POSIX_signals_Unblock_thread+0x134> 201b5ec: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); else if ( _States_Is_delaying(the_thread->current_state) ) { 201b5f0: 22 80 00 09 be,a 201b614 <_POSIX_signals_Unblock_thread+0x88><== NEVER TAKEN 201b5f4: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 201b5f8: 7f ff c0 79 call 200b7dc <_Watchdog_Remove> 201b5fc: 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 ); 201b600: 13 04 00 ff sethi %hi(0x1003fc00), %o1 201b604: 90 10 00 18 mov %i0, %o0 201b608: 7f ff bb 9d call 200a47c <_Thread_Clear_state> 201b60c: 92 12 63 f8 or %o1, 0x3f8, %o1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201b610: b0 0f 60 01 and %i5, 1, %i0 201b614: 81 c7 e0 08 ret 201b618: 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) ) { 201b61c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 201b620: 80 8b c0 01 btst %o7, %g1 201b624: 22 80 00 21 be,a 201b6a8 <_POSIX_signals_Unblock_thread+0x11c> 201b628: c2 03 60 d0 ld [ %o5 + 0xd0 ], %g1 the_thread->Wait.return_code = EINTR; 201b62c: 82 10 20 04 mov 4, %g1 201b630: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201b634: 80 a6 a0 00 cmp %i2, 0 201b638: 02 80 00 27 be 201b6d4 <_POSIX_signals_Unblock_thread+0x148> 201b63c: 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; 201b640: c4 06 80 00 ld [ %i2 ], %g2 201b644: c4 20 40 00 st %g2, [ %g1 ] 201b648: c4 06 a0 04 ld [ %i2 + 4 ], %g2 201b64c: c4 20 60 04 st %g2, [ %g1 + 4 ] 201b650: c4 06 a0 08 ld [ %i2 + 8 ], %g2 201b654: c4 20 60 08 st %g2, [ %g1 + 8 ] } _Thread_queue_Extract_with_proxy( the_thread ); 201b658: 90 10 00 18 mov %i0, %o0 201b65c: 7f ff be 72 call 200b024 <_Thread_queue_Extract_with_proxy> 201b660: ba 10 20 01 mov 1, %i5 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) _Thread_Dispatch_necessary = true; } } return false; } 201b664: b0 0f 60 01 and %i5, 1, %i0 201b668: 81 c7 e0 08 ret 201b66c: 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 ) { 201b670: 12 bf ff e8 bne 201b610 <_POSIX_signals_Unblock_thread+0x84><== NEVER TAKEN 201b674: 03 00 80 7b sethi %hi(0x201ec00), %g1 if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201b678: 82 10 63 70 or %g1, 0x370, %g1 ! 201ef70 <_Per_CPU_Information> 201b67c: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b680: 80 a0 a0 00 cmp %g2, 0 201b684: 22 bf ff e4 be,a 201b614 <_POSIX_signals_Unblock_thread+0x88> 201b688: b0 0f 60 01 and %i5, 1, %i0 201b68c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201b690: 80 a6 00 02 cmp %i0, %g2 201b694: 22 bf ff df be,a 201b610 <_POSIX_signals_Unblock_thread+0x84><== ALWAYS TAKEN 201b698: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] 201b69c: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED 201b6a0: 81 c7 e0 08 ret <== NOT EXECUTED 201b6a4: 81 e8 00 00 restore <== NOT EXECUTED * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 201b6a8: 80 ab c0 01 andncc %o7, %g1, %g0 201b6ac: 12 bf ff e0 bne 201b62c <_POSIX_signals_Unblock_thread+0xa0> 201b6b0: ba 10 20 00 clr %i5 201b6b4: b0 0f 60 01 and %i5, 1, %i0 201b6b8: 81 c7 e0 08 ret 201b6bc: 81 e8 00 00 restore /* * In pthread_cond_wait, a thread will be blocking on a thread * queue, but is also interruptible by a POSIX signal. */ if ( _States_Is_waiting_on_thread_queue(the_thread->current_state) ) _Thread_queue_Extract_with_proxy( the_thread ); 201b6c0: 7f ff be 59 call 200b024 <_Thread_queue_Extract_with_proxy> 201b6c4: 90 10 00 18 mov %i0, %o0 201b6c8: b0 0f 60 01 and %i5, 1, %i0 201b6cc: 81 c7 e0 08 ret 201b6d0: 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; 201b6d4: 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; 201b6d8: f2 20 40 00 st %i1, [ %g1 ] the_info->si_code = SI_USER; 201b6dc: c4 20 60 04 st %g2, [ %g1 + 4 ] the_info->si_value.sival_int = 0; 201b6e0: 10 bf ff de b 201b658 <_POSIX_signals_Unblock_thread+0xcc> 201b6e4: c0 20 60 08 clr [ %g1 + 8 ] =============================================================================== 0200aa78 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200aa78: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 200aa7c: 80 a6 60 00 cmp %i1, 0 200aa80: 02 80 00 4c be 200abb0 <_RBTree_Extract_unprotected+0x138> 200aa84: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 200aa88: c2 06 20 08 ld [ %i0 + 8 ], %g1 200aa8c: 80 a0 40 19 cmp %g1, %i1 200aa90: 22 80 00 59 be,a 200abf4 <_RBTree_Extract_unprotected+0x17c> 200aa94: c2 06 60 08 ld [ %i1 + 8 ], %g1 the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 200aa98: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200aa9c: 80 a0 40 19 cmp %g1, %i1 200aaa0: 22 80 00 46 be,a 200abb8 <_RBTree_Extract_unprotected+0x140> 200aaa4: c2 06 60 04 ld [ %i1 + 4 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200aaa8: fa 06 60 04 ld [ %i1 + 4 ], %i5 200aaac: 80 a7 60 00 cmp %i5, 0 200aab0: 22 80 00 4a be,a 200abd8 <_RBTree_Extract_unprotected+0x160> 200aab4: f8 06 60 08 ld [ %i1 + 8 ], %i4 200aab8: c2 06 60 08 ld [ %i1 + 8 ], %g1 200aabc: 80 a0 60 00 cmp %g1, 0 200aac0: 32 80 00 05 bne,a 200aad4 <_RBTree_Extract_unprotected+0x5c> 200aac4: c2 07 60 08 ld [ %i5 + 8 ], %g1 200aac8: 10 80 00 50 b 200ac08 <_RBTree_Extract_unprotected+0x190> 200aacc: 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]; 200aad0: c2 07 60 08 ld [ %i5 + 8 ], %g1 200aad4: 80 a0 60 00 cmp %g1, 0 200aad8: 32 bf ff fe bne,a 200aad0 <_RBTree_Extract_unprotected+0x58> 200aadc: 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]; 200aae0: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 200aae4: 80 a7 20 00 cmp %i4, 0 200aae8: 02 80 00 54 be 200ac38 <_RBTree_Extract_unprotected+0x1c0> 200aaec: 01 00 00 00 nop leaf->parent = target->parent; 200aaf0: c2 07 40 00 ld [ %i5 ], %g1 200aaf4: 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]; 200aaf8: 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]; 200aafc: 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]; 200ab00: 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; 200ab04: c6 07 60 0c ld [ %i5 + 0xc ], %g3 dir = target != target->parent->child[0]; 200ab08: 88 19 00 1d xor %g4, %i5, %g4 200ab0c: 80 a0 00 04 cmp %g0, %g4 200ab10: 88 40 20 00 addx %g0, 0, %g4 target->parent->child[dir] = leaf; 200ab14: 89 29 20 02 sll %g4, 2, %g4 200ab18: 84 00 80 04 add %g2, %g4, %g2 200ab1c: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200ab20: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ab24: 84 18 80 19 xor %g2, %i1, %g2 200ab28: 80 a0 00 02 cmp %g0, %g2 200ab2c: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = target; 200ab30: 85 28 a0 02 sll %g2, 2, %g2 200ab34: 82 00 40 02 add %g1, %g2, %g1 200ab38: 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]; 200ab3c: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ab40: c2 27 60 08 st %g1, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 200ab44: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ab48: 80 a0 60 00 cmp %g1, 0 200ab4c: 32 80 00 02 bne,a 200ab54 <_RBTree_Extract_unprotected+0xdc><== ALWAYS TAKEN 200ab50: fa 20 40 00 st %i5, [ %g1 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200ab54: c2 06 60 04 ld [ %i1 + 4 ], %g1 200ab58: c2 27 60 04 st %g1, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 200ab5c: c2 06 60 04 ld [ %i1 + 4 ], %g1 200ab60: 80 a0 60 00 cmp %g1, 0 200ab64: 32 80 00 02 bne,a 200ab6c <_RBTree_Extract_unprotected+0xf4> 200ab68: 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; 200ab6c: c4 06 40 00 ld [ %i1 ], %g2 target->color = the_node->color; 200ab70: 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; 200ab74: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 200ab78: 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 */ 200ab7c: 80 a0 e0 00 cmp %g3, 0 200ab80: 32 80 00 06 bne,a 200ab98 <_RBTree_Extract_unprotected+0x120> 200ab84: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 200ab88: 80 a7 20 00 cmp %i4, 0 200ab8c: 32 80 00 02 bne,a 200ab94 <_RBTree_Extract_unprotected+0x11c> 200ab90: 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; 200ab94: 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; 200ab98: c0 26 60 08 clr [ %i1 + 8 ] 200ab9c: c0 26 60 04 clr [ %i1 + 4 ] 200aba0: 80 a0 60 00 cmp %g1, 0 200aba4: 02 80 00 03 be 200abb0 <_RBTree_Extract_unprotected+0x138> 200aba8: c0 26 40 00 clr [ %i1 ] 200abac: c0 20 60 0c clr [ %g1 + 0xc ] 200abb0: 81 c7 e0 08 ret 200abb4: 81 e8 00 00 restore the_rbtree->first[RBT_LEFT] = NULL; } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) 200abb8: 80 a0 60 00 cmp %g1, 0 200abbc: 22 80 00 28 be,a 200ac5c <_RBTree_Extract_unprotected+0x1e4> 200abc0: c2 06 40 00 ld [ %i1 ], %g1 * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 200abc4: fa 06 60 04 ld [ %i1 + 4 ], %i5 200abc8: 80 a7 60 00 cmp %i5, 0 200abcc: 12 bf ff bb bne 200aab8 <_RBTree_Extract_unprotected+0x40><== ALWAYS TAKEN 200abd0: c2 26 20 0c st %g1, [ %i0 + 0xc ] * the_node's location in the tree. This may cause the coloring to be * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; 200abd4: f8 06 60 08 ld [ %i1 + 8 ], %i4 <== NOT EXECUTED if( leaf ) { 200abd8: 80 a7 20 00 cmp %i4, 0 200abdc: 32 80 00 0c bne,a 200ac0c <_RBTree_Extract_unprotected+0x194> 200abe0: 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); 200abe4: 7f ff fe d0 call 200a724 <_RBTree_Extract_validate_unprotected> 200abe8: 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]; 200abec: 10 80 00 0a b 200ac14 <_RBTree_Extract_unprotected+0x19c> 200abf0: c2 06 40 00 ld [ %i1 ], %g1 if (!the_node) return; /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) 200abf4: 80 a0 60 00 cmp %g1, 0 200abf8: 22 80 00 14 be,a 200ac48 <_RBTree_Extract_unprotected+0x1d0> 200abfc: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 200ac00: 10 bf ff a6 b 200aa98 <_RBTree_Extract_unprotected+0x20> 200ac04: c2 26 20 08 st %g1, [ %i0 + 8 ] * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { leaf->parent = the_node->parent; 200ac08: c2 06 40 00 ld [ %i1 ], %g1 200ac0c: 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]; 200ac10: 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; 200ac14: c6 06 60 0c ld [ %i1 + 0xc ], %g3 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 200ac18: c4 00 60 04 ld [ %g1 + 4 ], %g2 200ac1c: 84 18 80 19 xor %g2, %i1, %g2 200ac20: 80 a0 00 02 cmp %g0, %g2 200ac24: 84 40 20 00 addx %g0, 0, %g2 the_node->parent->child[dir] = leaf; 200ac28: 85 28 a0 02 sll %g2, 2, %g2 200ac2c: 82 00 40 02 add %g1, %g2, %g1 200ac30: 10 bf ff d3 b 200ab7c <_RBTree_Extract_unprotected+0x104> 200ac34: f8 20 60 04 st %i4, [ %g1 + 4 ] leaf = target->child[RBT_LEFT]; if(leaf) { leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 200ac38: 7f ff fe bb call 200a724 <_RBTree_Extract_validate_unprotected> 200ac3c: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 200ac40: 10 bf ff af b 200aafc <_RBTree_Extract_unprotected+0x84> 200ac44: c4 07 40 00 ld [ %i5 ], %g2 if (the_node == the_rbtree->first[RBT_LEFT]) { if (the_node->child[RBT_RIGHT]) the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200ac48: 80 a6 00 01 cmp %i0, %g1 200ac4c: 12 bf ff 93 bne 200aa98 <_RBTree_Extract_unprotected+0x20> 200ac50: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 200ac54: 10 bf ff 91 b 200aa98 <_RBTree_Extract_unprotected+0x20> 200ac58: c0 26 20 08 clr [ %i0 + 8 ] if (the_node == the_rbtree->first[RBT_RIGHT]) { if (the_node->child[RBT_LEFT]) the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 200ac5c: 80 a6 00 01 cmp %i0, %g1 200ac60: 12 bf ff 92 bne 200aaa8 <_RBTree_Extract_unprotected+0x30> 200ac64: c2 26 20 0c st %g1, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 200ac68: 10 bf ff 90 b 200aaa8 <_RBTree_Extract_unprotected+0x30> 200ac6c: c0 26 20 0c clr [ %i0 + 0xc ] =============================================================================== 0200a724 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ static void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 200a724: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 200a728: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; 200a72c: c4 00 40 00 ld [ %g1 ], %g2 200a730: 80 a0 a0 00 cmp %g2, 0 200a734: 02 80 00 ca be 200aa5c <_RBTree_Extract_validate_unprotected+0x338> 200a738: 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]) 200a73c: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a740: 80 a6 00 02 cmp %i0, %g2 200a744: 22 80 00 02 be,a 200a74c <_RBTree_Extract_validate_unprotected+0x28> 200a748: 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); 200a74c: c6 06 20 0c ld [ %i0 + 0xc ], %g3 200a750: 80 a0 e0 01 cmp %g3, 1 200a754: 22 80 00 5e be,a 200a8cc <_RBTree_Extract_validate_unprotected+0x1a8> 200a758: c2 06 00 00 ld [ %i0 ], %g1 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) { 200a75c: c6 00 40 00 ld [ %g1 ], %g3 200a760: 80 a0 e0 00 cmp %g3, 0 200a764: 02 80 00 59 be 200a8c8 <_RBTree_Extract_validate_unprotected+0x1a4> 200a768: 80 a0 a0 00 cmp %g2, 0 200a76c: 22 80 00 07 be,a 200a788 <_RBTree_Extract_validate_unprotected+0x64><== NEVER TAKEN 200a770: c6 00 a0 08 ld [ %g2 + 8 ], %g3 <== NOT EXECUTED 200a774: c8 00 a0 0c ld [ %g2 + 0xc ], %g4 200a778: 80 a1 20 01 cmp %g4, 1 200a77c: 22 80 00 29 be,a 200a820 <_RBTree_Extract_validate_unprotected+0xfc> 200a780: de 00 60 04 ld [ %g1 + 4 ], %o7 _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]) && 200a784: c6 00 a0 08 ld [ %g2 + 8 ], %g3 200a788: 80 a0 e0 00 cmp %g3, 0 200a78c: 22 80 00 07 be,a 200a7a8 <_RBTree_Extract_validate_unprotected+0x84> 200a790: c8 00 a0 04 ld [ %g2 + 4 ], %g4 200a794: c8 00 e0 0c ld [ %g3 + 0xc ], %g4 200a798: 80 a1 20 01 cmp %g4, 1 200a79c: 22 80 00 52 be,a 200a8e4 <_RBTree_Extract_validate_unprotected+0x1c0> 200a7a0: c8 00 60 04 ld [ %g1 + 4 ], %g4 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200a7a4: c8 00 a0 04 ld [ %g2 + 4 ], %g4 200a7a8: 80 a1 20 00 cmp %g4, 0 200a7ac: 22 80 00 07 be,a 200a7c8 <_RBTree_Extract_validate_unprotected+0xa4> 200a7b0: 86 10 20 01 mov 1, %g3 200a7b4: c8 01 20 0c ld [ %g4 + 0xc ], %g4 200a7b8: 80 a1 20 01 cmp %g4, 1 200a7bc: 22 80 00 4a be,a 200a8e4 <_RBTree_Extract_validate_unprotected+0x1c0> 200a7c0: c8 00 60 04 ld [ %g1 + 4 ], %g4 sibling->color = RBT_RED; 200a7c4: 86 10 20 01 mov 1, %g3 200a7c8: c6 20 a0 0c st %g3, [ %g2 + 0xc ] 200a7cc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200a7d0: 80 a0 a0 01 cmp %g2, 1 200a7d4: 22 80 00 3d be,a 200a8c8 <_RBTree_Extract_validate_unprotected+0x1a4> 200a7d8: 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; 200a7dc: 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; 200a7e0: 80 a0 e0 00 cmp %g3, 0 200a7e4: 02 80 00 0a be 200a80c <_RBTree_Extract_validate_unprotected+0xe8><== NEVER TAKEN 200a7e8: 84 10 20 00 clr %g2 if(!(the_node->parent->parent)) return NULL; 200a7ec: c8 00 c0 00 ld [ %g3 ], %g4 200a7f0: 80 a1 20 00 cmp %g4, 0 200a7f4: 02 80 00 07 be 200a810 <_RBTree_Extract_validate_unprotected+0xec> 200a7f8: b0 10 00 01 mov %g1, %i0 if(the_node == the_node->parent->child[RBT_LEFT]) 200a7fc: c4 00 e0 04 ld [ %g3 + 4 ], %g2 200a800: 80 a0 40 02 cmp %g1, %g2 200a804: 22 80 00 05 be,a 200a818 <_RBTree_Extract_validate_unprotected+0xf4> 200a808: c4 00 e0 08 ld [ %g3 + 8 ], %g2 c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; the_node->parent = c; 200a80c: b0 10 00 01 mov %g1, %i0 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( const RBTree_Node *the_node ) { if(!the_node) return NULL; if(!(the_node->parent)) return NULL; 200a810: 10 bf ff cf b 200a74c <_RBTree_Extract_validate_unprotected+0x28> 200a814: 82 10 00 03 mov %g3, %g1 200a818: 10 bf ff cd b 200a74c <_RBTree_Extract_validate_unprotected+0x28> 200a81c: 82 10 00 03 mov %g3, %g1 * then rotate parent left, making the sibling be the_node's grandparent. * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; 200a820: c8 20 60 0c st %g4, [ %g1 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 200a824: 88 1b c0 18 xor %o7, %i0, %g4 200a828: 80 a0 00 04 cmp %g0, %g4 200a82c: 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); 200a830: 98 1b 60 01 xor %o5, 1, %o4 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a834: 89 2b 20 02 sll %o4, 2, %g4 200a838: 96 00 40 04 add %g1, %g4, %o3 200a83c: d6 02 e0 04 ld [ %o3 + 4 ], %o3 * Now the_node has a black sibling and red parent. After rotation, * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; sibling->color = RBT_BLACK; 200a840: c0 20 a0 0c clr [ %g2 + 0xc ] 200a844: 80 a2 e0 00 cmp %o3, 0 200a848: 02 bf ff cf be 200a784 <_RBTree_Extract_validate_unprotected+0x60><== NEVER TAKEN 200a84c: 84 10 20 00 clr %g2 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a850: 80 a3 20 00 cmp %o4, 0 200a854: 02 80 00 04 be 200a864 <_RBTree_Extract_validate_unprotected+0x140> 200a858: 96 10 20 00 clr %o3 { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; 200a85c: de 00 60 08 ld [ %g1 + 8 ], %o7 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a860: 96 10 20 01 mov 1, %o3 RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a864: 9b 2b 60 02 sll %o5, 2, %o5 200a868: 84 03 c0 0d add %o7, %o5, %g2 200a86c: d8 00 a0 04 ld [ %g2 + 4 ], %o4 200a870: 97 2a e0 02 sll %o3, 2, %o3 200a874: 96 00 40 0b add %g1, %o3, %o3 200a878: d8 22 e0 04 st %o4, [ %o3 + 4 ] if (c->child[dir]) 200a87c: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a880: 80 a0 a0 00 cmp %g2, 0 200a884: 02 80 00 04 be 200a894 <_RBTree_Extract_validate_unprotected+0x170><== NEVER TAKEN 200a888: 9a 03 c0 0d add %o7, %o5, %o5 c->child[dir]->parent = the_node; 200a88c: c2 20 80 00 st %g1, [ %g2 ] 200a890: c6 00 40 00 ld [ %g1 ], %g3 c->child[dir] = the_node; 200a894: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a898: c4 00 e0 04 ld [ %g3 + 4 ], %g2 c->parent = the_node->parent; 200a89c: c6 23 c0 00 st %g3, [ %o7 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a8a0: 84 18 40 02 xor %g1, %g2, %g2 200a8a4: 80 a0 00 02 cmp %g0, %g2 200a8a8: 84 40 20 00 addx %g0, 0, %g2 200a8ac: 85 28 a0 02 sll %g2, 2, %g2 200a8b0: 84 00 c0 02 add %g3, %g2, %g2 c->parent = the_node->parent; the_node->parent = c; 200a8b4: 88 00 40 04 add %g1, %g4, %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; 200a8b8: de 20 a0 04 st %o7, [ %g2 + 4 ] c->parent = the_node->parent; the_node->parent = c; 200a8bc: de 20 40 00 st %o7, [ %g1 ] 200a8c0: 10 bf ff b1 b 200a784 <_RBTree_Extract_validate_unprotected+0x60> 200a8c4: c4 01 20 04 ld [ %g4 + 4 ], %g2 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; 200a8c8: c2 06 00 00 ld [ %i0 ], %g1 200a8cc: c2 00 40 00 ld [ %g1 ], %g1 200a8d0: 80 a0 60 00 cmp %g1, 0 200a8d4: 22 80 00 02 be,a 200a8dc <_RBTree_Extract_validate_unprotected+0x1b8> 200a8d8: c0 26 20 0c clr [ %i0 + 0xc ] 200a8dc: 81 c7 e0 08 ret 200a8e0: 81 e8 00 00 restore * cases, either the_node is to the left or the right of the parent. * In both cases, first check if one of sibling's children is black, * and if so rotate in the proper direction and update sibling pointer. * Then switch the sibling and parent colors, and rotate through parent. */ dir = the_node != parent->child[0]; 200a8e4: 88 19 00 18 xor %g4, %i0, %g4 200a8e8: 80 a0 00 04 cmp %g0, %g4 200a8ec: 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); 200a8f0: 98 1b 60 01 xor %o5, 1, %o4 if (!_RBTree_Is_red(sibling->child[_RBTree_Opposite_direction(dir)])) { 200a8f4: 9f 2b 20 02 sll %o4, 2, %o7 200a8f8: 88 00 80 0f add %g2, %o7, %g4 200a8fc: 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); 200a900: 80 a1 20 00 cmp %g4, 0 200a904: 02 80 00 06 be 200a91c <_RBTree_Extract_validate_unprotected+0x1f8> 200a908: 96 10 20 01 mov 1, %o3 200a90c: d6 01 20 0c ld [ %g4 + 0xc ], %o3 200a910: 80 a2 e0 01 cmp %o3, 1 200a914: 02 80 00 56 be 200aa6c <_RBTree_Extract_validate_unprotected+0x348> 200a918: 96 10 20 01 mov 1, %o3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; 200a91c: 89 2b 60 02 sll %o5, 2, %g4 200a920: 88 00 80 04 add %g2, %g4, %g4 200a924: d4 01 20 04 ld [ %g4 + 4 ], %o2 * 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; 200a928: d6 20 a0 0c st %o3, [ %g2 + 0xc ] */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a92c: 88 1b 20 01 xor %o4, 1, %g4 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a930: 97 29 20 02 sll %g4, 2, %o3 200a934: 96 00 80 0b add %g2, %o3, %o3 200a938: d6 02 e0 04 ld [ %o3 + 4 ], %o3 200a93c: 80 a2 e0 00 cmp %o3, 0 200a940: 02 80 00 1c be 200a9b0 <_RBTree_Extract_validate_unprotected+0x28c><== NEVER TAKEN 200a944: c0 22 a0 0c clr [ %o2 + 0xc ] */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a948: 80 a1 20 00 cmp %g4, 0 200a94c: 12 80 00 04 bne 200a95c <_RBTree_Extract_validate_unprotected+0x238> 200a950: 96 10 20 01 mov 1, %o3 { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; 200a954: c6 00 a0 04 ld [ %g2 + 4 ], %g3 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a958: 96 10 20 00 clr %o3 RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a95c: 88 00 c0 0f add %g3, %o7, %g4 200a960: d4 01 20 04 ld [ %g4 + 4 ], %o2 200a964: 97 2a e0 02 sll %o3, 2, %o3 200a968: 96 00 80 0b add %g2, %o3, %o3 200a96c: d4 22 e0 04 st %o2, [ %o3 + 4 ] if (c->child[dir]) 200a970: c8 01 20 04 ld [ %g4 + 4 ], %g4 200a974: 80 a1 20 00 cmp %g4, 0 200a978: 32 80 00 02 bne,a 200a980 <_RBTree_Extract_validate_unprotected+0x25c> 200a97c: c4 21 00 00 st %g2, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a980: c8 00 80 00 ld [ %g2 ], %g4 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; 200a984: 96 00 c0 0f add %g3, %o7, %o3 200a988: c4 22 e0 04 st %g2, [ %o3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a98c: d6 01 20 04 ld [ %g4 + 4 ], %o3 c->parent = the_node->parent; 200a990: c8 20 c0 00 st %g4, [ %g3 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200a994: 96 18 80 0b xor %g2, %o3, %o3 c->parent = the_node->parent; the_node->parent = c; 200a998: c6 20 80 00 st %g3, [ %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; 200a99c: 80 a0 00 0b cmp %g0, %o3 200a9a0: 84 40 20 00 addx %g0, 0, %g2 200a9a4: 85 28 a0 02 sll %g2, 2, %g2 200a9a8: 88 01 00 02 add %g4, %g2, %g4 200a9ac: c6 21 20 04 st %g3, [ %g4 + 4 ] sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, _RBTree_Opposite_direction(dir)); sibling = parent->child[_RBTree_Opposite_direction(dir)]; 200a9b0: 84 00 40 0f add %g1, %o7, %g2 200a9b4: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200a9b8: 9e 00 80 0f add %g2, %o7, %o7 200a9bc: c8 03 e0 04 ld [ %o7 + 4 ], %g4 200a9c0: 9e 10 00 02 mov %g2, %o7 } sibling->color = parent->color; 200a9c4: c6 00 60 0c ld [ %g1 + 0xc ], %g3 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200a9c8: 80 a3 e0 00 cmp %o7, 0 200a9cc: c6 20 a0 0c st %g3, [ %g2 + 0xc ] parent->color = RBT_BLACK; 200a9d0: c0 20 60 0c clr [ %g1 + 0xc ] 200a9d4: 02 bf ff bd be 200a8c8 <_RBTree_Extract_validate_unprotected+0x1a4><== NEVER TAKEN 200a9d8: c0 21 20 0c clr [ %g4 + 0xc ] */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a9dc: 80 a3 20 00 cmp %o4, 0 200a9e0: 22 80 00 21 be,a 200aa64 <_RBTree_Extract_validate_unprotected+0x340> 200a9e4: c4 00 60 04 ld [ %g1 + 4 ], %g2 { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; 200a9e8: c4 00 60 08 ld [ %g1 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200a9ec: 88 10 20 01 mov 1, %g4 RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200a9f0: 9b 2b 60 02 sll %o5, 2, %o5 200a9f4: 86 00 80 0d add %g2, %o5, %g3 200a9f8: de 00 e0 04 ld [ %g3 + 4 ], %o7 200a9fc: 89 29 20 02 sll %g4, 2, %g4 200aa00: 88 00 40 04 add %g1, %g4, %g4 200aa04: de 21 20 04 st %o7, [ %g4 + 4 ] if (c->child[dir]) 200aa08: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200aa0c: 80 a0 e0 00 cmp %g3, 0 200aa10: 32 80 00 02 bne,a 200aa18 <_RBTree_Extract_validate_unprotected+0x2f4> 200aa14: 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; 200aa18: 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; 200aa1c: 9a 00 80 0d add %g2, %o5, %o5 200aa20: c2 23 60 04 st %g1, [ %o5 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aa24: c8 00 e0 04 ld [ %g3 + 4 ], %g4 c->parent = the_node->parent; 200aa28: c6 20 80 00 st %g3, [ %g2 ] the_node->parent = c; 200aa2c: 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; 200aa30: 88 18 40 04 xor %g1, %g4, %g4 200aa34: 80 a0 00 04 cmp %g0, %g4 200aa38: 82 40 20 00 addx %g0, 0, %g1 200aa3c: 83 28 60 02 sll %g1, 2, %g1 200aa40: 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; 200aa44: c2 06 00 00 ld [ %i0 ], %g1 200aa48: c4 20 e0 04 st %g2, [ %g3 + 4 ] 200aa4c: c2 00 40 00 ld [ %g1 ], %g1 200aa50: 80 a0 60 00 cmp %g1, 0 200aa54: 22 bf ff a2 be,a 200a8dc <_RBTree_Extract_validate_unprotected+0x1b8><== NEVER TAKEN 200aa58: c0 26 20 0c clr [ %i0 + 0xc ] <== NOT EXECUTED 200aa5c: 81 c7 e0 08 ret 200aa60: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200aa64: 10 bf ff e3 b 200a9f0 <_RBTree_Extract_validate_unprotected+0x2cc> 200aa68: 88 10 20 00 clr %g4 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200aa6c: 9e 00 40 0f add %g1, %o7, %o7 200aa70: 10 bf ff d5 b 200a9c4 <_RBTree_Extract_validate_unprotected+0x2a0> 200aa74: de 03 e0 04 ld [ %o7 + 4 ], %o7 =============================================================================== 0200b730 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 200b730: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200b734: 7f ff e1 a6 call 2003dcc 200b738: b8 10 00 18 mov %i0, %i4 200b73c: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 200b740: f6 06 20 04 ld [ %i0 + 4 ], %i3 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b744: 80 a6 e0 00 cmp %i3, 0 200b748: 02 80 00 15 be 200b79c <_RBTree_Find+0x6c> <== NEVER TAKEN 200b74c: b0 10 20 00 clr %i0 compare_result = the_rbtree->compare_function(the_node, iter_node); 200b750: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200b754: 92 10 00 1b mov %i3, %o1 200b758: 9f c0 40 00 call %g1 200b75c: 90 10 00 19 mov %i1, %o0 found = iter_node; if ( the_rbtree->is_unique ) break; } RBTree_Direction dir = 200b760: 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 ) ) { 200b764: 80 a2 20 00 cmp %o0, 0 found = iter_node; if ( the_rbtree->is_unique ) break; } RBTree_Direction dir = 200b768: 82 20 40 08 sub %g1, %o0, %g1 200b76c: 83 30 60 1f srl %g1, 0x1f, %g1 (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b770: 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 ) ) { 200b774: 12 80 00 06 bne 200b78c <_RBTree_Find+0x5c> 200b778: 82 06 c0 01 add %i3, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200b77c: c4 0f 20 14 ldub [ %i4 + 0x14 ], %g2 200b780: 80 a0 a0 00 cmp %g2, 0 200b784: 12 80 00 0a bne 200b7ac <_RBTree_Find+0x7c> 200b788: b0 10 00 1b mov %i3, %i0 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200b78c: f6 00 60 04 ld [ %g1 + 4 ], %i3 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 200b790: 80 a6 e0 00 cmp %i3, 0 200b794: 32 bf ff f0 bne,a 200b754 <_RBTree_Find+0x24> 200b798: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 200b79c: 7f ff e1 90 call 2003ddc 200b7a0: 90 10 00 1d mov %i5, %o0 return return_node; } 200b7a4: 81 c7 e0 08 ret 200b7a8: 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 ); 200b7ac: 7f ff e1 8c call 2003ddc 200b7b0: 90 10 00 1d mov %i5, %o0 return return_node; } 200b7b4: 81 c7 e0 08 ret 200b7b8: 81 e8 00 00 restore =============================================================================== 0200bbb8 <_RBTree_Initialize>: void *starting_address, size_t number_nodes, size_t node_size, bool is_unique ) { 200bbb8: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 200bbbc: 80 a6 20 00 cmp %i0, 0 200bbc0: 02 80 00 0f be 200bbfc <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bbc4: 80 a6 e0 00 cmp %i3, 0 RBTree_Control *the_rbtree, RBTree_Compare_function compare_function, bool is_unique ) { the_rbtree->permanent_null = NULL; 200bbc8: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 200bbcc: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 200bbd0: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 200bbd4: c0 26 20 0c clr [ %i0 + 0xc ] the_rbtree->compare_function = compare_function; 200bbd8: 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-- ) { 200bbdc: 02 80 00 08 be 200bbfc <_RBTree_Initialize+0x44> <== NEVER TAKEN 200bbe0: fa 2e 20 14 stb %i5, [ %i0 + 0x14 ] _RBTree_Insert(the_rbtree, next); 200bbe4: 92 10 00 1a mov %i2, %o1 200bbe8: 7f ff ff b5 call 200babc <_RBTree_Insert> 200bbec: 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-- ) { 200bbf0: b6 86 ff ff addcc %i3, -1, %i3 200bbf4: 12 bf ff fc bne 200bbe4 <_RBTree_Initialize+0x2c> 200bbf8: b4 06 80 1c add %i2, %i4, %i2 200bbfc: 81 c7 e0 08 ret 200bc00: 81 e8 00 00 restore =============================================================================== 0200ac98 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 200ac98: 9d e3 bf a0 save %sp, -96, %sp 200ac9c: b8 10 00 18 mov %i0, %i4 if(!the_node) return (RBTree_Node*)-1; 200aca0: 80 a6 60 00 cmp %i1, 0 200aca4: 02 80 00 96 be 200aefc <_RBTree_Insert_unprotected+0x264> 200aca8: b0 10 3f ff mov -1, %i0 RBTree_Node *iter_node = the_rbtree->root; 200acac: fa 07 20 04 ld [ %i4 + 4 ], %i5 int compare_result; if (!iter_node) { /* special case: first node inserted */ 200acb0: 80 a7 60 00 cmp %i5, 0 200acb4: 32 80 00 05 bne,a 200acc8 <_RBTree_Insert_unprotected+0x30> 200acb8: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 the_node->color = RBT_BLACK; 200acbc: 10 80 00 a0 b 200af3c <_RBTree_Insert_unprotected+0x2a4> 200acc0: 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); 200acc4: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 200acc8: 92 10 00 1d mov %i5, %o1 200accc: 9f c0 40 00 call %g1 200acd0: 90 10 00 19 mov %i1, %o0 if ( the_rbtree->is_unique && _RBTree_Is_equal( compare_result ) ) 200acd4: c2 0f 20 14 ldub [ %i4 + 0x14 ], %g1 200acd8: 80 a0 60 00 cmp %g1, 0 200acdc: 22 80 00 05 be,a 200acf0 <_RBTree_Insert_unprotected+0x58> 200ace0: 90 38 00 08 xnor %g0, %o0, %o0 200ace4: 80 a2 20 00 cmp %o0, 0 200ace8: 02 80 00 87 be 200af04 <_RBTree_Insert_unprotected+0x26c> 200acec: 90 38 00 08 xnor %g0, %o0, %o0 return iter_node; RBTree_Direction dir = !_RBTree_Is_lesser( compare_result ); 200acf0: 91 32 20 1f srl %o0, 0x1f, %o0 if (!iter_node->child[dir]) { 200acf4: 83 2a 20 02 sll %o0, 2, %g1 200acf8: 82 07 40 01 add %i5, %g1, %g1 200acfc: f0 00 60 04 ld [ %g1 + 4 ], %i0 200ad00: 80 a6 20 00 cmp %i0, 0 200ad04: 32 bf ff f0 bne,a 200acc4 <_RBTree_Insert_unprotected+0x2c> 200ad08: ba 10 00 18 mov %i0, %i5 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200ad0c: c0 26 60 08 clr [ %i1 + 8 ] 200ad10: c0 26 60 04 clr [ %i1 + 4 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( const RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 200ad14: 90 02 20 02 add %o0, 2, %o0 200ad18: 91 2a 20 02 sll %o0, 2, %o0 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 200ad1c: c4 07 00 08 ld [ %i4 + %o0 ], %g2 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; iter_node->child[dir] = the_node; 200ad20: f2 20 60 04 st %i1, [ %g1 + 4 ] the_node->parent = iter_node; 200ad24: 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; 200ad28: 82 10 20 01 mov 1, %g1 iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 200ad2c: 80 a0 80 1d cmp %g2, %i5 200ad30: 02 80 00 81 be 200af34 <_RBTree_Insert_unprotected+0x29c> 200ad34: c2 26 60 0c st %g1, [ %i1 + 0xc ] 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; 200ad38: 9a 10 20 01 mov 1, %o5 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200ad3c: c2 07 40 00 ld [ %i5 ], %g1 200ad40: 84 90 60 00 orcc %g1, 0, %g2 200ad44: 22 80 00 6e be,a 200aefc <_RBTree_Insert_unprotected+0x264> 200ad48: 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); 200ad4c: c6 07 60 0c ld [ %i5 + 0xc ], %g3 200ad50: 80 a0 e0 01 cmp %g3, 1 200ad54: 12 80 00 6d bne 200af08 <_RBTree_Insert_unprotected+0x270> 200ad58: 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->parent->parent->parent)) return NULL; 200ad5c: de 00 40 00 ld [ %g1 ], %o7 200ad60: 80 a3 e0 00 cmp %o7, 0 200ad64: 02 80 00 0c be 200ad94 <_RBTree_Insert_unprotected+0xfc> <== NEVER TAKEN 200ad68: f8 00 60 04 ld [ %g1 + 4 ], %i4 { 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]) 200ad6c: 80 a7 00 1d cmp %i4, %i5 200ad70: 02 80 00 6f be 200af2c <_RBTree_Insert_unprotected+0x294> 200ad74: 86 10 00 1c mov %i4, %g3 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 200ad78: 80 a0 e0 00 cmp %g3, 0 200ad7c: 22 80 00 07 be,a 200ad98 <_RBTree_Insert_unprotected+0x100> 200ad80: c8 07 60 04 ld [ %i5 + 4 ], %g4 200ad84: c8 00 e0 0c ld [ %g3 + 0xc ], %g4 200ad88: 80 a1 20 01 cmp %g4, 1 200ad8c: 22 80 00 61 be,a 200af10 <_RBTree_Insert_unprotected+0x278> 200ad90: c0 27 60 0c clr [ %i5 + 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]; 200ad94: c8 07 60 04 ld [ %i5 + 4 ], %g4 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ad98: b8 1f 00 1d xor %i4, %i5, %i4 200ad9c: 80 a0 00 1c cmp %g0, %i4 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]; 200ada0: b8 1e 40 04 xor %i1, %g4, %i4 RBTree_Direction pdir = the_node->parent != g->child[0]; 200ada4: 86 40 20 00 addx %g0, 0, %g3 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]; 200ada8: 80 a0 00 1c cmp %g0, %i4 200adac: b8 40 20 00 addx %g0, 0, %i4 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 200adb0: 80 a7 00 03 cmp %i4, %g3 200adb4: 02 80 00 27 be 200ae50 <_RBTree_Insert_unprotected+0x1b8> 200adb8: 9e 18 e0 01 xor %g3, 1, %o7 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200adbc: b9 2b e0 02 sll %o7, 2, %i4 200adc0: b8 07 40 1c add %i5, %i4, %i4 200adc4: d8 07 20 04 ld [ %i4 + 4 ], %o4 200adc8: 80 a3 20 00 cmp %o4, 0 200adcc: 02 80 00 1e be 200ae44 <_RBTree_Insert_unprotected+0x1ac> <== NEVER TAKEN 200add0: b9 28 e0 02 sll %g3, 2, %i4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200add4: 80 a3 e0 00 cmp %o7, 0 200add8: 02 80 00 05 be 200adec <_RBTree_Insert_unprotected+0x154> 200addc: 98 10 20 00 clr %o4 { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; 200ade0: c8 07 60 08 ld [ %i5 + 8 ], %g4 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ade4: 98 10 20 01 mov 1, %o4 RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200ade8: b9 28 e0 02 sll %g3, 2, %i4 200adec: 9e 01 00 1c add %g4, %i4, %o7 200adf0: d6 03 e0 04 ld [ %o7 + 4 ], %o3 200adf4: 99 2b 20 02 sll %o4, 2, %o4 200adf8: 98 07 40 0c add %i5, %o4, %o4 200adfc: d6 23 20 04 st %o3, [ %o4 + 4 ] if (c->child[dir]) 200ae00: de 03 e0 04 ld [ %o7 + 4 ], %o7 200ae04: 80 a3 e0 00 cmp %o7, 0 200ae08: 22 80 00 05 be,a 200ae1c <_RBTree_Insert_unprotected+0x184> 200ae0c: 9e 01 00 1c add %g4, %i4, %o7 c->child[dir]->parent = the_node; 200ae10: fa 23 c0 00 st %i5, [ %o7 ] 200ae14: c2 07 40 00 ld [ %i5 ], %g1 c->child[dir] = the_node; 200ae18: 9e 01 00 1c add %g4, %i4, %o7 200ae1c: fa 23 e0 04 st %i5, [ %o7 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200ae20: de 00 60 04 ld [ %g1 + 4 ], %o7 c->parent = the_node->parent; 200ae24: c2 21 00 00 st %g1, [ %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; 200ae28: 9e 1b c0 1d xor %o7, %i5, %o7 c->parent = the_node->parent; the_node->parent = c; 200ae2c: c8 27 40 00 st %g4, [ %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; 200ae30: 80 a0 00 0f cmp %g0, %o7 200ae34: ba 40 20 00 addx %g0, 0, %i5 200ae38: bb 2f 60 02 sll %i5, 2, %i5 200ae3c: 82 00 40 1d add %g1, %i5, %g1 200ae40: c8 20 60 04 st %g4, [ %g1 + 4 ] _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; 200ae44: b2 06 40 1c add %i1, %i4, %i1 200ae48: f2 06 60 04 ld [ %i1 + 4 ], %i1 200ae4c: fa 06 40 00 ld [ %i1 ], %i5 } the_node->parent->color = RBT_BLACK; 200ae50: c0 27 60 0c clr [ %i5 + 0xc ] g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 200ae54: 86 23 40 03 sub %o5, %g3, %g3 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ae58: 80 a0 00 03 cmp %g0, %g3 200ae5c: 82 60 3f ff subx %g0, -1, %g1 RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; 200ae60: 89 28 60 02 sll %g1, 2, %g4 200ae64: 88 00 80 04 add %g2, %g4, %g4 200ae68: c8 01 20 04 ld [ %g4 + 4 ], %g4 200ae6c: 80 a1 20 00 cmp %g4, 0 200ae70: 02 bf ff b3 be 200ad3c <_RBTree_Insert_unprotected+0xa4> <== NEVER TAKEN 200ae74: da 20 a0 0c st %o5, [ %g2 + 0xc ] */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ae78: 80 a0 60 00 cmp %g1, 0 200ae7c: 22 80 00 2a be,a 200af24 <_RBTree_Insert_unprotected+0x28c> 200ae80: c2 00 a0 04 ld [ %g2 + 4 ], %g1 { RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; 200ae84: c2 00 a0 08 ld [ %g2 + 8 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200ae88: ba 10 20 01 mov 1, %i5 RBTree_Node *c; if (the_node == NULL) return; if (the_node->child[_RBTree_Opposite_direction(dir)] == NULL) return; c = the_node->child[_RBTree_Opposite_direction(dir)]; the_node->child[_RBTree_Opposite_direction(dir)] = c->child[dir]; 200ae8c: 87 28 e0 02 sll %g3, 2, %g3 200ae90: 88 00 40 03 add %g1, %g3, %g4 200ae94: f8 01 20 04 ld [ %g4 + 4 ], %i4 200ae98: bb 2f 60 02 sll %i5, 2, %i5 200ae9c: ba 00 80 1d add %g2, %i5, %i5 200aea0: f8 27 60 04 st %i4, [ %i5 + 4 ] if (c->child[dir]) 200aea4: c8 01 20 04 ld [ %g4 + 4 ], %g4 200aea8: 80 a1 20 00 cmp %g4, 0 200aeac: 32 80 00 02 bne,a 200aeb4 <_RBTree_Insert_unprotected+0x21c> 200aeb0: c4 21 00 00 st %g2, [ %g4 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aeb4: c8 00 80 00 ld [ %g2 ], %g4 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; 200aeb8: 86 00 40 03 add %g1, %g3, %g3 the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; 200aebc: c8 20 40 00 st %g4, [ %g1 ] 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; 200aec0: c4 20 e0 04 st %g2, [ %g3 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; c->parent = the_node->parent; the_node->parent = c; 200aec4: c2 20 80 00 st %g1, [ %g2 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 200aec8: c6 01 20 04 ld [ %g4 + 4 ], %g3 c->parent = the_node->parent; the_node->parent = c; 200aecc: fa 06 40 00 ld [ %i1 ], %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; 200aed0: 86 18 80 03 xor %g2, %g3, %g3 200aed4: 80 a0 00 03 cmp %g0, %g3 200aed8: 84 40 20 00 addx %g0, 0, %g2 200aedc: 85 28 a0 02 sll %g2, 2, %g2 200aee0: 88 01 00 02 add %g4, %g2, %g4 200aee4: c2 21 20 04 st %g1, [ %g4 + 4 ] */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( const RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 200aee8: c2 07 40 00 ld [ %i5 ], %g1 200aeec: 84 90 60 00 orcc %g1, 0, %g2 200aef0: 32 bf ff 98 bne,a 200ad50 <_RBTree_Insert_unprotected+0xb8><== ALWAYS TAKEN 200aef4: c6 07 60 0c ld [ %i5 + 0xc ], %g3 } } if(!the_node->parent->parent) the_node->color = RBT_BLACK; 200aef8: c0 26 60 0c clr [ %i1 + 0xc ] <== NOT EXECUTED 200aefc: 81 c7 e0 08 ret 200af00: 81 e8 00 00 restore 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 ) ) 200af04: b0 10 00 1d mov %i5, %i0 /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; } 200af08: 81 c7 e0 08 ret 200af0c: 81 e8 00 00 restore 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; 200af10: c0 20 e0 0c clr [ %g3 + 0xc ] g->color = RBT_RED; 200af14: c8 20 60 0c st %g4, [ %g1 + 0xc ] 200af18: ba 10 00 0f mov %o7, %i5 200af1c: 10 bf ff 88 b 200ad3c <_RBTree_Insert_unprotected+0xa4> 200af20: b2 10 00 01 mov %g1, %i1 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200af24: 10 bf ff da b 200ae8c <_RBTree_Insert_unprotected+0x1f4> 200af28: ba 10 20 00 clr %i5 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]; 200af2c: 10 bf ff 93 b 200ad78 <_RBTree_Insert_unprotected+0xe0> 200af30: c6 00 60 08 ld [ %g1 + 8 ], %g3 the_node->color = RBT_RED; iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { the_rbtree->first[dir] = the_node; 200af34: 10 bf ff 81 b 200ad38 <_RBTree_Insert_unprotected+0xa0> 200af38: f2 27 00 08 st %i1, [ %i4 + %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; 200af3c: f2 27 20 04 st %i1, [ %i4 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 200af40: f2 27 20 0c st %i1, [ %i4 + 0xc ] 200af44: f2 27 20 08 st %i1, [ %i4 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 200af48: f8 26 40 00 st %i4, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 200af4c: c0 26 60 08 clr [ %i1 + 8 ] 200af50: c0 26 60 04 clr [ %i1 + 4 ] } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); } return (RBTree_Node*)0; 200af54: 81 c7 e0 08 ret 200af58: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200af70 <_RBTree_Iterate_unprotected>: const RBTree_Control *rbtree, RBTree_Direction dir, RBTree_Visitor visitor, void *visitor_arg ) { 200af70: 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); 200af74: 80 a0 00 19 cmp %g0, %i1 200af78: 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]; 200af7c: 82 00 60 02 add %g1, 2, %g1 200af80: 83 28 60 02 sll %g1, 2, %g1 200af84: 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 ) { 200af88: 80 a7 60 00 cmp %i5, 0 200af8c: 02 80 00 0d be 200afc0 <_RBTree_Iterate_unprotected+0x50> 200af90: 90 10 00 1d mov %i5, %o0 stop = (*visitor)( current, dir, visitor_arg ); 200af94: 92 10 00 19 mov %i1, %o1 200af98: 9f c6 80 00 call %i2 200af9c: 94 10 00 1b mov %i3, %o2 current = _RBTree_Next_unprotected( rbtree, current, dir ); 200afa0: 92 10 00 1d mov %i5, %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 ); 200afa4: b8 10 00 08 mov %o0, %i4 current = _RBTree_Next_unprotected( rbtree, current, dir ); 200afa8: 94 10 00 19 mov %i1, %o2 200afac: 40 00 00 07 call 200afc8 <_RBTree_Next_unprotected> 200afb0: 90 10 00 18 mov %i0, %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 ) { 200afb4: 80 8f 20 ff btst 0xff, %i4 200afb8: 02 bf ff f4 be 200af88 <_RBTree_Iterate_unprotected+0x18> <== ALWAYS TAKEN 200afbc: ba 10 00 08 mov %o0, %i5 200afc0: 81 c7 e0 08 ret 200afc4: 81 e8 00 00 restore =============================================================================== 0200afc8 <_RBTree_Next_unprotected>: const RBTree_Node *node, RBTree_Direction dir ) { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); RBTree_Node *current = node->child [dir]; 200afc8: 85 2a a0 02 sll %o2, 2, %g2 200afcc: 82 02 40 02 add %o1, %g2, %g1 200afd0: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ RTEMS_INLINE_ROUTINE RBTree_Direction _RBTree_Opposite_direction( RBTree_Direction the_dir ) { return (RBTree_Direction) !((int) the_dir); 200afd4: 80 a0 00 0a cmp %g0, %o2 200afd8: 86 60 3f ff subx %g0, -1, %g3 RBTree_Node *next = NULL; if ( current != NULL ) { 200afdc: 80 a0 60 00 cmp %g1, 0 200afe0: 02 80 00 0a be 200b008 <_RBTree_Next_unprotected+0x40> 200afe4: 94 10 00 08 mov %o0, %o2 200afe8: 87 28 e0 02 sll %g3, 2, %g3 next = current; while ( (current = current->child [opp_dir]) != NULL ) { 200afec: 84 00 40 03 add %g1, %g3, %g2 200aff0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200aff4: 80 a0 a0 00 cmp %g2, 0 200aff8: 32 bf ff fd bne,a 200afec <_RBTree_Next_unprotected+0x24> 200affc: 82 10 00 02 mov %g2, %g1 RBTree_Direction dir ) { RBTree_Direction opp_dir = _RBTree_Opposite_direction( dir ); RBTree_Node *current = node->child [dir]; RBTree_Node *next = NULL; 200b000: 81 c3 e0 08 retl 200b004: 90 10 00 01 mov %g1, %o0 while ( (current = current->child [opp_dir]) != NULL ) { next = current; } } else { const RBTree_Node *null = (const RBTree_Node *) rbtree; RBTree_Node *parent = node->parent; 200b008: c8 02 40 00 ld [ %o1 ], %g4 if ( parent != null && node == parent->child [opp_dir] ) { 200b00c: 80 a2 80 04 cmp %o2, %g4 200b010: 02 80 00 19 be 200b074 <_RBTree_Next_unprotected+0xac> 200b014: 90 10 20 00 clr %o0 200b018: 87 28 e0 02 sll %g3, 2, %g3 200b01c: 86 01 00 03 add %g4, %g3, %g3 200b020: c2 00 e0 04 ld [ %g3 + 4 ], %g1 200b024: 80 a0 40 09 cmp %g1, %o1 200b028: 02 80 00 13 be 200b074 <_RBTree_Next_unprotected+0xac> 200b02c: 90 10 00 04 mov %g4, %o0 next = parent; } else { while ( parent != null && node == parent->child [dir] ) { 200b030: 82 01 00 02 add %g4, %g2, %g1 200b034: c2 00 60 04 ld [ %g1 + 4 ], %g1 200b038: 80 a2 40 01 cmp %o1, %g1 200b03c: 22 80 00 09 be,a 200b060 <_RBTree_Next_unprotected+0x98> <== ALWAYS TAKEN 200b040: c2 01 00 00 ld [ %g4 ], %g1 200b044: 10 bf ff ef b 200b000 <_RBTree_Next_unprotected+0x38> <== NOT EXECUTED 200b048: 82 10 00 04 mov %g4, %g1 <== NOT EXECUTED 200b04c: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200b050: 80 a0 c0 04 cmp %g3, %g4 200b054: 12 bf ff eb bne 200b000 <_RBTree_Next_unprotected+0x38> 200b058: 88 10 00 01 mov %g1, %g4 node = parent; parent = node->parent; 200b05c: c2 01 00 00 ld [ %g4 ], %g1 RBTree_Node *parent = node->parent; if ( parent != null && node == parent->child [opp_dir] ) { next = parent; } else { while ( parent != null && node == parent->child [dir] ) { 200b060: 80 a2 80 01 cmp %o2, %g1 200b064: 12 bf ff fa bne 200b04c <_RBTree_Next_unprotected+0x84> 200b068: 86 00 40 02 add %g1, %g2, %g3 } } } return next; } 200b06c: 81 c3 e0 08 retl 200b070: 90 10 20 00 clr %o0 200b074: 81 c3 e0 08 retl =============================================================================== 02008104 <_RTEMS_tasks_Initialize_user_tasks_body>: * * Output parameters: NONE */ void _RTEMS_tasks_Initialize_user_tasks_body( void ) { 2008104: 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; 2008108: 03 00 80 77 sethi %hi(0x201dc00), %g1 200810c: 82 10 60 9c or %g1, 0x9c, %g1 ! 201dc9c 2008110: 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 ) 2008114: 80 a7 60 00 cmp %i5, 0 2008118: 02 80 00 18 be 2008178 <_RTEMS_tasks_Initialize_user_tasks_body+0x74> 200811c: 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++ ) { 2008120: 80 a6 e0 00 cmp %i3, 0 2008124: 02 80 00 15 be 2008178 <_RTEMS_tasks_Initialize_user_tasks_body+0x74><== NEVER TAKEN 2008128: b8 10 20 00 clr %i4 return_value = rtems_task_create( 200812c: d4 07 60 04 ld [ %i5 + 4 ], %o2 2008130: d0 07 40 00 ld [ %i5 ], %o0 2008134: d2 07 60 08 ld [ %i5 + 8 ], %o1 2008138: d6 07 60 14 ld [ %i5 + 0x14 ], %o3 200813c: d8 07 60 0c ld [ %i5 + 0xc ], %o4 2008140: 7f ff ff 70 call 2007f00 2008144: 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 ) ) 2008148: 94 92 20 00 orcc %o0, 0, %o2 200814c: 12 80 00 0d bne 2008180 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008150: d0 07 bf fc ld [ %fp + -4 ], %o0 _Internal_error_Occurred( INTERNAL_ERROR_RTEMS_API, true, return_value ); return_value = rtems_task_start( 2008154: d4 07 60 18 ld [ %i5 + 0x18 ], %o2 2008158: 40 00 00 0e call 2008190 200815c: 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 ) ) 2008160: 94 92 20 00 orcc %o0, 0, %o2 2008164: 12 80 00 07 bne 2008180 <_RTEMS_tasks_Initialize_user_tasks_body+0x7c> 2008168: b8 07 20 01 inc %i4 return; /* * Now iterate over the initialization tasks and create/start them. */ for ( index=0 ; index < maximum ; index++ ) { 200816c: 80 a7 00 1b cmp %i4, %i3 2008170: 12 bf ff ef bne 200812c <_RTEMS_tasks_Initialize_user_tasks_body+0x28><== NEVER TAKEN 2008174: ba 07 60 1c add %i5, 0x1c, %i5 2008178: 81 c7 e0 08 ret 200817c: 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 ); 2008180: 90 10 20 01 mov 1, %o0 2008184: 40 00 04 29 call 2009228 <_Internal_error_Occurred> 2008188: 92 10 20 01 mov 1, %o1 =============================================================================== 0200db94 <_RTEMS_tasks_Switch_extension>: /* * Per Task Variables */ tvp = executing->task_variables; 200db94: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 200db98: 80 a0 60 00 cmp %g1, 0 200db9c: 22 80 00 0c be,a 200dbcc <_RTEMS_tasks_Switch_extension+0x38> 200dba0: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 tvp->tval = *tvp->ptr; 200dba4: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->gval; 200dba8: c6 00 60 08 ld [ %g1 + 8 ], %g3 * Per Task Variables */ tvp = executing->task_variables; while (tvp) { tvp->tval = *tvp->ptr; 200dbac: c8 00 80 00 ld [ %g2 ], %g4 200dbb0: c8 20 60 0c st %g4, [ %g1 + 0xc ] *tvp->ptr = tvp->gval; 200dbb4: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200dbb8: c2 00 40 00 ld [ %g1 ], %g1 /* * Per Task Variables */ tvp = executing->task_variables; while (tvp) { 200dbbc: 80 a0 60 00 cmp %g1, 0 200dbc0: 32 bf ff fa bne,a 200dba8 <_RTEMS_tasks_Switch_extension+0x14><== NEVER TAKEN 200dbc4: 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; 200dbc8: c2 02 61 64 ld [ %o1 + 0x164 ], %g1 while (tvp) { 200dbcc: 80 a0 60 00 cmp %g1, 0 200dbd0: 02 80 00 0b be 200dbfc <_RTEMS_tasks_Switch_extension+0x68> 200dbd4: 01 00 00 00 nop tvp->gval = *tvp->ptr; 200dbd8: c4 00 60 04 ld [ %g1 + 4 ], %g2 *tvp->ptr = tvp->tval; 200dbdc: 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; 200dbe0: c8 00 80 00 ld [ %g2 ], %g4 200dbe4: c8 20 60 08 st %g4, [ %g1 + 8 ] *tvp->ptr = tvp->tval; 200dbe8: c6 20 80 00 st %g3, [ %g2 ] tvp = (rtems_task_variable_t *)tvp->next; 200dbec: c2 00 40 00 ld [ %g1 ], %g1 *tvp->ptr = tvp->gval; tvp = (rtems_task_variable_t *)tvp->next; } tvp = heir->task_variables; while (tvp) { 200dbf0: 80 a0 60 00 cmp %g1, 0 200dbf4: 32 bf ff fa bne,a 200dbdc <_RTEMS_tasks_Switch_extension+0x48><== NEVER TAKEN 200dbf8: c4 00 60 04 ld [ %g1 + 4 ], %g2 <== NOT EXECUTED 200dbfc: 81 c3 e0 08 retl =============================================================================== 02044888 <_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 ) { 2044888: 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; 204488c: fa 06 20 40 ld [ %i0 + 0x40 ], %i5 /* * Determine elapsed wall time since period initiated. */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _TOD_Get_uptime( &uptime ); 2044890: 7f ff a7 dc call 202e800 <_TOD_Get_uptime> 2044894: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2044898: d8 1e 20 50 ldd [ %i0 + 0x50 ], %o4 _Timestamp_Subtract( 204489c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 20448a0: 03 00 81 d7 sethi %hi(0x2075c00), %g1 20448a4: 82 10 60 70 or %g1, 0x70, %g1 ! 2075c70 <_Per_CPU_Information> 20448a8: c8 00 60 0c ld [ %g1 + 0xc ], %g4 20448ac: 9a a0 c0 0d subcc %g3, %o5, %o5 20448b0: 98 60 80 0c subx %g2, %o4, %o4 20448b4: d8 3e 40 00 std %o4, [ %i1 ] 20448b8: 80 a1 00 1d cmp %g4, %i5 #endif /* * Determine cpu usage since period initiated. */ used = owning_thread->cpu_time_used; 20448bc: d8 1f 60 80 ldd [ %i5 + 0x80 ], %o4 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ if (owning_thread == _Thread_Executing) { 20448c0: 02 80 00 05 be 20448d4 <_Rate_monotonic_Get_status+0x4c> 20448c4: b2 10 20 01 mov 1, %i1 return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; } 20448c8: b0 0e 60 01 and %i1, 1, %i0 20448cc: 81 c7 e0 08 ret 20448d0: 81 e8 00 00 restore 20448d4: d4 18 60 20 ldd [ %g1 + 0x20 ], %o2 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20448d8: f0 1e 20 48 ldd [ %i0 + 0x48 ], %i0 20448dc: 86 a0 c0 0b subcc %g3, %o3, %g3 20448e0: 84 60 80 0a subx %g2, %o2, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 20448e4: 86 83 40 03 addcc %o5, %g3, %g3 20448e8: 84 43 00 02 addx %o4, %g2, %g2 /* * The cpu usage info was reset while executing. Can't * determine a status. */ if (_Timestamp_Less_than(&used, &the_period->cpu_usage_period_initiated)) 20448ec: 80 a6 00 02 cmp %i0, %g2 20448f0: 34 bf ff f6 bg,a 20448c8 <_Rate_monotonic_Get_status+0x40><== NEVER TAKEN 20448f4: b2 10 20 00 clr %i1 <== NOT EXECUTED 20448f8: 02 80 00 09 be 204491c <_Rate_monotonic_Get_status+0x94> 20448fc: 80 a6 40 03 cmp %i1, %g3 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 2044900: 86 a0 c0 19 subcc %g3, %i1, %g3 if (used < the_period->cpu_usage_period_initiated) return false; *cpu_since_last_period = used - the_period->cpu_usage_period_initiated; #endif return true; 2044904: b2 10 20 01 mov 1, %i1 2044908: 84 60 80 18 subx %g2, %i0, %g2 } 204490c: b0 0e 60 01 and %i1, 1, %i0 2044910: c4 3e 80 00 std %g2, [ %i2 ] 2044914: 81 c7 e0 08 ret 2044918: 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)) 204491c: 28 bf ff fa bleu,a 2044904 <_Rate_monotonic_Get_status+0x7c> 2044920: 86 a0 c0 19 subcc %g3, %i1, %g3 return false; 2044924: 10 bf ff e9 b 20448c8 <_Rate_monotonic_Get_status+0x40> 2044928: b2 10 20 00 clr %i1 =============================================================================== 02044cc8 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2044cc8: 9d e3 bf 98 save %sp, -104, %sp 2044ccc: 11 00 81 d8 sethi %hi(0x2076000), %o0 2044cd0: 92 10 00 18 mov %i0, %o1 2044cd4: 90 12 22 e0 or %o0, 0x2e0, %o0 2044cd8: 7f ff 2b a9 call 200fb7c <_Objects_Get> 2044cdc: 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 ) { 2044ce0: c2 07 bf fc ld [ %fp + -4 ], %g1 2044ce4: 80 a0 60 00 cmp %g1, 0 2044ce8: 12 80 00 17 bne 2044d44 <_Rate_monotonic_Timeout+0x7c> <== NEVER TAKEN 2044cec: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 2044cf0: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2044cf4: 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); 2044cf8: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2044cfc: 80 88 80 01 btst %g2, %g1 2044d00: 22 80 00 08 be,a 2044d20 <_Rate_monotonic_Timeout+0x58> 2044d04: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2044d08: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2044d0c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2044d10: 80 a0 80 01 cmp %g2, %g1 2044d14: 02 80 00 1a be 2044d7c <_Rate_monotonic_Timeout+0xb4> 2044d18: 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 ) { 2044d1c: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2044d20: 80 a0 60 01 cmp %g1, 1 2044d24: 02 80 00 0a be 2044d4c <_Rate_monotonic_Timeout+0x84> 2044d28: 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; 2044d2c: 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--; 2044d30: 03 00 81 d5 sethi %hi(0x2075400), %g1 2044d34: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2075730 <_Thread_Dispatch_disable_level> 2044d38: 84 00 bf ff add %g2, -1, %g2 2044d3c: c4 20 63 30 st %g2, [ %g1 + 0x330 ] return _Thread_Dispatch_disable_level; 2044d40: c2 00 63 30 ld [ %g1 + 0x330 ], %g1 2044d44: 81 c7 e0 08 ret 2044d48: 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; 2044d4c: 82 10 20 03 mov 3, %g1 _Rate_monotonic_Initiate_statistics( the_period ); 2044d50: 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; 2044d54: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2044d58: 7f ff ff 44 call 2044a68 <_Rate_monotonic_Initiate_statistics> 2044d5c: 01 00 00 00 nop Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2044d60: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2044d64: 11 00 81 d5 sethi %hi(0x2075400), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2044d68: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2044d6c: 90 12 23 f0 or %o0, 0x3f0, %o0 2044d70: 7f ff 32 f6 call 2011948 <_Watchdog_Insert> 2044d74: 92 07 60 10 add %i5, 0x10, %o1 2044d78: 30 bf ff ee b,a 2044d30 <_Rate_monotonic_Timeout+0x68> RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2044d7c: 7f ff 2e 7d call 2010770 <_Thread_Clear_state> 2044d80: 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 ); 2044d84: 10 bf ff f5 b 2044d58 <_Rate_monotonic_Timeout+0x90> 2044d88: 90 10 00 1d mov %i5, %o0 =============================================================================== 0204492c <_Rate_monotonic_Update_statistics>: } static void _Rate_monotonic_Update_statistics( Rate_monotonic_Control *the_period ) { 204492c: 9d e3 bf 90 save %sp, -112, %sp /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2044930: c4 06 20 58 ld [ %i0 + 0x58 ], %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 2044934: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 /* * Update the counts. */ stats = &the_period->Statistics; stats->count++; 2044938: 84 00 a0 01 inc %g2 if ( the_period->state == RATE_MONOTONIC_EXPIRED ) 204493c: 80 a0 60 04 cmp %g1, 4 2044940: 02 80 00 46 be 2044a58 <_Rate_monotonic_Update_statistics+0x12c> 2044944: c4 26 20 58 st %g2, [ %i0 + 0x58 ] stats->missed_count++; /* * Grab status for time statistics. */ valid_status = 2044948: 90 10 00 18 mov %i0, %o0 204494c: 92 07 bf f8 add %fp, -8, %o1 2044950: 7f ff ff ce call 2044888 <_Rate_monotonic_Get_status> 2044954: 94 07 bf f0 add %fp, -16, %o2 _Rate_monotonic_Get_status( the_period, &since_last_period, &executed ); if (!valid_status) 2044958: 80 8a 20 ff btst 0xff, %o0 204495c: 02 80 00 21 be 20449e0 <_Rate_monotonic_Update_statistics+0xb4> 2044960: c4 1f bf f0 ldd [ %fp + -16 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2044964: d8 1e 20 70 ldd [ %i0 + 0x70 ], %o4 * 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 ) ) 2044968: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 204496c: 9a 83 40 03 addcc %o5, %g3, %o5 2044970: 98 43 00 02 addx %o4, %g2, %o4 2044974: 80 a0 40 02 cmp %g1, %g2 2044978: 04 80 00 1c ble 20449e8 <_Rate_monotonic_Update_statistics+0xbc> 204497c: d8 3e 20 70 std %o4, [ %i0 + 0x70 ] stats->min_cpu_time = executed; 2044980: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] if ( _Timestamp_Greater_than( &executed, &stats->max_cpu_time ) ) 2044984: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 2044988: 80 a0 40 02 cmp %g1, %g2 204498c: 26 80 00 05 bl,a 20449a0 <_Rate_monotonic_Update_statistics+0x74><== NEVER TAKEN 2044990: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] <== NOT EXECUTED 2044994: 80 a0 40 02 cmp %g1, %g2 2044998: 22 80 00 2b be,a 2044a44 <_Rate_monotonic_Update_statistics+0x118><== ALWAYS TAKEN 204499c: 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 ); 20449a0: c4 1f bf f8 ldd [ %fp + -8 ], %g2 20449a4: d8 1e 20 88 ldd [ %i0 + 0x88 ], %o4 if ( _Timestamp_Less_than( &since_last_period, &stats->min_wall_time ) ) 20449a8: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 20449ac: 9a 83 40 03 addcc %o5, %g3, %o5 20449b0: 98 43 00 02 addx %o4, %g2, %o4 20449b4: 80 a0 40 02 cmp %g1, %g2 20449b8: 14 80 00 1e bg 2044a30 <_Rate_monotonic_Update_statistics+0x104> 20449bc: d8 3e 20 88 std %o4, [ %i0 + 0x88 ] 20449c0: 80 a0 40 02 cmp %g1, %g2 20449c4: 22 80 00 18 be,a 2044a24 <_Rate_monotonic_Update_statistics+0xf8><== ALWAYS TAKEN 20449c8: 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 ) ) 20449cc: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 <== NOT EXECUTED 20449d0: 80 a0 40 02 cmp %g1, %g2 20449d4: 16 80 00 0d bge 2044a08 <_Rate_monotonic_Update_statistics+0xdc><== ALWAYS TAKEN 20449d8: 01 00 00 00 nop stats->max_wall_time = since_last_period; 20449dc: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] <== NOT EXECUTED 20449e0: 81 c7 e0 08 ret 20449e4: 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 ) ) 20449e8: 32 bf ff e8 bne,a 2044988 <_Rate_monotonic_Update_statistics+0x5c><== NEVER TAKEN 20449ec: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 <== NOT EXECUTED 20449f0: c2 06 20 64 ld [ %i0 + 0x64 ], %g1 20449f4: 80 a0 40 03 cmp %g1, %g3 20449f8: 28 bf ff e4 bleu,a 2044988 <_Rate_monotonic_Update_statistics+0x5c> 20449fc: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 stats->min_cpu_time = executed; 2044a00: 10 bf ff e1 b 2044984 <_Rate_monotonic_Update_statistics+0x58> 2044a04: c4 3e 20 60 std %g2, [ %i0 + 0x60 ] _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 ) ) 2044a08: 12 bf ff f6 bne 20449e0 <_Rate_monotonic_Update_statistics+0xb4><== NEVER TAKEN 2044a0c: 01 00 00 00 nop 2044a10: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 2044a14: 80 a0 40 03 cmp %g1, %g3 2044a18: 2a bf ff f2 bcs,a 20449e0 <_Rate_monotonic_Update_statistics+0xb4> 2044a1c: c4 3e 20 80 std %g2, [ %i0 + 0x80 ] 2044a20: 30 bf ff f0 b,a 20449e0 <_Rate_monotonic_Update_statistics+0xb4> * 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 ) ) 2044a24: 80 a0 40 03 cmp %g1, %g3 2044a28: 28 bf ff ea bleu,a 20449d0 <_Rate_monotonic_Update_statistics+0xa4> 2044a2c: 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 ) ) 2044a30: c2 06 20 80 ld [ %i0 + 0x80 ], %g1 2044a34: 80 a0 40 02 cmp %g1, %g2 2044a38: 06 bf ff e9 bl 20449dc <_Rate_monotonic_Update_statistics+0xb0><== NEVER TAKEN 2044a3c: c4 3e 20 78 std %g2, [ %i0 + 0x78 ] 2044a40: 30 bf ff f2 b,a 2044a08 <_Rate_monotonic_Update_statistics+0xdc> _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 ) ) 2044a44: 80 a0 40 03 cmp %g1, %g3 2044a48: 3a bf ff d7 bcc,a 20449a4 <_Rate_monotonic_Update_statistics+0x78> 2044a4c: c4 1f bf f8 ldd [ %fp + -8 ], %g2 stats->max_cpu_time = executed; 2044a50: 10 bf ff d4 b 20449a0 <_Rate_monotonic_Update_statistics+0x74> 2044a54: c4 3e 20 68 std %g2, [ %i0 + 0x68 ] */ stats = &the_period->Statistics; stats->count++; if ( the_period->state == RATE_MONOTONIC_EXPIRED ) stats->missed_count++; 2044a58: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2044a5c: 82 00 60 01 inc %g1 2044a60: 10 bf ff ba b 2044948 <_Rate_monotonic_Update_statistics+0x1c> 2044a64: c2 26 20 5c st %g1, [ %i0 + 0x5c ] =============================================================================== 0200bb24 <_Scheduler_CBS_Budget_callout>: Scheduler_CBS_Server **_Scheduler_CBS_Server_list; void _Scheduler_CBS_Budget_callout( Thread_Control *the_thread ) { 200bb24: 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; 200bb28: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200bb2c: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200bb30: 80 a0 40 09 cmp %g1, %o1 200bb34: 32 80 00 02 bne,a 200bb3c <_Scheduler_CBS_Budget_callout+0x18><== ALWAYS TAKEN 200bb38: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200bb3c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200bb40: 80 a0 40 09 cmp %g1, %o1 200bb44: 02 80 00 04 be 200bb54 <_Scheduler_CBS_Budget_callout+0x30><== NEVER TAKEN 200bb48: 90 10 00 18 mov %i0, %o0 _Thread_Change_priority(the_thread, new_priority, true); 200bb4c: 40 00 01 9b call 200c1b8 <_Thread_Change_priority> 200bb50: 94 10 20 01 mov 1, %o2 /* Invoke callback function if any. */ sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; 200bb54: f0 06 20 88 ld [ %i0 + 0x88 ], %i0 if ( sched_info->cbs_server->cbs_budget_overrun ) { 200bb58: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200bb5c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 200bb60: 80 a0 a0 00 cmp %g2, 0 200bb64: 02 80 00 09 be 200bb88 <_Scheduler_CBS_Budget_callout+0x64><== NEVER TAKEN 200bb68: 01 00 00 00 nop _Scheduler_CBS_Get_server_id( 200bb6c: d0 00 40 00 ld [ %g1 ], %o0 200bb70: 7f ff ff d1 call 200bab4 <_Scheduler_CBS_Get_server_id> 200bb74: 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 ); 200bb78: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200bb7c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200bb80: 9f c0 40 00 call %g1 200bb84: d0 07 bf fc ld [ %fp + -4 ], %o0 200bb88: 81 c7 e0 08 ret 200bb8c: 81 e8 00 00 restore =============================================================================== 0200b68c <_Scheduler_CBS_Cleanup>: #include #include #include int _Scheduler_CBS_Cleanup (void) { 200b68c: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b690: 39 00 80 85 sethi %hi(0x2021400), %i4 200b694: c2 07 20 e8 ld [ %i4 + 0xe8 ], %g1 ! 20214e8 <_Scheduler_CBS_Maximum_servers> 200b698: 80 a0 60 00 cmp %g1, 0 200b69c: 02 80 00 18 be 200b6fc <_Scheduler_CBS_Cleanup+0x70> <== NEVER TAKEN 200b6a0: 03 00 80 89 sethi %hi(0x2022400), %g1 200b6a4: 37 00 80 89 sethi %hi(0x2022400), %i3 200b6a8: c4 06 e3 c8 ld [ %i3 + 0x3c8 ], %g2 ! 20227c8 <_Scheduler_CBS_Server_list> 200b6ac: ba 10 20 00 clr %i5 200b6b0: b8 17 20 e8 or %i4, 0xe8, %i4 if ( _Scheduler_CBS_Server_list[ i ] ) 200b6b4: 83 2f 60 02 sll %i5, 2, %g1 200b6b8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 200b6bc: 80 a0 60 00 cmp %g1, 0 200b6c0: 02 80 00 05 be 200b6d4 <_Scheduler_CBS_Cleanup+0x48> 200b6c4: 90 10 00 1d mov %i5, %o0 _Scheduler_CBS_Destroy_server( i ); 200b6c8: 40 00 00 45 call 200b7dc <_Scheduler_CBS_Destroy_server> 200b6cc: 01 00 00 00 nop 200b6d0: c4 06 e3 c8 ld [ %i3 + 0x3c8 ], %g2 int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b6d4: c2 07 00 00 ld [ %i4 ], %g1 200b6d8: ba 07 60 01 inc %i5 200b6dc: 80 a0 40 1d cmp %g1, %i5 200b6e0: 18 bf ff f6 bgu 200b6b8 <_Scheduler_CBS_Cleanup+0x2c> 200b6e4: 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; } 200b6e8: 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 ); 200b6ec: 40 00 08 60 call 200d86c <_Workspace_Free> 200b6f0: 90 10 00 02 mov %g2, %o0 return SCHEDULER_CBS_OK; } 200b6f4: 81 c7 e0 08 ret 200b6f8: 81 e8 00 00 restore int _Scheduler_CBS_Cleanup (void) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b6fc: 10 bf ff fb b 200b6e8 <_Scheduler_CBS_Cleanup+0x5c> <== NOT EXECUTED 200b700: c4 00 63 c8 ld [ %g1 + 0x3c8 ], %g2 <== NOT EXECUTED =============================================================================== 0200b704 <_Scheduler_CBS_Create_server>: int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b704: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b708: c2 06 20 04 ld [ %i0 + 4 ], %g1 int _Scheduler_CBS_Create_server ( Scheduler_CBS_Parameters *params, Scheduler_CBS_Budget_overrun budget_overrun_callback, rtems_id *server_id ) { 200b70c: ba 10 00 18 mov %i0, %i5 unsigned int i; Scheduler_CBS_Server *the_server; if ( params->budget <= 0 || 200b710: 80 a0 60 00 cmp %g1, 0 200b714: 04 80 00 30 ble 200b7d4 <_Scheduler_CBS_Create_server+0xd0> 200b718: b0 10 3f ee mov -18, %i0 200b71c: c2 07 40 00 ld [ %i5 ], %g1 200b720: 80 a0 60 00 cmp %g1, 0 200b724: 04 80 00 2c ble 200b7d4 <_Scheduler_CBS_Create_server+0xd0> 200b728: 03 00 80 85 sethi %hi(0x2021400), %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++ ) { 200b72c: c6 00 60 e8 ld [ %g1 + 0xe8 ], %g3 ! 20214e8 <_Scheduler_CBS_Maximum_servers> 200b730: 80 a0 e0 00 cmp %g3, 0 200b734: 02 80 00 28 be 200b7d4 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN 200b738: b0 10 3f e6 mov -26, %i0 if ( !_Scheduler_CBS_Server_list[i] ) 200b73c: 37 00 80 89 sethi %hi(0x2022400), %i3 200b740: f8 06 e3 c8 ld [ %i3 + 0x3c8 ], %i4 ! 20227c8 <_Scheduler_CBS_Server_list> 200b744: c2 07 00 00 ld [ %i4 ], %g1 200b748: 80 a0 60 00 cmp %g1, 0 200b74c: 02 80 00 0e be 200b784 <_Scheduler_CBS_Create_server+0x80> 200b750: 82 10 20 00 clr %g1 params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b754: 10 80 00 07 b 200b770 <_Scheduler_CBS_Create_server+0x6c> 200b758: 82 00 60 01 inc %g1 if ( !_Scheduler_CBS_Server_list[i] ) 200b75c: c4 07 00 18 ld [ %i4 + %i0 ], %g2 200b760: 80 a0 a0 00 cmp %g2, 0 200b764: 22 80 00 0a be,a 200b78c <_Scheduler_CBS_Create_server+0x88> 200b768: c2 26 80 00 st %g1, [ %i2 ] params->deadline <= 0 || params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200b76c: 82 00 60 01 inc %g1 200b770: 80 a0 40 03 cmp %g1, %g3 200b774: 12 bf ff fa bne 200b75c <_Scheduler_CBS_Create_server+0x58> 200b778: b1 28 60 02 sll %g1, 2, %i0 if ( !_Scheduler_CBS_Server_list[i] ) break; } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; 200b77c: 81 c7 e0 08 ret 200b780: 91 e8 3f e6 restore %g0, -26, %o0 params->budget >= SCHEDULER_EDF_PRIO_MSB || params->deadline >= SCHEDULER_EDF_PRIO_MSB ) return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( !_Scheduler_CBS_Server_list[i] ) 200b784: b0 10 20 00 clr %i0 } if ( i == _Scheduler_CBS_Maximum_servers ) return SCHEDULER_CBS_ERROR_FULL; *server_id = i; 200b788: c2 26 80 00 st %g1, [ %i2 ] _Scheduler_CBS_Server_list[*server_id] = (Scheduler_CBS_Server *) _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); 200b78c: 40 00 08 30 call 200d84c <_Workspace_Allocate> 200b790: 90 10 20 10 mov 0x10, %o0 the_server = _Scheduler_CBS_Server_list[*server_id]; 200b794: 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 *) 200b798: d0 27 00 18 st %o0, [ %i4 + %i0 ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; 200b79c: c4 06 e3 c8 ld [ %i3 + 0x3c8 ], %g2 200b7a0: 83 28 60 02 sll %g1, 2, %g1 200b7a4: c2 00 80 01 ld [ %g2 + %g1 ], %g1 if ( !the_server ) 200b7a8: 80 a0 60 00 cmp %g1, 0 200b7ac: 02 80 00 0a be 200b7d4 <_Scheduler_CBS_Create_server+0xd0><== NEVER TAKEN 200b7b0: b0 10 3f ef mov -17, %i0 return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b7b4: c4 07 40 00 ld [ %i5 ], %g2 the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; 200b7b8: b0 10 20 00 clr %i0 _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b7bc: c4 20 60 04 st %g2, [ %g1 + 4 ] 200b7c0: c4 07 60 04 ld [ %i5 + 4 ], %g2 the_server->task_id = -1; the_server->cbs_budget_overrun = budget_overrun_callback; 200b7c4: f2 20 60 0c st %i1, [ %g1 + 0xc ] _Workspace_Allocate( sizeof(Scheduler_CBS_Server) ); the_server = _Scheduler_CBS_Server_list[*server_id]; if ( !the_server ) return SCHEDULER_CBS_ERROR_NO_MEMORY; the_server->parameters = *params; 200b7c8: c4 20 60 08 st %g2, [ %g1 + 8 ] the_server->task_id = -1; 200b7cc: 84 10 3f ff mov -1, %g2 200b7d0: c4 20 40 00 st %g2, [ %g1 ] the_server->cbs_budget_overrun = budget_overrun_callback; return SCHEDULER_CBS_OK; } 200b7d4: 81 c7 e0 08 ret 200b7d8: 81 e8 00 00 restore =============================================================================== 0200b84c <_Scheduler_CBS_Detach_thread>: int _Scheduler_CBS_Detach_thread ( Scheduler_CBS_Server_id server_id, rtems_id task_id ) { 200b84c: 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); 200b850: 92 07 bf fc add %fp, -4, %o1 200b854: 40 00 03 a3 call 200c6e0 <_Thread_Get> 200b858: 90 10 00 19 mov %i1, %o0 /* The routine _Thread_Get may disable dispatch and not enable again. */ if ( the_thread ) { 200b85c: ba 92 20 00 orcc %o0, 0, %i5 200b860: 22 80 00 05 be,a 200b874 <_Scheduler_CBS_Detach_thread+0x28> 200b864: 03 00 80 85 sethi %hi(0x2021400), %g1 _Thread_Enable_dispatch(); 200b868: 40 00 03 91 call 200c6ac <_Thread_Enable_dispatch> 200b86c: 01 00 00 00 nop } if ( server_id >= _Scheduler_CBS_Maximum_servers ) 200b870: 03 00 80 85 sethi %hi(0x2021400), %g1 200b874: c4 00 60 e8 ld [ %g1 + 0xe8 ], %g2 ! 20214e8 <_Scheduler_CBS_Maximum_servers> 200b878: 80 a0 80 18 cmp %g2, %i0 200b87c: 08 80 00 1b bleu 200b8e8 <_Scheduler_CBS_Detach_thread+0x9c> 200b880: 82 10 3f ee mov -18, %g1 return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; if ( !the_thread ) 200b884: 80 a7 60 00 cmp %i5, 0 200b888: 02 80 00 18 be 200b8e8 <_Scheduler_CBS_Detach_thread+0x9c> 200b88c: 01 00 00 00 nop return SCHEDULER_CBS_ERROR_INVALID_PARAMETER; /* Server is not valid. */ if ( !_Scheduler_CBS_Server_list[server_id] ) 200b890: 03 00 80 89 sethi %hi(0x2022400), %g1 200b894: c2 00 63 c8 ld [ %g1 + 0x3c8 ], %g1 ! 20227c8 <_Scheduler_CBS_Server_list> 200b898: b1 2e 20 02 sll %i0, 2, %i0 200b89c: c4 00 40 18 ld [ %g1 + %i0 ], %g2 200b8a0: 80 a0 a0 00 cmp %g2, 0 200b8a4: 02 80 00 11 be 200b8e8 <_Scheduler_CBS_Detach_thread+0x9c> 200b8a8: 82 10 3f e7 mov -25, %g1 return SCHEDULER_CBS_ERROR_NOSERVER; /* Thread and server are not attached. */ if ( _Scheduler_CBS_Server_list[server_id]->task_id != task_id ) 200b8ac: c6 00 80 00 ld [ %g2 ], %g3 200b8b0: 80 a0 c0 19 cmp %g3, %i1 200b8b4: 12 80 00 0d bne 200b8e8 <_Scheduler_CBS_Detach_thread+0x9c><== NEVER TAKEN 200b8b8: 82 10 3f ee mov -18, %g1 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; 200b8bc: c8 07 60 88 ld [ %i5 + 0x88 ], %g4 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; 200b8c0: 82 10 3f ff mov -1, %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; 200b8c4: 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; 200b8c8: c2 20 80 00 st %g1, [ %g2 ] 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; the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b8cc: c2 0f 60 9c ldub [ %i5 + 0x9c ], %g1 _Scheduler_CBS_Server_list[server_id]->task_id = -1; 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; 200b8d0: c4 07 60 a4 ld [ %i5 + 0xa4 ], %g2 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; 200b8d4: c0 21 20 18 clr [ %g4 + 0x18 ] the_thread->budget_algorithm = the_thread->Start.budget_algorithm; the_thread->budget_callout = the_thread->Start.budget_callout; the_thread->is_preemptible = the_thread->Start.is_preemptible; 200b8d8: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] _Scheduler_CBS_Server_list[server_id]->task_id = -1; sched_info = (Scheduler_CBS_Per_thread *) the_thread->scheduler_info; sched_info->cbs_server = NULL; the_thread->budget_algorithm = the_thread->Start.budget_algorithm; 200b8dc: c6 27 60 78 st %g3, [ %i5 + 0x78 ] the_thread->budget_callout = the_thread->Start.budget_callout; 200b8e0: c4 27 60 7c st %g2, [ %i5 + 0x7c ] the_thread->is_preemptible = the_thread->Start.is_preemptible; return SCHEDULER_CBS_OK; 200b8e4: 82 10 20 00 clr %g1 } 200b8e8: 81 c7 e0 08 ret 200b8ec: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200bab4 <_Scheduler_CBS_Get_server_id>: int _Scheduler_CBS_Get_server_id ( rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { 200bab4: 9d e3 bf a0 save %sp, -96, %sp unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200bab8: 03 00 80 85 sethi %hi(0x2021400), %g1 200babc: c2 00 60 e8 ld [ %g1 + 0xe8 ], %g1 ! 20214e8 <_Scheduler_CBS_Maximum_servers> int _Scheduler_CBS_Get_server_id ( rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { 200bac0: 84 10 00 18 mov %i0, %g2 unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200bac4: 80 a0 60 00 cmp %g1, 0 200bac8: 02 80 00 13 be 200bb14 <_Scheduler_CBS_Get_server_id+0x60><== NEVER TAKEN 200bacc: b0 10 3f e7 mov -25, %i0 200bad0: 07 00 80 89 sethi %hi(0x2022400), %g3 200bad4: de 00 e3 c8 ld [ %g3 + 0x3c8 ], %o7 ! 20227c8 <_Scheduler_CBS_Server_list> 200bad8: 86 10 20 00 clr %g3 #include #include #include #include int _Scheduler_CBS_Get_server_id ( 200badc: 89 28 e0 02 sll %g3, 2, %g4 Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && 200bae0: c8 03 c0 04 ld [ %o7 + %g4 ], %g4 200bae4: 80 a1 20 00 cmp %g4, 0 200bae8: 22 80 00 07 be,a 200bb04 <_Scheduler_CBS_Get_server_id+0x50> 200baec: 86 00 e0 01 inc %g3 200baf0: c8 01 00 00 ld [ %g4 ], %g4 200baf4: 80 a1 00 02 cmp %g4, %g2 200baf8: 22 80 00 09 be,a 200bb1c <_Scheduler_CBS_Get_server_id+0x68> 200bafc: c6 26 40 00 st %g3, [ %i1 ] rtems_id task_id, Scheduler_CBS_Server_id *server_id ) { unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { 200bb00: 86 00 e0 01 inc %g3 200bb04: 80 a0 c0 01 cmp %g3, %g1 200bb08: 12 bf ff f6 bne 200bae0 <_Scheduler_CBS_Get_server_id+0x2c> 200bb0c: 89 28 e0 02 sll %g3, 2, %g4 _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; } } return SCHEDULER_CBS_ERROR_NOSERVER; 200bb10: b0 10 3f e7 mov -25, %i0 } 200bb14: 81 c7 e0 08 ret 200bb18: 81 e8 00 00 restore unsigned int i; for ( i = 0; i<_Scheduler_CBS_Maximum_servers; i++ ) { if ( _Scheduler_CBS_Server_list[i] && _Scheduler_CBS_Server_list[i]->task_id == task_id ) { *server_id = i; return SCHEDULER_CBS_OK; 200bb1c: 81 c7 e0 08 ret 200bb20: 91 e8 20 00 restore %g0, 0, %o0 =============================================================================== 0200bb90 <_Scheduler_CBS_Initialize>: } } int _Scheduler_CBS_Initialize(void) { 200bb90: 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*) ); 200bb94: 3b 00 80 85 sethi %hi(0x2021400), %i5 200bb98: d0 07 60 e8 ld [ %i5 + 0xe8 ], %o0 ! 20214e8 <_Scheduler_CBS_Maximum_servers> if ( !_Scheduler_CBS_Server_list ) return SCHEDULER_CBS_ERROR_NO_MEMORY; 200bb9c: b0 10 3f ef mov -17, %i0 } int _Scheduler_CBS_Initialize(void) { unsigned int i; _Scheduler_CBS_Server_list = (Scheduler_CBS_Server **) _Workspace_Allocate( 200bba0: 40 00 07 2b call 200d84c <_Workspace_Allocate> 200bba4: 91 2a 20 02 sll %o0, 2, %o0 200bba8: 09 00 80 89 sethi %hi(0x2022400), %g4 _Scheduler_CBS_Maximum_servers * sizeof(Scheduler_CBS_Server*) ); if ( !_Scheduler_CBS_Server_list ) 200bbac: 80 a2 20 00 cmp %o0, 0 200bbb0: 02 80 00 0f be 200bbec <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200bbb4: d0 21 23 c8 st %o0, [ %g4 + 0x3c8 ] return SCHEDULER_CBS_ERROR_NO_MEMORY; for (i = 0; i<_Scheduler_CBS_Maximum_servers; i++) { 200bbb8: c6 07 60 e8 ld [ %i5 + 0xe8 ], %g3 200bbbc: 80 a0 e0 00 cmp %g3, 0 200bbc0: 02 80 00 0b be 200bbec <_Scheduler_CBS_Initialize+0x5c> <== NEVER TAKEN 200bbc4: b0 10 20 00 clr %i0 200bbc8: 10 80 00 03 b 200bbd4 <_Scheduler_CBS_Initialize+0x44> 200bbcc: 82 10 20 00 clr %g1 200bbd0: d0 01 23 c8 ld [ %g4 + 0x3c8 ], %o0 _Scheduler_CBS_Server_list[i] = NULL; 200bbd4: 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++) { 200bbd8: 82 00 60 01 inc %g1 200bbdc: 80 a0 40 03 cmp %g1, %g3 200bbe0: 12 bf ff fc bne 200bbd0 <_Scheduler_CBS_Initialize+0x40> 200bbe4: c0 22 00 02 clr [ %o0 + %g2 ] _Scheduler_CBS_Server_list[i] = NULL; } return SCHEDULER_CBS_OK; 200bbe8: b0 10 20 00 clr %i0 } 200bbec: 81 c7 e0 08 ret 200bbf0: 81 e8 00 00 restore =============================================================================== 0200a6e8 <_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; 200a6e8: c2 02 20 88 ld [ %o0 + 0x88 ], %g1 if (deadline) { 200a6ec: 80 a2 60 00 cmp %o1, 0 200a6f0: 02 80 00 11 be 200a734 <_Scheduler_CBS_Release_job+0x4c> 200a6f4: c2 00 60 18 ld [ %g1 + 0x18 ], %g1 /* Initializing or shifting deadline. */ if (serv_info) 200a6f8: 80 a0 60 00 cmp %g1, 0 200a6fc: 02 80 00 13 be 200a748 <_Scheduler_CBS_Release_job+0x60> 200a700: 07 00 80 81 sethi %hi(0x2020400), %g3 new_priority = (_Watchdog_Ticks_since_boot + serv_info->parameters.deadline) 200a704: c4 00 60 04 ld [ %g1 + 4 ], %g2 200a708: d2 00 e3 50 ld [ %g3 + 0x350 ], %o1 200a70c: 92 02 40 02 add %o1, %g2, %o1 200a710: 05 20 00 00 sethi %hi(0x80000000), %g2 200a714: 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; 200a718: c2 00 60 08 ld [ %g1 + 8 ], %g1 200a71c: c2 22 20 74 st %g1, [ %o0 + 0x74 ] the_thread->real_priority = new_priority; 200a720: d2 22 20 18 st %o1, [ %o0 + 0x18 ] _Thread_Change_priority(the_thread, new_priority, true); 200a724: 94 10 20 01 mov 1, %o2 200a728: 82 13 c0 00 mov %o7, %g1 200a72c: 40 00 01 47 call 200ac48 <_Thread_Change_priority> 200a730: 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) 200a734: 80 a0 60 00 cmp %g1, 0 200a738: 12 bf ff f8 bne 200a718 <_Scheduler_CBS_Release_job+0x30> <== ALWAYS TAKEN 200a73c: d2 02 20 ac ld [ %o0 + 0xac ], %o1 the_thread->cpu_time_budget = serv_info->parameters.budget; the_thread->real_priority = new_priority; 200a740: 10 bf ff f9 b 200a724 <_Scheduler_CBS_Release_job+0x3c> <== NOT EXECUTED 200a744: 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) 200a748: 03 00 80 81 sethi %hi(0x2020400), %g1 200a74c: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 ! 2020750 <_Watchdog_Ticks_since_boot> 200a750: 92 02 40 01 add %o1, %g1, %o1 200a754: 03 20 00 00 sethi %hi(0x80000000), %g1 200a758: 10 bf ff f2 b 200a720 <_Scheduler_CBS_Release_job+0x38> 200a75c: 92 2a 40 01 andn %o1, %g1, %o1 =============================================================================== 0200a760 <_Scheduler_CBS_Unblock>: #include void _Scheduler_CBS_Unblock( Thread_Control *the_thread ) { 200a760: 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); 200a764: 40 00 00 5b call 200a8d0 <_Scheduler_EDF_Enqueue> 200a768: 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; 200a76c: c2 06 20 88 ld [ %i0 + 0x88 ], %g1 200a770: 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) { 200a774: 80 a7 60 00 cmp %i5, 0 200a778: 02 80 00 19 be 200a7dc <_Scheduler_CBS_Unblock+0x7c> 200a77c: 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 ) { 200a780: 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 - 200a784: d0 00 63 50 ld [ %g1 + 0x350 ], %o0 200a788: f8 06 20 18 ld [ %i0 + 0x18 ], %i4 _Watchdog_Ticks_since_boot; if ( deadline*budget_left > budget*deadline_left ) { 200a78c: 40 00 41 bf call 201ae88 <.umul> 200a790: 90 27 00 08 sub %i4, %o0, %o0 200a794: d2 06 20 74 ld [ %i0 + 0x74 ], %o1 200a798: b6 10 00 08 mov %o0, %i3 200a79c: 40 00 41 bb call 201ae88 <.umul> 200a7a0: d0 07 60 08 ld [ %i5 + 8 ], %o0 200a7a4: 80 a6 c0 08 cmp %i3, %o0 200a7a8: 24 80 00 0e ble,a 200a7e0 <_Scheduler_CBS_Unblock+0x80> 200a7ac: 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; 200a7b0: d2 06 20 ac ld [ %i0 + 0xac ], %o1 if ( the_thread->real_priority != new_priority ) 200a7b4: 80 a7 00 09 cmp %i4, %o1 200a7b8: 32 80 00 02 bne,a 200a7c0 <_Scheduler_CBS_Unblock+0x60> 200a7bc: d2 26 20 18 st %o1, [ %i0 + 0x18 ] the_thread->real_priority = new_priority; if ( the_thread->current_priority != new_priority ) 200a7c0: d0 06 20 14 ld [ %i0 + 0x14 ], %o0 200a7c4: 80 a2 00 09 cmp %o0, %o1 200a7c8: 02 80 00 07 be 200a7e4 <_Scheduler_CBS_Unblock+0x84> 200a7cc: 3b 00 80 82 sethi %hi(0x2020800), %i5 _Thread_Change_priority(the_thread, new_priority, true); 200a7d0: 90 10 00 18 mov %i0, %o0 200a7d4: 40 00 01 1d call 200ac48 <_Thread_Change_priority> 200a7d8: 94 10 20 01 mov 1, %o2 200a7dc: 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, 200a7e0: 3b 00 80 82 sethi %hi(0x2020800), %i5 200a7e4: ba 17 63 80 or %i5, 0x380, %i5 ! 2020b80 <_Per_CPU_Information> 200a7e8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a7ec: d2 00 60 14 ld [ %g1 + 0x14 ], %o1 200a7f0: 03 00 80 7e sethi %hi(0x201f800), %g1 200a7f4: c2 00 60 fc ld [ %g1 + 0xfc ], %g1 ! 201f8fc <_Scheduler+0x30> 200a7f8: 9f c0 40 00 call %g1 200a7fc: 01 00 00 00 nop 200a800: 80 a2 20 00 cmp %o0, 0 200a804: 04 80 00 0a ble 200a82c <_Scheduler_CBS_Unblock+0xcc> 200a808: 01 00 00 00 nop _Thread_Heir->current_priority)) { _Thread_Heir = the_thread; if ( _Thread_Executing->is_preemptible || 200a80c: 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; 200a810: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a814: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a818: 80 a0 60 00 cmp %g1, 0 200a81c: 22 80 00 06 be,a 200a834 <_Scheduler_CBS_Unblock+0xd4> 200a820: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a824: 82 10 20 01 mov 1, %g1 200a828: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200a82c: 81 c7 e0 08 ret 200a830: 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 || 200a834: 80 a0 60 00 cmp %g1, 0 200a838: 12 bf ff fd bne 200a82c <_Scheduler_CBS_Unblock+0xcc> <== ALWAYS TAKEN 200a83c: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a840: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200a844: 30 bf ff fa b,a 200a82c <_Scheduler_CBS_Unblock+0xcc> <== NOT EXECUTED =============================================================================== 0200a848 <_Scheduler_EDF_Allocate>: #include void *_Scheduler_EDF_Allocate( Thread_Control *the_thread ) { 200a848: 9d e3 bf a0 save %sp, -96, %sp void *sched; Scheduler_EDF_Per_thread *schinfo; sched = _Workspace_Allocate( sizeof(Scheduler_EDF_Per_thread) ); 200a84c: 40 00 06 d3 call 200c398 <_Workspace_Allocate> 200a850: 90 10 20 18 mov 0x18, %o0 if ( sched ) { 200a854: 80 a2 20 00 cmp %o0, 0 200a858: 02 80 00 05 be 200a86c <_Scheduler_EDF_Allocate+0x24> <== NEVER TAKEN 200a85c: 82 10 20 02 mov 2, %g1 the_thread->scheduler_info = sched; 200a860: d0 26 20 88 st %o0, [ %i0 + 0x88 ] schinfo = (Scheduler_EDF_Per_thread *)(the_thread->scheduler_info); schinfo->thread = the_thread; 200a864: f0 22 00 00 st %i0, [ %o0 ] schinfo->queue_state = SCHEDULER_EDF_QUEUE_STATE_NEVER_HAS_BEEN; 200a868: c2 22 20 14 st %g1, [ %o0 + 0x14 ] } return sched; } 200a86c: 81 c7 e0 08 ret 200a870: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200a8d8 <_Scheduler_EDF_Unblock>: #include void _Scheduler_EDF_Unblock( Thread_Control *the_thread ) { 200a8d8: 9d e3 bf a0 save %sp, -96, %sp _Scheduler_EDF_Enqueue(the_thread); 200a8dc: 7f ff ff a5 call 200a770 <_Scheduler_EDF_Enqueue> 200a8e0: 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( 200a8e4: 3b 00 80 82 sethi %hi(0x2020800), %i5 200a8e8: ba 17 62 e0 or %i5, 0x2e0, %i5 ! 2020ae0 <_Per_CPU_Information> 200a8ec: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 200a8f0: d0 00 60 14 ld [ %g1 + 0x14 ], %o0 200a8f4: 03 00 80 7e sethi %hi(0x201f800), %g1 200a8f8: c2 00 60 5c ld [ %g1 + 0x5c ], %g1 ! 201f85c <_Scheduler+0x30> 200a8fc: 9f c0 40 00 call %g1 200a900: d2 06 20 14 ld [ %i0 + 0x14 ], %o1 200a904: 80 a2 20 00 cmp %o0, 0 200a908: 26 80 00 04 bl,a 200a918 <_Scheduler_EDF_Unblock+0x40> 200a90c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200a910: 81 c7 e0 08 ret 200a914: 81 e8 00 00 restore _Thread_Heir->current_priority, the_thread->current_priority )) { _Thread_Heir = the_thread; 200a918: f0 27 60 10 st %i0, [ %i5 + 0x10 ] if ( _Thread_Executing->is_preemptible || 200a91c: c2 08 60 70 ldub [ %g1 + 0x70 ], %g1 200a920: 80 a0 60 00 cmp %g1, 0 200a924: 22 80 00 06 be,a 200a93c <_Scheduler_EDF_Unblock+0x64> 200a928: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a92c: 82 10 20 01 mov 1, %g1 200a930: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] 200a934: 81 c7 e0 08 ret 200a938: 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 || 200a93c: 80 a0 60 00 cmp %g1, 0 200a940: 12 bf ff f4 bne 200a910 <_Scheduler_EDF_Unblock+0x38> <== ALWAYS TAKEN 200a944: 82 10 20 01 mov 1, %g1 the_thread->current_priority == 0 ) _Thread_Dispatch_necessary = true; 200a948: c2 2f 60 18 stb %g1, [ %i5 + 0x18 ] <== NOT EXECUTED 200a94c: 30 bf ff fa b,a 200a934 <_Scheduler_EDF_Unblock+0x5c> <== NOT EXECUTED =============================================================================== 0200a078 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 200a078: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *executing; executing = _Thread_Executing; 200a07c: 03 00 80 7b sethi %hi(0x201ec00), %g1 200a080: d0 00 63 7c ld [ %g1 + 0x37c ], %o0 ! 201ef7c <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 200a084: c2 0a 20 70 ldub [ %o0 + 0x70 ], %g1 200a088: 80 a0 60 00 cmp %g1, 0 200a08c: 02 80 00 26 be 200a124 <_Scheduler_priority_Tick+0xac> 200a090: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 200a094: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 200a098: 80 a0 60 00 cmp %g1, 0 200a09c: 12 80 00 22 bne 200a124 <_Scheduler_priority_Tick+0xac> 200a0a0: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 200a0a4: c2 02 20 78 ld [ %o0 + 0x78 ], %g1 200a0a8: 80 a0 60 01 cmp %g1, 1 200a0ac: 0a 80 00 07 bcs 200a0c8 <_Scheduler_priority_Tick+0x50> 200a0b0: 80 a0 60 02 cmp %g1, 2 200a0b4: 28 80 00 10 bleu,a 200a0f4 <_Scheduler_priority_Tick+0x7c> 200a0b8: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 200a0bc: 80 a0 60 03 cmp %g1, 3 200a0c0: 22 80 00 04 be,a 200a0d0 <_Scheduler_priority_Tick+0x58> <== ALWAYS TAKEN 200a0c4: c2 02 20 74 ld [ %o0 + 0x74 ], %g1 200a0c8: 81 c7 e0 08 ret 200a0cc: 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 ) 200a0d0: 82 00 7f ff add %g1, -1, %g1 200a0d4: 80 a0 60 00 cmp %g1, 0 200a0d8: 12 bf ff fc bne 200a0c8 <_Scheduler_priority_Tick+0x50> 200a0dc: c2 22 20 74 st %g1, [ %o0 + 0x74 ] (*executing->budget_callout)( executing ); 200a0e0: c2 02 20 7c ld [ %o0 + 0x7c ], %g1 200a0e4: 9f c0 40 00 call %g1 200a0e8: 01 00 00 00 nop 200a0ec: 81 c7 e0 08 ret 200a0f0: 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 ) { 200a0f4: 82 00 7f ff add %g1, -1, %g1 200a0f8: 80 a0 60 00 cmp %g1, 0 200a0fc: 14 bf ff f3 bg 200a0c8 <_Scheduler_priority_Tick+0x50> 200a100: 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(); 200a104: 03 00 80 77 sethi %hi(0x201dc00), %g1 200a108: c2 00 61 48 ld [ %g1 + 0x148 ], %g1 ! 201dd48 <_Scheduler+0xc> 200a10c: 9f c0 40 00 call %g1 200a110: 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; 200a114: 03 00 80 7a sethi %hi(0x201e800), %g1 200a118: d0 07 bf fc ld [ %fp + -4 ], %o0 200a11c: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 200a120: c2 22 20 74 st %g1, [ %o0 + 0x74 ] 200a124: 81 c7 e0 08 ret 200a128: 81 e8 00 00 restore =============================================================================== 0200a8e4 <_Scheduler_simple_Ready_queue_enqueue_first>: { Chain_Control *ready; Chain_Node *the_node; Thread_Control *current; ready = (Chain_Control *)_Scheduler.information; 200a8e4: 03 00 80 7b sethi %hi(0x201ec00), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 200a8e8: c2 00 61 1c ld [ %g1 + 0x11c ], %g1 ! 201ed1c <_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 ) { 200a8ec: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 200a8f0: c2 00 40 00 ld [ %g1 ], %g1 200a8f4: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a8f8: 80 a0 80 03 cmp %g2, %g3 200a8fc: 3a 80 00 08 bcc,a 200a91c <_Scheduler_simple_Ready_queue_enqueue_first+0x38> 200a900: 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 ) { 200a904: 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 ) { 200a908: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200a90c: 80 a0 80 03 cmp %g2, %g3 200a910: 2a bf ff fe bcs,a 200a908 <_Scheduler_simple_Ready_queue_enqueue_first+0x24><== NEVER TAKEN 200a914: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED current = (Thread_Control *)current->Object.Node.previous; 200a918: c2 00 60 04 ld [ %g1 + 4 ], %g1 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200a91c: c4 00 40 00 ld [ %g1 ], %g2 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200a920: c2 22 20 04 st %g1, [ %o0 + 4 ] before_node = after_node->next; after_node->next = the_node; 200a924: d0 20 40 00 st %o0, [ %g1 ] the_node->next = before_node; 200a928: c4 22 00 00 st %g2, [ %o0 ] } } /* enqueue */ _Chain_Insert_unprotected( (Chain_Node *)current, &the_thread->Object.Node ); } 200a92c: 81 c3 e0 08 retl 200a930: d0 20 a0 04 st %o0, [ %g2 + 4 ] =============================================================================== 02008d34 <_TOD_Tickle_ticks>: * * Output parameters: NONE */ void _TOD_Tickle_ticks( void ) { 2008d34: 9d e3 bf a0 save %sp, -96, %sp static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008d38: 09 00 80 7a sethi %hi(0x201e800), %g4 Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2008d3c: 05 00 80 77 sethi %hi(0x201dc00), %g2 2008d40: d8 19 22 b0 ldd [ %g4 + 0x2b0 ], %o4 2008d44: c6 00 a0 5c ld [ %g2 + 0x5c ], %g3 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008d48: 03 00 80 7a sethi %hi(0x201e800), %g1 2008d4c: f8 18 62 c0 ldd [ %g1 + 0x2c0 ], %i4 ! 201eac0 <_TOD_Now> 2008d50: 9f 28 e0 07 sll %g3, 7, %o7 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008d54: 37 00 80 7a sethi %hi(0x201e800), %i3 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2008d58: 85 28 e0 02 sll %g3, 2, %g2 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008d5c: f4 06 e3 40 ld [ %i3 + 0x340 ], %i2 { Timestamp_Control tick; uint32_t seconds; /* Convert the tick quantum to a timestamp */ _Timestamp_Set( &tick, 0, rtems_configuration_get_nanoseconds_per_tick() ); 2008d60: 84 23 c0 02 sub %o7, %g2, %g2 2008d64: 84 00 80 03 add %g2, %g3, %g2 2008d68: 85 28 a0 03 sll %g2, 3, %g2 2008d6c: 86 10 00 02 mov %g2, %g3 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008d70: 9a 80 c0 0d addcc %g3, %o5, %o5 2008d74: 84 10 20 00 clr %g2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008d78: 92 10 00 1d mov %i5, %o1 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008d7c: 98 40 80 0c addx %g2, %o4, %o4 Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; *_time += *_add; 2008d80: ba 80 c0 1d addcc %g3, %i5, %i5 /* Update the counter of ticks since boot */ _Watchdog_Ticks_since_boot += 1; 2008d84: b4 06 a0 01 inc %i2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008d88: 94 10 20 00 clr %o2 2008d8c: f4 26 e3 40 st %i2, [ %i3 + 0x340 ] 2008d90: 90 10 00 1c mov %i4, %o0 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 2008d94: d8 39 22 b0 std %o4, [ %g4 + 0x2b0 ] Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; *_time += *_add; 2008d98: b8 40 80 1c addx %g2, %i4, %i4 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008d9c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 *_time += *_add; 2008da0: f8 38 62 c0 std %i4, [ %g1 + 0x2c0 ] static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008da4: 40 00 43 61 call 2019b28 <__divdi3> 2008da8: 96 12 e2 00 or %o3, 0x200, %o3 *_time += *_add; if ( ((*_time) / 1000000000L) != _start ) { 2008dac: 94 10 20 00 clr %o2 static inline uint32_t _Timestamp64_Add_to_at_tick( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { Timestamp64_Control _start = *_time / 1000000000L; 2008db0: b6 10 00 08 mov %o0, %i3 2008db4: b4 10 00 09 mov %o1, %i2 *_time += *_add; if ( ((*_time) / 1000000000L) != _start ) { 2008db8: 90 10 00 1c mov %i4, %o0 2008dbc: 92 10 00 1d mov %i5, %o1 2008dc0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2008dc4: 40 00 43 59 call 2019b28 <__divdi3> 2008dc8: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _Timestamp_Add_to( &_TOD_Uptime, &tick ); /* we do not care how much the uptime changed */ /* Update the timespec format TOD */ seconds = _Timestamp_Add_to_at_tick( &_TOD_Now, &tick ); while ( seconds ) { 2008dcc: 80 a6 c0 08 cmp %i3, %o0 2008dd0: 02 80 00 05 be 2008de4 <_TOD_Tickle_ticks+0xb0> <== ALWAYS TAKEN 2008dd4: 80 a6 80 09 cmp %i2, %o1 */ RTEMS_INLINE_ROUTINE void _Watchdog_Tickle_seconds( void ) { _Watchdog_Tickle( &_Watchdog_Seconds_chain ); 2008dd8: 31 00 80 7a sethi %hi(0x201e800), %i0 <== NOT EXECUTED 2008ddc: 40 00 0a b6 call 200b8b4 <_Watchdog_Tickle> 2008de0: 91 ee 22 e4 restore %i0, 0x2e4, %o0 2008de4: 12 bf ff fe bne 2008ddc <_TOD_Tickle_ticks+0xa8> 2008de8: 31 00 80 7a sethi %hi(0x201e800), %i0 2008dec: 81 c7 e0 08 ret 2008df0: 81 e8 00 00 restore =============================================================================== 020089e4 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 20089e4: 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(); 20089e8: 03 00 80 80 sethi %hi(0x2020000), %g1 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) return false; 20089ec: ba 10 20 00 clr %i5 uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20089f0: 80 a6 20 00 cmp %i0, 0 20089f4: 02 80 00 2c be 2008aa4 <_TOD_Validate+0xc0> <== NEVER TAKEN 20089f8: d2 00 63 0c ld [ %g1 + 0x30c ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 20089fc: 11 00 03 d0 sethi %hi(0xf4000), %o0 2008a00: 40 00 4a f3 call 201b5cc <.udiv> 2008a04: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2008a08: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 2008a0c: 80 a2 00 01 cmp %o0, %g1 2008a10: 28 80 00 26 bleu,a 2008aa8 <_TOD_Validate+0xc4> 2008a14: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2008a18: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008a1c: 80 a0 60 3b cmp %g1, 0x3b 2008a20: 38 80 00 22 bgu,a 2008aa8 <_TOD_Validate+0xc4> 2008a24: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2008a28: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2008a2c: 80 a0 60 3b cmp %g1, 0x3b 2008a30: 38 80 00 1e bgu,a 2008aa8 <_TOD_Validate+0xc4> 2008a34: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2008a38: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008a3c: 80 a0 60 17 cmp %g1, 0x17 2008a40: 38 80 00 1a bgu,a 2008aa8 <_TOD_Validate+0xc4> 2008a44: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2008a48: c2 06 20 04 ld [ %i0 + 4 ], %g1 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || 2008a4c: 80 a0 60 00 cmp %g1, 0 2008a50: 02 80 00 15 be 2008aa4 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008a54: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2008a58: 38 80 00 14 bgu,a 2008aa8 <_TOD_Validate+0xc4> 2008a5c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008a60: c4 06 00 00 ld [ %i0 ], %g2 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 2008a64: 80 a0 a7 c3 cmp %g2, 0x7c3 2008a68: 28 80 00 10 bleu,a 2008aa8 <_TOD_Validate+0xc4> 2008a6c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2008a70: c6 06 20 08 ld [ %i0 + 8 ], %g3 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2008a74: 80 a0 e0 00 cmp %g3, 0 2008a78: 02 80 00 0b be 2008aa4 <_TOD_Validate+0xc0> <== NEVER TAKEN 2008a7c: 80 88 a0 03 btst 3, %g2 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 2008a80: 32 80 00 0c bne,a 2008ab0 <_TOD_Validate+0xcc> 2008a84: 83 28 60 02 sll %g1, 2, %g1 days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2008a88: 82 00 60 0d add %g1, 0xd, %g1 2008a8c: 05 00 80 7b sethi %hi(0x201ec00), %g2 2008a90: 83 28 60 02 sll %g1, 2, %g1 2008a94: 84 10 a1 48 or %g2, 0x148, %g2 2008a98: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2008a9c: 80 a0 40 03 cmp %g1, %g3 2008aa0: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 2008aa4: b0 0f 60 01 and %i5, 1, %i0 2008aa8: 81 c7 e0 08 ret 2008aac: 81 e8 00 00 restore return false; if ( (the_tod->year % 4) == 0 ) days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2008ab0: 05 00 80 7b sethi %hi(0x201ec00), %g2 2008ab4: 84 10 a1 48 or %g2, 0x148, %g2 ! 201ed48 <_TOD_Days_per_month> 2008ab8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2008abc: 80 a0 40 03 cmp %g1, %g3 2008ac0: 10 bf ff f9 b 2008aa4 <_TOD_Validate+0xc0> 2008ac4: ba 60 3f ff subx %g0, -1, %i5 =============================================================================== 0200a350 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 200a350: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 200a354: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 /* * Set a transient state for the thread so it is pulled off the Ready chains. * This will prevent it from being scheduled no matter what happens in an * ISR. */ _Thread_Set_transient( the_thread ); 200a358: 40 00 03 ad call 200b20c <_Thread_Set_transient> 200a35c: 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 ) 200a360: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200a364: 80 a0 40 19 cmp %g1, %i1 200a368: 02 80 00 05 be 200a37c <_Thread_Change_priority+0x2c> 200a36c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200a370: 90 10 00 18 mov %i0, %o0 200a374: 40 00 03 8c call 200b1a4 <_Thread_Set_priority> 200a378: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200a37c: 7f ff e0 cf call 20026b8 200a380: 01 00 00 00 nop 200a384: 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; 200a388: f6 07 60 10 ld [ %i5 + 0x10 ], %i3 if ( state != STATES_TRANSIENT ) { 200a38c: 80 a6 e0 04 cmp %i3, 4 200a390: 02 80 00 18 be 200a3f0 <_Thread_Change_priority+0xa0> 200a394: 80 8f 20 04 btst 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 200a398: 02 80 00 0b be 200a3c4 <_Thread_Change_priority+0x74> <== ALWAYS TAKEN 200a39c: 82 0e ff fb and %i3, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); _ISR_Enable( level ); 200a3a0: 7f ff e0 ca call 20026c8 <== NOT EXECUTED 200a3a4: 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); 200a3a8: 03 00 00 ef sethi %hi(0x3bc00), %g1 <== NOT EXECUTED 200a3ac: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 <== NOT EXECUTED if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a3b0: 80 8e c0 01 btst %i3, %g1 <== NOT EXECUTED 200a3b4: 32 80 00 0d bne,a 200a3e8 <_Thread_Change_priority+0x98> <== NOT EXECUTED 200a3b8: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 <== NOT EXECUTED 200a3bc: 81 c7 e0 08 ret 200a3c0: 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 ); 200a3c4: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 200a3c8: 7f ff e0 c0 call 20026c8 200a3cc: 90 10 00 19 mov %i1, %o0 200a3d0: 03 00 00 ef sethi %hi(0x3bc00), %g1 200a3d4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200a3d8: 80 8e c0 01 btst %i3, %g1 200a3dc: 02 bf ff f8 be 200a3bc <_Thread_Change_priority+0x6c> 200a3e0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 200a3e4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 200a3e8: 40 00 03 3e call 200b0e0 <_Thread_queue_Requeue> 200a3ec: 93 e8 00 1d restore %g0, %i5, %o1 200a3f0: 39 00 80 77 sethi %hi(0x201dc00), %i4 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 200a3f4: 12 80 00 08 bne 200a414 <_Thread_Change_priority+0xc4> <== NEVER TAKEN 200a3f8: b8 17 21 3c or %i4, 0x13c, %i4 ! 201dd3c <_Scheduler> * the TRANSIENT state. So we have to place it on the appropriate * Ready Queue with interrupts off. */ the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); if ( prepend_it ) 200a3fc: 80 a6 a0 00 cmp %i2, 0 200a400: 02 80 00 1b be 200a46c <_Thread_Change_priority+0x11c> 200a404: c0 27 60 10 clr [ %i5 + 0x10 ] */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200a408: c2 07 20 28 ld [ %i4 + 0x28 ], %g1 200a40c: 9f c0 40 00 call %g1 200a410: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200a414: 7f ff e0 ad call 20026c8 200a418: 90 10 00 19 mov %i1, %o0 200a41c: 7f ff e0 a7 call 20026b8 200a420: 01 00 00 00 nop 200a424: 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(); 200a428: c2 07 20 08 ld [ %i4 + 8 ], %g1 200a42c: 9f c0 40 00 call %g1 200a430: 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 ); 200a434: 03 00 80 7b sethi %hi(0x201ec00), %g1 200a438: 82 10 63 70 or %g1, 0x370, %g1 ! 201ef70 <_Per_CPU_Information> 200a43c: 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() && 200a440: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200a444: 80 a0 80 03 cmp %g2, %g3 200a448: 02 80 00 07 be 200a464 <_Thread_Change_priority+0x114> 200a44c: 01 00 00 00 nop 200a450: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 200a454: 80 a0 a0 00 cmp %g2, 0 200a458: 02 80 00 03 be 200a464 <_Thread_Change_priority+0x114> 200a45c: 84 10 20 01 mov 1, %g2 _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 200a460: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 200a464: 7f ff e0 99 call 20026c8 200a468: 81 e8 00 00 restore */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 200a46c: c2 07 20 24 ld [ %i4 + 0x24 ], %g1 200a470: 9f c0 40 00 call %g1 200a474: 90 10 00 1d mov %i5, %o0 200a478: 30 bf ff e7 b,a 200a414 <_Thread_Change_priority+0xc4> =============================================================================== 0200a694 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 200a694: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200a698: 90 10 00 18 mov %i0, %o0 200a69c: 40 00 00 77 call 200a878 <_Thread_Get> 200a6a0: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a6a4: c2 07 bf fc ld [ %fp + -4 ], %g1 200a6a8: 80 a0 60 00 cmp %g1, 0 200a6ac: 12 80 00 09 bne 200a6d0 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 200a6b0: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 200a6b4: 7f ff ff 72 call 200a47c <_Thread_Clear_state> 200a6b8: 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--; 200a6bc: 03 00 80 7a sethi %hi(0x201e800), %g1 200a6c0: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201ea30 <_Thread_Dispatch_disable_level> 200a6c4: 84 00 bf ff add %g2, -1, %g2 200a6c8: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 200a6cc: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 200a6d0: 81 c7 e0 08 ret 200a6d4: 81 e8 00 00 restore =============================================================================== 0200a6d8 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 200a6d8: 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++; 200a6dc: 31 00 80 7a sethi %hi(0x201e800), %i0 200a6e0: c2 06 22 30 ld [ %i0 + 0x230 ], %g1 ! 201ea30 <_Thread_Dispatch_disable_level> 200a6e4: 82 00 60 01 inc %g1 200a6e8: c2 26 22 30 st %g1, [ %i0 + 0x230 ] return _Thread_Dispatch_disable_level; 200a6ec: c2 06 22 30 ld [ %i0 + 0x230 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 200a6f0: 39 00 80 7b sethi %hi(0x201ec00), %i4 200a6f4: b8 17 23 70 or %i4, 0x370, %i4 ! 201ef70 <_Per_CPU_Information> _ISR_Disable( level ); 200a6f8: 7f ff df f0 call 20026b8 200a6fc: fa 07 20 0c ld [ %i4 + 0xc ], %i5 while ( _Thread_Dispatch_necessary == true ) { 200a700: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 200a704: 80 a0 60 00 cmp %g1, 0 200a708: 02 80 00 45 be 200a81c <_Thread_Dispatch+0x144> 200a70c: 01 00 00 00 nop heir = _Thread_Heir; 200a710: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 200a714: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a718: 80 a7 40 1b cmp %i5, %i3 200a71c: 02 80 00 40 be 200a81c <_Thread_Dispatch+0x144> 200a720: f6 27 20 0c st %i3, [ %i4 + 0xc ] 200a724: 33 00 80 7a sethi %hi(0x201e800), %i1 #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a728: 21 00 80 7a sethi %hi(0x201e800), %l0 200a72c: b2 16 62 bc or %i1, 0x2bc, %i1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) RTEMS_INLINE_ROUTINE bool _Thread_Is_allocated_fp ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Allocated_fp ); 200a730: 10 80 00 35 b 200a804 <_Thread_Dispatch+0x12c> 200a734: 35 00 80 7a sethi %hi(0x201e800), %i2 _ISR_Enable( level ); 200a738: 7f ff df e4 call 20026c8 200a73c: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 200a740: 40 00 0e 45 call 200e054 <_TOD_Get_uptime> 200a744: 90 07 bf f8 add %fp, -8, %o0 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a748: c4 1f 20 20 ldd [ %i4 + 0x20 ], %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a74c: d4 1f 60 80 ldd [ %i5 + 0x80 ], %o2 _Timestamp_Subtract( 200a750: d8 1f bf f8 ldd [ %fp + -8 ], %o4 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 200a754: c2 06 40 00 ld [ %i1 ], %g1 const Timestamp64_Control *_start, const Timestamp64_Control *_end, Timestamp64_Control *_result ) { *_result = *_end - *_start; 200a758: 86 a3 40 03 subcc %o5, %g3, %g3 200a75c: 84 63 00 02 subx %o4, %g2, %g2 static inline void _Timestamp64_implementation_Add_to( Timestamp64_Control *_time, const Timestamp64_Control *_add ) { *_time += *_add; 200a760: 86 82 c0 03 addcc %o3, %g3, %g3 200a764: 84 42 80 02 addx %o2, %g2, %g2 200a768: c4 3f 60 80 std %g2, [ %i5 + 0x80 ] 200a76c: 80 a0 60 00 cmp %g1, 0 200a770: 02 80 00 06 be 200a788 <_Thread_Dispatch+0xb0> <== NEVER TAKEN 200a774: d8 3f 20 20 std %o4, [ %i4 + 0x20 ] executing->libc_reent = *_Thread_libc_reent; 200a778: c4 00 40 00 ld [ %g1 ], %g2 200a77c: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 200a780: c4 06 e1 54 ld [ %i3 + 0x154 ], %g2 200a784: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 200a788: 90 10 00 1d mov %i5, %o0 200a78c: 40 00 03 a0 call 200b60c <_User_extensions_Thread_switch> 200a790: 92 10 00 1b mov %i3, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 200a794: 90 07 60 c8 add %i5, 0xc8, %o0 200a798: 40 00 04 ea call 200bb40 <_CPU_Context_switch> 200a79c: 92 06 e0 c8 add %i3, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200a7a0: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200a7a4: 80 a0 60 00 cmp %g1, 0 200a7a8: 02 80 00 0c be 200a7d8 <_Thread_Dispatch+0x100> 200a7ac: d0 06 a2 b8 ld [ %i2 + 0x2b8 ], %o0 200a7b0: 80 a7 40 08 cmp %i5, %o0 200a7b4: 02 80 00 09 be 200a7d8 <_Thread_Dispatch+0x100> 200a7b8: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200a7bc: 02 80 00 04 be 200a7cc <_Thread_Dispatch+0xf4> 200a7c0: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200a7c4: 40 00 04 a5 call 200ba58 <_CPU_Context_save_fp> 200a7c8: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 200a7cc: 40 00 04 c0 call 200bacc <_CPU_Context_restore_fp> 200a7d0: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 200a7d4: fa 26 a2 b8 st %i5, [ %i2 + 0x2b8 ] #endif #endif executing = _Thread_Executing; _ISR_Disable( level ); 200a7d8: 7f ff df b8 call 20026b8 200a7dc: fa 07 20 0c ld [ %i4 + 0xc ], %i5 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 200a7e0: c2 0f 20 18 ldub [ %i4 + 0x18 ], %g1 200a7e4: 80 a0 60 00 cmp %g1, 0 200a7e8: 02 80 00 0d be 200a81c <_Thread_Dispatch+0x144> 200a7ec: 01 00 00 00 nop heir = _Thread_Heir; 200a7f0: f6 07 20 10 ld [ %i4 + 0x10 ], %i3 _Thread_Dispatch_necessary = false; 200a7f4: c0 2f 20 18 clrb [ %i4 + 0x18 ] /* * When the heir and executing are the same, then we are being * requested to do the post switch dispatching. This is normally * done to dispatch signals. */ if ( heir == executing ) 200a7f8: 80 a6 c0 1d cmp %i3, %i5 200a7fc: 02 80 00 08 be 200a81c <_Thread_Dispatch+0x144> <== NEVER TAKEN 200a800: f6 27 20 0c st %i3, [ %i4 + 0xc ] */ #if __RTEMS_ADA__ executing->rtems_ada_self = rtems_ada_self; rtems_ada_self = heir->rtems_ada_self; #endif if ( heir->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE ) 200a804: c2 06 e0 78 ld [ %i3 + 0x78 ], %g1 200a808: 80 a0 60 01 cmp %g1, 1 200a80c: 12 bf ff cb bne 200a738 <_Thread_Dispatch+0x60> 200a810: c2 04 21 94 ld [ %l0 + 0x194 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a814: 10 bf ff c9 b 200a738 <_Thread_Dispatch+0x60> 200a818: c2 26 e0 74 st %g1, [ %i3 + 0x74 ] _ISR_Disable( level ); } post_switch: _ISR_Enable( level ); 200a81c: 7f ff df ab call 20026c8 200a820: 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--; 200a824: c2 06 22 30 ld [ %i0 + 0x230 ], %g1 200a828: 82 00 7f ff add %g1, -1, %g1 200a82c: c2 26 22 30 st %g1, [ %i0 + 0x230 ] return _Thread_Dispatch_disable_level; 200a830: c2 06 22 30 ld [ %i0 + 0x230 ], %g1 _Thread_Unnest_dispatch(); _API_extensions_Run_postswitch(); 200a834: 7f ff f7 a2 call 20086bc <_API_extensions_Run_postswitch> 200a838: 01 00 00 00 nop } 200a83c: 81 c7 e0 08 ret 200a840: 81 e8 00 00 restore =============================================================================== 020103c0 <_Thread_Handler>: * Input parameters: NONE * * Output parameters: NONE */ void _Thread_Handler( void ) { 20103c0: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static bool doneConstructors; bool doCons; #endif executing = _Thread_Executing; 20103c4: 03 00 80 7b sethi %hi(0x201ec00), %g1 20103c8: fa 00 63 7c ld [ %g1 + 0x37c ], %i5 ! 201ef7c <_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(); 20103cc: 3f 00 80 40 sethi %hi(0x2010000), %i7 20103d0: be 17 e3 c0 or %i7, 0x3c0, %i7 ! 20103c0 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 20103d4: d0 07 60 a8 ld [ %i5 + 0xa8 ], %o0 _ISR_Set_level(level); 20103d8: 7f ff c8 bc call 20026c8 20103dc: 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) && 20103e0: 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; 20103e4: 03 00 80 79 sethi %hi(0x201e400), %g1 doneConstructors = true; 20103e8: 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; 20103ec: f6 08 62 58 ldub [ %g1 + 0x258 ], %i3 #endif #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 20103f0: 80 a0 a0 00 cmp %g2, 0 20103f4: 02 80 00 0c be 2010424 <_Thread_Handler+0x64> 20103f8: c6 28 62 58 stb %g3, [ %g1 + 0x258 ] #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 ); 20103fc: 39 00 80 7a sethi %hi(0x201e800), %i4 2010400: d0 07 22 b8 ld [ %i4 + 0x2b8 ], %o0 ! 201eab8 <_Thread_Allocated_fp> 2010404: 80 a7 40 08 cmp %i5, %o0 2010408: 02 80 00 07 be 2010424 <_Thread_Handler+0x64> 201040c: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2010410: 22 80 00 05 be,a 2010424 <_Thread_Handler+0x64> 2010414: fa 27 22 b8 st %i5, [ %i4 + 0x2b8 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2010418: 7f ff ed 90 call 200ba58 <_CPU_Context_save_fp> 201041c: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 2010420: fa 27 22 b8 st %i5, [ %i4 + 0x2b8 ] /* * 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 ); 2010424: 7f ff eb f8 call 200b404 <_User_extensions_Thread_begin> 2010428: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 201042c: 7f ff e9 06 call 200a844 <_Thread_Enable_dispatch> 2010430: 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) */ { 2010434: 80 8e e0 ff btst 0xff, %i3 2010438: 02 80 00 0e be 2010470 <_Thread_Handler+0xb0> 201043c: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 2010440: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 2010444: 80 a0 60 00 cmp %g1, 0 2010448: 02 80 00 0e be 2010480 <_Thread_Handler+0xc0> 201044c: 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 ) { 2010450: 22 80 00 11 be,a 2010494 <_Thread_Handler+0xd4> <== ALWAYS TAKEN 2010454: 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 ); 2010458: 7f ff eb ff call 200b454 <_User_extensions_Thread_exitted> 201045c: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 2010460: 90 10 20 00 clr %o0 2010464: 92 10 20 01 mov 1, %o1 2010468: 7f ff e3 70 call 2009228 <_Internal_error_Occurred> 201046c: 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 (); 2010470: 40 00 35 e8 call 201dc10 <_init> 2010474: 01 00 00 00 nop _Thread_Enable_dispatch(); #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 2010478: 10 bf ff f3 b 2010444 <_Thread_Handler+0x84> 201047c: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 2010480: c2 07 60 8c ld [ %i5 + 0x8c ], %g1 2010484: 9f c0 40 00 call %g1 2010488: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { executing->Wait.return_argument = 201048c: 10 bf ff f3 b 2010458 <_Thread_Handler+0x98> 2010490: 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)( 2010494: 9f c0 40 00 call %g1 2010498: 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 = 201049c: 10 bf ff ef b 2010458 <_Thread_Handler+0x98> 20104a0: d0 27 60 28 st %o0, [ %i5 + 0x28 ] =============================================================================== 0200ab30 <_Thread_Handler_initialization>: * * Output parameters: NONE */ void _Thread_Handler_initialization(void) { 200ab30: 9d e3 bf 98 save %sp, -104, %sp uint32_t ticks_per_timeslice = 200ab34: 05 00 80 77 sethi %hi(0x201dc00), %g2 200ab38: 84 10 a0 4c or %g2, 0x4c, %g2 ! 201dc4c #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ab3c: c6 00 a0 28 ld [ %g2 + 0x28 ], %g3 * Output parameters: NONE */ void _Thread_Handler_initialization(void) { uint32_t ticks_per_timeslice = 200ab40: fa 00 a0 14 ld [ %g2 + 0x14 ], %i5 rtems_configuration_get_ticks_per_timeslice(); uint32_t maximum_extensions = 200ab44: f8 00 a0 0c ld [ %g2 + 0xc ], %i4 #if defined(RTEMS_MULTIPROCESSING) uint32_t maximum_proxies = _Configuration_MP_table->maximum_proxies; #endif if ( rtems_configuration_get_stack_allocate_hook() == NULL || 200ab48: 80 a0 e0 00 cmp %g3, 0 200ab4c: 02 80 00 21 be 200abd0 <_Thread_Handler_initialization+0xa0> 200ab50: c2 00 a0 24 ld [ %g2 + 0x24 ], %g1 200ab54: c6 00 a0 2c ld [ %g2 + 0x2c ], %g3 200ab58: 80 a0 e0 00 cmp %g3, 0 200ab5c: 02 80 00 1d be 200abd0 <_Thread_Handler_initialization+0xa0><== NEVER TAKEN 200ab60: 80 a0 60 00 cmp %g1, 0 INTERNAL_ERROR_CORE, true, INTERNAL_ERROR_BAD_STACK_HOOK ); if ( stack_allocate_init_hook != NULL ) 200ab64: 22 80 00 05 be,a 200ab78 <_Thread_Handler_initialization+0x48> 200ab68: 03 00 80 7b sethi %hi(0x201ec00), %g1 (*stack_allocate_init_hook)( rtems_configuration_get_stack_space_size() ); 200ab6c: 9f c0 40 00 call %g1 200ab70: d0 00 a0 08 ld [ %g2 + 8 ], %o0 _Thread_Dispatch_necessary = false; 200ab74: 03 00 80 7b sethi %hi(0x201ec00), %g1 200ab78: 82 10 63 70 or %g1, 0x370, %g1 ! 201ef70 <_Per_CPU_Information> 200ab7c: c0 28 60 18 clrb [ %g1 + 0x18 ] _Thread_Executing = NULL; 200ab80: c0 20 60 0c clr [ %g1 + 0xc ] _Thread_Heir = NULL; 200ab84: c0 20 60 10 clr [ %g1 + 0x10 ] #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Thread_Allocated_fp = NULL; 200ab88: 03 00 80 7a sethi %hi(0x201e800), %g1 200ab8c: c0 20 62 b8 clr [ %g1 + 0x2b8 ] ! 201eab8 <_Thread_Allocated_fp> #endif _Thread_Maximum_extensions = maximum_extensions; 200ab90: 03 00 80 7a sethi %hi(0x201e800), %g1 200ab94: f8 20 62 c8 st %i4, [ %g1 + 0x2c8 ] ! 201eac8 <_Thread_Maximum_extensions> _Thread_Ticks_per_timeslice = ticks_per_timeslice; 200ab98: 03 00 80 7a sethi %hi(0x201e800), %g1 200ab9c: fa 20 61 94 st %i5, [ %g1 + 0x194 ] ! 201e994 <_Thread_Ticks_per_timeslice> #if defined(RTEMS_MULTIPROCESSING) if ( _System_state_Is_multiprocessing ) maximum_internal_threads += 1; #endif _Objects_Initialize_information( 200aba0: 82 10 20 08 mov 8, %g1 200aba4: 11 00 80 7a sethi %hi(0x201e800), %o0 200aba8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200abac: 90 12 23 48 or %o0, 0x348, %o0 200abb0: 92 10 20 01 mov 1, %o1 200abb4: 94 10 20 01 mov 1, %o2 200abb8: 96 10 20 01 mov 1, %o3 200abbc: 98 10 21 68 mov 0x168, %o4 200abc0: 7f ff fb 30 call 2009880 <_Objects_Initialize_information> 200abc4: 9a 10 20 00 clr %o5 false, /* true if this is a global object class */ NULL /* Proxy extraction support callout */ #endif ); } 200abc8: 81 c7 e0 08 ret 200abcc: 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( 200abd0: 90 10 20 00 clr %o0 200abd4: 92 10 20 01 mov 1, %o1 200abd8: 7f ff f9 94 call 2009228 <_Internal_error_Occurred> 200abdc: 94 10 20 0e mov 0xe, %o2 =============================================================================== 0200a928 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 200a928: 9d e3 bf a0 save %sp, -96, %sp 200a92c: 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; 200a930: c0 26 61 58 clr [ %i1 + 0x158 ] 200a934: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 200a938: 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 ) { 200a93c: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 200a940: e4 00 40 00 ld [ %g1 ], %l2 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 200a944: 80 a6 a0 00 cmp %i2, 0 200a948: 02 80 00 6b be 200aaf4 <_Thread_Initialize+0x1cc> 200a94c: e2 0f a0 5f ldub [ %fp + 0x5f ], %l1 stack = the_thread->Start.stack; the_thread->Start.core_allocated_stack = true; } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 200a950: c0 2e 60 b0 clrb [ %i1 + 0xb0 ] 200a954: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 200a958: f4 26 60 b8 st %i2, [ %i1 + 0xb8 ] the_stack->size = size; 200a95c: 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 ) { 200a960: 80 a7 20 00 cmp %i4, 0 200a964: 12 80 00 48 bne 200aa84 <_Thread_Initialize+0x15c> 200a968: b6 10 20 00 clr %i3 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a96c: 39 00 80 7a sethi %hi(0x201e800), %i4 200a970: c2 07 22 c8 ld [ %i4 + 0x2c8 ], %g1 ! 201eac8 <_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; 200a974: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 200a978: f6 26 60 bc st %i3, [ %i1 + 0xbc ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200a97c: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 200a980: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 200a984: c0 26 60 68 clr [ %i1 + 0x68 ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 200a988: 80 a0 60 00 cmp %g1, 0 200a98c: 12 80 00 46 bne 200aaa4 <_Thread_Initialize+0x17c> 200a990: c0 26 60 6c clr [ %i1 + 0x6c ] (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200a994: 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; 200a998: 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; 200a99c: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 200a9a0: e2 2e 60 9c stb %l1, [ %i1 + 0x9c ] the_thread->Start.budget_algorithm = budget_algorithm; 200a9a4: e0 26 60 a0 st %l0, [ %i1 + 0xa0 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 200a9a8: 80 a4 20 02 cmp %l0, 2 200a9ac: 12 80 00 05 bne 200a9c0 <_Thread_Initialize+0x98> 200a9b0: 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; 200a9b4: 03 00 80 7a sethi %hi(0x201e800), %g1 200a9b8: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 ! 201e994 <_Thread_Ticks_per_timeslice> 200a9bc: c2 26 60 74 st %g1, [ %i1 + 0x74 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 200a9c0: c4 07 a0 68 ld [ %fp + 0x68 ], %g2 */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 200a9c4: 03 00 80 77 sethi %hi(0x201dc00), %g1 200a9c8: c2 00 61 54 ld [ %g1 + 0x154 ], %g1 ! 201dd54 <_Scheduler+0x18> 200a9cc: c4 26 60 a8 st %g2, [ %i1 + 0xa8 ] the_thread->current_state = STATES_DORMANT; 200a9d0: 84 10 20 01 mov 1, %g2 the_thread->Wait.queue = NULL; 200a9d4: c0 26 60 44 clr [ %i1 + 0x44 ] #endif } the_thread->Start.isr_level = isr_level; the_thread->current_state = STATES_DORMANT; 200a9d8: c4 26 60 10 st %g2, [ %i1 + 0x10 ] the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 200a9dc: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 200a9e0: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 200a9e4: fa 26 60 ac st %i5, [ %i1 + 0xac ] 200a9e8: 9f c0 40 00 call %g1 200a9ec: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 200a9f0: b8 92 20 00 orcc %o0, 0, %i4 200a9f4: 22 80 00 13 be,a 200aa40 <_Thread_Initialize+0x118> 200a9f8: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 200a9fc: 90 10 00 19 mov %i1, %o0 200aa00: 40 00 01 e9 call 200b1a4 <_Thread_Set_priority> 200aa04: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aa08: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 200aa0c: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 static inline void _Timestamp64_implementation_Set_to_zero( Timestamp64_Control *_time ) { *_time = 0; 200aa10: c0 26 60 80 clr [ %i1 + 0x80 ] 200aa14: c0 26 60 84 clr [ %i1 + 0x84 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200aa18: 83 28 60 02 sll %g1, 2, %g1 200aa1c: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 200aa20: e4 26 60 0c st %l2, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 200aa24: 90 10 00 19 mov %i1, %o0 200aa28: 40 00 02 b2 call 200b4f0 <_User_extensions_Thread_create> 200aa2c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 200aa30: 80 8a 20 ff btst 0xff, %o0 200aa34: 32 80 00 12 bne,a 200aa7c <_Thread_Initialize+0x154> 200aa38: b0 0e 20 01 and %i0, 1, %i0 return true; failed: _Workspace_Free( the_thread->libc_reent ); 200aa3c: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 200aa40: 40 00 03 f1 call 200ba04 <_Workspace_Free> 200aa44: b0 10 20 00 clr %i0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 200aa48: 40 00 03 ef call 200ba04 <_Workspace_Free> 200aa4c: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 200aa50: 40 00 03 ed call 200ba04 <_Workspace_Free> 200aa54: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 200aa58: 40 00 03 eb call 200ba04 <_Workspace_Free> 200aa5c: 90 10 00 1a mov %i2, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 200aa60: 40 00 03 e9 call 200ba04 <_Workspace_Free> 200aa64: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 200aa68: 40 00 03 e7 call 200ba04 <_Workspace_Free> 200aa6c: 90 10 00 1c mov %i4, %o0 _Thread_Stack_Free( the_thread ); 200aa70: 40 00 02 07 call 200b28c <_Thread_Stack_Free> 200aa74: 90 10 00 19 mov %i1, %o0 return false; } 200aa78: b0 0e 20 01 and %i0, 1, %i0 200aa7c: 81 c7 e0 08 ret 200aa80: 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 ); 200aa84: 40 00 03 d8 call 200b9e4 <_Workspace_Allocate> 200aa88: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 200aa8c: b6 92 20 00 orcc %o0, 0, %i3 200aa90: 32 bf ff b8 bne,a 200a970 <_Thread_Initialize+0x48> 200aa94: 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; 200aa98: 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; 200aa9c: 10 bf ff e8 b 200aa3c <_Thread_Initialize+0x114> 200aaa0: b8 10 20 00 clr %i4 /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { extensions_area = _Workspace_Allocate( 200aaa4: 82 00 60 01 inc %g1 200aaa8: 40 00 03 cf call 200b9e4 <_Workspace_Allocate> 200aaac: 91 28 60 02 sll %g1, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 200aab0: b4 92 20 00 orcc %o0, 0, %i2 200aab4: 02 80 00 1d be 200ab28 <_Thread_Initialize+0x200> 200aab8: 86 10 00 1a mov %i2, %g3 goto failed; } the_thread->extensions = (void **) extensions_area; 200aabc: f4 26 61 60 st %i2, [ %i1 + 0x160 ] 200aac0: c8 07 22 c8 ld [ %i4 + 0x2c8 ], %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++ ) 200aac4: 84 10 20 00 clr %g2 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) goto failed; } the_thread->extensions = (void **) extensions_area; 200aac8: 10 80 00 03 b 200aad4 <_Thread_Initialize+0x1ac> 200aacc: 82 10 20 00 clr %g1 200aad0: 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; 200aad4: 85 28 a0 02 sll %g2, 2, %g2 200aad8: 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++ ) 200aadc: 82 00 60 01 inc %g1 200aae0: 80 a0 40 04 cmp %g1, %g4 200aae4: 08 bf ff fb bleu 200aad0 <_Thread_Initialize+0x1a8> 200aae8: 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; 200aaec: 10 bf ff ad b 200a9a0 <_Thread_Initialize+0x78> 200aaf0: 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 ); 200aaf4: 90 10 00 19 mov %i1, %o0 200aaf8: 40 00 01 d4 call 200b248 <_Thread_Stack_Allocate> 200aafc: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 200ab00: 80 a2 00 1b cmp %o0, %i3 200ab04: 0a 80 00 07 bcs 200ab20 <_Thread_Initialize+0x1f8> 200ab08: 80 a2 20 00 cmp %o0, 0 200ab0c: 02 80 00 05 be 200ab20 <_Thread_Initialize+0x1f8> <== NEVER TAKEN 200ab10: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 200ab14: f4 06 60 c0 ld [ %i1 + 0xc0 ], %i2 the_thread->Start.core_allocated_stack = true; 200ab18: 10 bf ff 90 b 200a958 <_Thread_Initialize+0x30> 200ab1c: 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 */ 200ab20: 10 bf ff d6 b 200aa78 <_Thread_Initialize+0x150> 200ab24: 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; 200ab28: 10 bf ff c5 b 200aa3c <_Thread_Initialize+0x114> 200ab2c: b8 10 20 00 clr %i4 =============================================================================== 0200b28c <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 200b28c: 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 ) 200b290: c2 0e 20 b0 ldub [ %i0 + 0xb0 ], %g1 200b294: 80 a0 60 00 cmp %g1, 0 void _Thread_Stack_Free( Thread_Control *the_thread ) { rtems_stack_free_hook stack_free_hook = 200b298: 03 00 80 77 sethi %hi(0x201dc00), %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 ) 200b29c: 02 80 00 04 be 200b2ac <_Thread_Stack_Free+0x20> <== NEVER TAKEN 200b2a0: c2 00 60 78 ld [ %g1 + 0x78 ], %g1 ! 201dc78 * 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 ); 200b2a4: 9f c0 40 00 call %g1 200b2a8: d0 06 20 b8 ld [ %i0 + 0xb8 ], %o0 200b2ac: 81 c7 e0 08 ret 200b2b0: 81 e8 00 00 restore =============================================================================== 0200b0e0 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 200b0e0: 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 ) 200b0e4: 80 a6 20 00 cmp %i0, 0 200b0e8: 02 80 00 13 be 200b134 <_Thread_queue_Requeue+0x54> <== NEVER TAKEN 200b0ec: 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 ) { 200b0f0: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 200b0f4: 80 a7 20 01 cmp %i4, 1 200b0f8: 02 80 00 04 be 200b108 <_Thread_queue_Requeue+0x28> <== ALWAYS TAKEN 200b0fc: 01 00 00 00 nop 200b100: 81 c7 e0 08 ret <== NOT EXECUTED 200b104: 81 e8 00 00 restore <== NOT EXECUTED Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 200b108: 7f ff dd 6c call 20026b8 200b10c: 01 00 00 00 nop 200b110: ba 10 00 08 mov %o0, %i5 200b114: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 200b118: 03 00 00 ef sethi %hi(0x3bc00), %g1 200b11c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 200b120: 80 88 80 01 btst %g2, %g1 200b124: 12 80 00 06 bne 200b13c <_Thread_queue_Requeue+0x5c> <== ALWAYS TAKEN 200b128: 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 ); 200b12c: 7f ff dd 67 call 20026c8 200b130: 90 10 00 1d mov %i5, %o0 200b134: 81 c7 e0 08 ret 200b138: 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 ); 200b13c: 92 10 00 19 mov %i1, %o1 200b140: 94 10 20 01 mov 1, %o2 200b144: 40 00 0d a8 call 200e7e4 <_Thread_queue_Extract_priority_helper> 200b148: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 200b14c: 90 10 00 18 mov %i0, %o0 200b150: 92 10 00 19 mov %i1, %o1 200b154: 7f ff ff 35 call 200ae28 <_Thread_queue_Enqueue_priority> 200b158: 94 07 bf fc add %fp, -4, %o2 200b15c: 30 bf ff f4 b,a 200b12c <_Thread_queue_Requeue+0x4c> =============================================================================== 0200b160 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 200b160: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200b164: 90 10 00 18 mov %i0, %o0 200b168: 7f ff fd c4 call 200a878 <_Thread_Get> 200b16c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200b170: c2 07 bf fc ld [ %fp + -4 ], %g1 200b174: 80 a0 60 00 cmp %g1, 0 200b178: 12 80 00 09 bne 200b19c <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 200b17c: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 200b180: 40 00 0d d2 call 200e8c8 <_Thread_queue_Process_timeout> 200b184: 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--; 200b188: 03 00 80 7a sethi %hi(0x201e800), %g1 200b18c: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201ea30 <_Thread_Dispatch_disable_level> 200b190: 84 00 bf ff add %g2, -1, %g2 200b194: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 200b198: c2 00 62 30 ld [ %g1 + 0x230 ], %g1 200b19c: 81 c7 e0 08 ret 200b1a0: 81 e8 00 00 restore =============================================================================== 02017c1c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2017c1c: 9d e3 bf 88 save %sp, -120, %sp 2017c20: 21 00 80 f2 sethi %hi(0x203c800), %l0 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2017c24: a4 07 bf e8 add %fp, -24, %l2 2017c28: b4 07 bf ec add %fp, -20, %i2 2017c2c: b8 07 bf f4 add %fp, -12, %i4 2017c30: a2 07 bf f8 add %fp, -8, %l1 2017c34: 33 00 80 f2 sethi %hi(0x203c800), %i1 2017c38: 27 00 80 f2 sethi %hi(0x203c800), %l3 2017c3c: f4 27 bf e8 st %i2, [ %fp + -24 ] head->previous = NULL; 2017c40: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2017c44: 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; 2017c48: e2 27 bf f4 st %l1, [ %fp + -12 ] head->previous = NULL; 2017c4c: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2017c50: f8 27 bf fc st %i4, [ %fp + -4 ] 2017c54: a0 14 23 80 or %l0, 0x380, %l0 2017c58: ba 06 20 30 add %i0, 0x30, %i5 2017c5c: b2 16 63 00 or %i1, 0x300, %i1 2017c60: b6 06 20 68 add %i0, 0x68, %i3 2017c64: a6 14 e2 70 or %l3, 0x270, %l3 2017c68: ac 06 20 08 add %i0, 8, %l6 2017c6c: 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; 2017c70: 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; 2017c74: 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; 2017c78: c2 04 00 00 ld [ %l0 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2017c7c: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2017c80: 90 10 00 1d mov %i5, %o0 2017c84: 92 20 40 09 sub %g1, %o1, %o1 2017c88: 94 10 00 1c mov %i4, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2017c8c: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2017c90: 40 00 13 07 call 201c8ac <_Watchdog_Adjust_to_chain> 2017c94: 01 00 00 00 nop 2017c98: d0 1e 40 00 ldd [ %i1 ], %o0 2017c9c: 94 10 20 00 clr %o2 2017ca0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017ca4: 40 00 52 0d call 202c4d8 <__divdi3> 2017ca8: 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; 2017cac: 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 ) { 2017cb0: 80 a2 40 0a cmp %o1, %o2 2017cb4: 18 80 00 2b bgu 2017d60 <_Timer_server_Body+0x144> 2017cb8: 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 ) { 2017cbc: 80 a2 40 0a cmp %o1, %o2 2017cc0: 0a 80 00 20 bcs 2017d40 <_Timer_server_Body+0x124> 2017cc4: 90 10 00 1b mov %i3, %o0 */ delta = last_snapshot - snapshot; _Watchdog_Adjust( &watchdogs->Chain, WATCHDOG_BACKWARD, delta ); } watchdogs->last_snapshot = snapshot; 2017cc8: 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 ); 2017ccc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2017cd0: 40 00 03 1a call 2018938 <_Chain_Get> 2017cd4: 01 00 00 00 nop if ( timer == NULL ) { 2017cd8: 92 92 20 00 orcc %o0, 0, %o1 2017cdc: 02 80 00 10 be 2017d1c <_Timer_server_Body+0x100> 2017ce0: 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 ) { 2017ce4: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2017ce8: 80 a0 60 01 cmp %g1, 1 2017cec: 02 80 00 19 be 2017d50 <_Timer_server_Body+0x134> 2017cf0: 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 ) { 2017cf4: 12 bf ff f6 bne 2017ccc <_Timer_server_Body+0xb0> <== NEVER TAKEN 2017cf8: 92 02 60 10 add %o1, 0x10, %o1 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017cfc: 40 00 13 1d call 201c970 <_Watchdog_Insert> 2017d00: 90 10 00 1b mov %i3, %o0 } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 2017d04: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2017d08: 40 00 03 0c call 2018938 <_Chain_Get> 2017d0c: 01 00 00 00 nop if ( timer == NULL ) { 2017d10: 92 92 20 00 orcc %o0, 0, %o1 2017d14: 32 bf ff f5 bne,a 2017ce8 <_Timer_server_Body+0xcc> <== NEVER TAKEN 2017d18: 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 ); 2017d1c: 7f ff dd a7 call 200f3b8 2017d20: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2017d24: c2 07 bf e8 ld [ %fp + -24 ], %g1 2017d28: 80 a0 40 1a cmp %g1, %i2 2017d2c: 02 80 00 12 be 2017d74 <_Timer_server_Body+0x158> <== ALWAYS TAKEN 2017d30: 01 00 00 00 nop ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2017d34: 7f ff dd a5 call 200f3c8 <== NOT EXECUTED 2017d38: 01 00 00 00 nop <== NOT EXECUTED 2017d3c: 30 bf ff cf b,a 2017c78 <_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 ); 2017d40: 92 10 20 01 mov 1, %o1 ! 1 2017d44: 40 00 12 ab call 201c7f0 <_Watchdog_Adjust> 2017d48: 94 22 80 17 sub %o2, %l7, %o2 2017d4c: 30 bf ff df b,a 2017cc8 <_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 ); 2017d50: 90 10 00 1d mov %i5, %o0 2017d54: 40 00 13 07 call 201c970 <_Watchdog_Insert> 2017d58: 92 02 60 10 add %o1, 0x10, %o1 2017d5c: 30 bf ff dc b,a 2017ccc <_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 ); 2017d60: 92 22 40 0a sub %o1, %o2, %o1 2017d64: 90 10 00 1b mov %i3, %o0 2017d68: 40 00 12 d1 call 201c8ac <_Watchdog_Adjust_to_chain> 2017d6c: 94 10 00 1c mov %i4, %o2 2017d70: 30 bf ff d6 b,a 2017cc8 <_Timer_server_Body+0xac> */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); if ( _Chain_Is_empty( insert_chain ) ) { ts->insert_chain = NULL; 2017d74: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2017d78: 7f ff dd 94 call 200f3c8 2017d7c: 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 ) ) { 2017d80: c2 07 bf f4 ld [ %fp + -12 ], %g1 2017d84: 80 a0 40 11 cmp %g1, %l1 2017d88: 12 80 00 0c bne 2017db8 <_Timer_server_Body+0x19c> 2017d8c: 01 00 00 00 nop 2017d90: 30 80 00 13 b,a 2017ddc <_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; 2017d94: 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; 2017d98: 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; 2017d9c: c0 25 e0 08 clr [ %l7 + 8 ] _ISR_Enable( level ); 2017da0: 7f ff dd 8a call 200f3c8 2017da4: 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 ); 2017da8: d0 05 e0 20 ld [ %l7 + 0x20 ], %o0 2017dac: c2 05 e0 1c ld [ %l7 + 0x1c ], %g1 2017db0: 9f c0 40 00 call %g1 2017db4: 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 ); 2017db8: 7f ff dd 80 call 200f3b8 2017dbc: 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; 2017dc0: 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)) 2017dc4: 80 a5 c0 11 cmp %l7, %l1 2017dc8: 32 bf ff f3 bne,a 2017d94 <_Timer_server_Body+0x178> 2017dcc: 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 ); 2017dd0: 7f ff dd 7e call 200f3c8 2017dd4: 01 00 00 00 nop 2017dd8: 30 bf ff a7 b,a 2017c74 <_Timer_server_Body+0x58> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2017ddc: 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++; 2017de0: c2 04 c0 00 ld [ %l3 ], %g1 2017de4: 82 00 60 01 inc %g1 2017de8: c2 24 c0 00 st %g1, [ %l3 ] return _Thread_Dispatch_disable_level; 2017dec: c2 04 c0 00 ld [ %l3 ], %g1 /* * Block until there is something to do. */ _Thread_Disable_dispatch(); _Thread_Set_state( ts->thread, STATES_DELAYING ); 2017df0: d0 06 00 00 ld [ %i0 ], %o0 2017df4: 40 00 11 46 call 201c30c <_Thread_Set_state> 2017df8: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2017dfc: 7f ff ff 60 call 2017b7c <_Timer_server_Reset_interval_system_watchdog> 2017e00: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2017e04: 7f ff ff 72 call 2017bcc <_Timer_server_Reset_tod_system_watchdog> 2017e08: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2017e0c: 40 00 0e bc call 201b8fc <_Thread_Enable_dispatch> 2017e10: 01 00 00 00 nop static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2017e14: 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; 2017e18: 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 ); 2017e1c: 40 00 13 37 call 201caf8 <_Watchdog_Remove> 2017e20: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2017e24: 40 00 13 35 call 201caf8 <_Watchdog_Remove> 2017e28: 90 10 00 15 mov %l5, %o0 2017e2c: 30 bf ff 92 b,a 2017c74 <_Timer_server_Body+0x58> =============================================================================== 02017e30 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2017e30: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2017e34: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2017e38: 80 a0 60 00 cmp %g1, 0 2017e3c: 02 80 00 05 be 2017e50 <_Timer_server_Schedule_operation_method+0x20> 2017e40: 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 ); 2017e44: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2017e48: 40 00 02 b1 call 201890c <_Chain_Append> 2017e4c: 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++; 2017e50: 03 00 80 f2 sethi %hi(0x203c800), %g1 2017e54: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 203ca70 <_Thread_Dispatch_disable_level> 2017e58: 84 00 a0 01 inc %g2 2017e5c: c4 20 62 70 st %g2, [ %g1 + 0x270 ] return _Thread_Dispatch_disable_level; 2017e60: c2 00 62 70 ld [ %g1 + 0x270 ], %g1 * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2017e64: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2017e68: 80 a0 60 01 cmp %g1, 1 2017e6c: 02 80 00 2d be 2017f20 <_Timer_server_Schedule_operation_method+0xf0> 2017e70: 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 ) { 2017e74: 02 80 00 04 be 2017e84 <_Timer_server_Schedule_operation_method+0x54> 2017e78: 01 00 00 00 nop if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2017e7c: 40 00 0e a0 call 201b8fc <_Thread_Enable_dispatch> 2017e80: 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 ); 2017e84: 7f ff dd 4d call 200f3b8 2017e88: 01 00 00 00 nop 2017e8c: b8 10 00 08 mov %o0, %i4 2017e90: 03 00 80 f2 sethi %hi(0x203c800), %g1 2017e94: d0 18 63 00 ldd [ %g1 + 0x300 ], %o0 ! 203cb00 <_TOD_Now> 2017e98: 94 10 20 00 clr %o2 2017e9c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017ea0: 40 00 51 8e call 202c4d8 <__divdi3> 2017ea4: 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; 2017ea8: c2 06 20 68 ld [ %i0 + 0x68 ], %g1 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2017eac: 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 ); 2017eb0: 86 06 20 6c add %i0, 0x6c, %g3 if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017eb4: 80 a0 40 03 cmp %g1, %g3 2017eb8: 02 80 00 0c be 2017ee8 <_Timer_server_Schedule_operation_method+0xb8> 2017ebc: 80 a2 40 02 cmp %o1, %g2 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2017ec0: c8 00 60 10 ld [ %g1 + 0x10 ], %g4 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2017ec4: 86 01 00 02 add %g4, %g2, %g3 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; if ( snapshot > last_snapshot ) { 2017ec8: 08 80 00 07 bleu 2017ee4 <_Timer_server_Schedule_operation_method+0xb4> 2017ecc: 86 20 c0 09 sub %g3, %o1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2017ed0: 84 22 40 02 sub %o1, %g2, %g2 if (delta_interval > delta) { 2017ed4: 80 a1 00 02 cmp %g4, %g2 2017ed8: 08 80 00 03 bleu 2017ee4 <_Timer_server_Schedule_operation_method+0xb4><== NEVER TAKEN 2017edc: 86 10 20 00 clr %g3 delta_interval -= delta; 2017ee0: 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; 2017ee4: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2017ee8: d2 26 20 74 st %o1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2017eec: 7f ff dd 37 call 200f3c8 2017ef0: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017ef4: 90 06 20 68 add %i0, 0x68, %o0 2017ef8: 40 00 12 9e call 201c970 <_Watchdog_Insert> 2017efc: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017f00: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017f04: 80 a0 60 00 cmp %g1, 0 2017f08: 12 bf ff dd bne 2017e7c <_Timer_server_Schedule_operation_method+0x4c> 2017f0c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2017f10: 7f ff ff 2f call 2017bcc <_Timer_server_Reset_tod_system_watchdog> 2017f14: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2017f18: 40 00 0e 79 call 201b8fc <_Thread_Enable_dispatch> 2017f1c: 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 ); 2017f20: 7f ff dd 26 call 200f3b8 2017f24: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2017f28: 05 00 80 f2 sethi %hi(0x203c800), %g2 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2017f2c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2017f30: c4 00 a3 80 ld [ %g2 + 0x380 ], %g2 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2017f34: 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 ); 2017f38: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2017f3c: 80 a0 40 03 cmp %g1, %g3 2017f40: 02 80 00 08 be 2017f60 <_Timer_server_Schedule_operation_method+0x130> 2017f44: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2017f48: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 if (delta_interval > delta) { 2017f4c: 80 a1 00 1c cmp %g4, %i4 2017f50: 1a 80 00 03 bcc 2017f5c <_Timer_server_Schedule_operation_method+0x12c> 2017f54: 86 10 20 00 clr %g3 delta_interval -= delta; 2017f58: 86 27 00 04 sub %i4, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2017f5c: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2017f60: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2017f64: 7f ff dd 19 call 200f3c8 2017f68: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2017f6c: 90 06 20 30 add %i0, 0x30, %o0 2017f70: 40 00 12 80 call 201c970 <_Watchdog_Insert> 2017f74: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017f78: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017f7c: 80 a0 60 00 cmp %g1, 0 2017f80: 12 bf ff bf bne 2017e7c <_Timer_server_Schedule_operation_method+0x4c> 2017f84: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2017f88: 7f ff fe fd call 2017b7c <_Timer_server_Reset_interval_system_watchdog> 2017f8c: 90 10 00 18 mov %i0, %o0 if ( !ts->active ) { _Timer_server_Reset_tod_system_watchdog( ts ); } } _Thread_Enable_dispatch(); 2017f90: 40 00 0e 5b call 201b8fc <_Thread_Enable_dispatch> 2017f94: 81 e8 00 00 restore =============================================================================== 0200d184 <_Timespec_Add_to>: uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { 200d184: 9d e3 bf a0 save %sp, -96, %sp 200d188: 82 10 00 18 mov %i0, %g1 uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d18c: c6 06 00 00 ld [ %i0 ], %g3 time->tv_nsec += add->tv_nsec; 200d190: c8 00 60 04 ld [ %g1 + 4 ], %g4 uint32_t _Timespec_Add_to( struct timespec *time, const struct timespec *add ) { uint32_t seconds = add->tv_sec; 200d194: f0 06 40 00 ld [ %i1 ], %i0 /* Add the basics */ time->tv_sec += add->tv_sec; time->tv_nsec += add->tv_nsec; 200d198: c4 06 60 04 ld [ %i1 + 4 ], %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d19c: 86 00 c0 18 add %g3, %i0, %g3 time->tv_nsec += add->tv_nsec; 200d1a0: 84 01 00 02 add %g4, %g2, %g2 ) { uint32_t seconds = add->tv_sec; /* Add the basics */ time->tv_sec += add->tv_sec; 200d1a4: c6 20 40 00 st %g3, [ %g1 ] time->tv_nsec += add->tv_nsec; /* Now adjust it so nanoseconds is in range */ while ( time->tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 200d1a8: 09 0e e6 b2 sethi %hi(0x3b9ac800), %g4 200d1ac: 88 11 21 ff or %g4, 0x1ff, %g4 ! 3b9ac9ff 200d1b0: 80 a0 80 04 cmp %g2, %g4 200d1b4: 08 80 00 0b bleu 200d1e0 <_Timespec_Add_to+0x5c> <== ALWAYS TAKEN 200d1b8: c4 20 60 04 st %g2, [ %g1 + 4 ] time->tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 200d1bc: 1f 31 19 4d sethi %hi(0xc4653400), %o7 <== NOT EXECUTED 200d1c0: 9e 13 e2 00 or %o7, 0x200, %o7 ! c4653600 <== NOT EXECUTED 200d1c4: 84 00 80 0f add %g2, %o7, %g2 <== NOT EXECUTED time->tv_sec++; 200d1c8: 86 00 e0 01 inc %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 ) { 200d1cc: 80 a0 80 04 cmp %g2, %g4 <== NOT EXECUTED 200d1d0: 18 bf ff fd bgu 200d1c4 <_Timespec_Add_to+0x40> <== NOT EXECUTED 200d1d4: b0 06 20 01 inc %i0 <== NOT EXECUTED 200d1d8: c4 20 60 04 st %g2, [ %g1 + 4 ] <== NOT EXECUTED 200d1dc: c6 20 40 00 st %g3, [ %g1 ] <== NOT EXECUTED time->tv_sec++; seconds++; } return seconds; } 200d1e0: 81 c7 e0 08 ret 200d1e4: 81 e8 00 00 restore =============================================================================== 0200acb8 <_Timespec_Divide>: const struct timespec *lhs, const struct timespec *rhs, uint32_t *ival_percentage, uint32_t *fval_percentage ) { 200acb8: 9d e3 bf 88 save %sp, -120, %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; 200acbc: da 06 40 00 ld [ %i1 ], %o5 right += rhs->tv_nsec; 200acc0: ea 06 60 04 ld [ %i1 + 4 ], %l5 * 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; 200acc4: 99 3b 60 1f sra %o5, 0x1f, %o4 200acc8: 83 2b 20 03 sll %o4, 3, %g1 200accc: 87 2b 60 03 sll %o5, 3, %g3 200acd0: 89 33 60 1d srl %o5, 0x1d, %g4 200acd4: 84 11 00 01 or %g4, %g1, %g2 200acd8: 83 30 e0 1b srl %g3, 0x1b, %g1 200acdc: 95 28 a0 05 sll %g2, 5, %o2 200ace0: 97 28 e0 05 sll %g3, 5, %o3 200ace4: 94 10 40 0a or %g1, %o2, %o2 200ace8: 96 a2 c0 03 subcc %o3, %g3, %o3 200acec: 83 32 e0 1a srl %o3, 0x1a, %g1 200acf0: 94 62 80 02 subx %o2, %g2, %o2 200acf4: 93 2a e0 06 sll %o3, 6, %o1 200acf8: 91 2a a0 06 sll %o2, 6, %o0 200acfc: 96 a2 40 0b subcc %o1, %o3, %o3 200ad00: 90 10 40 08 or %g1, %o0, %o0 200ad04: 94 62 00 0a subx %o0, %o2, %o2 200ad08: 96 82 c0 0d addcc %o3, %o5, %o3 200ad0c: 83 32 e0 1e srl %o3, 0x1e, %g1 200ad10: 94 42 80 0c addx %o2, %o4, %o2 200ad14: bb 2a e0 02 sll %o3, 2, %i5 200ad18: b9 2a a0 02 sll %o2, 2, %i4 200ad1c: 96 82 c0 1d addcc %o3, %i5, %o3 200ad20: b8 10 40 1c or %g1, %i4, %i4 200ad24: 83 32 e0 1e srl %o3, 0x1e, %g1 200ad28: 94 42 80 1c addx %o2, %i4, %o2 200ad2c: a3 2a e0 02 sll %o3, 2, %l1 200ad30: a1 2a a0 02 sll %o2, 2, %l0 200ad34: 96 82 c0 11 addcc %o3, %l1, %o3 200ad38: a0 10 40 10 or %g1, %l0, %l0 200ad3c: 83 32 e0 1e srl %o3, 0x1e, %g1 200ad40: 94 42 80 10 addx %o2, %l0, %o2 200ad44: a7 2a e0 02 sll %o3, 2, %l3 200ad48: a5 2a a0 02 sll %o2, 2, %l2 200ad4c: 96 82 c0 13 addcc %o3, %l3, %o3 200ad50: a4 10 40 12 or %g1, %l2, %l2 200ad54: 83 2a e0 09 sll %o3, 9, %g1 200ad58: 94 42 80 12 addx %o2, %l2, %o2 200ad5c: 87 32 e0 17 srl %o3, 0x17, %g3 200ad60: 85 2a a0 09 sll %o2, 9, %g2 right += rhs->tv_nsec; 200ad64: 96 80 40 15 addcc %g1, %l5, %o3 200ad68: a9 3d 60 1f sra %l5, 0x1f, %l4 * 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; 200ad6c: 94 10 c0 02 or %g3, %g2, %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; 200ad70: c8 06 00 00 ld [ %i0 ], %g4 left += lhs->tv_nsec; right = rhs->tv_sec * (uint64_t)TOD_NANOSECONDS_PER_SECOND; right += rhs->tv_nsec; 200ad74: 94 42 80 14 addx %o2, %l4, %o2 if ( right == 0 ) { 200ad78: 80 92 80 0b orcc %o2, %o3, %g0 200ad7c: 02 80 00 64 be 200af0c <_Timespec_Divide+0x254> <== ALWAYS TAKEN 200ad80: c2 06 20 04 ld [ %i0 + 4 ], %g1 /* * 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; 200ad84: c2 27 bf ec st %g1, [ %fp + -20 ] <== NOT EXECUTED 200ad88: 83 38 60 1f sra %g1, 0x1f, %g1 <== 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; 200ad8c: 9f 31 20 1d srl %g4, 0x1d, %o7 <== NOT EXECUTED 200ad90: ba 10 00 04 mov %g4, %i5 <== NOT EXECUTED 200ad94: b9 39 20 1f sra %g4, 0x1f, %i4 <== NOT EXECUTED 200ad98: 9b 2f 60 03 sll %i5, 3, %o5 <== NOT EXECUTED 200ad9c: 89 2f 20 03 sll %i4, 3, %g4 <== NOT EXECUTED left += lhs->tv_nsec; 200ada0: c2 27 bf e8 st %g1, [ %fp + -24 ] <== 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; 200ada4: 87 2b 60 05 sll %o5, 5, %g3 <== NOT EXECUTED 200ada8: 86 a0 c0 0d subcc %g3, %o5, %g3 <== NOT EXECUTED 200adac: 83 30 e0 1a srl %g3, 0x1a, %g1 <== NOT EXECUTED 200adb0: 98 13 c0 04 or %o7, %g4, %o4 <== NOT EXECUTED 200adb4: 93 28 e0 06 sll %g3, 6, %o1 <== NOT EXECUTED 200adb8: 89 33 60 1b srl %o5, 0x1b, %g4 <== NOT EXECUTED 200adbc: 85 2b 20 05 sll %o4, 5, %g2 <== NOT EXECUTED 200adc0: 84 11 00 02 or %g4, %g2, %g2 <== NOT EXECUTED 200adc4: 84 60 80 0c subx %g2, %o4, %g2 <== NOT EXECUTED 200adc8: 86 a2 40 03 subcc %o1, %g3, %g3 <== NOT EXECUTED 200adcc: 91 28 a0 06 sll %g2, 6, %o0 <== NOT EXECUTED 200add0: 90 10 40 08 or %g1, %o0, %o0 <== NOT EXECUTED 200add4: 84 62 00 02 subx %o0, %g2, %g2 <== NOT EXECUTED 200add8: 86 80 c0 1d addcc %g3, %i5, %g3 <== NOT EXECUTED 200addc: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200ade0: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED 200ade4: a3 28 e0 02 sll %g3, 2, %l1 <== NOT EXECUTED 200ade8: a1 28 a0 02 sll %g2, 2, %l0 <== NOT EXECUTED 200adec: 86 80 c0 11 addcc %g3, %l1, %g3 <== NOT EXECUTED 200adf0: a0 10 40 10 or %g1, %l0, %l0 <== NOT EXECUTED 200adf4: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200adf8: 84 40 80 10 addx %g2, %l0, %g2 <== NOT EXECUTED 200adfc: a7 28 e0 02 sll %g3, 2, %l3 <== NOT EXECUTED 200ae00: a5 28 a0 02 sll %g2, 2, %l2 <== NOT EXECUTED 200ae04: 86 80 c0 13 addcc %g3, %l3, %g3 <== NOT EXECUTED 200ae08: a4 10 40 12 or %g1, %l2, %l2 <== NOT EXECUTED 200ae0c: b3 28 e0 02 sll %g3, 2, %i1 <== NOT EXECUTED 200ae10: 84 40 80 12 addx %g2, %l2, %g2 <== NOT EXECUTED 200ae14: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200ae18: b1 28 a0 02 sll %g2, 2, %i0 <== NOT EXECUTED 200ae1c: 86 80 c0 19 addcc %g3, %i1, %g3 <== NOT EXECUTED 200ae20: b0 10 40 18 or %g1, %i0, %i0 <== NOT EXECUTED 200ae24: b9 30 e0 17 srl %g3, 0x17, %i4 <== NOT EXECUTED 200ae28: 84 40 80 18 addx %g2, %i0, %g2 <== NOT EXECUTED 200ae2c: 89 28 a0 09 sll %g2, 9, %g4 <== NOT EXECUTED 200ae30: 84 17 00 04 or %i4, %g4, %g2 <== NOT EXECUTED left += lhs->tv_nsec; 200ae34: f8 1f bf e8 ldd [ %fp + -24 ], %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; 200ae38: 83 28 e0 09 sll %g3, 9, %g1 <== NOT EXECUTED left += lhs->tv_nsec; 200ae3c: 9a 80 40 1d addcc %g1, %i5, %o5 <== NOT EXECUTED 200ae40: 98 40 80 1c addx %g2, %i4, %o4 <== NOT EXECUTED * Put it back in the timespec result. * * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; 200ae44: 85 33 60 1e srl %o5, 0x1e, %g2 <== NOT EXECUTED 200ae48: 83 2b 20 02 sll %o4, 2, %g1 <== NOT EXECUTED 200ae4c: af 2b 60 02 sll %o5, 2, %l7 <== NOT EXECUTED 200ae50: ac 10 80 01 or %g2, %g1, %l6 <== NOT EXECUTED 200ae54: ab 2d e0 05 sll %l7, 5, %l5 <== NOT EXECUTED 200ae58: 83 35 e0 1b srl %l7, 0x1b, %g1 <== NOT EXECUTED 200ae5c: 86 a5 40 17 subcc %l5, %l7, %g3 <== NOT EXECUTED 200ae60: a9 2d a0 05 sll %l6, 5, %l4 <== NOT EXECUTED 200ae64: a8 10 40 14 or %g1, %l4, %l4 <== NOT EXECUTED 200ae68: 84 65 00 16 subx %l4, %l6, %g2 <== NOT EXECUTED 200ae6c: 86 80 c0 0d addcc %g3, %o5, %g3 <== NOT EXECUTED 200ae70: 84 40 80 0c addx %g2, %o4, %g2 <== NOT EXECUTED 200ae74: b9 28 e0 02 sll %g3, 2, %i4 <== NOT EXECUTED 200ae78: bb 28 a0 02 sll %g2, 2, %i5 <== NOT EXECUTED 200ae7c: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200ae80: f8 27 bf fc st %i4, [ %fp + -4 ] <== NOT EXECUTED 200ae84: 88 10 40 1d or %g1, %i5, %g4 <== NOT EXECUTED 200ae88: c8 27 bf f8 st %g4, [ %fp + -8 ] <== NOT EXECUTED 200ae8c: f8 1f bf f8 ldd [ %fp + -8 ], %i4 <== NOT EXECUTED 200ae90: 86 80 c0 1d addcc %g3, %i5, %g3 <== NOT EXECUTED 200ae94: 84 40 80 1c addx %g2, %i4, %g2 <== NOT EXECUTED 200ae98: b9 28 e0 02 sll %g3, 2, %i4 <== NOT EXECUTED 200ae9c: bb 28 a0 02 sll %g2, 2, %i5 <== NOT EXECUTED 200aea0: 83 30 e0 1e srl %g3, 0x1e, %g1 <== NOT EXECUTED 200aea4: f8 27 bf f4 st %i4, [ %fp + -12 ] <== NOT EXECUTED 200aea8: 88 10 40 1d or %g1, %i5, %g4 <== NOT EXECUTED 200aeac: c8 27 bf f0 st %g4, [ %fp + -16 ] <== NOT EXECUTED 200aeb0: f8 1f bf f0 ldd [ %fp + -16 ], %i4 <== NOT EXECUTED 200aeb4: 92 80 c0 1d addcc %g3, %i5, %o1 <== NOT EXECUTED 200aeb8: 90 40 80 1c addx %g2, %i4, %o0 <== NOT EXECUTED 200aebc: 87 32 60 1b srl %o1, 0x1b, %g3 <== NOT EXECUTED 200aec0: 83 2a 60 05 sll %o1, 5, %g1 <== NOT EXECUTED 200aec4: 85 2a 20 05 sll %o0, 5, %g2 <== NOT EXECUTED 200aec8: 92 10 00 01 mov %g1, %o1 <== NOT EXECUTED 200aecc: 40 00 3b e5 call 2019e60 <__udivdi3> <== NOT EXECUTED 200aed0: 90 10 c0 02 or %g3, %g2, %o0 <== NOT EXECUTED *ival_percentage = answer / 1000; 200aed4: 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; 200aed8: b0 10 00 08 mov %o0, %i0 <== NOT EXECUTED 200aedc: b8 10 00 09 mov %o1, %i4 <== NOT EXECUTED *ival_percentage = answer / 1000; 200aee0: 40 00 3b e0 call 2019e60 <__udivdi3> <== NOT EXECUTED 200aee4: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED *fval_percentage = answer % 1000; 200aee8: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED * TODO: Rounding on the last digit of the fval. */ answer = (left * 100000) / right; *ival_percentage = answer / 1000; 200aeec: d2 26 80 00 st %o1, [ %i2 ] <== NOT EXECUTED *fval_percentage = answer % 1000; 200aef0: 94 10 20 00 clr %o2 <== NOT EXECUTED 200aef4: 96 10 23 e8 mov 0x3e8, %o3 <== NOT EXECUTED 200aef8: 40 00 3c af call 201a1b4 <__umoddi3> <== NOT EXECUTED 200aefc: 92 10 00 1c mov %i4, %o1 <== NOT EXECUTED 200af00: d2 26 c0 00 st %o1, [ %i3 ] <== NOT EXECUTED 200af04: 81 c7 e0 08 ret <== NOT EXECUTED 200af08: 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; 200af0c: c0 26 80 00 clr [ %i2 ] *fval_percentage = 0; 200af10: c0 26 c0 00 clr [ %i3 ] return; 200af14: 81 c7 e0 08 ret 200af18: 81 e8 00 00 restore =============================================================================== 0200cc38 <_Timestamp64_Divide>: const Timestamp64_Control *_lhs, const Timestamp64_Control *_rhs, uint32_t *_ival_percentage, uint32_t *_fval_percentage ) { 200cc38: 9d e3 bf a0 save %sp, -96, %sp Timestamp64_Control answer; if ( *_rhs == 0 ) { 200cc3c: d4 1e 40 00 ldd [ %i1 ], %o2 200cc40: 80 92 80 0b orcc %o2, %o3, %g0 200cc44: 22 80 00 2f be,a 200cd00 <_Timestamp64_Divide+0xc8> <== NEVER TAKEN 200cc48: 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; 200cc4c: f8 1e 00 00 ldd [ %i0 ], %i4 200cc50: 83 2f 20 02 sll %i4, 2, %g1 200cc54: 9b 2f 60 02 sll %i5, 2, %o5 200cc58: 89 37 60 1e srl %i5, 0x1e, %g4 200cc5c: 98 11 00 01 or %g4, %g1, %o4 200cc60: 83 33 60 1b srl %o5, 0x1b, %g1 200cc64: 85 2b 20 05 sll %o4, 5, %g2 200cc68: 87 2b 60 05 sll %o5, 5, %g3 200cc6c: 84 10 40 02 or %g1, %g2, %g2 200cc70: 86 a0 c0 0d subcc %g3, %o5, %g3 200cc74: 84 60 80 0c subx %g2, %o4, %g2 200cc78: 86 80 c0 1d addcc %g3, %i5, %g3 200cc7c: 83 30 e0 1e srl %g3, 0x1e, %g1 200cc80: 84 40 80 1c addx %g2, %i4, %g2 200cc84: 93 28 e0 02 sll %g3, 2, %o1 200cc88: 91 28 a0 02 sll %g2, 2, %o0 200cc8c: 86 80 c0 09 addcc %g3, %o1, %g3 200cc90: 90 10 40 08 or %g1, %o0, %o0 200cc94: 83 30 e0 1e srl %g3, 0x1e, %g1 200cc98: 84 40 80 08 addx %g2, %o0, %g2 200cc9c: b3 28 e0 02 sll %g3, 2, %i1 200cca0: b1 28 a0 02 sll %g2, 2, %i0 200cca4: 92 80 c0 19 addcc %g3, %i1, %o1 200cca8: b0 10 40 18 or %g1, %i0, %i0 200ccac: 87 32 60 1b srl %o1, 0x1b, %g3 200ccb0: 90 40 80 18 addx %g2, %i0, %o0 200ccb4: 83 2a 60 05 sll %o1, 5, %g1 200ccb8: 85 2a 20 05 sll %o0, 5, %g2 200ccbc: 92 10 00 01 mov %g1, %o1 200ccc0: 40 00 3b 9b call 201bb2c <__divdi3> 200ccc4: 90 10 c0 02 or %g3, %g2, %o0 *_ival_percentage = answer / 1000; 200ccc8: 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; 200cccc: b0 10 00 08 mov %o0, %i0 200ccd0: b8 10 00 09 mov %o1, %i4 *_ival_percentage = answer / 1000; 200ccd4: 40 00 3b 96 call 201bb2c <__divdi3> 200ccd8: 96 10 23 e8 mov 0x3e8, %o3 *_fval_percentage = answer % 1000; 200ccdc: 90 10 00 18 mov %i0, %o0 * TODO: Rounding on the last digit of the fval. */ answer = (*_lhs * 100000) / *_rhs; *_ival_percentage = answer / 1000; 200cce0: d2 26 80 00 st %o1, [ %i2 ] *_fval_percentage = answer % 1000; 200cce4: 94 10 20 00 clr %o2 200cce8: 96 10 23 e8 mov 0x3e8, %o3 200ccec: 40 00 3c 76 call 201bec4 <__moddi3> 200ccf0: 92 10 00 1c mov %i4, %o1 200ccf4: d2 26 c0 00 st %o1, [ %i3 ] 200ccf8: 81 c7 e0 08 ret 200ccfc: 81 e8 00 00 restore { Timestamp64_Control answer; if ( *_rhs == 0 ) { *_ival_percentage = 0; *_fval_percentage = 0; 200cd00: c0 26 c0 00 clr [ %i3 ] <== NOT EXECUTED return; 200cd04: 81 c7 e0 08 ret <== NOT EXECUTED 200cd08: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 0200b4a0 <_User_extensions_Fatal>: void _User_extensions_Fatal ( Internal_errors_Source the_source, bool is_internal, Internal_errors_t the_error ) { 200b4a0: 9d e3 bf a0 save %sp, -96, %sp 200b4a4: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b4a8: b8 17 20 18 or %i4, 0x18, %i4 ! 201ec18 <_User_extensions_List> 200b4ac: 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 ); 200b4b0: 80 a7 40 1c cmp %i5, %i4 200b4b4: 02 80 00 0d be 200b4e8 <_User_extensions_Fatal+0x48> <== NEVER TAKEN 200b4b8: 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 ) 200b4bc: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b4c0: 80 a0 60 00 cmp %g1, 0 200b4c4: 02 80 00 05 be 200b4d8 <_User_extensions_Fatal+0x38> 200b4c8: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.fatal)( the_source, is_internal, the_error ); 200b4cc: 92 10 00 19 mov %i1, %o1 200b4d0: 9f c0 40 00 call %g1 200b4d4: 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 ) { 200b4d8: 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 ); 200b4dc: 80 a7 40 1c cmp %i5, %i4 200b4e0: 32 bf ff f8 bne,a 200b4c0 <_User_extensions_Fatal+0x20> 200b4e4: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 200b4e8: 81 c7 e0 08 ret 200b4ec: 81 e8 00 00 restore =============================================================================== 0200b34c <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200b34c: 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; 200b350: 07 00 80 77 sethi %hi(0x201dc00), %g3 200b354: 86 10 e0 4c or %g3, 0x4c, %g3 ! 201dc4c initial_extensions = Configuration.User_extension_table; 200b358: f6 00 e0 44 ld [ %g3 + 0x44 ], %i3 200b35c: 3b 00 80 7b sethi %hi(0x201ec00), %i5 200b360: 09 00 80 7a sethi %hi(0x201e800), %g4 200b364: 84 17 60 18 or %i5, 0x18, %g2 200b368: 82 11 22 34 or %g4, 0x234, %g1 200b36c: b4 00 a0 04 add %g2, 4, %i2 200b370: b8 00 60 04 add %g1, 4, %i4 200b374: f4 27 60 18 st %i2, [ %i5 + 0x18 ] head->previous = NULL; 200b378: c0 20 a0 04 clr [ %g2 + 4 ] tail->previous = head; 200b37c: 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; 200b380: f8 21 22 34 st %i4, [ %g4 + 0x234 ] head->previous = NULL; 200b384: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200b388: c2 20 60 08 st %g1, [ %g1 + 8 ] _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200b38c: 80 a6 e0 00 cmp %i3, 0 200b390: 02 80 00 1b be 200b3fc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b394: f4 00 e0 40 ld [ %g3 + 0x40 ], %i2 extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 200b398: 83 2e a0 02 sll %i2, 2, %g1 200b39c: b9 2e a0 04 sll %i2, 4, %i4 200b3a0: b8 27 00 01 sub %i4, %g1, %i4 200b3a4: b8 07 00 1a add %i4, %i2, %i4 200b3a8: 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 *) 200b3ac: 40 00 01 9c call 200ba1c <_Workspace_Allocate_or_fatal_error> 200b3b0: 90 10 00 1c mov %i4, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b3b4: 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 *) 200b3b8: ba 10 00 08 mov %o0, %i5 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 200b3bc: 40 00 17 33 call 2011088 200b3c0: 94 10 00 1c mov %i4, %o2 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 200b3c4: 80 a6 a0 00 cmp %i2, 0 200b3c8: 02 80 00 0d be 200b3fc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 200b3cc: 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; 200b3d0: 92 10 00 1b mov %i3, %o1 200b3d4: 94 10 20 20 mov 0x20, %o2 200b3d8: 40 00 16 f0 call 2010f98 200b3dc: 90 07 60 14 add %i5, 0x14, %o0 _User_extensions_Add_set( extension ); 200b3e0: 40 00 0d 7e call 200e9d8 <_User_extensions_Add_set> 200b3e4: 90 10 00 1d mov %i5, %o0 200b3e8: b8 07 20 01 inc %i4 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 200b3ec: 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++ ) { 200b3f0: 80 a7 00 1a cmp %i4, %i2 200b3f4: 12 bf ff f7 bne 200b3d0 <_User_extensions_Handler_initialization+0x84> 200b3f8: b6 06 e0 20 add %i3, 0x20, %i3 200b3fc: 81 c7 e0 08 ret 200b400: 81 e8 00 00 restore =============================================================================== 0200b404 <_User_extensions_Thread_begin>: #include void _User_extensions_Thread_begin ( Thread_Control *executing ) { 200b404: 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; 200b408: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b40c: fa 07 20 18 ld [ %i4 + 0x18 ], %i5 ! 201ec18 <_User_extensions_List> 200b410: b8 17 20 18 or %i4, 0x18, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b414: b8 07 20 04 add %i4, 4, %i4 200b418: 80 a7 40 1c cmp %i5, %i4 200b41c: 02 80 00 0c be 200b44c <_User_extensions_Thread_begin+0x48><== NEVER TAKEN 200b420: 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 ) 200b424: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b428: 80 a0 60 00 cmp %g1, 0 200b42c: 02 80 00 04 be 200b43c <_User_extensions_Thread_begin+0x38> 200b430: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_begin)( executing ); 200b434: 9f c0 40 00 call %g1 200b438: 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 ) { 200b43c: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b440: 80 a7 40 1c cmp %i5, %i4 200b444: 32 bf ff f9 bne,a 200b428 <_User_extensions_Thread_begin+0x24> 200b448: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 200b44c: 81 c7 e0 08 ret 200b450: 81 e8 00 00 restore =============================================================================== 0200b4f0 <_User_extensions_Thread_create>: #include bool _User_extensions_Thread_create ( Thread_Control *the_thread ) { 200b4f0: 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; 200b4f4: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b4f8: fa 07 20 18 ld [ %i4 + 0x18 ], %i5 ! 201ec18 <_User_extensions_List> 200b4fc: b8 17 20 18 or %i4, 0x18, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); 200b500: b8 07 20 04 add %i4, 4, %i4 200b504: 80 a7 40 1c cmp %i5, %i4 200b508: 02 80 00 12 be 200b550 <_User_extensions_Thread_create+0x60><== NEVER TAKEN 200b50c: 82 10 20 01 mov 1, %g1 the_node = the_node->next ) { the_extension = (User_extensions_Control *) the_node; if ( the_extension->Callouts.thread_create != NULL ) { status = (*the_extension->Callouts.thread_create)( 200b510: 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 ) { 200b514: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 200b518: 80 a0 60 00 cmp %g1, 0 200b51c: 02 80 00 08 be 200b53c <_User_extensions_Thread_create+0x4c> 200b520: 84 16 e3 70 or %i3, 0x370, %g2 status = (*the_extension->Callouts.thread_create)( 200b524: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b528: 9f c0 40 00 call %g1 200b52c: 92 10 00 18 mov %i0, %o1 _Thread_Executing, the_thread ); if ( !status ) 200b530: 80 8a 20 ff btst 0xff, %o0 200b534: 02 80 00 0a be 200b55c <_User_extensions_Thread_create+0x6c> 200b538: 82 10 20 00 clr %g1 User_extensions_Control *the_extension; bool status; for ( the_node = _Chain_First( &_User_extensions_List ); !_Chain_Is_tail( &_User_extensions_List, the_node ) ; the_node = the_node->next ) { 200b53c: 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 ); 200b540: 80 a7 40 1c cmp %i5, %i4 200b544: 32 bf ff f5 bne,a 200b518 <_User_extensions_Thread_create+0x28> 200b548: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 if ( !status ) return false; } } return true; 200b54c: 82 10 20 01 mov 1, %g1 } 200b550: b0 08 60 01 and %g1, 1, %i0 200b554: 81 c7 e0 08 ret 200b558: 81 e8 00 00 restore 200b55c: b0 08 60 01 and %g1, 1, %i0 200b560: 81 c7 e0 08 ret 200b564: 81 e8 00 00 restore =============================================================================== 0200b568 <_User_extensions_Thread_delete>: #include void _User_extensions_Thread_delete ( Thread_Control *the_thread ) { 200b568: 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; 200b56c: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b570: b8 17 20 18 or %i4, 0x18, %i4 ! 201ec18 <_User_extensions_List> 200b574: 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 ); 200b578: 80 a7 40 1c cmp %i5, %i4 200b57c: 02 80 00 0d be 200b5b0 <_User_extensions_Thread_delete+0x48><== NEVER TAKEN 200b580: 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 ) 200b584: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b588: 80 a0 60 00 cmp %g1, 0 200b58c: 02 80 00 05 be 200b5a0 <_User_extensions_Thread_delete+0x38> 200b590: 84 16 e3 70 or %i3, 0x370, %g2 (*the_extension->Callouts.thread_delete)( 200b594: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b598: 9f c0 40 00 call %g1 200b59c: 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 ) { 200b5a0: 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 ); 200b5a4: 80 a7 40 1c cmp %i5, %i4 200b5a8: 32 bf ff f8 bne,a 200b588 <_User_extensions_Thread_delete+0x20> 200b5ac: c2 07 60 20 ld [ %i5 + 0x20 ], %g1 200b5b0: 81 c7 e0 08 ret 200b5b4: 81 e8 00 00 restore =============================================================================== 0200b454 <_User_extensions_Thread_exitted>: } void _User_extensions_Thread_exitted ( Thread_Control *executing ) { 200b454: 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; 200b458: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b45c: b8 17 20 18 or %i4, 0x18, %i4 ! 201ec18 <_User_extensions_List> 200b460: 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 ); 200b464: 80 a7 40 1c cmp %i5, %i4 200b468: 02 80 00 0c be 200b498 <_User_extensions_Thread_exitted+0x44><== NEVER TAKEN 200b46c: 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 ) 200b470: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b474: 80 a0 60 00 cmp %g1, 0 200b478: 02 80 00 04 be 200b488 <_User_extensions_Thread_exitted+0x34> 200b47c: 90 10 00 18 mov %i0, %o0 (*the_extension->Callouts.thread_exitted)( executing ); 200b480: 9f c0 40 00 call %g1 200b484: 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 ) { 200b488: 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 ); 200b48c: 80 a7 40 1c cmp %i5, %i4 200b490: 32 bf ff f9 bne,a 200b474 <_User_extensions_Thread_exitted+0x20> 200b494: c2 07 60 2c ld [ %i5 + 0x2c ], %g1 200b498: 81 c7 e0 08 ret 200b49c: 81 e8 00 00 restore =============================================================================== 0200bdf8 <_User_extensions_Thread_restart>: #include void _User_extensions_Thread_restart ( Thread_Control *the_thread ) { 200bdf8: 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; 200bdfc: 39 00 80 7d sethi %hi(0x201f400), %i4 200be00: fa 07 23 38 ld [ %i4 + 0x338 ], %i5 ! 201f738 <_User_extensions_List> 200be04: b8 17 23 38 or %i4, 0x338, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200be08: b8 07 20 04 add %i4, 4, %i4 200be0c: 80 a7 40 1c cmp %i5, %i4 200be10: 02 80 00 0d be 200be44 <_User_extensions_Thread_restart+0x4c><== NEVER TAKEN 200be14: 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 ) 200be18: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200be1c: 80 a0 60 00 cmp %g1, 0 200be20: 02 80 00 05 be 200be34 <_User_extensions_Thread_restart+0x3c> 200be24: 84 16 e2 90 or %i3, 0x290, %g2 (*the_extension->Callouts.thread_restart)( 200be28: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200be2c: 9f c0 40 00 call %g1 200be30: 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 ) { 200be34: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200be38: 80 a7 40 1c cmp %i5, %i4 200be3c: 32 bf ff f8 bne,a 200be1c <_User_extensions_Thread_restart+0x24> 200be40: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 200be44: 81 c7 e0 08 ret 200be48: 81 e8 00 00 restore =============================================================================== 0200b5b8 <_User_extensions_Thread_start>: #include void _User_extensions_Thread_start ( Thread_Control *the_thread ) { 200b5b8: 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; 200b5bc: 39 00 80 7b sethi %hi(0x201ec00), %i4 200b5c0: fa 07 20 18 ld [ %i4 + 0x18 ], %i5 ! 201ec18 <_User_extensions_List> 200b5c4: b8 17 20 18 or %i4, 0x18, %i4 Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b5c8: b8 07 20 04 add %i4, 4, %i4 200b5cc: 80 a7 40 1c cmp %i5, %i4 200b5d0: 02 80 00 0d be 200b604 <_User_extensions_Thread_start+0x4c><== NEVER TAKEN 200b5d4: 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 ) 200b5d8: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b5dc: 80 a0 60 00 cmp %g1, 0 200b5e0: 02 80 00 05 be 200b5f4 <_User_extensions_Thread_start+0x3c> 200b5e4: 84 16 e3 70 or %i3, 0x370, %g2 (*the_extension->Callouts.thread_start)( 200b5e8: d0 00 a0 0c ld [ %g2 + 0xc ], %o0 200b5ec: 9f c0 40 00 call %g1 200b5f0: 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 ) { 200b5f4: fa 07 40 00 ld [ %i5 ], %i5 ) { Chain_Node *the_node; User_extensions_Control *the_extension; for ( the_node = _Chain_First( &_User_extensions_List ); 200b5f8: 80 a7 40 1c cmp %i5, %i4 200b5fc: 32 bf ff f8 bne,a 200b5dc <_User_extensions_Thread_start+0x24> 200b600: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 200b604: 81 c7 e0 08 ret 200b608: 81 e8 00 00 restore =============================================================================== 0200b60c <_User_extensions_Thread_switch>: void _User_extensions_Thread_switch ( Thread_Control *executing, Thread_Control *heir ) { 200b60c: 9d e3 bf a0 save %sp, -96, %sp 200b610: 39 00 80 7a sethi %hi(0x201e800), %i4 200b614: fa 07 22 34 ld [ %i4 + 0x234 ], %i5 ! 201ea34 <_User_extensions_Switches_list> 200b618: b8 17 22 34 or %i4, 0x234, %i4 Chain_Node *the_node; User_extensions_Switch_control *the_extension_switch; for ( the_node = _Chain_First( &_User_extensions_Switches_list ); 200b61c: b8 07 20 04 add %i4, 4, %i4 200b620: 80 a7 40 1c cmp %i5, %i4 200b624: 02 80 00 0a be 200b64c <_User_extensions_Thread_switch+0x40><== NEVER TAKEN 200b628: 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 ); 200b62c: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b630: 90 10 00 18 mov %i0, %o0 200b634: 9f c0 40 00 call %g1 200b638: 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 ) { 200b63c: 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 ); 200b640: 80 a7 40 1c cmp %i5, %i4 200b644: 32 bf ff fb bne,a 200b630 <_User_extensions_Thread_switch+0x24> 200b648: c2 07 60 08 ld [ %i5 + 8 ], %g1 200b64c: 81 c7 e0 08 ret 200b650: 81 e8 00 00 restore =============================================================================== 0200d054 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200d054: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200d058: 7f ff d8 eb call 2003404 200d05c: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200d060: 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 ); 200d064: b6 06 20 04 add %i0, 4, %i3 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200d068: 80 a0 40 1b cmp %g1, %i3 200d06c: 02 80 00 1e be 200d0e4 <_Watchdog_Adjust+0x90> 200d070: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200d074: 12 80 00 1e bne 200d0ec <_Watchdog_Adjust+0x98> 200d078: 80 a6 60 01 cmp %i1, 1 case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200d07c: 80 a6 a0 00 cmp %i2, 0 200d080: 02 80 00 19 be 200d0e4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200d084: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d088: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200d08c: 80 a6 80 1c cmp %i2, %i4 200d090: 1a 80 00 0a bcc 200d0b8 <_Watchdog_Adjust+0x64> <== ALWAYS TAKEN 200d094: b2 10 20 01 mov 1, %i1 _Watchdog_First( header )->delta_interval -= units; 200d098: 10 80 00 1c b 200d108 <_Watchdog_Adjust+0xb4> <== NOT EXECUTED 200d09c: b8 27 00 1a sub %i4, %i2, %i4 <== NOT EXECUTED switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200d0a0: 02 80 00 11 be 200d0e4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200d0a4: 01 00 00 00 nop if ( units < _Watchdog_First( header )->delta_interval ) { 200d0a8: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 200d0ac: 80 a7 00 1a cmp %i4, %i2 200d0b0: 38 80 00 16 bgu,a 200d108 <_Watchdog_Adjust+0xb4> 200d0b4: b8 27 00 1a sub %i4, %i2, %i4 _Watchdog_First( header )->delta_interval -= units; break; } else { units -= _Watchdog_First( header )->delta_interval; _Watchdog_First( header )->delta_interval = 1; 200d0b8: f2 20 60 10 st %i1, [ %g1 + 0x10 ] _ISR_Enable( level ); 200d0bc: 7f ff d8 d6 call 2003414 200d0c0: 01 00 00 00 nop _Watchdog_Tickle( header ); 200d0c4: 40 00 00 ab call 200d370 <_Watchdog_Tickle> 200d0c8: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200d0cc: 7f ff d8 ce call 2003404 200d0d0: 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; 200d0d4: c2 07 40 00 ld [ %i5 ], %g1 if ( _Chain_Is_empty( header ) ) 200d0d8: 80 a6 c0 01 cmp %i3, %g1 200d0dc: 32 bf ff f1 bne,a 200d0a0 <_Watchdog_Adjust+0x4c> 200d0e0: b4 a6 80 1c subcc %i2, %i4, %i2 } break; } } _ISR_Enable( level ); 200d0e4: 7f ff d8 cc call 2003414 200d0e8: 91 e8 00 08 restore %g0, %o0, %o0 * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { switch ( direction ) { 200d0ec: 12 bf ff fe bne 200d0e4 <_Watchdog_Adjust+0x90> <== NEVER TAKEN 200d0f0: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200d0f4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200d0f8: b4 00 80 1a add %g2, %i2, %i2 200d0fc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } break; } } _ISR_Enable( level ); 200d100: 7f ff d8 c5 call 2003414 200d104: 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; 200d108: 10 bf ff f7 b 200d0e4 <_Watchdog_Adjust+0x90> 200d10c: f8 20 60 10 st %i4, [ %g1 + 0x10 ] =============================================================================== 0200b7dc <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 200b7dc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 200b7e0: 7f ff db b6 call 20026b8 200b7e4: 01 00 00 00 nop previous_state = the_watchdog->state; 200b7e8: fa 06 20 08 ld [ %i0 + 8 ], %i5 switch ( previous_state ) { 200b7ec: 80 a7 60 01 cmp %i5, 1 200b7f0: 02 80 00 2a be 200b898 <_Watchdog_Remove+0xbc> 200b7f4: 03 00 80 7a sethi %hi(0x201e800), %g1 200b7f8: 1a 80 00 09 bcc 200b81c <_Watchdog_Remove+0x40> 200b7fc: 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; 200b800: 03 00 80 7a sethi %hi(0x201e800), %g1 200b804: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 ! 201eb40 <_Watchdog_Ticks_since_boot> 200b808: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b80c: 7f ff db af call 20026c8 200b810: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b814: 81 c7 e0 08 ret 200b818: 81 e8 00 00 restore Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); previous_state = the_watchdog->state; switch ( previous_state ) { 200b81c: 18 bf ff fa bgu 200b804 <_Watchdog_Remove+0x28> <== NEVER TAKEN 200b820: 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 ); 200b824: c2 06 00 00 ld [ %i0 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 200b828: c0 26 20 08 clr [ %i0 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 200b82c: c4 00 40 00 ld [ %g1 ], %g2 200b830: 80 a0 a0 00 cmp %g2, 0 200b834: 02 80 00 07 be 200b850 <_Watchdog_Remove+0x74> 200b838: 05 00 80 7a sethi %hi(0x201e800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 200b83c: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200b840: c4 06 20 10 ld [ %i0 + 0x10 ], %g2 200b844: 84 00 c0 02 add %g3, %g2, %g2 200b848: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 200b84c: 05 00 80 7a sethi %hi(0x201e800), %g2 200b850: c4 00 a3 3c ld [ %g2 + 0x33c ], %g2 ! 201eb3c <_Watchdog_Sync_count> 200b854: 80 a0 a0 00 cmp %g2, 0 200b858: 22 80 00 07 be,a 200b874 <_Watchdog_Remove+0x98> 200b85c: c4 06 20 04 ld [ %i0 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 200b860: 05 00 80 7b sethi %hi(0x201ec00), %g2 200b864: c6 00 a3 78 ld [ %g2 + 0x378 ], %g3 ! 201ef78 <_Per_CPU_Information+0x8> 200b868: 05 00 80 7a sethi %hi(0x201e800), %g2 200b86c: c6 20 a2 dc st %g3, [ %g2 + 0x2dc ] ! 201eadc <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 200b870: c4 06 20 04 ld [ %i0 + 4 ], %g2 next->previous = previous; 200b874: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 200b878: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 200b87c: 03 00 80 7a sethi %hi(0x201e800), %g1 200b880: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 ! 201eb40 <_Watchdog_Ticks_since_boot> 200b884: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b888: 7f ff db 90 call 20026c8 200b88c: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b890: 81 c7 e0 08 ret 200b894: 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; 200b898: c2 00 63 40 ld [ %g1 + 0x340 ], %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; 200b89c: 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; 200b8a0: c2 26 20 18 st %g1, [ %i0 + 0x18 ] _ISR_Enable( level ); 200b8a4: 7f ff db 89 call 20026c8 200b8a8: b0 10 00 1d mov %i5, %i0 return( previous_state ); } 200b8ac: 81 c7 e0 08 ret 200b8b0: 81 e8 00 00 restore =============================================================================== 0200c9f4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200c9f4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200c9f8: 7f ff d9 64 call 2002f88 200c9fc: 01 00 00 00 nop 200ca00: ba 10 00 08 mov %o0, %i5 printk( "Watchdog Chain: %s %p\n", name, header ); 200ca04: 11 00 80 79 sethi %hi(0x201e400), %o0 200ca08: 94 10 00 19 mov %i1, %o2 200ca0c: 92 10 00 18 mov %i0, %o1 200ca10: 7f ff e1 78 call 2004ff0 200ca14: 90 12 23 70 or %o0, 0x370, %o0 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200ca18: f8 06 40 00 ld [ %i1 ], %i4 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 200ca1c: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200ca20: 80 a7 00 19 cmp %i4, %i1 200ca24: 02 80 00 0f be 200ca60 <_Watchdog_Report_chain+0x6c> 200ca28: 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 ); 200ca2c: 92 10 00 1c mov %i4, %o1 200ca30: 40 00 00 0f call 200ca6c <_Watchdog_Report> 200ca34: 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 ) 200ca38: f8 07 00 00 ld [ %i4 ], %i4 Chain_Node *node; _ISR_Disable( level ); printk( "Watchdog Chain: %s %p\n", name, header ); if ( !_Chain_Is_empty( header ) ) { for ( node = _Chain_First( header ) ; 200ca3c: 80 a7 00 19 cmp %i4, %i1 200ca40: 12 bf ff fc bne 200ca30 <_Watchdog_Report_chain+0x3c> <== NEVER TAKEN 200ca44: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200ca48: 11 00 80 79 sethi %hi(0x201e400), %o0 200ca4c: 92 10 00 18 mov %i0, %o1 200ca50: 7f ff e1 68 call 2004ff0 200ca54: 90 12 23 88 or %o0, 0x388, %o0 } else { printk( "Chain is empty\n" ); } _ISR_Enable( level ); 200ca58: 7f ff d9 50 call 2002f98 200ca5c: 91 e8 00 1d restore %g0, %i5, %o0 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200ca60: 7f ff e1 64 call 2004ff0 200ca64: 90 12 23 98 or %o0, 0x398, %o0 200ca68: 30 bf ff fc b,a 200ca58 <_Watchdog_Report_chain+0x64> =============================================================================== 02007b38 : int adjtime( const struct timeval *delta, struct timeval *olddelta ) { 2007b38: 9d e3 bf 98 save %sp, -104, %sp long adjustment; /* * Simple validations */ if ( !delta ) 2007b3c: ba 96 20 00 orcc %i0, 0, %i5 2007b40: 02 80 00 89 be 2007d64 2007b44: 03 00 03 d0 sethi %hi(0xf4000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) 2007b48: c4 07 60 04 ld [ %i5 + 4 ], %g2 2007b4c: 82 10 62 3f or %g1, 0x23f, %g1 2007b50: 80 a0 80 01 cmp %g2, %g1 2007b54: 18 80 00 84 bgu 2007d64 2007b58: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { 2007b5c: 22 80 00 06 be,a 2007b74 2007b60: c2 07 40 00 ld [ %i5 ], %g1 olddelta->tv_sec = 0; olddelta->tv_usec = 0; 2007b64: c0 26 60 04 clr [ %i1 + 4 ] 2007b68: c4 07 60 04 ld [ %i5 + 4 ], %g2 if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( olddelta ) { olddelta->tv_sec = 0; 2007b6c: c0 26 40 00 clr [ %i1 ] olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007b70: c2 07 40 00 ld [ %i5 ], %g1 adjustment += delta->tv_usec; /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007b74: 07 00 80 82 sethi %hi(0x2020800), %g3 2007b78: c8 00 e0 5c ld [ %g3 + 0x5c ], %g4 ! 202085c olddelta->tv_sec = 0; olddelta->tv_usec = 0; } /* convert delta to microseconds */ adjustment = (delta->tv_sec * TOD_MICROSECONDS_PER_SECOND); 2007b7c: b5 28 60 08 sll %g1, 8, %i2 2007b80: 87 28 60 03 sll %g1, 3, %g3 2007b84: 86 26 80 03 sub %i2, %g3, %g3 2007b88: b5 28 e0 06 sll %g3, 6, %i2 2007b8c: 86 26 80 03 sub %i2, %g3, %g3 2007b90: 82 00 c0 01 add %g3, %g1, %g1 2007b94: 83 28 60 06 sll %g1, 6, %g1 adjustment += delta->tv_usec; 2007b98: 84 00 40 02 add %g1, %g2, %g2 /* too small to account for */ if ( adjustment < rtems_configuration_get_microseconds_per_tick() ) 2007b9c: 80 a0 80 04 cmp %g2, %g4 2007ba0: 0a 80 00 6f bcs 2007d5c 2007ba4: b0 10 20 00 clr %i0 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007ba8: 03 00 80 85 sethi %hi(0x2021400), %g1 2007bac: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 2021770 <_Thread_Dispatch_disable_level> 2007bb0: 84 00 a0 01 inc %g2 2007bb4: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2007bb8: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007bbc: 40 00 07 08 call 20097dc <_TOD_Get_as_timestamp> 2007bc0: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007bc4: f4 1f bf f8 ldd [ %fp + -8 ], %i2 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007bc8: 94 10 20 00 clr %o2 2007bcc: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007bd0: 90 10 00 1a mov %i2, %o0 2007bd4: 96 12 e2 00 or %o3, 0x200, %o3 2007bd8: 40 00 52 0a call 201c400 <__divdi3> 2007bdc: 92 10 00 1b mov %i3, %o1 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; 2007be0: e0 07 40 00 ld [ %i5 ], %l0 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007be4: 94 10 20 00 clr %o2 2007be8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007bec: a0 04 00 09 add %l0, %o1, %l0 2007bf0: 96 12 e2 00 or %o3, 0x200, %o3 2007bf4: 90 10 00 1a mov %i2, %o0 2007bf8: 40 00 52 e8 call 201c798 <__moddi3> 2007bfc: 92 10 00 1b mov %i3, %o1 ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007c00: c2 07 60 04 ld [ %i5 + 4 ], %g1 2007c04: 87 28 60 07 sll %g1, 7, %g3 2007c08: 85 28 60 02 sll %g1, 2, %g2 2007c0c: 84 20 c0 02 sub %g3, %g2, %g2 2007c10: 82 00 80 01 add %g2, %g1, %g1 2007c14: 83 28 60 03 sll %g1, 3, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007c18: 05 0e e6 b2 sethi %hi(0x3b9ac800), %g2 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007c1c: 92 02 40 01 add %o1, %g1, %o1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007c20: 84 10 a1 ff or %g2, 0x1ff, %g2 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007c24: 07 31 19 4d sethi %hi(0xc4653400), %g3 _Thread_Disable_dispatch(); _TOD_Get( &ts ); ts.tv_sec += delta->tv_sec; ts.tv_nsec += delta->tv_usec * TOD_NANOSECONDS_PER_MICROSECOND; 2007c28: 82 10 00 09 mov %o1, %g1 /* if adjustment is too much positive */ while ( ts.tv_nsec >= TOD_NANOSECONDS_PER_SECOND ) { 2007c2c: 80 a2 40 02 cmp %o1, %g2 2007c30: 08 80 00 07 bleu 2007c4c 2007c34: 86 10 e2 00 or %g3, 0x200, %g3 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; 2007c38: 92 02 40 03 add %o1, %g3, %o1 ts.tv_sec++; 2007c3c: a0 04 20 01 inc %l0 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 ) { 2007c40: 80 a2 40 02 cmp %o1, %g2 2007c44: 18 bf ff fd bgu 2007c38 <== NEVER TAKEN 2007c48: 82 10 00 09 mov %o1, %g1 ts.tv_nsec -= TOD_NANOSECONDS_PER_SECOND; ts.tv_sec++; } /* if adjustment is too much negative */ while ( ts.tv_nsec <= (-1 * TOD_NANOSECONDS_PER_SECOND) ) { 2007c4c: 07 31 19 4d sethi %hi(0xc4653400), %g3 2007c50: 86 10 e2 00 or %g3, 0x200, %g3 ! c4653600 2007c54: 80 a2 40 03 cmp %o1, %g3 2007c58: 18 80 00 08 bgu 2007c78 <== NEVER TAKEN 2007c5c: 05 0e e6 b2 sethi %hi(0x3b9ac800), %g2 ts.tv_nsec += TOD_NANOSECONDS_PER_SECOND; 2007c60: 84 10 a2 00 or %g2, 0x200, %g2 ! 3b9aca00 2007c64: 92 02 40 02 add %o1, %g2, %o1 ts.tv_sec--; 2007c68: a0 04 3f ff add %l0, -1, %l0 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) ) { 2007c6c: 80 a2 40 03 cmp %o1, %g3 2007c70: 08 bf ff fd bleu 2007c64 2007c74: 82 10 00 09 mov %o1, %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 2007c78: 99 3c 20 1f sra %l0, 0x1f, %o4 2007c7c: ae 10 00 01 mov %g1, %l7 2007c80: ad 38 60 1f sra %g1, 0x1f, %l6 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 2007c84: 83 2b 20 03 sll %o4, 3, %g1 2007c88: b7 2c 20 03 sll %l0, 3, %i3 2007c8c: 89 34 20 1d srl %l0, 0x1d, %g4 2007c90: b4 11 00 01 or %g4, %g1, %i2 2007c94: 83 36 e0 1b srl %i3, 0x1b, %g1 2007c98: 85 2e a0 05 sll %i2, 5, %g2 2007c9c: 87 2e e0 05 sll %i3, 5, %g3 2007ca0: 84 10 40 02 or %g1, %g2, %g2 2007ca4: 86 a0 c0 1b subcc %g3, %i3, %g3 2007ca8: 83 30 e0 1a srl %g3, 0x1a, %g1 2007cac: 84 60 80 1a subx %g2, %i2, %g2 2007cb0: 97 28 e0 06 sll %g3, 6, %o3 2007cb4: 95 28 a0 06 sll %g2, 6, %o2 2007cb8: 86 a2 c0 03 subcc %o3, %g3, %g3 2007cbc: 94 10 40 0a or %g1, %o2, %o2 2007cc0: 84 62 80 02 subx %o2, %g2, %g2 2007cc4: 86 80 c0 10 addcc %g3, %l0, %g3 2007cc8: 83 30 e0 1e srl %g3, 0x1e, %g1 2007ccc: 84 40 80 0c addx %g2, %o4, %g2 2007cd0: a3 28 e0 02 sll %g3, 2, %l1 2007cd4: a1 28 a0 02 sll %g2, 2, %l0 2007cd8: 86 80 c0 11 addcc %g3, %l1, %g3 2007cdc: a0 10 40 10 or %g1, %l0, %l0 2007ce0: 83 30 e0 1e srl %g3, 0x1e, %g1 2007ce4: 84 40 80 10 addx %g2, %l0, %g2 2007ce8: a7 28 e0 02 sll %g3, 2, %l3 2007cec: a5 28 a0 02 sll %g2, 2, %l2 2007cf0: 86 80 c0 13 addcc %g3, %l3, %g3 2007cf4: a4 10 40 12 or %g1, %l2, %l2 2007cf8: ab 28 e0 02 sll %g3, 2, %l5 2007cfc: 84 40 80 12 addx %g2, %l2, %g2 2007d00: 83 30 e0 1e srl %g3, 0x1e, %g1 2007d04: a9 28 a0 02 sll %g2, 2, %l4 2007d08: 86 80 c0 15 addcc %g3, %l5, %g3 2007d0c: a8 10 40 14 or %g1, %l4, %l4 2007d10: 84 40 80 14 addx %g2, %l4, %g2 2007d14: 83 28 e0 09 sll %g3, 9, %g1 2007d18: 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 ); 2007d1c: 90 07 bf f8 add %fp, -8, %o0 2007d20: b5 30 e0 17 srl %g3, 0x17, %i2 2007d24: 86 85 c0 01 addcc %l7, %g1, %g3 2007d28: 84 16 80 04 or %i2, %g4, %g2 2007d2c: 84 45 80 02 addx %l6, %g2, %g2 2007d30: 40 00 06 c8 call 2009850 <_TOD_Set_with_timestamp> 2007d34: c4 3f bf f8 std %g2, [ %fp + -8 ] ts.tv_sec--; } _TOD_Set( &ts ); _Thread_Enable_dispatch(); 2007d38: 40 00 0d 8b call 200b364 <_Thread_Enable_dispatch> 2007d3c: b0 10 20 00 clr %i0 /* set the user's output */ if ( olddelta ) 2007d40: 80 a6 60 00 cmp %i1, 0 2007d44: 02 80 00 0c be 2007d74 2007d48: 01 00 00 00 nop *olddelta = *delta; 2007d4c: c2 07 40 00 ld [ %i5 ], %g1 2007d50: c2 26 40 00 st %g1, [ %i1 ] 2007d54: c2 07 60 04 ld [ %i5 + 4 ], %g1 2007d58: c2 26 60 04 st %g1, [ %i1 + 4 ] return 0; } 2007d5c: 81 c7 e0 08 ret 2007d60: 81 e8 00 00 restore */ if ( !delta ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( delta->tv_usec >= TOD_MICROSECONDS_PER_SECOND ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007d64: 40 00 25 50 call 20112a4 <__errno> 2007d68: b0 10 3f ff mov -1, %i0 2007d6c: 82 10 20 16 mov 0x16, %g1 2007d70: c2 22 00 00 st %g1, [ %o0 ] 2007d74: 81 c7 e0 08 ret 2007d78: 81 e8 00 00 restore =============================================================================== 02007dcc : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 2007dcc: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2007dd0: 3b 00 80 83 sethi %hi(0x2020c00), %i5 2007dd4: 40 00 04 92 call 200901c 2007dd8: 90 17 63 94 or %i5, 0x394, %o0 ! 2020f94 if (fcntl (fildes, F_GETFD) < 0) { 2007ddc: 90 10 00 18 mov %i0, %o0 2007de0: 40 00 1c 4f call 200ef1c 2007de4: 92 10 20 01 mov 1, %o1 2007de8: 80 a2 20 00 cmp %o0, 0 2007dec: 06 80 00 6c bl 2007f9c 2007df0: 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) { 2007df4: 02 80 00 3b be 2007ee0 2007df8: 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) { 2007dfc: f8 06 40 00 ld [ %i1 ], %i4 2007e00: 80 a7 00 18 cmp %i4, %i0 2007e04: 12 80 00 2f bne 2007ec0 2007e08: 90 17 63 94 or %i5, 0x394, %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); 2007e0c: 92 10 00 1c mov %i4, %o1 2007e10: 11 00 80 83 sethi %hi(0x2020c00), %o0 2007e14: 94 10 20 00 clr %o2 2007e18: 40 00 01 92 call 2008460 2007e1c: 90 12 23 dc or %o0, 0x3dc, %o0 if (r_chain == NULL) { 2007e20: b0 92 20 00 orcc %o0, 0, %i0 2007e24: 22 80 00 0f be,a 2007e60 2007e28: ba 17 63 94 or %i5, 0x394, %i5 return AIO_ALLDONE; } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007e2c: b8 06 20 1c add %i0, 0x1c, %i4 2007e30: 40 00 04 7b call 200901c 2007e34: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2007e38: 92 10 00 19 mov %i1, %o1 2007e3c: 40 00 01 d6 call 2008594 2007e40: 90 06 20 08 add %i0, 8, %o0 2007e44: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2007e48: 40 00 04 95 call 200909c 2007e4c: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007e50: 40 00 04 93 call 200909c 2007e54: 90 17 63 94 or %i5, 0x394, %o0 return result; } return AIO_ALLDONE; } 2007e58: 81 c7 e0 08 ret 2007e5c: 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)) { 2007e60: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2007e64: 82 07 60 58 add %i5, 0x58, %g1 2007e68: 80 a0 80 01 cmp %g2, %g1 2007e6c: 02 80 00 0f be 2007ea8 <== NEVER TAKEN 2007e70: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007e74: 92 10 00 1c mov %i4, %o1 2007e78: 40 00 01 7a call 2008460 2007e7c: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007e80: 80 a2 20 00 cmp %o0, 0 2007e84: 02 80 00 0e be 2007ebc 2007e88: 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); 2007e8c: 40 00 01 c2 call 2008594 2007e90: 90 02 20 08 add %o0, 8, %o0 2007e94: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007e98: 40 00 04 81 call 200909c 2007e9c: 90 10 00 1d mov %i5, %o0 return result; 2007ea0: 81 c7 e0 08 ret 2007ea4: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2007ea8: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2007eac: 40 00 04 7c call 200909c 2007eb0: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2007eb4: 81 c7 e0 08 ret 2007eb8: 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); 2007ebc: 90 10 00 1d mov %i5, %o0 2007ec0: 40 00 04 77 call 200909c 2007ec4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one (EINVAL); 2007ec8: 40 00 2a f7 call 2012aa4 <__errno> 2007ecc: 01 00 00 00 nop 2007ed0: 82 10 20 16 mov 0x16, %g1 ! 16 2007ed4: c2 22 00 00 st %g1, [ %o0 ] 2007ed8: 81 c7 e0 08 ret 2007edc: 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); 2007ee0: 11 00 80 83 sethi %hi(0x2020c00), %o0 2007ee4: 94 10 20 00 clr %o2 2007ee8: 40 00 01 5e call 2008460 2007eec: 90 12 23 dc or %o0, 0x3dc, %o0 if (r_chain == NULL) { 2007ef0: b8 92 20 00 orcc %o0, 0, %i4 2007ef4: 02 80 00 0f be 2007f30 2007ef8: b2 07 20 1c add %i4, 0x1c, %i1 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2007efc: 40 00 04 48 call 200901c 2007f00: 90 10 00 19 mov %i1, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2007f04: 40 00 0b 20 call 200ab84 <_Chain_Extract> 2007f08: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007f0c: 40 00 01 8e call 2008544 2007f10: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007f14: 40 00 04 62 call 200909c 2007f18: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2007f1c: 90 17 63 94 or %i5, 0x394, %o0 2007f20: 40 00 04 5f call 200909c 2007f24: b0 10 20 00 clr %i0 return AIO_CANCELED; 2007f28: 81 c7 e0 08 ret 2007f2c: 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; 2007f30: ba 17 63 94 or %i5, 0x394, %i5 r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); if (r_chain == NULL) { AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2007f34: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 2007f38: 82 07 60 58 add %i5, 0x58, %g1 2007f3c: 80 a0 80 01 cmp %g2, %g1 2007f40: 02 bf ff da be 2007ea8 <== NEVER TAKEN 2007f44: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 2007f48: 92 10 00 18 mov %i0, %o1 2007f4c: 40 00 01 45 call 2008460 2007f50: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2007f54: b8 92 20 00 orcc %o0, 0, %i4 2007f58: 22 bf ff d5 be,a 2007eac 2007f5c: 90 10 00 1d mov %i5, %o0 2007f60: 40 00 0b 09 call 200ab84 <_Chain_Extract> 2007f64: b2 07 20 1c add %i4, 0x1c, %i1 } AIO_printf ("Request chain on [IQ]\n"); rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2007f68: 40 00 01 77 call 2008544 2007f6c: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2007f70: 40 00 03 80 call 2008d70 2007f74: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 2007f78: 40 00 02 9f call 20089f4 2007f7c: 90 10 00 19 mov %i1, %o0 free (r_chain); 2007f80: 7f ff ef 7e call 2003d78 2007f84: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return AIO_CANCELED; 2007f88: 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); 2007f8c: 40 00 04 44 call 200909c 2007f90: 90 10 00 1d mov %i5, %o0 return AIO_CANCELED; 2007f94: 81 c7 e0 08 ret 2007f98: 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); 2007f9c: 40 00 04 40 call 200909c 2007fa0: 90 17 63 94 or %i5, 0x394, %o0 rtems_set_errno_and_return_minus_one (EBADF); 2007fa4: 40 00 2a c0 call 2012aa4 <__errno> 2007fa8: b0 10 3f ff mov -1, %i0 2007fac: 82 10 20 09 mov 9, %g1 2007fb0: c2 22 00 00 st %g1, [ %o0 ] 2007fb4: 81 c7 e0 08 ret 2007fb8: 81 e8 00 00 restore =============================================================================== 02007fc4 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2007fc4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2007fc8: 03 00 00 08 sethi %hi(0x2000), %g1 2007fcc: 80 a6 00 01 cmp %i0, %g1 2007fd0: 12 80 00 14 bne 2008020 2007fd4: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007fd8: d0 06 40 00 ld [ %i1 ], %o0 2007fdc: 40 00 1b d0 call 200ef1c 2007fe0: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007fe4: 90 0a 20 03 and %o0, 3, %o0 2007fe8: 90 02 3f ff add %o0, -1, %o0 2007fec: 80 a2 20 01 cmp %o0, 1 2007ff0: 18 80 00 0c bgu 2008020 2007ff4: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007ff8: 7f ff f0 c0 call 20042f8 2007ffc: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008000: 80 a2 20 00 cmp %o0, 0 2008004: 02 80 00 06 be 200801c <== NEVER TAKEN 2008008: 82 10 20 03 mov 3, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 200800c: f2 22 20 14 st %i1, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_SYNC; 2008010: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2008014: 40 00 01 7c call 2008604 2008018: 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); 200801c: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2008020: 82 10 3f ff mov -1, %g1 2008024: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2008028: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 200802c: 40 00 2a 9e call 2012aa4 <__errno> 2008030: b0 10 3f ff mov -1, %i0 2008034: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2008038: 81 c7 e0 08 ret 200803c: 81 e8 00 00 restore =============================================================================== 020087e8 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20087e8: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20087ec: d0 06 00 00 ld [ %i0 ], %o0 20087f0: 40 00 19 cb call 200ef1c 20087f4: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20087f8: 90 0a 20 03 and %o0, 3, %o0 20087fc: 80 a2 20 02 cmp %o0, 2 2008800: 12 80 00 1b bne 200886c 2008804: 80 a2 20 00 cmp %o0, 0 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2008808: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200880c: 80 a0 60 00 cmp %g1, 0 2008810: 12 80 00 0f bne 200884c 2008814: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2008818: c2 06 20 08 ld [ %i0 + 8 ], %g1 200881c: 80 a0 60 00 cmp %g1, 0 2008820: 06 80 00 0c bl 2008850 2008824: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2008828: 7f ff ee b4 call 20042f8 200882c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2008830: 80 a2 20 00 cmp %o0, 0 2008834: 02 80 00 12 be 200887c <== NEVER TAKEN 2008838: 82 10 20 01 mov 1, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 200883c: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_READ; 2008840: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2008844: 7f ff ff 70 call 2008604 2008848: 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); 200884c: 82 10 3f ff mov -1, %g1 2008850: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2008854: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2008858: 40 00 28 93 call 2012aa4 <__errno> 200885c: b0 10 3f ff mov -1, %i0 2008860: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2008864: 81 c7 e0 08 ret 2008868: 81 e8 00 00 restore { rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 200886c: 02 bf ff e7 be 2008808 <== NEVER TAKEN 2008870: ba 10 20 09 mov 9, %i5 if (aiocbp->aio_offset < 0) rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2008874: 10 bf ff f7 b 2008850 2008878: 82 10 3f ff mov -1, %g1 200887c: 10 bf ff f4 b 200884c <== NOT EXECUTED 2008880: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED =============================================================================== 0200888c : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 200888c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2008890: d0 06 00 00 ld [ %i0 ], %o0 2008894: 40 00 19 a2 call 200ef1c 2008898: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 200889c: 90 0a 20 03 and %o0, 3, %o0 20088a0: 90 02 3f ff add %o0, -1, %o0 20088a4: 80 a2 20 01 cmp %o0, 1 20088a8: 18 80 00 14 bgu 20088f8 20088ac: 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) 20088b0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20088b4: 80 a0 60 00 cmp %g1, 0 20088b8: 12 80 00 10 bne 20088f8 20088bc: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20088c0: c2 06 20 08 ld [ %i0 + 8 ], %g1 20088c4: 80 a0 60 00 cmp %g1, 0 20088c8: 06 80 00 0d bl 20088fc 20088cc: 82 10 3f ff mov -1, %g1 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20088d0: 7f ff ee 8a call 20042f8 20088d4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20088d8: 80 a2 20 00 cmp %o0, 0 20088dc: 02 80 00 06 be 20088f4 <== NEVER TAKEN 20088e0: 82 10 20 02 mov 2, %g1 rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; 20088e4: f0 22 20 14 st %i0, [ %o0 + 0x14 ] req->aiocbp->aio_lio_opcode = LIO_WRITE; 20088e8: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20088ec: 7f ff ff 46 call 2008604 20088f0: 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); 20088f4: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 20088f8: 82 10 3f ff mov -1, %g1 20088fc: fa 26 20 34 st %i5, [ %i0 + 0x34 ] 2008900: c2 26 20 38 st %g1, [ %i0 + 0x38 ] 2008904: 40 00 28 68 call 2012aa4 <__errno> 2008908: b0 10 3f ff mov -1, %i0 200890c: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2008910: 81 c7 e0 08 ret 2008914: 81 e8 00 00 restore =============================================================================== 020079a0 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 20079a0: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 20079a4: 80 a6 60 00 cmp %i1, 0 20079a8: 02 80 00 2f be 2007a64 20079ac: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 20079b0: 02 80 00 19 be 2007a14 20079b4: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 20079b8: 02 80 00 12 be 2007a00 <== NEVER TAKEN 20079bc: 80 a6 20 02 cmp %i0, 2 return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 20079c0: 02 80 00 10 be 2007a00 20079c4: 80 a6 20 03 cmp %i0, 3 return 0; } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 20079c8: 02 80 00 08 be 20079e8 20079cc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif rtems_set_errno_and_return_minus_one( EINVAL ); 20079d0: 40 00 27 97 call 201182c <__errno> 20079d4: b0 10 3f ff mov -1, %i0 ! ffffffff 20079d8: 82 10 20 16 mov 0x16, %g1 20079dc: c2 22 00 00 st %g1, [ %o0 ] return 0; } 20079e0: 81 c7 e0 08 ret 20079e4: 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 ); 20079e8: 40 00 27 91 call 201182c <__errno> 20079ec: b0 10 3f ff mov -1, %i0 20079f0: 82 10 20 58 mov 0x58, %g1 20079f4: c2 22 00 00 st %g1, [ %o0 ] 20079f8: 81 c7 e0 08 ret 20079fc: 81 e8 00 00 restore } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { _TOD_Get_uptime_as_timespec( tp ); 2007a00: 90 10 00 19 mov %i1, %o0 2007a04: 40 00 08 91 call 2009c48 <_TOD_Get_uptime_as_timespec> 2007a08: b0 10 20 00 clr %i0 return 0; 2007a0c: 81 c7 e0 08 ret 2007a10: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007a14: 40 00 08 7b call 2009c00 <_TOD_Get_as_timestamp> 2007a18: 90 07 bf f8 add %fp, -8, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 2007a1c: 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); 2007a20: 94 10 20 00 clr %o2 2007a24: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a28: 90 10 00 1c mov %i4, %o0 2007a2c: 96 12 e2 00 or %o3, 0x200, %o3 2007a30: 40 00 56 0f call 201d26c <__divdi3> 2007a34: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a38: 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); 2007a3c: d2 26 40 00 st %o1, [ %i1 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007a40: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007a44: 90 10 00 1c mov %i4, %o0 2007a48: 96 12 e2 00 or %o3, 0x200, %o3 2007a4c: 92 10 00 1d mov %i5, %o1 2007a50: 40 00 56 ed call 201d604 <__moddi3> 2007a54: b0 10 20 00 clr %i0 2007a58: d2 26 60 04 st %o1, [ %i1 + 4 ] if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { _TOD_Get(tp); return 0; 2007a5c: 81 c7 e0 08 ret 2007a60: 81 e8 00 00 restore clockid_t clock_id, struct timespec *tp ) { if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007a64: 40 00 27 72 call 201182c <__errno> 2007a68: b0 10 3f ff mov -1, %i0 2007a6c: 82 10 20 16 mov 0x16, %g1 2007a70: c2 22 00 00 st %g1, [ %o0 ] 2007a74: 81 c7 e0 08 ret 2007a78: 81 e8 00 00 restore =============================================================================== 0202cd24 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 202cd24: 9d e3 bf 98 save %sp, -104, %sp if ( !tp ) 202cd28: 80 a6 60 00 cmp %i1, 0 202cd2c: 02 80 00 54 be 202ce7c <== NEVER TAKEN 202cd30: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 202cd34: 02 80 00 0c be 202cd64 202cd38: 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 ) 202cd3c: 02 80 00 4a be 202ce64 202cd40: 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 ) 202cd44: 02 80 00 48 be 202ce64 202cd48: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 202cd4c: 40 00 6d 30 call 204820c <__errno> 202cd50: b0 10 3f ff mov -1, %i0 ! ffffffff 202cd54: 82 10 20 16 mov 0x16, %g1 202cd58: c2 22 00 00 st %g1, [ %o0 ] return 0; } 202cd5c: 81 c7 e0 08 ret 202cd60: 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 ) 202cd64: c4 06 40 00 ld [ %i1 ], %g2 202cd68: 03 08 76 b9 sethi %hi(0x21dae400), %g1 202cd6c: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 202cd70: 80 a0 80 01 cmp %g2, %g1 202cd74: 08 80 00 42 bleu 202ce7c 202cd78: 03 00 81 d5 sethi %hi(0x2075400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 202cd7c: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2075730 <_Thread_Dispatch_disable_level> 202cd80: 84 00 a0 01 inc %g2 202cd84: c4 20 63 30 st %g2, [ %g1 + 0x330 ] return _Thread_Dispatch_disable_level; 202cd88: c2 00 63 30 ld [ %g1 + 0x330 ], %g1 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 202cd8c: d6 06 40 00 ld [ %i1 ], %o3 202cd90: e6 06 60 04 ld [ %i1 + 4 ], %l3 202cd94: 95 3a e0 1f sra %o3, 0x1f, %o2 Timestamp64_Control *_time, Timestamp64_Control _seconds, Timestamp64_Control _nanoseconds ) { *_time = _seconds * 1000000000L + _nanoseconds; 202cd98: 83 2a a0 03 sll %o2, 3, %g1 202cd9c: 9b 2a e0 03 sll %o3, 3, %o5 202cda0: 89 32 e0 1d srl %o3, 0x1d, %g4 202cda4: 98 11 00 01 or %g4, %g1, %o4 202cda8: 83 33 60 1b srl %o5, 0x1b, %g1 202cdac: 85 2b 20 05 sll %o4, 5, %g2 202cdb0: 87 2b 60 05 sll %o5, 5, %g3 202cdb4: 84 10 40 02 or %g1, %g2, %g2 202cdb8: 86 a0 c0 0d subcc %g3, %o5, %g3 202cdbc: 83 30 e0 1a srl %g3, 0x1a, %g1 202cdc0: 84 60 80 0c subx %g2, %o4, %g2 202cdc4: bb 28 e0 06 sll %g3, 6, %i5 202cdc8: b9 28 a0 06 sll %g2, 6, %i4 202cdcc: 86 a7 40 03 subcc %i5, %g3, %g3 202cdd0: b8 10 40 1c or %g1, %i4, %i4 202cdd4: 84 67 00 02 subx %i4, %g2, %g2 202cdd8: 86 80 c0 0b addcc %g3, %o3, %g3 202cddc: 83 30 e0 1e srl %g3, 0x1e, %g1 202cde0: 84 40 80 0a addx %g2, %o2, %g2 202cde4: b7 28 e0 02 sll %g3, 2, %i3 202cde8: b5 28 a0 02 sll %g2, 2, %i2 202cdec: 86 80 c0 1b addcc %g3, %i3, %g3 202cdf0: b4 10 40 1a or %g1, %i2, %i2 202cdf4: 83 30 e0 1e srl %g3, 0x1e, %g1 202cdf8: 84 40 80 1a addx %g2, %i2, %g2 202cdfc: b3 28 e0 02 sll %g3, 2, %i1 202ce00: b1 28 a0 02 sll %g2, 2, %i0 202ce04: 86 80 c0 19 addcc %g3, %i1, %g3 202ce08: b0 10 40 18 or %g1, %i0, %i0 202ce0c: a3 28 e0 02 sll %g3, 2, %l1 202ce10: 84 40 80 18 addx %g2, %i0, %g2 202ce14: 83 30 e0 1e srl %g3, 0x1e, %g1 202ce18: a1 28 a0 02 sll %g2, 2, %l0 202ce1c: 86 80 c0 11 addcc %g3, %l1, %g3 202ce20: a0 10 40 10 or %g1, %l0, %l0 202ce24: 84 40 80 10 addx %g2, %l0, %g2 202ce28: 83 28 e0 09 sll %g3, 9, %g1 202ce2c: 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 ); 202ce30: 90 07 bf f8 add %fp, -8, %o0 202ce34: b9 30 e0 17 srl %g3, 0x17, %i4 const struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _Timestamp_Set( 202ce38: a5 3c e0 1f sra %l3, 0x1f, %l2 202ce3c: 86 84 c0 01 addcc %l3, %g1, %g3 202ce40: 84 17 00 04 or %i4, %g4, %g2 202ce44: 84 44 80 02 addx %l2, %g2, %g2 rtems_set_errno_and_return_minus_one( ENOSYS ); #endif else rtems_set_errno_and_return_minus_one( EINVAL ); return 0; 202ce48: 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 ); 202ce4c: 40 00 06 93 call 202e898 <_TOD_Set_with_timestamp> 202ce50: 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(); 202ce54: 7f ff 8f 39 call 2010b38 <_Thread_Enable_dispatch> 202ce58: 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; 202ce5c: 81 c7 e0 08 ret 202ce60: 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 ); 202ce64: 40 00 6c ea call 204820c <__errno> 202ce68: b0 10 3f ff mov -1, %i0 202ce6c: 82 10 20 58 mov 0x58, %g1 202ce70: c2 22 00 00 st %g1, [ %o0 ] 202ce74: 81 c7 e0 08 ret 202ce78: 81 e8 00 00 restore if ( !tp ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) rtems_set_errno_and_return_minus_one( EINVAL ); 202ce7c: 40 00 6c e4 call 204820c <__errno> 202ce80: b0 10 3f ff mov -1, %i0 202ce84: 82 10 20 16 mov 0x16, %g1 202ce88: c2 22 00 00 st %g1, [ %o0 ] 202ce8c: 81 c7 e0 08 ret 202ce90: 81 e8 00 00 restore =============================================================================== 0201b24c : int killinfo( pid_t pid, int sig, const union sigval *value ) { 201b24c: 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() ) 201b250: 7f ff fe ee call 201ae08 201b254: 01 00 00 00 nop 201b258: 80 a2 00 18 cmp %o0, %i0 201b25c: 12 80 00 af bne 201b518 201b260: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); /* * Validate the signal passed. */ if ( !sig ) 201b264: 02 80 00 b3 be 201b530 201b268: 82 06 7f ff add %i1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201b26c: 80 a0 60 1f cmp %g1, 0x1f 201b270: 18 80 00 b0 bgu 201b530 201b274: b7 2e 60 02 sll %i1, 2, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 201b278: 39 00 80 7b sethi %hi(0x201ec00), %i4 201b27c: a1 2e 60 04 sll %i1, 4, %l0 201b280: b8 17 23 d0 or %i4, 0x3d0, %i4 201b284: 84 24 00 1b sub %l0, %i3, %g2 201b288: 84 07 00 02 add %i4, %g2, %g2 201b28c: c4 00 a0 08 ld [ %g2 + 8 ], %g2 201b290: 80 a0 a0 01 cmp %g2, 1 201b294: 02 80 00 3f be 201b390 201b298: b0 10 20 00 clr %i0 /* * P1003.1c/Draft 10, p. 33 says that certain signals should always * be directed to the executing thread such as those caused by hardware * faults. */ if ( (sig == SIGFPE) || (sig == SIGILL) || (sig == SIGSEGV ) ) 201b29c: 80 a6 60 04 cmp %i1, 4 201b2a0: 02 80 00 3e be 201b398 201b2a4: 80 a6 60 08 cmp %i1, 8 201b2a8: 02 80 00 3c be 201b398 201b2ac: 80 a6 60 0b cmp %i1, 0xb 201b2b0: 02 80 00 3a be 201b398 201b2b4: ba 10 20 01 mov 1, %i5 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201b2b8: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 201b2bc: fa 27 bf f8 st %i5, [ %fp + -8 ] if ( !value ) { 201b2c0: 80 a6 a0 00 cmp %i2, 0 201b2c4: 02 80 00 3b be 201b3b0 201b2c8: bb 2f 40 01 sll %i5, %g1, %i5 siginfo->si_value.sival_int = 0; } else { siginfo->si_value = *value; 201b2cc: c2 06 80 00 ld [ %i2 ], %g1 201b2d0: 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++; 201b2d4: 03 00 80 7a sethi %hi(0x201e800), %g1 201b2d8: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201ea30 <_Thread_Dispatch_disable_level> 201b2dc: 84 00 a0 01 inc %g2 201b2e0: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 201b2e4: c2 00 62 30 ld [ %g1 + 0x230 ], %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; 201b2e8: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b2ec: d0 00 63 7c ld [ %g1 + 0x37c ], %o0 ! 201ef7c <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 201b2f0: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 201b2f4: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201b2f8: 80 af 40 01 andncc %i5, %g1, %g0 201b2fc: 12 80 00 16 bne 201b354 201b300: 07 00 80 7c sethi %hi(0x201f000), %g3 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 201b304: d0 00 e1 5c ld [ %g3 + 0x15c ], %o0 ! 201f15c <_POSIX_signals_Wait_queue> 201b308: 86 10 e1 5c or %g3, 0x15c, %g3 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201b30c: 86 00 e0 04 add %g3, 4, %g3 201b310: 80 a2 00 03 cmp %o0, %g3 201b314: 32 80 00 0d bne,a 201b348 201b318: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201b31c: 10 80 00 27 b 201b3b8 201b320: 03 00 80 77 sethi %hi(0x201dc00), %g1 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 201b324: c2 00 a0 d0 ld [ %g2 + 0xd0 ], %g1 201b328: 80 af 40 01 andncc %i5, %g1, %g0 201b32c: 12 80 00 0b bne 201b358 201b330: 92 10 00 19 mov %i1, %o1 the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); !_Chain_Is_tail( the_chain, the_node ) ; the_node = the_node->next ) { 201b334: d0 02 00 00 ld [ %o0 ], %o0 /* XXX violation of visibility -- need to define thread queue support */ the_chain = &_POSIX_signals_Wait_queue.Queues.Fifo; for ( the_node = _Chain_First( the_chain ); 201b338: 80 a2 00 03 cmp %o0, %g3 201b33c: 02 80 00 1f be 201b3b8 <== ALWAYS TAKEN 201b340: 03 00 80 77 sethi %hi(0x201dc00), %g1 #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 201b344: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 <== NOT EXECUTED 201b348: 80 8f 40 01 btst %i5, %g1 201b34c: 02 bf ff f6 be 201b324 201b350: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201b354: 92 10 00 19 mov %i1, %o1 201b358: 40 00 00 8d call 201b58c <_POSIX_signals_Unblock_thread> 201b35c: 94 07 bf f4 add %fp, -12, %o2 201b360: 80 8a 20 ff btst 0xff, %o0 201b364: 12 80 00 5a bne 201b4cc 201b368: 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 ); 201b36c: 40 00 00 7f call 201b568 <_POSIX_signals_Set_process_signals> 201b370: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201b374: b6 24 00 1b sub %l0, %i3, %i3 201b378: c2 07 00 1b ld [ %i4 + %i3 ], %g1 201b37c: 80 a0 60 02 cmp %g1, 2 201b380: 02 80 00 57 be 201b4dc 201b384: 11 00 80 7c sethi %hi(0x201f000), %o0 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 201b388: 7f ff bd 2f call 200a844 <_Thread_Enable_dispatch> 201b38c: b0 10 20 00 clr %i0 return 0; } 201b390: 81 c7 e0 08 ret 201b394: 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 ); 201b398: 40 00 01 0f call 201b7d4 201b39c: 01 00 00 00 nop 201b3a0: 40 00 00 d2 call 201b6e8 201b3a4: 92 10 00 19 mov %i1, %o1 201b3a8: 81 c7 e0 08 ret 201b3ac: 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; 201b3b0: 10 bf ff c9 b 201b2d4 201b3b4: c0 27 bf fc clr [ %fp + -4 ] * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201b3b8: c8 08 60 94 ldub [ %g1 + 0x94 ], %g4 201b3bc: 1b 00 80 7a sethi %hi(0x201e800), %o5 201b3c0: 88 01 20 01 inc %g4 201b3c4: 9a 13 61 a0 or %o5, 0x1a0, %o5 * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 201b3c8: 90 10 20 00 clr %o0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201b3cc: 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); 201b3d0: 15 04 00 00 sethi %hi(0x10000000), %o2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 201b3d4: c2 03 40 00 ld [ %o5 ], %g1 201b3d8: 80 a0 60 00 cmp %g1, 0 201b3dc: 22 80 00 31 be,a 201b4a0 <== NEVER TAKEN 201b3e0: 9a 03 60 04 add %o5, 4, %o5 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 201b3e4: c2 00 60 04 ld [ %g1 + 4 ], %g1 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 201b3e8: f4 10 60 10 lduh [ %g1 + 0x10 ], %i2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201b3ec: 80 a6 a0 00 cmp %i2, 0 201b3f0: 02 80 00 2b be 201b49c 201b3f4: f0 00 60 1c ld [ %g1 + 0x1c ], %i0 201b3f8: 82 10 20 01 mov 1, %g1 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 201b3fc: 85 28 60 02 sll %g1, 2, %g2 maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { the_thread = (Thread_Control *) object_table[ index ]; 201b400: c4 06 00 02 ld [ %i0 + %g2 ], %g2 if ( !the_thread ) 201b404: 80 a0 a0 00 cmp %g2, 0 201b408: 22 80 00 22 be,a 201b490 201b40c: 82 00 60 01 inc %g1 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 201b410: c6 00 a0 14 ld [ %g2 + 0x14 ], %g3 201b414: 80 a0 c0 04 cmp %g3, %g4 201b418: 38 80 00 1e bgu,a 201b490 201b41c: 82 00 60 01 inc %g1 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201b420: de 00 a1 5c ld [ %g2 + 0x15c ], %o7 201b424: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201b428: 80 af 40 0f andncc %i5, %o7, %g0 201b42c: 22 80 00 19 be,a 201b490 201b430: 82 00 60 01 inc %g1 * * NOTE: We initialized interested_priority to PRIORITY_MAXIMUM + 1 * so we never have to worry about deferencing a NULL * interested thread. */ if ( the_thread->current_priority < interested_priority ) { 201b434: 80 a0 c0 04 cmp %g3, %g4 201b438: 2a 80 00 14 bcs,a 201b488 201b43c: 88 10 00 03 mov %g3, %g4 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 201b440: 80 a2 20 00 cmp %o0, 0 201b444: 22 80 00 13 be,a 201b490 <== NEVER TAKEN 201b448: 82 00 60 01 inc %g1 <== NOT EXECUTED 201b44c: de 02 20 10 ld [ %o0 + 0x10 ], %o7 201b450: 80 a3 e0 00 cmp %o7, 0 201b454: 22 80 00 0f be,a 201b490 <== NEVER TAKEN 201b458: 82 00 60 01 inc %g1 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201b45c: d6 00 a0 10 ld [ %g2 + 0x10 ], %o3 201b460: 80 a2 e0 00 cmp %o3, 0 201b464: 22 80 00 09 be,a 201b488 201b468: 88 10 00 03 mov %g3, %g4 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 201b46c: 80 8b c0 0a btst %o7, %o2 201b470: 32 80 00 08 bne,a 201b490 201b474: 82 00 60 01 inc %g1 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 201b478: 80 8a c0 0a btst %o3, %o2 201b47c: 22 80 00 05 be,a 201b490 201b480: 82 00 60 01 inc %g1 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 201b484: 88 10 00 03 mov %g3, %g4 201b488: 90 10 00 02 mov %g2, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201b48c: 82 00 60 01 inc %g1 201b490: 80 a6 80 01 cmp %i2, %g1 201b494: 1a bf ff db bcc 201b400 201b498: 85 28 60 02 sll %g1, 2, %g2 201b49c: 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++) { 201b4a0: 80 a3 40 0c cmp %o5, %o4 201b4a4: 32 bf ff cd bne,a 201b3d8 201b4a8: c2 03 40 00 ld [ %o5 ], %g1 } } } } if ( interested ) { 201b4ac: 80 a2 20 00 cmp %o0, 0 201b4b0: 02 bf ff af be 201b36c 201b4b4: 92 10 00 19 mov %i1, %o1 /* * Returns true if the signal was synchronously given to a thread * blocked waiting for the signal. */ if ( _POSIX_signals_Unblock_thread( the_thread, sig, siginfo ) ) { 201b4b8: 40 00 00 35 call 201b58c <_POSIX_signals_Unblock_thread> 201b4bc: 94 07 bf f4 add %fp, -12, %o2 201b4c0: 80 8a 20 ff btst 0xff, %o0 201b4c4: 02 bf ff aa be 201b36c <== ALWAYS TAKEN 201b4c8: 01 00 00 00 nop _Thread_Enable_dispatch(); 201b4cc: 7f ff bc de call 200a844 <_Thread_Enable_dispatch> 201b4d0: b0 10 20 00 clr %i0 ! 0 return 0; 201b4d4: 81 c7 e0 08 ret 201b4d8: 81 e8 00 00 restore */ _POSIX_signals_Set_process_signals( mask ); if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { psiginfo = (POSIX_signals_Siginfo_node *) 201b4dc: 7f ff b4 ce call 2008814 <_Chain_Get> 201b4e0: 90 12 21 50 or %o0, 0x150, %o0 _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 201b4e4: 92 92 20 00 orcc %o0, 0, %o1 201b4e8: 02 80 00 18 be 201b548 201b4ec: 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 ); 201b4f0: 11 00 80 7c sethi %hi(0x201f000), %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201b4f4: c2 22 60 08 st %g1, [ %o1 + 8 ] 201b4f8: c2 07 bf f8 ld [ %fp + -8 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201b4fc: 90 12 21 c8 or %o0, 0x1c8, %o0 if ( !psiginfo ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( EAGAIN ); } psiginfo->Info = *siginfo; 201b500: c2 22 60 0c st %g1, [ %o1 + 0xc ] 201b504: c2 07 bf fc ld [ %fp + -4 ], %g1 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 201b508: 90 02 00 1b add %o0, %i3, %o0 201b50c: 7f ff b4 b7 call 20087e8 <_Chain_Append> 201b510: c2 22 60 10 st %g1, [ %o1 + 0x10 ] 201b514: 30 bf ff 9d b,a 201b388 /* * Only supported for the "calling process" (i.e. this node). */ if ( pid != getpid() ) rtems_set_errno_and_return_minus_one( ESRCH ); 201b518: 7f ff d4 44 call 2010628 <__errno> 201b51c: b0 10 3f ff mov -1, %i0 201b520: 82 10 20 03 mov 3, %g1 201b524: c2 22 00 00 st %g1, [ %o0 ] 201b528: 81 c7 e0 08 ret 201b52c: 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 ); 201b530: 7f ff d4 3e call 2010628 <__errno> 201b534: b0 10 3f ff mov -1, %i0 201b538: 82 10 20 16 mov 0x16, %g1 201b53c: c2 22 00 00 st %g1, [ %o0 ] 201b540: 81 c7 e0 08 ret 201b544: 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(); 201b548: 7f ff bc bf call 200a844 <_Thread_Enable_dispatch> 201b54c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 201b550: 7f ff d4 36 call 2010628 <__errno> 201b554: 01 00 00 00 nop 201b558: 82 10 20 0b mov 0xb, %g1 ! b 201b55c: c2 22 00 00 st %g1, [ %o0 ] 201b560: 81 c7 e0 08 ret 201b564: 81 e8 00 00 restore =============================================================================== 02007f20 : int oflag, ... /* mode_t mode, */ /* struct mq_attr attr */ ) { 2007f20: 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++; 2007f24: 03 00 80 8d sethi %hi(0x2023400), %g1 2007f28: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2007f2c: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2007f30: 84 00 a0 01 inc %g2 2007f34: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 2007f38: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 2007f3c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2007f40: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2007f44: fa 27 a0 58 st %i5, [ %fp + 0x58 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2007f48: a0 8e 62 00 andcc %i1, 0x200, %l0 2007f4c: 12 80 00 36 bne 2008024 2007f50: b4 10 20 00 clr %i2 */ RTEMS_INLINE_ROUTINE POSIX_Message_queue_Control_fd * _POSIX_Message_queue_Allocate_fd( void ) { return (POSIX_Message_queue_Control_fd *) 2007f54: 39 00 80 8e sethi %hi(0x2023800), %i4 2007f58: 40 00 0c 0a call 200af80 <_Objects_Allocate> 2007f5c: 90 17 22 4c or %i4, 0x24c, %o0 ! 2023a4c <_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 ) { 2007f60: ba 92 20 00 orcc %o0, 0, %i5 2007f64: 02 80 00 39 be 2008048 <== NEVER TAKEN 2007f68: 01 00 00 00 nop _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one( ENFILE ); } the_mq_fd->oflag = oflag; 2007f6c: 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 ); 2007f70: 37 00 80 8e sethi %hi(0x2023800), %i3 2007f74: 92 10 00 18 mov %i0, %o1 2007f78: 90 16 e0 c0 or %i3, 0xc0, %o0 2007f7c: 94 07 bf f0 add %fp, -16, %o2 2007f80: 40 00 01 45 call 2008494 <_POSIX_Name_to_id> 2007f84: 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 ) { 2007f88: a2 92 20 00 orcc %o0, 0, %l1 2007f8c: 22 80 00 0f be,a 2007fc8 2007f90: 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) ) ) { 2007f94: 80 a4 60 02 cmp %l1, 2 2007f98: 02 80 00 3f be 2008094 2007f9c: 80 a4 20 00 cmp %l0, 0 RTEMS_INLINE_ROUTINE void _POSIX_Message_queue_Free_fd ( POSIX_Message_queue_Control_fd *the_mq_fd ) { _Objects_Free( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object ); 2007fa0: 90 17 22 4c or %i4, 0x24c, %o0 2007fa4: 40 00 0c e1 call 200b328 <_Objects_Free> 2007fa8: 92 10 00 1d mov %i5, %o1 _POSIX_Message_queue_Free_fd( the_mq_fd ); _Thread_Enable_dispatch(); 2007fac: 40 00 11 5a call 200c514 <_Thread_Enable_dispatch> 2007fb0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, mqd_t ); 2007fb4: 40 00 29 75 call 2012588 <__errno> 2007fb8: 01 00 00 00 nop 2007fbc: e2 22 00 00 st %l1, [ %o0 ] 2007fc0: 81 c7 e0 08 ret 2007fc4: 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) ) { 2007fc8: 80 a6 6a 00 cmp %i1, 0xa00 2007fcc: 02 80 00 27 be 2008068 2007fd0: 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 *) 2007fd4: 94 07 bf f8 add %fp, -8, %o2 2007fd8: 40 00 0d 35 call 200b4ac <_Objects_Get> 2007fdc: 90 16 e0 c0 or %i3, 0xc0, %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; 2007fe0: c4 02 20 18 ld [ %o0 + 0x18 ], %g2 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 2007fe4: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007fe8: 84 00 a0 01 inc %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007fec: b8 17 22 4c or %i4, 0x24c, %i4 2007ff0: c4 22 20 18 st %g2, [ %o0 + 0x18 ] 2007ff4: 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 ); 2007ff8: d0 27 bf f4 st %o0, [ %fp + -12 ] the_mq->open_count += 1; the_mq_fd->Queue = the_mq; 2007ffc: d0 27 60 10 st %o0, [ %i5 + 0x10 ] 2008000: 83 28 60 02 sll %g1, 2, %g1 2008004: fa 20 80 01 st %i5, [ %g2 + %g1 ] _Objects_Open_string( &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 2008008: 40 00 11 43 call 200c514 <_Thread_Enable_dispatch> 200800c: c0 27 60 0c clr [ %i5 + 0xc ] _Thread_Enable_dispatch(); 2008010: 40 00 11 41 call 200c514 <_Thread_Enable_dispatch> 2008014: 01 00 00 00 nop return (mqd_t)the_mq_fd->Object.id; 2008018: f0 07 60 08 ld [ %i5 + 8 ], %i0 200801c: 81 c7 e0 08 ret 2008020: 81 e8 00 00 restore _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = va_arg( arg, mode_t ); attr = va_arg( arg, struct mq_attr * ); 2008024: 82 07 a0 54 add %fp, 0x54, %g1 2008028: f4 07 a0 50 ld [ %fp + 0x50 ], %i2 200802c: 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 *) 2008030: 39 00 80 8e sethi %hi(0x2023800), %i4 2008034: 40 00 0b d3 call 200af80 <_Objects_Allocate> 2008038: 90 17 22 4c or %i4, 0x24c, %o0 ! 2023a4c <_POSIX_Message_queue_Information_fds> va_end(arg); } the_mq_fd = _POSIX_Message_queue_Allocate_fd(); if ( !the_mq_fd ) { 200803c: ba 92 20 00 orcc %o0, 0, %i5 2008040: 32 bf ff cc bne,a 2007f70 2008044: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _Thread_Enable_dispatch(); 2008048: 40 00 11 33 call 200c514 <_Thread_Enable_dispatch> 200804c: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( ENFILE ); 2008050: 40 00 29 4e call 2012588 <__errno> 2008054: 01 00 00 00 nop 2008058: 82 10 20 17 mov 0x17, %g1 ! 17 200805c: c2 22 00 00 st %g1, [ %o0 ] 2008060: 81 c7 e0 08 ret 2008064: 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 ); 2008068: 90 17 22 4c or %i4, 0x24c, %o0 200806c: 40 00 0c af call 200b328 <_Objects_Free> 2008070: 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(); 2008074: 40 00 11 28 call 200c514 <_Thread_Enable_dispatch> 2008078: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, mqd_t ); 200807c: 40 00 29 43 call 2012588 <__errno> 2008080: 01 00 00 00 nop 2008084: 82 10 20 11 mov 0x11, %g1 ! 11 2008088: c2 22 00 00 st %g1, [ %o0 ] 200808c: 81 c7 e0 08 ret 2008090: 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) ) ) { 2008094: 02 bf ff c4 be 2007fa4 2008098: 90 17 22 4c or %i4, 0x24c, %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( 200809c: d2 07 bf fc ld [ %fp + -4 ], %o1 20080a0: 90 10 00 18 mov %i0, %o0 20080a4: 94 10 20 01 mov 1, %o2 20080a8: 96 10 00 1a mov %i2, %o3 20080ac: 40 00 1c 28 call 200f14c <_POSIX_Message_queue_Create_support> 20080b0: 98 07 bf f4 add %fp, -12, %o4 ); /* * errno was set by Create_support, so don't set it again. */ if ( status == -1 ) { 20080b4: 80 a2 3f ff cmp %o0, -1 20080b8: 02 80 00 0d be 20080ec 20080bc: c6 07 bf f4 ld [ %fp + -12 ], %g3 Objects_Information *information, Objects_Control *the_object, const char *name ) { _Objects_Set_local_object( 20080c0: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20080c4: b8 17 22 4c or %i4, 0x24c, %i4 20080c8: 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; 20080cc: c6 27 60 10 st %g3, [ %i5 + 0x10 ] 20080d0: 83 28 60 02 sll %g1, 2, %g1 20080d4: fa 20 80 01 st %i5, [ %g2 + %g1 ] &_POSIX_Message_queue_Information_fds, &the_mq_fd->Object, NULL ); _Thread_Enable_dispatch(); 20080d8: 40 00 11 0f call 200c514 <_Thread_Enable_dispatch> 20080dc: c0 27 60 0c clr [ %i5 + 0xc ] return (mqd_t) the_mq_fd->Object.id; 20080e0: f0 07 60 08 ld [ %i5 + 8 ], %i0 } 20080e4: 81 c7 e0 08 ret 20080e8: 81 e8 00 00 restore 20080ec: 90 17 22 4c or %i4, 0x24c, %o0 20080f0: 92 10 00 1d mov %i5, %o1 20080f4: 40 00 0c 8d call 200b328 <_Objects_Free> 20080f8: 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(); 20080fc: 40 00 11 06 call 200c514 <_Thread_Enable_dispatch> 2008100: 01 00 00 00 nop return (mqd_t) -1; 2008104: 81 c7 e0 08 ret 2008108: 81 e8 00 00 restore =============================================================================== 0200c80c : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200c80c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200c810: 80 a0 60 00 cmp %g1, 0 200c814: 02 80 00 06 be 200c82c 200c818: 90 10 20 16 mov 0x16, %o0 200c81c: c4 00 40 00 ld [ %g1 ], %g2 200c820: 80 a0 a0 00 cmp %g2, 0 200c824: 12 80 00 04 bne 200c834 200c828: 80 a2 60 04 cmp %o1, 4 return 0; default: return ENOTSUP; } } 200c82c: 81 c3 e0 08 retl 200c830: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( policy ) { 200c834: 18 80 00 09 bgu 200c858 200c838: 84 10 20 01 mov 1, %g2 ! 1 200c83c: 85 28 80 09 sll %g2, %o1, %g2 200c840: 80 88 a0 17 btst 0x17, %g2 200c844: 02 80 00 05 be 200c858 <== NEVER TAKEN 200c848: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200c84c: d2 20 60 14 st %o1, [ %g1 + 0x14 ] return 0; 200c850: 81 c3 e0 08 retl 200c854: 90 10 20 00 clr %o0 default: return ENOTSUP; } } 200c858: 81 c3 e0 08 retl 200c85c: 90 10 20 86 mov 0x86, %o0 =============================================================================== 02007f4c : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 2007f4c: 9d e3 bf 90 save %sp, -112, %sp 2007f50: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2007f54: 80 a7 60 00 cmp %i5, 0 2007f58: 02 80 00 27 be 2007ff4 2007f5c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 2007f60: 80 a6 a0 00 cmp %i2, 0 2007f64: 02 80 00 24 be 2007ff4 2007f68: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007f6c: 02 80 00 24 be 2007ffc 2007f70: 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 ) 2007f74: c2 06 40 00 ld [ %i1 ], %g1 2007f78: 80 a0 60 00 cmp %g1, 0 2007f7c: 02 80 00 1e be 2007ff4 2007f80: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2007f84: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007f88: 80 a0 60 00 cmp %g1, 0 2007f8c: 12 80 00 1a bne 2007ff4 <== NEVER TAKEN 2007f90: 03 00 80 80 sethi %hi(0x2020000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007f94: c4 00 60 90 ld [ %g1 + 0x90 ], %g2 ! 2020090 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2007f98: c0 27 bf f0 clr [ %fp + -16 ] 2007f9c: 84 00 a0 01 inc %g2 the_attributes.maximum_count = count; 2007fa0: f4 27 bf f4 st %i2, [ %fp + -12 ] 2007fa4: c4 20 60 90 st %g2, [ %g1 + 0x90 ] return _Thread_Dispatch_disable_level; 2007fa8: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 * This function allocates a barrier control block from * the inactive chain of free barrier control blocks. */ RTEMS_INLINE_ROUTINE POSIX_Barrier_Control *_POSIX_Barrier_Allocate( void ) { return (POSIX_Barrier_Control *) 2007fac: 37 00 80 81 sethi %hi(0x2020400), %i3 2007fb0: 40 00 08 e1 call 200a334 <_Objects_Allocate> 2007fb4: 90 16 e0 50 or %i3, 0x50, %o0 ! 2020450 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2007fb8: b8 92 20 00 orcc %o0, 0, %i4 2007fbc: 02 80 00 14 be 200800c 2007fc0: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2007fc4: 40 00 06 26 call 200985c <_CORE_barrier_Initialize> 2007fc8: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007fcc: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007fd0: b6 16 e0 50 or %i3, 0x50, %i3 2007fd4: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007fd8: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007fdc: 85 28 a0 02 sll %g2, 2, %g2 2007fe0: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 2007fe4: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 2007fe8: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007fec: 40 00 0e 00 call 200b7ec <_Thread_Enable_dispatch> 2007ff0: b0 10 20 00 clr %i0 return 0; } 2007ff4: 81 c7 e0 08 ret 2007ff8: 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 ); 2007ffc: 7f ff ff 9c call 2007e6c 2008000: 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 ) 2008004: 10 bf ff dd b 2007f78 2008008: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { _Thread_Enable_dispatch(); 200800c: 40 00 0d f8 call 200b7ec <_Thread_Enable_dispatch> 2008010: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2008014: 81 c7 e0 08 ret 2008018: 81 e8 00 00 restore =============================================================================== 020077e8 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 20077e8: 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 ) 20077ec: 80 a6 20 00 cmp %i0, 0 20077f0: 02 80 00 16 be 2007848 20077f4: 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++; 20077f8: 03 00 80 7e sethi %hi(0x201f800), %g1 20077fc: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 201f8c0 <_Thread_Dispatch_disable_level> 2007800: 84 00 a0 01 inc %g2 2007804: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2007808: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 200780c: 40 00 12 ea call 200c3b4 <_Workspace_Allocate> 2007810: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2007814: 80 a2 20 00 cmp %o0, 0 2007818: 02 80 00 0a be 2007840 <== NEVER TAKEN 200781c: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2007820: 03 00 80 7f sethi %hi(0x201fc00), %g1 2007824: c2 00 62 0c ld [ %g1 + 0x20c ], %g1 ! 201fe0c <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; handler->routine = routine; handler->arg = arg; _Chain_Append( handler_stack, &handler->Node ); 2007828: 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; 200782c: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 handler->routine = routine; 2007830: f0 22 20 08 st %i0, [ %o0 + 8 ] handler->arg = arg; 2007834: f2 22 20 0c st %i1, [ %o0 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2007838: 40 00 06 5b call 20091a4 <_Chain_Append> 200783c: 90 00 60 e4 add %g1, 0xe4, %o0 } _Thread_Enable_dispatch(); 2007840: 40 00 0e 44 call 200b150 <_Thread_Enable_dispatch> 2007844: 81 e8 00 00 restore 2007848: 81 c7 e0 08 ret 200784c: 81 e8 00 00 restore =============================================================================== 02008790 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2008790: 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; 2008794: 80 a6 60 00 cmp %i1, 0 2008798: 02 80 00 27 be 2008834 200879c: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 20087a0: c2 06 60 04 ld [ %i1 + 4 ], %g1 20087a4: 80 a0 60 01 cmp %g1, 1 20087a8: 02 80 00 21 be 200882c <== NEVER TAKEN 20087ac: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 20087b0: c2 06 40 00 ld [ %i1 ], %g1 20087b4: 80 a0 60 00 cmp %g1, 0 20087b8: 02 80 00 1d be 200882c 20087bc: 03 00 80 84 sethi %hi(0x2021000), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20087c0: c4 00 62 a0 ld [ %g1 + 0x2a0 ], %g2 ! 20212a0 <_Thread_Dispatch_disable_level> 20087c4: 84 00 a0 01 inc %g2 20087c8: c4 20 62 a0 st %g2, [ %g1 + 0x2a0 ] return _Thread_Dispatch_disable_level; 20087cc: c2 00 62 a0 ld [ %g1 + 0x2a0 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 20087d0: 37 00 80 85 sethi %hi(0x2021400), %i3 20087d4: 40 00 0a 94 call 200b224 <_Objects_Allocate> 20087d8: 90 16 e2 f8 or %i3, 0x2f8, %o0 ! 20216f8 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 20087dc: b8 92 20 00 orcc %o0, 0, %i4 20087e0: 02 80 00 18 be 2008840 20087e4: 90 07 20 18 add %i4, 0x18, %o0 _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20087e8: c2 06 60 04 ld [ %i1 + 4 ], %g1 the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20087ec: 92 10 20 00 clr %o1 20087f0: 15 04 00 02 sethi %hi(0x10000800), %o2 20087f4: 96 10 20 74 mov 0x74, %o3 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 20087f8: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 20087fc: 40 00 11 e7 call 200cf98 <_Thread_queue_Initialize> 2008800: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008804: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008808: b6 16 e2 f8 or %i3, 0x2f8, %i3 200880c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008810: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008814: 85 28 a0 02 sll %g2, 2, %g2 2008818: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 200881c: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2008820: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2008824: 40 00 0f ae call 200c6dc <_Thread_Enable_dispatch> 2008828: b0 10 20 00 clr %i0 return 0; } 200882c: 81 c7 e0 08 ret 2008830: 81 e8 00 00 restore { POSIX_Condition_variables_Control *the_cond; const pthread_condattr_t *the_attr; if ( attr ) the_attr = attr; else the_attr = &_POSIX_Condition_variables_Default_attributes; 2008834: 33 00 80 7b sethi %hi(0x201ec00), %i1 2008838: 10 bf ff da b 20087a0 200883c: b2 16 63 d4 or %i1, 0x3d4, %i1 ! 201efd4 <_POSIX_Condition_variables_Default_attributes> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { _Thread_Enable_dispatch(); 2008840: 40 00 0f a7 call 200c6dc <_Thread_Enable_dispatch> 2008844: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2008848: 81 c7 e0 08 ret 200884c: 81 e8 00 00 restore =============================================================================== 020085f4 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 20085f4: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 20085f8: 80 a0 60 00 cmp %g1, 0 20085fc: 02 80 00 06 be 2008614 2008600: 90 10 20 16 mov 0x16, %o0 2008604: c4 00 40 00 ld [ %g1 ], %g2 2008608: 80 a0 a0 00 cmp %g2, 0 200860c: 32 80 00 04 bne,a 200861c <== ALWAYS TAKEN 2008610: c0 20 40 00 clr [ %g1 ] return EINVAL; attr->is_initialized = false; return 0; } 2008614: 81 c3 e0 08 retl 2008618: 01 00 00 00 nop 200861c: 81 c3 e0 08 retl 2008620: 90 10 20 00 clr %o0 ! 0 =============================================================================== 02007c90 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 2007c90: 9d e3 bf 58 save %sp, -168, %sp 2007c94: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2007c98: 80 a6 a0 00 cmp %i2, 0 2007c9c: 02 80 00 63 be 2007e28 2007ca0: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2007ca4: 80 a6 60 00 cmp %i1, 0 2007ca8: 22 80 00 62 be,a 2007e30 2007cac: 33 00 80 85 sethi %hi(0x2021400), %i1 if ( !the_attr->is_initialized ) 2007cb0: c2 06 40 00 ld [ %i1 ], %g1 2007cb4: 80 a0 60 00 cmp %g1, 0 2007cb8: 02 80 00 5c be 2007e28 2007cbc: b0 10 20 16 mov 0x16, %i0 * stack space if it is allowed to allocate it itself. * * NOTE: If the user provides the stack we will let it drop below * twice the minimum. */ if ( the_attr->stackaddr && !_Stack_Is_enough(the_attr->stacksize) ) 2007cc0: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007cc4: 80 a0 60 00 cmp %g1, 0 2007cc8: 02 80 00 07 be 2007ce4 2007ccc: 03 00 80 8a sethi %hi(0x2022800), %g1 2007cd0: c4 06 60 08 ld [ %i1 + 8 ], %g2 2007cd4: c2 00 62 28 ld [ %g1 + 0x228 ], %g1 2007cd8: 80 a0 80 01 cmp %g2, %g1 2007cdc: 0a 80 00 83 bcs 2007ee8 2007ce0: 01 00 00 00 nop * If inheritsched is set to PTHREAD_INHERIT_SCHED, then this thread * inherits scheduling attributes from the creating thread. If it is * PTHREAD_EXPLICIT_SCHED, then scheduling parameters come from the * attributes structure. */ switch ( the_attr->inheritsched ) { 2007ce4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2007ce8: 80 a0 60 01 cmp %g1, 1 2007cec: 02 80 00 53 be 2007e38 2007cf0: 80 a0 60 02 cmp %g1, 2 2007cf4: 12 80 00 4d bne 2007e28 2007cf8: b0 10 20 16 mov 0x16, %i0 schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2007cfc: da 06 60 18 ld [ %i1 + 0x18 ], %o5 2007d00: de 06 60 1c ld [ %i1 + 0x1c ], %o7 2007d04: f0 06 60 20 ld [ %i1 + 0x20 ], %i0 2007d08: c8 06 60 24 ld [ %i1 + 0x24 ], %g4 2007d0c: c6 06 60 28 ld [ %i1 + 0x28 ], %g3 2007d10: c4 06 60 2c ld [ %i1 + 0x2c ], %g2 2007d14: c2 06 60 30 ld [ %i1 + 0x30 ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2007d18: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 schedparam = the_attr->schedparam; 2007d1c: da 27 bf dc st %o5, [ %fp + -36 ] 2007d20: de 27 bf e0 st %o7, [ %fp + -32 ] 2007d24: f0 27 bf e4 st %i0, [ %fp + -28 ] 2007d28: c8 27 bf e8 st %g4, [ %fp + -24 ] 2007d2c: c6 27 bf ec st %g3, [ %fp + -20 ] 2007d30: c4 27 bf f0 st %g2, [ %fp + -16 ] 2007d34: c2 27 bf f4 st %g1, [ %fp + -12 ] /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 2007d38: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2007d3c: 80 a0 60 00 cmp %g1, 0 2007d40: 12 80 00 3a bne 2007e28 2007d44: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2007d48: d0 07 bf dc ld [ %fp + -36 ], %o0 2007d4c: 40 00 1a ac call 200e7fc <_POSIX_Priority_Is_valid> 2007d50: b0 10 20 16 mov 0x16, %i0 2007d54: 80 8a 20 ff btst 0xff, %o0 2007d58: 02 80 00 34 be 2007e28 <== NEVER TAKEN 2007d5c: 03 00 80 8a sethi %hi(0x2022800), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 2007d60: e4 07 bf dc ld [ %fp + -36 ], %l2 RTEMS_INLINE_ROUTINE Priority_Control _POSIX_Priority_To_core( int priority ) { return (Priority_Control) (POSIX_SCHEDULER_MAXIMUM_PRIORITY - priority + 1); 2007d64: e6 08 62 24 ldub [ %g1 + 0x224 ], %l3 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2007d68: 90 10 00 1c mov %i4, %o0 2007d6c: 92 07 bf dc add %fp, -36, %o1 2007d70: 94 07 bf f8 add %fp, -8, %o2 2007d74: 40 00 1a af call 200e830 <_POSIX_Thread_Translate_sched_param> 2007d78: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2007d7c: b0 92 20 00 orcc %o0, 0, %i0 2007d80: 12 80 00 2a bne 2007e28 2007d84: 23 00 80 8e sethi %hi(0x2023800), %l1 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2007d88: d0 04 60 68 ld [ %l1 + 0x68 ], %o0 ! 2023868 <_RTEMS_Allocator_Mutex> 2007d8c: 40 00 06 8c call 20097bc <_API_Mutex_Lock> 2007d90: 29 00 80 8e sethi %hi(0x2023800), %l4 * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 2007d94: 40 00 09 68 call 200a334 <_Objects_Allocate> 2007d98: 90 15 22 00 or %l4, 0x200, %o0 ! 2023a00 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2007d9c: a0 92 20 00 orcc %o0, 0, %l0 2007da0: 02 80 00 1f be 2007e1c 2007da4: 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( 2007da8: 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 ) 2007dac: d6 00 a2 28 ld [ %g2 + 0x228 ], %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007db0: c0 27 bf d4 clr [ %fp + -44 ] static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 2007db4: 97 2a e0 01 sll %o3, 1, %o3 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2007db8: 80 a2 c0 01 cmp %o3, %g1 2007dbc: 1a 80 00 03 bcc 2007dc8 2007dc0: d4 06 60 04 ld [ %i1 + 4 ], %o2 2007dc4: 96 10 00 01 mov %g1, %o3 2007dc8: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007dcc: 9a 0c e0 ff and %l3, 0xff, %o5 2007dd0: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2007dd4: 82 10 20 01 mov 1, %g1 2007dd8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007ddc: c2 07 bf fc ld [ %fp + -4 ], %g1 2007de0: c0 23 a0 68 clr [ %sp + 0x68 ] 2007de4: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2007de8: 82 07 bf d4 add %fp, -44, %g1 2007dec: 90 15 22 00 or %l4, 0x200, %o0 2007df0: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2007df4: 92 10 00 10 mov %l0, %o1 2007df8: 98 10 20 01 mov 1, %o4 2007dfc: 40 00 0e b5 call 200b8d0 <_Thread_Initialize> 2007e00: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2007e04: 80 8a 20 ff btst 0xff, %o0 2007e08: 12 80 00 1f bne 2007e84 2007e0c: 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 ); 2007e10: 92 10 00 10 mov %l0, %o1 2007e14: 40 00 0a 32 call 200a6dc <_Objects_Free> 2007e18: 90 12 22 00 or %o0, 0x200, %o0 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2007e1c: d0 04 60 68 ld [ %l1 + 0x68 ], %o0 2007e20: 40 00 06 7c call 2009810 <_API_Mutex_Unlock> 2007e24: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2007e28: 81 c7 e0 08 ret 2007e2c: 81 e8 00 00 restore int rc; if ( !start_routine ) return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2007e30: 10 bf ff a0 b 2007cb0 2007e34: b2 16 60 ec or %i1, 0xec, %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 ]; 2007e38: 03 00 80 8f sethi %hi(0x2023c00), %g1 2007e3c: c2 00 61 0c ld [ %g1 + 0x10c ], %g1 ! 2023d0c <_Per_CPU_Information+0xc> 2007e40: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2007e44: d8 00 60 88 ld [ %g1 + 0x88 ], %o4 2007e48: da 00 60 8c ld [ %g1 + 0x8c ], %o5 2007e4c: de 00 60 90 ld [ %g1 + 0x90 ], %o7 2007e50: f0 00 60 94 ld [ %g1 + 0x94 ], %i0 2007e54: c8 00 60 98 ld [ %g1 + 0x98 ], %g4 2007e58: c6 00 60 9c ld [ %g1 + 0x9c ], %g3 2007e5c: 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; 2007e60: f8 00 60 84 ld [ %g1 + 0x84 ], %i4 schedparam = api->schedparam; 2007e64: d8 27 bf dc st %o4, [ %fp + -36 ] 2007e68: da 27 bf e0 st %o5, [ %fp + -32 ] 2007e6c: de 27 bf e4 st %o7, [ %fp + -28 ] 2007e70: f0 27 bf e8 st %i0, [ %fp + -24 ] 2007e74: c8 27 bf ec st %g4, [ %fp + -20 ] 2007e78: c6 27 bf f0 st %g3, [ %fp + -16 ] break; 2007e7c: 10 bf ff af b 2007d38 2007e80: c4 27 bf f4 st %g2, [ %fp + -12 ] } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2007e84: e4 04 21 5c ld [ %l0 + 0x15c ], %l2 api->Attributes = *the_attr; 2007e88: 92 10 00 19 mov %i1, %o1 2007e8c: 94 10 20 40 mov 0x40, %o2 2007e90: 40 00 27 4b call 2011bbc 2007e94: 90 10 00 12 mov %l2, %o0 api->detachstate = the_attr->detachstate; 2007e98: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2007e9c: 92 07 bf dc add %fp, -36, %o1 2007ea0: 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; 2007ea4: c2 24 a0 40 st %g1, [ %l2 + 0x40 ] api->schedpolicy = schedpolicy; 2007ea8: f8 24 a0 84 st %i4, [ %l2 + 0x84 ] api->schedparam = schedparam; 2007eac: 40 00 27 44 call 2011bbc 2007eb0: 90 04 a0 88 add %l2, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 2007eb4: 90 10 00 10 mov %l0, %o0 2007eb8: 92 10 20 01 mov 1, %o1 2007ebc: 94 10 00 1a mov %i2, %o2 2007ec0: 96 10 00 1b mov %i3, %o3 2007ec4: 40 00 10 f9 call 200c2a8 <_Thread_Start> 2007ec8: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2007ecc: 80 a7 20 04 cmp %i4, 4 2007ed0: 02 80 00 08 be 2007ef0 2007ed4: 01 00 00 00 nop } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2007ed8: c2 04 20 08 ld [ %l0 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2007edc: d0 04 60 68 ld [ %l1 + 0x68 ], %o0 2007ee0: 40 00 06 4c call 2009810 <_API_Mutex_Unlock> 2007ee4: c2 27 40 00 st %g1, [ %i5 ] return 0; 2007ee8: 81 c7 e0 08 ret 2007eec: 81 e8 00 00 restore return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { _Watchdog_Insert_ticks( 2007ef0: 40 00 11 16 call 200c348 <_Timespec_To_ticks> 2007ef4: 90 04 a0 90 add %l2, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007ef8: 92 04 a0 a8 add %l2, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007efc: d0 24 a0 b4 st %o0, [ %l2 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007f00: 11 00 80 8e sethi %hi(0x2023800), %o0 2007f04: 40 00 12 04 call 200c714 <_Watchdog_Insert> 2007f08: 90 12 20 80 or %o0, 0x80, %o0 ! 2023880 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 2007f0c: 10 bf ff f4 b 2007edc 2007f10: c2 04 20 08 ld [ %l0 + 8 ], %g1 =============================================================================== 0201b6e8 : int pthread_kill( pthread_t thread, int sig ) { 201b6e8: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 201b6ec: 80 a6 60 00 cmp %i1, 0 201b6f0: 02 80 00 2d be 201b7a4 201b6f4: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 201b6f8: 80 a6 e0 1f cmp %i3, 0x1f 201b6fc: 18 80 00 2a bgu 201b7a4 201b700: 90 10 00 18 mov %i0, %o0 rtems_set_errno_and_return_minus_one( EINVAL ); the_thread = _Thread_Get( thread, &location ); 201b704: 7f ff bc 5d call 200a878 <_Thread_Get> 201b708: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201b70c: c2 07 bf fc ld [ %fp + -4 ], %g1 201b710: 80 a0 60 00 cmp %g1, 0 201b714: 12 80 00 2a bne 201b7bc <== NEVER TAKEN 201b718: ba 10 00 08 mov %o0, %i5 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 201b71c: 83 2e 60 02 sll %i1, 2, %g1 201b720: 85 2e 60 04 sll %i1, 4, %g2 201b724: 84 20 80 01 sub %g2, %g1, %g2 201b728: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b72c: 82 10 63 d0 or %g1, 0x3d0, %g1 ! 201efd0 <_POSIX_signals_Vectors> 201b730: 82 00 40 02 add %g1, %g2, %g1 201b734: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b738: 80 a0 a0 01 cmp %g2, 1 201b73c: 02 80 00 14 be 201b78c 201b740: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201b744: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 201b748: b8 10 20 01 mov 1, %i4 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201b74c: 92 10 00 19 mov %i1, %o1 201b750: b7 2f 00 1b sll %i4, %i3, %i3 201b754: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201b758: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201b75c: 7f ff ff 8c call 201b58c <_POSIX_signals_Unblock_thread> 201b760: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201b764: 03 00 80 7b sethi %hi(0x201ec00), %g1 201b768: 82 10 63 70 or %g1, 0x370, %g1 ! 201ef70 <_Per_CPU_Information> 201b76c: c4 00 60 08 ld [ %g1 + 8 ], %g2 201b770: 80 a0 a0 00 cmp %g2, 0 201b774: 02 80 00 06 be 201b78c 201b778: 01 00 00 00 nop 201b77c: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201b780: 80 a7 40 02 cmp %i5, %g2 201b784: 02 80 00 06 be 201b79c 201b788: 01 00 00 00 nop _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 201b78c: 7f ff bc 2e call 200a844 <_Thread_Enable_dispatch> 201b790: b0 10 20 00 clr %i0 ! 0 return 0; 201b794: 81 c7 e0 08 ret 201b798: 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; 201b79c: f8 28 60 18 stb %i4, [ %g1 + 0x18 ] 201b7a0: 30 bf ff fb b,a 201b78c if ( !sig ) rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) rtems_set_errno_and_return_minus_one( EINVAL ); 201b7a4: 7f ff d3 a1 call 2010628 <__errno> 201b7a8: b0 10 3f ff mov -1, %i0 201b7ac: 82 10 20 16 mov 0x16, %g1 201b7b0: c2 22 00 00 st %g1, [ %o0 ] 201b7b4: 81 c7 e0 08 ret 201b7b8: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 201b7bc: 7f ff d3 9b call 2010628 <__errno> <== NOT EXECUTED 201b7c0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201b7c4: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 201b7c8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 201b7cc: 81 c7 e0 08 ret <== NOT EXECUTED 201b7d0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02009cd8 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2009cd8: 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 ); 2009cdc: 90 10 00 19 mov %i1, %o0 2009ce0: 40 00 00 37 call 2009dbc <_POSIX_Absolute_timeout_to_ticks> 2009ce4: 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 ); 2009ce8: 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 ); 2009cec: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) 2009cf0: 80 a7 60 03 cmp %i5, 3 2009cf4: 02 80 00 09 be 2009d18 2009cf8: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009cfc: 7f ff ff be call 2009bf4 <_POSIX_Mutex_Lock_support> 2009d00: 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) ) { 2009d04: 80 a2 20 10 cmp %o0, 0x10 2009d08: 02 80 00 08 be 2009d28 2009d0c: 80 a7 60 00 cmp %i5, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2009d10: 81 c7 e0 08 ret 2009d14: 91 e8 00 08 restore %g0, %o0, %o0 */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 2009d18: 7f ff ff b7 call 2009bf4 <_POSIX_Mutex_Lock_support> 2009d1c: 92 10 20 01 mov 1, %o1 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return lock_status; } 2009d20: 81 c7 e0 08 ret 2009d24: 91 e8 00 08 restore %g0, %o0, %o0 * attempt to lock if the abstime was not in the future. If we did * not obtain the mutex, then not look at the status immediately, * make sure the right reason is returned. */ if ( !do_wait && (lock_status == EBUSY) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2009d28: 32 80 00 04 bne,a 2009d38 <== ALWAYS TAKEN 2009d2c: ba 07 7f ff add %i5, -1, %i5 return EINVAL; 2009d30: 10 bf ff f8 b 2009d10 <== NOT EXECUTED 2009d34: 90 10 20 16 mov 0x16, %o0 <== NOT EXECUTED if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2009d38: 80 a7 60 01 cmp %i5, 1 2009d3c: 28 bf ff f5 bleu,a 2009d10 <== ALWAYS TAKEN 2009d40: 90 10 20 74 mov 0x74, %o0 2009d44: 30 bf ff f3 b,a 2009d10 <== NOT EXECUTED =============================================================================== 02007510 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2007510: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007514: 80 a0 60 00 cmp %g1, 0 2007518: 02 80 00 06 be 2007530 200751c: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007520: c4 00 40 00 ld [ %g1 ], %g2 2007524: 80 a0 a0 00 cmp %g2, 0 2007528: 12 80 00 04 bne 2007538 200752c: 80 a2 60 00 cmp %o1, 0 if ( !type ) return EINVAL; *type = attr->type; return 0; } 2007530: 81 c3 e0 08 retl 2007534: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; if ( !type ) 2007538: 02 bf ff fe be 2007530 <== NEVER TAKEN 200753c: 01 00 00 00 nop return EINVAL; *type = attr->type; 2007540: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2007544: 90 10 20 00 clr %o0 } 2007548: 81 c3 e0 08 retl 200754c: c2 22 40 00 st %g1, [ %o1 ] =============================================================================== 020098ac : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 20098ac: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20098b0: 80 a0 60 00 cmp %g1, 0 20098b4: 02 80 00 06 be 20098cc 20098b8: 90 10 20 16 mov 0x16, %o0 20098bc: c4 00 40 00 ld [ %g1 ], %g2 20098c0: 80 a0 a0 00 cmp %g2, 0 20098c4: 12 80 00 04 bne 20098d4 20098c8: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 20098cc: 81 c3 e0 08 retl 20098d0: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( pshared ) { 20098d4: 18 bf ff fe bgu 20098cc <== NEVER TAKEN 20098d8: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 20098dc: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 20098e0: 81 c3 e0 08 retl 20098e4: 90 10 20 00 clr %o0 =============================================================================== 020075a4 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 20075a4: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20075a8: 80 a0 60 00 cmp %g1, 0 20075ac: 02 80 00 06 be 20075c4 20075b0: 90 10 20 16 mov 0x16, %o0 20075b4: c4 00 40 00 ld [ %g1 ], %g2 20075b8: 80 a0 a0 00 cmp %g2, 0 20075bc: 12 80 00 04 bne 20075cc <== ALWAYS TAKEN 20075c0: 80 a2 60 03 cmp %o1, 3 return 0; default: return EINVAL; } } 20075c4: 81 c3 e0 08 retl 20075c8: 01 00 00 00 nop ) { if ( !attr || !attr->is_initialized ) return EINVAL; switch ( type ) { 20075cc: 18 bf ff fe bgu 20075c4 20075d0: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 20075d4: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; default: return EINVAL; } } 20075d8: 81 c3 e0 08 retl 20075dc: 90 10 20 00 clr %o0 =============================================================================== 020083c4 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 20083c4: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 20083c8: 80 a6 60 00 cmp %i1, 0 20083cc: 12 80 00 04 bne 20083dc 20083d0: ba 10 00 18 mov %i0, %i5 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 20083d4: 81 c7 e0 08 ret 20083d8: 91 e8 20 16 restore %g0, 0x16, %o0 int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) 20083dc: 80 a6 20 00 cmp %i0, 0 20083e0: 22 80 00 13 be,a 200842c 20083e4: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 20083e8: c2 06 20 04 ld [ %i0 + 4 ], %g1 20083ec: 80 a0 60 00 cmp %g1, 0 20083f0: 12 80 00 0f bne 200842c 20083f4: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20083f8: 90 10 21 00 mov 0x100, %o0 20083fc: 92 10 21 00 mov 0x100, %o1 2008400: 40 00 03 0e call 2009038 2008404: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2008408: c2 07 60 04 ld [ %i5 + 4 ], %g1 200840c: 80 a0 60 00 cmp %g1, 0 2008410: 02 80 00 09 be 2008434 <== ALWAYS TAKEN 2008414: 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); 2008418: d0 07 bf fc ld [ %fp + -4 ], %o0 <== NOT EXECUTED 200841c: 92 10 21 00 mov 0x100, %o1 2008420: 94 07 bf fc add %fp, -4, %o2 2008424: 40 00 03 05 call 2009038 2008428: b0 10 20 00 clr %i0 200842c: 81 c7 e0 08 ret 2008430: 81 e8 00 00 restore if ( !once_control->init_executed ) { rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); if ( !once_control->init_executed ) { once_control->is_initialized = true; 2008434: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2008438: 9f c6 40 00 call %i1 200843c: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2008440: 10 bf ff f7 b 200841c 2008444: d0 07 bf fc ld [ %fp + -4 ], %o0 =============================================================================== 0200833c : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 200833c: 9d e3 bf 90 save %sp, -112, %sp 2008340: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 2008344: 80 a7 60 00 cmp %i5, 0 2008348: 02 80 00 24 be 20083d8 200834c: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2008350: 80 a6 60 00 cmp %i1, 0 2008354: 02 80 00 23 be 20083e0 2008358: 90 07 bf f4 add %fp, -12, %o0 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 200835c: c2 06 40 00 ld [ %i1 ], %g1 2008360: 80 a0 60 00 cmp %g1, 0 2008364: 02 80 00 1d be 20083d8 <== NEVER TAKEN 2008368: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 200836c: c2 06 60 04 ld [ %i1 + 4 ], %g1 2008370: 80 a0 60 00 cmp %g1, 0 2008374: 12 80 00 19 bne 20083d8 <== NEVER TAKEN 2008378: 03 00 80 8d sethi %hi(0x2023400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200837c: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 2008380: c0 27 bf fc clr [ %fp + -4 ] 2008384: 84 00 a0 01 inc %g2 2008388: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 200838c: c2 00 61 40 ld [ %g1 + 0x140 ], %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 *) 2008390: 37 00 80 8d sethi %hi(0x2023400), %i3 2008394: 40 00 0a fb call 200af80 <_Objects_Allocate> 2008398: 90 16 e3 80 or %i3, 0x380, %o0 ! 2023780 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 200839c: b8 92 20 00 orcc %o0, 0, %i4 20083a0: 02 80 00 14 be 20083f0 20083a4: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); return EAGAIN; } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 20083a8: 40 00 09 35 call 200a87c <_CORE_RWLock_Initialize> 20083ac: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20083b0: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20083b4: b6 16 e3 80 or %i3, 0x380, %i3 20083b8: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20083bc: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20083c0: 85 28 a0 02 sll %g2, 2, %g2 20083c4: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 20083c8: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 20083cc: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20083d0: 40 00 10 51 call 200c514 <_Thread_Enable_dispatch> 20083d4: b0 10 20 00 clr %i0 return 0; } 20083d8: 81 c7 e0 08 ret 20083dc: 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 ); 20083e0: 40 00 01 b2 call 2008aa8 20083e4: b2 07 bf f4 add %fp, -12, %i1 } /* * Now start error checking the attributes that we are going to use */ if ( !the_attr->is_initialized ) 20083e8: 10 bf ff de b 2008360 20083ec: c2 06 40 00 ld [ %i1 ], %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { _Thread_Enable_dispatch(); 20083f0: 40 00 10 49 call 200c514 <_Thread_Enable_dispatch> 20083f4: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20083f8: 81 c7 e0 08 ret 20083fc: 81 e8 00 00 restore =============================================================================== 02008c2c : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008c2c: 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 ) 2008c30: 80 a6 20 00 cmp %i0, 0 2008c34: 02 80 00 24 be 2008cc4 2008c38: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2008c3c: 92 07 bf fc add %fp, -4, %o1 2008c40: 40 00 1b 3c call 200f930 <_POSIX_Absolute_timeout_to_ticks> 2008c44: 90 10 00 19 mov %i1, %o0 2008c48: d2 06 00 00 ld [ %i0 ], %o1 2008c4c: b8 10 00 08 mov %o0, %i4 2008c50: 94 07 bf f8 add %fp, -8, %o2 2008c54: 11 00 80 87 sethi %hi(0x2021c00), %o0 2008c58: 40 00 0b 92 call 200baa0 <_Objects_Get> 2008c5c: 90 12 20 60 or %o0, 0x60, %o0 ! 2021c60 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2008c60: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008c64: 80 a0 60 00 cmp %g1, 0 2008c68: 12 80 00 17 bne 2008cc4 2008c6c: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 2008c70: d2 06 00 00 ld [ %i0 ], %o1 int _EXFUN(pthread_rwlock_init, (pthread_rwlock_t *__rwlock, _CONST pthread_rwlockattr_t *__attr)); int _EXFUN(pthread_rwlock_destroy, (pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_rdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_tryrdlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedrdlock, 2008c74: 82 1f 20 03 xor %i4, 3, %g1 2008c78: 90 02 20 10 add %o0, 0x10, %o0 2008c7c: 80 a0 00 01 cmp %g0, %g1 2008c80: 98 10 20 00 clr %o4 2008c84: b6 60 3f ff subx %g0, -1, %i3 2008c88: 40 00 07 d2 call 200abd0 <_CORE_RWLock_Obtain_for_reading> 2008c8c: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008c90: 40 00 0f 67 call 200ca2c <_Thread_Enable_dispatch> 2008c94: 01 00 00 00 nop if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2008c98: 03 00 80 87 sethi %hi(0x2021c00), %g1 2008c9c: c2 00 63 ac ld [ %g1 + 0x3ac ], %g1 ! 2021fac <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait ) { 2008ca0: 80 a6 e0 00 cmp %i3, 0 2008ca4: 12 80 00 05 bne 2008cb8 2008ca8: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2008cac: 80 a2 20 02 cmp %o0, 2 2008cb0: 02 80 00 07 be 2008ccc 2008cb4: 80 a7 20 00 cmp %i4, 0 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008cb8: 40 00 00 39 call 2008d9c <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008cbc: 01 00 00 00 nop 2008cc0: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2008cc4: 81 c7 e0 08 ret 2008cc8: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait ) { if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008ccc: 02 bf ff fe be 2008cc4 <== NEVER TAKEN 2008cd0: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008cd4: 80 a7 20 01 cmp %i4, 1 2008cd8: 18 bf ff f8 bgu 2008cb8 <== NEVER TAKEN 2008cdc: ba 10 20 74 mov 0x74, %i5 2008ce0: 30 bf ff f9 b,a 2008cc4 =============================================================================== 02008ce4 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2008ce4: 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 ) 2008ce8: 80 a6 20 00 cmp %i0, 0 2008cec: 02 80 00 24 be 2008d7c 2008cf0: ba 10 20 16 mov 0x16, %i5 * * If the status is POSIX_ABSOLUTE_TIMEOUT_INVALID, * POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST, or POSIX_ABSOLUTE_TIMEOUT_IS_NOW, * then we should not wait. */ status = _POSIX_Absolute_timeout_to_ticks( abstime, &ticks ); 2008cf4: 92 07 bf fc add %fp, -4, %o1 2008cf8: 40 00 1b 0e call 200f930 <_POSIX_Absolute_timeout_to_ticks> 2008cfc: 90 10 00 19 mov %i1, %o0 2008d00: d2 06 00 00 ld [ %i0 ], %o1 2008d04: b8 10 00 08 mov %o0, %i4 2008d08: 94 07 bf f8 add %fp, -8, %o2 2008d0c: 11 00 80 87 sethi %hi(0x2021c00), %o0 2008d10: 40 00 0b 64 call 200baa0 <_Objects_Get> 2008d14: 90 12 20 60 or %o0, 0x60, %o0 ! 2021c60 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2008d18: c2 07 bf f8 ld [ %fp + -8 ], %g1 2008d1c: 80 a0 60 00 cmp %g1, 0 2008d20: 12 80 00 17 bne 2008d7c 2008d24: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 2008d28: d2 06 00 00 ld [ %i0 ], %o1 (pthread_rwlock_t *__rwlock, _CONST struct timespec *__abstime)); int _EXFUN(pthread_rwlock_unlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_wrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_trywrlock,(pthread_rwlock_t *__rwlock)); int _EXFUN(pthread_rwlock_timedwrlock, 2008d2c: 82 1f 20 03 xor %i4, 3, %g1 2008d30: 90 02 20 10 add %o0, 0x10, %o0 2008d34: 80 a0 00 01 cmp %g0, %g1 2008d38: 98 10 20 00 clr %o4 2008d3c: b6 60 3f ff subx %g0, -1, %i3 2008d40: 40 00 07 da call 200aca8 <_CORE_RWLock_Obtain_for_writing> 2008d44: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2008d48: 40 00 0f 39 call 200ca2c <_Thread_Enable_dispatch> 2008d4c: 01 00 00 00 nop if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2008d50: 03 00 80 87 sethi %hi(0x2021c00), %g1 2008d54: c2 00 63 ac ld [ %g1 + 0x3ac ], %g1 ! 2021fac <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2008d58: 80 a6 e0 00 cmp %i3, 0 2008d5c: 12 80 00 05 bne 2008d70 2008d60: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2008d64: 80 a2 20 02 cmp %o0, 2 2008d68: 02 80 00 07 be 2008d84 2008d6c: 80 a7 20 00 cmp %i4, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2008d70: 40 00 00 0b call 2008d9c <_POSIX_RWLock_Translate_core_RWLock_return_code> 2008d74: 01 00 00 00 nop 2008d78: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2008d7c: 81 c7 e0 08 ret 2008d80: 91 e8 00 1d restore %g0, %i5, %o0 ); _Thread_Enable_dispatch(); if ( !do_wait && (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008d84: 02 bf ff fe be 2008d7c <== NEVER TAKEN 2008d88: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2008d8c: 80 a7 20 01 cmp %i4, 1 2008d90: 18 bf ff f8 bgu 2008d70 <== NEVER TAKEN 2008d94: ba 10 20 74 mov 0x74, %i5 2008d98: 30 bf ff f9 b,a 2008d7c =============================================================================== 020095a8 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 20095a8: 82 10 00 08 mov %o0, %g1 if ( !attr ) 20095ac: 80 a0 60 00 cmp %g1, 0 20095b0: 02 80 00 06 be 20095c8 20095b4: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 20095b8: c4 00 40 00 ld [ %g1 ], %g2 20095bc: 80 a0 a0 00 cmp %g2, 0 20095c0: 12 80 00 04 bne 20095d0 20095c4: 80 a2 60 01 cmp %o1, 1 return 0; default: return EINVAL; } } 20095c8: 81 c3 e0 08 retl 20095cc: 01 00 00 00 nop return EINVAL; if ( !attr->is_initialized ) return EINVAL; switch ( pshared ) { 20095d0: 18 bf ff fe bgu 20095c8 <== NEVER TAKEN 20095d4: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 20095d8: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; default: return EINVAL; } } 20095dc: 81 c3 e0 08 retl 20095e0: 90 10 20 00 clr %o0 =============================================================================== 0200a67c : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 200a67c: 9d e3 bf 90 save %sp, -112, %sp 200a680: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 200a684: 80 a6 a0 00 cmp %i2, 0 200a688: 02 80 00 38 be 200a768 200a68c: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 200a690: 90 10 00 19 mov %i1, %o0 200a694: 92 10 00 1a mov %i2, %o1 200a698: 94 07 bf f4 add %fp, -12, %o2 200a69c: 40 00 19 04 call 2010aac <_POSIX_Thread_Translate_sched_param> 200a6a0: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 200a6a4: b0 92 20 00 orcc %o0, 0, %i0 200a6a8: 12 80 00 30 bne 200a768 200a6ac: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 200a6b0: 40 00 0c b7 call 200d98c <_Thread_Get> 200a6b4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a6b8: c2 07 bf fc ld [ %fp + -4 ], %g1 200a6bc: 80 a0 60 00 cmp %g1, 0 200a6c0: 12 80 00 2c bne 200a770 200a6c4: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200a6c8: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 200a6cc: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 200a6d0: 80 a0 60 04 cmp %g1, 4 200a6d4: 02 80 00 33 be 200a7a0 200a6d8: 01 00 00 00 nop (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; 200a6dc: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 200a6e0: c2 06 80 00 ld [ %i2 ], %g1 the_thread->budget_algorithm = budget_algorithm; the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 200a6e4: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; 200a6e8: c2 27 60 88 st %g1, [ %i5 + 0x88 ] 200a6ec: c4 06 a0 04 ld [ %i2 + 4 ], %g2 200a6f0: c4 27 60 8c st %g2, [ %i5 + 0x8c ] 200a6f4: c4 06 a0 08 ld [ %i2 + 8 ], %g2 200a6f8: c4 27 60 90 st %g2, [ %i5 + 0x90 ] 200a6fc: c4 06 a0 0c ld [ %i2 + 0xc ], %g2 200a700: c4 27 60 94 st %g2, [ %i5 + 0x94 ] 200a704: c4 06 a0 10 ld [ %i2 + 0x10 ], %g2 200a708: c4 27 60 98 st %g2, [ %i5 + 0x98 ] 200a70c: c4 06 a0 14 ld [ %i2 + 0x14 ], %g2 200a710: c4 27 60 9c st %g2, [ %i5 + 0x9c ] 200a714: c4 06 a0 18 ld [ %i2 + 0x18 ], %g2 200a718: c4 27 60 a0 st %g2, [ %i5 + 0xa0 ] the_thread->budget_algorithm = budget_algorithm; 200a71c: c4 07 bf f4 ld [ %fp + -12 ], %g2 200a720: c4 27 20 78 st %g2, [ %i4 + 0x78 ] the_thread->budget_callout = budget_callout; 200a724: c4 07 bf f8 ld [ %fp + -8 ], %g2 switch ( api->schedpolicy ) { 200a728: 06 80 00 0e bl 200a760 <== NEVER TAKEN 200a72c: c4 27 20 7c st %g2, [ %i4 + 0x7c ] 200a730: 80 a6 60 02 cmp %i1, 2 200a734: 04 80 00 11 ble 200a778 200a738: 07 00 80 8c sethi %hi(0x2023000), %g3 200a73c: 80 a6 60 04 cmp %i1, 4 200a740: 12 80 00 08 bne 200a760 <== NEVER TAKEN 200a744: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 200a748: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _Watchdog_Remove( &api->Sporadic_timer ); 200a74c: 40 00 11 00 call 200eb4c <_Watchdog_Remove> 200a750: 90 07 60 a8 add %i5, 0xa8, %o0 _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 200a754: 90 10 20 00 clr %o0 200a758: 7f ff ff 7e call 200a550 <_POSIX_Threads_Sporadic_budget_TSR> 200a75c: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 200a760: 40 00 0c 7e call 200d958 <_Thread_Enable_dispatch> 200a764: 01 00 00 00 nop return 0; 200a768: 81 c7 e0 08 ret 200a76c: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return ESRCH; } 200a770: 81 c7 e0 08 ret 200a774: 91 e8 20 03 restore %g0, 3, %o0 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 200a778: 05 00 80 8f sethi %hi(0x2023c00), %g2 200a77c: d2 08 e1 b4 ldub [ %g3 + 0x1b4 ], %o1 200a780: c4 00 a3 14 ld [ %g2 + 0x314 ], %g2 200a784: 92 22 40 01 sub %o1, %g1, %o1 200a788: c4 27 20 74 st %g2, [ %i4 + 0x74 ] the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a78c: 90 10 00 1c mov %i4, %o0 case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; the_thread->real_priority = 200a790: d2 27 20 18 st %o1, [ %i4 + 0x18 ] _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 200a794: 40 00 0b 34 call 200d464 <_Thread_Change_priority> 200a798: 94 10 20 01 mov 1, %o2 the_thread, the_thread->real_priority, true ); break; 200a79c: 30 bf ff f1 b,a 200a760 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); 200a7a0: 40 00 10 eb call 200eb4c <_Watchdog_Remove> 200a7a4: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 200a7a8: 10 bf ff ce b 200a6e0 200a7ac: f2 27 60 84 st %i1, [ %i5 + 0x84 ] =============================================================================== 02008024 : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 2008024: 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() ) 2008028: 3b 00 80 7f sethi %hi(0x201fc00), %i5 200802c: ba 17 62 00 or %i5, 0x200, %i5 ! 201fe00 <_Per_CPU_Information> 2008030: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008034: 80 a0 60 00 cmp %g1, 0 2008038: 12 80 00 16 bne 2008090 <== NEVER TAKEN 200803c: 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++; 2008040: 03 00 80 7e sethi %hi(0x201f800), %g1 return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2008044: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2008048: c6 00 60 c0 ld [ %g1 + 0xc0 ], %g3 200804c: c4 00 a1 5c ld [ %g2 + 0x15c ], %g2 2008050: 86 00 e0 01 inc %g3 2008054: c6 20 60 c0 st %g3, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2008058: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200805c: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 2008060: 80 a0 60 00 cmp %g1, 0 2008064: 12 80 00 0d bne 2008098 <== NEVER TAKEN 2008068: 01 00 00 00 nop 200806c: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 2008070: 80 a0 60 00 cmp %g1, 0 2008074: 02 80 00 09 be 2008098 2008078: 01 00 00 00 nop thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 200807c: 40 00 0c 35 call 200b150 <_Thread_Enable_dispatch> 2008080: b2 10 3f ff mov -1, %i1 ! ffffffff if ( cancel ) _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2008084: f0 07 60 0c ld [ %i5 + 0xc ], %i0 2008088: 40 00 18 b4 call 200e358 <_POSIX_Thread_Exit> 200808c: 81 e8 00 00 restore 2008090: 81 c7 e0 08 ret <== NOT EXECUTED 2008094: 81 e8 00 00 restore <== NOT EXECUTED _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2008098: 40 00 0c 2e call 200b150 <_Thread_Enable_dispatch> 200809c: 81 e8 00 00 restore =============================================================================== 02008604 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2008604: 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); 2008608: 3b 00 80 83 sethi %hi(0x2020c00), %i5 200860c: 40 00 02 84 call 200901c 2008610: 90 17 63 94 or %i5, 0x394, %o0 ! 2020f94 if (result != 0) { 2008614: b8 92 20 00 orcc %o0, 0, %i4 2008618: 12 80 00 31 bne 20086dc <== NEVER TAKEN 200861c: 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); 2008620: 40 00 04 bc call 2009910 2008624: b6 17 63 94 or %i5, 0x394, %i3 2008628: 92 07 bf fc add %fp, -4, %o1 200862c: 40 00 03 b1 call 20094f0 2008630: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2008634: 40 00 04 b7 call 2009910 2008638: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 200863c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 req->policy = policy; 2008640: c6 07 bf fc ld [ %fp + -4 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008644: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 req->policy = policy; 2008648: 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; 200864c: c6 07 bf dc ld [ %fp + -36 ], %g3 /* _POSIX_PRIORITIZED_IO and _POSIX_PRIORITY_SCHEDULING are defined, we can use aio_reqprio to lower the priority of the request */ pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); 2008650: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2008654: 84 20 c0 02 sub %g3, %g2, %g2 2008658: 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) && 200865c: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 pthread_getschedparam (pthread_self(), &policy, ¶m); req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; 2008660: 86 10 20 77 mov 0x77, %g3 req->aiocbp->return_value = 0; 2008664: 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; 2008668: c6 20 60 34 st %g3, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 200866c: 80 a0 a0 00 cmp %g2, 0 2008670: 12 80 00 06 bne 2008688 <== NEVER TAKEN 2008674: d2 00 40 00 ld [ %g1 ], %o1 2008678: c4 06 e0 64 ld [ %i3 + 0x64 ], %g2 200867c: 80 a0 a0 04 cmp %g2, 4 2008680: 24 80 00 1b ble,a 20086ec 2008684: 90 06 e0 48 add %i3, 0x48, %o0 else { /* the maximum number of threads has been already created even though some of them might be idle. The request belongs to one of the active fd chain */ r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, 2008688: 94 10 20 00 clr %o2 200868c: 11 00 80 83 sethi %hi(0x2020c00), %o0 2008690: 7f ff ff 74 call 2008460 2008694: 90 12 23 dc or %o0, 0x3dc, %o0 ! 2020fdc req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 2008698: b4 92 20 00 orcc %o0, 0, %i2 200869c: 22 80 00 31 be,a 2008760 20086a0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 { pthread_mutex_lock (&r_chain->mutex); 20086a4: b6 06 a0 1c add %i2, 0x1c, %i3 20086a8: 40 00 02 5d call 200901c 20086ac: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20086b0: 90 06 a0 08 add %i2, 8, %o0 20086b4: 7f ff ff 0e call 20082ec 20086b8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20086bc: 40 00 01 34 call 2008b8c 20086c0: 90 06 a0 20 add %i2, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20086c4: 40 00 02 76 call 200909c 20086c8: 90 10 00 1b mov %i3, %o0 if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 20086cc: 40 00 02 74 call 200909c 20086d0: 90 17 63 94 or %i5, 0x394, %o0 return 0; } 20086d4: 81 c7 e0 08 ret 20086d8: 91 e8 00 1c restore %g0, %i4, %o0 /* The queue should be initialized */ AIO_assert (aio_request_queue.initialized == AIO_QUEUE_INITIALIZED); result = pthread_mutex_lock (&aio_request_queue.mutex); if (result != 0) { free (req); 20086dc: 7f ff ed a7 call 2003d78 <== NOT EXECUTED 20086e0: b0 10 00 1c mov %i4, %i0 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); return 0; } 20086e4: 81 c7 e0 08 ret <== NOT EXECUTED 20086e8: 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); 20086ec: 7f ff ff 5d call 2008460 20086f0: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 20086f4: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 20086f8: 80 a0 60 01 cmp %g1, 1 20086fc: 12 bf ff ea bne 20086a4 2008700: 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); 2008704: 90 02 20 08 add %o0, 8, %o0 2008708: 40 00 09 37 call 200abe4 <_Chain_Insert> 200870c: 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); 2008710: 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; 2008714: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2008718: 40 00 01 e9 call 2008ebc 200871c: 90 06 a0 1c add %i2, 0x1c, %o0 pthread_cond_init (&r_chain->cond, NULL); 2008720: 92 10 20 00 clr %o1 2008724: 40 00 00 ea call 2008acc 2008728: 90 06 a0 20 add %i2, 0x20, %o0 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 200872c: 90 07 bf f8 add %fp, -8, %o0 2008730: 92 06 e0 08 add %i3, 8, %o1 2008734: 96 10 00 1a mov %i2, %o3 2008738: 15 00 80 20 sethi %hi(0x2008000), %o2 200873c: 40 00 02 cc call 200926c 2008740: 94 12 a0 40 or %o2, 0x40, %o2 ! 2008040 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2008744: 82 92 20 00 orcc %o0, 0, %g1 2008748: 12 80 00 25 bne 20087dc <== NEVER TAKEN 200874c: 90 10 00 1b mov %i3, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); return result; } ++aio_request_queue.active_threads; 2008750: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 2008754: 82 00 60 01 inc %g1 2008758: 10 bf ff dd b 20086cc 200875c: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2008760: 11 00 80 83 sethi %hi(0x2020c00), %o0 2008764: d2 00 40 00 ld [ %g1 ], %o1 2008768: 90 12 23 e8 or %o0, 0x3e8, %o0 200876c: 7f ff ff 3d call 2008460 2008770: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2008774: 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); 2008778: b4 10 00 08 mov %o0, %i2 200877c: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 2008780: 80 a0 60 01 cmp %g1, 1 2008784: 02 80 00 0b be 20087b0 2008788: 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); 200878c: 7f ff fe d8 call 20082ec 2008790: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 2008794: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 2008798: 80 a0 60 00 cmp %g1, 0 200879c: 04 bf ff cc ble 20086cc <== ALWAYS TAKEN 20087a0: 01 00 00 00 nop pthread_cond_signal (&aio_request_queue.new_req); 20087a4: 40 00 00 fa call 2008b8c <== NOT EXECUTED 20087a8: 90 06 e0 04 add %i3, 4, %o0 <== NOT EXECUTED 20087ac: 30 bf ff c8 b,a 20086cc <== NOT EXECUTED 20087b0: 40 00 09 0d call 200abe4 <_Chain_Insert> 20087b4: 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); 20087b8: 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; 20087bc: c0 26 a0 18 clr [ %i2 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 20087c0: 40 00 01 bf call 2008ebc 20087c4: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 20087c8: 90 06 a0 20 add %i2, 0x20, %o0 20087cc: 40 00 00 c0 call 2008acc 20087d0: 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) 20087d4: 10 bf ff f1 b 2008798 20087d8: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, rtems_aio_handle, (void *) r_chain); if (result != 0) { pthread_mutex_unlock (&aio_request_queue.mutex); 20087dc: 40 00 02 30 call 200909c <== NOT EXECUTED 20087e0: b8 10 00 01 mov %g1, %i4 <== NOT EXECUTED return result; 20087e4: 30 bf ff bc b,a 20086d4 <== NOT EXECUTED =============================================================================== 02008040 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2008040: 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); 2008044: 37 00 80 83 sethi %hi(0x2020c00), %i3 2008048: b8 06 20 1c add %i0, 0x1c, %i4 200804c: b6 16 e3 94 or %i3, 0x394, %i3 if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2008050: b2 10 00 1b mov %i3, %i1 2008054: a0 10 00 1b mov %i3, %l0 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)) { 2008058: a2 06 e0 58 add %i3, 0x58, %l1 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 && 200805c: b4 06 e0 4c add %i3, 0x4c, %i2 /* 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); 2008060: 40 00 03 ef call 200901c 2008064: 90 10 00 1c mov %i4, %o0 if (result != 0) 2008068: 80 a2 20 00 cmp %o0, 0 200806c: 12 80 00 2b bne 2008118 <== NEVER TAKEN 2008070: 01 00 00 00 nop 2008074: 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 ); 2008078: 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)) { 200807c: 80 a7 40 01 cmp %i5, %g1 2008080: 02 80 00 41 be 2008184 2008084: 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); 2008088: 40 00 06 22 call 2009910 200808c: 01 00 00 00 nop 2008090: 92 07 bf fc add %fp, -4, %o1 2008094: 40 00 05 17 call 20094f0 2008098: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 200809c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 20080a0: 40 00 06 1c call 2009910 20080a4: c2 27 bf d8 st %g1, [ %fp + -40 ] 20080a8: d2 07 60 08 ld [ %i5 + 8 ], %o1 20080ac: 40 00 06 1d call 2009920 20080b0: 94 07 bf d8 add %fp, -40, %o2 20080b4: 40 00 0a b4 call 200ab84 <_Chain_Extract> 20080b8: 90 10 00 1d mov %i5, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 20080bc: 40 00 03 f8 call 200909c 20080c0: 90 10 00 1c mov %i4, %o0 switch (req->aiocbp->aio_lio_opcode) { 20080c4: e4 07 60 14 ld [ %i5 + 0x14 ], %l2 20080c8: c2 04 a0 30 ld [ %l2 + 0x30 ], %g1 20080cc: 80 a0 60 02 cmp %g1, 2 20080d0: 22 80 00 25 be,a 2008164 20080d4: c4 1c a0 08 ldd [ %l2 + 8 ], %g2 20080d8: 80 a0 60 03 cmp %g1, 3 20080dc: 02 80 00 1e be 2008154 <== NEVER TAKEN 20080e0: 01 00 00 00 nop 20080e4: 80 a0 60 01 cmp %g1, 1 20080e8: 22 80 00 0e be,a 2008120 <== ALWAYS TAKEN 20080ec: c4 1c a0 08 ldd [ %l2 + 8 ], %g2 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 20080f0: 82 10 3f ff mov -1, %g1 <== NOT EXECUTED req->aiocbp->error_code = errno; 20080f4: 40 00 2a 6c call 2012aa4 <__errno> <== NOT EXECUTED 20080f8: c2 24 a0 38 st %g1, [ %l2 + 0x38 ] <== NOT EXECUTED 20080fc: 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); 2008100: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED 2008104: 40 00 03 c6 call 200901c <== NOT EXECUTED 2008108: c2 24 a0 34 st %g1, [ %l2 + 0x34 ] <== NOT EXECUTED if (result != 0) 200810c: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 2008110: 22 bf ff da be,a 2008078 <== NOT EXECUTED 2008114: fa 06 20 08 ld [ %i0 + 8 ], %i5 <== NOT EXECUTED } } AIO_printf ("Thread finished\n"); return NULL; } 2008118: 81 c7 e0 08 ret 200811c: 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, 2008120: d0 04 80 00 ld [ %l2 ], %o0 2008124: d2 04 a0 10 ld [ %l2 + 0x10 ], %o1 2008128: d4 04 a0 14 ld [ %l2 + 0x14 ], %o2 200812c: 96 10 00 02 mov %g2, %o3 2008130: 40 00 2d 6c call 20136e0 2008134: 98 10 00 03 mov %g3, %o4 break; default: result = -1; } if (result == -1) { 2008138: 80 a2 3f ff cmp %o0, -1 200813c: 22 bf ff ed be,a 20080f0 <== NEVER TAKEN 2008140: e4 07 60 14 ld [ %i5 + 0x14 ], %l2 <== NOT EXECUTED req->aiocbp->return_value = -1; req->aiocbp->error_code = errno; } else { req->aiocbp->return_value = result; 2008144: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2008148: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 200814c: 10 bf ff c5 b 2008060 2008150: 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); 2008154: 40 00 1c 16 call 200f1ac <== NOT EXECUTED 2008158: d0 04 80 00 ld [ %l2 ], %o0 <== NOT EXECUTED break; 200815c: 10 bf ff f8 b 200813c <== NOT EXECUTED 2008160: 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, 2008164: d0 04 80 00 ld [ %l2 ], %o0 2008168: d2 04 a0 10 ld [ %l2 + 0x10 ], %o1 200816c: d4 04 a0 14 ld [ %l2 + 0x14 ], %o2 2008170: 96 10 00 02 mov %g2, %o3 2008174: 40 00 2d 99 call 20137d8 2008178: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 200817c: 10 bf ff f0 b 200813c 2008180: 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); 2008184: 40 00 03 c6 call 200909c 2008188: 90 10 00 1c mov %i4, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 200818c: 40 00 03 a4 call 200901c 2008190: 90 10 00 1b mov %i3, %o0 if (rtems_chain_is_empty (chain)) 2008194: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008198: 80 a7 40 01 cmp %i5, %g1 200819c: 02 80 00 05 be 20081b0 <== ALWAYS TAKEN 20081a0: 92 07 bf f4 add %fp, -12, %o1 } } /* If there was a request added in the initial fd chain then release the mutex and process it */ pthread_mutex_unlock (&aio_request_queue.mutex); 20081a4: 40 00 03 be call 200909c 20081a8: 90 10 00 1b mov %i3, %o0 20081ac: 30 bf ff ad b,a 2008060 pthread_mutex_unlock (&r_chain->mutex); pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); 20081b0: 40 00 01 da call 2008918 20081b4: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20081b8: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20081bc: c0 27 bf f8 clr [ %fp + -8 ] pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20081c0: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20081c4: 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; 20081c8: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 20081cc: 90 10 00 1d mov %i5, %o0 20081d0: 92 10 00 19 mov %i1, %o1 20081d4: 40 00 02 8d call 2008c08 20081d8: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no requests were added to the chain we delete the fd chain from the queue and start working with idle fd chains */ if (result == ETIMEDOUT) { 20081dc: 80 a2 20 74 cmp %o0, 0x74 20081e0: 12 bf ff f1 bne 20081a4 <== NEVER TAKEN 20081e4: 01 00 00 00 nop 20081e8: 40 00 0a 67 call 200ab84 <_Chain_Extract> 20081ec: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 20081f0: 40 00 02 e0 call 2008d70 20081f4: 90 10 00 1c mov %i4, %o0 pthread_cond_destroy (&r_chain->cond); 20081f8: 40 00 01 ff call 20089f4 20081fc: 90 10 00 1d mov %i5, %o0 free (r_chain); 2008200: 7f ff ee de call 2003d78 2008204: 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; 2008208: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { 200820c: 80 a6 00 11 cmp %i0, %l1 2008210: 22 80 00 1d be,a 2008284 2008214: c4 06 e0 68 ld [ %i3 + 0x68 ], %g2 } } /* Otherwise move this chain to the working chain and start the loop all over again */ AIO_printf ("Work on idle\n"); --aio_request_queue.idle_threads; 2008218: c4 04 20 68 ld [ %l0 + 0x68 ], %g2 ++aio_request_queue.active_threads; 200821c: c2 04 20 64 ld [ %l0 + 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; 2008220: 84 00 bf ff add %g2, -1, %g2 ++aio_request_queue.active_threads; 2008224: 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; 2008228: c4 24 20 68 st %g2, [ %l0 + 0x68 ] ++aio_request_queue.active_threads; 200822c: c2 24 20 64 st %g1, [ %l0 + 0x64 ] 2008230: 40 00 0a 55 call 200ab84 <_Chain_Extract> 2008234: 90 10 00 18 mov %i0, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2008238: c2 04 20 48 ld [ %l0 + 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 && 200823c: c6 06 20 14 ld [ %i0 + 0x14 ], %g3 2008240: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 2008244: 80 a0 80 03 cmp %g2, %g3 2008248: 06 80 00 08 bl 2008268 <== ALWAYS TAKEN 200824c: 80 a0 40 1a cmp %g1, %i2 RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2008250: 10 80 00 09 b 2008274 <== NOT EXECUTED 2008254: d0 00 60 04 ld [ %g1 + 4 ], %o0 <== NOT EXECUTED 2008258: c4 00 60 14 ld [ %g1 + 0x14 ], %g2 200825c: 80 a0 c0 02 cmp %g3, %g2 2008260: 04 80 00 04 ble 2008270 2008264: 80 a0 40 1a cmp %g1, %i2 2008268: 32 bf ff fc bne,a 2008258 <== ALWAYS TAKEN 200826c: c2 00 40 00 ld [ %g1 ], %g1 2008270: d0 00 60 04 ld [ %g1 + 4 ], %o0 2008274: 92 10 00 18 mov %i0, %o1 2008278: 40 00 0a 5b call 200abe4 <_Chain_Insert> 200827c: b8 06 20 1c add %i0, 0x1c, %i4 2008280: 30 bf ff c9 b,a 20081a4 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; 2008284: c2 06 e0 64 ld [ %i3 + 0x64 ], %g1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 2008288: 84 00 a0 01 inc %g2 --aio_request_queue.active_threads; 200828c: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2008290: 92 07 bf f4 add %fp, -12, %o1 /* If the idle chain is empty sleep for 3 seconds and wait for a signal. The thread now becomes idle. */ if (rtems_chain_is_empty (&aio_request_queue.idle_req)) { AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; 2008294: c4 26 e0 68 st %g2, [ %i3 + 0x68 ] --aio_request_queue.active_threads; 2008298: c2 26 e0 64 st %g1, [ %i3 + 0x64 ] clock_gettime (CLOCK_REALTIME, &timeout); 200829c: 40 00 01 9f call 2008918 20082a0: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 20082a4: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 20082a8: c0 27 bf f8 clr [ %fp + -8 ] AIO_printf ("Chain is empty [IQ], wait for work\n"); ++aio_request_queue.idle_threads; --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 20082ac: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20082b0: 90 06 e0 04 add %i3, 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; 20082b4: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 20082b8: 92 10 00 1b mov %i3, %o1 20082bc: 40 00 02 53 call 2008c08 20082c0: 94 07 bf f4 add %fp, -12, %o2 &aio_request_queue.mutex, &timeout); /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { 20082c4: 80 a2 20 74 cmp %o0, 0x74 20082c8: 22 80 00 04 be,a 20082d8 <== ALWAYS TAKEN 20082cc: c2 06 e0 68 ld [ %i3 + 0x68 ], %g1 20082d0: 10 bf ff d2 b 2008218 <== NOT EXECUTED 20082d4: f0 06 e0 54 ld [ %i3 + 0x54 ], %i0 <== NOT EXECUTED AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 20082d8: 90 10 00 1b mov %i3, %o0 /* If no new fd chain was added in the idle requests then this thread is finished */ if (result == ETIMEDOUT) { AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; 20082dc: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20082e0: 40 00 03 6f call 200909c 20082e4: c2 26 e0 68 st %g1, [ %i3 + 0x68 ] return NULL; 20082e8: 30 bf ff 8c b,a 2008118 =============================================================================== 02008358 : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2008358: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 200835c: 3b 00 80 83 sethi %hi(0x2020c00), %i5 2008360: 40 00 03 a8 call 2009200 2008364: 90 17 63 9c or %i5, 0x39c, %o0 ! 2020f9c if (result != 0) 2008368: b0 92 20 00 orcc %o0, 0, %i0 200836c: 12 80 00 23 bne 20083f8 <== NEVER TAKEN 2008370: 90 17 63 9c or %i5, 0x39c, %o0 return result; result = 2008374: 40 00 03 af call 2009230 2008378: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 200837c: 80 a2 20 00 cmp %o0, 0 2008380: 12 80 00 20 bne 2008400 <== NEVER TAKEN 2008384: 39 00 80 83 sethi %hi(0x2020c00), %i4 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2008388: 92 10 20 00 clr %o1 200838c: 40 00 02 cc call 2008ebc 2008390: 90 17 23 94 or %i4, 0x394, %o0 if (result != 0) 2008394: 80 a2 20 00 cmp %o0, 0 2008398: 12 80 00 23 bne 2008424 <== NEVER TAKEN 200839c: 92 10 20 00 clr %o1 pthread_attr_destroy (&aio_request_queue.attr); result = pthread_cond_init (&aio_request_queue.new_req, NULL); 20083a0: 11 00 80 83 sethi %hi(0x2020c00), %o0 20083a4: 40 00 01 ca call 2008acc 20083a8: 90 12 23 98 or %o0, 0x398, %o0 ! 2020f98 if (result != 0) { 20083ac: b0 92 20 00 orcc %o0, 0, %i0 20083b0: 12 80 00 26 bne 2008448 <== NEVER TAKEN 20083b4: 01 00 00 00 nop ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083b8: b8 17 23 94 or %i4, 0x394, %i4 head->previous = NULL; tail->previous = head; 20083bc: 82 07 20 54 add %i4, 0x54, %g1 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083c0: 88 07 20 4c add %i4, 0x4c, %g4 head->previous = NULL; tail->previous = head; 20083c4: 86 07 20 48 add %i4, 0x48, %g3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083c8: 84 07 20 58 add %i4, 0x58, %g2 head->previous = NULL; tail->previous = head; 20083cc: c2 27 20 5c st %g1, [ %i4 + 0x5c ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083d0: c8 27 20 48 st %g4, [ %i4 + 0x48 ] head->previous = NULL; 20083d4: c0 27 20 4c clr [ %i4 + 0x4c ] tail->previous = head; 20083d8: c6 27 20 50 st %g3, [ %i4 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20083dc: c4 27 20 54 st %g2, [ %i4 + 0x54 ] head->previous = NULL; 20083e0: c0 27 20 58 clr [ %i4 + 0x58 ] } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 20083e4: c0 27 20 64 clr [ %i4 + 0x64 ] aio_request_queue.idle_threads = 0; 20083e8: c0 27 20 68 clr [ %i4 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 20083ec: 03 00 00 2c sethi %hi(0xb000), %g1 20083f0: 82 10 60 0b or %g1, 0xb, %g1 ! b00b 20083f4: c2 27 20 60 st %g1, [ %i4 + 0x60 ] return result; } 20083f8: 81 c7 e0 08 ret 20083fc: 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); 2008400: 40 00 03 74 call 20091d0 <== NOT EXECUTED 2008404: 90 17 63 9c or %i5, 0x39c, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2008408: 39 00 80 83 sethi %hi(0x2020c00), %i4 <== NOT EXECUTED 200840c: 92 10 20 00 clr %o1 <== NOT EXECUTED 2008410: 40 00 02 ab call 2008ebc <== NOT EXECUTED 2008414: 90 17 23 94 or %i4, 0x394, %o0 <== NOT EXECUTED if (result != 0) 2008418: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 200841c: 02 bf ff e1 be 20083a0 <== NOT EXECUTED 2008420: 92 10 20 00 clr %o1 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2008424: 40 00 03 6b call 20091d0 <== NOT EXECUTED 2008428: 90 17 63 9c or %i5, 0x39c, %o0 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 200842c: 92 10 20 00 clr %o1 <== NOT EXECUTED 2008430: 11 00 80 83 sethi %hi(0x2020c00), %o0 <== NOT EXECUTED 2008434: 40 00 01 a6 call 2008acc <== NOT EXECUTED 2008438: 90 12 23 98 or %o0, 0x398, %o0 ! 2020f98 <== NOT EXECUTED if (result != 0) { 200843c: b0 92 20 00 orcc %o0, 0, %i0 <== NOT EXECUTED 2008440: 22 bf ff df be,a 20083bc <== NOT EXECUTED 2008444: b8 17 23 94 or %i4, 0x394, %i4 <== NOT EXECUTED pthread_mutex_destroy (&aio_request_queue.mutex); 2008448: 40 00 02 4a call 2008d70 <== NOT EXECUTED 200844c: 90 17 23 94 or %i4, 0x394, %o0 <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2008450: 40 00 03 60 call 20091d0 <== NOT EXECUTED 2008454: 90 17 63 9c or %i5, 0x39c, %o0 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2008458: 10 bf ff d9 b 20083bc <== NOT EXECUTED 200845c: b8 17 23 94 or %i4, 0x394, %i4 <== NOT EXECUTED =============================================================================== 020082ec : * NONE */ static void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 20082ec: 9d e3 bf a0 save %sp, -96, %sp 20082f0: 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 ); 20082f4: 84 06 20 04 add %i0, 4, %g2 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 20082f8: 80 a0 40 02 cmp %g1, %g2 20082fc: 02 80 00 15 be 2008350 <== NEVER TAKEN 2008300: 86 10 00 19 mov %i1, %g3 rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2008304: de 06 60 14 ld [ %i1 + 0x14 ], %o7 if (rtems_chain_is_empty (chain)) { AIO_printf ("First in chain \n"); rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2008308: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 200830c: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 2008310: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 2008314: 80 a1 00 0f cmp %g4, %o7 2008318: 26 80 00 07 bl,a 2008334 <== NEVER TAKEN 200831c: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED 2008320: 10 80 00 0b b 200834c 2008324: f0 00 60 04 ld [ %g1 + 4 ], %i0 2008328: 22 80 00 09 be,a 200834c <== NOT EXECUTED 200832c: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 2008330: 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; 2008334: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED rtems_chain_prepend (chain, &req->next_prio); } else { AIO_printf ("Add by priority \n"); int prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; while (req->aiocbp->aio_reqprio > prio && 2008338: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 <== NOT EXECUTED 200833c: 80 a1 00 0f cmp %g4, %o7 <== NOT EXECUTED 2008340: 06 bf ff fa bl 2008328 <== NOT EXECUTED 2008344: 80 a0 80 01 cmp %g2, %g1 <== NOT EXECUTED 2008348: f0 00 60 04 ld [ %g1 + 4 ], %i0 <== NOT EXECUTED 200834c: b2 10 00 03 mov %g3, %i1 2008350: 40 00 0a 25 call 200abe4 <_Chain_Insert> 2008354: 81 e8 00 00 restore =============================================================================== 02008544 : * Output parameters: * NONE */ void rtems_aio_remove_fd (rtems_aio_request_chain *r_chain) { 2008544: 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; 2008548: fa 06 20 08 ld [ %i0 + 8 ], %i5 while (!rtems_chain_is_tail (chain, node)) { rtems_chain_extract (node); rtems_aio_request *req = (rtems_aio_request *) node; node = rtems_chain_next (node); req->aiocbp->error_code = ECANCELED; 200854c: b4 10 20 8c mov 0x8c, %i2 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 )); 2008550: 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)) 2008554: 80 a7 40 18 cmp %i5, %i0 2008558: 02 80 00 0d be 200858c <== NEVER TAKEN 200855c: b6 10 3f ff mov -1, %i3 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2008560: 40 00 09 89 call 200ab84 <_Chain_Extract> 2008564: 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; 2008568: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Next( Chain_Node *the_node ) { return the_node->next; 200856c: f8 07 40 00 ld [ %i5 ], %i4 req->aiocbp->return_value = -1; free (req); 2008570: 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; 2008574: f4 20 60 34 st %i2, [ %g1 + 0x34 ] req->aiocbp->return_value = -1; free (req); 2008578: 7f ff ee 00 call 2003d78 200857c: f6 20 60 38 st %i3, [ %g1 + 0x38 ] rtems_chain_control *chain; rtems_chain_node *node; chain = &r_chain->perfd; node = rtems_chain_first (chain); while (!rtems_chain_is_tail (chain, node)) 2008580: 80 a7 00 18 cmp %i4, %i0 2008584: 12 bf ff f7 bne 2008560 2008588: ba 10 00 1c mov %i4, %i5 200858c: 81 c7 e0 08 ret 2008590: 81 e8 00 00 restore =============================================================================== 02008594 : * 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) { 2008594: 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; 2008598: 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 ); 200859c: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 20085a0: 80 a7 40 01 cmp %i5, %g1 20085a4: 12 80 00 06 bne 20085bc 20085a8: b0 10 20 02 mov 2, %i0 20085ac: 30 80 00 14 b,a 20085fc 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) { 20085b0: 80 a0 40 1d cmp %g1, %i5 <== NOT EXECUTED 20085b4: 02 80 00 10 be 20085f4 <== NOT EXECUTED 20085b8: b0 10 20 01 mov 1, %i0 <== NOT EXECUTED 20085bc: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 20085c0: 80 a0 80 19 cmp %g2, %i1 20085c4: 32 bf ff fb bne,a 20085b0 <== NEVER TAKEN 20085c8: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 20085cc: 40 00 09 6e call 200ab84 <_Chain_Extract> 20085d0: 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; 20085d4: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 20085d8: 84 10 20 8c mov 0x8c, %g2 20085dc: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 20085e0: 84 10 3f ff mov -1, %g2 free (current); 20085e4: 90 10 00 1d mov %i5, %o0 return AIO_NOTCANCELED; else { rtems_chain_extract (node); current->aiocbp->error_code = ECANCELED; current->aiocbp->return_value = -1; 20085e8: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 20085ec: 7f ff ed e3 call 2003d78 20085f0: b0 10 20 00 clr %i0 } return AIO_CANCELED; 20085f4: 81 c7 e0 08 ret 20085f8: 81 e8 00 00 restore } 20085fc: 81 c7 e0 08 ret 2008600: 81 e8 00 00 restore =============================================================================== 02008934 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2008934: 9d e3 bf 98 save %sp, -104, %sp 2008938: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 200893c: 40 00 01 a9 call 2008fe0 <_Chain_Get> 2008940: 90 10 00 1d mov %i5, %o0 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2008944: 92 10 20 00 clr %o1 2008948: b8 10 00 08 mov %o0, %i4 200894c: 94 10 00 1a mov %i2, %o2 2008950: 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 2008954: 80 a7 20 00 cmp %i4, 0 2008958: 12 80 00 0a bne 2008980 200895c: 96 07 bf fc add %fp, -4, %o3 ) { rtems_event_set out; sc = rtems_event_receive( 2008960: 7f ff fc f4 call 2007d30 2008964: 01 00 00 00 nop ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2008968: 80 a2 20 00 cmp %o0, 0 200896c: 02 bf ff f4 be 200893c <== NEVER TAKEN 2008970: b0 10 00 08 mov %o0, %i0 timeout, &out ); } *node_ptr = node; 2008974: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2008978: 81 c7 e0 08 ret 200897c: 81 e8 00 00 restore rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2008980: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2008984: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2008988: 81 c7 e0 08 ret 200898c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009940 : 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 ) { 2009940: 9d e3 bf a0 save %sp, -96, %sp rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2009944: 03 00 80 8b sethi %hi(0x2022c00), %g1 2009948: c4 00 63 28 ld [ %g1 + 0x328 ], %g2 ! 2022f28 <_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 ) { 200994c: 86 10 00 19 mov %i1, %g3 rtems_device_major_number major_limit = _IO_Number_of_drivers; 2009950: 03 00 80 8c sethi %hi(0x2023000), %g1 if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; 2009954: 88 10 20 12 mov 0x12, %g4 rtems_device_major_number *registered_major ) { rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) 2009958: 80 a0 a0 00 cmp %g2, 0 200995c: 02 80 00 04 be 200996c 2009960: de 00 63 64 ld [ %g1 + 0x364 ], %o7 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2009964: 81 c7 e0 08 ret 2009968: 91 e8 00 04 restore %g0, %g4, %o0 rtems_device_major_number major_limit = _IO_Number_of_drivers; if ( rtems_interrupt_is_in_progress() ) return RTEMS_CALLED_FROM_ISR; if ( registered_major == NULL ) 200996c: 80 a6 a0 00 cmp %i2, 0 2009970: 02 80 00 40 be 2009a70 2009974: 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 ) 2009978: 02 80 00 3e be 2009a70 200997c: de 26 80 00 st %o7, [ %i2 ] static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2009980: c4 06 40 00 ld [ %i1 ], %g2 2009984: 80 a0 a0 00 cmp %g2, 0 2009988: 22 80 00 37 be,a 2009a64 200998c: 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 ) 2009990: 80 a3 c0 18 cmp %o7, %i0 2009994: 08 bf ff f4 bleu 2009964 2009998: 88 10 20 0a mov 0xa, %g4 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200999c: 05 00 80 8a sethi %hi(0x2022800), %g2 20099a0: c8 00 a1 e0 ld [ %g2 + 0x1e0 ], %g4 ! 20229e0 <_Thread_Dispatch_disable_level> 20099a4: 88 01 20 01 inc %g4 20099a8: c8 20 a1 e0 st %g4, [ %g2 + 0x1e0 ] return _Thread_Dispatch_disable_level; 20099ac: c4 00 a1 e0 ld [ %g2 + 0x1e0 ], %g2 return RTEMS_INVALID_NUMBER; _Thread_Disable_dispatch(); if ( major == 0 ) { 20099b0: 80 a6 20 00 cmp %i0, 0 20099b4: 12 80 00 32 bne 2009a7c 20099b8: 1f 00 80 8c sethi %hi(0x2023000), %o7 static rtems_status_code rtems_io_obtain_major_number( rtems_device_major_number *major ) { rtems_device_major_number n = _IO_Number_of_drivers; 20099bc: c8 00 63 64 ld [ %g1 + 0x364 ], %g4 rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 20099c0: 80 a1 20 00 cmp %g4, 0 20099c4: 02 80 00 45 be 2009ad8 <== NEVER TAKEN 20099c8: c2 03 e3 68 ld [ %o7 + 0x368 ], %g1 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 20099cc: 10 80 00 06 b 20099e4 20099d0: c4 00 40 00 ld [ %g1 ], %g2 rtems_device_major_number n = _IO_Number_of_drivers; rtems_device_major_number m = 0; /* major is error checked by caller */ for ( m = 0; m < n; ++m ) { 20099d4: 80 a6 00 04 cmp %i0, %g4 20099d8: 02 80 00 35 be 2009aac 20099dc: 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; 20099e0: c4 00 40 00 ld [ %g1 ], %g2 20099e4: 80 a0 a0 00 cmp %g2, 0 20099e8: 32 bf ff fb bne,a 20099d4 20099ec: b0 06 20 01 inc %i0 20099f0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20099f4: 80 a0 a0 00 cmp %g2, 0 20099f8: 32 bf ff f7 bne,a 20099d4 20099fc: b0 06 20 01 inc %i0 if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009a00: f0 26 80 00 st %i0, [ %i2 ] 2009a04: 83 2e 20 03 sll %i0, 3, %g1 if ( m != n ) 2009a08: 80 a1 00 18 cmp %g4, %i0 2009a0c: 02 80 00 29 be 2009ab0 <== NEVER TAKEN 2009a10: 9b 2e 20 05 sll %i0, 5, %o5 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009a14: c8 00 c0 00 ld [ %g3 ], %g4 2009a18: c4 03 e3 68 ld [ %o7 + 0x368 ], %g2 2009a1c: 82 23 40 01 sub %o5, %g1, %g1 2009a20: c8 20 80 01 st %g4, [ %g2 + %g1 ] 2009a24: c8 00 e0 04 ld [ %g3 + 4 ], %g4 2009a28: 82 00 80 01 add %g2, %g1, %g1 2009a2c: c8 20 60 04 st %g4, [ %g1 + 4 ] 2009a30: c4 00 e0 08 ld [ %g3 + 8 ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2009a34: b2 10 20 00 clr %i1 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009a38: c4 20 60 08 st %g2, [ %g1 + 8 ] 2009a3c: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); 2009a40: b4 10 20 00 clr %i2 } *registered_major = major; } _IO_Driver_address_table [major] = *driver_table; 2009a44: c4 20 60 0c st %g2, [ %g1 + 0xc ] 2009a48: c4 00 e0 10 ld [ %g3 + 0x10 ], %g2 2009a4c: c4 20 60 10 st %g2, [ %g1 + 0x10 ] 2009a50: c4 00 e0 14 ld [ %g3 + 0x14 ], %g2 _Thread_Enable_dispatch(); 2009a54: 40 00 08 3f call 200bb50 <_Thread_Enable_dispatch> 2009a58: c4 20 60 14 st %g2, [ %g1 + 0x14 ] return rtems_io_initialize( major, 0, NULL ); 2009a5c: 40 00 21 11 call 2011ea0 2009a60: 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; 2009a64: 80 a0 a0 00 cmp %g2, 0 2009a68: 12 bf ff cb bne 2009994 2009a6c: 80 a3 c0 18 cmp %o7, %i0 if ( driver_table == NULL ) return RTEMS_INVALID_ADDRESS; if ( rtems_io_is_empty_table( driver_table ) ) return RTEMS_INVALID_ADDRESS; 2009a70: 88 10 20 09 mov 9, %g4 _IO_Driver_address_table [major] = *driver_table; _Thread_Enable_dispatch(); return rtems_io_initialize( major, 0, NULL ); } 2009a74: 81 c7 e0 08 ret 2009a78: 91 e8 00 04 restore %g0, %g4, %o0 _Thread_Enable_dispatch(); return sc; } major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; 2009a7c: c8 03 e3 68 ld [ %o7 + 0x368 ], %g4 2009a80: 83 2e 20 03 sll %i0, 3, %g1 2009a84: 9b 2e 20 05 sll %i0, 5, %o5 2009a88: 84 23 40 01 sub %o5, %g1, %g2 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2009a8c: d8 01 00 02 ld [ %g4 + %g2 ], %o4 2009a90: 80 a3 20 00 cmp %o4, 0 2009a94: 02 80 00 0b be 2009ac0 2009a98: 84 01 00 02 add %g4, %g2, %g2 major = *registered_major; } else { rtems_driver_address_table *const table = _IO_Driver_address_table + major; if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); 2009a9c: 40 00 08 2d call 200bb50 <_Thread_Enable_dispatch> 2009aa0: 01 00 00 00 nop return RTEMS_RESOURCE_IN_USE; 2009aa4: 10 bf ff b0 b 2009964 2009aa8: 88 10 20 0c mov 0xc, %g4 ! c if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009aac: f0 26 80 00 st %i0, [ %i2 ] if ( major == 0 ) { rtems_status_code sc = rtems_io_obtain_major_number( registered_major ); if ( sc != RTEMS_SUCCESSFUL ) { _Thread_Enable_dispatch(); 2009ab0: 40 00 08 28 call 200bb50 <_Thread_Enable_dispatch> 2009ab4: 01 00 00 00 nop return sc; 2009ab8: 10 bf ff ab b 2009964 2009abc: 88 10 20 05 mov 5, %g4 ! 5 static inline bool rtems_io_is_empty_table( const rtems_driver_address_table *table ) { return table->initialization_entry == NULL && table->open_entry == NULL; 2009ac0: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2009ac4: 80 a0 a0 00 cmp %g2, 0 2009ac8: 12 bf ff f5 bne 2009a9c 2009acc: 01 00 00 00 nop if ( !rtems_io_is_empty_table( table ) ) { _Thread_Enable_dispatch(); return RTEMS_RESOURCE_IN_USE; } *registered_major = major; 2009ad0: 10 bf ff d1 b 2009a14 2009ad4: f0 26 80 00 st %i0, [ %i2 ] if ( rtems_io_is_empty_table( table ) ) break; } /* Assigns invalid value in case of failure */ *major = m; 2009ad8: 10 bf ff f6 b 2009ab0 <== NOT EXECUTED 2009adc: c0 26 80 00 clr [ %i2 ] <== NOT EXECUTED =============================================================================== 0200aab8 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 200aab8: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200aabc: 80 a6 20 00 cmp %i0, 0 200aac0: 02 80 00 20 be 200ab40 <== NEVER TAKEN 200aac4: 37 00 80 85 sethi %hi(0x2021400), %i3 200aac8: b6 16 e0 1c or %i3, 0x1c, %i3 ! 202141c <_Objects_Information_table+0x4> #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200aacc: 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 ]; 200aad0: c2 06 c0 00 ld [ %i3 ], %g1 200aad4: f8 00 60 04 ld [ %g1 + 4 ], %i4 if ( !information ) 200aad8: 80 a7 20 00 cmp %i4, 0 200aadc: 22 80 00 16 be,a 200ab34 200aae0: b6 06 e0 04 add %i3, 4, %i3 continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200aae4: c2 17 20 10 lduh [ %i4 + 0x10 ], %g1 200aae8: 84 90 60 00 orcc %g1, 0, %g2 200aaec: 22 80 00 12 be,a 200ab34 200aaf0: b6 06 e0 04 add %i3, 4, %i3 200aaf4: ba 10 20 01 mov 1, %i5 the_thread = (Thread_Control *)information->local_table[ i ]; 200aaf8: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200aafc: 83 2f 60 02 sll %i5, 2, %g1 200ab00: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 if ( !the_thread ) 200ab04: 90 90 60 00 orcc %g1, 0, %o0 200ab08: 02 80 00 05 be 200ab1c 200ab0c: ba 07 60 01 inc %i5 continue; (*routine)(the_thread); 200ab10: 9f c6 00 00 call %i0 200ab14: 01 00 00 00 nop 200ab18: c4 17 20 10 lduh [ %i4 + 0x10 ], %g2 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200ab1c: 83 28 a0 10 sll %g2, 0x10, %g1 200ab20: 83 30 60 10 srl %g1, 0x10, %g1 200ab24: 80 a0 40 1d cmp %g1, %i5 200ab28: 3a bf ff f5 bcc,a 200aafc 200ab2c: c6 07 20 1c ld [ %i4 + 0x1c ], %g3 200ab30: 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++ ) { 200ab34: 80 a6 c0 1a cmp %i3, %i2 200ab38: 32 bf ff e7 bne,a 200aad4 200ab3c: c2 06 c0 00 ld [ %i3 ], %g1 200ab40: 81 c7 e0 08 ret 200ab44: 81 e8 00 00 restore =============================================================================== 020095a4 : rtems_status_code rtems_object_get_class_information( int the_api, int the_class, rtems_object_api_class_information *info ) { 20095a4: 9d e3 bf a0 save %sp, -96, %sp 20095a8: 90 10 00 18 mov %i0, %o0 int i; /* * Validate parameters and look up information structure. */ if ( !info ) 20095ac: 80 a6 a0 00 cmp %i2, 0 20095b0: 02 80 00 21 be 2009634 20095b4: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 20095b8: 93 2e 60 10 sll %i1, 0x10, %o1 if ( !obj_info ) return RTEMS_INVALID_NUMBER; 20095bc: b0 10 20 0a mov 0xa, %i0 * Validate parameters and look up information structure. */ if ( !info ) return RTEMS_INVALID_ADDRESS; obj_info = _Objects_Get_information( the_api, the_class ); 20095c0: 40 00 07 90 call 200b400 <_Objects_Get_information> 20095c4: 93 32 60 10 srl %o1, 0x10, %o1 if ( !obj_info ) 20095c8: 80 a2 20 00 cmp %o0, 0 20095cc: 02 80 00 1a be 2009634 20095d0: 01 00 00 00 nop /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 20095d4: c4 02 20 0c ld [ %o0 + 0xc ], %g2 info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; 20095d8: 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; 20095dc: c6 02 20 08 ld [ %o0 + 8 ], %g3 info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 20095e0: c2 0a 20 12 ldub [ %o0 + 0x12 ], %g1 /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; 20095e4: c4 26 a0 04 st %g2, [ %i2 + 4 ] return RTEMS_INVALID_NUMBER; /* * Return information about this object class to the user. */ info->minimum_id = obj_info->minimum_id; 20095e8: c6 26 80 00 st %g3, [ %i2 ] info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; 20095ec: c2 2e a0 0c stb %g1, [ %i2 + 0xc ] info->maximum = obj_info->maximum; 20095f0: c8 26 a0 08 st %g4, [ %i2 + 8 ] for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 20095f4: 80 a1 20 00 cmp %g4, 0 20095f8: 02 80 00 0d be 200962c <== NEVER TAKEN 20095fc: 84 10 20 00 clr %g2 2009600: de 02 20 1c ld [ %o0 + 0x1c ], %o7 2009604: 86 10 20 01 mov 1, %g3 2009608: 82 10 20 01 mov 1, %g1 if ( !obj_info->local_table[i] ) 200960c: 87 28 e0 02 sll %g3, 2, %g3 2009610: c6 03 c0 03 ld [ %o7 + %g3 ], %g3 info->minimum_id = obj_info->minimum_id; info->maximum_id = obj_info->maximum_id; info->auto_extend = obj_info->auto_extend; info->maximum = obj_info->maximum; for ( unallocated=0, i=1 ; i <= info->maximum ; i++ ) 2009614: 82 00 60 01 inc %g1 if ( !obj_info->local_table[i] ) unallocated++; 2009618: 80 a0 00 03 cmp %g0, %g3 200961c: 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++ ) 2009620: 80 a1 00 01 cmp %g4, %g1 2009624: 1a bf ff fa bcc 200960c 2009628: 86 10 00 01 mov %g1, %g3 if ( !obj_info->local_table[i] ) unallocated++; info->unallocated = unallocated; 200962c: c4 26 a0 10 st %g2, [ %i2 + 0x10 ] return RTEMS_SUCCESSFUL; 2009630: b0 10 20 00 clr %i0 } 2009634: 81 c7 e0 08 ret 2009638: 81 e8 00 00 restore =============================================================================== 020091cc : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 20091cc: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 20091d0: 80 a6 20 00 cmp %i0, 0 20091d4: 12 80 00 04 bne 20091e4 20091d8: 82 10 20 03 mov 3, %g1 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 20091dc: 81 c7 e0 08 ret 20091e0: 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 ) 20091e4: 80 a6 60 00 cmp %i1, 0 20091e8: 02 bf ff fd be 20091dc 20091ec: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 20091f0: 80 a7 60 00 cmp %i5, 0 20091f4: 02 bf ff fa be 20091dc <== NEVER TAKEN 20091f8: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 20091fc: 02 bf ff f8 be 20091dc 2009200: 82 10 20 08 mov 8, %g1 2009204: 80 a6 a0 00 cmp %i2, 0 2009208: 02 bf ff f5 be 20091dc 200920c: 80 a6 80 1b cmp %i2, %i3 2009210: 0a bf ff f3 bcs 20091dc 2009214: 80 8e e0 07 btst 7, %i3 2009218: 12 bf ff f1 bne 20091dc 200921c: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2009220: 12 bf ff ef bne 20091dc 2009224: 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++; 2009228: 03 00 80 8d sethi %hi(0x2023400), %g1 200922c: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> 2009230: 84 00 a0 01 inc %g2 2009234: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 2009238: c2 00 61 40 ld [ %g1 + 0x140 ], %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 ); 200923c: 23 00 80 8c sethi %hi(0x2023000), %l1 2009240: 40 00 07 50 call 200af80 <_Objects_Allocate> 2009244: 90 14 63 5c or %l1, 0x35c, %o0 ! 202335c <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2009248: a0 92 20 00 orcc %o0, 0, %l0 200924c: 02 80 00 1a be 20092b4 2009250: 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; 2009254: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2009258: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 200925c: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2009260: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2009264: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2009268: 40 00 48 c7 call 201b584 <.udiv> 200926c: 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, 2009270: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2009274: 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, 2009278: 96 10 00 1b mov %i3, %o3 200927c: b8 04 20 24 add %l0, 0x24, %i4 2009280: 40 00 04 81 call 200a484 <_Chain_Initialize> 2009284: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009288: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200928c: a2 14 63 5c or %l1, 0x35c, %l1 2009290: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2009294: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2009298: 85 28 a0 02 sll %g2, 2, %g2 200929c: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 20092a0: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 20092a4: 40 00 0c 9c call 200c514 <_Thread_Enable_dispatch> 20092a8: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 20092ac: 10 bf ff cc b 20091dc 20092b0: 82 10 20 00 clr %g1 _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { _Thread_Enable_dispatch(); 20092b4: 40 00 0c 98 call 200c514 <_Thread_Enable_dispatch> 20092b8: 01 00 00 00 nop return RTEMS_TOO_MANY; 20092bc: 10 bf ff c8 b 20091dc 20092c0: 82 10 20 05 mov 5, %g1 ! 5 =============================================================================== 02044aec : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2044aec: 9d e3 bf 98 save %sp, -104, %sp 2044af0: 11 00 81 d8 sethi %hi(0x2076000), %o0 2044af4: 92 10 00 18 mov %i0, %o1 2044af8: 90 12 22 e0 or %o0, 0x2e0, %o0 2044afc: 7f ff 2c 20 call 200fb7c <_Objects_Get> 2044b00: 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 ) { 2044b04: c2 07 bf fc ld [ %fp + -4 ], %g1 2044b08: 80 a0 60 00 cmp %g1, 0 2044b0c: 12 80 00 0d bne 2044b40 2044b10: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2044b14: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 2044b18: 39 00 81 d7 sethi %hi(0x2075c00), %i4 2044b1c: b8 17 20 70 or %i4, 0x70, %i4 ! 2075c70 <_Per_CPU_Information> 2044b20: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2044b24: 80 a0 80 01 cmp %g2, %g1 2044b28: 02 80 00 08 be 2044b48 2044b2c: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 2044b30: 7f ff 30 02 call 2010b38 <_Thread_Enable_dispatch> 2044b34: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2044b38: 81 c7 e0 08 ret 2044b3c: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2044b40: 81 c7 e0 08 ret 2044b44: 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 ) { 2044b48: 12 80 00 0e bne 2044b80 2044b4c: 01 00 00 00 nop switch ( the_period->state ) { 2044b50: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2044b54: 80 a0 60 04 cmp %g1, 4 2044b58: 18 80 00 06 bgu 2044b70 <== NEVER TAKEN 2044b5c: b0 10 20 00 clr %i0 2044b60: 83 28 60 02 sll %g1, 2, %g1 2044b64: 05 00 81 bd sethi %hi(0x206f400), %g2 2044b68: 84 10 a3 04 or %g2, 0x304, %g2 ! 206f704 2044b6c: f0 00 80 01 ld [ %g2 + %g1 ], %i0 the_period->state = RATE_MONOTONIC_ACTIVE; the_period->next_length = length; _Watchdog_Insert_ticks( &the_period->Timer, length ); _Scheduler_Release_job(the_period->owner, the_period->next_length); _Thread_Enable_dispatch(); 2044b70: 7f ff 2f f2 call 2010b38 <_Thread_Enable_dispatch> 2044b74: 01 00 00 00 nop return RTEMS_TIMEOUT; 2044b78: 81 c7 e0 08 ret 2044b7c: 81 e8 00 00 restore } _Thread_Enable_dispatch(); return( return_value ); } _ISR_Disable( level ); 2044b80: 7f fe fd 82 call 2004188 2044b84: 01 00 00 00 nop 2044b88: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2044b8c: f6 07 60 38 ld [ %i5 + 0x38 ], %i3 2044b90: 80 a6 e0 00 cmp %i3, 0 2044b94: 02 80 00 19 be 2044bf8 2044b98: 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 ) { 2044b9c: 02 80 00 2e be 2044c54 2044ba0: 80 a6 e0 04 cmp %i3, 4 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2044ba4: 12 bf ff e5 bne 2044b38 <== NEVER TAKEN 2044ba8: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2044bac: 7f ff ff 60 call 204492c <_Rate_monotonic_Update_statistics> 2044bb0: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 2044bb4: 7f fe fd 79 call 2004198 2044bb8: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2044bbc: 82 10 20 02 mov 2, %g1 2044bc0: 92 07 60 10 add %i5, 0x10, %o1 2044bc4: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 2044bc8: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2044bcc: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2044bd0: 11 00 81 d5 sethi %hi(0x2075400), %o0 2044bd4: 7f ff 33 5d call 2011948 <_Watchdog_Insert> 2044bd8: 90 12 23 f0 or %o0, 0x3f0, %o0 ! 20757f0 <_Watchdog_Ticks_chain> 2044bdc: d0 07 60 40 ld [ %i5 + 0x40 ], %o0 2044be0: d2 07 60 3c ld [ %i5 + 0x3c ], %o1 2044be4: 03 00 81 c5 sethi %hi(0x2071400), %g1 2044be8: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 ! 2071424 <_Scheduler+0x34> 2044bec: 9f c0 40 00 call %g1 2044bf0: b0 10 20 06 mov 6, %i0 2044bf4: 30 bf ff df b,a 2044b70 return( return_value ); } _ISR_Disable( level ); if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { _ISR_Enable( level ); 2044bf8: 7f fe fd 68 call 2004198 2044bfc: 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 ); 2044c00: 90 10 00 1d mov %i5, %o0 2044c04: 7f ff ff 99 call 2044a68 <_Rate_monotonic_Initiate_statistics> 2044c08: f2 27 60 3c st %i1, [ %i5 + 0x3c ] the_period->state = RATE_MONOTONIC_ACTIVE; 2044c0c: 82 10 20 02 mov 2, %g1 2044c10: 92 07 60 10 add %i5, 0x10, %o1 2044c14: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 2044c18: 11 00 81 d5 sethi %hi(0x2075400), %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2044c1c: 03 00 81 13 sethi %hi(0x2044c00), %g1 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2044c20: 90 12 23 f0 or %o0, 0x3f0, %o0 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2044c24: 82 10 60 c8 or %g1, 0xc8, %g1 the_watchdog->id = id; 2044c28: f0 27 60 30 st %i0, [ %i5 + 0x30 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2044c2c: c2 27 60 2c st %g1, [ %i5 + 0x2c ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2044c30: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; the_watchdog->id = id; the_watchdog->user_data = user_data; 2044c34: c0 27 60 34 clr [ %i5 + 0x34 ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2044c38: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2044c3c: 7f ff 33 43 call 2011948 <_Watchdog_Insert> 2044c40: b0 10 20 00 clr %i0 id, NULL ); _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 2044c44: 7f ff 2f bd call 2010b38 <_Thread_Enable_dispatch> 2044c48: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2044c4c: 81 c7 e0 08 ret 2044c50: 81 e8 00 00 restore if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2044c54: 7f ff ff 36 call 204492c <_Rate_monotonic_Update_statistics> 2044c58: 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; 2044c5c: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 2044c60: 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; 2044c64: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2044c68: 7f fe fd 4c call 2004198 2044c6c: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 2044c70: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2044c74: c4 07 60 08 ld [ %i5 + 8 ], %g2 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2044c78: 90 10 00 01 mov %g1, %o0 2044c7c: 13 00 00 10 sethi %hi(0x4000), %o1 2044c80: 7f ff 32 0e call 20114b8 <_Thread_Set_state> 2044c84: c4 20 60 20 st %g2, [ %g1 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2044c88: 7f fe fd 40 call 2004188 2044c8c: 01 00 00 00 nop local_state = the_period->state; 2044c90: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 2044c94: f6 27 60 38 st %i3, [ %i5 + 0x38 ] _ISR_Enable( level ); 2044c98: 7f fe fd 40 call 2004198 2044c9c: 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 ) 2044ca0: 80 a6 a0 03 cmp %i2, 3 2044ca4: 22 80 00 06 be,a 2044cbc 2044ca8: d0 07 20 0c ld [ %i4 + 0xc ], %o0 _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); _Thread_Enable_dispatch(); 2044cac: 7f ff 2f a3 call 2010b38 <_Thread_Enable_dispatch> 2044cb0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2044cb4: 81 c7 e0 08 ret 2044cb8: 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 ); 2044cbc: 7f ff 2e ad call 2010770 <_Thread_Clear_state> 2044cc0: 13 00 00 10 sethi %hi(0x4000), %o1 2044cc4: 30 bf ff fa b,a 2044cac =============================================================================== 0202dd54 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 202dd54: 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 ) 202dd58: 80 a6 60 00 cmp %i1, 0 202dd5c: 02 80 00 48 be 202de7c <== NEVER TAKEN 202dd60: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 202dd64: 13 00 81 a9 sethi %hi(0x206a400), %o1 202dd68: 9f c6 40 00 call %i1 202dd6c: 92 12 62 d8 or %o1, 0x2d8, %o1 ! 206a6d8 <_TOD_Days_per_month+0x68> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 202dd70: 90 10 00 18 mov %i0, %o0 202dd74: 13 00 81 a9 sethi %hi(0x206a400), %o1 202dd78: 9f c6 40 00 call %i1 202dd7c: 92 12 62 f8 or %o1, 0x2f8, %o1 ! 206a6f8 <_TOD_Days_per_month+0x88> (*print)( context, "--- Wall times are in seconds ---\n" ); 202dd80: 90 10 00 18 mov %i0, %o0 202dd84: 13 00 81 a9 sethi %hi(0x206a400), %o1 202dd88: 9f c6 40 00 call %i1 202dd8c: 92 12 63 20 or %o1, 0x320, %o1 ! 206a720 <_TOD_Days_per_month+0xb0> Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 202dd90: 90 10 00 18 mov %i0, %o0 202dd94: 13 00 81 a9 sethi %hi(0x206a400), %o1 202dd98: 9f c6 40 00 call %i1 202dd9c: 92 12 63 48 or %o1, 0x348, %o1 ! 206a748 <_TOD_Days_per_month+0xd8> #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 202dda0: 90 10 00 18 mov %i0, %o0 202dda4: 13 00 81 a9 sethi %hi(0x206a400), %o1 202dda8: 9f c6 40 00 call %i1 202ddac: 92 12 63 98 or %o1, 0x398, %o1 ! 206a798 <_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 ; 202ddb0: 39 00 81 d8 sethi %hi(0x2076000), %i4 202ddb4: b8 17 22 e0 or %i4, 0x2e0, %i4 ! 20762e0 <_Rate_monotonic_Information> 202ddb8: fa 07 20 08 ld [ %i4 + 8 ], %i5 202ddbc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 202ddc0: 80 a7 40 01 cmp %i5, %g1 202ddc4: 18 80 00 2e bgu 202de7c <== NEVER TAKEN 202ddc8: 35 00 81 a9 sethi %hi(0x206a400), %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, 202ddcc: 23 00 81 aa sethi %hi(0x206a800), %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 202ddd0: 21 00 81 aa sethi %hi(0x206a800), %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 202ddd4: 37 00 81 af sethi %hi(0x206bc00), %i3 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202ddd8: b4 16 a3 e8 or %i2, 0x3e8, %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, 202dddc: a2 14 60 00 mov %l1, %l1 struct timespec *min_wall = &the_stats.min_wall_time; struct timespec *max_wall = &the_stats.max_wall_time; struct timespec *total_wall = &the_stats.total_wall_time; _Timespec_Divide_by_integer(total_wall, the_stats.count, &wall_average); (*print)( context, 202dde0: a0 14 20 20 or %l0, 0x20, %l0 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 202dde4: 10 80 00 06 b 202ddfc 202dde8: b6 16 e0 c0 or %i3, 0xc0, %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++ ) { 202ddec: 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 ; 202ddf0: 80 a0 40 1d cmp %g1, %i5 202ddf4: 0a 80 00 22 bcs 202de7c 202ddf8: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 202ddfc: 90 10 00 1d mov %i5, %o0 202de00: 40 00 59 e9 call 20445a4 202de04: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 202de08: 80 a2 20 00 cmp %o0, 0 202de0c: 32 bf ff f8 bne,a 202ddec 202de10: 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 ); 202de14: 92 07 bf d8 add %fp, -40, %o1 202de18: 40 00 5a 55 call 204476c 202de1c: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 202de20: d0 07 bf d8 ld [ %fp + -40 ], %o0 202de24: 92 10 20 05 mov 5, %o1 202de28: 7f ff 7e 94 call 200d878 202de2c: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 202de30: d8 1f bf a0 ldd [ %fp + -96 ], %o4 202de34: 92 10 00 1a mov %i2, %o1 202de38: 94 10 00 1d mov %i5, %o2 202de3c: 90 10 00 18 mov %i0, %o0 202de40: 9f c6 40 00 call %i1 202de44: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 202de48: c2 07 bf a0 ld [ %fp + -96 ], %g1 struct timespec cpu_average; struct timespec *min_cpu = &the_stats.min_cpu_time; struct timespec *max_cpu = &the_stats.max_cpu_time; struct timespec *total_cpu = &the_stats.total_cpu_time; _Timespec_Divide_by_integer( total_cpu, the_stats.count, &cpu_average ); 202de4c: 94 07 bf f0 add %fp, -16, %o2 202de50: 90 07 bf b8 add %fp, -72, %o0 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 202de54: 80 a0 60 00 cmp %g1, 0 202de58: 12 80 00 0b bne 202de84 202de5c: 92 10 00 1b mov %i3, %o1 (*print)( context, "\n" ); 202de60: 9f c6 40 00 call %i1 202de64: 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 ; 202de68: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 202de6c: 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 ; 202de70: 80 a0 40 1d cmp %g1, %i5 202de74: 1a bf ff e3 bcc 202de00 <== ALWAYS TAKEN 202de78: 90 10 00 1d mov %i5, %o0 202de7c: 81 c7 e0 08 ret 202de80: 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 ); 202de84: 40 00 05 3a call 202f36c <_Timespec_Divide_by_integer> 202de88: 92 10 00 01 mov %g1, %o1 (*print)( context, 202de8c: d0 07 bf ac ld [ %fp + -84 ], %o0 202de90: 40 00 ce cd call 20619c4 <.div> 202de94: 92 10 23 e8 mov 0x3e8, %o1 202de98: aa 10 00 08 mov %o0, %l5 202de9c: d0 07 bf b4 ld [ %fp + -76 ], %o0 202dea0: 40 00 ce c9 call 20619c4 <.div> 202dea4: 92 10 23 e8 mov 0x3e8, %o1 202dea8: c2 07 bf f0 ld [ %fp + -16 ], %g1 202deac: a6 10 00 08 mov %o0, %l3 202deb0: d0 07 bf f4 ld [ %fp + -12 ], %o0 202deb4: e4 07 bf a8 ld [ %fp + -88 ], %l2 202deb8: e8 07 bf b0 ld [ %fp + -80 ], %l4 202debc: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202dec0: 40 00 ce c1 call 20619c4 <.div> 202dec4: 92 10 23 e8 mov 0x3e8, %o1 202dec8: 96 10 00 15 mov %l5, %o3 202decc: 98 10 00 14 mov %l4, %o4 202ded0: 9a 10 00 13 mov %l3, %o5 202ded4: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202ded8: 92 10 00 11 mov %l1, %o1 202dedc: 94 10 00 12 mov %l2, %o2 202dee0: 9f c6 40 00 call %i1 202dee4: 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); 202dee8: d2 07 bf a0 ld [ %fp + -96 ], %o1 202deec: 94 07 bf f0 add %fp, -16, %o2 202def0: 40 00 05 1f call 202f36c <_Timespec_Divide_by_integer> 202def4: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 202def8: d0 07 bf c4 ld [ %fp + -60 ], %o0 202defc: 40 00 ce b2 call 20619c4 <.div> 202df00: 92 10 23 e8 mov 0x3e8, %o1 202df04: a8 10 00 08 mov %o0, %l4 202df08: d0 07 bf cc ld [ %fp + -52 ], %o0 202df0c: 40 00 ce ae call 20619c4 <.div> 202df10: 92 10 23 e8 mov 0x3e8, %o1 202df14: c2 07 bf f0 ld [ %fp + -16 ], %g1 202df18: a4 10 00 08 mov %o0, %l2 202df1c: d0 07 bf f4 ld [ %fp + -12 ], %o0 202df20: ea 07 bf c0 ld [ %fp + -64 ], %l5 202df24: e6 07 bf c8 ld [ %fp + -56 ], %l3 202df28: 92 10 23 e8 mov 0x3e8, %o1 202df2c: 40 00 ce a6 call 20619c4 <.div> 202df30: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 202df34: 92 10 00 10 mov %l0, %o1 202df38: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 202df3c: 94 10 00 15 mov %l5, %o2 202df40: 90 10 00 18 mov %i0, %o0 202df44: 96 10 00 14 mov %l4, %o3 202df48: 98 10 00 13 mov %l3, %o4 202df4c: 9f c6 40 00 call %i1 202df50: 9a 10 00 12 mov %l2, %o5 /* * Cycle through all possible ids and try to report on each one. If it * is a period that is inactive, we just get an error back. No big deal. */ for ( id=_Rate_monotonic_Information.minimum_id ; 202df54: 10 bf ff a6 b 202ddec 202df58: c2 07 20 0c ld [ %i4 + 0xc ], %g1 =============================================================================== 0202df74 : /* * rtems_rate_monotonic_reset_all_statistics */ void rtems_rate_monotonic_reset_all_statistics( void ) { 202df74: 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++; 202df78: 03 00 81 d5 sethi %hi(0x2075400), %g1 202df7c: c4 00 63 30 ld [ %g1 + 0x330 ], %g2 ! 2075730 <_Thread_Dispatch_disable_level> 202df80: 84 00 a0 01 inc %g2 202df84: c4 20 63 30 st %g2, [ %g1 + 0x330 ] return _Thread_Dispatch_disable_level; 202df88: c2 00 63 30 ld [ %g1 + 0x330 ], %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 ; 202df8c: 39 00 81 d8 sethi %hi(0x2076000), %i4 202df90: b8 17 22 e0 or %i4, 0x2e0, %i4 ! 20762e0 <_Rate_monotonic_Information> 202df94: fa 07 20 08 ld [ %i4 + 8 ], %i5 202df98: c2 07 20 0c ld [ %i4 + 0xc ], %g1 202df9c: 80 a7 40 01 cmp %i5, %g1 202dfa0: 18 80 00 09 bgu 202dfc4 <== NEVER TAKEN 202dfa4: 01 00 00 00 nop id <= _Rate_monotonic_Information.maximum_id ; id++ ) { (void) rtems_rate_monotonic_reset_statistics( id ); 202dfa8: 40 00 00 09 call 202dfcc 202dfac: 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 ; 202dfb0: c2 07 20 0c ld [ %i4 + 0xc ], %g1 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 202dfb4: 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 ; 202dfb8: 80 a0 40 1d cmp %g1, %i5 202dfbc: 1a bf ff fb bcc 202dfa8 202dfc0: 01 00 00 00 nop } /* * Done so exit thread dispatching disabled critical section. */ _Thread_Enable_dispatch(); 202dfc4: 7f ff 8a dd call 2010b38 <_Thread_Enable_dispatch> 202dfc8: 81 e8 00 00 restore =============================================================================== 02008eb8 : return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { 2008eb8: 9d e3 bf a0 save %sp, -96, %sp void *ptr = NULL; rtems_chain_control *free_chain = &control->free_chain; rtems_rbtree_control *page_tree = &control->page_tree; uintptr_t page_alignment = control->page_alignment; 2008ebc: f8 06 20 30 ld [ %i0 + 0x30 ], %i4 #include static uintptr_t align_up(uintptr_t page_alignment, uintptr_t value) { uintptr_t excess = value % page_alignment; 2008ec0: 90 10 00 19 mov %i1, %o0 2008ec4: 40 00 47 91 call 201ad08 <.urem> 2008ec8: 92 10 00 1c mov %i4, %o1 return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { 2008ecc: ba 10 00 18 mov %i0, %i5 static uintptr_t align_up(uintptr_t page_alignment, uintptr_t value) { uintptr_t excess = value % page_alignment; if (excess > 0) { 2008ed0: b4 10 00 19 mov %i1, %i2 2008ed4: 80 a2 20 00 cmp %o0, 0 2008ed8: 02 80 00 06 be 2008ef0 <== ALWAYS TAKEN 2008edc: 82 10 20 01 mov 1, %g1 value += page_alignment - excess; 2008ee0: b8 06 40 1c add %i1, %i4, %i4 <== NOT EXECUTED 2008ee4: b4 27 00 08 sub %i4, %o0, %i2 <== NOT EXECUTED 2008ee8: 80 a6 80 19 cmp %i2, %i1 <== NOT EXECUTED 2008eec: 82 60 3f ff subx %g0, -1, %g1 <== NOT EXECUTED rtems_chain_control *free_chain = &control->free_chain; rtems_rbtree_control *page_tree = &control->page_tree; uintptr_t page_alignment = control->page_alignment; uintptr_t aligned_size = align_up(page_alignment, size); if (size > 0 && size <= aligned_size) { 2008ef0: 80 88 60 ff btst 0xff, %g1 2008ef4: 02 80 00 1f be 2008f70 <== NEVER TAKEN 2008ef8: 80 a6 60 00 cmp %i1, 0 2008efc: 02 80 00 1d be 2008f70 2008f00: 82 07 60 04 add %i5, 4, %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2008f04: f8 07 40 00 ld [ %i5 ], %i4 { rtems_chain_node *current = rtems_chain_first(free_chain); const rtems_chain_node *tail = rtems_chain_tail(free_chain); rtems_rbheap_page *big_enough = NULL; while (current != tail && big_enough == NULL) { 2008f08: 80 a7 00 01 cmp %i4, %g1 2008f0c: 02 80 00 12 be 2008f54 2008f10: b0 10 20 00 clr %i0 rtems_rbheap_page *free_page = (rtems_rbheap_page *) current; if (free_page->size >= size) { 2008f14: f6 07 20 1c ld [ %i4 + 0x1c ], %i3 2008f18: 80 a6 80 1b cmp %i2, %i3 2008f1c: 38 80 00 10 bgu,a 2008f5c 2008f20: f8 07 00 00 ld [ %i4 ], %i4 uintptr_t aligned_size = align_up(page_alignment, size); if (size > 0 && size <= aligned_size) { rtems_rbheap_page *free_page = search_free_page(free_chain, aligned_size); if (free_page != NULL) { 2008f24: 80 a7 20 00 cmp %i4, 0 2008f28: 02 80 00 10 be 2008f68 <== NEVER TAKEN 2008f2c: 80 a6 c0 1a cmp %i3, %i2 uintptr_t free_size = free_page->size; if (free_size > aligned_size) { 2008f30: 18 80 00 12 bgu 2008f78 2008f34: 90 10 00 1d mov %i5, %o0 ) { Chain_Node *next; Chain_Node *previous; next = the_node->next; 2008f38: c4 07 00 00 ld [ %i4 ], %g2 previous = the_node->previous; 2008f3c: c2 07 20 04 ld [ %i4 + 4 ], %g1 ptr = (void *) new_page->begin; } } else { rtems_chain_extract_unprotected(&free_page->chain_node); rtems_chain_set_off_chain(&free_page->chain_node); ptr = (void *) free_page->begin; 2008f40: f0 07 20 18 ld [ %i4 + 0x18 ], %i0 next->previous = previous; 2008f44: c2 20 a0 04 st %g1, [ %g2 + 4 ] previous->next = next; 2008f48: c4 20 40 00 st %g2, [ %g1 ] */ RTEMS_INLINE_ROUTINE void _Chain_Set_off_chain( Chain_Node *node ) { node->next = node->previous = NULL; 2008f4c: c0 27 20 04 clr [ %i4 + 4 ] 2008f50: c0 27 00 00 clr [ %i4 ] 2008f54: 81 c7 e0 08 ret 2008f58: 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_page *big_enough = NULL; while (current != tail && big_enough == NULL) { 2008f5c: 80 a0 40 1c cmp %g1, %i4 2008f60: 32 bf ff ee bne,a 2008f18 <== NEVER TAKEN 2008f64: f6 07 20 1c ld [ %i4 + 0x1c ], %i3 <== NOT EXECUTED return big_enough; } void *rtems_rbheap_allocate(rtems_rbheap_control *control, size_t size) { void *ptr = NULL; 2008f68: 81 c7 e0 08 ret 2008f6c: 91 e8 20 00 restore %g0, 0, %o0 } } } return ptr; } 2008f70: 81 c7 e0 08 ret 2008f74: 91 e8 20 00 restore %g0, 0, %o0 if (free_page != NULL) { uintptr_t free_size = free_page->size; if (free_size > aligned_size) { rtems_rbheap_page *new_page = get_page(control); 2008f78: 7f ff ff 60 call 2008cf8 2008f7c: b0 10 20 00 clr %i0 if (new_page != NULL) { 2008f80: 80 a2 20 00 cmp %o0, 0 2008f84: 02 bf ff f4 be 2008f54 <== NEVER TAKEN 2008f88: b2 10 00 08 mov %o0, %i1 uintptr_t new_free_size = free_size - aligned_size; free_page->size = new_free_size; new_page->begin = free_page->begin + new_free_size; 2008f8c: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 if (free_size > aligned_size) { rtems_rbheap_page *new_page = get_page(control); if (new_page != NULL) { uintptr_t new_free_size = free_size - aligned_size; 2008f90: b6 26 c0 1a sub %i3, %i2, %i3 free_page->size = new_free_size; 2008f94: f6 27 20 1c st %i3, [ %i4 + 0x1c ] new_page->begin = free_page->begin + new_free_size; new_page->size = aligned_size; 2008f98: f4 22 20 1c st %i2, [ %o0 + 0x1c ] if (new_page != NULL) { uintptr_t new_free_size = free_size - aligned_size; free_page->size = new_free_size; new_page->begin = free_page->begin + new_free_size; 2008f9c: b6 06 c0 01 add %i3, %g1, %i3 2008fa0: c0 22 20 04 clr [ %o0 + 4 ] 2008fa4: f6 22 20 18 st %i3, [ %o0 + 0x18 ] 2008fa8: c0 22 00 00 clr [ %o0 ] static void insert_into_tree( rtems_rbtree_control *tree, rtems_rbheap_page *page ) { _RBTree_Insert_unprotected(tree, &page->tree_node); 2008fac: 92 06 60 08 add %i1, 8, %o1 2008fb0: 40 00 07 3a call 200ac98 <_RBTree_Insert_unprotected> 2008fb4: 90 07 60 18 add %i5, 0x18, %o0 free_page->size = new_free_size; new_page->begin = free_page->begin + new_free_size; new_page->size = aligned_size; rtems_chain_set_off_chain(&new_page->chain_node); insert_into_tree(page_tree, new_page); ptr = (void *) new_page->begin; 2008fb8: f0 06 60 18 ld [ %i1 + 0x18 ], %i0 2008fbc: 81 c7 e0 08 ret 2008fc0: 81 e8 00 00 restore =============================================================================== 0200915c : void rtems_rbheap_extend_page_pool_with_malloc(rtems_rbheap_control *control) { 200915c: 9d e3 bf a0 save %sp, -96, %sp <== NOT EXECUTED rtems_rbheap_page *page = malloc(sizeof(*page)); 2009160: 7f ff ec 84 call 2004370 <== NOT EXECUTED 2009164: 90 10 20 20 mov 0x20, %o0 <== NOT EXECUTED if (page != NULL) { 2009168: 80 a2 20 00 cmp %o0, 0 <== NOT EXECUTED 200916c: 02 80 00 07 be 2009188 <== NOT EXECUTED 2009170: 84 06 20 0c add %i0, 0xc, %g2 <== NOT EXECUTED 2009174: c2 06 20 0c ld [ %i0 + 0xc ], %g1 <== NOT EXECUTED after_node->next = the_node; 2009178: d0 26 20 0c st %o0, [ %i0 + 0xc ] <== NOT EXECUTED Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 200917c: 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; 2009180: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED before_node->previous = the_node; 2009184: d0 20 60 04 st %o0, [ %g1 + 4 ] <== NOT EXECUTED 2009188: 81 c7 e0 08 ret <== NOT EXECUTED 200918c: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008fc4 : _RBTree_Extract_unprotected(page_tree, &b->tree_node); } } rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { 2008fc4: 9d e3 bf 80 save %sp, -128, %sp RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 2008fc8: f8 06 20 1c ld [ %i0 + 0x1c ], %i4 #define NULL_PAGE rtems_rbheap_page_of_node(NULL) static rtems_rbheap_page *find(rtems_rbtree_control *page_tree, uintptr_t key) { rtems_rbheap_page page = { .begin = key }; 2008fcc: c0 27 bf fc clr [ %fp + -4 ] 2008fd0: c0 27 bf e0 clr [ %fp + -32 ] 2008fd4: c0 27 bf e4 clr [ %fp + -28 ] 2008fd8: c0 27 bf e8 clr [ %fp + -24 ] 2008fdc: c0 27 bf ec clr [ %fp + -20 ] 2008fe0: c0 27 bf f0 clr [ %fp + -16 ] 2008fe4: c0 27 bf f4 clr [ %fp + -12 ] 2008fe8: f2 27 bf f8 st %i1, [ %fp + -8 ] _RBTree_Extract_unprotected(page_tree, &b->tree_node); } } rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { 2008fec: ba 10 00 18 mov %i0, %i5 RBTree_Node* found = NULL; int compare_result; while (iter_node) { 2008ff0: 80 a7 20 00 cmp %i4, 0 2008ff4: 02 80 00 1e be 200906c <== NEVER TAKEN 2008ff8: b0 10 20 04 mov 4, %i0 2008ffc: b6 10 20 00 clr %i3 compare_result = the_rbtree->compare_function(the_node, iter_node); 2009000: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 2009004: 92 10 00 1c mov %i4, %o1 2009008: 9f c0 40 00 call %g1 200900c: 90 07 bf e8 add %fp, -24, %o0 found = iter_node; if ( the_rbtree->is_unique ) break; } RBTree_Direction dir = 2009010: 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 ) ) { 2009014: 80 a2 20 00 cmp %o0, 0 found = iter_node; if ( the_rbtree->is_unique ) break; } RBTree_Direction dir = 2009018: 82 20 40 08 sub %g1, %o0, %g1 200901c: 83 30 60 1f srl %g1, 0x1f, %g1 (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 2009020: 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 ) ) { 2009024: 12 80 00 06 bne 200903c 2009028: 82 07 00 01 add %i4, %g1, %g1 found = iter_node; if ( the_rbtree->is_unique ) 200902c: c4 0f 60 2c ldub [ %i5 + 0x2c ], %g2 2009030: 80 a0 a0 00 cmp %g2, 0 2009034: 12 80 00 10 bne 2009074 <== ALWAYS TAKEN 2009038: b6 10 00 1c mov %i4, %i3 break; } RBTree_Direction dir = (RBTree_Direction) _RBTree_Is_greater( compare_result ); iter_node = iter_node->child[dir]; 200903c: f8 00 60 04 ld [ %g1 + 4 ], %i4 ) { RBTree_Node* iter_node = the_rbtree->root; RBTree_Node* found = NULL; int compare_result; while (iter_node) { 2009040: 80 a7 20 00 cmp %i4, 0 2009044: 32 bf ff f0 bne,a 2009004 2009048: c2 07 60 28 ld [ %i5 + 0x28 ], %g1 static rtems_rbheap_page *find(rtems_rbtree_control *page_tree, uintptr_t key) { rtems_rbheap_page page = { .begin = key }; return rtems_rbheap_page_of_node( 200904c: b8 06 ff f8 add %i3, -8, %i4 rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_control *free_chain = &control->free_chain; rtems_rbtree_control *page_tree = &control->page_tree; rtems_rbheap_page *page = find(page_tree, (uintptr_t) ptr); if (page != NULL_PAGE) { 2009050: 80 a7 3f f8 cmp %i4, -8 2009054: 02 80 00 06 be 200906c 2009058: 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); 200905c: c2 06 ff f8 ld [ %i3 + -8 ], %g1 2009060: 80 a0 60 00 cmp %g1, 0 2009064: 02 80 00 06 be 200907c 2009068: b0 10 20 0e mov 0xe, %i0 } else { sc = RTEMS_INVALID_ID; } return sc; } 200906c: 81 c7 e0 08 ret 2009070: 81 e8 00 00 restore static rtems_rbheap_page *find(rtems_rbtree_control *page_tree, uintptr_t key) { rtems_rbheap_page page = { .begin = key }; return rtems_rbheap_page_of_node( 2009074: 10 bf ff f7 b 2009050 2009078: b8 06 ff f8 add %i3, -8, %i4 200907c: c2 07 20 04 ld [ %i4 + 4 ], %g1 2009080: 80 a0 60 00 cmp %g1, 0 2009084: 12 bf ff fa bne 200906c <== NEVER TAKEN 2009088: 92 10 00 1b mov %i3, %o1 rtems_status_code rtems_rbheap_free(rtems_rbheap_control *control, void *ptr) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_control *free_chain = &control->free_chain; rtems_rbtree_control *page_tree = &control->page_tree; 200908c: b4 07 60 18 add %i5, 0x18, %i2 const rtems_rbtree_control *page_tree, const rtems_rbheap_page *page, RBTree_Direction dir ) { return rtems_rbheap_page_of_node( 2009090: 94 10 20 00 clr %o2 2009094: 40 00 07 cd call 200afc8 <_RBTree_Next_unprotected> 2009098: 90 10 00 1a mov %i2, %o0 200909c: 92 10 00 1b mov %i3, %o1 20090a0: b2 10 00 08 mov %o0, %i1 20090a4: 94 10 20 01 mov 1, %o2 20090a8: 40 00 07 c8 call 200afc8 <_RBTree_Next_unprotected> 20090ac: 90 10 00 1a mov %i2, %o0 20090b0: 96 02 3f f8 add %o0, -8, %o3 rtems_rbtree_control *page_tree, rtems_rbheap_page *a, rtems_rbheap_page *b ) { if (b != NULL_PAGE && rtems_rbheap_is_page_free(b)) { 20090b4: 80 a2 ff f8 cmp %o3, -8 20090b8: 02 80 00 0a be 20090e0 20090bc: b6 06 7f f8 add %i1, -8, %i3 20090c0: c2 02 3f f8 ld [ %o0 + -8 ], %g1 20090c4: 80 a0 60 00 cmp %g1, 0 20090c8: 22 80 00 1e be,a 2009140 20090cc: c2 02 e0 04 ld [ %o3 + 4 ], %g1 } } else { sc = RTEMS_INVALID_ID; } return sc; 20090d0: 90 10 00 1d mov %i5, %o0 20090d4: 92 10 00 1a mov %i2, %o1 20090d8: 7f ff ff 16 call 2008d30 20090dc: 94 10 00 1c mov %i4, %o2 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 20090e0: c2 07 40 00 ld [ %i5 ], %g1 Chain_Node *the_node ) { Chain_Node *before_node; the_node->previous = after_node; 20090e4: fa 27 20 04 st %i5, [ %i4 + 4 ] before_node = after_node->next; after_node->next = the_node; 20090e8: f8 27 40 00 st %i4, [ %i5 ] the_node->next = before_node; 20090ec: c2 27 00 00 st %g1, [ %i4 ] before_node->previous = the_node; 20090f0: f8 20 60 04 st %i4, [ %g1 + 4 ] rtems_rbtree_control *page_tree, rtems_rbheap_page *a, rtems_rbheap_page *b ) { if (b != NULL_PAGE && rtems_rbheap_is_page_free(b)) { 20090f4: 80 a6 ff f8 cmp %i3, -8 20090f8: 02 bf ff dd be 200906c 20090fc: b0 10 20 00 clr %i0 */ RTEMS_INLINE_ROUTINE bool _Chain_Is_node_off_chain( const Chain_Node *node ) { return (node->next == NULL) && (node->previous == NULL); 2009100: c2 06 7f f8 ld [ %i1 + -8 ], %g1 2009104: 80 a0 60 00 cmp %g1, 0 2009108: 22 80 00 0a be,a 2009130 200910c: c2 06 e0 04 ld [ %i3 + 4 ], %g1 } } else { sc = RTEMS_INVALID_ID; } return sc; 2009110: 90 10 00 1d mov %i5, %o0 2009114: 92 10 00 1a mov %i2, %o1 2009118: 94 10 00 1c mov %i4, %o2 200911c: 96 10 00 1b mov %i3, %o3 2009120: 7f ff ff 04 call 2008d30 2009124: b0 10 20 00 clr %i0 2009128: 81 c7 e0 08 ret 200912c: 81 e8 00 00 restore 2009130: 80 a0 60 00 cmp %g1, 0 2009134: 12 bf ff f8 bne 2009114 <== NEVER TAKEN 2009138: 90 10 00 1d mov %i5, %o0 200913c: 30 bf ff fb b,a 2009128 2009140: 80 a0 60 00 cmp %g1, 0 2009144: 12 bf ff e4 bne 20090d4 <== NEVER TAKEN 2009148: 90 10 00 1d mov %i5, %o0 ) { Chain_Node *before_node; the_node->previous = after_node; before_node = after_node->next; 200914c: 10 bf ff e6 b 20090e4 2009150: c2 07 40 00 ld [ %i5 ], %g1 =============================================================================== 02016aa8 : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2016aa8: 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 ) 2016aac: 80 a6 60 00 cmp %i1, 0 2016ab0: 12 80 00 04 bne 2016ac0 2016ab4: 82 10 20 0a mov 0xa, %g1 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016ab8: 81 c7 e0 08 ret 2016abc: 91 e8 00 01 restore %g0, %g1, %o0 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2016ac0: 90 10 00 18 mov %i0, %o0 2016ac4: 40 00 13 9b call 201b930 <_Thread_Get> 2016ac8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2016acc: c2 07 bf fc ld [ %fp + -4 ], %g1 2016ad0: 80 a0 60 00 cmp %g1, 0 2016ad4: 12 80 00 20 bne 2016b54 2016ad8: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2016adc: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2016ae0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2016ae4: 80 a0 60 00 cmp %g1, 0 2016ae8: 02 80 00 1e be 2016b60 2016aec: 01 00 00 00 nop if ( asr->is_enabled ) { 2016af0: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2016af4: 80 a0 60 00 cmp %g1, 0 2016af8: 02 80 00 1e be 2016b70 2016afc: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016b00: 7f ff e2 2e call 200f3b8 2016b04: 01 00 00 00 nop *signal_set |= signals; 2016b08: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2016b0c: b2 10 40 19 or %g1, %i1, %i1 2016b10: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2016b14: 7f ff e2 2d call 200f3c8 2016b18: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2016b1c: 03 00 80 f3 sethi %hi(0x203cc00), %g1 2016b20: 82 10 63 b0 or %g1, 0x3b0, %g1 ! 203cfb0 <_Per_CPU_Information> 2016b24: c4 00 60 08 ld [ %g1 + 8 ], %g2 2016b28: 80 a0 a0 00 cmp %g2, 0 2016b2c: 02 80 00 06 be 2016b44 2016b30: 01 00 00 00 nop 2016b34: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2016b38: 80 a7 00 02 cmp %i4, %g2 2016b3c: 02 80 00 15 be 2016b90 <== ALWAYS TAKEN 2016b40: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2016b44: 40 00 13 6e call 201b8fc <_Thread_Enable_dispatch> 2016b48: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2016b4c: 10 bf ff db b 2016ab8 2016b50: 82 10 20 00 clr %g1 ! 0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2016b54: 82 10 20 04 mov 4, %g1 } 2016b58: 81 c7 e0 08 ret 2016b5c: 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(); 2016b60: 40 00 13 67 call 201b8fc <_Thread_Enable_dispatch> 2016b64: 01 00 00 00 nop return RTEMS_NOT_DEFINED; 2016b68: 10 bf ff d4 b 2016ab8 2016b6c: 82 10 20 0b mov 0xb, %g1 ! b rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016b70: 7f ff e2 12 call 200f3b8 2016b74: 01 00 00 00 nop *signal_set |= signals; 2016b78: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2016b7c: b2 10 40 19 or %g1, %i1, %i1 2016b80: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2016b84: 7f ff e2 11 call 200f3c8 2016b88: 01 00 00 00 nop 2016b8c: 30 bf ff ee b,a 2016b44 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; 2016b90: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2016b94: 30 bf ff ec b,a 2016b44 =============================================================================== 0200fffc : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200fffc: 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 ) 2010000: 80 a6 a0 00 cmp %i2, 0 2010004: 02 80 00 3b be 20100f0 2010008: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 201000c: 21 00 80 7b sethi %hi(0x201ec00), %l0 2010010: a0 14 23 70 or %l0, 0x370, %l0 ! 201ef70 <_Per_CPU_Information> 2010014: 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; 2010018: c4 0f 60 70 ldub [ %i5 + 0x70 ], %g2 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 201001c: 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; 2010020: 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 ]; 2010024: f8 07 61 58 ld [ %i5 + 0x158 ], %i4 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 2010028: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 201002c: 80 a0 60 00 cmp %g1, 0 2010030: 12 80 00 40 bne 2010130 2010034: 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; 2010038: c2 0f 20 08 ldub [ %i4 + 8 ], %g1 201003c: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 2010040: 7f ff ef 1b call 200bcac <_CPU_ISR_Get_level> 2010044: 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; 2010048: a3 2c 60 0a sll %l1, 0xa, %l1 201004c: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 2010050: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 2010054: 80 8e 61 00 btst 0x100, %i1 2010058: 02 80 00 06 be 2010070 201005c: 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; 2010060: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 2010064: 80 a0 00 01 cmp %g0, %g1 2010068: 82 60 3f ff subx %g0, -1, %g1 201006c: c2 2f 60 70 stb %g1, [ %i5 + 0x70 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 2010070: 80 8e 62 00 btst 0x200, %i1 2010074: 12 80 00 21 bne 20100f8 2010078: 80 8e 22 00 btst 0x200, %i0 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 201007c: 80 8e 60 0f btst 0xf, %i1 2010080: 12 80 00 27 bne 201011c 2010084: 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 ) { 2010088: 80 8e 64 00 btst 0x400, %i1 201008c: 02 80 00 14 be 20100dc 2010090: 86 10 20 00 clr %g3 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 2010094: c4 0f 20 08 ldub [ %i4 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 2010098: b0 0e 24 00 and %i0, 0x400, %i0 * Output: * *previous_mode_set - previous mode set * always return RTEMS_SUCCESSFUL; */ rtems_status_code rtems_task_mode( 201009c: 80 a0 00 18 cmp %g0, %i0 20100a0: 82 60 3f ff subx %g0, -1, %g1 is_asr_enabled = false; needs_asr_dispatching = false; if ( mask & RTEMS_ASR_MASK ) { is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 20100a4: 80 a0 80 01 cmp %g2, %g1 20100a8: 22 80 00 0e be,a 20100e0 20100ac: 03 00 80 7a sethi %hi(0x201e800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 20100b0: 7f ff c9 82 call 20026b8 20100b4: c2 2f 20 08 stb %g1, [ %i4 + 8 ] _signals = information->signals_pending; 20100b8: c4 07 20 18 ld [ %i4 + 0x18 ], %g2 information->signals_pending = information->signals_posted; 20100bc: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 information->signals_posted = _signals; 20100c0: 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; 20100c4: c2 27 20 18 st %g1, [ %i4 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 20100c8: 7f ff c9 80 call 20026c8 20100cc: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 20100d0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 20100d4: 80 a0 00 01 cmp %g0, %g1 20100d8: 86 40 20 00 addx %g0, 0, %g3 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 20100dc: 03 00 80 7a sethi %hi(0x201e800), %g1 20100e0: c4 00 63 88 ld [ %g1 + 0x388 ], %g2 ! 201eb88 <_System_state_Current> 20100e4: 80 a0 a0 03 cmp %g2, 3 20100e8: 02 80 00 1f be 2010164 20100ec: 82 10 20 00 clr %g1 if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); } return RTEMS_SUCCESSFUL; } 20100f0: 81 c7 e0 08 ret 20100f4: 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) ) { 20100f8: 22 bf ff e1 be,a 201007c 20100fc: c0 27 60 78 clr [ %i5 + 0x78 ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 2010100: 03 00 80 7a sethi %hi(0x201e800), %g1 2010104: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 ! 201e994 <_Thread_Ticks_per_timeslice> } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 2010108: 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; 201010c: 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; 2010110: 82 10 20 01 mov 1, %g1 } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 2010114: 02 bf ff dd be 2010088 2010118: 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 ); 201011c: 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 ) ); 2010120: 7f ff c9 6a call 20026c8 2010124: 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 ) { 2010128: 10 bf ff d9 b 201008c 201012c: 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; 2010130: 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; 2010134: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 2010138: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 201013c: 7f ff ee dc call 200bcac <_CPU_ISR_Get_level> 2010140: 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; 2010144: a3 2c 60 0a sll %l1, 0xa, %l1 2010148: a2 14 40 08 or %l1, %o0, %l1 old_mode |= _ISR_Get_level(); 201014c: b6 14 40 1b or %l1, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 2010150: 80 8e 61 00 btst 0x100, %i1 2010154: 02 bf ff c7 be 2010070 2010158: 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; 201015c: 10 bf ff c2 b 2010064 2010160: 82 0e 21 00 and %i0, 0x100, %g1 { Thread_Control *executing; executing = _Thread_Executing; if ( are_signals_pending || 2010164: 80 88 e0 ff btst 0xff, %g3 2010168: 12 80 00 0a bne 2010190 201016c: c4 04 20 0c ld [ %l0 + 0xc ], %g2 2010170: c6 04 20 10 ld [ %l0 + 0x10 ], %g3 2010174: 80 a0 80 03 cmp %g2, %g3 2010178: 02 bf ff de be 20100f0 201017c: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 2010180: c4 08 a0 70 ldub [ %g2 + 0x70 ], %g2 2010184: 80 a0 a0 00 cmp %g2, 0 2010188: 02 bf ff da be 20100f0 <== NEVER TAKEN 201018c: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 2010190: 82 10 20 01 mov 1, %g1 ! 1 2010194: 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(); 2010198: 7f ff e9 50 call 200a6d8 <_Thread_Dispatch> 201019c: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 20101a0: 82 10 20 00 clr %g1 ! 0 } 20101a4: 81 c7 e0 08 ret 20101a8: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200c2e4 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200c2e4: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200c2e8: 80 a6 60 00 cmp %i1, 0 200c2ec: 02 80 00 07 be 200c308 200c2f0: 90 10 00 18 mov %i0, %o0 RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && ( the_priority <= RTEMS_MAXIMUM_PRIORITY ) ); 200c2f4: 03 00 80 87 sethi %hi(0x2021c00), %g1 200c2f8: c2 08 63 64 ldub [ %g1 + 0x364 ], %g1 ! 2021f64 */ RTEMS_INLINE_ROUTINE bool _RTEMS_tasks_Priority_is_valid ( rtems_task_priority the_priority ) { return ( ( the_priority >= RTEMS_MINIMUM_PRIORITY ) && 200c2fc: 80 a6 40 01 cmp %i1, %g1 200c300: 18 80 00 1c bgu 200c370 200c304: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200c308: 80 a6 a0 00 cmp %i2, 0 200c30c: 02 80 00 19 be 200c370 200c310: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200c314: 40 00 0a 3a call 200ebfc <_Thread_Get> 200c318: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200c31c: c2 07 bf fc ld [ %fp + -4 ], %g1 200c320: 80 a0 60 00 cmp %g1, 0 200c324: 12 80 00 13 bne 200c370 200c328: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200c32c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200c330: 80 a6 60 00 cmp %i1, 0 200c334: 02 80 00 0d be 200c368 200c338: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200c33c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200c340: 80 a0 60 00 cmp %g1, 0 200c344: 02 80 00 06 be 200c35c 200c348: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200c34c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200c350: 80 a6 40 01 cmp %i1, %g1 200c354: 1a 80 00 05 bcc 200c368 <== ALWAYS TAKEN 200c358: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200c35c: 92 10 00 19 mov %i1, %o1 200c360: 40 00 08 dd call 200e6d4 <_Thread_Change_priority> 200c364: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200c368: 40 00 0a 18 call 200ebc8 <_Thread_Enable_dispatch> 200c36c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200c370: 81 c7 e0 08 ret 200c374: 81 e8 00 00 restore =============================================================================== 0202e45c : rtems_status_code rtems_task_variable_delete( rtems_id tid, void **ptr ) { 202e45c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp, *prev; if ( !ptr ) 202e460: 80 a6 60 00 cmp %i1, 0 202e464: 02 80 00 1e be 202e4dc 202e468: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; prev = NULL; the_thread = _Thread_Get (tid, &location); 202e46c: 90 10 00 18 mov %i0, %o0 202e470: 7f ff 89 bf call 2010b6c <_Thread_Get> 202e474: 92 07 bf fc add %fp, -4, %o1 switch (location) { 202e478: c2 07 bf fc ld [ %fp + -4 ], %g1 202e47c: 80 a0 60 00 cmp %g1, 0 202e480: 12 80 00 19 bne 202e4e4 202e484: 82 10 20 04 mov 4, %g1 case OBJECTS_LOCAL: tvp = the_thread->task_variables; 202e488: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 202e48c: 80 a0 60 00 cmp %g1, 0 202e490: 02 80 00 10 be 202e4d0 202e494: 01 00 00 00 nop if (tvp->ptr == ptr) { 202e498: c4 00 60 04 ld [ %g1 + 4 ], %g2 202e49c: 80 a0 80 19 cmp %g2, %i1 202e4a0: 32 80 00 09 bne,a 202e4c4 202e4a4: d2 00 40 00 ld [ %g1 ], %o1 if (prev) prev->next = tvp->next; else the_thread->task_variables = (rtems_task_variable_t *)tvp->next; 202e4a8: 10 80 00 18 b 202e508 202e4ac: c4 00 40 00 ld [ %g1 ], %g2 switch (location) { case OBJECTS_LOCAL: tvp = the_thread->task_variables; while (tvp) { if (tvp->ptr == ptr) { 202e4b0: 80 a0 80 19 cmp %g2, %i1 202e4b4: 22 80 00 0e be,a 202e4ec 202e4b8: c4 02 40 00 ld [ %o1 ], %g2 202e4bc: 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; 202e4c0: 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) { 202e4c4: 80 a2 60 00 cmp %o1, 0 202e4c8: 32 bf ff fa bne,a 202e4b0 <== ALWAYS TAKEN 202e4cc: c4 02 60 04 ld [ %o1 + 4 ], %g2 return RTEMS_SUCCESSFUL; } prev = tvp; tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 202e4d0: 7f ff 89 9a call 2010b38 <_Thread_Enable_dispatch> 202e4d4: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; 202e4d8: 82 10 20 09 mov 9, %g1 ! 9 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 202e4dc: 81 c7 e0 08 ret 202e4e0: 91 e8 00 01 restore %g0, %g1, %o0 202e4e4: 81 c7 e0 08 ret 202e4e8: 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; 202e4ec: 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 ); 202e4f0: 40 00 00 2d call 202e5a4 <_RTEMS_Tasks_Invoke_task_variable_dtor> 202e4f4: 01 00 00 00 nop _Thread_Enable_dispatch(); 202e4f8: 7f ff 89 90 call 2010b38 <_Thread_Enable_dispatch> 202e4fc: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 202e500: 10 bf ff f7 b 202e4dc 202e504: 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; 202e508: 92 10 00 01 mov %g1, %o1 202e50c: 10 bf ff f9 b 202e4f0 202e510: c4 22 21 64 st %g2, [ %o0 + 0x164 ] =============================================================================== 0202e514 : rtems_status_code rtems_task_variable_get( rtems_id tid, void **ptr, void **result ) { 202e514: 9d e3 bf 98 save %sp, -104, %sp 202e518: 90 10 00 18 mov %i0, %o0 Thread_Control *the_thread; Objects_Locations location; rtems_task_variable_t *tvp; if ( !ptr ) 202e51c: 80 a6 60 00 cmp %i1, 0 202e520: 02 80 00 1b be 202e58c 202e524: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !result ) 202e528: 80 a6 a0 00 cmp %i2, 0 202e52c: 02 80 00 1c be 202e59c 202e530: 01 00 00 00 nop return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get (tid, &location); 202e534: 7f ff 89 8e call 2010b6c <_Thread_Get> 202e538: 92 07 bf fc add %fp, -4, %o1 switch (location) { 202e53c: c2 07 bf fc ld [ %fp + -4 ], %g1 202e540: 80 a0 60 00 cmp %g1, 0 202e544: 12 80 00 12 bne 202e58c 202e548: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* * Figure out if the variable is in this task's list. */ tvp = the_thread->task_variables; 202e54c: c2 02 21 64 ld [ %o0 + 0x164 ], %g1 while (tvp) { 202e550: 80 a0 60 00 cmp %g1, 0 202e554: 32 80 00 07 bne,a 202e570 202e558: c4 00 60 04 ld [ %g1 + 4 ], %g2 202e55c: 30 80 00 0e b,a 202e594 202e560: 80 a0 60 00 cmp %g1, 0 202e564: 02 80 00 0c be 202e594 <== NEVER TAKEN 202e568: 01 00 00 00 nop if (tvp->ptr == ptr) { 202e56c: c4 00 60 04 ld [ %g1 + 4 ], %g2 202e570: 80 a0 80 19 cmp %g2, %i1 202e574: 32 bf ff fb bne,a 202e560 202e578: 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; 202e57c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; 202e580: b0 10 20 00 clr %i0 /* * Should this return the current (i.e not the * saved) value if `tid' is the current task? */ *result = tvp->tval; _Thread_Enable_dispatch(); 202e584: 7f ff 89 6d call 2010b38 <_Thread_Enable_dispatch> 202e588: c2 26 80 00 st %g1, [ %i2 ] return RTEMS_SUCCESSFUL; 202e58c: 81 c7 e0 08 ret 202e590: 81 e8 00 00 restore } tvp = (rtems_task_variable_t *)tvp->next; } _Thread_Enable_dispatch(); 202e594: 7f ff 89 69 call 2010b38 <_Thread_Enable_dispatch> 202e598: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; 202e59c: 81 c7 e0 08 ret 202e5a0: 81 e8 00 00 restore =============================================================================== 0201752c : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 201752c: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2017530: 11 00 80 f4 sethi %hi(0x203d000), %o0 2017534: 92 10 00 18 mov %i0, %o1 2017538: 90 12 23 f4 or %o0, 0x3f4, %o0 201753c: 40 00 0c e1 call 201a8c0 <_Objects_Get> 2017540: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2017544: c2 07 bf fc ld [ %fp + -4 ], %g1 2017548: 80 a0 60 00 cmp %g1, 0 201754c: 12 80 00 0c bne 201757c 2017550: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2017554: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2017558: 80 a0 60 04 cmp %g1, 4 201755c: 02 80 00 04 be 201756c <== NEVER TAKEN 2017560: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2017564: 40 00 15 65 call 201caf8 <_Watchdog_Remove> 2017568: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 201756c: 40 00 10 e4 call 201b8fc <_Thread_Enable_dispatch> 2017570: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2017574: 81 c7 e0 08 ret 2017578: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 201757c: 81 c7 e0 08 ret 2017580: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02017a70 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2017a70: 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; 2017a74: 03 00 80 f5 sethi %hi(0x203d400), %g1 2017a78: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 ! 203d434 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2017a7c: b8 10 00 18 mov %i0, %i4 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 2017a80: 80 a7 60 00 cmp %i5, 0 2017a84: 02 80 00 3a be 2017b6c 2017a88: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2017a8c: 03 00 80 f2 sethi %hi(0x203c800), %g1 2017a90: c2 08 62 80 ldub [ %g1 + 0x280 ], %g1 ! 203ca80 <_TOD_Is_set> 2017a94: 80 a0 60 00 cmp %g1, 0 2017a98: 02 80 00 35 be 2017b6c <== NEVER TAKEN 2017a9c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2017aa0: 80 a6 a0 00 cmp %i2, 0 2017aa4: 02 80 00 32 be 2017b6c 2017aa8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2017aac: 90 10 00 19 mov %i1, %o0 2017ab0: 7f ff f3 45 call 20147c4 <_TOD_Validate> 2017ab4: b0 10 20 14 mov 0x14, %i0 2017ab8: 80 8a 20 ff btst 0xff, %o0 2017abc: 02 80 00 2c be 2017b6c 2017ac0: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017ac4: 7f ff f3 05 call 20146d8 <_TOD_To_seconds> 2017ac8: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2017acc: 21 00 80 f2 sethi %hi(0x203c800), %l0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017ad0: b2 10 00 08 mov %o0, %i1 2017ad4: d0 1c 23 00 ldd [ %l0 + 0x300 ], %o0 2017ad8: 94 10 20 00 clr %o2 2017adc: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017ae0: 40 00 52 7e call 202c4d8 <__divdi3> 2017ae4: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 if ( seconds <= _TOD_Seconds_since_epoch() ) 2017ae8: 80 a6 40 09 cmp %i1, %o1 2017aec: 08 80 00 20 bleu 2017b6c 2017af0: 92 10 00 1c mov %i4, %o1 2017af4: 11 00 80 f4 sethi %hi(0x203d000), %o0 2017af8: 94 07 bf fc add %fp, -4, %o2 2017afc: 40 00 0b 71 call 201a8c0 <_Objects_Get> 2017b00: 90 12 23 f4 or %o0, 0x3f4, %o0 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2017b04: c2 07 bf fc ld [ %fp + -4 ], %g1 2017b08: 80 a0 60 00 cmp %g1, 0 2017b0c: 12 80 00 1a bne 2017b74 2017b10: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2017b14: 40 00 13 f9 call 201caf8 <_Watchdog_Remove> 2017b18: 90 02 20 10 add %o0, 0x10, %o0 2017b1c: d0 1c 23 00 ldd [ %l0 + 0x300 ], %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2017b20: 82 10 20 03 mov 3, %g1 2017b24: 94 10 20 00 clr %o2 2017b28: c2 26 20 38 st %g1, [ %i0 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2017b2c: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 2017b30: f8 26 20 30 st %i4, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 2017b34: f6 26 20 34 st %i3, [ %i0 + 0x34 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2017b38: c0 26 20 18 clr [ %i0 + 0x18 ] 2017b3c: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2017b40: 40 00 52 66 call 202c4d8 <__divdi3> 2017b44: 96 12 e2 00 or %o3, 0x200, %o3 ! 3b9aca00 _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 ); 2017b48: 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(); 2017b4c: b2 26 40 09 sub %i1, %o1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2017b50: 90 10 00 1d mov %i5, %o0 2017b54: 92 10 00 18 mov %i0, %o1 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2017b58: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2017b5c: 9f c0 40 00 call %g1 2017b60: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2017b64: 40 00 0f 66 call 201b8fc <_Thread_Enable_dispatch> 2017b68: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2017b6c: 81 c7 e0 08 ret 2017b70: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2017b74: 81 c7 e0 08 ret 2017b78: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02008458 : #include int sched_get_priority_max( int policy ) { 2008458: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 200845c: 80 a6 20 04 cmp %i0, 4 2008460: 08 80 00 08 bleu 2008480 2008464: 82 10 20 01 mov 1, %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2008468: 40 00 23 79 call 201124c <__errno> 200846c: b0 10 3f ff mov -1, %i0 2008470: 82 10 20 16 mov 0x16, %g1 2008474: c2 22 00 00 st %g1, [ %o0 ] 2008478: 81 c7 e0 08 ret 200847c: 81 e8 00 00 restore int sched_get_priority_max( int policy ) { switch ( policy ) { 2008480: b1 28 40 18 sll %g1, %i0, %i0 2008484: 80 8e 20 17 btst 0x17, %i0 2008488: 02 bf ff f8 be 2008468 <== NEVER TAKEN 200848c: 03 00 80 8a sethi %hi(0x2022800), %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2008490: f0 08 62 24 ldub [ %g1 + 0x224 ], %i0 ! 2022a24 } 2008494: 81 c7 e0 08 ret 2008498: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 0200849c : #include int sched_get_priority_min( int policy ) { 200849c: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 20084a0: 80 a6 20 04 cmp %i0, 4 20084a4: 08 80 00 09 bleu 20084c8 20084a8: 84 10 20 01 mov 1, %g2 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 20084ac: 40 00 23 68 call 201124c <__errno> 20084b0: 01 00 00 00 nop 20084b4: 82 10 3f ff mov -1, %g1 ! ffffffff 20084b8: 84 10 20 16 mov 0x16, %g2 20084bc: c4 22 00 00 st %g2, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 20084c0: 81 c7 e0 08 ret 20084c4: 91 e8 00 01 restore %g0, %g1, %o0 int sched_get_priority_min( int policy ) { switch ( policy ) { 20084c8: b1 28 80 18 sll %g2, %i0, %i0 20084cc: 80 8e 20 17 btst 0x17, %i0 20084d0: 02 bf ff f7 be 20084ac <== NEVER TAKEN 20084d4: 82 10 20 01 mov 1, %g1 default: rtems_set_errno_and_return_minus_one( EINVAL ); } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 20084d8: 81 c7 e0 08 ret 20084dc: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 020084e0 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 20084e0: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 20084e4: 80 a6 20 00 cmp %i0, 0 20084e8: 12 80 00 0a bne 2008510 <== ALWAYS TAKEN 20084ec: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); if ( !interval ) 20084f0: 02 80 00 13 be 200853c 20084f4: 03 00 80 8d sethi %hi(0x2023400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 20084f8: d0 00 63 24 ld [ %g1 + 0x324 ], %o0 ! 2023724 <_Thread_Ticks_per_timeslice> 20084fc: 92 10 00 19 mov %i1, %o1 2008500: 40 00 0f 7d call 200c2f4 <_Timespec_From_ticks> 2008504: b0 10 20 00 clr %i0 return 0; } 2008508: 81 c7 e0 08 ret 200850c: 81 e8 00 00 restore { /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 2008510: 7f ff ee 6d call 2003ec4 2008514: 01 00 00 00 nop 2008518: 80 a2 00 18 cmp %o0, %i0 200851c: 02 bf ff f5 be 20084f0 2008520: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2008524: 40 00 23 4a call 201124c <__errno> 2008528: b0 10 3f ff mov -1, %i0 200852c: 82 10 20 03 mov 3, %g1 2008530: c2 22 00 00 st %g1, [ %o0 ] 2008534: 81 c7 e0 08 ret 2008538: 81 e8 00 00 restore if ( !interval ) rtems_set_errno_and_return_minus_one( EINVAL ); 200853c: 40 00 23 44 call 201124c <__errno> 2008540: b0 10 3f ff mov -1, %i0 2008544: 82 10 20 16 mov 0x16, %g1 2008548: c2 22 00 00 st %g1, [ %o0 ] 200854c: 81 c7 e0 08 ret 2008550: 81 e8 00 00 restore =============================================================================== 02008ad0 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2008ad0: 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++; 2008ad4: 03 00 80 8d sethi %hi(0x2023400), %g1 2008ad8: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2008adc: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2008ae0: 84 00 a0 01 inc %g2 2008ae4: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 2008ae8: c2 00 61 40 ld [ %g1 + 0x140 ], %g1 2008aec: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2008af0: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2008af4: fa 27 a0 58 st %i5, [ %fp + 0x58 ] Objects_Locations location; size_t name_len; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2008af8: b6 8e 62 00 andcc %i1, 0x200, %i3 2008afc: 12 80 00 27 bne 2008b98 2008b00: b8 10 20 00 clr %i4 const char *name, Objects_Id *id, size_t *len ) { return _POSIX_Name_to_id( &_POSIX_Semaphore_Information, name, id, len ); 2008b04: 3b 00 80 8e sethi %hi(0x2023800), %i5 2008b08: 92 10 00 18 mov %i0, %o1 2008b0c: 90 17 60 40 or %i5, 0x40, %o0 2008b10: 94 07 bf f0 add %fp, -16, %o2 2008b14: 7f ff fe 60 call 2008494 <_POSIX_Name_to_id> 2008b18: 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 ) { 2008b1c: b4 92 20 00 orcc %o0, 0, %i2 2008b20: 22 80 00 0e be,a 2008b58 2008b24: 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) ) ) { 2008b28: 80 a6 a0 02 cmp %i2, 2 2008b2c: 12 80 00 04 bne 2008b3c 2008b30: 80 a6 e0 00 cmp %i3, 0 2008b34: 12 80 00 1d bne 2008ba8 2008b38: d2 07 bf fc ld [ %fp + -4 ], %o1 _Thread_Enable_dispatch(); 2008b3c: 40 00 0e 76 call 200c514 <_Thread_Enable_dispatch> 2008b40: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 2008b44: 40 00 26 91 call 2012588 <__errno> 2008b48: 01 00 00 00 nop 2008b4c: f4 22 00 00 st %i2, [ %o0 ] 2008b50: 81 c7 e0 08 ret 2008b54: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2008b58: 80 a6 6a 00 cmp %i1, 0xa00 2008b5c: 02 80 00 20 be 2008bdc 2008b60: 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 *) 2008b64: 94 07 bf f8 add %fp, -8, %o2 2008b68: 40 00 0a 51 call 200b4ac <_Objects_Get> 2008b6c: 90 17 60 40 or %i5, 0x40, %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; 2008b70: 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 ); 2008b74: d0 27 bf f4 st %o0, [ %fp + -12 ] the_semaphore->open_count += 1; 2008b78: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2008b7c: 40 00 0e 66 call 200c514 <_Thread_Enable_dispatch> 2008b80: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 2008b84: 40 00 0e 64 call 200c514 <_Thread_Enable_dispatch> 2008b88: 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; 2008b8c: f0 07 bf f4 ld [ %fp + -12 ], %i0 #endif } 2008b90: 81 c7 e0 08 ret 2008b94: 91 ee 20 08 restore %i0, 8, %o0 _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); mode = va_arg( arg, mode_t ); value = va_arg( arg, unsigned int ); 2008b98: 82 07 a0 54 add %fp, 0x54, %g1 2008b9c: f8 07 a0 50 ld [ %fp + 0x50 ], %i4 2008ba0: 10 bf ff d9 b 2008b04 2008ba4: 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( 2008ba8: 94 10 20 00 clr %o2 2008bac: 96 10 00 1c mov %i4, %o3 2008bb0: 98 07 bf f4 add %fp, -12, %o4 2008bb4: 40 00 1b 44 call 200f8c4 <_POSIX_Semaphore_Create_support> 2008bb8: 90 10 00 18 mov %i0, %o0 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 2008bbc: 40 00 0e 56 call 200c514 <_Thread_Enable_dispatch> 2008bc0: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2008bc4: 80 a7 7f ff cmp %i5, -1 2008bc8: 02 bf ff e2 be 2008b50 <== NEVER TAKEN 2008bcc: b0 10 3f ff mov -1, %i0 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; 2008bd0: f0 07 bf f4 ld [ %fp + -12 ], %i0 2008bd4: 81 c7 e0 08 ret 2008bd8: 91 ee 20 08 restore %i0, 8, %o0 /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); 2008bdc: 40 00 0e 4e call 200c514 <_Thread_Enable_dispatch> 2008be0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 2008be4: 40 00 26 69 call 2012588 <__errno> 2008be8: 01 00 00 00 nop 2008bec: 82 10 20 11 mov 0x11, %g1 ! 11 2008bf0: c2 22 00 00 st %g1, [ %o0 ] 2008bf4: 81 c7 e0 08 ret 2008bf8: 81 e8 00 00 restore =============================================================================== 0200aefc : int sem_timedwait( sem_t *sem, const struct timespec *abstime ) { 200aefc: 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 ); 200af00: 90 10 00 19 mov %i1, %o0 200af04: 40 00 17 32 call 2010bcc <_POSIX_Absolute_timeout_to_ticks> 200af08: 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 ); 200af0c: 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 ) 200af10: 80 a2 20 03 cmp %o0, 3 200af14: 02 80 00 06 be 200af2c <== ALWAYS TAKEN 200af18: 90 10 00 18 mov %i0, %o0 do_wait = false; lock_status = _POSIX_Semaphore_Wait_support( sem, do_wait, ticks ); 200af1c: 40 00 1a 27 call 20117b8 <_POSIX_Semaphore_Wait_support> <== NOT EXECUTED 200af20: 92 10 20 00 clr %o1 <== NOT EXECUTED 200af24: 81 c7 e0 08 ret <== NOT EXECUTED 200af28: 91 e8 00 08 restore %g0, %o0, %o0 <== NOT EXECUTED 200af2c: 40 00 1a 23 call 20117b8 <_POSIX_Semaphore_Wait_support> 200af30: 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; } 200af34: 81 c7 e0 08 ret 200af38: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 0200841c : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 200841c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2008420: 80 a6 a0 00 cmp %i2, 0 2008424: 02 80 00 0d be 2008458 2008428: 87 2e 20 02 sll %i0, 2, %g3 *oact = _POSIX_signals_Vectors[ sig ]; 200842c: 05 00 80 89 sethi %hi(0x2022400), %g2 2008430: 83 2e 20 04 sll %i0, 4, %g1 2008434: 84 10 a2 a0 or %g2, 0x2a0, %g2 2008438: 82 20 40 03 sub %g1, %g3, %g1 200843c: c6 00 80 01 ld [ %g2 + %g1 ], %g3 2008440: 82 00 80 01 add %g2, %g1, %g1 2008444: c6 26 80 00 st %g3, [ %i2 ] 2008448: c4 00 60 04 ld [ %g1 + 4 ], %g2 200844c: c4 26 a0 04 st %g2, [ %i2 + 4 ] 2008450: c2 00 60 08 ld [ %g1 + 8 ], %g1 2008454: c2 26 a0 08 st %g1, [ %i2 + 8 ] if ( !sig ) 2008458: 80 a6 20 00 cmp %i0, 0 200845c: 02 80 00 33 be 2008528 2008460: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2008464: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2008468: 80 a0 60 1f cmp %g1, 0x1f 200846c: 18 80 00 2f bgu 2008528 2008470: 80 a6 20 09 cmp %i0, 9 * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2008474: 02 80 00 2d be 2008528 2008478: 80 a6 60 00 cmp %i1, 0 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 200847c: 02 80 00 1a be 20084e4 <== NEVER TAKEN 2008480: 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 ); 2008484: 7f ff e9 77 call 2002a60 2008488: 01 00 00 00 nop 200848c: b4 10 00 08 mov %o0, %i2 if ( act->sa_handler == SIG_DFL ) { 2008490: c2 06 60 08 ld [ %i1 + 8 ], %g1 2008494: 80 a0 60 00 cmp %g1, 0 2008498: 02 80 00 15 be 20084ec 200849c: 83 2e 20 02 sll %i0, 2, %g1 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; } else { _POSIX_signals_Clear_process_signals( sig ); 20084a0: 40 00 18 76 call 200e678 <_POSIX_signals_Clear_process_signals> 20084a4: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 20084a8: c4 06 40 00 ld [ %i1 ], %g2 20084ac: 87 2e 20 02 sll %i0, 2, %g3 20084b0: 03 00 80 89 sethi %hi(0x2022400), %g1 20084b4: b1 2e 20 04 sll %i0, 4, %i0 20084b8: 82 10 62 a0 or %g1, 0x2a0, %g1 20084bc: b0 26 00 03 sub %i0, %g3, %i0 20084c0: c4 20 40 18 st %g2, [ %g1 + %i0 ] 20084c4: c4 06 60 04 ld [ %i1 + 4 ], %g2 20084c8: b0 00 40 18 add %g1, %i0, %i0 20084cc: c4 26 20 04 st %g2, [ %i0 + 4 ] 20084d0: c2 06 60 08 ld [ %i1 + 8 ], %g1 20084d4: c2 26 20 08 st %g1, [ %i0 + 8 ] } _ISR_Enable( level ); 20084d8: 7f ff e9 66 call 2002a70 20084dc: 90 10 00 1a mov %i2, %o0 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 20084e0: 82 10 20 00 clr %g1 } 20084e4: 81 c7 e0 08 ret 20084e8: 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 ]; 20084ec: b1 2e 20 04 sll %i0, 4, %i0 20084f0: b0 26 00 01 sub %i0, %g1, %i0 20084f4: 03 00 80 80 sethi %hi(0x2020000), %g1 20084f8: 82 10 60 d4 or %g1, 0xd4, %g1 ! 20200d4 <_POSIX_signals_Default_vectors> 20084fc: c8 00 40 18 ld [ %g1 + %i0 ], %g4 2008500: 82 00 40 18 add %g1, %i0, %g1 2008504: c6 00 60 04 ld [ %g1 + 4 ], %g3 2008508: c4 00 60 08 ld [ %g1 + 8 ], %g2 200850c: 03 00 80 89 sethi %hi(0x2022400), %g1 2008510: 82 10 62 a0 or %g1, 0x2a0, %g1 ! 20226a0 <_POSIX_signals_Vectors> 2008514: c8 20 40 18 st %g4, [ %g1 + %i0 ] 2008518: b0 00 40 18 add %g1, %i0, %i0 200851c: c6 26 20 04 st %g3, [ %i0 + 4 ] 2008520: 10 bf ff ee b 20084d8 2008524: 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 ); 2008528: 40 00 24 c1 call 201182c <__errno> 200852c: 01 00 00 00 nop 2008530: 84 10 20 16 mov 0x16, %g2 ! 16 2008534: 82 10 3f ff mov -1, %g1 2008538: 10 bf ff eb b 20084e4 200853c: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02008950 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2008950: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2008954: ba 96 20 00 orcc %i0, 0, %i5 2008958: 02 80 00 9f be 2008bd4 200895c: 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 ) { 2008960: 02 80 00 64 be 2008af0 2008964: 80 a6 60 00 cmp %i1, 0 if ( !_Timespec_Is_valid( timeout ) ) 2008968: 40 00 0f d0 call 200c8a8 <_Timespec_Is_valid> 200896c: 90 10 00 1a mov %i2, %o0 2008970: 80 8a 20 ff btst 0xff, %o0 2008974: 02 80 00 98 be 2008bd4 2008978: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 200897c: 40 00 0f dc call 200c8ec <_Timespec_To_ticks> 2008980: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2008984: a0 92 20 00 orcc %o0, 0, %l0 2008988: 02 80 00 93 be 2008bd4 <== NEVER TAKEN 200898c: 80 a6 60 00 cmp %i1, 0 /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008990: 22 80 00 02 be,a 2008998 <== NEVER TAKEN 2008994: b2 07 bf f4 add %fp, -12, %i1 <== NOT EXECUTED the_thread = _Thread_Executing; 2008998: 39 00 80 8a sethi %hi(0x2022800), %i4 200899c: b8 17 23 60 or %i4, 0x360, %i4 ! 2022b60 <_Per_CPU_Information> 20089a0: f0 07 20 0c ld [ %i4 + 0xc ], %i0 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 20089a4: 7f ff e9 0a call 2002dcc 20089a8: f4 06 21 5c ld [ %i0 + 0x15c ], %i2 20089ac: b6 10 00 08 mov %o0, %i3 if ( *set & api->signals_pending ) { 20089b0: c4 07 40 00 ld [ %i5 ], %g2 20089b4: c2 06 a0 d4 ld [ %i2 + 0xd4 ], %g1 20089b8: 80 88 80 01 btst %g2, %g1 20089bc: 12 80 00 2a bne 2008a64 20089c0: 92 10 20 1b mov 0x1b, %o1 return the_info->si_signo; } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 20089c4: 03 00 80 8b sethi %hi(0x2022c00), %g1 20089c8: c2 00 61 b4 ld [ %g1 + 0x1b4 ], %g1 ! 2022db4 <_POSIX_signals_Pending> 20089cc: 80 88 80 01 btst %g2, %g1 20089d0: 02 80 00 4c be 2008b00 20089d4: 86 10 20 01 mov 1, %g3 20089d8: b0 10 20 1b mov 0x1b, %i0 /* 3.3.8 Synchronously Accept a Signal, P1003.1b-1993, p. 76 NOTE: P1003.1c/D10, p. 39 adds sigwait(). */ int _EXFUN(sigwaitinfo, (const sigset_t *set, siginfo_t *info)); int _EXFUN(sigtimedwait, 20089dc: 84 06 3f ff add %i0, -1, %g2 20089e0: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 20089e4: 80 88 80 01 btst %g2, %g1 20089e8: 32 80 00 12 bne,a 2008a30 <== NEVER TAKEN 20089ec: 90 10 00 1a mov %i2, %o0 <== NOT EXECUTED sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 20089f0: b0 06 20 01 inc %i0 20089f4: 80 a6 20 20 cmp %i0, 0x20 20089f8: 12 bf ff fa bne 20089e0 20089fc: 84 06 3f ff add %i0, -1, %g2 2008a00: b0 10 20 01 mov 1, %i0 2008a04: 10 80 00 05 b 2008a18 2008a08: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2008a0c: 80 a6 20 1b cmp %i0, 0x1b 2008a10: 02 80 00 08 be 2008a30 <== NEVER TAKEN 2008a14: 90 10 00 1a mov %i2, %o0 2008a18: 84 06 3f ff add %i0, -1, %g2 2008a1c: 85 28 c0 02 sll %g3, %g2, %g2 if ( set & signo_to_mask( signo ) ) { 2008a20: 80 88 80 01 btst %g2, %g1 2008a24: 22 bf ff fa be,a 2008a0c 2008a28: b0 06 20 01 inc %i0 /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2008a2c: 90 10 00 1a mov %i2, %o0 2008a30: 92 10 00 18 mov %i0, %o1 2008a34: 94 10 00 19 mov %i1, %o2 2008a38: 96 10 20 01 mov 1, %o3 2008a3c: 40 00 19 51 call 200ef80 <_POSIX_signals_Clear_signals> 2008a40: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2008a44: 7f ff e8 e6 call 2002ddc 2008a48: 90 10 00 1b mov %i3, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2008a4c: 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; 2008a50: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2008a54: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2008a58: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2008a5c: 81 c7 e0 08 ret 2008a60: 81 e8 00 00 restore 2008a64: 86 10 20 01 mov 1, %g3 2008a68: 84 02 7f ff add %o1, -1, %g2 2008a6c: 85 28 c0 02 sll %g3, %g2, %g2 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2008a70: 80 88 80 01 btst %g2, %g1 2008a74: 32 80 00 12 bne,a 2008abc <== NEVER TAKEN 2008a78: d2 26 40 00 st %o1, [ %i1 ] <== NOT EXECUTED sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2008a7c: 92 02 60 01 inc %o1 2008a80: 80 a2 60 20 cmp %o1, 0x20 2008a84: 12 bf ff fa bne 2008a6c 2008a88: 84 02 7f ff add %o1, -1, %g2 2008a8c: 92 10 20 01 mov 1, %o1 2008a90: 10 80 00 05 b 2008aa4 2008a94: 86 10 20 01 mov 1, %g3 */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2008a98: 80 a2 60 1b cmp %o1, 0x1b 2008a9c: 22 80 00 08 be,a 2008abc <== NEVER TAKEN 2008aa0: d2 26 40 00 st %o1, [ %i1 ] <== NOT EXECUTED 2008aa4: 84 02 7f ff add %o1, -1, %g2 2008aa8: 85 28 c0 02 sll %g3, %g2, %g2 if ( set & signo_to_mask( signo ) ) { 2008aac: 80 88 80 01 btst %g2, %g1 2008ab0: 22 bf ff fa be,a 2008a98 2008ab4: 92 02 60 01 inc %o1 /* 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 ); 2008ab8: d2 26 40 00 st %o1, [ %i1 ] _POSIX_signals_Clear_signals( 2008abc: 90 10 00 1a mov %i2, %o0 2008ac0: 94 10 00 19 mov %i1, %o2 2008ac4: 96 10 20 00 clr %o3 2008ac8: 40 00 19 2e call 200ef80 <_POSIX_signals_Clear_signals> 2008acc: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2008ad0: 7f ff e8 c3 call 2002ddc 2008ad4: 90 10 00 1b mov %i3, %o0 the_info->si_code = SI_USER; 2008ad8: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2008adc: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2008ae0: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2008ae4: f0 06 40 00 ld [ %i1 ], %i0 2008ae8: 81 c7 e0 08 ret 2008aec: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2008af0: 12 bf ff aa bne 2008998 2008af4: a0 10 20 00 clr %l0 2008af8: 10 bf ff a8 b 2008998 2008afc: b2 07 bf f4 add %fp, -12, %i1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008b00: 03 00 80 89 sethi %hi(0x2022400), %g1 2008b04: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 2022620 <_Thread_Dispatch_disable_level> the_info->si_code = SI_USER; the_info->si_value.sival_int = 0; return signo; } the_info->si_signo = -1; 2008b08: 86 10 3f ff mov -1, %g3 2008b0c: c6 26 40 00 st %g3, [ %i1 ] 2008b10: 84 00 a0 01 inc %g2 2008b14: c4 20 62 20 st %g2, [ %g1 + 0x220 ] return _Thread_Dispatch_disable_level; 2008b18: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2008b1c: 82 10 20 04 mov 4, %g1 2008b20: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_thread->Wait.option = *set; 2008b24: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2008b28: f2 26 20 28 st %i1, [ %i0 + 0x28 ] the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; 2008b2c: c2 26 20 30 st %g1, [ %i0 + 0x30 ] RTEMS_INLINE_ROUTINE void _Thread_queue_Enter_critical_section ( Thread_queue_Control *the_thread_queue ) { the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2008b30: b6 10 20 01 mov 1, %i3 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2008b34: 23 00 80 8b sethi %hi(0x2022c00), %l1 2008b38: a2 14 61 4c or %l1, 0x14c, %l1 ! 2022d4c <_POSIX_signals_Wait_queue> 2008b3c: e2 26 20 44 st %l1, [ %i0 + 0x44 ] 2008b40: f6 24 60 30 st %i3, [ %l1 + 0x30 ] the_thread->Wait.return_code = EINTR; the_thread->Wait.option = *set; the_thread->Wait.return_argument = the_info; _Thread_queue_Enter_critical_section( &_POSIX_signals_Wait_queue ); _ISR_Enable( level ); 2008b44: 7f ff e8 a6 call 2002ddc 2008b48: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2008b4c: 90 10 00 11 mov %l1, %o0 2008b50: 92 10 00 10 mov %l0, %o1 2008b54: 15 00 80 31 sethi %hi(0x200c400), %o2 2008b58: 40 00 0d e1 call 200c2dc <_Thread_queue_Enqueue_with_handler> 2008b5c: 94 12 a2 bc or %o2, 0x2bc, %o2 ! 200c6bc <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2008b60: 40 00 0c 90 call 200bda0 <_Thread_Enable_dispatch> 2008b64: 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 ); 2008b68: d2 06 40 00 ld [ %i1 ], %o1 2008b6c: 90 10 00 1a mov %i2, %o0 2008b70: 94 10 00 19 mov %i1, %o2 2008b74: 96 10 20 00 clr %o3 2008b78: 40 00 19 02 call 200ef80 <_POSIX_signals_Clear_signals> 2008b7c: 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) 2008b80: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2008b84: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008b88: 80 a0 60 04 cmp %g1, 4 2008b8c: 12 80 00 0b bne 2008bb8 2008b90: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2008b94: f0 06 40 00 ld [ %i1 ], %i0 2008b98: c2 07 40 00 ld [ %i5 ], %g1 2008b9c: 84 06 3f ff add %i0, -1, %g2 2008ba0: b7 2e c0 02 sll %i3, %g2, %i3 2008ba4: 80 8e c0 01 btst %i3, %g1 2008ba8: 02 80 00 04 be 2008bb8 2008bac: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; return -1; } return the_info->si_signo; } 2008bb0: 81 c7 e0 08 ret 2008bb4: 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; 2008bb8: 40 00 25 01 call 2011fbc <__errno> 2008bbc: b0 10 3f ff mov -1, %i0 2008bc0: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2008bc4: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2008bc8: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2008bcc: 81 c7 e0 08 ret 2008bd0: 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 ); 2008bd4: 40 00 24 fa call 2011fbc <__errno> 2008bd8: b0 10 3f ff mov -1, %i0 2008bdc: 82 10 20 16 mov 0x16, %g1 2008be0: c2 22 00 00 st %g1, [ %o0 ] 2008be4: 81 c7 e0 08 ret 2008be8: 81 e8 00 00 restore =============================================================================== 0200a7f0 : int sigwait( const sigset_t *set, int *sig ) { 200a7f0: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 200a7f4: 92 10 20 00 clr %o1 200a7f8: 90 10 00 18 mov %i0, %o0 200a7fc: 7f ff ff 52 call 200a544 200a800: 94 10 20 00 clr %o2 if ( status != -1 ) { 200a804: 80 a2 3f ff cmp %o0, -1 200a808: 02 80 00 07 be 200a824 200a80c: 80 a6 60 00 cmp %i1, 0 if ( sig ) 200a810: 02 80 00 03 be 200a81c <== NEVER TAKEN 200a814: b0 10 20 00 clr %i0 *sig = status; 200a818: d0 26 40 00 st %o0, [ %i1 ] 200a81c: 81 c7 e0 08 ret 200a820: 81 e8 00 00 restore return 0; } return errno; 200a824: 40 00 24 19 call 2013888 <__errno> 200a828: 01 00 00 00 nop 200a82c: f0 02 00 00 ld [ %o0 ], %i0 } 200a830: 81 c7 e0 08 ret 200a834: 81 e8 00 00 restore =============================================================================== 02007644 : */ long sysconf( int name ) { 2007644: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2007648: 80 a6 20 02 cmp %i0, 2 200764c: 02 80 00 13 be 2007698 2007650: 03 00 80 78 sethi %hi(0x201e000), %g1 return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2007654: 80 a6 20 04 cmp %i0, 4 2007658: 02 80 00 0e be 2007690 200765c: c2 00 61 90 ld [ %g1 + 0x190 ], %g1 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2007660: 80 a6 20 33 cmp %i0, 0x33 2007664: 02 80 00 0b be 2007690 2007668: 82 10 24 00 mov 0x400, %g1 return 1024; if ( name == _SC_PAGESIZE ) 200766c: 80 a6 20 08 cmp %i0, 8 2007670: 02 80 00 08 be 2007690 2007674: 03 00 00 04 sethi %hi(0x1000), %g1 return PAGE_SIZE; if ( name == _SC_SYMLOOP_MAX ) 2007678: 80 a6 20 4f cmp %i0, 0x4f 200767c: 02 80 00 05 be 2007690 <== NEVER TAKEN 2007680: 82 10 20 20 mov 0x20, %g1 return RTEMS_FILESYSTEM_SYMLOOP_MAX; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2007684: 80 a6 22 03 cmp %i0, 0x203 2007688: 12 80 00 0c bne 20076b8 <== ALWAYS TAKEN 200768c: 82 10 20 00 clr %g1 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 2007690: 81 c7 e0 08 ret 2007694: 91 e8 00 01 restore %g0, %g1, %o0 int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / rtems_configuration_get_microseconds_per_tick()); 2007698: 03 00 80 78 sethi %hi(0x201e000), %g1 long sysconf( int name ) { if ( name == _SC_CLK_TCK ) return (TOD_MICROSECONDS_PER_SECOND / 200769c: d2 00 60 4c ld [ %g1 + 0x4c ], %o1 ! 201e04c 20076a0: 11 00 03 d0 sethi %hi(0xf4000), %o0 20076a4: 40 00 48 b4 call 2019974 <.udiv> 20076a8: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 20076ac: 82 10 00 08 mov %o0, %g1 if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); } 20076b0: 81 c7 e0 08 ret 20076b4: 91 e8 00 01 restore %g0, %g1, %o0 #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 20076b8: 40 00 24 c7 call 20109d4 <__errno> 20076bc: 01 00 00 00 nop 20076c0: 84 10 20 16 mov 0x16, %g2 ! 16 20076c4: 82 10 3f ff mov -1, %g1 20076c8: 10 bf ff f2 b 2007690 20076cc: c4 22 00 00 st %g2, [ %o0 ] =============================================================================== 02008bfc : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2008bfc: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2008c00: 80 a6 20 01 cmp %i0, 1 2008c04: 12 80 00 3e bne 2008cfc 2008c08: 80 a6 a0 00 cmp %i2, 0 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2008c0c: 02 80 00 3c be 2008cfc 2008c10: 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) { 2008c14: 02 80 00 0e be 2008c4c 2008c18: 03 00 80 8d sethi %hi(0x2023400), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2008c1c: c2 06 40 00 ld [ %i1 ], %g1 2008c20: 82 00 7f ff add %g1, -1, %g1 2008c24: 80 a0 60 01 cmp %g1, 1 2008c28: 18 80 00 35 bgu 2008cfc <== NEVER TAKEN 2008c2c: 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 ) 2008c30: c2 06 60 04 ld [ %i1 + 4 ], %g1 2008c34: 80 a0 60 00 cmp %g1, 0 2008c38: 02 80 00 31 be 2008cfc <== NEVER TAKEN 2008c3c: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2008c40: 80 a0 60 1f cmp %g1, 0x1f 2008c44: 18 80 00 2e bgu 2008cfc <== NEVER TAKEN 2008c48: 03 00 80 8d sethi %hi(0x2023400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008c4c: c4 00 61 40 ld [ %g1 + 0x140 ], %g2 ! 2023540 <_Thread_Dispatch_disable_level> 2008c50: 84 00 a0 01 inc %g2 2008c54: c4 20 61 40 st %g2, [ %g1 + 0x140 ] return _Thread_Dispatch_disable_level; 2008c58: c2 00 61 40 ld [ %g1 + 0x140 ], %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 ); 2008c5c: 3b 00 80 8e sethi %hi(0x2023800), %i5 2008c60: 40 00 08 c8 call 200af80 <_Objects_Allocate> 2008c64: 90 17 60 80 or %i5, 0x80, %o0 ! 2023880 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2008c68: 80 a2 20 00 cmp %o0, 0 2008c6c: 02 80 00 2a be 2008d14 2008c70: 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; 2008c74: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2008c78: 03 00 80 8e sethi %hi(0x2023800), %g1 2008c7c: c2 00 62 cc ld [ %g1 + 0x2cc ], %g1 ! 2023acc <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2008c80: 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; 2008c84: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2008c88: 02 80 00 08 be 2008ca8 2008c8c: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2008c90: c6 06 40 00 ld [ %i1 ], %g3 ptimer->inf.sigev_signo = evp->sigev_signo; 2008c94: c4 06 60 04 ld [ %i1 + 4 ], %g2 ptimer->inf.sigev_value = evp->sigev_value; 2008c98: 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; 2008c9c: c6 22 20 40 st %g3, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2008ca0: c4 22 20 44 st %g2, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2008ca4: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008ca8: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008cac: ba 17 60 80 or %i5, 0x80, %i5 2008cb0: c6 07 60 1c ld [ %i5 + 0x1c ], %g3 } ptimer->overrun = 0; 2008cb4: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2008cb8: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2008cbc: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2008cc0: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2008cc4: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008cc8: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2008ccc: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2008cd0: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2008cd4: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2008cd8: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008cdc: 85 28 a0 02 sll %g2, 2, %g2 2008ce0: 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; 2008ce4: 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; 2008ce8: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2008cec: 40 00 0e 0a call 200c514 <_Thread_Enable_dispatch> 2008cf0: b0 10 20 00 clr %i0 return 0; } 2008cf4: 81 c7 e0 08 ret 2008cf8: 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 ); 2008cfc: 40 00 26 23 call 2012588 <__errno> 2008d00: b0 10 3f ff mov -1, %i0 2008d04: 82 10 20 16 mov 0x16, %g1 2008d08: c2 22 00 00 st %g1, [ %o0 ] 2008d0c: 81 c7 e0 08 ret 2008d10: 81 e8 00 00 restore /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { _Thread_Enable_dispatch(); 2008d14: 40 00 0e 00 call 200c514 <_Thread_Enable_dispatch> 2008d18: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one( EAGAIN ); 2008d1c: 40 00 26 1b call 2012588 <__errno> 2008d20: 01 00 00 00 nop 2008d24: 82 10 20 0b mov 0xb, %g1 ! b 2008d28: c2 22 00 00 st %g1, [ %o0 ] 2008d2c: 81 c7 e0 08 ret 2008d30: 81 e8 00 00 restore =============================================================================== 02007840 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2007840: 9d e3 bf 78 save %sp, -136, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2007844: 80 a6 a0 00 cmp %i2, 0 2007848: 02 80 00 a6 be 2007ae0 <== NEVER TAKEN 200784c: 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) ) ) { 2007850: 40 00 10 4a call 200b978 <_Timespec_Is_valid> 2007854: 90 06 a0 08 add %i2, 8, %o0 2007858: 80 8a 20 ff btst 0xff, %o0 200785c: 02 80 00 a1 be 2007ae0 2007860: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2007864: 40 00 10 45 call 200b978 <_Timespec_Is_valid> 2007868: 90 10 00 1a mov %i2, %o0 200786c: 80 8a 20 ff btst 0xff, %o0 2007870: 02 80 00 9c be 2007ae0 <== NEVER TAKEN 2007874: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2007878: 12 80 00 98 bne 2007ad8 200787c: 80 a6 60 04 cmp %i1, 4 rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2007880: c8 06 80 00 ld [ %i2 ], %g4 2007884: c6 06 a0 04 ld [ %i2 + 4 ], %g3 2007888: c4 06 a0 08 ld [ %i2 + 8 ], %g2 200788c: c2 06 a0 0c ld [ %i2 + 0xc ], %g1 2007890: c8 27 bf d8 st %g4, [ %fp + -40 ] 2007894: c6 27 bf dc st %g3, [ %fp + -36 ] 2007898: c4 27 bf e0 st %g2, [ %fp + -32 ] /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 200789c: 80 a6 60 04 cmp %i1, 4 20078a0: 02 80 00 4a be 20079c8 20078a4: c2 27 bf e4 st %g1, [ %fp + -28 ] RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 20078a8: 92 10 00 18 mov %i0, %o1 20078ac: 11 00 80 7e sethi %hi(0x201f800), %o0 20078b0: 94 07 bf fc add %fp, -4, %o2 20078b4: 40 00 09 8c call 2009ee4 <_Objects_Get> 20078b8: 90 12 20 90 or %o0, 0x90, %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 ) { 20078bc: c2 07 bf fc ld [ %fp + -4 ], %g1 20078c0: 80 a0 60 00 cmp %g1, 0 20078c4: 12 80 00 64 bne 2007a54 <== NEVER TAKEN 20078c8: b0 10 00 08 mov %o0, %i0 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 ) { 20078cc: c2 07 bf e0 ld [ %fp + -32 ], %g1 20078d0: 80 a0 60 00 cmp %g1, 0 20078d4: 12 80 00 05 bne 20078e8 20078d8: c2 07 bf e4 ld [ %fp + -28 ], %g1 20078dc: 80 a0 60 00 cmp %g1, 0 20078e0: 02 80 00 63 be 2007a6c 20078e4: 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 ); 20078e8: 40 00 10 5b call 200ba54 <_Timespec_To_ticks> 20078ec: 90 10 00 1a mov %i2, %o0 20078f0: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 20078f4: 40 00 10 58 call 200ba54 <_Timespec_To_ticks> 20078f8: 90 07 bf e0 add %fp, -32, %o0 activated = _POSIX_Timer_Insert_helper( 20078fc: d4 06 20 08 ld [ %i0 + 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 ); 2007900: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2007904: 98 10 00 18 mov %i0, %o4 2007908: 90 06 20 10 add %i0, 0x10, %o0 200790c: 17 00 80 1e sethi %hi(0x2007800), %o3 2007910: 40 00 1a 44 call 200e220 <_POSIX_Timer_Insert_helper> 2007914: 96 12 e2 f8 or %o3, 0x2f8, %o3 ! 2007af8 <_POSIX_Timer_TSR> initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 2007918: 80 8a 20 ff btst 0xff, %o0 200791c: 02 80 00 27 be 20079b8 2007920: 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 ) 2007924: 02 80 00 0b be 2007950 2007928: c2 07 bf d8 ld [ %fp + -40 ], %g1 *ovalue = ptimer->timer_data; 200792c: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 2007930: c2 26 c0 00 st %g1, [ %i3 ] 2007934: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 2007938: c2 26 e0 04 st %g1, [ %i3 + 4 ] 200793c: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2007940: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2007944: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2007948: c2 26 e0 0c st %g1, [ %i3 + 0xc ] ptimer->timer_data = normalize; 200794c: c2 07 bf d8 ld [ %fp + -40 ], %g1 struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 2007950: 90 07 bf e8 add %fp, -24, %o0 2007954: c2 26 20 54 st %g1, [ %i0 + 0x54 ] 2007958: c2 07 bf dc ld [ %fp + -36 ], %g1 200795c: c2 26 20 58 st %g1, [ %i0 + 0x58 ] 2007960: c2 07 bf e0 ld [ %fp + -32 ], %g1 2007964: c2 26 20 5c st %g1, [ %i0 + 0x5c ] 2007968: c2 07 bf e4 ld [ %fp + -28 ], %g1 200796c: c2 26 20 60 st %g1, [ %i0 + 0x60 ] /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2007970: 82 10 20 03 mov 3, %g1 2007974: 40 00 06 8a call 200939c <_TOD_Get_as_timestamp> 2007978: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 200797c: f8 1f bf e8 ldd [ %fp + -24 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 2007980: 94 10 20 00 clr %o2 2007984: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 2007988: 90 10 00 1c mov %i4, %o0 200798c: 96 12 e2 00 or %o3, 0x200, %o3 2007990: 40 00 4b 9f call 201a80c <__divdi3> 2007994: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 2007998: 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); 200799c: d2 26 20 6c st %o1, [ %i0 + 0x6c ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20079a0: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20079a4: 90 10 00 1c mov %i4, %o0 20079a8: 96 12 e2 00 or %o3, 0x200, %o3 20079ac: 40 00 4c 7e call 201aba4 <__moddi3> 20079b0: 92 10 00 1d mov %i5, %o1 20079b4: d2 26 20 70 st %o1, [ %i0 + 0x70 ] _TOD_Get( &ptimer->time ); _Thread_Enable_dispatch(); 20079b8: 40 00 0d 2e call 200ae70 <_Thread_Enable_dispatch> 20079bc: b0 10 20 00 clr %i0 return 0; 20079c0: 81 c7 e0 08 ret 20079c4: 81 e8 00 00 restore struct timespec *tod_as_timespec ) { Timestamp_Control tod_as_timestamp; _TOD_Get_as_timestamp( &tod_as_timestamp ); 20079c8: 40 00 06 75 call 200939c <_TOD_Get_as_timestamp> 20079cc: 90 07 bf e8 add %fp, -24, %o0 _Timestamp_To_timespec( &tod_as_timestamp, tod_as_timespec ); 20079d0: f8 1f bf e8 ldd [ %fp + -24 ], %i4 static inline void _Timestamp64_implementation_To_timespec( const Timestamp64_Control *_timestamp, struct timespec *_timespec ) { _timespec->tv_sec = (time_t) (*_timestamp / 1000000000L); 20079d4: 94 10 20 00 clr %o2 20079d8: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20079dc: 90 10 00 1c mov %i4, %o0 20079e0: 96 12 e2 00 or %o3, 0x200, %o3 20079e4: 40 00 4b 8a call 201a80c <__divdi3> 20079e8: 92 10 00 1d mov %i5, %o1 _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20079ec: 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); 20079f0: d2 27 bf f4 st %o1, [ %fp + -12 ] _timespec->tv_nsec = (long) (*_timestamp % 1000000000L); 20079f4: 17 0e e6 b2 sethi %hi(0x3b9ac800), %o3 20079f8: 90 10 00 1c mov %i4, %o0 20079fc: 96 12 e2 00 or %o3, 0x200, %o3 2007a00: 40 00 4c 69 call 201aba4 <__moddi3> 2007a04: 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 ) ) 2007a08: 90 07 bf e0 add %fp, -32, %o0 2007a0c: d2 27 bf f8 st %o1, [ %fp + -8 ] 2007a10: 40 00 0f eb call 200b9bc <_Timespec_Less_than> 2007a14: 92 07 bf f4 add %fp, -12, %o1 2007a18: 80 8a 20 ff btst 0xff, %o0 2007a1c: 12 80 00 31 bne 2007ae0 2007a20: 92 07 bf e0 add %fp, -32, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2007a24: 90 07 bf f4 add %fp, -12, %o0 2007a28: 40 00 0f f7 call 200ba04 <_Timespec_Subtract> 2007a2c: 94 10 00 09 mov %o1, %o2 2007a30: 92 10 00 18 mov %i0, %o1 2007a34: 11 00 80 7e sethi %hi(0x201f800), %o0 2007a38: 94 07 bf fc add %fp, -4, %o2 2007a3c: 40 00 09 2a call 2009ee4 <_Objects_Get> 2007a40: 90 12 20 90 or %o0, 0x90, %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 ) { 2007a44: c2 07 bf fc ld [ %fp + -4 ], %g1 2007a48: 80 a0 60 00 cmp %g1, 0 2007a4c: 02 bf ff a0 be 20078cc 2007a50: b0 10 00 08 mov %o0, %i0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2007a54: 40 00 25 66 call 2010fec <__errno> 2007a58: b0 10 3f ff mov -1, %i0 2007a5c: 82 10 20 16 mov 0x16, %g1 2007a60: c2 22 00 00 st %g1, [ %o0 ] } 2007a64: 81 c7 e0 08 ret 2007a68: 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 ); 2007a6c: 40 00 11 3f call 200bf68 <_Watchdog_Remove> 2007a70: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2007a74: 80 a6 e0 00 cmp %i3, 0 2007a78: 02 80 00 0b be 2007aa4 2007a7c: c2 07 bf d8 ld [ %fp + -40 ], %g1 *ovalue = ptimer->timer_data; 2007a80: c2 06 20 54 ld [ %i0 + 0x54 ], %g1 2007a84: c2 26 c0 00 st %g1, [ %i3 ] 2007a88: c2 06 20 58 ld [ %i0 + 0x58 ], %g1 2007a8c: c2 26 e0 04 st %g1, [ %i3 + 4 ] 2007a90: c2 06 20 5c ld [ %i0 + 0x5c ], %g1 2007a94: c2 26 e0 08 st %g1, [ %i3 + 8 ] 2007a98: c2 06 20 60 ld [ %i0 + 0x60 ], %g1 2007a9c: c2 26 e0 0c st %g1, [ %i3 + 0xc ] /* The new data are set */ ptimer->timer_data = normalize; 2007aa0: c2 07 bf d8 ld [ %fp + -40 ], %g1 2007aa4: c2 26 20 54 st %g1, [ %i0 + 0x54 ] 2007aa8: c2 07 bf dc ld [ %fp + -36 ], %g1 2007aac: c2 26 20 58 st %g1, [ %i0 + 0x58 ] 2007ab0: c2 07 bf e0 ld [ %fp + -32 ], %g1 2007ab4: c2 26 20 5c st %g1, [ %i0 + 0x5c ] 2007ab8: c2 07 bf e4 ld [ %fp + -28 ], %g1 2007abc: c2 26 20 60 st %g1, [ %i0 + 0x60 ] /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2007ac0: 82 10 20 04 mov 4, %g1 2007ac4: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] /* Returns with success */ _Thread_Enable_dispatch(); 2007ac8: 40 00 0c ea call 200ae70 <_Thread_Enable_dispatch> 2007acc: b0 10 20 00 clr %i0 return 0; 2007ad0: 81 c7 e0 08 ret 2007ad4: 81 e8 00 00 restore } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2007ad8: 22 bf ff 6b be,a 2007884 2007adc: c8 06 80 00 ld [ %i2 ], %g4 if (flags == TIMER_ABSTIME) { struct timespec now; _TOD_Get( &now ); /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) rtems_set_errno_and_return_minus_one( EINVAL ); 2007ae0: 40 00 25 43 call 2010fec <__errno> 2007ae4: b0 10 3f ff mov -1, %i0 2007ae8: 82 10 20 16 mov 0x16, %g1 2007aec: c2 22 00 00 st %g1, [ %o0 ] 2007af0: 81 c7 e0 08 ret 2007af4: 81 e8 00 00 restore =============================================================================== 02007a88 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2007a88: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2007a8c: 3b 00 80 84 sethi %hi(0x2021000), %i5 2007a90: ba 17 60 38 or %i5, 0x38, %i5 ! 2021038 <_POSIX_signals_Ualarm_timer> 2007a94: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2007a98: 80 a0 60 00 cmp %g1, 0 2007a9c: 02 80 00 24 be 2007b2c 2007aa0: 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 ); 2007aa4: 40 00 10 e2 call 200be2c <_Watchdog_Remove> 2007aa8: 90 10 00 1d mov %i5, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2007aac: 90 02 3f fe add %o0, -2, %o0 2007ab0: 80 a2 20 01 cmp %o0, 1 2007ab4: 08 80 00 26 bleu 2007b4c <== ALWAYS TAKEN 2007ab8: 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 ) { 2007abc: 80 a7 20 00 cmp %i4, 0 2007ac0: 02 80 00 19 be 2007b24 2007ac4: 37 00 03 d0 sethi %hi(0xf4000), %i3 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2007ac8: 90 10 00 1c mov %i4, %o0 2007acc: 40 00 4e e1 call 201b650 <.udiv> 2007ad0: 92 16 e2 40 or %i3, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007ad4: 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; 2007ad8: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2007adc: 40 00 4f 89 call 201b900 <.urem> 2007ae0: 90 10 00 1c mov %i4, %o0 2007ae4: 87 2a 20 07 sll %o0, 7, %g3 2007ae8: 82 10 00 08 mov %o0, %g1 2007aec: 85 2a 20 02 sll %o0, 2, %g2 2007af0: 84 20 c0 02 sub %g3, %g2, %g2 2007af4: 82 00 80 01 add %g2, %g1, %g1 2007af8: 83 28 60 03 sll %g1, 3, %g1 ticks = _Timespec_To_ticks( &tp ); 2007afc: 90 07 bf f8 add %fp, -8, %o0 2007b00: 40 00 0f 57 call 200b85c <_Timespec_To_ticks> 2007b04: c2 27 bf fc st %g1, [ %fp + -4 ] if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2007b08: 40 00 0f 55 call 200b85c <_Timespec_To_ticks> 2007b0c: 90 07 bf f8 add %fp, -8, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b10: 92 10 00 1d mov %i5, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007b14: d0 27 60 0c st %o0, [ %i5 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007b18: 11 00 80 81 sethi %hi(0x2020400), %o0 2007b1c: 40 00 10 62 call 200bca4 <_Watchdog_Insert> 2007b20: 90 12 23 e0 or %o0, 0x3e0, %o0 ! 20207e0 <_Watchdog_Ticks_chain> } return remaining; } 2007b24: 81 c7 e0 08 ret 2007b28: 81 e8 00 00 restore Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007b2c: 03 00 80 1e sethi %hi(0x2007800), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2007b30: c0 27 60 08 clr [ %i5 + 8 ] the_watchdog->routine = routine; 2007b34: 82 10 62 5c or %g1, 0x25c, %g1 the_watchdog->id = id; 2007b38: c0 27 60 20 clr [ %i5 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007b3c: c2 27 60 1c st %g1, [ %i5 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2007b40: c0 27 60 24 clr [ %i5 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2007b44: 10 bf ff de b 2007abc 2007b48: 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); 2007b4c: c4 07 60 0c ld [ %i5 + 0xc ], %g2 2007b50: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2007b54: d0 07 60 14 ld [ %i5 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2007b58: 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); 2007b5c: 90 02 00 02 add %o0, %g2, %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2007b60: 40 00 0f 2a call 200b808 <_Timespec_From_ticks> 2007b64: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2007b68: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2007b6c: 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; 2007b70: 85 28 60 03 sll %g1, 3, %g2 2007b74: 87 28 60 08 sll %g1, 8, %g3 2007b78: 84 20 c0 02 sub %g3, %g2, %g2 remaining += tp.tv_nsec / 1000; 2007b7c: 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; 2007b80: b1 28 a0 06 sll %g2, 6, %i0 2007b84: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2007b88: 40 00 4e b4 call 201b658 <.div> 2007b8c: 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; 2007b90: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2007b94: 10 bf ff ca b 2007abc 2007b98: b0 02 00 18 add %o0, %i0, %i0